phobos ~master (2024-10-03T07:50:27Z)

indexOf

std string

Searches for character in range.

  1. ptrdiff_t indexOf(Range s, dchar c, CaseSensitive cs)
  2. ptrdiff_t indexOf(const(C)[] s, dchar c, CaseSensitive cs)
    ptrdiff_t
    indexOf
    (
    C
    )
    (
    scope const(C)[] s
    ,
    dchar c
    ,
    CaseSensitive cs = Yes.caseSensitive
    )
    if (
    isSomeChar!C
    )
  3. ptrdiff_t indexOf(Range s, dchar c, size_t startIdx, CaseSensitive cs)
  4. ptrdiff_t indexOf(const(C)[] s, dchar c, size_t startIdx, CaseSensitive cs)
  5. ptrdiff_t indexOf(Range s, const(Char)[] sub)
  6. ptrdiff_t indexOf(Range s, const(Char)[] sub, CaseSensitive cs)
  7. ptrdiff_t indexOf(const(Char1)[] s, const(Char2)[] sub, size_t startIdx)
  8. ptrdiff_t indexOf(const(Char1)[] s, const(Char2)[] sub, size_t startIdx, CaseSensitive cs)

Parameters

s const(C)[]

string or InputRange of characters to search in correct UTF format

c dchar

character to search for

cs CaseSensitive

Yes.caseSensitive or No.caseSensitive

Return Value

Type: ptrdiff_t

the index of the first occurrence of c in s with respect to the start index startIdx. If c is not found, then -1 is returned. If c is found the value of the returned index is at least startIdx. If the parameters are not valid UTF, the result will still be in the range [-1 .. s.length], but will not be reliable otherwise.

Throws

If the sequence starting at startIdx does not represent a well formed codepoint, then a std.utf.UTFException may be thrown.

Examples

import std.typecons : No;

string s = "Hello World";
assert(indexOf(s, 'W') == 6);
assert(indexOf(s, 'Z') == -1);
assert(indexOf(s, 'w', No.caseSensitive) == 6);
import std.typecons : No;

string s = "Hello World";
assert(indexOf(s, 'W', 4) == 6);
assert(indexOf(s, 'Z', 100) == -1);
assert(indexOf(s, 'w', 3, No.caseSensitive) == 6);

See Also

std.algorithm.searching.countUntil

Meta

Source

See Implementation

std string aliasesclassesfunctions

Page generated by adrdox