StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
9872225
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2012-03-26T12:36:04.450
FavoriteCount
0
LastActivityDate
2012-03-26T15:40:24.140
LastEditDate
2012-03-26T15:40:24.140
LastEditorUserId
149530
OwnerUserId
149530
ParentId
9869618
PostTypeId
2
Score
1
ViewCount
0
LastEditorDisplayName
text
Body
Your jump table constructing function simply does not check the needle for prefixes. We want to be able to look up, for each position in the needle, the length of the longest possible proper prefix of the needle leading up to (but not including) that position, other than the full prefix starting at <code>needle[0]</code> that just failed to match; this is how far we have to backtrack in finding the next match. Hence each entry in the jump table (say, <code>table[i]</code>) is exactly the length of the longest possible proper prefix of the needle which is also a prefix of the substring ending at <code>needle[i - 1]</code>. The first two entries in the jump table are -1 and 0, since a) a mismatch at the start of the pattern does not trigger backtracking (or, in other words, a prefix of zero length cannot have any proper prefixes or suffixes) and b) the empty string is considered to be of length 0. For more details please look at <a href="http://en.wikipedia.org/wiki/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm" rel="nofollow">wikipedia</a> or an algorithms textbook. The code to accomplish the above is: <pre><code>int *build_jump_table(const char * target) { if(!target) return NULL; int *table = new int[strlen(target) + 1]; if(!table) return NULL; table[0] = -1; /* unused by the matcher, just used here */ for(int i = 0; target[i] != '\0'; i++) { table[i+1] = table[i] + 1; while(table[i+1] > 0 && target[i] != target[table[i+1] - 1]) { table[i + 1] = table[table[i + 1] - 1] + 1; } } return table; } </code></pre> which is quite verbose, and can be simplified a lot when you understand the concept behind the jump table.
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POKMP string matching algorithm:Auxillary array output
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USMichael Foukarakis
UserOwnerUserId
1. USMichael Foukarakis
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. POKMP string matching algorithm:Auxillary array output
 singulars
 PostTypePostTypeId
 PTQuestion
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
2. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTAcceptedByOriginator
CommentsPostId
1. This table or related slice is empty.

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.