Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    singulars
    1. This table or related slice is empty.
    1. POB+ tree implementation, * * vs *
      singulars
      1. PTQuestion
    1. PTAnswer
    1. This table or related slice is empty.
    1. USj_random_hacker
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COBut, isn't doing it that way the same as doing the pointer arithmetic, dereferncing the result of the arithmetic, and then retrieving the this pointer of the Node? Also, I only need to do insertions to the tree all in one rush, in fact there will be about 2.557 billion insert calls with the current data set (Though due to page structure only about 255,700 buckets). Since the tree is only of order 256 there is going to be a lot of splitting in that initial rush, so, wouldn't we benefit from the increased ease of resizing the arrays?
      singulars
      1. PO
      1. USJames Matta
    2. COI'm not certain what you mean exactly -- the two code snippets I posted are functionally *identical* in every respect, and exactly the same code will be generated for them. The `&` in the 2nd snippet prevents the pointer from actually being dereferenced -- only the pointer arithmetic occurs to produce the address as a final result. (And you realise that your `**` version also does the same pointer arithmetic, right? And then does an additional pointer dereference.) Also, at no stage is any `this` pointer involved here, I'm confused about what you mean there.
      singulars
      1. PO
      1. USj_random_hacker
    3. COWell I misunderstood what was happening with the &(something[index]) I thought it performed the dereference then had to go back to find the pointer to the struct. What about the effect during insertions though? Not having to reallocate and copy every node in the array that needs to be resized?
      singulars
      1. PO
      1. USJames Matta
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload