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. POUsing finite automata as keys to a container
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USRafał Dowgird
    1. USRafał Dowgird
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POUsing finite automata as keys to a container
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTAcceptedByOriginator
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COAccepted this because it covers the transform from the minimized automata to the canonical comparable/hashable form I need. Funny how sometimes the thing that gives you the big headache is what you later realise was the easy bit all along. Renumber the states, sort the transition table, what's so hard?
      singulars
      1. PO
      1. USSteve314
    2. COI wish I could upvote and accept this today. I have a certain nervousness about revisiting Hopcroft, because of the work it took to figure it out from incomplete fragments of information in the first place. That's why I only got back to it today. After a fairly short analysis, I realised that the total number of tweaks needed is a grand total of zero - my minimisation code already generates a partition of the states in a safe canonical order. I might stable-sort that order based on node properties to get start nodes reliably at the start etc, but all the real work was done a long time ago.
      singulars
      1. PO
      1. USSteve314
    3. COIn summary, phase 1 generates an initial partition of states based on properties of nodes. As a happy accident, this uses an ordered container as working storage, and generates a safely ordered partition. The meat of Hopcrofts algorithm further partitions based on edges. It messes up the neat ordering a little - but still gives as good a canonical ordering as any. All I really need to do is generate the output a little differently based on that partitioning.
      singulars
      1. PO
      1. USSteve314
 

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