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. POBest approach to continuously scan for a string in a streaming buffer
      singulars
      1. PTQuestion
    1. PTAnswer
    1. This table or related slice is empty.
    1. USjunix
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POBest approach to continuously scan for a string in a streaming buffer
      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. VTAcceptedByOriginator
    1. COThis non-backtracking answer works rather better for the needle "TOKEN", which contains no repeated letters, than it does for other needles. For example it doesn't find the needle "AAB" in the haystack "AAAB", because when it hits the third A it sets `pos` to zero (because it expects a B) and doesn't realize that it has already seen an initial substring of the needle. Of course it's possible to build a finite state machine for any given needle (so if you know the needle now, this might be a good option). But the code to build that machine at runtime is *probably* overkill.
      singulars
      1. PO
      1. USSteve Jessop
    2. CO@SteveJessop Isn't this only an issue for the start letter? Anyway +1 for pointing out this issue. Actually you could build a non deterministic machine having multiple versions of the counter while running through your word. (Would make the implementation a bit more complicated of course)
      singulars
      1. PO
      1. USjunix
    3. COyeah, I think it has to involve the first letter. The failure is when some initial segment of the needle occurs elsewhere (and hence gets discarded by the reset), implying that the first letter must occur elsewhere as part of that initial segment. And agreed, you can easily do it using a number of counters equal to the number of bytes that you would have to buffer, if you buffered it. If the questioner wants to do anything clever then there is *plenty* of literature on the subject :-)
      singulars
      1. PO
      1. USSteve Jessop
 

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