brim | powerful desktop application | Learning library

[error screenshot][1]I was trying a flutter exercise and whenever I was trying to add the conditionals I came up with the following error:

The following RangeError was thrown building StoryPage(dirty, state: _StoryPageState#a4166):

RangeError (index): Invalid value: Not in inclusive range 0..5: -5

the following are the codes:

I am learning php and want to combine certain key values of 3 related json files into one. My goal is to print all of the bookings with some additional values from the sites and trucks files.

1. bookings - https://www.bnefoodtrucks.com.au/api/1/bookings
2. sites - https://www.bnefoodtrucks.com.au/api/1/sites
3. trucks - https://www.bnefoodtrucks.com.au/api/1/trucks

The first file contains values in the following format

I have this dataset:

I am trying to render a Component and getting error collections.map is not a function. below is the attached file of my SHOP_DATA and CollectionOverview. I am importing data from the SHOP_DATA file and in other components it's working fine. I am also getting error like Cannot read property 'toUpperCase' of undefined.

I would like to implement functionality for being able to search a QPlainTextEdit for a query string, and display all matched lines in a table. Selecting a row in the table should move the cursor to the correct line in the document.

Below is a working example that finds all matches and displays them in a table. How can I get to the selected line number in the string that the plaintextedit holds? I could instead use the match.capturedEnd() and match.capturedStart() to show the matches, but line numbers are a more intuitive thing to think of, rather than the character index matches.

How to return choice1Destination as an Int when user press the choice1 button or return choice2Destination when user press the choice2 button?

I created a 3D model with Zdog which resizes based on the size of the screen. This works as expected:

I have just recently learned about B+trees, after asking How to build a tree array into which / out of which items can be spliced, which only allows arrays of 1, 2, 4, 8, 16, or 32 items?, and seeing a wonderful answer implementing the B+tree according to the constraints. To summarize, basically that question was looking for a tree-like structure that we could treat as an array (find by index, remove at index, insert at index, etc.). In addition, the arrays that implement the tree nodes can only contain powers of 2 number of elements, up to 32 items (1, 2, 4, 8, 16, or 32). Additionally, they should be relatively compacted as the answer showed, essentially making sure that every node was filled to the brim with 32 items before creating new sub arrays (i.e. so you don't end up with a bunch of 16-item arrays).

The answer is kind of complex and I am still picking it apart. But as I master the inner details of it, I would like to see how a "real B+ search tree" would look in comparison. That is, a B+tree that actually has keys and that you treat sort of like a hash table (find by key, remove by key, insert with key, etc.). Whereas the other one was by index, this would be by key. Ideally arbitrary keys (perhaps with a getKey function), or just string or integer keys.

So I'm wondering what needs to be modified in that original answer, copied here:

i have an array called shop data . it include a data for hats , sneakers , jackets , men and womens . it should include the name , price and image of only first 4 items of of every kind. I mean first 4 types of hats, 4 types of jackets, etc