mirror of
https://github.com/dlang/phobos.git
synced 2025-04-29 14:40:30 +03:00
3537 lines
87 KiB
D
3537 lines
87 KiB
D
// Written in the D programming language.
|
|
|
|
/**
|
|
String handling functions. Objects of types $(D _string), $(D
|
|
wstring), and $(D dstring) are value types and cannot be mutated
|
|
element-by-element. For using mutation during building strings, use
|
|
$(D char[]), $(D wchar[]), or $(D dchar[]). The $(D *_string) types
|
|
are preferable because they don't exhibit undesired aliasing, thus
|
|
making code more robust.
|
|
|
|
Macros: WIKI = Phobos/StdString
|
|
|
|
Copyright: Copyright Digital Mars 2007-.
|
|
|
|
License: $(WEB boost.org/LICENSE_1_0.txt, Boost License 1.0).
|
|
|
|
Authors: $(WEB digitalmars.com, Walter Bright), $(WEB erdani.org,
|
|
Andrei Alexandrescu)
|
|
|
|
Source: $(PHOBOSSRC std/_string.d)
|
|
|
|
$(B $(RED IMPORTANT NOTE:)) Beginning with version 2.052, the
|
|
following symbols have been generalized beyond strings and moved to
|
|
different modules. This action was prompted by the fact that
|
|
generalized routines belong better in other places, although they
|
|
still work for strings as expected. In order to use moved symbols, you
|
|
will need to import the respective modules as follows:
|
|
|
|
$(BOOKTABLE ,
|
|
|
|
$(TR $(TH Symbol) $(TH Comment))
|
|
|
|
$(TR $(TD $(D cmp)) $(TD Moved to $(XREF algorithm, cmp) and
|
|
generalized to work for all input ranges and accept a custom
|
|
predicate.))
|
|
|
|
$(TR $(TD $(D count)) $(TD Moved to $(XREF algorithm, count) and
|
|
generalized to accept a custom predicate.))
|
|
|
|
$(TR $(TD $(D replace)) $(TD Moved to $(XREF array, replace).))
|
|
|
|
$(TR $(TD $(D ByCodeUnit)) $(TD Removed.))
|
|
|
|
$(TR $(TD $(D insert)) $(TD Use $(XREF array, insert) instead.))
|
|
|
|
$(TR $(TD $(D join)) $(TD Use $(XREF array, join) instead.))
|
|
|
|
$(TR $(TD $(D repeat)) $(TD Use $(XREF array, replicate) instead.))
|
|
|
|
$(TR $(TD $(D replace)) $(TD Use $(XREF array, replace) instead.))
|
|
|
|
$(TR $(TD $(D replaceSlice)) $(TD Use $(XREF array, replace) instead.))
|
|
|
|
$(TR $(TD $(D split)) $(TD Use $(XREF array, split) instead.))
|
|
)
|
|
|
|
*/
|
|
module std.string;
|
|
|
|
//debug=string; // uncomment to turn on debugging printf's
|
|
|
|
import core.exception : onRangeError;
|
|
import core.vararg, core.stdc.stdio, core.stdc.stdlib,
|
|
core.stdc.string/*, std.algorithm*/,
|
|
std.conv, std.ctype, std.encoding, std.exception, std.format,
|
|
std.functional, std.metastrings, std.range, std.regex, std.stdio,
|
|
std.traits, std.typetuple, std.uni, std.utf;
|
|
public import std.algorithm : startsWith, endsWith, cmp, count;
|
|
public import std.array : join, split;
|
|
|
|
version(Windows) extern (C)
|
|
{
|
|
size_t wcslen(in wchar *);
|
|
int wcscmp(in wchar *, in wchar *);
|
|
}
|
|
|
|
/* ************* Exceptions *************** */
|
|
|
|
/// Thrown on errors in string functions.
|
|
typedef Exception StringException;
|
|
|
|
/* ************* Constants *************** */
|
|
|
|
immutable char[16] hexdigits = "0123456789ABCDEF"; /// 0..9A..F
|
|
immutable char[10] digits = "0123456789"; /// 0..9
|
|
immutable char[8] octdigits = "01234567"; /// 0..7
|
|
immutable char[26] lowercase = "abcdefghijklmnopqrstuvwxyz";/// a..z
|
|
immutable char[52] letters = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
|
|
"abcdefghijklmnopqrstuvwxyz"; /// A..Za..z
|
|
immutable char[26] uppercase = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";/// A..Z
|
|
immutable char[6] whitespace = " \t\v\r\n\f"; /// ASCII whitespace
|
|
|
|
enum dchar LS = '\u2028'; /// UTF line separator
|
|
enum dchar PS = '\u2029'; /// UTF paragraph separator
|
|
|
|
/// Newline sequence for this system
|
|
version (Windows)
|
|
immutable char[2] newline = "\r\n";
|
|
else version (Posix)
|
|
immutable char[1] newline = "\n";
|
|
|
|
/**********************************
|
|
* Returns true if c is whitespace
|
|
*/
|
|
|
|
bool iswhite(dchar c)
|
|
{
|
|
return c <= 0x7F
|
|
? indexOf(whitespace, c) != -1
|
|
: (c == PS || c == LS);
|
|
}
|
|
|
|
/**********************************
|
|
Compare two ranges of characters lexicographically. $(D _cmp) is case
|
|
sensitive, $(D icmp) is case insensitive. $(D cmp) is aliased from
|
|
$(XREF algorithm, _cmp). $(D icmp) works like $(D cmp) but converts
|
|
both characters to lowercase prior to applying $(D pred). Technically
|
|
$(D icmp(r1, r2)) is equivalent to $(D cmp!"toUniLower(a) <
|
|
toUniLower(b)"(r1, r2)).
|
|
|
|
Returns (for $(D pred = "a < b")):
|
|
|
|
$(BOOKTABLE,
|
|
$(TR $(TD $(D < 0)) $(TD $(D s1 < s2) ))
|
|
$(TR $(TD $(D = 0)) $(TD $(D s1 == s2)))
|
|
$(TR $(TD $(D > 0)) $(TD $(D s1 > s2)))
|
|
)
|
|
|
|
*/
|
|
|
|
int icmp(alias pred = "a < b", S1, S2)(S1 s1, S2 s2)
|
|
if (is(Unqual!(ElementType!S1) == dchar) && is(Unqual!(ElementType!S2) == dchar))
|
|
{
|
|
enum isLessThan = is(pred : string) && pred == "a < b";
|
|
foreach (e; zip(s1, s2))
|
|
{
|
|
dchar c1 = toUniLower(e[0]), c2 = toUniLower(e[1]);
|
|
static if (isLessThan)
|
|
{
|
|
if (c1 != c2) return cast(int) c1 - cast(int) c2;
|
|
}
|
|
else
|
|
{
|
|
if (binaryFun!pred(c1, c2)) return -1;
|
|
if (binaryFun!pred(c2, c1)) return 1;
|
|
}
|
|
}
|
|
|
|
static if (s1.length.sizeof == int.sizeof)
|
|
return s1.length - s2.length;
|
|
else
|
|
return s1.length > s2.length ? 1 : s1.length < s2.length ? -1 : 0;
|
|
}
|
|
|
|
unittest
|
|
{
|
|
assert(icmp("Ü", "ü") == 0, "Über failure");
|
|
|
|
sizediff_t result;
|
|
|
|
debug(string) printf("string.icmp.unittest\n");
|
|
result = icmp("abc", "abc");
|
|
assert(result == 0);
|
|
result = icmp("ABC", "abc");
|
|
assert(result == 0);
|
|
// result = icmp(null, null);// Commented out since icmp()
|
|
// assert(result == 0); // has become templated.
|
|
result = icmp("", "");
|
|
assert(result == 0);
|
|
result = icmp("abc", "abcd");
|
|
assert(result < 0);
|
|
result = icmp("abcd", "abc");
|
|
assert(result > 0);
|
|
result = icmp("abc", "abd");
|
|
assert(result < 0);
|
|
result = icmp("bbc", "abc");
|
|
assert(result > 0);
|
|
result = icmp("abc", "abc"w);
|
|
assert (result == 0);
|
|
result = icmp("ABC"w, "abc");
|
|
assert (result == 0);
|
|
result = icmp("", ""w);
|
|
assert (result == 0);
|
|
result = icmp("abc"w, "abcd");
|
|
assert(result < 0);
|
|
result = icmp("abcd", "abc"w);
|
|
assert(result > 0);
|
|
result = icmp("abc", "abd");
|
|
assert(result < 0);
|
|
result = icmp("bbc"w, "abc");
|
|
assert(result > 0);
|
|
result = icmp("aaa", "aaaa"d);
|
|
assert(result < 0);
|
|
result = icmp("aaaa"w, "aaa"d);
|
|
assert(result > 0);
|
|
result = icmp("aaa"d, "aaa"w);
|
|
assert(result == 0);
|
|
}
|
|
|
|
/*********************************
|
|
* Convert array of chars $(D s[]) to a C-style 0-terminated string.
|
|
* $(D s[]) must not contain embedded 0's. If $(D s) is $(D null) or
|
|
* empty, a string containing only $(D '\0') is returned.
|
|
*/
|
|
|
|
immutable(char)* toStringz(const(char)[] s)
|
|
in
|
|
{
|
|
// The assert below contradicts the unittests!
|
|
//assert(memchr(s.ptr, 0, s.length) == null,
|
|
//text(s.length, ": `", s, "'"));
|
|
}
|
|
out (result)
|
|
{
|
|
if (result)
|
|
{
|
|
auto slen = s.length;
|
|
while (slen > 0 && s[slen-1] == 0) --slen;
|
|
assert(strlen(result) == slen);
|
|
assert(memcmp(result, s.ptr, slen) == 0);
|
|
}
|
|
}
|
|
body
|
|
{
|
|
/+ Unfortunately, this isn't reliable.
|
|
We could make this work if string literals are put
|
|
in read-only memory and we test if s[] is pointing into
|
|
that.
|
|
|
|
/* Peek past end of s[], if it's 0, no conversion necessary.
|
|
* Note that the compiler will put a 0 past the end of static
|
|
* strings, and the storage allocator will put a 0 past the end
|
|
* of newly allocated char[]'s.
|
|
*/
|
|
char* p = &s[0] + s.length;
|
|
if (*p == 0)
|
|
return s;
|
|
+/
|
|
|
|
// Need to make a copy
|
|
auto copy = new char[s.length + 1];
|
|
copy[0..s.length] = s;
|
|
copy[s.length] = 0;
|
|
|
|
return assumeUnique(copy).ptr;
|
|
}
|
|
|
|
/// Ditto
|
|
immutable(char)* toStringz(string s)
|
|
{
|
|
if (s.empty) return "".ptr;
|
|
/* Peek past end of s[], if it's 0, no conversion necessary.
|
|
* Note that the compiler will put a 0 past the end of static
|
|
* strings, and the storage allocator will put a 0 past the end
|
|
* of newly allocated char[]'s.
|
|
*/
|
|
immutable p = s.ptr + s.length;
|
|
// Is p dereferenceable? A simple test: if the p points to an
|
|
// address multiple of 4, then conservatively assume the pointer
|
|
// might be pointing to a new block of memory, which might be
|
|
// unreadable. Otherwise, it's definitely pointing to valid
|
|
// memory.
|
|
if ((cast(size_t) p & 3) && *p == 0)
|
|
return s.ptr;
|
|
return toStringz(cast(const char[]) s);
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.toStringz.unittest\n");
|
|
|
|
auto p = toStringz("foo");
|
|
assert(strlen(p) == 3);
|
|
const(char) foo[] = "abbzxyzzy";
|
|
p = toStringz(foo[3..5]);
|
|
assert(strlen(p) == 2);
|
|
|
|
string test = "";
|
|
p = toStringz(test);
|
|
assert(*p == 0);
|
|
|
|
test = "\0";
|
|
p = toStringz(test);
|
|
assert(*p == 0);
|
|
|
|
test = "foo\0";
|
|
p = toStringz(test);
|
|
assert(p[0] == 'f' && p[1] == 'o' && p[2] == 'o' && p[3] == 0);
|
|
}
|
|
|
|
/**
|
|
Flag indicating whether a search is case-sensitive.
|
|
*/
|
|
enum CaseSensitive { no, yes }
|
|
|
|
/**
|
|
$(D indexOf): find first occurrence of c in string s. $(D
|
|
lastIndexOf): find last occurrence of c in string s. $(D
|
|
CaseSensitive.yes) means the searches are case sensitive.
|
|
|
|
Returns: Index in $(D s) where $(D c) is found, -1 if not found.
|
|
*/
|
|
sizediff_t
|
|
indexOf(Char)(in Char[] s, dchar c, CaseSensitive cs = CaseSensitive.yes)
|
|
if (isSomeChar!Char)
|
|
{
|
|
if (cs == CaseSensitive.yes)
|
|
{
|
|
static if (Char.sizeof == 1)
|
|
{
|
|
if (c <= 0x7F)
|
|
{ // Plain old ASCII
|
|
auto p = cast(char*)memchr(s.ptr, c, s.length);
|
|
if (p)
|
|
return p - cast(char *)s;
|
|
else
|
|
return -1;
|
|
}
|
|
}
|
|
|
|
// c is a universal character
|
|
foreach (int i, dchar c2; s)
|
|
{
|
|
if (c == c2)
|
|
return i;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
if (c <= 0x7F)
|
|
{ // Plain old ASCII
|
|
auto c1 = cast(char) std.ctype.tolower(c);
|
|
|
|
foreach (int i, Char c2; s)
|
|
{
|
|
auto c3 = cast(Char)std.ctype.tolower(c2);
|
|
if (c1 == c3)
|
|
return i;
|
|
}
|
|
}
|
|
else
|
|
{ // c is a universal character
|
|
auto c1 = std.uni.toUniLower(c);
|
|
|
|
foreach (int i, dchar c2; s)
|
|
{
|
|
auto c3 = std.uni.toUniLower(c2);
|
|
if (c1 == c3)
|
|
return i;
|
|
}
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.find.unittest\n");
|
|
|
|
sizediff_t i;
|
|
|
|
foreach (S; TypeTuple!(string, wstring, dstring))
|
|
{
|
|
S s = null;
|
|
i = indexOf(s, cast(dchar)'a');
|
|
assert(i == -1);
|
|
s = "def";
|
|
i = indexOf(s, cast(dchar)'a');
|
|
assert(i == -1);
|
|
s = "abba";
|
|
i = indexOf(s, cast(dchar)'a');
|
|
assert(i == 0);
|
|
s = "def";
|
|
i = indexOf(s, cast(dchar)'f');
|
|
assert(i == 2);
|
|
}
|
|
}
|
|
|
|
|
|
/******************************************
|
|
* ditto
|
|
*/
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.indexOf.unittest\n");
|
|
|
|
foreach (S; TypeTuple!(string, wstring, dstring))
|
|
{
|
|
S s = null;
|
|
auto i = indexOf(s, cast(dchar)'a', CaseSensitive.no);
|
|
assert(i == -1);
|
|
i = indexOf("def", cast(dchar)'a', CaseSensitive.no);
|
|
assert(i == -1);
|
|
i = indexOf("Abba", cast(dchar)'a', CaseSensitive.no);
|
|
assert(i == 0);
|
|
i = indexOf("def", cast(dchar)'F', CaseSensitive.no);
|
|
assert(i == 2);
|
|
|
|
string sPlts = "Mars: the fourth Rock (Planet) from the Sun.";
|
|
|
|
i = indexOf("def", cast(char)'f', CaseSensitive.no);
|
|
assert(i == 2);
|
|
|
|
i = indexOf(sPlts, cast(char)'P', CaseSensitive.no);
|
|
assert(i == 23);
|
|
i = indexOf(sPlts, cast(char)'R', CaseSensitive.no);
|
|
assert(i == 2);
|
|
}
|
|
}
|
|
|
|
// @@@BUG@@@ This declaration shouldn't be needed
|
|
//int lastIndexOf(in char[] s, in char[] c, CaseSensitive cs = CaseSensitive.yes);
|
|
|
|
/******************************************
|
|
* ditto
|
|
*/
|
|
|
|
sizediff_t lastIndexOf(Char)(const(Char)[] s, dchar c,
|
|
CaseSensitive cs = CaseSensitive.yes)
|
|
{
|
|
if (cs == CaseSensitive.yes)
|
|
{
|
|
if (c <= 0x7F || Char.sizeof == 4)
|
|
{
|
|
// Plain old ASCII or UTF32
|
|
auto i = s.length;
|
|
while (i-- != 0)
|
|
{
|
|
if (s[i] == c)
|
|
break;
|
|
}
|
|
return i;
|
|
}
|
|
|
|
// c is a universal character
|
|
auto sInit = s;
|
|
for (; !s.empty; s.popBack())
|
|
{
|
|
if (s.back == c) return s.ptr - sInit.ptr;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
if (c <= 0x7F)
|
|
{ // Plain old ASCII
|
|
immutable c1 = cast(char) std.ctype.tolower(c);
|
|
|
|
for (auto i = s.length; i-- != 0;)
|
|
{
|
|
immutable c2 = cast(char) std.ctype.tolower(s[i]);
|
|
if (c1 == c2)
|
|
return i;
|
|
}
|
|
}
|
|
else
|
|
{ // c is a universal character
|
|
immutable c1 = std.uni.toUniLower(c);
|
|
|
|
auto sInit = s;
|
|
for (; !s.empty; s.popBack())
|
|
{
|
|
if (toUniLower(s.back) == c1) return s.ptr - sInit.ptr;
|
|
}
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.rfind.unittest\n");
|
|
|
|
sizediff_t i;
|
|
|
|
i = lastIndexOf(cast(string) null, cast(dchar)'a');
|
|
assert(i == -1);
|
|
i = lastIndexOf("def", cast(dchar)'a');
|
|
assert(i == -1);
|
|
i = lastIndexOf("abba", cast(dchar)'a');
|
|
assert(i == 3);
|
|
i = lastIndexOf("def", cast(dchar)'f');
|
|
assert(i == 2);
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.irfind.unittest\n");
|
|
|
|
sizediff_t i;
|
|
|
|
i = lastIndexOf(cast(string) null, cast(dchar)'a', CaseSensitive.no);
|
|
assert(i == -1);
|
|
i = lastIndexOf("def", cast(dchar)'a', CaseSensitive.no);
|
|
assert(i == -1);
|
|
i = lastIndexOf("AbbA", cast(dchar)'a', CaseSensitive.no);
|
|
assert(i == 3);
|
|
i = lastIndexOf("def", cast(dchar)'F', CaseSensitive.no);
|
|
assert(i == 2);
|
|
|
|
string sPlts = "Mars: the fourth Rock (Planet) from the Sun.";
|
|
|
|
i = lastIndexOf("def", cast(char)'f', CaseSensitive.no);
|
|
assert(i == 2);
|
|
|
|
i = lastIndexOf(sPlts, cast(char)'M', CaseSensitive.no);
|
|
assert(i == 34);
|
|
i = lastIndexOf(sPlts, cast(char)'S', CaseSensitive.no);
|
|
assert(i == 40);
|
|
}
|
|
|
|
/**
|
|
* Returns the representation type of a string, which is the same type
|
|
* as the string except the character type is replaced by $(D ubyte),
|
|
* $(D ushort), or $(D uint) depending on the character width.
|
|
*
|
|
* Example:
|
|
----
|
|
string s = "hello";
|
|
static assert(is(typeof(representation(s)) == immutable(ubyte)[]));
|
|
----
|
|
*/
|
|
/*private*/ auto representation(Char)(Char[] s) if (isSomeChar!Char)
|
|
{
|
|
// Get representation type
|
|
static if (Char.sizeof == 1) enum t = "ubyte";
|
|
else static if (Char.sizeof == 2) enum t = "ushort";
|
|
else static if (Char.sizeof == 4) enum t = "uint";
|
|
else static assert(false); // can't happen due to isSomeChar!Char
|
|
|
|
// Get representation qualifier
|
|
static if (is(Char == immutable)) enum q = "immutable";
|
|
else static if (is(Char == const)) enum q = "const";
|
|
else static if (is(Char == shared)) enum q = "shared";
|
|
else enum q = "";
|
|
|
|
// Result type is qualifier(RepType)[]
|
|
static if (q.length)
|
|
return mixin("cast(" ~ q ~ "(" ~ t ~ ")[]) s");
|
|
else
|
|
return mixin("cast(" ~ t ~ "[]) s");
|
|
}
|
|
|
|
unittest
|
|
{
|
|
string s = "hello";
|
|
static assert(is(typeof(representation(s)) == immutable(ubyte)[]));
|
|
}
|
|
|
|
/**
|
|
$(D indexOf) find first occurrence of $(D sub[]) in string $(D s[]).
|
|
lastIndexOf find last occurrence of $(D sub[]) in string $(D s[]).
|
|
|
|
$(D CaseSensitive cs) controls whether the comparisons are case
|
|
sensitive or not.
|
|
|
|
Returns:
|
|
|
|
Index in $(D s) where $(D sub) is found, $(D -1) if not found.
|
|
*/
|
|
|
|
sizediff_t
|
|
indexOf(Char1, Char2)(const(Char1)[] s, const(Char2)[] sub,
|
|
CaseSensitive cs = CaseSensitive.yes)
|
|
if (isSomeChar!Char1 && isSomeChar!Char2)
|
|
{
|
|
const(Char1)[] balance;
|
|
if (cs == CaseSensitive.yes)
|
|
{
|
|
balance = std.algorithm.find(s, sub);
|
|
}
|
|
else
|
|
{
|
|
balance = std.algorithm.find!
|
|
((dchar a, dchar b){return toUniLower(a) == toUniLower(b);})
|
|
(s, sub);
|
|
}
|
|
return balance.empty ? -1 : balance.ptr - s.ptr;
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.find.unittest\n");
|
|
|
|
sizediff_t i;
|
|
|
|
foreach (S; TypeTuple!(string, wstring, dstring))
|
|
{
|
|
S s = null;
|
|
i = indexOf(s, "a");
|
|
assert(i == -1);
|
|
i = indexOf("def", "a");
|
|
assert(i == -1);
|
|
i = indexOf("abba", "a");
|
|
assert(i == 0);
|
|
i = indexOf("def", "f");
|
|
assert(i == 2);
|
|
i = indexOf("dfefffg", "fff");
|
|
assert(i == 3);
|
|
i = indexOf("dfeffgfff", "fff");
|
|
assert(i == 6);
|
|
}
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.ifind.unittest\n");
|
|
|
|
sizediff_t i;
|
|
|
|
foreach (S; TypeTuple!(string, wstring, dstring))
|
|
{
|
|
S s = null;
|
|
i = indexOf(s, "a", CaseSensitive.no);
|
|
assert(i == -1);
|
|
i = indexOf("def", "a", CaseSensitive.no);
|
|
assert(i == -1);
|
|
i = indexOf("abba", "a", CaseSensitive.no);
|
|
assert(i == 0, text(i));
|
|
i = indexOf("def", "f", CaseSensitive.no);
|
|
assert(i == 2);
|
|
i = indexOf("dfefffg", "fff", CaseSensitive.no);
|
|
assert(i == 3);
|
|
i = indexOf("dfeffgfff", "fff", CaseSensitive.no);
|
|
assert(i == 6);
|
|
}
|
|
|
|
string sPlts = "Mars: the fourth Rock (Planet) from the Sun.";
|
|
string sMars = "Who\'s \'My Favorite Maritian?\'";
|
|
|
|
i = indexOf(sMars, "MY fAVe", CaseSensitive.no);
|
|
assert(i == -1);
|
|
i = indexOf(sMars, "mY fAVOriTe", CaseSensitive.no);
|
|
assert(i == 7);
|
|
i = indexOf(sPlts, "mArS:", CaseSensitive.no);
|
|
assert(i == 0);
|
|
i = indexOf(sPlts, "rOcK", CaseSensitive.no);
|
|
assert(i == 17);
|
|
i = indexOf(sPlts, "Un.", CaseSensitive.no);
|
|
assert(i == 41);
|
|
i = indexOf(sPlts, sPlts, CaseSensitive.no);
|
|
assert(i == 0);
|
|
|
|
i = indexOf("\u0100", "\u0100", CaseSensitive.no);
|
|
assert(i == 0);
|
|
|
|
// Thanks to Carlos Santander B. and zwang
|
|
i = indexOf("sus mejores cortesanos. Se embarcaron en el puerto de Dubai y",
|
|
"page-break-before", CaseSensitive.no);
|
|
assert(i == -1);
|
|
}
|
|
|
|
/******************************************
|
|
* ditto
|
|
*/
|
|
|
|
sizediff_t lastIndexOf(Char1, Char2)(in Char1[] s, in Char2[] sub,
|
|
CaseSensitive cs = CaseSensitive.yes) if (isSomeChar!Char1 && isSomeChar!Char2)
|
|
{
|
|
if (cs == CaseSensitive.yes)
|
|
{
|
|
char c;
|
|
|
|
if (sub.length == 0)
|
|
return s.length;
|
|
c = sub[0];
|
|
if (sub.length == 1)
|
|
return lastIndexOf(s, c);
|
|
for (ptrdiff_t i = s.length - sub.length; i >= 0; i--)
|
|
{
|
|
if (s[i] == c)
|
|
{
|
|
if (memcmp(&s[i + 1], &sub[1], sub.length - 1) == 0)
|
|
return i;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
else
|
|
{
|
|
dchar c;
|
|
|
|
if (sub.length == 0)
|
|
return s.length;
|
|
c = sub[0];
|
|
if (sub.length == 1)
|
|
return lastIndexOf(s, c, cs);
|
|
if (c <= 0x7F)
|
|
{
|
|
c = std.ctype.tolower(c);
|
|
for (ptrdiff_t i = s.length - sub.length; i >= 0; i--)
|
|
{
|
|
if (std.ctype.tolower(s[i]) == c)
|
|
{
|
|
if (icmp(s[i + 1 .. i + sub.length], sub[1 .. sub.length]) == 0)
|
|
return i;
|
|
}
|
|
}
|
|
}
|
|
else
|
|
{
|
|
for (ptrdiff_t i = s.length - sub.length; i >= 0; i--)
|
|
{
|
|
if (icmp(s[i .. i + sub.length], sub) == 0)
|
|
return i;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
}
|
|
|
|
unittest
|
|
{
|
|
sizediff_t i;
|
|
|
|
debug(string) printf("string.lastIndexOf.unittest\n");
|
|
i = lastIndexOf("abcdefcdef", "c");
|
|
assert(i == 6);
|
|
i = lastIndexOf("abcdefcdef", "cd");
|
|
assert(i == 6);
|
|
i = lastIndexOf("abcdefcdef", "x");
|
|
assert(i == -1);
|
|
i = lastIndexOf("abcdefcdef", "xy");
|
|
assert(i == -1);
|
|
i = lastIndexOf("abcdefcdef", "");
|
|
assert(i == 10);
|
|
}
|
|
|
|
|
|
/******************************************
|
|
* ditto
|
|
*/
|
|
|
|
unittest
|
|
{
|
|
sizediff_t i;
|
|
|
|
debug(string) printf("string.lastIndexOf.unittest\n");
|
|
i = lastIndexOf("abcdefCdef", "c", CaseSensitive.no);
|
|
assert(i == 6);
|
|
i = lastIndexOf("abcdefCdef", "cD", CaseSensitive.no);
|
|
assert(i == 6);
|
|
i = lastIndexOf("abcdefcdef", "x", CaseSensitive.no);
|
|
assert(i == -1);
|
|
i = lastIndexOf("abcdefcdef", "xy", CaseSensitive.no);
|
|
assert(i == -1);
|
|
i = lastIndexOf("abcdefcdef", "", CaseSensitive.no);
|
|
assert(i == 10);
|
|
|
|
string sPlts = "Mars: the fourth Rock (Planet) from the Sun.";
|
|
string sMars = "Who\'s \'My Favorite Maritian?\'";
|
|
|
|
i = lastIndexOf("abcdefcdef", "c", CaseSensitive.no);
|
|
assert(i == 6);
|
|
i = lastIndexOf("abcdefcdef", "cd", CaseSensitive.no);
|
|
assert(i == 6);
|
|
i = lastIndexOf( "abcdefcdef", "def", CaseSensitive.no);
|
|
assert(i == 7);
|
|
|
|
i = lastIndexOf(sMars, "RiTE maR", CaseSensitive.no);
|
|
assert(i == 14);
|
|
i = lastIndexOf(sPlts, "FOuRTh", CaseSensitive.no);
|
|
assert(i == 10);
|
|
i = lastIndexOf(sMars, "whO\'s \'MY", CaseSensitive.no);
|
|
assert(i == 0);
|
|
i = lastIndexOf(sMars, sMars, CaseSensitive.no);
|
|
assert(i == 0);
|
|
}
|
|
|
|
|
|
/************************************
|
|
* Convert string s[] to lower case.
|
|
*/
|
|
|
|
S tolower(S)(S s) if (isSomeString!S)
|
|
{
|
|
foreach (i, dchar cOuter; s)
|
|
{
|
|
if (!std.uni.isUniUpper(cOuter)) continue;
|
|
auto result = s[0.. i].dup;
|
|
foreach (dchar c; s[i .. $])
|
|
{
|
|
if (std.uni.isUniUpper(c))
|
|
{
|
|
c = std.uni.toUniLower(c);
|
|
}
|
|
result ~= c;
|
|
}
|
|
return cast(S) result;
|
|
}
|
|
return s;
|
|
}
|
|
|
|
/**
|
|
Converts $(D s) to lowercase in place.
|
|
*/
|
|
|
|
void tolowerInPlace(C)(ref C[] s) if (isSomeChar!C)
|
|
{
|
|
for (size_t i = 0; i < s.length; )
|
|
{
|
|
immutable c = s[i];
|
|
if ('A' <= c && c <= 'Z')
|
|
{
|
|
s[i++] = cast(C) (c + (cast(C)'a' - 'A'));
|
|
}
|
|
else if (c > 0x7F)
|
|
{
|
|
// wide character
|
|
size_t j = i;
|
|
dchar dc = decode(s, j);
|
|
assert(j > i);
|
|
if (!std.uni.isUniUpper(dc))
|
|
{
|
|
i = j;
|
|
continue;
|
|
}
|
|
auto toAdd = to!(C[])(std.uni.toUniLower(dc));
|
|
s = s[0 .. i] ~ toAdd ~ s[j .. $];
|
|
i += toAdd.length;
|
|
}
|
|
else
|
|
{
|
|
++i;
|
|
}
|
|
}
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.tolower.unittest\n");
|
|
|
|
string s1 = "FoL";
|
|
string s2;
|
|
|
|
s2 = tolower(s1);
|
|
assert(cmp(s2, "fol") == 0, s2);
|
|
assert(s2 != s1);
|
|
|
|
char[] s3 = s1.dup;
|
|
tolowerInPlace(s3);
|
|
assert(s3 == s2, s3);
|
|
|
|
s1 = "A\u0100B\u0101d";
|
|
s2 = tolower(s1);
|
|
s3 = s1.dup;
|
|
assert(cmp(s2, "a\u0101b\u0101d") == 0);
|
|
assert(s2 !is s1);
|
|
tolowerInPlace(s3);
|
|
assert(s3 == s2, s3);
|
|
|
|
s1 = "A\u0460B\u0461d";
|
|
s2 = tolower(s1);
|
|
s3 = s1.dup;
|
|
assert(cmp(s2, "a\u0461b\u0461d") == 0);
|
|
assert(s2 !is s1);
|
|
tolowerInPlace(s3);
|
|
assert(s3 == s2, s3);
|
|
|
|
s1 = "\u0130";
|
|
s2 = tolower(s1);
|
|
s3 = s1.dup;
|
|
assert(s2 == "i");
|
|
assert(s2 !is s1);
|
|
tolowerInPlace(s3);
|
|
assert(s3 == s2, s3);
|
|
|
|
// Test on wchar and dchar strings.
|
|
assert(tolower("Some String"w) == "some string"w);
|
|
assert(tolower("Some String"d) == "some string"d);
|
|
}
|
|
|
|
/************************************
|
|
* Convert string s[] to upper case.
|
|
*/
|
|
|
|
S toupper(S)(S s) if (isSomeString!S)
|
|
{
|
|
alias typeof(s[0]) Char;
|
|
int changed;
|
|
Unqual!(Char)[] r;
|
|
|
|
foreach (i; 0 .. s.length)
|
|
{
|
|
immutable c = s[i];
|
|
if ('a' <= c && c <= 'z')
|
|
{
|
|
if (!changed)
|
|
{
|
|
r = to!(typeof(r))(s);
|
|
changed = 1;
|
|
}
|
|
r[i] = cast(Unqual!(Char)) (c - ('a' - 'A'));
|
|
}
|
|
else if (c > 0x7F)
|
|
{
|
|
foreach (size_t j, dchar dc; s[i .. $])
|
|
{
|
|
if (std.uni.isUniLower(dc))
|
|
{
|
|
dc = std.uni.toUniUpper(dc);
|
|
if (!changed)
|
|
{
|
|
r = s[0 .. i + j].dup;
|
|
changed = 2;
|
|
}
|
|
}
|
|
if (changed)
|
|
{
|
|
if (changed == 1)
|
|
{ r = r[0 .. i + j];
|
|
changed = 2;
|
|
}
|
|
std.utf.encode(r, dc);
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
return changed ? assumeUnique(r) : s;
|
|
}
|
|
|
|
/**
|
|
Converts $(D s) to uppercase in place.
|
|
*/
|
|
|
|
void toupperInPlace(C)(ref C[] s) if (isSomeChar!C)
|
|
{
|
|
for (size_t i = 0; i < s.length; )
|
|
{
|
|
immutable c = s[i];
|
|
if ('a' <= c && c <= 'z')
|
|
{
|
|
s[i++] = cast(C) (c - (cast(C)'a' - 'A'));
|
|
}
|
|
else if (c > 0x7F)
|
|
{
|
|
// wide character
|
|
size_t j = i;
|
|
dchar dc = decode(s, j);
|
|
assert(j > i);
|
|
if (!std.uni.isUniLower(dc))
|
|
{
|
|
i = j;
|
|
continue;
|
|
}
|
|
auto toAdd = to!(C[])(std.uni.toUniUpper(dc));
|
|
s = s[0 .. i] ~ toAdd ~ s[j .. $];
|
|
i += toAdd.length;
|
|
}
|
|
else
|
|
{
|
|
++i;
|
|
}
|
|
}
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.toupper.unittest\n");
|
|
|
|
string s1 = "FoL";
|
|
string s2;
|
|
char[] s3;
|
|
|
|
s2 = toupper(s1);
|
|
s3 = s1.dup; toupperInPlace(s3);
|
|
assert(s3 == s2, s3);
|
|
assert(cmp(s2, "FOL") == 0);
|
|
assert(s2 !is s1);
|
|
|
|
s1 = "a\u0100B\u0101d";
|
|
s2 = toupper(s1);
|
|
s3 = s1.dup; toupperInPlace(s3);
|
|
assert(s3 == s2);
|
|
assert(cmp(s2, "A\u0100B\u0100D") == 0);
|
|
assert(s2 !is s1);
|
|
|
|
s1 = "a\u0460B\u0461d";
|
|
s2 = toupper(s1);
|
|
s3 = s1.dup; toupperInPlace(s3);
|
|
assert(s3 == s2);
|
|
assert(cmp(s2, "A\u0460B\u0460D") == 0);
|
|
assert(s2 !is s1);
|
|
}
|
|
|
|
/********************************************
|
|
* Capitalize first character of string s[], convert rest of string s[]
|
|
* to lower case.
|
|
*/
|
|
|
|
S capitalize(S)(S s) if (isSomeString!S)
|
|
{
|
|
Unqual!(typeof(s[0]))[] r;
|
|
bool changed = 0;
|
|
|
|
foreach (size_t i, dchar c; s)
|
|
{
|
|
dchar c2;
|
|
|
|
if (i == 0)
|
|
{
|
|
c2 = std.uni.toUniUpper(c);
|
|
if (c != c2)
|
|
{
|
|
changed = 1;
|
|
r = null;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
c2 = std.uni.toUniLower(c);
|
|
if (c != c2)
|
|
{
|
|
if (!changed)
|
|
{ changed = 1;
|
|
r = s[0 .. i].dup;
|
|
}
|
|
}
|
|
}
|
|
if (changed)
|
|
std.utf.encode(r, c2);
|
|
}
|
|
return changed ? cast(S) r : s;
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.toupper.capitalize\n");
|
|
|
|
foreach (S; TypeTuple!(string, wstring, dstring, char[], wchar[], dchar[]))
|
|
{
|
|
S s1 = to!S("FoL");
|
|
S s2;
|
|
|
|
s2 = capitalize(s1);
|
|
assert(cmp(s2, "Fol") == 0);
|
|
assert(s2 !is s1);
|
|
|
|
s2 = capitalize(s1[0 .. 2]);
|
|
assert(cmp(s2, "Fo") == 0);
|
|
assert(s2.ptr == s1.ptr);
|
|
|
|
s1 = to!S("fOl");
|
|
s2 = capitalize(s1);
|
|
assert(cmp(s2, "Fol") == 0);
|
|
assert(s2 !is s1);
|
|
}
|
|
}
|
|
|
|
|
|
/********************************************
|
|
* Capitalize all words in string s[].
|
|
* Remove leading and trailing whitespace.
|
|
* Replace all sequences of whitespace with a single space.
|
|
*/
|
|
|
|
S capwords(S)(S s) if (isSomeString!S)
|
|
{
|
|
Unqual!(typeof(s[0]))[] r;
|
|
bool inword = false;
|
|
size_t istart = 0;
|
|
size_t i;
|
|
|
|
for (i = 0; i < s.length; i++)
|
|
{
|
|
switch (s[i])
|
|
{
|
|
case ' ':
|
|
case '\t':
|
|
case '\f':
|
|
case '\r':
|
|
case '\n':
|
|
case '\v':
|
|
if (inword)
|
|
{
|
|
r ~= capitalize(s[istart .. i]);
|
|
inword = false;
|
|
}
|
|
break;
|
|
|
|
default:
|
|
if (!inword)
|
|
{
|
|
if (r.length)
|
|
r ~= ' ';
|
|
istart = i;
|
|
inword = true;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
if (inword)
|
|
{
|
|
r ~= capitalize(s[istart .. i]);
|
|
}
|
|
|
|
return cast(S) r;
|
|
}
|
|
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.capwords.unittest\n");
|
|
|
|
foreach (S; TypeTuple!(string, wstring, dstring, char[], wchar[], dchar[]))
|
|
{
|
|
auto s1 = to!S("\tfoo abc(aD)* \t (q PTT ");
|
|
S s2;
|
|
|
|
s2 = capwords(s1);
|
|
//writefln("s2 = '%s'", s2);
|
|
assert(cmp(s2, "Foo Abc(ad)* (q Ptt") == 0);
|
|
}
|
|
}
|
|
|
|
/********************************************
|
|
* Repeat $(D s) for $(D n) times. This function is scheduled for
|
|
* deprecation - use $(XREF array, replicate) instead.
|
|
*/
|
|
S repeat(S)(S s, size_t n)
|
|
{
|
|
return std.array.replicate(s, n);
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.repeat.unittest\n");
|
|
|
|
foreach (S; TypeTuple!(string, wstring, dstring, char[], wchar[], dchar[]))
|
|
{
|
|
S s;
|
|
|
|
s = repeat(to!S("1234"), 0);
|
|
assert(s is null);
|
|
s = repeat(to!S("1234"), 1);
|
|
assert(cmp(s, "1234") == 0);
|
|
s = repeat(to!S("1234"), 2);
|
|
assert(cmp(s, "12341234") == 0);
|
|
s = repeat(to!S("1"), 4);
|
|
assert(cmp(s, "1111") == 0);
|
|
s = repeat(cast(S) null, 4);
|
|
assert(s is null);
|
|
}
|
|
}
|
|
|
|
/**************************************
|
|
* Split s[] into an array of lines,
|
|
* using CR, LF, or CR-LF as the delimiter.
|
|
* The delimiter is not included in the line.
|
|
*/
|
|
|
|
S[] splitlines(S)(S s)
|
|
{
|
|
size_t istart;
|
|
auto result = appender!(S[])();
|
|
|
|
foreach (i; 0 .. s.length)
|
|
{
|
|
immutable c = s[i];
|
|
if (c == '\r' || c == '\n')
|
|
{
|
|
result.put(s[istart .. i]);
|
|
istart = i + 1;
|
|
if (c == '\r' && i + 1 < s.length && s[i + 1] == '\n')
|
|
{
|
|
i++;
|
|
istart++;
|
|
}
|
|
}
|
|
}
|
|
if (istart != s.length)
|
|
{
|
|
result.put(s[istart .. $]);
|
|
}
|
|
|
|
return result.data;
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.splitlines\n");
|
|
|
|
foreach (S; TypeTuple!(string, wstring, dstring))
|
|
{
|
|
S s = "\rpeter\n\rpaul\r\njerry\n";
|
|
S[] lines;
|
|
int i;
|
|
|
|
lines = splitlines(s);
|
|
//printf("lines.length = %d\n", lines.length);
|
|
assert(lines.length == 5);
|
|
//printf("lines[0] = %llx, '%.*s'\n", lines[0], lines[0]);
|
|
assert(lines[0].length == 0);
|
|
i = cmp(lines[1], "peter");
|
|
assert(i == 0);
|
|
assert(lines[2].length == 0);
|
|
i = cmp(lines[3], "paul");
|
|
assert(i == 0);
|
|
i = cmp(lines[4], "jerry");
|
|
assert(i == 0);
|
|
|
|
s = s[0 .. s.length - 1]; // lop off trailing \n
|
|
lines = splitlines(s);
|
|
//printf("lines.length = %d\n", lines.length);
|
|
assert(lines.length == 5);
|
|
i = cmp(lines[4], "jerry");
|
|
assert(i == 0);
|
|
}
|
|
}
|
|
|
|
/*****************************************
|
|
* Strips leading or trailing whitespace, or both.
|
|
*/
|
|
|
|
String stripl(String)(String s)
|
|
{
|
|
uint i;
|
|
for (i = 0; i < s.length; i++)
|
|
{
|
|
if (!std.ctype.isspace(s[i]))
|
|
break;
|
|
}
|
|
return s[i .. s.length];
|
|
}
|
|
|
|
String stripr(String)(String s) /// ditto
|
|
{
|
|
for (auto i = s.length;;)
|
|
{
|
|
if (i == 0) return null;
|
|
--i;
|
|
if (!std.ctype.isspace(s[i]))
|
|
return s[0 .. i + 1];
|
|
}
|
|
}
|
|
|
|
String strip(String)(String s) /// ditto
|
|
{
|
|
return stripr(stripl(s));
|
|
}
|
|
|
|
unittest
|
|
{
|
|
assert(strip(" foo\t ") == "foo");
|
|
assert(strip("1") == "1");
|
|
}
|
|
|
|
// Too slow for release mode
|
|
debug unittest
|
|
{
|
|
// fails to compile with: Error: array equality comparison type
|
|
// mismatch, immutable(char)[] vs ubyte[]
|
|
version(none)
|
|
{
|
|
alias TypeTuple!(string, wstring, dstring, char[], wchar[], dchar[])
|
|
StringTypes;
|
|
alias TypeTuple!(ubyte[], int[], double[]) OtherTypes;
|
|
foreach (T1 ; StringTypes)
|
|
{
|
|
foreach (T2 ; StringTypes)
|
|
{
|
|
foreach (T3 ; OtherTypes)
|
|
{
|
|
auto a = to!(T1)("abcde"), b = to!(T2)("abcdefgh"),
|
|
c = to!(T2)("");
|
|
auto d = to!(T3)([2, 3]);
|
|
assert(startsWith(b, a));
|
|
assert(!startsWith(a, b));
|
|
assert(startsWith(b, c));
|
|
assert(startsWith(a, c));
|
|
assert(!startsWith(c, b));
|
|
assert(!startsWith(c, a));
|
|
assert(!startsWith(a, d));
|
|
assert(!startsWith(d, a));
|
|
assert(!startsWith(b, d));
|
|
assert(!startsWith(d, b));
|
|
assert(!startsWith(c, d));
|
|
assert(startsWith(d, c));
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
// Too slow for release mode
|
|
debug unittest
|
|
{
|
|
alias TypeTuple!(string, wstring, dstring, char[], wchar[], dchar[])
|
|
TestTypes;
|
|
alias TypeTuple!(ubyte[], int[], double[]) OtherTypes;
|
|
// fails to compile with: Error: array equality comparison type
|
|
// mismatch, immutable(char)[] vs ubyte[]
|
|
version(none)
|
|
{
|
|
foreach (T1 ; TestTypes)
|
|
{
|
|
foreach (T2 ; TestTypes)
|
|
{
|
|
foreach (T3 ; OtherTypes)
|
|
{
|
|
auto a = to!(T1)("efgh"), b = to!(T2)("abcdefgh"),
|
|
c = to!(T2)(""), d = to!(T3)([1, 2]);
|
|
assert(endsWith(a, a));
|
|
assert(endsWith(b, b));
|
|
// writeln(T2.stringof);
|
|
// writeln(T1.stringof);
|
|
assert(endsWith(b, a));
|
|
assert(!endsWith(a, b));
|
|
assert(endsWith(b, c));
|
|
assert(endsWith(a, c));
|
|
assert(!endsWith(c, b));
|
|
assert(!endsWith(c, a));
|
|
assert(!endsWith(a, d));
|
|
assert(!endsWith(d, a));
|
|
assert(!endsWith(b, d));
|
|
assert(!endsWith(d, b));
|
|
assert(!endsWith(c, d));
|
|
assert(endsWith(d, c));
|
|
}
|
|
}
|
|
}
|
|
foreach (T1; OtherTypes)
|
|
{
|
|
foreach (T2; OtherTypes)
|
|
{
|
|
auto a = to!(T1)([1, 2]);
|
|
auto b = to!(T2)([0, 1, 2]);
|
|
//assert(!std.string.endsWith(a, b));
|
|
// assert(endsWith(b, a));
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
/*******************************************
|
|
* Returns s[] sans trailing delimiter[], if any.
|
|
* If delimiter[] is null, removes trailing CR, LF, or CRLF, if any.
|
|
*/
|
|
|
|
C[] chomp(C)(C[] s)
|
|
{
|
|
auto len = s.length;
|
|
if (!len)
|
|
{
|
|
return s;
|
|
}
|
|
auto c = s[len - 1];
|
|
if (c == '\r') // if ends in CR
|
|
len--;
|
|
else if (c == '\n') // if ends in LF
|
|
{
|
|
len--;
|
|
if (len && s[len - 1] == '\r')
|
|
len--; // remove CR-LF
|
|
}
|
|
else
|
|
{
|
|
// no change
|
|
return s;
|
|
}
|
|
return s[0 .. len];
|
|
}
|
|
|
|
/// Ditto
|
|
C[] chomp(C, C1)(C[] s, in C1[] delimiter)
|
|
{
|
|
if (endsWith(s, delimiter))
|
|
{
|
|
return s[0 .. $ - delimiter.length];
|
|
}
|
|
return s;
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.chomp.unittest\n");
|
|
string s;
|
|
|
|
// s = chomp(null);
|
|
// assert(s is null);
|
|
s = chomp("hello");
|
|
assert(s == "hello");
|
|
s = chomp("hello\n");
|
|
assert(s == "hello");
|
|
s = chomp("hello\r");
|
|
assert(s == "hello");
|
|
s = chomp("hello\r\n");
|
|
assert(s == "hello");
|
|
s = chomp("hello\n\r");
|
|
assert(s == "hello\n");
|
|
s = chomp("hello\n\n");
|
|
assert(s == "hello\n");
|
|
s = chomp("hello\r\r");
|
|
assert(s == "hello\r");
|
|
s = chomp("hello\nxxx\n");
|
|
assert(s == "hello\nxxx");
|
|
|
|
// s = chomp(null, null);
|
|
// assert(s is null);
|
|
s = chomp("hello", "o");
|
|
assert(s == "hell");
|
|
s = chomp("hello", "p");
|
|
assert(s == "hello");
|
|
// @@@ BUG IN COMPILER, MUST INSERT CAST
|
|
s = chomp("hello", cast(string) null);
|
|
assert(s == "hello");
|
|
s = chomp("hello", "llo");
|
|
assert(s == "he");
|
|
}
|
|
|
|
/**
|
|
* If $(D_PARAM longer.startsWith(shorter)), returns $(D_PARAM
|
|
* longer[shorter.length .. $]). Otherwise, returns $(D_PARAM longer).
|
|
*/
|
|
|
|
C1[] chompPrefix(C1, C2)(C1[] longer, C2[] shorter)
|
|
{
|
|
return startsWith(longer, shorter) ? longer[shorter.length .. $]
|
|
: longer;
|
|
}
|
|
|
|
unittest
|
|
{
|
|
auto a = "abcde", b = "abcdefgh";
|
|
assert(chompPrefix(b, a) == "fgh");
|
|
assert(chompPrefix(a, b) == "abcde");
|
|
}
|
|
|
|
/***********************************************
|
|
* Returns s[] sans trailing character, if there is one.
|
|
* If last two characters are CR-LF, then both are removed.
|
|
*/
|
|
S chop(S)(S s) if (isSomeString!S)
|
|
{
|
|
auto len = s.length;
|
|
if (!len) return s;
|
|
if (len >= 2 && s[len - 1] == '\n' && s[len - 2] == '\r')
|
|
return s[0 .. len - 2];
|
|
s.popBack();
|
|
return s;
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.chop.unittest\n");
|
|
string s;
|
|
|
|
s = chop(cast(string) null);
|
|
assert(s is null);
|
|
s = chop("hello");
|
|
assert(s == "hell");
|
|
s = chop("hello\r\n");
|
|
assert(s == "hello");
|
|
s = chop("hello\n\r");
|
|
assert(s == "hello\n");
|
|
}
|
|
|
|
/*******************************************
|
|
* Left justify, right justify, or center string s[]
|
|
* in field width chars wide.
|
|
*/
|
|
|
|
S ljustify(S)(S s, size_t width) if (isSomeString!S)
|
|
{
|
|
immutable len = s.walkLength();
|
|
if (len >= width)
|
|
return s;
|
|
auto r = new Unqual!(typeof(s[0]))[width + s.length - len];
|
|
r[0..s.length] = s;
|
|
r[s.length .. $] = ' ';
|
|
return cast(S) r;
|
|
}
|
|
|
|
/// ditto
|
|
S rjustify(S)(S s, size_t width) if (isSomeString!S)
|
|
{
|
|
immutable len = s.walkLength();
|
|
if (len >= width)
|
|
return s;
|
|
auto r = new Unqual!(typeof(s[0]))[width + s.length - len];
|
|
r[0 .. $ - s.length] = ' ';
|
|
r[$ - s.length .. $] = s;
|
|
return cast(S) r;
|
|
}
|
|
|
|
/// ditto
|
|
S center(S)(S s, size_t width) if (isSomeString!S)
|
|
{
|
|
immutable len = s.walkLength();
|
|
if (len >= width)
|
|
return s;
|
|
auto r = new Unqual!(typeof(s[0]))[width + s.length - len];
|
|
immutable left = (r.length - s.length) / 2;
|
|
r[0 .. left] = ' ';
|
|
r[left .. left + s.length] = s;
|
|
r[left + s.length .. $] = ' ';
|
|
return cast(S) r;
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.justify.unittest\n");
|
|
|
|
string s = "hello";
|
|
string r;
|
|
int i;
|
|
|
|
r = ljustify(s, 8);
|
|
i = cmp(r, "hello ");
|
|
assert(i == 0);
|
|
|
|
r = rjustify(s, 8);
|
|
i = cmp(r, " hello");
|
|
assert(i == 0);
|
|
|
|
r = center(s, 8);
|
|
i = cmp(r, " hello ");
|
|
assert(i == 0);
|
|
|
|
r = zfill(s, 8);
|
|
i = cmp(r, "000hello");
|
|
assert(i == 0);
|
|
}
|
|
|
|
|
|
/*****************************************
|
|
* Same as rjustify(), but fill with '0's.
|
|
*
|
|
*/
|
|
|
|
S zfill(S)(S s, int width) if (isSomeString!S)
|
|
{
|
|
immutable len = s.walkLength();
|
|
if (len >= width)
|
|
return s;
|
|
auto r = new Unqual!(typeof(s[0]))[width + s.length - len];
|
|
r[0 .. $ - s.length] = '0';
|
|
r[$ - s.length .. $] = s;
|
|
return cast(S) r;
|
|
}
|
|
|
|
/**********************************************
|
|
* Insert sub[] into s[] at location index. Scheduled for deprecation
|
|
* - use $(XREF array, _insert) instead.
|
|
*/
|
|
|
|
S insert(S)(S s, size_t index, S sub)
|
|
in
|
|
{
|
|
assert(0 <= index && index <= s.length);
|
|
}
|
|
body
|
|
{
|
|
std.array.insert(s, index, sub);
|
|
return s;
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.insert.unittest\n");
|
|
|
|
string r;
|
|
int i;
|
|
|
|
r = insert("abcd", 0, "e");
|
|
i = cmp(r, "eabcd");
|
|
assert(i == 0);
|
|
|
|
r = insert("abcd", 4, "e");
|
|
i = cmp(r, "abcde");
|
|
assert(i == 0);
|
|
|
|
r = insert("abcd", 2, "ef");
|
|
i = cmp(r, "abefcd");
|
|
assert(i == 0);
|
|
|
|
r = insert(cast(string) null, 0, "e");
|
|
i = cmp(r, "e");
|
|
assert(i == 0);
|
|
|
|
r = insert("abcd", 0, cast(string) null);
|
|
i = cmp(r, "abcd");
|
|
assert(i == 0);
|
|
}
|
|
|
|
/************************************************
|
|
* Replace tabs with the appropriate number of spaces.
|
|
* tabsize is the distance between tab stops.
|
|
*/
|
|
|
|
S expandtabs(S)(S str, size_t tabsize = 8) if (isSomeString!S)
|
|
{
|
|
bool changes = false;
|
|
Unqual!(typeof(str[0]))[] result;
|
|
int column;
|
|
size_t nspaces;
|
|
|
|
foreach (size_t i, dchar c; str)
|
|
{
|
|
switch (c)
|
|
{
|
|
case '\t':
|
|
nspaces = tabsize - (column % tabsize);
|
|
if (!changes)
|
|
{
|
|
changes = true;
|
|
result = null;
|
|
result.length = str.length + nspaces - 1;
|
|
result.length = i + nspaces;
|
|
result[0 .. i] = str[0 .. i];
|
|
result[i .. i + nspaces] = ' ';
|
|
}
|
|
else
|
|
{
|
|
sizediff_t j = result.length;
|
|
result.length = j + nspaces;
|
|
result[j .. j + nspaces] = ' ';
|
|
}
|
|
column += nspaces;
|
|
break;
|
|
|
|
case '\r':
|
|
case '\n':
|
|
case PS:
|
|
case LS:
|
|
column = 0;
|
|
goto L1;
|
|
|
|
default:
|
|
column++;
|
|
L1:
|
|
if (changes)
|
|
{
|
|
if (c <= 0x7F)
|
|
result ~= cast(char)c;
|
|
else
|
|
std.utf.encode(result, c);
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
|
|
return changes ? cast(S) result : str;
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.expandtabs.unittest\n");
|
|
|
|
string s = "This \tis\t a fofof\tof list";
|
|
string r;
|
|
int i;
|
|
|
|
r = expandtabs(s, 8);
|
|
i = cmp(r, "This is a fofof of list");
|
|
assert(i == 0);
|
|
|
|
r = expandtabs(cast(string) null);
|
|
assert(r == null);
|
|
r = expandtabs("");
|
|
assert(r.length == 0);
|
|
r = expandtabs("a");
|
|
assert(r == "a");
|
|
r = expandtabs("\t");
|
|
assert(r == " ");
|
|
r = expandtabs( " ab\tasdf ");
|
|
//writefln("r = '%s'", r);
|
|
assert(r == " ab asdf ");
|
|
// TODO: need UTF test case
|
|
}
|
|
|
|
|
|
/*******************************************
|
|
* Replace spaces in string s with the optimal number of tabs.
|
|
* Trailing spaces or tabs in a line are removed.
|
|
* Params:
|
|
* s = String to convert.
|
|
* tabsize = Tab columns are tabsize spaces apart. tabsize defaults to 8.
|
|
*/
|
|
|
|
S entab(S)(S s, size_t tabsize = 8)
|
|
{
|
|
bool changes = false;
|
|
Unqual!(typeof(s[0]))[] result;
|
|
|
|
int nspaces = 0;
|
|
int nwhite = 0;
|
|
size_t column = 0; // column number
|
|
|
|
foreach (size_t i, dchar c; s)
|
|
{
|
|
|
|
void change()
|
|
{
|
|
changes = true;
|
|
result = null;
|
|
result.length = s.length;
|
|
result.length = i;
|
|
result[0 .. i] = s[0 .. i];
|
|
}
|
|
|
|
switch (c)
|
|
{
|
|
case '\t':
|
|
nwhite++;
|
|
if (nspaces)
|
|
{
|
|
if (!changes)
|
|
change();
|
|
|
|
sizediff_t j = result.length - nspaces;
|
|
auto ntabs = (((column - nspaces) % tabsize) + nspaces) / tabsize;
|
|
result.length = j + ntabs;
|
|
result[j .. j + ntabs] = '\t';
|
|
nwhite += ntabs - nspaces;
|
|
nspaces = 0;
|
|
}
|
|
column = (column + tabsize) / tabsize * tabsize;
|
|
break;
|
|
|
|
case '\r':
|
|
case '\n':
|
|
case PS:
|
|
case LS:
|
|
// Truncate any trailing spaces or tabs
|
|
if (nwhite)
|
|
{
|
|
if (!changes)
|
|
change();
|
|
result = result[0 .. result.length - nwhite];
|
|
}
|
|
break;
|
|
|
|
default:
|
|
if (nspaces >= 2 && (column % tabsize) == 0)
|
|
{
|
|
if (!changes)
|
|
change();
|
|
|
|
auto j = result.length - nspaces;
|
|
auto ntabs = (nspaces + tabsize - 1) / tabsize;
|
|
result.length = j + ntabs;
|
|
result[j .. j + ntabs] = '\t';
|
|
nwhite += ntabs - nspaces;
|
|
nspaces = 0;
|
|
}
|
|
if (c == ' ')
|
|
{ nwhite++;
|
|
nspaces++;
|
|
}
|
|
else
|
|
{ nwhite = 0;
|
|
nspaces = 0;
|
|
}
|
|
column++;
|
|
break;
|
|
}
|
|
if (changes)
|
|
{
|
|
if (c <= 0x7F)
|
|
result ~= cast(char)c;
|
|
else
|
|
std.utf.encode(result, c);
|
|
}
|
|
}
|
|
|
|
// Truncate any trailing spaces or tabs
|
|
if (nwhite)
|
|
{
|
|
if (changes)
|
|
result = result[0 .. result.length - nwhite];
|
|
else
|
|
s = s[0 .. s.length - nwhite];
|
|
}
|
|
return changes ? assumeUnique(result) : s;
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.entab.unittest\n");
|
|
|
|
string r;
|
|
|
|
r = entab(cast(string) null);
|
|
assert(r == null);
|
|
r = entab("");
|
|
assert(r.length == 0);
|
|
r = entab("a");
|
|
assert(r == "a");
|
|
r = entab(" ");
|
|
assert(r == "");
|
|
r = entab(" x");
|
|
assert(r == "\tx");
|
|
r = entab(" ab asdf ");
|
|
assert(r == " ab\tasdf");
|
|
r = entab(" ab asdf ");
|
|
assert(r == " ab\t asdf");
|
|
r = entab(" ab \t asdf ");
|
|
assert(r == " ab\t asdf");
|
|
r = entab("1234567 \ta");
|
|
assert(r == "1234567\t\ta");
|
|
r = entab("1234567 \ta");
|
|
assert(r == "1234567\t\ta");
|
|
r = entab("1234567 \ta");
|
|
assert(r == "1234567\t\ta");
|
|
r = entab("1234567 \ta");
|
|
assert(r == "1234567\t\ta");
|
|
r = entab("1234567 \ta");
|
|
assert(r == "1234567\t\ta");
|
|
r = entab("1234567 \ta");
|
|
assert(r == "1234567\t\ta");
|
|
r = entab("1234567 \ta");
|
|
assert(r == "1234567\t\ta");
|
|
r = entab("1234567 \ta");
|
|
assert(r == "1234567\t\ta");
|
|
r = entab("1234567 \ta");
|
|
assert(r == "1234567\t\t\ta");
|
|
// TODO: need UTF test case
|
|
}
|
|
|
|
|
|
|
|
/************************************
|
|
* Construct translation table for translate().
|
|
* BUG: only works with ASCII
|
|
*/
|
|
|
|
string maketrans(in char[] from, in char[] to)
|
|
in
|
|
{
|
|
assert(from.length == to.length);
|
|
assert(from.length <= 128);
|
|
foreach (char c; from)
|
|
{
|
|
assert(c <= 0x7F);
|
|
}
|
|
foreach (char c; to)
|
|
{
|
|
assert(c <= 0x7F);
|
|
}
|
|
}
|
|
body
|
|
{
|
|
char[] t = new char[256];
|
|
|
|
foreach (i; 0 .. t.length)
|
|
t[i] = cast(char)i;
|
|
foreach (i; 0 .. from.length)
|
|
t[from[i]] = to[i];
|
|
|
|
return assumeUnique(t);
|
|
}
|
|
|
|
/******************************************
|
|
* Translate characters in s[] using table created by maketrans().
|
|
* Delete chars in delchars[].
|
|
* BUG: only works with ASCII
|
|
*/
|
|
|
|
string translate(in char[] s, in char[] transtab, in char[] delchars)
|
|
in
|
|
{
|
|
assert(transtab.length == 256);
|
|
}
|
|
body
|
|
{
|
|
bool[256] deltab;
|
|
|
|
deltab[] = false;
|
|
foreach (char c; delchars)
|
|
{
|
|
deltab[c] = true;
|
|
}
|
|
|
|
size_t count = 0;
|
|
foreach (char c; s)
|
|
{
|
|
if (!deltab[c])
|
|
count++;
|
|
//printf("s[%d] = '%c', count = %d\n", i, s[i], count);
|
|
}
|
|
|
|
auto r = new char[count];
|
|
count = 0;
|
|
foreach (char c; s)
|
|
{
|
|
if (!deltab[c])
|
|
{
|
|
r[count] = transtab[c];
|
|
count++;
|
|
}
|
|
}
|
|
|
|
return assumeUnique(r);
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.translate.unittest\n");
|
|
|
|
string from = "abcdef";
|
|
string to = "ABCDEF";
|
|
string s = "The quick dog fox";
|
|
string t;
|
|
string r;
|
|
int i;
|
|
|
|
t = maketrans(from, to);
|
|
r = translate(s, t, "kg");
|
|
//printf("r = '%.*s'\n", r);
|
|
i = cmp(r, "ThE quiC Do Fox");
|
|
assert(i == 0);
|
|
}
|
|
|
|
/**
|
|
Convert to string. WARNING! This function has been deprecated. Instead
|
|
of $(D toString(x)), you may want to import $(D std.conv) and use $(D
|
|
to!string(x)) instead.
|
|
*/
|
|
deprecated auto toString(T, string f = __FILE__, uint line = __LINE__)(T obj)
|
|
if (is(typeof(to!string(T.init))))
|
|
{
|
|
pragma(msg, "toString("~T.stringof~") called from "~f~"("~ToString!(line)
|
|
~") is deprecated."
|
|
" Instead you may want to"
|
|
" import std.conv and use to!string(x) instead of toString(x).");
|
|
return to!string(obj);
|
|
}
|
|
|
|
/**
|
|
Convert string to integer. WARNING. This function has been
|
|
deprecated. Instead of $(D atoi(s)), you may want to import $(D
|
|
std.conv) and use $(D to!int(s)) instead.
|
|
*/
|
|
deprecated auto atoi(T, string f = __FILE__, uint line = __LINE__)(T obj)
|
|
if (isSomeString!T)
|
|
{
|
|
pragma(msg, "atoi("~T.stringof~") called from "~f~"("~ToString!(line)
|
|
~") is deprecated."
|
|
" Instead you may want to"
|
|
" import std.conv and use to!int(x) instead of atoi(x).");
|
|
return to!int(obj);
|
|
}
|
|
|
|
unittest
|
|
{
|
|
string s = "foo";
|
|
string s2;
|
|
foreach (char c; s)
|
|
{
|
|
s2 ~= to!string(c);
|
|
}
|
|
//printf("%.*s", s2);
|
|
assert(s2 == "foo");
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.to!string(uint).unittest\n");
|
|
|
|
string r;
|
|
int i;
|
|
|
|
r = to!string(0u);
|
|
i = cmp(r, "0");
|
|
assert(i == 0);
|
|
|
|
r = to!string(9u);
|
|
i = cmp(r, "9");
|
|
assert(i == 0);
|
|
|
|
r = to!string(123u);
|
|
i = cmp(r, "123");
|
|
assert(i == 0);
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.to!string(ulong).unittest\n");
|
|
|
|
string r;
|
|
int i;
|
|
|
|
r = to!string(0uL);
|
|
i = cmp(r, "0");
|
|
assert(i == 0);
|
|
|
|
r = to!string(9uL);
|
|
i = cmp(r, "9");
|
|
assert(i == 0);
|
|
|
|
r = to!string(123uL);
|
|
i = cmp(r, "123");
|
|
assert(i == 0);
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.to!string(int).unittest\n");
|
|
|
|
string r;
|
|
int i;
|
|
|
|
r = to!string(0);
|
|
i = cmp(r, "0");
|
|
assert(i == 0);
|
|
|
|
r = to!string(9);
|
|
i = cmp(r, "9");
|
|
assert(i == 0);
|
|
|
|
r = to!string(123);
|
|
i = cmp(r, "123");
|
|
assert(i == 0);
|
|
|
|
r = to!string(-0);
|
|
i = cmp(r, "0");
|
|
assert(i == 0);
|
|
|
|
r = to!string(-9);
|
|
i = cmp(r, "-9");
|
|
assert(i == 0);
|
|
|
|
r = to!string(-123);
|
|
i = cmp(r, "-123");
|
|
assert(i == 0);
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.to!string(long).unittest\n");
|
|
|
|
string r;
|
|
int i;
|
|
|
|
r = to!string(0L);
|
|
i = cmp(r, "0");
|
|
assert(i == 0);
|
|
|
|
r = to!string(9L);
|
|
i = cmp(r, "9");
|
|
assert(i == 0);
|
|
|
|
r = to!string(123L);
|
|
i = cmp(r, "123");
|
|
assert(i == 0);
|
|
|
|
r = to!string(-0L);
|
|
i = cmp(r, "0");
|
|
assert(i == 0);
|
|
|
|
r = to!string(-9L);
|
|
i = cmp(r, "-9");
|
|
assert(i == 0);
|
|
|
|
r = to!string(-123L);
|
|
i = cmp(r, "-123");
|
|
assert(i == 0);
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.to!string(char*).unittest\n");
|
|
|
|
string r;
|
|
int i;
|
|
|
|
r = to!string(cast(char*) null);
|
|
i = cmp(r, "");
|
|
assert(i == 0);
|
|
|
|
r = to!string("foo\0".ptr);
|
|
assert(r == "foo");
|
|
// i = cmp(r, "foo");
|
|
// assert(i == 0);
|
|
}
|
|
|
|
private:
|
|
|
|
// @@@BUG@@@ workaround for bugzilla 2479
|
|
string bug2479format(TypeInfo[] arguments, va_list argptr)
|
|
{
|
|
char[] s;
|
|
|
|
void putc(dchar c)
|
|
{
|
|
std.utf.encode(s, c);
|
|
}
|
|
std.format.doFormat(&putc, arguments, argptr);
|
|
return assumeUnique(s);
|
|
}
|
|
|
|
// @@@BUG@@@ workaround for bugzilla 2479
|
|
char[] bug2479sformat(char[] s, TypeInfo[] arguments, va_list argptr)
|
|
{ size_t i;
|
|
|
|
void putc(dchar c)
|
|
{
|
|
if (c <= 0x7F)
|
|
{
|
|
if (i >= s.length)
|
|
onRangeError("std.string.sformat", 0);
|
|
s[i] = cast(char)c;
|
|
++i;
|
|
}
|
|
else
|
|
{ char[4] buf;
|
|
auto b = std.utf.toUTF8(buf, c);
|
|
if (i + b.length > s.length)
|
|
onRangeError("std.string.sformat", 0);
|
|
s[i..i+b.length] = b[];
|
|
i += b.length;
|
|
}
|
|
}
|
|
|
|
std.format.doFormat(&putc, arguments, argptr);
|
|
return s[0 .. i];
|
|
}
|
|
public:
|
|
|
|
|
|
/*****************************************************
|
|
* Format arguments into a string.
|
|
*/
|
|
|
|
string format(...)
|
|
{
|
|
/+ // @@@BUG@@@ Fails due to regression bug 2479.
|
|
char[] s;
|
|
|
|
void putc(dchar c)
|
|
{
|
|
std.utf.encode(s, c);
|
|
}
|
|
|
|
std.format.doFormat(&putc, _arguments, _argptr);
|
|
return assumeUnique(s);
|
|
+/
|
|
return bug2479format(_arguments, _argptr);
|
|
}
|
|
|
|
|
|
/*****************************************************
|
|
* Format arguments into string <i>s</i> which must be large
|
|
* enough to hold the result. Throws RangeError if it is not.
|
|
* Returns: s
|
|
*/
|
|
char[] sformat(char[] s, ...)
|
|
{
|
|
/+ // @@@BUG@@@ Fails due to regression bug 2479.
|
|
|
|
size_t i;
|
|
|
|
void putc(dchar c)
|
|
{
|
|
if (c <= 0x7F)
|
|
{
|
|
if (i >= s.length)
|
|
onRangeError("std.string.sformat", 0);
|
|
s[i] = cast(char)c;
|
|
++i;
|
|
}
|
|
else
|
|
{ char[4] buf;
|
|
auto b = std.utf.toUTF8(buf, c);
|
|
if (i + b.length > s.length)
|
|
onRangeError("std.string.sformat", 0);
|
|
s[i..i+b.length] = b[];
|
|
i += b.length;
|
|
}
|
|
}
|
|
|
|
std.format.doFormat(&putc, _arguments, _argptr);
|
|
return s[0 .. i];
|
|
+/
|
|
return bug2479sformat(s, _arguments, _argptr);
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("std.string.format.unittest\n");
|
|
|
|
string r;
|
|
int i;
|
|
/+
|
|
r = format(null);
|
|
i = cmp(r, "");
|
|
assert(i == 0);
|
|
+/
|
|
r = format("foo");
|
|
i = cmp(r, "foo");
|
|
assert(i == 0);
|
|
|
|
r = format("foo%%");
|
|
i = cmp(r, "foo%");
|
|
assert(i == 0);
|
|
|
|
r = format("foo%s", 'C');
|
|
i = cmp(r, "fooC");
|
|
assert(i == 0);
|
|
|
|
r = format("%s foo", "bar");
|
|
i = cmp(r, "bar foo");
|
|
assert(i == 0);
|
|
|
|
r = format("%s foo %s", "bar", "abc");
|
|
i = cmp(r, "bar foo abc");
|
|
assert(i == 0);
|
|
|
|
r = format("foo %d", -123);
|
|
i = cmp(r, "foo -123");
|
|
assert(i == 0);
|
|
|
|
r = format("foo %d", 123);
|
|
i = cmp(r, "foo 123");
|
|
assert(i == 0);
|
|
}
|
|
|
|
|
|
/***********************************************
|
|
* See if character c is in the pattern.
|
|
* Patterns:
|
|
*
|
|
* A <i>pattern</i> is an array of characters much like a <i>character
|
|
* class</i> in regular expressions. A sequence of characters
|
|
* can be given, such as "abcde". The '-' can represent a range
|
|
* of characters, as "a-e" represents the same pattern as "abcde".
|
|
* "a-fA-F0-9" represents all the hex characters.
|
|
* If the first character of a pattern is '^', then the pattern
|
|
* is negated, i.e. "^0-9" means any character except a digit.
|
|
* The functions inPattern, <b>countchars</b>, <b>removeschars</b>,
|
|
* and <b>squeeze</b>
|
|
* use patterns.
|
|
*
|
|
* Note: In the future, the pattern syntax may be improved
|
|
* to be more like regular expression character classes.
|
|
*/
|
|
|
|
bool inPattern(S)(dchar c, in S pattern) if (isSomeString!S)
|
|
{
|
|
bool result = false;
|
|
int range = 0;
|
|
dchar lastc;
|
|
|
|
foreach (size_t i, dchar p; pattern)
|
|
{
|
|
if (p == '^' && i == 0)
|
|
{ result = true;
|
|
if (i + 1 == pattern.length)
|
|
return (c == p); // or should this be an error?
|
|
}
|
|
else if (range)
|
|
{
|
|
range = 0;
|
|
if (lastc <= c && c <= p || c == p)
|
|
return !result;
|
|
}
|
|
else if (p == '-' && i > result && i + 1 < pattern.length)
|
|
{
|
|
range = 1;
|
|
continue;
|
|
}
|
|
else if (c == p)
|
|
return !result;
|
|
lastc = p;
|
|
}
|
|
return result;
|
|
}
|
|
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("std.string.inPattern.unittest\n");
|
|
|
|
int i;
|
|
|
|
i = inPattern('x', "x");
|
|
assert(i == 1);
|
|
i = inPattern('x', "y");
|
|
assert(i == 0);
|
|
i = inPattern('x', cast(string)null);
|
|
assert(i == 0);
|
|
i = inPattern('x', "^y");
|
|
assert(i == 1);
|
|
i = inPattern('x', "yxxy");
|
|
assert(i == 1);
|
|
i = inPattern('x', "^yxxy");
|
|
assert(i == 0);
|
|
i = inPattern('x', "^abcd");
|
|
assert(i == 1);
|
|
i = inPattern('^', "^^");
|
|
assert(i == 0);
|
|
i = inPattern('^', "^");
|
|
assert(i == 1);
|
|
i = inPattern('^', "a^");
|
|
assert(i == 1);
|
|
i = inPattern('x', "a-z");
|
|
assert(i == 1);
|
|
i = inPattern('x', "A-Z");
|
|
assert(i == 0);
|
|
i = inPattern('x', "^a-z");
|
|
assert(i == 0);
|
|
i = inPattern('x', "^A-Z");
|
|
assert(i == 1);
|
|
i = inPattern('-', "a-");
|
|
assert(i == 1);
|
|
i = inPattern('-', "^A-");
|
|
assert(i == 0);
|
|
i = inPattern('a', "z-a");
|
|
assert(i == 1);
|
|
i = inPattern('z', "z-a");
|
|
assert(i == 1);
|
|
i = inPattern('x', "z-a");
|
|
assert(i == 0);
|
|
}
|
|
|
|
|
|
/***********************************************
|
|
* See if character c is in the intersection of the patterns.
|
|
*/
|
|
|
|
bool inPattern(S)(dchar c, S[] patterns) if (isSomeString!S)
|
|
{
|
|
foreach (string pattern; patterns)
|
|
{
|
|
if (!inPattern(c, pattern))
|
|
{
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
|
|
/********************************************
|
|
* Count characters in s that match pattern.
|
|
*/
|
|
|
|
size_t countchars(S, S1)(S s, in S1 pattern) if (isSomeString!S && isSomeString!S1)
|
|
{
|
|
size_t count;
|
|
foreach (dchar c; s)
|
|
{
|
|
count += inPattern(c, pattern);
|
|
}
|
|
return count;
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("std.string.count.unittest\n");
|
|
|
|
size_t c;
|
|
|
|
c = countchars("abc", "a-c");
|
|
assert(c == 3);
|
|
c = countchars("hello world", "or");
|
|
assert(c == 3);
|
|
}
|
|
|
|
|
|
/********************************************
|
|
* Return string that is s with all characters removed that match pattern.
|
|
*/
|
|
|
|
S removechars(S)(S s, in S pattern) if (isSomeString!S)
|
|
{
|
|
Unqual!(typeof(s[0]))[] r;
|
|
bool changed = false;
|
|
|
|
foreach (size_t i, dchar c; s)
|
|
{
|
|
if (inPattern(c, pattern)){
|
|
if (!changed)
|
|
{
|
|
changed = true;
|
|
r = s[0 .. i].dup;
|
|
}
|
|
continue;
|
|
}
|
|
if (changed)
|
|
{
|
|
std.utf.encode(r, c);
|
|
}
|
|
}
|
|
return (changed? cast(S) r : s);
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("std.string.removechars.unittest\n");
|
|
|
|
string r;
|
|
|
|
r = removechars("abc", "a-c");
|
|
assert(r.length == 0);
|
|
r = removechars("hello world", "or");
|
|
assert(r == "hell wld");
|
|
r = removechars("hello world", "d");
|
|
assert(r == "hello worl");
|
|
r = removechars("hah", "h");
|
|
assert(r == "a");
|
|
}
|
|
|
|
|
|
/***************************************************
|
|
* Return string where sequences of a character in s[] from pattern[]
|
|
* are replaced with a single instance of that character.
|
|
* If pattern is null, it defaults to all characters.
|
|
*/
|
|
|
|
S squeeze(S)(S s, in S pattern = null)
|
|
{
|
|
Unqual!(typeof(s[0]))[] r;
|
|
dchar lastc;
|
|
size_t lasti;
|
|
int run;
|
|
bool changed;
|
|
|
|
foreach (size_t i, dchar c; s)
|
|
{
|
|
if (run && lastc == c)
|
|
{
|
|
changed = true;
|
|
}
|
|
else if (pattern is null || inPattern(c, pattern))
|
|
{
|
|
run = 1;
|
|
if (changed)
|
|
{ if (r is null)
|
|
r = s[0 .. lasti].dup;
|
|
std.utf.encode(r, c);
|
|
}
|
|
else
|
|
lasti = i + std.utf.stride(s, i);
|
|
lastc = c;
|
|
}
|
|
else
|
|
{
|
|
run = 0;
|
|
if (changed)
|
|
{ if (r is null)
|
|
r = s[0 .. lasti].dup;
|
|
std.utf.encode(r, c);
|
|
}
|
|
}
|
|
}
|
|
return changed ? ((r is null) ? s[0 .. lasti] : cast(S) r) : s;
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("std.string.squeeze.unittest\n");
|
|
string s,r;
|
|
|
|
r = squeeze("hello");
|
|
//writefln("r = '%s'", r);
|
|
assert(r == "helo");
|
|
s = "abcd";
|
|
r = squeeze(s);
|
|
assert(r is s);
|
|
s = "xyzz";
|
|
r = squeeze(s);
|
|
assert(r.ptr == s.ptr); // should just be a slice
|
|
r = squeeze("hello goodbyee", "oe");
|
|
assert(r == "hello godbye");
|
|
}
|
|
|
|
/***************************************************************
|
|
Finds the position $(D_PARAM pos) of the first character in $(D_PARAM
|
|
s) that does not match $(D_PARAM pattern) (in the terminology used by
|
|
$(LINK2 std_string.html,inPattern)). Updates $(D_PARAM s =
|
|
s[pos..$]). Returns the slice from the beginning of the original
|
|
(before update) string up to, and excluding, $(D_PARAM pos).
|
|
|
|
Example:
|
|
---
|
|
string s = "123abc";
|
|
string t = munch(s, "0123456789");
|
|
assert(t == "123" && s == "abc");
|
|
t = munch(s, "0123456789");
|
|
assert(t == "" && s == "abc");
|
|
---
|
|
|
|
The $(D_PARAM munch) function is mostly convenient for skipping
|
|
certain category of characters (e.g. whitespace) when parsing
|
|
strings. (In such cases, the return value is not used.)
|
|
*/
|
|
|
|
S1 munch(S1, S2)(ref S1 s, S2 pattern)
|
|
{
|
|
size_t j = s.length;
|
|
foreach (i, c; s)
|
|
{
|
|
if (!inPattern(c, pattern))
|
|
{
|
|
j = i;
|
|
break;
|
|
}
|
|
}
|
|
scope(exit) s = s[j .. $];
|
|
return s[0 .. j];
|
|
}
|
|
|
|
unittest
|
|
{
|
|
string s = "123abc";
|
|
string t = munch(s, "0123456789");
|
|
assert(t == "123" && s == "abc");
|
|
t = munch(s, "0123456789");
|
|
assert(t == "" && s == "abc");
|
|
}
|
|
|
|
|
|
/**********************************************
|
|
* Return string that is the 'successor' to s[].
|
|
* If the rightmost character is a-zA-Z0-9, it is incremented within
|
|
* its case or digits. If it generates a carry, the process is
|
|
* repeated with the one to its immediate left.
|
|
*/
|
|
|
|
S succ(S)(S s) if (isSomeString!S)
|
|
{
|
|
if (s.length && isalnum(s[$ - 1]))
|
|
{
|
|
auto r = s.dup;
|
|
size_t i = r.length - 1;
|
|
|
|
while (1)
|
|
{
|
|
dchar c = s[i];
|
|
dchar carry;
|
|
|
|
switch (c)
|
|
{
|
|
case '9':
|
|
c = '0';
|
|
carry = '1';
|
|
goto Lcarry;
|
|
case 'z':
|
|
case 'Z':
|
|
c -= 'Z' - 'A';
|
|
carry = c;
|
|
Lcarry:
|
|
r[i] = cast(char)c;
|
|
if (i == 0)
|
|
{
|
|
auto t = new typeof(r[0])[r.length + 1];
|
|
t[0] = cast(char) carry;
|
|
t[1 .. $] = r[];
|
|
return assumeUnique(t);
|
|
}
|
|
i--;
|
|
break;
|
|
|
|
default:
|
|
if (std.ctype.isalnum(c))
|
|
r[i]++;
|
|
return cast(S) r;
|
|
}
|
|
}
|
|
}
|
|
return s;
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("std.string.succ.unittest\n");
|
|
|
|
string r;
|
|
|
|
r = succ(cast(string) null);
|
|
assert(r is null);
|
|
r = succ("!@#$%");
|
|
assert(r == "!@#$%");
|
|
r = succ("1");
|
|
assert(r == "2");
|
|
r = succ("9");
|
|
assert(r == "10");
|
|
r = succ("999");
|
|
assert(r == "1000");
|
|
r = succ("zz99");
|
|
assert(r == "aaa00");
|
|
}
|
|
|
|
|
|
/***********************************************
|
|
* Replaces characters in str[] that are in from[]
|
|
* with corresponding characters in to[] and returns the resulting
|
|
* string.
|
|
* Params:
|
|
* modifiers = a string of modifier characters
|
|
* Modifiers:
|
|
<table border=1 cellspacing=0 cellpadding=5>
|
|
<tr> <th>Modifier <th>Description
|
|
<tr> <td><b>c</b> <td>Complement the list of characters in from[]
|
|
<tr> <td><b>d</b> <td>Removes matching characters with no corresponding replacement in to[]
|
|
<tr> <td><b>s</b> <td>Removes adjacent duplicates in the replaced characters
|
|
</table>
|
|
|
|
If modifier <b>d</b> is present, then the number of characters
|
|
in to[] may be only 0 or 1.
|
|
|
|
If modifier <b>d</b> is not present and to[] is null,
|
|
then to[] is taken _to be the same as from[].
|
|
|
|
If modifier <b>d</b> is not present and to[] is shorter
|
|
than from[], then to[] is extended by replicating the
|
|
last character in to[].
|
|
|
|
Both from[] and to[] may contain ranges using the <b>-</b>
|
|
character, for example <b>a-d</b> is synonymous with <b>abcd</b>.
|
|
Neither accept a leading <b>^</b> as meaning the complement of
|
|
the string (use the <b>c</b> modifier for that).
|
|
*/
|
|
|
|
string tr(const(char)[] str, const(char)[] from, const(char)[] to, const(char)[] modifiers = null)
|
|
{
|
|
int mod_c;
|
|
int mod_d;
|
|
int mod_s;
|
|
|
|
foreach (char c; modifiers)
|
|
{
|
|
switch (c)
|
|
{
|
|
case 'c': mod_c = 1; break; // complement
|
|
case 'd': mod_d = 1; break; // delete unreplaced chars
|
|
case 's': mod_s = 1; break; // squeeze duplicated replaced chars
|
|
default: assert(0);
|
|
}
|
|
}
|
|
|
|
if (to is null && !mod_d)
|
|
to = from;
|
|
|
|
char[] result = new char[str.length];
|
|
result.length = 0;
|
|
int m;
|
|
dchar lastc;
|
|
|
|
foreach (dchar c; str)
|
|
{
|
|
dchar lastf;
|
|
dchar lastt;
|
|
dchar newc;
|
|
int n = 0;
|
|
|
|
for (size_t i = 0; i < from.length; )
|
|
{
|
|
dchar f = std.utf.decode(from, i);
|
|
//writefln("\tf = '%s', c = '%s', lastf = '%x', '%x', i = %d, %d", f, c, lastf, dchar.init, i, from.length);
|
|
if (f == '-' && lastf != dchar.init && i < from.length)
|
|
{
|
|
dchar nextf = std.utf.decode(from, i);
|
|
//writefln("\tlastf = '%s', c = '%s', nextf = '%s'", lastf, c, nextf);
|
|
if (lastf <= c && c <= nextf)
|
|
{
|
|
n += c - lastf - 1;
|
|
if (mod_c)
|
|
goto Lnotfound;
|
|
goto Lfound;
|
|
}
|
|
n += nextf - lastf;
|
|
lastf = lastf.init;
|
|
continue;
|
|
}
|
|
|
|
if (c == f)
|
|
{ if (mod_c)
|
|
goto Lnotfound;
|
|
goto Lfound;
|
|
}
|
|
lastf = f;
|
|
n++;
|
|
}
|
|
if (!mod_c)
|
|
goto Lnotfound;
|
|
n = 0; // consider it 'found' at position 0
|
|
|
|
Lfound:
|
|
|
|
// Find the nth character in to[]
|
|
//writefln("\tc = '%s', n = %d", c, n);
|
|
dchar nextt;
|
|
for (size_t i = 0; i < to.length; )
|
|
{ dchar t = std.utf.decode(to, i);
|
|
if (t == '-' && lastt != dchar.init && i < to.length)
|
|
{
|
|
nextt = std.utf.decode(to, i);
|
|
//writefln("\tlastt = '%s', c = '%s', nextt = '%s', n = %d", lastt, c, nextt, n);
|
|
n -= nextt - lastt;
|
|
if (n < 0)
|
|
{
|
|
newc = nextt + n + 1;
|
|
goto Lnewc;
|
|
}
|
|
lastt = dchar.init;
|
|
continue;
|
|
}
|
|
if (n == 0)
|
|
{ newc = t;
|
|
goto Lnewc;
|
|
}
|
|
lastt = t;
|
|
nextt = t;
|
|
n--;
|
|
}
|
|
if (mod_d)
|
|
continue;
|
|
newc = nextt;
|
|
|
|
Lnewc:
|
|
if (mod_s && m && newc == lastc)
|
|
continue;
|
|
std.utf.encode(result, newc);
|
|
m = 1;
|
|
lastc = newc;
|
|
continue;
|
|
|
|
Lnotfound:
|
|
std.utf.encode(result, c);
|
|
lastc = c;
|
|
m = 0;
|
|
}
|
|
return assumeUnique(result);
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("std.string.tr.unittest\n");
|
|
|
|
string r;
|
|
//writefln("r = '%s'", r);
|
|
|
|
r = tr("abcdef", "cd", "CD");
|
|
assert(r == "abCDef");
|
|
|
|
r = tr("abcdef", "b-d", "B-D");
|
|
assert(r == "aBCDef");
|
|
|
|
r = tr("abcdefgh", "b-dh", "B-Dx");
|
|
assert(r == "aBCDefgx");
|
|
|
|
r = tr("abcdefgh", "b-dh", "B-CDx");
|
|
assert(r == "aBCDefgx");
|
|
|
|
r = tr("abcdefgh", "b-dh", "B-BCDx");
|
|
assert(r == "aBCDefgx");
|
|
|
|
r = tr("abcdef", "ef", "*", "c");
|
|
assert(r == "****ef");
|
|
|
|
r = tr("abcdef", "ef", "", "d");
|
|
assert(r == "abcd");
|
|
|
|
r = tr("hello goodbye", "lo", null, "s");
|
|
assert(r == "helo godbye");
|
|
|
|
r = tr("hello goodbye", "lo", "x", "s");
|
|
assert(r == "hex gxdbye");
|
|
|
|
r = tr("14-Jul-87", "a-zA-Z", " ", "cs");
|
|
assert(r == " Jul ");
|
|
|
|
r = tr("Abc", "AAA", "XYZ");
|
|
assert(r == "Xbc");
|
|
}
|
|
|
|
|
|
/* ************************************************
|
|
* Version : v0.3
|
|
* Author : David L. 'SpottedTiger' Davis
|
|
* Date Created : 31.May.05 Compiled and Tested with dmd v0.125
|
|
* Date Modified : 01.Jun.05 Modified the function to handle the
|
|
* : imaginary and complex float-point
|
|
* : datatypes.
|
|
* :
|
|
* Licence : Public Domain / Contributed to Digital Mars
|
|
*/
|
|
|
|
/**
|
|
* [in] string s can be formatted in the following ways:
|
|
*
|
|
* Integer Whole Number:
|
|
* (for byte, ubyte, short, ushort, int, uint, long, and ulong)
|
|
* ['+'|'-']digit(s)[U|L|UL]
|
|
*
|
|
* examples: 123, 123UL, 123L, +123U, -123L
|
|
*
|
|
* Floating-Point Number:
|
|
* (for float, double, real, ifloat, idouble, and ireal)
|
|
* ['+'|'-']digit(s)[.][digit(s)][[e-|e+]digit(s)][i|f|L|Li|fi]]
|
|
* or [nan|nani|inf|-inf]
|
|
*
|
|
* examples: +123., -123.01, 123.3e-10f, 123.3e-10fi, 123.3e-10L
|
|
*
|
|
* (for cfloat, cdouble, and creal)
|
|
* ['+'|'-']digit(s)[.][digit(s)][[e-|e+]digit(s)][+]
|
|
* [digit(s)[.][digit(s)][[e-|e+]digit(s)][i|f|L|Li|fi]]
|
|
* or [nan|nani|nan+nani|inf|-inf]
|
|
*
|
|
* examples: nan, -123e-1+456.9e-10Li, +123e+10+456i, 123+456
|
|
*
|
|
* [in] bool bAllowSep
|
|
* False by default, but when set to true it will accept the
|
|
* separator characters "," and "_" within the string, but these
|
|
* characters should be stripped from the string before using any
|
|
* of the conversion functions like toInt(), toFloat(), and etc
|
|
* else an error will occur.
|
|
*
|
|
* Also please note, that no spaces are allowed within the string
|
|
* anywhere whether it's a leading, trailing, or embedded space(s),
|
|
* thus they too must be stripped from the string before using this
|
|
* function, or any of the conversion functions.
|
|
*/
|
|
|
|
bool isNumeric(const(char)[] s, in bool bAllowSep = false)
|
|
{
|
|
sizediff_t iLen = s.length;
|
|
bool bDecimalPoint = false;
|
|
bool bExponent = false;
|
|
bool bComplex = false;
|
|
auto sx = std.string.tolower(s);
|
|
int j = 0;
|
|
char c;
|
|
|
|
//writefln("isNumeric(string, bool = false) called!");
|
|
// Empty string, return false
|
|
if (iLen == 0)
|
|
return false;
|
|
|
|
// Check for NaN (Not a Number)
|
|
if (sx == "nan" || sx == "nani" || sx == "nan+nani")
|
|
return true;
|
|
|
|
// Check for Infinity
|
|
if (sx == "inf" || sx == "-inf")
|
|
return true;
|
|
|
|
// A sign is allowed only in the 1st character
|
|
if (sx[0] == '-' || sx[0] == '+')
|
|
j++;
|
|
|
|
for (int i = j; i < iLen; i++)
|
|
{
|
|
c = sx[i];
|
|
|
|
// Digits are good, continue checking
|
|
// with the popFront character... ;)
|
|
if (c >= '0' && c <= '9')
|
|
continue;
|
|
|
|
// Check for the complex type, and if found
|
|
// reset the flags for checking the 2nd number.
|
|
else if (c == '+')
|
|
if (i > 0)
|
|
{
|
|
bDecimalPoint = false;
|
|
bExponent = false;
|
|
bComplex = true;
|
|
continue;
|
|
}
|
|
else
|
|
return false;
|
|
|
|
// Allow only one exponent per number
|
|
else if (c == 'e')
|
|
{
|
|
// A 2nd exponent found, return not a number
|
|
if (bExponent)
|
|
return false;
|
|
|
|
if (i + 1 < iLen)
|
|
{
|
|
// Look forward for the sign, and if
|
|
// missing then this is not a number.
|
|
if (sx[i + 1] != '-' && sx[i + 1] != '+')
|
|
return false;
|
|
else
|
|
{
|
|
bExponent = true;
|
|
i++;
|
|
}
|
|
}
|
|
else
|
|
// Ending in "E", return not a number
|
|
return false;
|
|
}
|
|
// Allow only one decimal point per number to be used
|
|
else if (c == '.' )
|
|
{
|
|
// A 2nd decimal point found, return not a number
|
|
if (bDecimalPoint)
|
|
return false;
|
|
|
|
bDecimalPoint = true;
|
|
continue;
|
|
}
|
|
// Check for ending literal characters: "f,u,l,i,ul,fi,li",
|
|
// and wheater they're being used with the correct datatype.
|
|
else if (i == iLen - 2)
|
|
{
|
|
// Integer Whole Number
|
|
if (sx[i..iLen] == "ul" &&
|
|
(!bDecimalPoint && !bExponent && !bComplex))
|
|
return true;
|
|
// Floating-Point Number
|
|
else if ((sx[i..iLen] == "fi" || sx[i..iLen] == "li") &&
|
|
(bDecimalPoint || bExponent || bComplex))
|
|
return true;
|
|
else if (sx[i..iLen] == "ul" &&
|
|
(bDecimalPoint || bExponent || bComplex))
|
|
return false;
|
|
// Could be a Integer or a Float, thus
|
|
// all these suffixes are valid for both
|
|
else if (sx[i..iLen] == "ul" ||
|
|
sx[i..iLen] == "fi" ||
|
|
sx[i..iLen] == "li")
|
|
return true;
|
|
else
|
|
return false;
|
|
}
|
|
else if (i == iLen - 1)
|
|
{
|
|
// Integer Whole Number
|
|
if ((c == 'u' || c == 'l') &&
|
|
(!bDecimalPoint && !bExponent && !bComplex))
|
|
return true;
|
|
// Check to see if the last character in the string
|
|
// is the required 'i' character
|
|
else if (bComplex)
|
|
if (c == 'i')
|
|
return true;
|
|
else
|
|
return false;
|
|
// Floating-Point Number
|
|
else if ((c == 'l' || c == 'f' || c == 'i') &&
|
|
(bDecimalPoint || bExponent))
|
|
return true;
|
|
// Could be a Integer or a Float, thus
|
|
// all these suffixes are valid for both
|
|
else if (c == 'l' || c == 'f' || c == 'i')
|
|
return true;
|
|
else
|
|
return false;
|
|
}
|
|
else
|
|
// Check if separators are allow
|
|
// to be in the numeric string
|
|
if (bAllowSep == true && (c == '_' || c == ','))
|
|
continue;
|
|
else
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
/// Allow any object as a parameter
|
|
bool isNumeric(...)
|
|
{
|
|
return isNumeric(_arguments, _argptr);
|
|
}
|
|
|
|
/// Check only the first parameter, all others will be ignored.
|
|
bool isNumeric(TypeInfo[] _arguments, va_list _argptr)
|
|
{
|
|
auto s = ""c;
|
|
auto ws = ""w;
|
|
auto ds = ""d;
|
|
|
|
//writefln("isNumeric(...) called!");
|
|
if (_arguments.length == 0)
|
|
return false;
|
|
|
|
if (_arguments[0] == typeid(char[]))
|
|
return isNumeric(va_arg!(char[])(_argptr));
|
|
else if (_arguments[0] == typeid(wchar[]))
|
|
return isNumeric(std.utf.toUTF8(va_arg!(wchar[])(_argptr)));
|
|
else if (_arguments[0] == typeid(dchar[]))
|
|
return isNumeric(std.utf.toUTF8(va_arg!(dstring)(_argptr)));
|
|
else if (_arguments[0] == typeid(real))
|
|
return true;
|
|
else if (_arguments[0] == typeid(double))
|
|
return true;
|
|
else if (_arguments[0] == typeid(float))
|
|
return true;
|
|
else if (_arguments[0] == typeid(ulong))
|
|
return true;
|
|
else if (_arguments[0] == typeid(long))
|
|
return true;
|
|
else if (_arguments[0] == typeid(uint))
|
|
return true;
|
|
else if (_arguments[0] == typeid(int))
|
|
return true;
|
|
else if (_arguments[0] == typeid(ushort))
|
|
return true;
|
|
else if (_arguments[0] == typeid(short))
|
|
return true;
|
|
else if (_arguments[0] == typeid(ubyte))
|
|
{
|
|
char[1] t;
|
|
t[0]= va_arg!(ubyte)(_argptr);
|
|
return isNumeric(cast(string)t);
|
|
}
|
|
else if (_arguments[0] == typeid(byte))
|
|
{
|
|
char[1] t;
|
|
t[0] = va_arg!(char)(_argptr);
|
|
return isNumeric(cast(string)t);
|
|
}
|
|
else if (_arguments[0] == typeid(ireal))
|
|
return true;
|
|
else if (_arguments[0] == typeid(idouble))
|
|
return true;
|
|
else if (_arguments[0] == typeid(ifloat))
|
|
return true;
|
|
else if (_arguments[0] == typeid(creal))
|
|
return true;
|
|
else if (_arguments[0] == typeid(cdouble))
|
|
return true;
|
|
else if (_arguments[0] == typeid(cfloat))
|
|
return true;
|
|
else if (_arguments[0] == typeid(char))
|
|
{
|
|
char[1] t;
|
|
t[0] = va_arg!(char)(_argptr);
|
|
return isNumeric(cast(string)t);
|
|
}
|
|
else if (_arguments[0] == typeid(wchar))
|
|
{
|
|
wchar[1] t;
|
|
t[0] = va_arg!(wchar)(_argptr);
|
|
return isNumeric(std.utf.toUTF8(t));
|
|
}
|
|
else if (_arguments[0] == typeid(dchar))
|
|
{
|
|
dchar[1] t;
|
|
t[0] = va_arg!(dchar)(_argptr);
|
|
dchar[] t1 = t;
|
|
return isNumeric(std.utf.toUTF8(cast(dstring) t1));
|
|
}
|
|
//else if (_arguments[0] == typeid(cent))
|
|
// return true;
|
|
//else if (_arguments[0] == typeid(ucent))
|
|
// return true;
|
|
else
|
|
return false;
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug (string) printf("isNumeric(in string, bool = false).unittest\n");
|
|
string s;
|
|
|
|
// Test the isNumeric(in string) function
|
|
assert(isNumeric("1") == true );
|
|
assert(isNumeric("1.0") == true );
|
|
assert(isNumeric("1e-1") == true );
|
|
assert(isNumeric("12345xxxx890") == false );
|
|
assert(isNumeric("567L") == true );
|
|
assert(isNumeric("23UL") == true );
|
|
assert(isNumeric("-123..56f") == false );
|
|
assert(isNumeric("12.3.5.6") == false );
|
|
assert(isNumeric(" 12.356") == false );
|
|
assert(isNumeric("123 5.6") == false );
|
|
assert(isNumeric("1233E-1+1.0e-1i") == true );
|
|
|
|
assert(isNumeric("123.00E-5+1234.45E-12Li") == true);
|
|
assert(isNumeric("123.00e-5+1234.45E-12iL") == false);
|
|
assert(isNumeric("123.00e-5+1234.45e-12uL") == false);
|
|
assert(isNumeric("123.00E-5+1234.45e-12lu") == false);
|
|
|
|
assert(isNumeric("123fi") == true);
|
|
assert(isNumeric("123li") == true);
|
|
assert(isNumeric("--123L") == false);
|
|
assert(isNumeric("+123.5UL") == false);
|
|
assert(isNumeric("123f") == true);
|
|
assert(isNumeric("123.u") == false);
|
|
|
|
assert(isNumeric(to!string(real.nan)) == true);
|
|
assert(isNumeric(to!string(-real.infinity)) == true);
|
|
assert(isNumeric(to!string(123e+2+1234.78Li)) == true);
|
|
|
|
s = "$250.99-";
|
|
assert(isNumeric(s[1..s.length - 2]) == true);
|
|
assert(isNumeric(s) == false);
|
|
assert(isNumeric(s[0..s.length - 1]) == false);
|
|
|
|
// These test calling the isNumeric(...) function
|
|
assert(isNumeric(1,123UL) == true);
|
|
assert(isNumeric('2') == true);
|
|
assert(isNumeric('x') == false);
|
|
assert(isNumeric(cast(byte)0x57) == false); // 'W'
|
|
assert(isNumeric(cast(byte)0x37) == true); // '7'
|
|
assert(isNumeric(cast(wchar[])"145.67") == true);
|
|
assert(isNumeric(cast(dchar[])"145.67U") == false);
|
|
assert(isNumeric(123_000.23fi) == true);
|
|
assert(isNumeric(123.00E-5+1234.45E-12Li) == true);
|
|
assert(isNumeric(real.nan) == true);
|
|
assert(isNumeric(-real.infinity) == true);
|
|
}
|
|
|
|
|
|
/*****************************
|
|
* Soundex algorithm.
|
|
*
|
|
* The Soundex algorithm converts a word into 4 characters
|
|
* based on how the word sounds phonetically. The idea is that
|
|
* two spellings that sound alike will have the same Soundex
|
|
* value, which means that Soundex can be used for fuzzy matching
|
|
* of names.
|
|
*
|
|
* Params:
|
|
* string = String to convert to Soundex representation.
|
|
* buffer = Optional 4 char array to put the resulting Soundex
|
|
* characters into. If null, the return value
|
|
* buffer will be allocated on the heap.
|
|
* Returns:
|
|
* The four character array with the Soundex result in it.
|
|
* Returns null if there is no Soundex representation for the string.
|
|
*
|
|
* See_Also:
|
|
* $(LINK2 http://en.wikipedia.org/wiki/Soundex, Wikipedia),
|
|
* $(LINK2 http://www.archives.gov/publications/general-info-leaflets/55.html, The Soundex Indexing System)
|
|
*
|
|
* Bugs:
|
|
* Only works well with English names.
|
|
* There are other arguably better Soundex algorithms,
|
|
* but this one is the standard one.
|
|
*/
|
|
|
|
char[] soundex(const(char)[] string, char[] buffer = null)
|
|
in
|
|
{
|
|
assert(!buffer || buffer.length >= 4);
|
|
}
|
|
out (result)
|
|
{
|
|
if (result)
|
|
{
|
|
assert(result.length == 4);
|
|
assert(result[0] >= 'A' && result[0] <= 'Z');
|
|
foreach (char c; result[1 .. 4])
|
|
assert(c >= '0' && c <= '6');
|
|
}
|
|
}
|
|
body
|
|
{
|
|
static immutable dex =
|
|
// ABCDEFGHIJKLMNOPQRSTUVWXYZ
|
|
"01230120022455012623010202";
|
|
|
|
int b = 0;
|
|
char lastc;
|
|
foreach (char cs; string)
|
|
{ auto c = cs; // necessary because cs is final
|
|
|
|
if (c >= 'a' && c <= 'z')
|
|
c -= 'a' - 'A';
|
|
else if (c >= 'A' && c <= 'Z')
|
|
{
|
|
;
|
|
}
|
|
else
|
|
{ lastc = lastc.init;
|
|
continue;
|
|
}
|
|
if (b == 0)
|
|
{
|
|
if (!buffer)
|
|
buffer = new char[4];
|
|
buffer[0] = c;
|
|
b++;
|
|
lastc = dex[c - 'A'];
|
|
}
|
|
else
|
|
{
|
|
if (c == 'H' || c == 'W')
|
|
continue;
|
|
if (c == 'A' || c == 'E' || c == 'I' || c == 'O' || c == 'U')
|
|
lastc = lastc.init;
|
|
c = dex[c - 'A'];
|
|
if (c != '0' && c != lastc)
|
|
{
|
|
buffer[b] = c;
|
|
b++;
|
|
lastc = c;
|
|
}
|
|
}
|
|
if (b == 4)
|
|
goto Lret;
|
|
}
|
|
if (b == 0)
|
|
buffer = null;
|
|
else
|
|
buffer[b .. 4] = '0';
|
|
Lret:
|
|
return buffer;
|
|
}
|
|
|
|
unittest
|
|
{ char[4] buffer;
|
|
|
|
assert(soundex(null) == null);
|
|
assert(soundex("") == null);
|
|
assert(soundex("0123^&^^**&^") == null);
|
|
assert(soundex("Euler") == "E460");
|
|
assert(soundex(" Ellery ") == "E460");
|
|
assert(soundex("Gauss") == "G200");
|
|
assert(soundex("Ghosh") == "G200");
|
|
assert(soundex("Hilbert") == "H416");
|
|
assert(soundex("Heilbronn") == "H416");
|
|
assert(soundex("Knuth") == "K530");
|
|
assert(soundex("Kant", buffer) == "K530");
|
|
assert(soundex("Lloyd") == "L300");
|
|
assert(soundex("Ladd") == "L300");
|
|
assert(soundex("Lukasiewicz", buffer) == "L222");
|
|
assert(soundex("Lissajous") == "L222");
|
|
assert(soundex("Robert") == "R163");
|
|
assert(soundex("Rupert") == "R163");
|
|
assert(soundex("Rubin") == "R150");
|
|
assert(soundex("Washington") == "W252");
|
|
assert(soundex("Lee") == "L000");
|
|
assert(soundex("Gutierrez") == "G362");
|
|
assert(soundex("Pfister") == "P236");
|
|
assert(soundex("Jackson") == "J250");
|
|
assert(soundex("Tymczak") == "T522");
|
|
assert(soundex("Ashcraft") == "A261");
|
|
|
|
assert(soundex("Woo") == "W000");
|
|
assert(soundex("Pilgrim") == "P426");
|
|
assert(soundex("Flingjingwaller") == "F452");
|
|
assert(soundex("PEARSE") == "P620");
|
|
assert(soundex("PIERCE") == "P620");
|
|
assert(soundex("Price") == "P620");
|
|
assert(soundex("CATHY") == "C300");
|
|
assert(soundex("KATHY") == "K300");
|
|
assert(soundex("Jones") == "J520");
|
|
assert(soundex("johnsons") == "J525");
|
|
assert(soundex("Hardin") == "H635");
|
|
assert(soundex("Martinez") == "M635");
|
|
}
|
|
|
|
|
|
/***************************************************
|
|
* Construct an associative array consisting of all
|
|
* abbreviations that uniquely map to the strings in values.
|
|
*
|
|
* This is useful in cases where the user is expected to type
|
|
* in one of a known set of strings, and the program will helpfully
|
|
* autocomplete the string once sufficient characters have been
|
|
* entered that uniquely identify it.
|
|
* Example:
|
|
* ---
|
|
* import std.stdio;
|
|
* import std.string;
|
|
*
|
|
* void main()
|
|
* {
|
|
* static string[] list = [ "food", "foxy" ];
|
|
*
|
|
* auto abbrevs = std.string.abbrev(list);
|
|
*
|
|
* foreach (key, value; abbrevs)
|
|
* {
|
|
* writefln("%s => %s", key, value);
|
|
* }
|
|
* }
|
|
* ---
|
|
* produces the output:
|
|
* <pre>
|
|
* fox => foxy
|
|
* food => food
|
|
* foxy => foxy
|
|
* foo => food
|
|
* </pre>
|
|
*/
|
|
|
|
string[string] abbrev(string[] values)
|
|
{
|
|
string[string] result;
|
|
|
|
// Make a copy when sorting so we follow COW principles.
|
|
values = values.dup.sort;
|
|
|
|
size_t values_length = values.length;
|
|
size_t lasti = values_length;
|
|
size_t nexti;
|
|
|
|
string nv;
|
|
string lv;
|
|
|
|
for (size_t i = 0; i < values_length; i = nexti)
|
|
{ string value = values[i];
|
|
|
|
// Skip dups
|
|
for (nexti = i + 1; nexti < values_length; nexti++)
|
|
{ nv = values[nexti];
|
|
if (value != values[nexti])
|
|
break;
|
|
}
|
|
|
|
for (size_t j = 0; j < value.length; j += std.utf.stride(value, j))
|
|
{ string v = value[0 .. j];
|
|
|
|
if ((nexti == values_length || j > nv.length || v != nv[0 .. j]) &&
|
|
(lasti == values_length || j > lv.length || v != lv[0 .. j]))
|
|
result[v] = value;
|
|
}
|
|
result[value] = value;
|
|
lasti = i;
|
|
lv = value;
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.abbrev.unittest\n");
|
|
|
|
string[] values;
|
|
values ~= "hello";
|
|
values ~= "hello";
|
|
values ~= "he";
|
|
|
|
string[string] r;
|
|
|
|
r = abbrev(values);
|
|
auto keys = r.keys.dup;
|
|
keys.sort;
|
|
|
|
assert(keys.length == 4);
|
|
assert(keys[0] == "he");
|
|
assert(keys[1] == "hel");
|
|
assert(keys[2] == "hell");
|
|
assert(keys[3] == "hello");
|
|
|
|
assert(r[keys[0]] == "he");
|
|
assert(r[keys[1]] == "hello");
|
|
assert(r[keys[2]] == "hello");
|
|
assert(r[keys[3]] == "hello");
|
|
}
|
|
|
|
|
|
/******************************************
|
|
* Compute column number after string if string starts in the
|
|
* leftmost column, which is numbered starting from 0.
|
|
*/
|
|
|
|
size_t column(S)(S str, size_t tabsize = 8) if (isSomeString!S)
|
|
{
|
|
size_t column;
|
|
|
|
foreach (dchar c; str)
|
|
{
|
|
switch (c)
|
|
{
|
|
case '\t':
|
|
column = (column + tabsize) / tabsize * tabsize;
|
|
break;
|
|
|
|
case '\r':
|
|
case '\n':
|
|
case PS:
|
|
case LS:
|
|
column = 0;
|
|
break;
|
|
|
|
default:
|
|
column++;
|
|
break;
|
|
}
|
|
}
|
|
return column;
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.column.unittest\n");
|
|
|
|
assert(column(cast(string) null) == 0);
|
|
assert(column("") == 0);
|
|
assert(column("\t") == 8);
|
|
assert(column("abc\t") == 8);
|
|
assert(column("12345678\t") == 16);
|
|
}
|
|
|
|
/******************************************
|
|
* Wrap text into a paragraph.
|
|
*
|
|
* The input text string s is formed into a paragraph
|
|
* by breaking it up into a sequence of lines, delineated
|
|
* by \n, such that the number of columns is not exceeded
|
|
* on each line.
|
|
* The last line is terminated with a \n.
|
|
* Params:
|
|
* s = text string to be wrapped
|
|
* columns = maximum number of _columns in the paragraph
|
|
* firstindent = string used to _indent first line of the paragraph
|
|
* indent = string to use to _indent following lines of the paragraph
|
|
* tabsize = column spacing of tabs
|
|
* Returns:
|
|
* The resulting paragraph.
|
|
*/
|
|
|
|
S wrap(S)(S s, size_t columns = 80, S firstindent = null,
|
|
S indent = null, size_t tabsize = 8) if (isSomeString!S)
|
|
{
|
|
typeof(s.dup) result;
|
|
int spaces;
|
|
bool inword;
|
|
bool first = true;
|
|
size_t wordstart;
|
|
|
|
result.length = firstindent.length + s.length;
|
|
result.length = firstindent.length;
|
|
result[] = firstindent[];
|
|
auto col = column(result.idup, tabsize);
|
|
foreach (size_t i, dchar c; s)
|
|
{
|
|
if (iswhite(c))
|
|
{
|
|
if (inword)
|
|
{
|
|
if (first)
|
|
{
|
|
;
|
|
}
|
|
else if (col + 1 + (i - wordstart) > columns)
|
|
{
|
|
result ~= '\n';
|
|
result ~= indent;
|
|
col = column(indent, tabsize);
|
|
}
|
|
else
|
|
{ result ~= ' ';
|
|
col += 1;
|
|
}
|
|
result ~= s[wordstart .. i];
|
|
col += i - wordstart;
|
|
inword = false;
|
|
first = false;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
if (!inword)
|
|
{
|
|
wordstart = i;
|
|
inword = true;
|
|
}
|
|
}
|
|
}
|
|
|
|
if (inword)
|
|
{
|
|
if (col + 1 + (s.length - wordstart) >= columns)
|
|
{
|
|
result ~= '\n';
|
|
result ~= indent;
|
|
}
|
|
else if (result.length != firstindent.length)
|
|
result ~= ' ';
|
|
result ~= s[wordstart .. s.length];
|
|
}
|
|
result ~= '\n';
|
|
|
|
return assumeUnique(result);
|
|
}
|
|
|
|
unittest
|
|
{
|
|
debug(string) printf("string.wrap.unittest\n");
|
|
|
|
assert(wrap(cast(string) null) == "\n");
|
|
assert(wrap(" a b df ") == "a b df\n");
|
|
//writefln("'%s'", wrap(" a b df ",3));
|
|
assert(wrap(" a b df ", 3) == "a b\ndf\n");
|
|
assert(wrap(" a bc df ", 3) == "a\nbc\ndf\n");
|
|
//writefln("'%s'", wrap(" abcd df ",3));
|
|
assert(wrap(" abcd df ", 3) == "abcd\ndf\n");
|
|
assert(wrap("x") == "x\n");
|
|
assert(wrap("u u") == "u u\n");
|
|
}
|
|
|
|
// For backwards compatibility
|
|
|
|
deprecated size_t find(in char[] s, dchar c)
|
|
{
|
|
return indexOf(s, c, CaseSensitive.yes);
|
|
}
|
|
|
|
deprecated size_t find(in char[] str, in char[] sub)
|
|
{
|
|
return indexOf(str, sub, CaseSensitive.yes);
|
|
}
|
|
|
|
deprecated unittest
|
|
{
|
|
string a = "abc";
|
|
string b = "bc";
|
|
assert(find(a, b) == 1);
|
|
}
|
|
|
|
deprecated size_t ifind(in char[] s, dchar c)
|
|
{
|
|
return indexOf(s, c, CaseSensitive.no);
|
|
}
|
|
|
|
deprecated size_t rfind(in char[] s, dchar c)
|
|
{
|
|
return lastIndexOf(s, c, CaseSensitive.yes);
|
|
}
|
|
|
|
deprecated size_t irfind(in char[] s, dchar c)
|
|
{
|
|
return lastIndexOf(s, c, CaseSensitive.no);
|
|
}
|
|
|
|
deprecated size_t ifind(in char[] s, in char[] c)
|
|
{
|
|
return indexOf(s, c, CaseSensitive.no);
|
|
}
|
|
|
|
deprecated size_t rfind(in char[] s, in char[] c)
|
|
{
|
|
return lastIndexOf(s, c, CaseSensitive.yes);
|
|
}
|
|
|
|
deprecated size_t irfind(in char[] s, in char[] c)
|
|
{
|
|
return lastIndexOf(s, c, CaseSensitive.no);
|
|
}
|