mirrors/phobos
1
0
Fork 0
mirror of https://github.com/dlang/phobos.git synced 2025-04-29 22:50:38 +03:00
Code Issues Projects Releases Packages Wiki Activity Actions 1

@safe tests in std.uni

Browse source
This commit is contained in:
John Colvin 2018-03-22 21:27:57 +00:00 • committed by The Dlang Bot
parent dd310f3543
commit dc69783cfb
1 changed files with 19 additions and 19 deletions
Download patch file Download diff file Expand all files Collapse all files

38
std/uni/package.d
View file

@ -1528,7 +1528,7 @@ if (is(Unqual!T == T))
return SliceOverIndexed!T(a, b, x); return SliceOverIndexed!T(a, b, x);
} }
@system unittest @safe unittest
{ {
int[] idxArray = [2, 3, 5, 8, 13]; int[] idxArray = [2, 3, 5, 8, 13];
auto sliced = sliceOverIndexed(0, idxArray.length, &idxArray); auto sliced = sliceOverIndexed(0, idxArray.length, &idxArray);
@ -3116,7 +3116,7 @@ private:
CowArray!SP data; CowArray!SP data;
} }
pure @system unittest pure @safe unittest
{ {
import std.conv : to; import std.conv : to;
assert(unicode.ASCII.to!string() == "[0..128)"); assert(unicode.ASCII.to!string() == "[0..128)");
@ -5410,7 +5410,7 @@ pure @safe unittest
} }
// cover decode fail cases of Matcher // cover decode fail cases of Matcher
pure @system unittest pure @safe unittest
{ {
import std.algorithm.iteration : map; import std.algorithm.iteration : map;
import std.exception : collectException; import std.exception : collectException;
@ -5427,7 +5427,7 @@ pure @system unittest
auto s = msg; auto s = msg;
size_t idx = 0; size_t idx = 0;
utf8.test(s); utf8.test(s);
}()), format("%( %2x %)", cast(ubyte[]) msg)); }()), format("%( %2x %)", cast(immutable(ubyte)[]) msg));
} }
//decode failure cases UTF-16 //decode failure cases UTF-16
alias fails16 = AliasSeq!([0xD811], [0xDC02]); alias fails16 = AliasSeq!([0xD811], [0xDC02]);
@ -7150,7 +7150,7 @@ if (isInputRange!Input && is(immutable ElementType!Input == immutable dchar))
return genericDecodeGrapheme!true(inp); return genericDecodeGrapheme!true(inp);
} }
@system unittest @safe unittest
{ {
import std.algorithm.comparison : equal; import std.algorithm.comparison : equal;
@ -7233,7 +7233,7 @@ if (isInputRange!Range && is(immutable ElementType!Range == immutable dchar))
// For testing non-forward-range input ranges // For testing non-forward-range input ranges
version (StdUnittest) version (StdUnittest)
private static struct InputRangeString private static @safe struct InputRangeString
{ {
private string s; private string s;
@ -7242,7 +7242,7 @@ private static struct InputRangeString
void popFront() { s.popFront(); } void popFront() { s.popFront(); }
} }
@system unittest @safe unittest
{ {
import std.algorithm.comparison : equal; import std.algorithm.comparison : equal;
import std.array : array; import std.array : array;
@ -7366,7 +7366,7 @@ if (isInputRange!Range && is(immutable ElementType!Range == immutable dchar))
assert(reverse == "le\u0308on"); // lëon assert(reverse == "le\u0308on"); // lëon
} }
@system unittest @safe unittest
{ {
import std.algorithm.comparison : equal; import std.algorithm.comparison : equal;
import std.range.primitives : walkLength; import std.range.primitives : walkLength;
@ -7523,7 +7523,7 @@ public:
} }
/// ///
@system unittest @safe unittest
{ {
import std.algorithm.comparison : equal; import std.algorithm.comparison : equal;
auto g = Grapheme("A"); auto g = Grapheme("A");
@ -7650,7 +7650,7 @@ private:
static assert(Grapheme.sizeof == size_t.sizeof*4); static assert(Grapheme.sizeof == size_t.sizeof*4);
@system pure /*nothrow @nogc*/ unittest // TODO: string .front is GC and throw @safe pure /*nothrow @nogc*/ unittest // TODO: string .front is GC and throw
{ {
import std.algorithm.comparison : equal; import std.algorithm.comparison : equal;
Grapheme[3] data = [Grapheme("Ю"), Grapheme("У"), Grapheme("З")]; Grapheme[3] data = [Grapheme("Ю"), Grapheme("У"), Grapheme("З")];
@ -7658,7 +7658,7 @@ static assert(Grapheme.sizeof == size_t.sizeof*4);
} }
/// ///
@system unittest @safe unittest
{ {
import std.algorithm.comparison : equal; import std.algorithm.comparison : equal;
import std.algorithm.iteration : filter; import std.algorithm.iteration : filter;
@ -7704,7 +7704,7 @@ static assert(Grapheme.sizeof == size_t.sizeof*4);
assert(!g.valid); assert(!g.valid);
} }
@system unittest @safe unittest
{ {
import std.algorithm.comparison : equal; import std.algorithm.comparison : equal;
import std.algorithm.iteration : map; import std.algorithm.iteration : map;
@ -8205,7 +8205,7 @@ package(std) auto simpleCaseFoldings(dchar ch) @safe
return Range(start, entry.size); return Range(start, entry.size);
} }
@system unittest @safe unittest
{ {
import std.algorithm.comparison : equal; import std.algorithm.comparison : equal;
import std.algorithm.searching : canFind; import std.algorithm.searching : canFind;
@ -8356,7 +8356,7 @@ public Grapheme decompose(UnicodeDecomposition decompType=Canonical)(dchar ch) @
} }
/// ///
@system unittest @safe unittest
{ {
import std.algorithm.comparison : equal; import std.algorithm.comparison : equal;
@ -8464,7 +8464,7 @@ Grapheme decomposeHangul(dchar ch) @safe
} }
/// ///
@system unittest @safe unittest
{ {
import std.algorithm.comparison : equal; import std.algorithm.comparison : equal;
assert(decomposeHangul('\uD4DB')[].equal("\u1111\u1171\u11B6")); assert(decomposeHangul('\uD4DB')[].equal("\u1111\u1171\u11B6"));
@ -8504,7 +8504,7 @@ dchar composeJamo(dchar lead, dchar vowel, dchar trailing=dchar.init) pure nothr
assert(composeJamo('A', '\u1171') == dchar.init); assert(composeJamo('A', '\u1171') == dchar.init);
} }
@system unittest @safe unittest
{ {
import std.algorithm.comparison : equal; import std.algorithm.comparison : equal;
import std.conv : text; import std.conv : text;
@ -10105,7 +10105,7 @@ if (isSomeString!S || (isRandomAccessRange!S && hasLength!S && hasSlicing!S && i
assert(s2 !is s1); assert(s2 !is s1);
} }
@system unittest @safe unittest
{ {
static void doTest(C)(const(C)[] s, const(C)[] trueUp, const(C)[] trueLow) static void doTest(C)(const(C)[] s, const(C)[] trueUp, const(C)[] trueLow)
{ {
@ -10118,9 +10118,9 @@ if (isSomeString!S || (isRandomAccessRange!S && hasLength!S && hasSlicing!S && i
assert(low == trueLow, format(diff, low, trueLow)); assert(low == trueLow, format(diff, low, trueLow));
assert(up == trueUp, format(diff, up, trueUp)); assert(up == trueUp, format(diff, up, trueUp));
assert(lowInp == trueLow, assert(lowInp == trueLow,
format(diff, cast(ubyte[]) s, cast(ubyte[]) lowInp, cast(ubyte[]) trueLow)); format(diff, cast(const(ubyte)[]) s, cast(const(ubyte)[]) lowInp, cast(const(ubyte)[]) trueLow));
assert(upInp == trueUp, assert(upInp == trueUp,
format(diff, cast(ubyte[]) s, cast(ubyte[]) upInp, cast(ubyte[]) trueUp)); format(diff, cast(const(ubyte)[]) s, cast(const(ubyte)[]) upInp, cast(const(ubyte)[]) trueUp));
} }
static foreach (S; AliasSeq!(dstring, wstring, string)) static foreach (S; AliasSeq!(dstring, wstring, string))
{{ {{