Databases
StackOverflow2013
Usersdbo
USqaz
 

Note that there are some explanatory texts on larger screens.

plurals
  1. USqaz
    primarykey
    data
    text
    plurals
    1. This table or related slice is empty.
    1. POHow do I make my BigInt and BigFraction classes interact with fundamental data types in C++
      singulars
      1. PTQuestion
    2. POIs unsigned char('0') legal C++
      singulars
      1. PTQuestion
    3. POHow can I get page numbers to link to the table of contents in latex?
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. COI'm a little surprised this isn't a more common problem. For example when dealing with Tree based data structures, it's easy to imagine a lopsided tree with over 10000 nodes down one side could occur. Recursion seems like a good way to iterate through the tree, but stack overflow will occur. You may not know beforehand it will end up lopsided but I would've thought you would want to test you're iteration didn't cause an overflow which is a possibility.
      singulars
      1. PO
      1. USqaz
    2. CO@Neil Butterworth: Sorry missed your comment first time around. Yeah I do worry about stack overflow in qsort (I implemented my own, though speed wasn't an issue so I could've implemented a slower sorting algorithm) I like every eventuality to be covered as best as I can. I often would like to write clear code which searches a large space via recursion. However, the default limit of 10000 nested calls is far too small. Often I can spot stack overflow has occured, and choose to implement my own stack. However I assumed there would be some error thrown or displayed when it happened.
      singulars
      1. PO
      1. USqaz
    3. CO@quixoto my issue isn't that there are memory limitations, but I expected you should be able to squeeze the most of it much like the heap. I don't like the idea of just setting a limit and hoping that under all circumstances this will stop overflow from happening. I imagine there could be situations where the bound should be theoretically set very low, but if you could keep track of the amount allocated in practice you could search much further than the worst case scenario.
      singulars
      1. PO
      1. USqaz
 

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