One simple example is adding up the values of each character in the substring.

It's a way of finding a substring in a buffer.

The point is you've only had to send a reference, not the actual substring.

Check if a string of length is a substring in time.

Advance to the next token and return it as a substring.

A prefix can be seen as a special case of a substring.

It is today like the most efficient way of finding a substring in a longer buffer.

If the substring is not found, returns one less than the base, ordinarily -1.

If self is the null substring, then the statement has no effect.

Or, if not the same string, maybe even we would hit on the same substring.

A substring must not have a length of zero.

Its purpose is to assign a substring in the source to the destination.

A substring is selected simply by giving the first and last character positions of the extract.

However, by convention, such an object is considered to be a substring rather than an array element.

A character substring can be referenced, assigned values and named.

Each edge is labeled with a non-empty substring of S.

Now, before you say any more, why would you want to find a substring in a buffer?

Checks content of Web page by searching for specified substring.

If a character position outside of the substring has a value previously assigned, it remains unchanged.

If e1 exceeds e2, the substring has length zero.

An intrinsic function specifying the starting position of a substring inside a string.

If the items won't fit on the screen, the user is asked to enter a substring as a clue.

With each iteration, the starting point of the substring moves one character to the right, making the message appear to move to the left.

Let further denote the substring of ranging from to .

The segmental content is usually a left substring of that of the given name.