OSS/tanya
1
0
Fork 0
Code Issues 1 Pull Requests Releases Activity

Replace "Ditto." with "ditto"

Browse Source 
ddox doesn't recognize "Ditto.".
This commit is contained in:
Eugen Wissner
2017-09-22 04:08:50 +02:00
parent 4612d5eb6d
commit ee48c25328
16 changed files with 130 additions and 130 deletions
Download Patch File Download Diff File Expand all files Collapse all files

46
source/tanya/container/array.d
View File

@ -177,7 +177,7 @@ struct Array(T)
/// The range types for $(D_PSYMBOL Array).
alias Range = .Range!Array;
/// Ditto.
/// ditto
alias ConstRange = .Range!(const Array);
private size_t length_;
@ -245,7 +245,7 @@ struct Array(T)
insertBack(init[]);
}
/// Ditto.
/// ditto
this(R)(R init, shared Allocator allocator = defaultAllocator) @trusted
if (is(R == Array))
{
@ -313,14 +313,14 @@ struct Array(T)
length_ = len;
}
/// Ditto.
/// ditto
this(const size_t len, shared Allocator allocator = defaultAllocator)
{
this(allocator);
length = len;
}
/// Ditto.
/// ditto
this(shared Allocator allocator)
in
{
@ -416,7 +416,7 @@ struct Array(T)
return length_;
}
/// Ditto.
/// ditto
size_t opDollar() const
{
return length;
@ -704,7 +704,7 @@ struct Array(T)
return 1;
}
/// Ditto.
/// ditto
size_t insertBack(R)(ref R el) @trusted
if (isImplicitlyConvertible!(R, T))
{
@ -714,7 +714,7 @@ struct Array(T)
return 1;
}
/// Ditto.
/// ditto
size_t insertBack(R)(R el)
if (!isInfinite!R
&& isInputRange!R
@ -732,13 +732,13 @@ struct Array(T)
return retLength;
}
/// Ditto.
/// ditto
size_t insertBack(size_t R)(T[R] el)
{
return insertBack!(T[])(el[]);
}
/// Ditto.
/// ditto
alias insert = insertBack;
///
@ -813,7 +813,7 @@ struct Array(T)
return inserted;
}
/// Ditto.
/// ditto
size_t insertAfter(size_t R)(Range r, T[R] el)
in
{
@ -826,7 +826,7 @@ struct Array(T)
return insertAfter!(T[])(r, el[]);
}
/// Ditto.
/// ditto
size_t insertAfter(R)(Range r, auto ref R el)
if (isImplicitlyConvertible!(R, T))
in
@ -853,7 +853,7 @@ struct Array(T)
return 1;
}
/// Ditto.
/// ditto
size_t insertBefore(R)(Range r, R el)
if (!isInfinite!R
&& isInputRange!R
@ -869,7 +869,7 @@ struct Array(T)
return insertAfter(Range(this, this.data, r.begin), el);
}
/// Ditto.
/// ditto
size_t insertBefore(size_t R)(Range r, T[R] el)
in
{
@ -882,7 +882,7 @@ struct Array(T)
return insertBefore!(T[])(r, el[]);
}
/// Ditto.
/// ditto
size_t insertBefore(R)(Range r, auto ref R el)
if (isImplicitlyConvertible!(R, T))
in
@ -998,7 +998,7 @@ struct Array(T)
return opIndex(pos) = value;
}
/// Ditto.
/// ditto
Range opIndexAssign(E : T)(auto ref E value)
{
return opSliceAssign(value, 0, length);
@ -1028,7 +1028,7 @@ struct Array(T)
return opSliceAssign!R(value, 0, length);
}
/// Ditto.
/// ditto
Range opIndexAssign(Range value)
{
return opSliceAssign(value, 0, length);
@ -1077,7 +1077,7 @@ struct Array(T)
return typeof(return)(this, this.data, this.data + length);
}
/// Ditto.
/// ditto
ConstRange opIndex() const @trusted
{
return typeof(return)(this, this.data, this.data + length);
@ -1110,13 +1110,13 @@ struct Array(T)
return equal(this.data[0 .. length], that.data[0 .. that.length]);
}
/// Ditto.
/// ditto
bool opEquals()(auto ref const typeof(this) that) const @trusted
{
return equal(this.data[0 .. length], that.data[0 .. that.length]);
}
/// Ditto.
/// ditto
bool opEquals(Range that)
{
return equal(opIndex(), that);
@ -1233,7 +1233,7 @@ struct Array(T)
return typeof(return)(this, this.data + i, this.data + j);
}
/// Ditto.
/// ditto
ConstRange opSlice(const size_t i, const size_t j) const @trusted
in
{
@ -1317,7 +1317,7 @@ struct Array(T)
return opSlice(i, j);
}
/// Ditto.
/// ditto
Range opSliceAssign(R : T)(auto ref R value, const size_t i, const size_t j)
@trusted
in
@ -1331,7 +1331,7 @@ struct Array(T)
return opSlice(i, j);
}
/// Ditto.
/// ditto
Range opSliceAssign(Range value, const size_t i, const size_t j) @trusted
in
{
@ -1416,7 +1416,7 @@ struct Array(T)
return this = that[];
}
/// Ditto.
/// ditto
ref typeof(this) opAssign(R)(R that) @trusted
if (is(R == Array))
{

6
source/tanya/container/buffer.d
View File

@ -100,7 +100,7 @@ struct ReadBuffer(T = ubyte)
buffer_ = cast(T[]) allocator_.allocate(size * T.sizeof);
}
/// Ditto.
/// ditto
this(shared Allocator allocator)
in
{
@ -143,7 +143,7 @@ struct ReadBuffer(T = ubyte)
return length_ - start;
}
/// Ditto.
/// ditto
alias opDollar = length;
/**
@ -395,7 +395,7 @@ struct WriteBuffer(T = ubyte)
}
}
/// Ditto.
/// ditto
alias opDollar = length;
///

62
source/tanya/container/list.d
View File

@ -100,7 +100,7 @@ struct SList(T)
/// The range types for $(D_PSYMBOL SList).
alias Range = SRange!SList;
/// Ditto.
/// ditto
alias ConstRange = SRange!(const SList);
private alias Entry = SEntry!T;
@ -184,7 +184,7 @@ struct SList(T)
assert(l.empty);
}
/// Ditto.
/// ditto
this(const size_t len, shared Allocator allocator = defaultAllocator)
{
this(len, T.init, allocator);
@ -198,7 +198,7 @@ struct SList(T)
assert(l.front == 0);
}
/// Ditto.
/// ditto
this(shared Allocator allocator)
in
{
@ -232,7 +232,7 @@ struct SList(T)
this(init[], allocator);
}
/// Ditto.
/// ditto
this(R)(R init, shared Allocator allocator = defaultAllocator) @trusted
if (is(R == SList))
{
@ -356,7 +356,7 @@ struct SList(T)
return moveEntry(this.head, el);
}
/// Ditto.
/// ditto
size_t insertFront(R)(ref R el) @trusted
if (isImplicitlyConvertible!(R, T))
{
@ -378,7 +378,7 @@ struct SList(T)
assert(l.front == 8);
}
/// Ditto.
/// ditto
size_t insertFront(R)(R el) @trusted
if (!isInfinite!R
&& isInputRange!R
@ -408,13 +408,13 @@ struct SList(T)
return retLength;
}
/// Ditto.
/// ditto
size_t insertFront(size_t R)(T[R] el)
{
return insertFront!(T[])(el[]);
}
/// Ditto.
/// ditto
alias insert = insertFront;
///
@ -480,7 +480,7 @@ struct SList(T)
assert(l1 == l2);
}
/// Ditto.
/// ditto
size_t insertBefore(R)(Range r, R el)
if (!isInfinite!R
&& isInputRange!R
@ -512,7 +512,7 @@ struct SList(T)
assert(l1 == l2);
}
/// Ditto.
/// ditto
size_t insertBefore(Range r, ref T el) @trusted
in
{
@ -746,7 +746,7 @@ struct SList(T)
return typeof(return)(this.head);
}
/// Ditto.
/// ditto
ConstRange opIndex() const
{
return typeof(return)(this.head);
@ -773,7 +773,7 @@ struct SList(T)
return this = that[];
}
/// Ditto.
/// ditto
ref typeof(this) opAssign(R)(R that)
if (is(R == SList))
{
@ -1019,7 +1019,7 @@ struct DList(T)
/// The range types for $(D_PSYMBOL DList).
alias Range = DRange!DList;
/// Ditto.
/// ditto
alias ConstRange = DRange!(const DList);
private alias Entry = DEntry!T;
@ -1114,7 +1114,7 @@ struct DList(T)
assert(l.empty);
}
/// Ditto.
/// ditto
this(const size_t len, shared Allocator allocator = defaultAllocator)
{
this(len, T.init, allocator);
@ -1128,7 +1128,7 @@ struct DList(T)
assert(l.front == 0);
}
/// Ditto.
/// ditto
this(shared Allocator allocator)
in
{
@ -1162,7 +1162,7 @@ struct DList(T)
this(init[], allocator);
}
/// Ditto.
/// ditto
this(R)(R init, shared Allocator allocator = defaultAllocator) @trusted
if (is(R == DList))
{
@ -1353,7 +1353,7 @@ struct DList(T)
return moveFront(this.head, el);
}
/// Ditto.
/// ditto
size_t insertFront(R)(ref R el) @trusted
if (isImplicitlyConvertible!(R, T))
{
@ -1385,7 +1385,7 @@ struct DList(T)
assert(l.back == 5);
}
/// Ditto.
/// ditto
size_t insertFront(R)(R el)
if (!isInfinite!R
&& isInputRange!R
@ -1413,7 +1413,7 @@ struct DList(T)
assert(l1.head is l1.head.next.prev);
}
/// Ditto.
/// ditto
size_t insertFront(size_t R)(T[R] el)
{
return insertFront!(T[])(el[]);
@ -1479,7 +1479,7 @@ struct DList(T)
return moveBack(this.tail, el);
}
/// Ditto.
/// ditto
size_t insertBack(R)(ref R el) @trusted
if (isImplicitlyConvertible!(R, T))
{
@ -1511,7 +1511,7 @@ struct DList(T)
assert(l.back == value);
}
/// Ditto.
/// ditto
size_t insertBack(R)(R el) @trusted
if (!isInfinite!R
&& isInputRange!R
@ -1536,7 +1536,7 @@ struct DList(T)
return inserted;
}
/// Ditto.
/// ditto
size_t insertBack(size_t R)(T[R] el)
{
return insertBack!(T[])(el[]);
@ -1561,7 +1561,7 @@ struct DList(T)
assert(l2.back == 9);
}
/// Ditto.
/// ditto
alias insert = insertBack;
version (assert)
@ -1608,7 +1608,7 @@ struct DList(T)
assert(l1 == l2);
}
/// Ditto.
/// ditto
size_t insertBefore(Range r, ref T el) @trusted
in
{
@ -1643,7 +1643,7 @@ struct DList(T)
assert(l1 == l2);
}
/// Ditto.
/// ditto
size_t insertBefore(R)(Range r, R el)
if (!isInfinite!R
&& isInputRange!R
@ -1734,7 +1734,7 @@ struct DList(T)
assert(l.length == 1);
}
/// Ditto.
/// ditto
size_t insertAfter(Range r, ref T el) @trusted
in
{
@ -1769,7 +1769,7 @@ struct DList(T)
assert(l1 == l2);
}
/// Ditto.
/// ditto
size_t insertAfter(R)(Range r, R el)
if (!isInfinite!R
&& isInputRange!R
@ -1925,7 +1925,7 @@ struct DList(T)
assert(l.empty);
}
/// Ditto.
/// ditto
void removeBack()
in
{
@ -1998,7 +1998,7 @@ struct DList(T)
assert(l.removeFront(3) == 0);
}
/// Ditto.
/// ditto
size_t removeBack(const size_t howMany)
out (removed)
{
@ -2111,7 +2111,7 @@ struct DList(T)
return typeof(return)(this.head, this.tail);
}
/// Ditto.
/// ditto
ConstRange opIndex() const
{
return typeof(return)(this.head, this.tail);
@ -2138,7 +2138,7 @@ struct DList(T)
return this = that[];
}
/// Ditto.
/// ditto
ref typeof(this) opAssign(R)(R that)
if (is(R == DList))
{

4
source/tanya/container/queue.d
View File

@ -115,7 +115,7 @@ struct Queue(T)
enqueueEntry(temp);
}
/// Ditto.
/// ditto
void enqueue(T x)
{
auto temp = allocateEntry();
@ -212,7 +212,7 @@ struct Queue(T)
return result;
}
/// Ditto.
/// ditto
int opApply(scope int delegate(ref T) @nogc dg)
{
int result;

10
source/tanya/container/set.d
View File

@ -156,7 +156,7 @@ struct Set(T)
/// The range types for $(D_PSYMBOL Set).
alias Range = .Range!T;
/// Ditto.
/// ditto
alias ConstRange = .Range!(const T);
invariant
@ -186,7 +186,7 @@ struct Set(T)
rehash(n);
}
/// Ditto.
/// ditto
this(shared Allocator allocator)
in
{
@ -232,7 +232,7 @@ struct Set(T)
this.data = typeof(this.data)(init.data, allocator);
}
/// Ditto.
/// ditto
this(S)(S init, shared Allocator allocator = defaultAllocator)
if (is(S == Set))
in
@ -266,7 +266,7 @@ struct Set(T)
return this;
}
/// Ditto.
/// ditto
ref typeof(this) opAssign(S)(S that) @trusted
if (is(S == Set))
{
@ -614,7 +614,7 @@ struct Set(T)
return typeof(return)(this.data[]);
}
/// Ditto.
/// ditto
ConstRange opIndex() const
{
return typeof(return)(this.data[]);

40
source/tanya/container/string.d
View File

@ -417,7 +417,7 @@ struct String
}
}
/// Ditto.
/// ditto
this(S)(ref S init, shared Allocator allocator = defaultAllocator)
nothrow @trusted @nogc
if (is(Unqual!S == String))
@ -428,7 +428,7 @@ struct String
this.length_ = init.length;
}
/// Ditto.
/// ditto
this(shared Allocator allocator) pure nothrow @safe @nogc
in
{
@ -585,7 +585,7 @@ struct String
return 1;
}
/// Ditto.
/// ditto
size_t insertBack(const wchar chr) @trusted @nogc
{
reserve(length + 3);
@ -620,7 +620,7 @@ struct String
defaultAllocator.dispose(exception);
}
/// Ditto.
/// ditto
size_t insertBack(const dchar chr) @trusted @nogc
{
reserve(length + dchar.sizeof);
@ -730,7 +730,7 @@ struct String
}
}
/// Ditto.
/// ditto
size_t insertBack(R)(R str) @trusted
if (!isInfinite!R
&& isInputRange!R
@ -796,7 +796,7 @@ struct String
return this.length_ - oldLength;
}
/// Ditto.
/// ditto
size_t insertBack(R)(R str) @trusted
if (!isInfinite!R
&& isInputRange!R
@ -815,7 +815,7 @@ struct String
return insertedLength;
}
/// Ditto.
/// ditto
alias insert = insertBack;
/**
@ -943,7 +943,7 @@ struct String
return target;
}
/// Ditto.
/// ditto
ByCodeUnit!char opSliceAssign(const char[] value,
const size_t i,
const size_t j)
@ -959,7 +959,7 @@ struct String
return opSlice(i, j);
}
/// Ditto.
/// ditto
ByCodeUnit!char opSliceAssign(const char value,
const size_t i,
const size_t j)
@ -1072,7 +1072,7 @@ struct String
return typeof(return)(this, this.data, this.data + length);
}
/// Ditto.
/// ditto
ByCodeUnit!(const char) opIndex() const pure nothrow @trusted @nogc
{
return typeof(return)(this, this.data, this.data + length);
@ -1105,7 +1105,7 @@ struct String
return typeof(return)(this, this.data, this.data + length);
}
/// Ditto.
/// ditto
ByCodePoint!(const char) byCodePoint() const pure nothrow @trusted @nogc
{
return typeof(return)(this, this.data, this.data + length);
@ -1173,7 +1173,7 @@ struct String
return typeof(return)(this, this.data + i, this.data + j);
}
/// Ditto.
/// ditto
ByCodeUnit!(const char) opSlice(const size_t i, const size_t j)
const pure nothrow @trusted @nogc
in
@ -1240,7 +1240,7 @@ struct String
return this;
}
/// Ditto.
/// ditto
ref String opAssign(S)(ref S that) @trusted
if (is(Unqual!S == String))
{
@ -1301,7 +1301,7 @@ struct String
return cmp(this.data[0 .. length], that.data[0 .. that.length]);
}
/// Ditto.
/// ditto
int opCmp(S)(ByCodeUnit!S that) const @trusted
if (is(Unqual!S == char))
{
@ -1309,7 +1309,7 @@ struct String
that.begin[0 .. that.end - that.begin]);
}
/// Ditto.
/// ditto
int opCmp(S)(ByCodePoint!S that) const @trusted
if (is(Unqual!S == char))
{
@ -1317,7 +1317,7 @@ struct String
that.begin[0 .. that.end - that.begin]);
}
/// Ditto.
/// ditto
int opCmp()(const char[] that) const @trusted
{
return cmp(this.data[0 .. length], that);
@ -1362,7 +1362,7 @@ struct String
that.begin[0 .. that.end - that.begin]);
}
/// Ditto.
/// ditto
bool opEquals(S)(ByCodePoint!S that) const @trusted
if (is(Unqual!S == char))
{
@ -1370,7 +1370,7 @@ struct String
that.begin[0 .. that.end - that.begin]);
}
/// Ditto.
/// ditto
bool opEquals()(const char[] that) const @trusted
{
return equal(this.data[0 .. length], that);
@ -1443,7 +1443,7 @@ struct String
assert(s2 == "cup");
}
/// Ditto.
/// ditto
ByCodeUnit!char opIndexAssign(const char value) pure nothrow @safe @nogc
{
return opSliceAssign(value, 0, length);
@ -1456,7 +1456,7 @@ struct String
assert(s1 == "aaa");
}
/// Ditto.
/// ditto
ByCodeUnit!char opIndexAssign(const char[] value) pure nothrow @safe @nogc
{
return opSliceAssign(value, 0, length);