code
stringlengths 3
10M
| language
stringclasses 31
values |
|---|---|
module perfontain.managers.shadow;
import std.algorithm, perfontain, perfontain.managers.shadow.lispsm;
final class ShadowManager
{
this()
{
PE.onResize.permanent(_ => update);
PE.settings.shadowsChange.permanent(_ => update);
_bias = Matrix4.scale(VEC3_2) * Matrix4.translate(VEC3_2);
}
void process()
{
if (level)
{
auto s = PE.scene;
if (!s.scene)
{
return;
}
SceneData sd = {
view: s.camera.view, viewProjInversed: (s.camera.view * s.proj)
.inverse, box: s.scene.node.bbox, cameraPos: s.camera._pos,
cameraDir: s.camera._dir, lightDir: s.scene.lightDir,
};
Matrix4 view = void, proj = void;
//import perfontain.math, std.math, std.stdio;
//float q = angleTo(sd.cameraDir, sd.lightDir);
//writeln(q * TO_DEG);
calculateShadowMatrices(&sd, view.ptr, proj.ptr, lispsm);
auto vp = view * proj;
_matrix = vp * _bias;
_passActive = true;
s.draw(_depth, _sm, vp);
_passActive = false;
}
}
const tex()
{
return _sm.tex;
}
const textured()
{
return level >= Shadows.medium;
}
const normals()
{
return level >= Shadows.high;
}
bool lispsm = true;
private:
mixin publicProperty!(Matrix4, `matrix`);
mixin publicProperty!(bool, `passActive`);
static level()
{
return PE.settings.shadows;
}
void update()
{
if (level)
{
{
auto k = 2 ^^ (level - 1);
auto sz = Vector2s(PE.window.size.flat[].reduce!max * k / 4);
logger.info(`shadow map size: %s`, sz);
auto tex = new Texture(TEX_SHADOW_MAP, sz);
tex.bind(1);
_sm = new RenderTarget(tex);
}
{
auto creator = ProgramCreator(`depth`);
if (textured)
{
creator.define(`TEXTURED_SHADOWS`);
}
_depth = creator.create;
}
}
else
{
_sm = null;
_depth = null;
}
PE.scene.onUpdate;
}
RC!Program _depth;
RC!RenderTarget _sm;
immutable Matrix4 _bias;
}
|
D
|
/**
* Array container for internal usage.
*
* Copyright: Copyright Martin Nowak 2013.
* License: $(HTTP www.boost.org/LICENSE_1_0.txt, Boost License 1.0).
* Authors: Martin Nowak
*/
module core.internal.container.array;
static import common = core.internal.container.common;
import core.exception : onOutOfMemoryErrorNoGC;
struct Array(T)
{
nothrow:
@disable this(this);
~this()
{
reset();
}
void reset()
{
length = 0;
}
@property size_t length() const
{
return _length;
}
@property void length(size_t nlength)
{
import core.checkedint : mulu;
bool overflow = false;
size_t reqsize = mulu(T.sizeof, nlength, overflow);
if (!overflow)
{
if (nlength < _length)
foreach (ref val; _ptr[nlength .. _length]) common.destroy(val);
_ptr = cast(T*)common.xrealloc(_ptr, reqsize);
if (nlength > _length)
foreach (ref val; _ptr[_length .. nlength]) common.initialize(val);
_length = nlength;
}
else
onOutOfMemoryErrorNoGC();
}
@property bool empty() const
{
return !length;
}
@property ref inout(T) front() inout
in { assert(!empty); }
do
{
return _ptr[0];
}
@property ref inout(T) back() inout
in { assert(!empty); }
do
{
return _ptr[_length - 1];
}
ref inout(T) opIndex(size_t idx) inout
in { assert(idx < length); }
do
{
return _ptr[idx];
}
inout(T)[] opSlice() inout
{
return _ptr[0 .. _length];
}
inout(T)[] opSlice(size_t a, size_t b) inout
in { assert(a < b && b <= length); }
do
{
return _ptr[a .. b];
}
alias length opDollar;
void insertBack()(auto ref T val)
{
import core.checkedint : addu;
bool overflow = false;
size_t newlength = addu(length, 1, overflow);
if (!overflow)
{
length = newlength;
back = val;
}
else
onOutOfMemoryErrorNoGC();
}
void popBack()
{
length = length - 1;
}
void remove(size_t idx)
in { assert(idx < length); }
do
{
foreach (i; idx .. length - 1)
_ptr[i] = _ptr[i+1];
popBack();
}
void swap(ref Array other)
{
auto ptr = _ptr;
_ptr = other._ptr;
other._ptr = ptr;
immutable len = _length;
_length = other._length;
other._length = len;
}
invariant
{
assert(!_ptr == !_length);
}
private:
T* _ptr;
size_t _length;
}
unittest
{
Array!size_t ary;
assert(ary[] == []);
ary.insertBack(5);
assert(ary[] == [5]);
assert(ary[$-1] == 5);
ary.popBack();
assert(ary[] == []);
ary.insertBack(0);
ary.insertBack(1);
assert(ary[] == [0, 1]);
assert(ary[0 .. 1] == [0]);
assert(ary[1 .. 2] == [1]);
assert(ary[$ - 2 .. $] == [0, 1]);
size_t idx;
foreach (val; ary) assert(idx++ == val);
foreach_reverse (val; ary) assert(--idx == val);
foreach (i, val; ary) assert(i == val);
foreach_reverse (i, val; ary) assert(i == val);
ary.insertBack(2);
ary.remove(1);
assert(ary[] == [0, 2]);
assert(!ary.empty);
ary.reset();
assert(ary.empty);
ary.insertBack(0);
assert(!ary.empty);
destroy(ary);
assert(ary.empty);
// not copyable
static assert(!__traits(compiles, { Array!size_t ary2 = ary; }));
Array!size_t ary2;
static assert(!__traits(compiles, ary = ary2));
static void foo(Array!size_t copy) {}
static assert(!__traits(compiles, foo(ary)));
ary2.insertBack(0);
assert(ary.empty);
assert(ary2[] == [0]);
ary.swap(ary2);
assert(ary[] == [0]);
assert(ary2.empty);
}
unittest
{
alias RC = common.RC!();
Array!RC ary;
size_t cnt;
assert(cnt == 0);
ary.insertBack(RC(&cnt));
assert(cnt == 1);
ary.insertBack(RC(&cnt));
assert(cnt == 2);
ary.back = ary.front;
assert(cnt == 2);
ary.popBack();
assert(cnt == 1);
ary.popBack();
assert(cnt == 0);
}
unittest
{
import core.exception;
try
{
// Overflow ary.length.
auto ary = Array!size_t(cast(size_t*)0xdeadbeef, -1);
ary.insertBack(0);
}
catch (OutOfMemoryError)
{
}
try
{
// Overflow requested memory size for common.xrealloc().
auto ary = Array!size_t(cast(size_t*)0xdeadbeef, -2);
ary.insertBack(0);
}
catch (OutOfMemoryError)
{
}
}
|
D
|
# FIXED
uart.obj: C:/ti/TivaWare_C_Series-2.1.4.178/driverlib/uart.c
uart.obj: C:/ti/ccsv7/tools/compiler/ti-cgt-arm_16.9.6.LTS/include/stdbool.h
uart.obj: C:/ti/ccsv7/tools/compiler/ti-cgt-arm_16.9.6.LTS/include/stdint.h
uart.obj: C:/ti/TivaWare_C_Series-2.1.4.178/inc/hw_ints.h
uart.obj: C:/ti/TivaWare_C_Series-2.1.4.178/inc/hw_memmap.h
uart.obj: C:/ti/TivaWare_C_Series-2.1.4.178/inc/hw_sysctl.h
uart.obj: C:/ti/TivaWare_C_Series-2.1.4.178/inc/hw_types.h
uart.obj: C:/ti/TivaWare_C_Series-2.1.4.178/inc/hw_uart.h
uart.obj: C:/ti/TivaWare_C_Series-2.1.4.178/driverlib/debug.h
uart.obj: C:/ti/TivaWare_C_Series-2.1.4.178/driverlib/interrupt.h
uart.obj: C:/ti/TivaWare_C_Series-2.1.4.178/driverlib/uart.h
C:/ti/TivaWare_C_Series-2.1.4.178/driverlib/uart.c:
C:/ti/ccsv7/tools/compiler/ti-cgt-arm_16.9.6.LTS/include/stdbool.h:
C:/ti/ccsv7/tools/compiler/ti-cgt-arm_16.9.6.LTS/include/stdint.h:
C:/ti/TivaWare_C_Series-2.1.4.178/inc/hw_ints.h:
C:/ti/TivaWare_C_Series-2.1.4.178/inc/hw_memmap.h:
C:/ti/TivaWare_C_Series-2.1.4.178/inc/hw_sysctl.h:
C:/ti/TivaWare_C_Series-2.1.4.178/inc/hw_types.h:
C:/ti/TivaWare_C_Series-2.1.4.178/inc/hw_uart.h:
C:/ti/TivaWare_C_Series-2.1.4.178/driverlib/debug.h:
C:/ti/TivaWare_C_Series-2.1.4.178/driverlib/interrupt.h:
C:/ti/TivaWare_C_Series-2.1.4.178/driverlib/uart.h:
|
D
|
// Copyright Juan Manuel Cabo 2012.
// Copyright Mario Kröplin 2013.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
module dunit.assertion;
import dunit.diff;
import core.thread;
import core.time;
import std.algorithm;
import std.array;
import std.conv;
import std.string;
import std.traits;
version (unittest) import std.exception;
/**
* Thrown on an assertion failure.
*/
class AssertException : Exception
{
this(string msg = null,
string file = __FILE__,
size_t line = __LINE__)
{
super(msg.empty ? "Assertion failure" : msg, file, line);
}
}
/**
* Asserts that a condition is true.
* Throws: AssertException otherwise
*/
void assertTrue(bool condition, lazy string msg = null,
string file = __FILE__,
size_t line = __LINE__)
{
if (condition)
return;
fail(msg, file, line);
}
///
unittest
{
assertTrue(true);
assertEquals("Assertion failure",
collectExceptionMsg!AssertException(assertTrue(false)));
}
/**
* Asserts that a condition is false.
* Throws: AssertException otherwise
*/
void assertFalse(bool condition, lazy string msg = null,
string file = __FILE__,
size_t line = __LINE__)
{
if (!condition)
return;
fail(msg, file, line);
}
///
unittest
{
assertFalse(false);
assertEquals("Assertion failure",
collectExceptionMsg!AssertException(assertFalse(true)));
}
/**
* Asserts that the string values are equal.
* Throws: AssertException otherwise
*/
void assertEquals(T, U)(T expected, U actual, lazy string msg = null,
string file = __FILE__,
size_t line = __LINE__)
if (isSomeString!T)
{
if (expected == actual)
return;
string header = (msg.empty) ? null : msg ~ "; ";
fail(header ~ description(expected.to!string, actual.to!string),
file, line);
}
///
unittest
{
assertEquals("foo", "foo");
assertEquals("expected: <ba<r>> but was: <ba<z>>",
collectExceptionMsg!AssertException(assertEquals("bar", "baz")));
}
/**
* Asserts that the string values are equal.
* Throws: AssertException otherwise
*/
void assertEquals(T, U)(T expected, U actual, lazy string msg = null,
string file = __FILE__,
size_t line = __LINE__)
if (!isSomeString!T)
{
if (expected == actual)
return;
string header = (msg.empty) ? null : msg ~ "; ";
fail(header ~ "expected: <" ~ expected.to!string ~ "> but was: <"~ actual.to!string ~ ">",
file, line);
}
///
unittest
{
assertEquals(42, 42);
assertEquals("expected: <42> but was: <24>",
collectExceptionMsg!AssertException(assertEquals(42, 24)));
assertEquals(42.0, 42.0);
Object foo = new Object();
Object bar = null;
assertEquals(foo, foo);
assertEquals(bar, bar);
assertEquals("expected: <object.Object> but was: <null>",
collectExceptionMsg!AssertException(assertEquals(foo, bar)));
}
/**
* Asserts that the arrays are equal.
* Throws: AssertException otherwise
*/
void assertArrayEquals(T, U)(T[] expected, U[] actual, lazy string msg = null,
string file = __FILE__,
size_t line = __LINE__)
{
string header = (msg.empty) ? null : msg ~ "; ";
foreach (index; 0 .. min(expected.length, actual.length))
{
assertEquals(expected[index], actual[index],
header ~ "array mismatch at index " ~ index.to!string,
file, line);
}
assertEquals(expected.length, actual.length,
header ~ "array length mismatch",
file, line);
}
///
unittest
{
double[] expected = [1, 2, 3];
assertArrayEquals(expected, [1, 2, 3]);
assertEquals("array mismatch at index 1; expected: <2> but was: <2.3>",
collectExceptionMsg!AssertException(assertArrayEquals(expected, [1, 2.3])));
assertEquals("array length mismatch; expected: <3> but was: <2>",
collectExceptionMsg!AssertException(assertArrayEquals(expected, [1, 2])));
assertEquals("array mismatch at index 2; expected: <r> but was: <z>",
collectExceptionMsg!AssertException(assertArrayEquals("bar", "baz")));
}
/**
* Asserts that the associative arrays are equal.
* Throws: AssertException otherwise
*/
void assertArrayEquals(T, U, V)(T[V] expected, U[V] actual, lazy string msg = null,
string file = __FILE__,
size_t line = __LINE__)
{
string header = (msg.empty) ? null : msg ~ "; ";
foreach (key; expected.byKey)
if (key in actual)
{
assertEquals(expected[key], actual[key],
// format string key with double quotes
format(header ~ `array mismatch at key %(%s%)`, [key]),
file, line);
}
auto difference = setSymmetricDifference(expected.keys.sort, actual.keys.sort);
assertEmpty(difference,
"key mismatch; difference: %(%s, %)".format(difference));
}
///
unittest
{
double[string] expected = ["foo": 1, "bar": 2];
assertArrayEquals(expected, ["foo": 1, "bar": 2]);
assertEquals(`array mismatch at key "foo"; expected: <1> but was: <2>`,
collectExceptionMsg!AssertException(assertArrayEquals(expected, ["foo": 2])));
assertEquals(`key mismatch; difference: "bar"`,
collectExceptionMsg!AssertException(assertArrayEquals(expected, ["foo": 1])));
}
/**
* Asserts that the value is empty.
* Throws: AssertException otherwise
*/
void assertEmpty(T)(T actual, lazy string msg = null,
string file = __FILE__,
size_t line = __LINE__)
{
if (actual.empty)
return;
fail(msg, file, line);
}
///
unittest
{
assertEmpty([]);
assertEquals("Assertion failure",
collectExceptionMsg!AssertException(assertEmpty([1, 2, 3])));
}
/**
* Asserts that the value is not empty.
* Throws: AssertException otherwise
*/
void assertNotEmpty(T)(T actual, lazy string msg = null,
string file = __FILE__,
size_t line = __LINE__)
{
if (!actual.empty)
return;
fail(msg, file, line);
}
///
unittest
{
assertNotEmpty([1, 2, 3]);
assertEquals("Assertion failure",
collectExceptionMsg!AssertException(assertNotEmpty([])));
}
/**
* Asserts that the value is null.
* Throws: AssertException otherwise
*/
void assertNull(T)(T actual, lazy string msg = null,
string file = __FILE__,
size_t line = __LINE__)
{
if (actual is null)
return;
fail(msg, file, line);
}
///
unittest
{
Object foo = new Object();
assertNull(null);
assertEquals("Assertion failure",
collectExceptionMsg!AssertException(assertNull(foo)));
}
/**
* Asserts that the value is not null.
* Throws: AssertException otherwise
*/
void assertNotNull(T)(T actual, lazy string msg = null,
string file = __FILE__,
size_t line = __LINE__)
{
if (actual !is null)
return;
fail(msg, file, line);
}
///
unittest
{
Object foo = new Object();
assertNotNull(foo);
assertEquals("Assertion failure",
collectExceptionMsg!AssertException(assertNotNull(null)));
}
/**
* Asserts that the values are the same.
* Throws: AssertException otherwise
*/
void assertSame(T, U)(T expected, U actual, lazy string msg = null,
string file = __FILE__,
size_t line = __LINE__)
{
if (expected is actual)
return;
string header = (msg.empty) ? null : msg ~ "; ";
fail(header ~ "expected same: <" ~ expected.to!string ~ "> was not: <"~ actual.to!string ~ ">",
file, line);
}
///
unittest
{
Object foo = new Object();
Object bar = new Object();
assertSame(foo, foo);
assertEquals("expected same: <object.Object> was not: <object.Object>",
collectExceptionMsg!AssertException(assertSame(foo, bar)));
}
/**
* Asserts that the values are not the same.
* Throws: AssertException otherwise
*/
void assertNotSame(T, U)(T expected, U actual, lazy string msg = null,
string file = __FILE__,
size_t line = __LINE__)
{
if (expected !is actual)
return;
string header = (msg.empty) ? null : msg ~ "; ";
fail(header ~ "expected not same",
file, line);
}
///
unittest
{
Object foo = new Object();
Object bar = new Object();
assertNotSame(foo, bar);
assertEquals("expected not same",
collectExceptionMsg!AssertException(assertNotSame(foo, foo)));
}
/**
* Fails a test.
* Throws: AssertException
*/
void fail(string msg = null,
string file = __FILE__,
size_t line = __LINE__)
{
throw new AssertException(msg, file, line);
}
///
unittest
{
assertEquals("Assertion failure",
collectExceptionMsg!AssertException(fail()));
}
alias assertOp!">" assertGreaterThan;
alias assertOp!">=" assertGreaterThanOrEqual;
alias assertOp!"<" assertLessThan;
alias assertOp!"<=" assertLessThanOrEqual;
/**
* Asserts that the condition (lhs op rhs) is satisfied.
* Throws: AssertException otherwise
* See_Also: http://d.puremagic.com/issues/show_bug.cgi?id=4653
*/
template assertOp(string op)
{
void assertOp(T, U)(T lhs, U rhs, lazy string msg = null,
string file = __FILE__,
size_t line = __LINE__)
{
mixin("if (lhs " ~ op ~ " rhs) return;");
string header = (msg.empty) ? null : msg ~ "; ";
fail("%scondition (%s %s %s) not satisfied".format(header, lhs, op, rhs),
file, line);
}
}
///
unittest
{
assertOp!"<"(2, 3);
assertEquals("condition (2 >= 3) not satisfied",
collectExceptionMsg!AssertException(assertOp!">="(2, 3)));
}
/**
* Checks a probe until the timeout expires. The assert error is produced
* if the probe fails to return 'true' before the timeout.
*
* The parameter timeout determines the maximum timeout to wait before
* asserting a failure (default is 500ms).
*
* The parameter delay determines how often the predicate will be
* checked (default is 10ms).
*
* This kind of assertion is very useful to check on code that runs in another
* thread. For instance, the thread that listens to a socket.
*
* Throws: AssertException when the probe fails to become true before timeout
*/
public static void assertEventually(bool delegate() probe,
Duration timeout = msecs(500), Duration delay = msecs(10),
lazy string msg = null,
string file = __FILE__,
size_t line = __LINE__)
{
TickDuration startTime = TickDuration.currSystemTick();
while (!probe())
{
Duration elapsedTime = cast(Duration)(TickDuration.currSystemTick() - startTime);
if (elapsedTime >= timeout)
fail(msg.empty ? "timed out" : msg, file, line);
Thread.sleep(delay);
}
}
///
unittest
{
assertEventually({ static count = 0; return ++count > 42; });
assertEquals("timed out",
collectExceptionMsg!AssertException(assertEventually({ return false; })));
}
/**
* Asserts that the template function will return true when called with params
* Throws: AssertException otherwise
*/
public void assertFun(alias fun, string msg = null, string file = __FILE__,
size_t line = __LINE__, T...)(T args)
{
if(fun(args))
return;
fail(text(msg,"Predicate ",__traits(identifier, fun)," returned false with args: ",argsString(args)), file, line);
}
private string argsString(T...)(T args)
{
string s = "(";
foreach(arg; args) {
s ~= to!string(arg) ~ ", ";
}
s.length -= ", ".length;
s ~= ")";
return s;
}
|
D
|
module tpl.renderer;
import std.string;
import std.file;
import std.path;
import std.conv;
import std.variant;
import std.json;
import std.stdio;
import std.uni;
import std.functional;
import tpl.rule;
import tpl.element;
import tpl.match;
import tpl.ast;
import tpl.util;
class Renderer
{
public:
this()
{
}
bool execCmp(T)(T a, T b, Function func)
{
//writeln("--------exec cmp : ", func);
switch (func)
{
case Function.Equal:
{
return binaryFun!("a == b")(a, b);
}
case Function.Greater:
{
return binaryFun!("a > b")(a, b);
}
case Function.Less:
{
return binaryFun!("a < b")(a, b);
}
case Function.GreaterEqual:
{
return binaryFun!("a >= b")(a, b);
}
case Function.LessEqual:
{
return binaryFun!("a <= b")(a, b);
}
case Function.Different:
{
return binaryFun!("a != b")(a, b);
}
default:
{
return false;
}
}
}
bool cmp(JSONValue a, JSONValue b, Function func)
{
//writeln("--------cmp : ", func, " a type :", a.type ," b type :", b.type );
if (a.type == JSON_TYPE.OBJECT || a.type == JSON_TYPE.ARRAY)
return false;
else if (a.type == JSON_TYPE.STRING)
{
if (a.type != b.type)
return false;
return execCmp!string(a.str, b.str, func);
}
else if (a.type == JSON_TYPE.INTEGER)
{
//writeln("a :",a.integer,"b :", b.integer);
if (b.type == JSON_TYPE.INTEGER)
return execCmp!long(a.integer, b.integer, func);
else if (b.type == JSON_TYPE.UINTEGER)
{
return execCmp!long(a.integer, b.uinteger, func);
}
else
return false;
}
else if (a.type == JSON_TYPE.UINTEGER)
{
if (b.type == JSON_TYPE.INTEGER)
return execCmp!long(a.uinteger, b.integer, func);
else if (b.type == JSON_TYPE.UINTEGER)
{
return execCmp!long(a.uinteger, b.uinteger, func);
}
else
return false;
}
else if (a.type == JSON_TYPE.TRUE)
{
return true;
}
else if (a.type == JSON_TYPE.FALSE)
{
return true;
}
else
return false;
}
bool eval(JSONValue j)
{
if (j.type == JSON_TYPE.OBJECT || j.type == JSON_TYPE.ARRAY)
return true;
else if (j.type == JSON_TYPE.STRING)
{
return j.str.length > 0 ? true : false;
}
else if (j.type == JSON_TYPE.INTEGER)
{
return j.integer > 0 ? true : false;
}
else if (j.type == JSON_TYPE.TRUE)
{
return true;
}
else if (j.type == JSON_TYPE.FALSE)
{
return false;
}
else
return true;
}
T read_json(T = JSONValue)(JSONValue data, string command)
{
// writeln("------read json---- :", data.toString, " command : ",command);
T result;
if (data.type == JSON_TYPE.OBJECT)
{
auto obj = command in data;
if (obj !is null)
{
result = data[command];
}
else
{
auto cmds = split(command, ".");
if (cmds.length > 1)
{
auto first = cmds[0];
auto remain_cmd = command[first.length + 1 .. $];
// writeln("------remain cmd---- :", remain_cmd);
if (first in data)
result = read_json(data[first], remain_cmd);
else
template_engine_throw("render_error", "variable '" ~ first ~ "' not found");
}
}
return result;
}
else if (data.type == JSON_TYPE.ARRAY)
{
if (Util.is_num(command))
return data[to!int(command)];
else
{
auto cmds = split(command, ".");
if (cmds.length > 1)
{
auto first = cmds[0];
auto remain_cmd = command[first.length + 1 .. $];
// writeln("------remain cmd---- :", remain_cmd);
if (Util.is_num(first))
result = read_json(data[to!int(first)], remain_cmd);
else
template_engine_throw("render_error", "variable '" ~ first ~ "' not found");
}
}
return result;
}
else
{
return data;
}
}
T eval_expression(T = JSONValue)(ElementExpression element, ref JSONValue data)
{
auto var = eval_function!(T)(element, data);
return var;
}
T eval_function(T = JSONValue)(ElementExpression element, ref JSONValue data)
{
T result;
//writeln("------element.func---- :", element.func);
switch (element.func)
{
case Function.Upper:
{
auto res = eval_expression(element.args[0], data);
if (res.type == JSON_TYPE.STRING)
result = toUpper(res.str);
else
result = toUpper(res.toString);
return result;
}
case Function.Lower:
{
auto res = eval_expression(element.args[0], data);
if (res.type == JSON_TYPE.STRING)
result = toLower(res.str);
else
result = toLower(res.toString);
return result;
}
case Function.Equal:
case Function.Greater:
case Function.Less:
case Function.GreaterEqual:
case Function.LessEqual:
case Function.Different:
{
result = cmp(eval_expression(element.args[0], data),
eval_expression(element.args[1], data), element.func);
return result;
}
case Function.ReadJson:
{
try
{
//writeln("--read * json --:", element.command);
// if (element.command.length > 0 && element.command in data)
// result = data[element.command];
// else
// {
// auto cmds = split(element.command, ".");
// if (cmds.length > 1)
// {
// if (cmds.length == 2)
// {
// if (cmds[0] in data)
// {
// if (Util.is_num(cmds[1]))
// {
// auto idx = to!int(cmds[1]);
// result = data[cmds[0]][idx];
// }
// else if (cmds[1] in data[cmds[0]])
// result = data[cmds[0]][cmds[1]];
// }
// }
// }
// else
// result = element.command;
// }
result = read_json(data, element.command);
return result;
}
catch (Exception e)
{
template_engine_throw("render_error",
"variable '" ~ element.command ~ "' not found");
}
break;
}
case Function.Result:
{
//writeln("--read result --:", element.result.toString);
result = element.result;
return result;
}
case Function.Length:
{
auto res = eval_expression(element.args[0], data);
if (res.type == JSON_TYPE.STRING)
result = res.str.length;
else if (res.type == JSON_TYPE.ARRAY)
result = res.array.length;
else
result = 0;
return result;
}
case Function.Range:
{
auto arg0 = eval_expression(element.args[0], data);
auto arg1 = eval_expression(element.args[1], data);
JSONValue[] ar;
if (arg0.type == JSON_TYPE.INTEGER && arg1.type == JSON_TYPE.INTEGER)
{
for (long i = arg0.integer; i <= arg1.integer; i++)
ar ~= JSONValue(i);
}
result = ar;
return result;
}
case Function.Sort:
{
// auto res = eval_expression(element.args[0], data);
// if (res.type == JSON_TYPE.ARRAY)
// {
// import std.algorithm.sorting;
// result = sort!("a > b")(res.array);
// }
// return result;
}
case Function.Default:
{
//writeln("-----Function.Default----");
try
{
return eval_expression!(T)(element.args[0], data);
}
catch (Exception e)
{
return eval_expression!(T)(element.args[1], data);
}
}
default:
{
template_engine_throw("render_error",
"function '" ~ to!string(element.func) ~ "' not found");
}
}
template_engine_throw("render_error", "unknown function in render: " ~ element.command);
return T();
}
string render(ASTNode temp, ref JSONValue data)
{
string result = "";
//writeln("------temp.parsed_node.children-----: ",temp.parsed_node.children.length);
foreach (element; temp.parsed_node.children)
{
//writeln("------element.type-----: ",element.type);
switch (element.type)
{
case Type.String:
{
auto element_string = cast(ElementString)(element);
result ~= element_string.text;
break;
}
case Type.Expression:
{
auto element_expression = cast(ElementExpression)(element);
auto variable = eval_expression(element_expression, data);
// writeln("-----variable.type-------: ",variable.type);
if (variable.type == JSON_TYPE.STRING)
{
result ~= variable.str;
}
else
{
result ~= variable.toString;
}
break;
}
case Type.Loop:
{
auto element_loop = cast(ElementLoop)(element);
switch (element_loop.loop)
{
case Loop.ForListIn:
{
auto list = eval_expression(element_loop.list, data);
//writeln("----list ----: ", list);
if (list.type != JSON_TYPE.ARRAY)
{
template_engine_throw("render_error",
list.toString ~ " is not an array");
}
foreach (size_t k, v; list)
{
//writeln("v.type : ",v.type, " v.tostring :",v.toString);
JSONValue data_loop = parseJSON(data.toString);
data_loop["index"] = k;
data_loop[element_loop.value] = v;
result ~= render(new ASTNode(element_loop), data_loop);
}
break;
}
case Loop.ForMapIn:
{
auto map = eval_expression(element_loop.list, data);
//writeln("----Loop type ----: ", map.type," map.toString : ",map.toString);
if (map.type != JSON_TYPE.OBJECT)
{
template_engine_throw("render_error",
map.toString ~ " is not an object");
}
foreach (string k, v; map)
{
JSONValue data_loop = data;
data_loop[element_loop.key] = k;
data_loop[element_loop.value] = v;
result ~= render(new ASTNode(element_loop), data_loop);
}
break;
}
default:
{
break;
}
}
break;
}
case Type.Condition:
{
auto element_condition = cast(ElementConditionContainer)(element);
foreach (branch; element_condition.children)
{
auto element_branch = cast(ElementConditionBranch)(branch);
//writeln("-----element_branch.type-------: ",element_branch.condition_type);
auto flg = eval_expression(element_branch.condition, data);
//writeln("-----flg.type-------: ",flg.type);
if (element_branch.condition_type == Condition.Else || eval(flg))
{
result ~= render(new ASTNode(element_branch), data);
break;
}
}
break;
}
default:
{
break;
}
}
}
return result;
}
}
|
D
|
/*
Copyright (c) 2014-2016 Timur Gafarov
Boost Software License - Version 1.0 - August 17th, 2003
Permission is hereby granted, free of charge, to any person or organization
obtaining a copy of the software and accompanying documentation covered by
this license (the "Software") to use, reproduce, display, distribute,
execute, and transmit the Software, and to prepare derivative works of the
Software, and to permit third-parties to whom the Software is furnished to
do so, all subject to the following:
The copyright notices in the Software and this entire statement, including
the above license grant, this restriction and the following disclaimer,
must be included in all copies of the Software, in whole or in part, and
all derivative works of the Software, unless such copies or derivative
works are solely in the form of machine-executable object code generated by
a source language processor.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE.
*/
module dagon.core.event;
import std.stdio;
import std.ascii;
import derelict.sdl2.sdl;
import dlib.core.memory;
import dagon.core.ownership;
enum EventType
{
KeyDown,
KeyUp,
TextInput,
MouseMotion,
MouseButtonDown,
MouseButtonUp,
MouseWheel,
JoystickButtonDown,
JoystickButtonUp,
JoystickAxisMotion,
Resize,
FocusLoss,
FocusGain,
Quit,
UserEvent
}
struct Event
{
EventType type;
int key;
dchar unicode;
int button;
int joystickButton;
int joystickAxis;
int joystickAxisValue;
int width;
int height;
int userCode;
int mouseWheelX;
int mouseWheelY;
}
class EventManager
{
SDL_Window* window;
enum maxNumEvents = 50;
Event[maxNumEvents] eventStack;
Event[maxNumEvents] userEventStack;
uint numEvents;
uint numUserEvents;
bool running = true;
bool[512] keyPressed = false;
bool[255] mouseButtonPressed = false;
int mouseX = 0;
int mouseY = 0;
bool enableKeyRepeat = false;
double deltaTime = 0.0;
double averageDelta = 0.0;
uint deltaTimeMs = 0;
int fps = 0;
//uint videoWidth;
//uint videoHeight;
uint windowWidth;
uint windowHeight;
bool windowFocused = true;
this(SDL_Window* win, uint winWidth, uint winHeight)
{
window = win;
windowWidth = winWidth;
windowHeight = winHeight;
//auto videoInfo = SDL_GetVideoInfo();
//videoWidth = videoInfo.current_w;
//videoHeight = videoInfo.current_h;
}
void addEvent(Event e)
{
if (numEvents < maxNumEvents)
{
eventStack[numEvents] = e;
numEvents++;
}
else
writeln("Warning: event stack overflow");
}
void addUserEvent(Event e)
{
if (numUserEvents < maxNumEvents)
{
userEventStack[numUserEvents] = e;
numUserEvents++;
}
else
writeln("Warning: user event stack overflow");
}
void generateUserEvent(int code)
{
Event e = Event(EventType.UserEvent);
e.userCode = code;
addUserEvent(e);
}
void update()
{
numEvents = 0;
updateTimer();
//if (SDL_WasInit(SDL_INIT_JOYSTICK))
// SDL_JoystickUpdate();
for (uint i = 0; i < numUserEvents; i++)
{
Event e = userEventStack[i];
addEvent(e);
}
numUserEvents = 0;
SDL_Event event;
while(SDL_PollEvent(&event))
{
Event e;
switch (event.type)
{
case SDL_KEYDOWN:
if (event.key.repeat && !enableKeyRepeat)
break;
if ((event.key.keysym.unicode & 0xFF80) == 0)
{
auto asciiChar = event.key.keysym.unicode & 0x7F;
if (isPrintable(asciiChar))
{
e = Event(EventType.TextInput);
e.unicode = asciiChar;
addEvent(e);
}
}
else
{
e = Event(EventType.TextInput);
e.unicode = event.key.keysym.unicode;
addEvent(e);
}
keyPressed[event.key.keysym.scancode] = true;
e = Event(EventType.KeyDown);
e.key = event.key.keysym.scancode;
addEvent(e);
break;
case SDL_KEYUP:
keyPressed[event.key.keysym.scancode] = false;
e = Event(EventType.KeyUp);
e.key = event.key.keysym.scancode;
addEvent(e);
break;
case SDL_MOUSEMOTION:
mouseX = event.motion.x;
mouseY = windowHeight - event.motion.y;
break;
case SDL_MOUSEBUTTONDOWN:
mouseButtonPressed[event.button.button] = true;
e = Event(EventType.MouseButtonDown);
e.button = event.button.button;
addEvent(e);
break;
case SDL_MOUSEBUTTONUP:
mouseButtonPressed[event.button.button] = false;
e = Event(EventType.MouseButtonUp);
e.button = event.button.button;
addEvent(e);
break;
case SDL_MOUSEWHEEL:
e = Event(EventType.MouseWheel);
e.mouseWheelX = event.wheel.x;
e.mouseWheelY = event.wheel.y;
addEvent(e);
break;
case SDL_JOYBUTTONDOWN:
// TODO: add state modification
e = Event(EventType.JoystickButtonDown);
e.button = event.jbutton.button+1;
addEvent(e);
break;
case SDL_JOYBUTTONUP:
// TODO: add state modification
e = Event(EventType.JoystickButtonUp);
e.button = event.jbutton.button+1;
addEvent(e);
break;
case SDL_JOYAXISMOTION:
// TODO: add state modification
e = Event(EventType.JoystickAxisMotion);
e.joystickAxis = event.jaxis.axis;
e.joystickAxis = event.jaxis.value;
addEvent(e);
break;
//case SDL_WINDOWEVENT_RESIZED:
case SDL_WINDOWEVENT:
if (event.window.event == SDL_WINDOWEVENT_SIZE_CHANGED)
{
windowWidth = event.window.data1;
windowHeight = event.window.data2;
e = Event(EventType.Resize);
e.width = windowWidth;
e.height = windowHeight;
addEvent(e);
}
break;
/*
case SDL_ACTIVEEVENT:
if (event.active.state & SDL_APPACTIVE)
{
if (event.active.gain == 0)
{
writeln("Deactivated");
windowFocused = false;
e = Event(EventType.FocusLoss);
}
else
{
writeln("Activated");
windowFocused = true;
e = Event(EventType.FocusGain);
}
}
else if (event.active.state & SDL_APPINPUTFOCUS)
{
if (event.active.gain == 0)
{
writeln("Lost focus");
windowFocused = false;
e = Event(EventType.FocusLoss);
}
else
{
writeln("Gained focus");
windowFocused = true;
e = Event(EventType.FocusGain);
}
}
addEvent(e);
break;
*/
case SDL_QUIT:
running = false;
e = Event(EventType.Quit);
addEvent(e);
break;
default:
break;
}
}
}
void updateTimer()
{
static int currentTime;
static int lastTime;
static int FPSTickCounter;
static int FPSCounter = 0;
currentTime = SDL_GetTicks();
auto elapsedTime = currentTime - lastTime;
lastTime = currentTime;
deltaTimeMs = elapsedTime;
deltaTime = cast(double)(elapsedTime) * 0.001;
FPSTickCounter += elapsedTime;
FPSCounter++;
if (FPSTickCounter >= 1000) // 1 sec interval
{
fps = FPSCounter;
FPSCounter = 0;
FPSTickCounter = 0;
averageDelta = 1.0 / cast(double)(fps);
}
}
void setMouse(int x, int y)
{
SDL_WarpMouseInWindow(window, x, y);
mouseX = x;
mouseY = y;
}
void setMouseToCenter()
{
float x = (cast(float)windowWidth)/2;
float y = (cast(float)windowHeight)/2;
setMouse(cast(int)x, cast(int)y);
}
/*
void setMouse(int x, int y)
{
SDL_WarpMouseInWindow(window, mx, my);
mouseX = x;
mouseY = y;
}
void setMouseToCenter()
{
float x = (cast(float)windowWidth)/2;
float y = (cast(float)windowHeight)/2;
SDL_WarpMouse(cast(ushort)x, cast(ushort)(y));
mouseX = cast(int)x;
mouseY = cast(int)y;
}
*/
void showCursor(bool mode)
{
SDL_ShowCursor(mode);
}
float aspectRatio()
{
return cast(float)windowWidth / cast(float)windowHeight;
}
}
abstract class EventListener: Owner
{
EventManager eventManager;
bool enabled = true;
this(EventManager emngr, Owner owner)
{
super(owner);
eventManager = emngr;
}
protected void generateUserEvent(int code)
{
eventManager.generateUserEvent(code);
}
void processEvents()
{
if (!enabled)
return;
for (uint i = 0; i < eventManager.numEvents; i++)
{
Event* e = &eventManager.eventStack[i];
processEvent(e);
}
}
void processEvent(Event* e)
{
switch(e.type)
{
case EventType.KeyDown:
onKeyDown(e.key);
break;
case EventType.KeyUp:
onKeyUp(e.key);
break;
case EventType.TextInput:
onTextInput(e.unicode);
break;
case EventType.MouseButtonDown:
onMouseButtonDown(e.button);
break;
case EventType.MouseButtonUp:
onMouseButtonUp(e.button);
break;
case EventType.MouseWheel:
onMouseWheel(e.mouseWheelX, e.mouseWheelY);
break;
case EventType.JoystickButtonDown:
onJoystickButtonDown(e.joystickButton);
break;
case EventType.JoystickButtonUp:
onJoystickButtonDown(e.joystickButton);
break;
case EventType.JoystickAxisMotion:
onJoystickAxisMotion(e.joystickAxis, e.joystickAxisValue);
break;
case EventType.Resize:
onResize(e.width, e.height);
break;
case EventType.FocusLoss:
onFocusLoss();
break;
case EventType.FocusGain:
onFocusGain();
break;
case EventType.Quit:
onQuit();
break;
case EventType.UserEvent:
onUserEvent(e.userCode);
break;
default:
break;
}
}
void onKeyDown(int key) {}
void onKeyUp(int key) {}
void onTextInput(dchar code) {}
void onMouseButtonDown(int button) {}
void onMouseButtonUp(int button) {}
void onMouseWheel(int x, int y) {}
void onJoystickButtonDown(int button) {}
void onJoystickButtonUp(int button) {}
void onJoystickAxisMotion(int axis, int value) {}
void onResize(int width, int height) {}
void onFocusLoss() {}
void onFocusGain() {}
void onQuit() {}
void onUserEvent(int code) {}
}
|
D
|
module deepmagic.dom.elements.grouping;
package import deepmagic.dom.elements.grouping.blockquote_element;
package import deepmagic.dom.elements.grouping.dd_element;
package import deepmagic.dom.elements.grouping.div_element;
package import deepmagic.dom.elements.grouping.dl_element;
package import deepmagic.dom.elements.grouping.dt_element;
package import deepmagic.dom.elements.grouping.figcaption_element;
package import deepmagic.dom.elements.grouping.figure_element;
package import deepmagic.dom.elements.grouping.hr_element;
package import deepmagic.dom.elements.grouping.li_element;
package import deepmagic.dom.elements.grouping.main_element;
package import deepmagic.dom.elements.grouping.ol_element;
package import deepmagic.dom.elements.grouping.p_element;
package import deepmagic.dom.elements.grouping.pre_element;
package import deepmagic.dom.elements.grouping.ul_element;
|
D
|
/Users/varaprasadp/Desktop/React/Example/ios/build/Build/Intermediates/Example.build/Debug-iphonesimulator/Example.build/Objects-normal/x86_64/RNBarChartView.o : /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/RNChartViewBase.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/RNBarLineChartViewBase.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bar/RNBarChartViewBase.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/RNYAxisChartViewBase.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/combine/RNCombinedChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/pie/RNPieChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bubble/RNBubbleChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/line/RNLineChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/candlestick/RNCandleStickChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bar/RNBarChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bar/RNHorizontalBarChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/radar/RNRadarChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/scatter/RNScatterChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/BalloonMarker.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/formatters/LargeValueFormatter.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/utils/BridgeUtils.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/utils/ChartDataSetConfigUtils.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/utils/EntryToDictionaryUtils.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/DataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/combine/CombinedDataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/pie/PieDataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bubble/BubbleDataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/candlestick/CandleDataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/line/LineDataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bar/BarDataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/radar/RadarDataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/scatter/ScatterDataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/combine/RNCombinedChartView.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/pie/RNPieChartView.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bubble/RNBubbleChartView.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/line/RNLineChartView.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/candlestick/RNCandleStickChartView.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bar/RNBarChartView.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bar/RNHorizontalBarChartView.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/radar/RNRadarChartView.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/scatter/RNScatterChartView.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreText.apinotesc /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/SwiftyJSON/SwiftyJSON.framework/Modules/SwiftyJSON.swiftmodule/x86_64.swiftmodule /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/Charts/Charts.framework/Modules/Charts.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/yoga/Yoga.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/SwiftyJSON/SwiftyJSON.framework/Headers/SwiftyJSON-umbrella.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/Charts/Charts.framework/Headers/Charts-umbrella.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTBridge.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTBridgeModule.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTBorderStyle.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTTextDecorationLineType.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTAnimationType.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTFrameUpdate.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTBridgeDelegate.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTInvalidating.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTLog.h /Users/varaprasadp/Desktop/React/Example/ios/Example-Bridging-Header.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTJavaScriptLoader.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTUIManager.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTViewManager.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTEventDispatcher.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTEventEmitter.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTDefines.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/yoga/YGEnums.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/yoga/YGMacros.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTPointerEvents.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/UIView+React.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/SwiftyJSON/SwiftyJSON.framework/Headers/SwiftyJSON-Swift.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/Charts/Charts.framework/Headers/Charts-Swift.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTComponent.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTAssert.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTConvert.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTRootView.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/SwiftyJSON/SwiftyJSON.framework/Modules/module.modulemap /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/Charts/Charts.framework/Modules/module.modulemap
/Users/varaprasadp/Desktop/React/Example/ios/build/Build/Intermediates/Example.build/Debug-iphonesimulator/Example.build/Objects-normal/x86_64/RNBarChartView~partial.swiftmodule : /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/RNChartViewBase.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/RNBarLineChartViewBase.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bar/RNBarChartViewBase.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/RNYAxisChartViewBase.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/combine/RNCombinedChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/pie/RNPieChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bubble/RNBubbleChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/line/RNLineChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/candlestick/RNCandleStickChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bar/RNBarChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bar/RNHorizontalBarChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/radar/RNRadarChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/scatter/RNScatterChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/BalloonMarker.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/formatters/LargeValueFormatter.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/utils/BridgeUtils.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/utils/ChartDataSetConfigUtils.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/utils/EntryToDictionaryUtils.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/DataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/combine/CombinedDataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/pie/PieDataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bubble/BubbleDataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/candlestick/CandleDataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/line/LineDataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bar/BarDataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/radar/RadarDataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/scatter/ScatterDataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/combine/RNCombinedChartView.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/pie/RNPieChartView.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bubble/RNBubbleChartView.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/line/RNLineChartView.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/candlestick/RNCandleStickChartView.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bar/RNBarChartView.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bar/RNHorizontalBarChartView.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/radar/RNRadarChartView.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/scatter/RNScatterChartView.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreText.apinotesc /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/SwiftyJSON/SwiftyJSON.framework/Modules/SwiftyJSON.swiftmodule/x86_64.swiftmodule /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/Charts/Charts.framework/Modules/Charts.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/yoga/Yoga.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/SwiftyJSON/SwiftyJSON.framework/Headers/SwiftyJSON-umbrella.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/Charts/Charts.framework/Headers/Charts-umbrella.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTBridge.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTBridgeModule.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTBorderStyle.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTTextDecorationLineType.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTAnimationType.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTFrameUpdate.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTBridgeDelegate.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTInvalidating.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTLog.h /Users/varaprasadp/Desktop/React/Example/ios/Example-Bridging-Header.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTJavaScriptLoader.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTUIManager.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTViewManager.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTEventDispatcher.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTEventEmitter.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTDefines.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/yoga/YGEnums.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/yoga/YGMacros.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTPointerEvents.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/UIView+React.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/SwiftyJSON/SwiftyJSON.framework/Headers/SwiftyJSON-Swift.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/Charts/Charts.framework/Headers/Charts-Swift.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTComponent.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTAssert.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTConvert.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTRootView.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/SwiftyJSON/SwiftyJSON.framework/Modules/module.modulemap /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/Charts/Charts.framework/Modules/module.modulemap
/Users/varaprasadp/Desktop/React/Example/ios/build/Build/Intermediates/Example.build/Debug-iphonesimulator/Example.build/Objects-normal/x86_64/RNBarChartView~partial.swiftdoc : /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/RNChartViewBase.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/RNBarLineChartViewBase.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bar/RNBarChartViewBase.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/RNYAxisChartViewBase.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/combine/RNCombinedChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/pie/RNPieChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bubble/RNBubbleChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/line/RNLineChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/candlestick/RNCandleStickChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bar/RNBarChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bar/RNHorizontalBarChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/radar/RNRadarChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/scatter/RNScatterChartManager.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/BalloonMarker.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/formatters/LargeValueFormatter.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/utils/BridgeUtils.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/utils/ChartDataSetConfigUtils.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/utils/EntryToDictionaryUtils.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/DataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/combine/CombinedDataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/pie/PieDataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bubble/BubbleDataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/candlestick/CandleDataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/line/LineDataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bar/BarDataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/radar/RadarDataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/scatter/ScatterDataExtract.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/combine/RNCombinedChartView.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/pie/RNPieChartView.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bubble/RNBubbleChartView.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/line/RNLineChartView.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/candlestick/RNCandleStickChartView.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bar/RNBarChartView.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/bar/RNHorizontalBarChartView.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/radar/RNRadarChartView.swift /Users/varaprasadp/Desktop/React/ios/ReactNativeCharts/scatter/RNScatterChartView.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreText.apinotesc /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/SwiftyJSON/SwiftyJSON.framework/Modules/SwiftyJSON.swiftmodule/x86_64.swiftmodule /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/Charts/Charts.framework/Modules/Charts.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/yoga/Yoga.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/SwiftyJSON/SwiftyJSON.framework/Headers/SwiftyJSON-umbrella.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/Charts/Charts.framework/Headers/Charts-umbrella.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTBridge.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTBridgeModule.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTBorderStyle.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTTextDecorationLineType.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTAnimationType.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTFrameUpdate.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTBridgeDelegate.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTInvalidating.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTLog.h /Users/varaprasadp/Desktop/React/Example/ios/Example-Bridging-Header.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTJavaScriptLoader.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTUIManager.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTViewManager.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTEventDispatcher.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTEventEmitter.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTDefines.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/yoga/YGEnums.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/yoga/YGMacros.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTPointerEvents.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/UIView+React.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/SwiftyJSON/SwiftyJSON.framework/Headers/SwiftyJSON-Swift.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/Charts/Charts.framework/Headers/Charts-Swift.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTComponent.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTAssert.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTConvert.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/include/React/RCTRootView.h /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/SwiftyJSON/SwiftyJSON.framework/Modules/module.modulemap /Users/varaprasadp/Desktop/React/Example/ios/build/Build/Products/Debug-iphonesimulator/Charts/Charts.framework/Modules/module.modulemap
|
D
|
/Users/deepansh/Desktop/ForexWatchlist/DerivedData/ForexWatchlist/Build/Intermediates.noindex/Pods.build/Debug-iphonesimulator/RxSwift.build/Objects-normal/x86_64/ScheduledItemType.o : /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Amb.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/SingleAsync.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/DistinctUntilChanged.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Deferred.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Deprecated.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Enumerated.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/Maybe.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/AsMaybe.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Sequence.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/DataStructures/InfiniteSequence.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/ObservableType+PrimitiveSequence.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/PrimitiveSequence.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Debounce.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Reduce.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Range.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Merge.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Take.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Cancelable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/ScheduledDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/CompositeDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/SerialDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/BooleanDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/SubscriptionDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/NopDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/AnonymousDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/SingleAssignmentDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/RefCountDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/BinaryDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/Completable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/GroupedObservable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/Single.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/AsSingle.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/TakeWhile.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/SkipWhile.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Sample.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Throttle.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/ShareReplayScope.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Concurrency/SynchronizedUnsubscribeType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/Internal/InvocableType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/ObservableType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/ConnectableObservableType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/ObservableConvertibleType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Concurrency/SynchronizedDisposeType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/Internal/ScheduledItemType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Concurrency/SynchronizedOnType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/SchedulerType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/ImmediateSchedulerType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Concurrency/LockOwnerType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/VirtualTimeConverterType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/ObserverType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Subjects/SubjectType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/DisposeBase.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observers/ObserverBase.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Create.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Generate.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/DataStructures/Queue.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/DataStructures/PriorityQueue.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Reactive.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Materialize.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Dematerialize.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/AddRef.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/DataStructures/Bag.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/DisposeBag.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Using.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Debug.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Catch.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Date+Dispatch.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Switch.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/StartWith.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Concurrency/Lock.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Concurrency/AsyncLock.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/RecursiveLock.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Sink.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observers/TailRecursiveSink.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Optional.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/TakeUntil.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/SkipUntil.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/Internal/ScheduledItem.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/Internal/InvocableScheduledItem.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/WithLatestFrom.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/SubscribeOn.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/ObserveOn.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Scan.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/Completable+AndThen.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/RetryWhen.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/Platform.Darwin.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/SchedulerServices+Emulation.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/Internal/DispatchQueueConfiguration.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Zip+Collection.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/CombineLatest+Collection.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/DelaySubscription.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Do.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Map.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/CompactMap.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Zip.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Skip.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Producer.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Buffer.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/CurrentThreadScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/VirtualTimeScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/SerialDispatchQueueScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/ConcurrentDispatchQueueScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/OperationQueueScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/RecursiveScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/HistoricalScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/MainScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/ConcurrentMainScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Timer.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Filter.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/HistoricalSchedulerTimeConverter.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Never.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observers/AnonymousObserver.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/AnyObserver.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Error.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/Disposables.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/ObservableType+Extensions.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/DispatchQueue+Extensions.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Errors.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/ElementAt.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Concat.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Repeat.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Subjects/AsyncSubject.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Subjects/PublishSubject.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Subjects/BehaviorSubject.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Subjects/ReplaySubject.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/AtomicInt.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Event.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/SwiftSupport/SwiftSupport.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/TakeLast.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Multicast.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/CombineLatest.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/First.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Just.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Timeout.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Window.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Extensions/Bag+Rx.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Rx.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/RxMutableBox.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/Platform.Linux.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/GroupBy.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Delay.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/ToArray.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/PrimitiveSequence+Zip+arity.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Zip+arity.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/CombineLatest+arity.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Empty.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/SwitchIfEmpty.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/DefaultIfEmpty.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/ObjectiveC.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/CoreImage.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/QuartzCore.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/Dispatch.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/Metal.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/Darwin.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/Foundation.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/CoreFoundation.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/CoreGraphics.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/Swift.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/UIKit.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/SwiftOnoneSupport.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/Combine.swiftmodule/x86_64-apple-ios-simulator.swiftmodule /Users/deepansh/Desktop/ForexWatchlist/Pods/Target\ Support\ Files/RxSwift/RxSwift-umbrella.h /Users/deepansh/Desktop/ForexWatchlist/DerivedData/ForexWatchlist/Build/Intermediates.noindex/Pods.build/Debug-iphonesimulator/RxSwift.build/unextended-module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/OpenGLES.framework/Headers/OpenGLES.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/apinotes/Dispatch.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/UserNotifications.framework/Headers/UserNotifications.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/UIKit.framework/Headers/UIKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
/Users/deepansh/Desktop/ForexWatchlist/DerivedData/ForexWatchlist/Build/Intermediates.noindex/Pods.build/Debug-iphonesimulator/RxSwift.build/Objects-normal/x86_64/ScheduledItemType~partial.swiftmodule : /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Amb.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/SingleAsync.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/DistinctUntilChanged.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Deferred.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Deprecated.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Enumerated.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/Maybe.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/AsMaybe.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Sequence.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/DataStructures/InfiniteSequence.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/ObservableType+PrimitiveSequence.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/PrimitiveSequence.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Debounce.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Reduce.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Range.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Merge.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Take.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Cancelable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/ScheduledDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/CompositeDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/SerialDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/BooleanDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/SubscriptionDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/NopDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/AnonymousDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/SingleAssignmentDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/RefCountDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/BinaryDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/Completable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/GroupedObservable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/Single.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/AsSingle.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/TakeWhile.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/SkipWhile.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Sample.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Throttle.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/ShareReplayScope.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Concurrency/SynchronizedUnsubscribeType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/Internal/InvocableType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/ObservableType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/ConnectableObservableType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/ObservableConvertibleType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Concurrency/SynchronizedDisposeType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/Internal/ScheduledItemType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Concurrency/SynchronizedOnType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/SchedulerType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/ImmediateSchedulerType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Concurrency/LockOwnerType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/VirtualTimeConverterType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/ObserverType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Subjects/SubjectType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/DisposeBase.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observers/ObserverBase.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Create.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Generate.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/DataStructures/Queue.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/DataStructures/PriorityQueue.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Reactive.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Materialize.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Dematerialize.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/AddRef.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/DataStructures/Bag.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/DisposeBag.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Using.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Debug.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Catch.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Date+Dispatch.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Switch.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/StartWith.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Concurrency/Lock.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Concurrency/AsyncLock.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/RecursiveLock.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Sink.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observers/TailRecursiveSink.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Optional.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/TakeUntil.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/SkipUntil.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/Internal/ScheduledItem.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/Internal/InvocableScheduledItem.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/WithLatestFrom.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/SubscribeOn.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/ObserveOn.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Scan.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/Completable+AndThen.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/RetryWhen.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/Platform.Darwin.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/SchedulerServices+Emulation.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/Internal/DispatchQueueConfiguration.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Zip+Collection.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/CombineLatest+Collection.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/DelaySubscription.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Do.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Map.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/CompactMap.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Zip.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Skip.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Producer.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Buffer.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/CurrentThreadScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/VirtualTimeScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/SerialDispatchQueueScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/ConcurrentDispatchQueueScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/OperationQueueScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/RecursiveScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/HistoricalScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/MainScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/ConcurrentMainScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Timer.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Filter.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/HistoricalSchedulerTimeConverter.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Never.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observers/AnonymousObserver.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/AnyObserver.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Error.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/Disposables.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/ObservableType+Extensions.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/DispatchQueue+Extensions.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Errors.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/ElementAt.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Concat.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Repeat.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Subjects/AsyncSubject.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Subjects/PublishSubject.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Subjects/BehaviorSubject.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Subjects/ReplaySubject.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/AtomicInt.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Event.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/SwiftSupport/SwiftSupport.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/TakeLast.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Multicast.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/CombineLatest.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/First.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Just.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Timeout.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Window.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Extensions/Bag+Rx.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Rx.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/RxMutableBox.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/Platform.Linux.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/GroupBy.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Delay.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/ToArray.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/PrimitiveSequence+Zip+arity.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Zip+arity.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/CombineLatest+arity.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Empty.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/SwitchIfEmpty.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/DefaultIfEmpty.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/ObjectiveC.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/CoreImage.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/QuartzCore.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/Dispatch.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/Metal.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/Darwin.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/Foundation.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/CoreFoundation.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/CoreGraphics.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/Swift.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/UIKit.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/SwiftOnoneSupport.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/Combine.swiftmodule/x86_64-apple-ios-simulator.swiftmodule /Users/deepansh/Desktop/ForexWatchlist/Pods/Target\ Support\ Files/RxSwift/RxSwift-umbrella.h /Users/deepansh/Desktop/ForexWatchlist/DerivedData/ForexWatchlist/Build/Intermediates.noindex/Pods.build/Debug-iphonesimulator/RxSwift.build/unextended-module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/OpenGLES.framework/Headers/OpenGLES.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/apinotes/Dispatch.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/UserNotifications.framework/Headers/UserNotifications.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/UIKit.framework/Headers/UIKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
/Users/deepansh/Desktop/ForexWatchlist/DerivedData/ForexWatchlist/Build/Intermediates.noindex/Pods.build/Debug-iphonesimulator/RxSwift.build/Objects-normal/x86_64/ScheduledItemType~partial.swiftdoc : /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Amb.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/SingleAsync.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/DistinctUntilChanged.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Deferred.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Deprecated.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Enumerated.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/Maybe.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/AsMaybe.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Sequence.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/DataStructures/InfiniteSequence.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/ObservableType+PrimitiveSequence.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/PrimitiveSequence.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Debounce.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Reduce.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Range.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Merge.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Take.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Cancelable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/ScheduledDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/CompositeDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/SerialDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/BooleanDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/SubscriptionDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/NopDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/AnonymousDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/SingleAssignmentDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/RefCountDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/BinaryDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/Completable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/GroupedObservable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/Single.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/AsSingle.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/TakeWhile.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/SkipWhile.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Sample.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Throttle.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/ShareReplayScope.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Concurrency/SynchronizedUnsubscribeType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/Internal/InvocableType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/ObservableType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/ConnectableObservableType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/ObservableConvertibleType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Concurrency/SynchronizedDisposeType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/Internal/ScheduledItemType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Concurrency/SynchronizedOnType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/SchedulerType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/ImmediateSchedulerType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Concurrency/LockOwnerType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/VirtualTimeConverterType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/ObserverType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Subjects/SubjectType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/DisposeBase.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observers/ObserverBase.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Create.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Generate.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/DataStructures/Queue.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/DataStructures/PriorityQueue.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Reactive.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Materialize.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Dematerialize.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/AddRef.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/DataStructures/Bag.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/DisposeBag.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Using.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Debug.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Catch.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Date+Dispatch.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Switch.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/StartWith.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Concurrency/Lock.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Concurrency/AsyncLock.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/RecursiveLock.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Sink.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observers/TailRecursiveSink.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Optional.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/TakeUntil.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/SkipUntil.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/Internal/ScheduledItem.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/Internal/InvocableScheduledItem.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/WithLatestFrom.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/SubscribeOn.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/ObserveOn.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Scan.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/Completable+AndThen.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/RetryWhen.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/Platform.Darwin.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/SchedulerServices+Emulation.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/Internal/DispatchQueueConfiguration.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Zip+Collection.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/CombineLatest+Collection.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/DelaySubscription.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Do.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Map.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/CompactMap.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Zip.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Skip.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Producer.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Buffer.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/CurrentThreadScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/VirtualTimeScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/SerialDispatchQueueScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/ConcurrentDispatchQueueScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/OperationQueueScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/RecursiveScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/HistoricalScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/MainScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/ConcurrentMainScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Timer.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Filter.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/HistoricalSchedulerTimeConverter.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Never.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observers/AnonymousObserver.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/AnyObserver.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Error.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/Disposables.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/ObservableType+Extensions.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/DispatchQueue+Extensions.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Errors.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/ElementAt.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Concat.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Repeat.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Subjects/AsyncSubject.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Subjects/PublishSubject.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Subjects/BehaviorSubject.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Subjects/ReplaySubject.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/AtomicInt.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Event.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/SwiftSupport/SwiftSupport.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/TakeLast.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Multicast.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/CombineLatest.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/First.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Just.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Timeout.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Window.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Extensions/Bag+Rx.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Rx.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/RxMutableBox.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/Platform.Linux.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/GroupBy.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Delay.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/ToArray.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/PrimitiveSequence+Zip+arity.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Zip+arity.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/CombineLatest+arity.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Empty.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/SwitchIfEmpty.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/DefaultIfEmpty.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/ObjectiveC.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/CoreImage.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/QuartzCore.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/Dispatch.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/Metal.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/Darwin.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/Foundation.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/CoreFoundation.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/CoreGraphics.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/Swift.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/UIKit.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/SwiftOnoneSupport.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/Combine.swiftmodule/x86_64-apple-ios-simulator.swiftmodule /Users/deepansh/Desktop/ForexWatchlist/Pods/Target\ Support\ Files/RxSwift/RxSwift-umbrella.h /Users/deepansh/Desktop/ForexWatchlist/DerivedData/ForexWatchlist/Build/Intermediates.noindex/Pods.build/Debug-iphonesimulator/RxSwift.build/unextended-module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/OpenGLES.framework/Headers/OpenGLES.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/apinotes/Dispatch.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/UserNotifications.framework/Headers/UserNotifications.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/UIKit.framework/Headers/UIKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
/Users/deepansh/Desktop/ForexWatchlist/DerivedData/ForexWatchlist/Build/Intermediates.noindex/Pods.build/Debug-iphonesimulator/RxSwift.build/Objects-normal/x86_64/ScheduledItemType~partial.swiftsourceinfo : /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Amb.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/SingleAsync.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/DistinctUntilChanged.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Deferred.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Deprecated.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Enumerated.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/Maybe.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/AsMaybe.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Sequence.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/DataStructures/InfiniteSequence.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/ObservableType+PrimitiveSequence.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/PrimitiveSequence.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Debounce.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Reduce.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Range.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Merge.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Take.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Cancelable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/ScheduledDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/CompositeDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/SerialDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/BooleanDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/SubscriptionDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/NopDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/AnonymousDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/SingleAssignmentDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/RefCountDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/BinaryDisposable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/Completable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/GroupedObservable.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/Single.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/AsSingle.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/TakeWhile.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/SkipWhile.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Sample.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Throttle.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/ShareReplayScope.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Concurrency/SynchronizedUnsubscribeType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/Internal/InvocableType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/ObservableType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/ConnectableObservableType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/ObservableConvertibleType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Concurrency/SynchronizedDisposeType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/Internal/ScheduledItemType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Concurrency/SynchronizedOnType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/SchedulerType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/ImmediateSchedulerType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Concurrency/LockOwnerType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/VirtualTimeConverterType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/ObserverType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Subjects/SubjectType.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/DisposeBase.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observers/ObserverBase.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Create.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Generate.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/DataStructures/Queue.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/DataStructures/PriorityQueue.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Reactive.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Materialize.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Dematerialize.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/AddRef.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/DataStructures/Bag.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/DisposeBag.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Using.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Debug.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Catch.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Date+Dispatch.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Switch.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/StartWith.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Concurrency/Lock.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Concurrency/AsyncLock.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/RecursiveLock.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Sink.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observers/TailRecursiveSink.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Optional.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/TakeUntil.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/SkipUntil.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/Internal/ScheduledItem.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/Internal/InvocableScheduledItem.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/WithLatestFrom.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/SubscribeOn.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/ObserveOn.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Scan.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/Completable+AndThen.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/RetryWhen.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/Platform.Darwin.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/SchedulerServices+Emulation.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/Internal/DispatchQueueConfiguration.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Zip+Collection.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/CombineLatest+Collection.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/DelaySubscription.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Do.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Map.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/CompactMap.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Zip.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Skip.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Producer.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Buffer.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/CurrentThreadScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/VirtualTimeScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/SerialDispatchQueueScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/ConcurrentDispatchQueueScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/OperationQueueScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/RecursiveScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/HistoricalScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/MainScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/ConcurrentMainScheduler.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Timer.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Filter.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Schedulers/HistoricalSchedulerTimeConverter.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Never.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observers/AnonymousObserver.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/AnyObserver.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Error.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Disposables/Disposables.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/ObservableType+Extensions.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/DispatchQueue+Extensions.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Errors.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/ElementAt.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Concat.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Repeat.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Subjects/AsyncSubject.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Subjects/PublishSubject.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Subjects/BehaviorSubject.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Subjects/ReplaySubject.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/AtomicInt.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Event.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/SwiftSupport/SwiftSupport.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/TakeLast.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Multicast.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/CombineLatest.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/First.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Just.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Timeout.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Window.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Extensions/Bag+Rx.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Rx.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/RxMutableBox.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/Platform/Platform.Linux.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/GroupBy.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Delay.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/ToArray.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Traits/PrimitiveSequence+Zip+arity.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Zip+arity.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/CombineLatest+arity.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/Empty.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/SwitchIfEmpty.swift /Users/deepansh/Desktop/ForexWatchlist/Pods/RxSwift/RxSwift/Observables/DefaultIfEmpty.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/ObjectiveC.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/CoreImage.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/QuartzCore.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/Dispatch.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/Metal.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/Darwin.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/Foundation.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/CoreFoundation.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/CoreGraphics.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/Swift.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/UIKit.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/SwiftOnoneSupport.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/prebuilt-modules/Combine.swiftmodule/x86_64-apple-ios-simulator.swiftmodule /Users/deepansh/Desktop/ForexWatchlist/Pods/Target\ Support\ Files/RxSwift/RxSwift-umbrella.h /Users/deepansh/Desktop/ForexWatchlist/DerivedData/ForexWatchlist/Build/Intermediates.noindex/Pods.build/Debug-iphonesimulator/RxSwift.build/unextended-module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/OpenGLES.framework/Headers/OpenGLES.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/apinotes/Dispatch.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/UserNotifications.framework/Headers/UserNotifications.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/UIKit.framework/Headers/UIKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator13.6.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
|
D
|
/Users/lap14205/Documents/home/blockchain_learning/casper/casper-get-started/src/tests/target/debug/build/crunchy-575b8330c1f4e441/build_script_build-575b8330c1f4e441: /Users/lap14205/.cargo/registry/src/github.com-1ecc6299db9ec823/crunchy-0.2.2/build.rs
/Users/lap14205/Documents/home/blockchain_learning/casper/casper-get-started/src/tests/target/debug/build/crunchy-575b8330c1f4e441/build_script_build-575b8330c1f4e441.d: /Users/lap14205/.cargo/registry/src/github.com-1ecc6299db9ec823/crunchy-0.2.2/build.rs
/Users/lap14205/.cargo/registry/src/github.com-1ecc6299db9ec823/crunchy-0.2.2/build.rs:
|
D
|
/**
* Windows API header module
*
* Translated from MinGW Windows headers
*
* Authors: Stewart Gordon
* License: $(LINK2 http://www.boost.org/LICENSE_1_0.txt, Boost License 1.0)
* Source: $(DRUNTIMESRC src/core/sys/windows/_winldap.d)
*/
module core.sys.windows.winldap;
version (Windows):
version (ANSI) {} else version = Unicode;
/* Comment from MinGW
winldap.h - Header file for the Windows LDAP API
Written by Filip Navara <xnavara@volny.cz>
References:
The C LDAP Application Program Interface
http://www.watersprings.org/pub/id/draft-ietf-ldapext-ldap-c-api-05.txt
Lightweight Directory Access Protocol Reference
http://msdn.microsoft.com/library/en-us/netdir/ldap/ldap_reference.asp
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
*/
import core.sys.windows.schannel, core.sys.windows.winber;
private import core.sys.windows.wincrypt, core.sys.windows.windef;
//align(4):
enum {
LDAP_VERSION1 = 1,
LDAP_VERSION2 = 2,
LDAP_VERSION3 = 3,
LDAP_VERSION = LDAP_VERSION2,
LDAP_VERSION_MIN = LDAP_VERSION2,
LDAP_VERSION_MAX = LDAP_VERSION3
}
/* MinGW defines ANSI and Unicode versions as LDAP_VENDOR_NAME and
* LDAP_VENDOR_NAME_W respectively; similarly with other string constants
* defined in this module.
*/
const TCHAR[] LDAP_VENDOR_NAME = "Microsoft Corporation.";
enum LDAP_API_VERSION = 2004;
enum LDAP_VENDOR_VERSION = 510;
enum LDAP_API_INFO_VERSION = 1;
enum LDAP_FEATURE_INFO_VERSION = 1;
enum {
LDAP_SUCCESS = 0x00,
LDAP_OPT_SUCCESS = LDAP_SUCCESS,
LDAP_OPERATIONS_ERROR,
LDAP_PROTOCOL_ERROR,
LDAP_TIMELIMIT_EXCEEDED,
LDAP_SIZELIMIT_EXCEEDED,
LDAP_COMPARE_FALSE,
LDAP_COMPARE_TRUE,
LDAP_STRONG_AUTH_NOT_SUPPORTED,
LDAP_AUTH_METHOD_NOT_SUPPORTED = LDAP_STRONG_AUTH_NOT_SUPPORTED,
LDAP_STRONG_AUTH_REQUIRED,
LDAP_REFERRAL_V2,
LDAP_PARTIAL_RESULTS = LDAP_REFERRAL_V2,
LDAP_REFERRAL,
LDAP_ADMIN_LIMIT_EXCEEDED,
LDAP_UNAVAILABLE_CRIT_EXTENSION,
LDAP_CONFIDENTIALITY_REQUIRED,
LDAP_SASL_BIND_IN_PROGRESS, // = 0x0e
LDAP_NO_SUCH_ATTRIBUTE = 0x10,
LDAP_UNDEFINED_TYPE,
LDAP_INAPPROPRIATE_MATCHING,
LDAP_CONSTRAINT_VIOLATION,
LDAP_TYPE_OR_VALUE_EXISTS,
LDAP_ATTRIBUTE_OR_VALUE_EXISTS = LDAP_TYPE_OR_VALUE_EXISTS,
LDAP_INVALID_SYNTAX, // = 0x15
LDAP_NO_SUCH_OBJECT = 0x20,
LDAP_ALIAS_PROBLEM,
LDAP_INVALID_DN_SYNTAX,
LDAP_IS_LEAF,
LDAP_ALIAS_DEREF_PROBLEM, // = 0x24
LDAP_INAPPROPRIATE_AUTH = 0x30,
LDAP_INVALID_CREDENTIALS,
LDAP_INSUFFICIENT_ACCESS,
LDAP_INSUFFICIENT_RIGHTS = LDAP_INSUFFICIENT_ACCESS,
LDAP_BUSY,
LDAP_UNAVAILABLE,
LDAP_UNWILLING_TO_PERFORM,
LDAP_LOOP_DETECT, // = 0x36
LDAP_NAMING_VIOLATION = 0x40,
LDAP_OBJECT_CLASS_VIOLATION,
LDAP_NOT_ALLOWED_ON_NONLEAF,
LDAP_NOT_ALLOWED_ON_RDN,
LDAP_ALREADY_EXISTS,
LDAP_NO_OBJECT_CLASS_MODS,
LDAP_RESULTS_TOO_LARGE,
LDAP_AFFECTS_MULTIPLE_DSAS, // = 0x47
LDAP_OTHER = 0x50,
LDAP_SERVER_DOWN,
LDAP_LOCAL_ERROR,
LDAP_ENCODING_ERROR,
LDAP_DECODING_ERROR,
LDAP_TIMEOUT,
LDAP_AUTH_UNKNOWN,
LDAP_FILTER_ERROR,
LDAP_USER_CANCELLED,
LDAP_PARAM_ERROR,
LDAP_NO_MEMORY,
LDAP_CONNECT_ERROR,
LDAP_NOT_SUPPORTED,
LDAP_CONTROL_NOT_FOUND,
LDAP_NO_RESULTS_RETURNED,
LDAP_MORE_RESULTS_TO_RETURN,
LDAP_CLIENT_LOOP,
LDAP_REFERRAL_LIMIT_EXCEEDED // = 0x61
}
enum {
LDAP_PORT = 389,
LDAP_SSL_PORT = 636,
LDAP_GC_PORT = 3268,
LDAP_SSL_GC_PORT = 3269
}
enum void*
LDAP_OPT_OFF = null,
LDAP_OPT_ON = cast(void*) 1;
enum {
LDAP_OPT_API_INFO = 0x00,
LDAP_OPT_DESC,
LDAP_OPT_DEREF,
LDAP_OPT_SIZELIMIT,
LDAP_OPT_TIMELIMIT,
LDAP_OPT_THREAD_FN_PTRS,
LDAP_OPT_REBIND_FN,
LDAP_OPT_REBIND_ARG,
LDAP_OPT_REFERRALS,
LDAP_OPT_RESTART,
LDAP_OPT_SSL,
LDAP_OPT_TLS = LDAP_OPT_SSL,
LDAP_OPT_IO_FN_PTRS, // = 0x0b
LDAP_OPT_CACHE_FN_PTRS = 0x0d,
LDAP_OPT_CACHE_STRATEGY,
LDAP_OPT_CACHE_ENABLE,
LDAP_OPT_REFERRAL_HOP_LIMIT,
LDAP_OPT_PROTOCOL_VERSION,
LDAP_OPT_VERSION = LDAP_OPT_PROTOCOL_VERSION,
LDAP_OPT_SERVER_CONTROLS,
LDAP_OPT_CLIENT_CONTROLS, // = 0x13
LDAP_OPT_API_FEATURE_INFO = 0x15,
LDAP_OPT_HOST_NAME = 0x30,
LDAP_OPT_ERROR_NUMBER,
LDAP_OPT_ERROR_STRING,
LDAP_OPT_SERVER_ERROR,
LDAP_OPT_SERVER_EXT_ERROR, // = 0x34
LDAP_OPT_PING_KEEP_ALIVE = 0x36,
LDAP_OPT_PING_WAIT_TIME,
LDAP_OPT_PING_LIMIT, // = 0x38
LDAP_OPT_DNSDOMAIN_NAME = 0x3b,
LDAP_OPT_GETDSNAME_FLAGS = 0x3d,
LDAP_OPT_HOST_REACHABLE,
LDAP_OPT_PROMPT_CREDENTIALS,
LDAP_OPT_TCP_KEEPALIVE, // = 0x40
LDAP_OPT_REFERRAL_CALLBACK = 0x70,
LDAP_OPT_CLIENT_CERTIFICATE = 0x80,
LDAP_OPT_SERVER_CERTIFICATE, // = 0x81
LDAP_OPT_AUTO_RECONNECT = 0x91,
LDAP_OPT_SSPI_FLAGS,
LDAP_OPT_SSL_INFO,
LDAP_OPT_TLS_INFO = LDAP_OPT_SSL_INFO,
LDAP_OPT_REF_DEREF_CONN_PER_MSG,
LDAP_OPT_SIGN,
LDAP_OPT_ENCRYPT,
LDAP_OPT_SASL_METHOD,
LDAP_OPT_AREC_EXCLUSIVE,
LDAP_OPT_SECURITY_CONTEXT,
LDAP_OPT_ROOTDSE_CACHE // = 0x9a
}
enum {
LDAP_DEREF_NEVER,
LDAP_DEREF_SEARCHING,
LDAP_DEREF_FINDING,
LDAP_DEREF_ALWAYS
}
enum LDAP_NO_LIMIT = 0;
const TCHAR[] LDAP_CONTROL_REFERRALS = "1.2.840.113556.1.4.616";
// FIXME: check type (declared with U suffix in MinGW)
enum : uint {
LDAP_CHASE_SUBORDINATE_REFERRALS = 0x20,
LDAP_CHASE_EXTERNAL_REFERRALS = 0x40
}
enum {
LDAP_SCOPE_DEFAULT = -1,
LDAP_SCOPE_BASE,
LDAP_SCOPE_ONELEVEL,
LDAP_SCOPE_SUBTREE
}
enum {
LDAP_MOD_ADD,
LDAP_MOD_DELETE,
LDAP_MOD_REPLACE,
LDAP_MOD_BVALUES = 0x80
}
enum : int {
LDAP_RES_BIND = 0x61,
LDAP_RES_SEARCH_ENTRY = 0x64,
LDAP_RES_SEARCH_RESULT = 0x65,
LDAP_RES_MODIFY = 0x67,
LDAP_RES_ADD = 0x69,
LDAP_RES_DELETE = 0x6b,
LDAP_RES_MODRDN = 0x6d,
LDAP_RES_COMPARE = 0x6f,
LDAP_RES_SEARCH_REFERENCE = 0x73,
LDAP_RES_EXTENDED = 0x78,
LDAP_RES_ANY = -1
}
enum {
LDAP_MSG_ONE,
LDAP_MSG_ALL,
LDAP_MSG_RECEIVED
}
const TCHAR[]
LDAP_SERVER_SORT_OID = "1.2.840.113556.1.4.473",
LDAP_SERVER_RESP_SORT_OID = "1.2.840.113556.1.4.474",
LDAP_PAGED_RESULT_OID_STRING = "1.2.840.113556.1.4.319",
LDAP_CONTROL_VLVREQUEST = "2.16.840.1.113730.3.4.9",
LDAP_CONTROL_VLVRESPONSE = "2.16.840.1.113730.3.4.10",
LDAP_START_TLS_OID = "1.3.6.1.4.1.1466.20037",
LDAP_TTL_EXTENDED_OP_OID = "1.3.6.1.4.1.1466.101.119.1";
enum {
LDAP_AUTH_NONE = 0x00U,
LDAP_AUTH_SIMPLE = 0x80U,
LDAP_AUTH_SASL = 0x83U,
LDAP_AUTH_OTHERKIND = 0x86U,
LDAP_AUTH_EXTERNAL = LDAP_AUTH_OTHERKIND | 0x0020U,
LDAP_AUTH_SICILY = LDAP_AUTH_OTHERKIND | 0x0200U,
LDAP_AUTH_NEGOTIATE = LDAP_AUTH_OTHERKIND | 0x0400U,
LDAP_AUTH_MSN = LDAP_AUTH_OTHERKIND | 0x0800U,
LDAP_AUTH_NTLM = LDAP_AUTH_OTHERKIND | 0x1000U,
LDAP_AUTH_DIGEST = LDAP_AUTH_OTHERKIND | 0x4000U,
LDAP_AUTH_DPA = LDAP_AUTH_OTHERKIND | 0x2000U,
LDAP_AUTH_SSPI = LDAP_AUTH_NEGOTIATE
}
enum {
LDAP_FILTER_AND = 0xa0,
LDAP_FILTER_OR,
LDAP_FILTER_NOT,
LDAP_FILTER_EQUALITY,
LDAP_FILTER_SUBSTRINGS,
LDAP_FILTER_GE,
LDAP_FILTER_LE, // = 0xa6
LDAP_FILTER_APPROX = 0xa8,
LDAP_FILTER_EXTENSIBLE,
LDAP_FILTER_PRESENT = 0x87
}
enum {
LDAP_SUBSTRING_INITIAL = 0x80,
LDAP_SUBSTRING_ANY,
LDAP_SUBSTRING_FINAL
}
// should be opaque structure
struct LDAP {
struct _ld_sp {
UINT_PTR sb_sd;
UCHAR[(10*ULONG.sizeof)+1] Reserved1;
ULONG_PTR sb_naddr;
UCHAR[(6*ULONG.sizeof)] Reserved2;
}
_ld_sp ld_sp;
PCHAR ld_host;
ULONG ld_version;
UCHAR ld_lberoptions;
int ld_deref;
int ld_timelimit;
int ld_sizelimit;
int ld_errno;
PCHAR ld_matched;
PCHAR ld_error;
}
alias LDAP* PLDAP;
// should be opaque structure
struct LDAPMessage {
ULONG lm_msgid;
ULONG lm_msgtype;
BerElement* lm_ber;
LDAPMessage* lm_chain;
LDAPMessage* lm_next;
ULONG lm_time;
}
alias LDAPMessage* PLDAPMessage;
struct LDAP_TIMEVAL {
LONG tv_sec;
LONG tv_usec;
}
alias LDAP_TIMEVAL* PLDAP_TIMEVAL;
struct LDAPAPIInfoA {
int ldapai_info_version;
int ldapai_api_version;
int ldapai_protocol_version;
char** ldapai_extensions;
char* ldapai_vendor_name;
int ldapai_vendor_version;
}
alias LDAPAPIInfoA* PLDAPAPIInfoA;
struct LDAPAPIInfoW {
int ldapai_info_version;
int ldapai_api_version;
int ldapai_protocol_version;
PWCHAR* ldapai_extensions;
PWCHAR ldapai_vendor_name;
int ldapai_vendor_version;
}
alias LDAPAPIInfoW* PLDAPAPIInfoW;
struct LDAPAPIFeatureInfoA {
int ldapaif_info_version;
char* ldapaif_name;
int ldapaif_version;
}
alias LDAPAPIFeatureInfoA* PLDAPAPIFeatureInfoA;
struct LDAPAPIFeatureInfoW {
int ldapaif_info_version;
PWCHAR ldapaif_name;
int ldapaif_version;
}
alias LDAPAPIFeatureInfoW* PLDAPAPIFeatureInfoW;
struct LDAPControlA {
PCHAR ldctl_oid;
BerValue ldctl_value;
BOOLEAN ldctl_iscritical;
}
alias LDAPControlA* PLDAPControlA;
struct LDAPControlW {
PWCHAR ldctl_oid;
BerValue ldctl_value;
BOOLEAN ldctl_iscritical;
}
alias LDAPControlW* PLDAPControlW;
/* Do we really need these? In MinGW, LDAPModA/W have only mod_op, mod_type
* and mod_vals, and macros are used to simulate anonymous unions in those
* structures.
*/
union mod_vals_u_tA {
PCHAR* modv_strvals;
BerValue** modv_bvals;
}
union mod_vals_u_tW {
PWCHAR* modv_strvals;
BerValue** modv_bvals;
}
struct LDAPModA {
ULONG mod_op;
PCHAR mod_type;
union {
mod_vals_u_tA mod_vals;
// The following members are defined as macros in MinGW.
PCHAR* mod_values;
BerValue** mod_bvalues;
}
}
alias LDAPModA* PLDAPModA;
struct LDAPModW {
ULONG mod_op;
PWCHAR mod_type;
union {
mod_vals_u_tW mod_vals;
// The following members are defined as macros in MinGW.
PWCHAR* mod_values;
BerValue** mod_bvalues;
}
}
alias LDAPModW* PLDAPModW;
/* Opaque structure
* http://msdn.microsoft.com/library/en-us/ldap/ldap/ldapsearch.asp
*/
struct LDAPSearch;
alias LDAPSearch* PLDAPSearch;
struct LDAPSortKeyA {
PCHAR sk_attrtype;
PCHAR sk_matchruleoid;
BOOLEAN sk_reverseorder;
}
alias LDAPSortKeyA* PLDAPSortKeyA;
struct LDAPSortKeyW {
PWCHAR sk_attrtype;
PWCHAR sk_matchruleoid;
BOOLEAN sk_reverseorder;
}
alias LDAPSortKeyW* PLDAPSortKeyW;
/* MinGW defines these as immediate function typedefs, which don't translate
* well into D.
*/
extern (C) {
alias ULONG function(PLDAP, PLDAP, PWCHAR, PCHAR, ULONG, PVOID, PVOID,
PLDAP*) QUERYFORCONNECTION;
alias BOOLEAN function(PLDAP, PLDAP, PWCHAR, PCHAR, PLDAP, ULONG, PVOID,
PVOID, ULONG) NOTIFYOFNEWCONNECTION;
alias ULONG function(PLDAP, PLDAP) DEREFERENCECONNECTION;
alias BOOLEAN function(PLDAP, PSecPkgContext_IssuerListInfoEx,
PCCERT_CONTEXT*) QUERYCLIENTCERT;
}
struct LDAP_REFERRAL_CALLBACK {
ULONG SizeOfCallbacks;
QUERYFORCONNECTION* QueryForConnection;
NOTIFYOFNEWCONNECTION* NotifyRoutine;
DEREFERENCECONNECTION* DereferenceRoutine;
}
alias LDAP_REFERRAL_CALLBACK* PLDAP_REFERRAL_CALLBACK;
struct LDAPVLVInfo {
int ldvlv_version;
uint ldvlv_before_count;
uint ldvlv_after_count;
uint ldvlv_offset;
uint ldvlv_count;
BerValue* ldvlv_attrvalue;
BerValue* ldvlv_context;
void* ldvlv_extradata;
}
/*
* Under Microsoft WinLDAP the function ldap_error is only stub.
* This macro uses LDAP structure to get error string and pass it to the user.
*/
private extern (C) int printf(in char* format, ...);
int ldap_perror(LDAP* handle, char* message) {
return printf("%s: %s\n", message, handle.ld_error);
}
/* FIXME: In MinGW, these are WINLDAPAPI == DECLSPEC_IMPORT. Linkage
* attribute?
*/
extern (C) {
PLDAP ldap_initA(PCHAR, ULONG);
PLDAP ldap_initW(PWCHAR, ULONG);
PLDAP ldap_openA(PCHAR, ULONG);
PLDAP ldap_openW(PWCHAR, ULONG);
PLDAP cldap_openA(PCHAR, ULONG);
PLDAP cldap_openW(PWCHAR, ULONG);
ULONG ldap_connect(LDAP*, LDAP_TIMEVAL*);
PLDAP ldap_sslinitA(PCHAR, ULONG, int);
PLDAP ldap_sslinitW(PWCHAR, ULONG, int);
ULONG ldap_start_tls_sA(LDAP*, PLDAPControlA*, PLDAPControlA*);
ULONG ldap_start_tls_sW(LDAP*, PLDAPControlW*, PLDAPControlW*);
BOOLEAN ldap_stop_tls_s(LDAP*);
ULONG ldap_get_optionA(LDAP*, int, void*);
ULONG ldap_get_optionW(LDAP*, int, void*);
ULONG ldap_set_optionA(LDAP*, int, void*);
ULONG ldap_set_optionW(LDAP*, int, void*);
ULONG ldap_control_freeA(LDAPControlA*);
ULONG ldap_control_freeW(LDAPControlW*);
ULONG ldap_controls_freeA(LDAPControlA**);
ULONG ldap_controls_freeW(LDAPControlW**);
ULONG ldap_free_controlsA(LDAPControlA**);
ULONG ldap_free_controlsW(LDAPControlW**);
ULONG ldap_sasl_bindA(LDAP*, PCSTR, PCSTR, BERVAL*, PLDAPControlA*,
PLDAPControlA*, int*);
ULONG ldap_sasl_bindW(LDAP*, PCWSTR, PCWSTR, BERVAL*, PLDAPControlW*,
PLDAPControlW*, int*);
ULONG ldap_sasl_bind_sA(LDAP*, PCSTR, PCSTR, BERVAL*, PLDAPControlA*,
PLDAPControlA*, PBERVAL*);
ULONG ldap_sasl_bind_sW(LDAP*, PCWSTR, PCWSTR, BERVAL*, PLDAPControlW*,
PLDAPControlW*, PBERVAL*);
ULONG ldap_simple_bindA(LDAP*, PSTR, PSTR);
ULONG ldap_simple_bindW(LDAP*, PWSTR, PWSTR);
ULONG ldap_simple_bind_sA(LDAP*, PSTR, PSTR);
ULONG ldap_simple_bind_sW(LDAP*, PWSTR, PWSTR);
ULONG ldap_unbind(LDAP*);
ULONG ldap_unbind_s(LDAP*);
ULONG ldap_search_extA(LDAP*, PCSTR, ULONG, PCSTR, PZPSTR, ULONG,
PLDAPControlA*, PLDAPControlA*, ULONG, ULONG, ULONG*);
ULONG ldap_search_extW(LDAP*, PCWSTR, ULONG, PCWSTR, PZPWSTR, ULONG,
PLDAPControlW*, PLDAPControlW*, ULONG, ULONG, ULONG*);
ULONG ldap_search_ext_sA(LDAP*, PCSTR, ULONG, PCSTR, PZPSTR, ULONG,
PLDAPControlA*, PLDAPControlA*, LDAP_TIMEVAL*, ULONG, PLDAPMessage*);
ULONG ldap_search_ext_sW(LDAP*, PCWSTR, ULONG, PCWSTR, PZPWSTR, ULONG,
PLDAPControlW*, PLDAPControlW*, LDAP_TIMEVAL*, ULONG, PLDAPMessage*);
ULONG ldap_searchA(LDAP*, PCSTR, ULONG, PCSTR, PZPSTR, ULONG);
ULONG ldap_searchW(LDAP*, PCWSTR, ULONG, PCWSTR, PZPWSTR, ULONG);
ULONG ldap_search_sA(LDAP*, PCSTR, ULONG, PCSTR, PZPSTR, ULONG,
PLDAPMessage*);
ULONG ldap_search_sW(LDAP*, PCWSTR, ULONG, PCWSTR, PZPWSTR, ULONG,
PLDAPMessage*);
ULONG ldap_search_stA(LDAP*, PCSTR, ULONG, PCSTR, PZPSTR, ULONG,
LDAP_TIMEVAL*, PLDAPMessage*);
ULONG ldap_search_stW(LDAP*, PCWSTR, ULONG, PCWSTR, PZPWSTR, ULONG,
LDAP_TIMEVAL*, PLDAPMessage*);
ULONG ldap_compare_extA(LDAP*, PCSTR, PCSTR, PCSTR, BerValue*,
PLDAPControlA*, PLDAPControlA*, ULONG*);
ULONG ldap_compare_extW(LDAP*, PCWSTR, PCWSTR, PCWSTR, BerValue*,
PLDAPControlW*, PLDAPControlW*, ULONG*);
ULONG ldap_compare_ext_sA(LDAP*, PCSTR, PCSTR, PCSTR, BerValue*,
PLDAPControlA*, PLDAPControlA*);
ULONG ldap_compare_ext_sW(LDAP*, PCWSTR, PCWSTR, PCWSTR, BerValue*,
PLDAPControlW*, PLDAPControlW*);
ULONG ldap_compareA(LDAP*, PCSTR, PCSTR, PCSTR);
ULONG ldap_compareW(LDAP*, PCWSTR, PCWSTR, PCWSTR);
ULONG ldap_compare_sA(LDAP*, PCSTR, PCSTR, PCSTR);
ULONG ldap_compare_sW(LDAP*, PCWSTR, PCWSTR, PCWSTR);
ULONG ldap_modify_extA(LDAP*, PCSTR, LDAPModA**, PLDAPControlA*,
PLDAPControlA*, ULONG*);
ULONG ldap_modify_extW(LDAP*, PCWSTR, LDAPModW**, PLDAPControlW*,
PLDAPControlW*, ULONG*);
ULONG ldap_modify_ext_sA(LDAP*, PCSTR, LDAPModA**, PLDAPControlA*,
PLDAPControlA*);
ULONG ldap_modify_ext_sW(LDAP*, PCWSTR, LDAPModW**, PLDAPControlW*,
PLDAPControlW*);
ULONG ldap_modifyA(LDAP*, PSTR, LDAPModA**);
ULONG ldap_modifyW(LDAP*, PWSTR, LDAPModW**);
ULONG ldap_modify_sA(LDAP*, PSTR, LDAPModA**);
ULONG ldap_modify_sW(LDAP*, PWSTR, LDAPModW**);
ULONG ldap_rename_extA(LDAP*, PCSTR, PCSTR, PCSTR, INT, PLDAPControlA*,
PLDAPControlA*, ULONG*);
ULONG ldap_rename_extW(LDAP*, PCWSTR, PCWSTR, PCWSTR, INT, PLDAPControlW*,
PLDAPControlW*, ULONG*);
ULONG ldap_rename_ext_sA(LDAP*, PCSTR, PCSTR, PCSTR, INT,
PLDAPControlA*, PLDAPControlA*);
ULONG ldap_rename_ext_sW(LDAP*, PCWSTR, PCWSTR, PCWSTR, INT,
PLDAPControlW*, PLDAPControlW*);
ULONG ldap_add_extA(LDAP*, PCSTR, LDAPModA**, PLDAPControlA*,
PLDAPControlA*, ULONG*);
ULONG ldap_add_extW(LDAP*, PCWSTR, LDAPModW**, PLDAPControlW*,
PLDAPControlW*, ULONG*);
ULONG ldap_add_ext_sA(LDAP*, PCSTR, LDAPModA**, PLDAPControlA*,
PLDAPControlA*);
ULONG ldap_add_ext_sW(LDAP*, PCWSTR, LDAPModW**, PLDAPControlW*,
PLDAPControlW*);
ULONG ldap_addA(LDAP*, PSTR, LDAPModA**);
ULONG ldap_addW(LDAP*, PWSTR, LDAPModW**);
ULONG ldap_add_sA(LDAP*, PSTR, LDAPModA**);
ULONG ldap_add_sW(LDAP*, PWSTR, LDAPModW**);
ULONG ldap_delete_extA(LDAP*, PCSTR, PLDAPControlA*, PLDAPControlA*,
ULONG*);
ULONG ldap_delete_extW(LDAP*, PCWSTR, PLDAPControlW*, PLDAPControlW*,
ULONG*);
ULONG ldap_delete_ext_sA(LDAP*, PCSTR, PLDAPControlA*, PLDAPControlA*);
ULONG ldap_delete_ext_sW(LDAP*, PCWSTR, PLDAPControlW*, PLDAPControlW*);
ULONG ldap_deleteA(LDAP*, PCSTR);
ULONG ldap_deleteW(LDAP*, PCWSTR);
ULONG ldap_delete_sA(LDAP*, PCSTR);
ULONG ldap_delete_sW(LDAP*, PCWSTR);
ULONG ldap_extended_operationA(LDAP*, PCSTR, BerValue*, PLDAPControlA*,
PLDAPControlA*, ULONG*);
ULONG ldap_extended_operationW(LDAP*, PCWSTR, BerValue*, PLDAPControlW*,
PLDAPControlW*, ULONG*);
ULONG ldap_extended_operation_sA(LDAP*, PSTR, BerValue*, PLDAPControlA*,
PLDAPControlA*, PCHAR*, BerValue**);
ULONG ldap_extended_operation_sW(LDAP*, PWSTR, BerValue*, PLDAPControlW*,
PLDAPControlW*, PWCHAR*, BerValue**);
ULONG ldap_close_extended_op(LDAP*, ULONG);
ULONG ldap_abandon(LDAP*, ULONG);
ULONG ldap_result(LDAP*, ULONG, ULONG, LDAP_TIMEVAL*, LDAPMessage**);
ULONG ldap_msgfree(LDAPMessage*);
ULONG ldap_parse_resultA(LDAP*, LDAPMessage*, ULONG*, PSTR*, PSTR*,
PZPSTR*, PLDAPControlA**, BOOLEAN);
ULONG ldap_parse_resultW(LDAP*, LDAPMessage*, ULONG*, PWSTR*, PWSTR*,
PZPWSTR*, PLDAPControlW**, BOOLEAN);
ULONG ldap_parse_extended_resultA(LDAP, LDAPMessage*, PSTR*, BerValue**,
BOOLEAN);
ULONG ldap_parse_extended_resultW(LDAP, LDAPMessage*, PWSTR*, BerValue**,
BOOLEAN);
PCHAR ldap_err2stringA(ULONG);
PWCHAR ldap_err2stringW(ULONG);
ULONG LdapGetLastError();
ULONG LdapMapErrorToWin32(ULONG);
ULONG ldap_result2error(LDAP*, LDAPMessage*, ULONG);
PLDAPMessage ldap_first_entry(LDAP*, LDAPMessage*);
PLDAPMessage ldap_next_entry(LDAP*, LDAPMessage*);
PLDAPMessage ldap_first_reference(LDAP*, LDAPMessage*);
PLDAPMessage ldap_next_reference(LDAP*, LDAPMessage*);
ULONG ldap_count_entries(LDAP*, LDAPMessage*);
ULONG ldap_count_references(LDAP*, LDAPMessage*);
PCHAR ldap_first_attributeA(LDAP*, LDAPMessage*, BerElement**);
PWCHAR ldap_first_attributeW(LDAP*, LDAPMessage*, BerElement**);
PCHAR ldap_next_attributeA(LDAP*, LDAPMessage*, BerElement*);
PWCHAR ldap_next_attributeW(LDAP*, LDAPMessage*, BerElement*);
VOID ldap_memfreeA(PCHAR);
VOID ldap_memfreeW(PWCHAR);
PCHAR* ldap_get_valuesA(LDAP*, LDAPMessage*, PCSTR);
PWCHAR* ldap_get_valuesW(LDAP*, LDAPMessage*, PCWSTR);
BerValue** ldap_get_values_lenA(LDAP*, LDAPMessage*, PCSTR);
BerValue** ldap_get_values_lenW(LDAP*, LDAPMessage*, PCWSTR);
ULONG ldap_count_valuesA(PCHAR*);
ULONG ldap_count_valuesW(PWCHAR*);
ULONG ldap_count_values_len(BerValue**);
ULONG ldap_value_freeA(PCHAR*);
ULONG ldap_value_freeW(PWCHAR*);
ULONG ldap_value_free_len(BerValue**);
PCHAR ldap_get_dnA(LDAP*, LDAPMessage*);
PWCHAR ldap_get_dnW(LDAP*, LDAPMessage*);
PCHAR ldap_explode_dnA(PCSTR, ULONG);
PWCHAR ldap_explode_dnW(PCWSTR, ULONG);
PCHAR ldap_dn2ufnA(PCSTR);
PWCHAR ldap_dn2ufnW(PCWSTR);
ULONG ldap_ufn2dnA(PCSTR, PSTR*);
ULONG ldap_ufn2dnW(PCWSTR, PWSTR*);
ULONG ldap_parse_referenceA(LDAP*, LDAPMessage*, PCHAR**);
ULONG ldap_parse_referenceW(LDAP*, LDAPMessage*, PWCHAR**);
ULONG ldap_check_filterA(LDAP*, PSTR);
ULONG ldap_check_filterW(LDAP*, PWSTR);
ULONG ldap_create_page_controlA(PLDAP, ULONG, BerValue*, UCHAR,
PLDAPControlA*);
ULONG ldap_create_page_controlW(PLDAP, ULONG, BerValue*, UCHAR,
PLDAPControlW*);
ULONG ldap_create_sort_controlA(PLDAP, PLDAPSortKeyA*, UCHAR,
PLDAPControlA*);
ULONG ldap_create_sort_controlW(PLDAP, PLDAPSortKeyW*, UCHAR,
PLDAPControlW*);
INT ldap_create_vlv_controlA(LDAP*, LDAPVLVInfo*, UCHAR, PLDAPControlA*);
INT ldap_create_vlv_controlW(LDAP*, LDAPVLVInfo*, UCHAR, PLDAPControlW*);
ULONG ldap_encode_sort_controlA(PLDAP, PLDAPSortKeyA*, PLDAPControlA,
BOOLEAN);
ULONG ldap_encode_sort_controlW(PLDAP, PLDAPSortKeyW*, PLDAPControlW,
BOOLEAN);
ULONG ldap_escape_filter_elementA(PCHAR, ULONG, PCHAR, ULONG);
ULONG ldap_escape_filter_elementW(PWCHAR, ULONG, PWCHAR, ULONG);
ULONG ldap_get_next_page(PLDAP, PLDAPSearch, ULONG, ULONG*);
ULONG ldap_get_next_page_s(PLDAP, PLDAPSearch, LDAP_TIMEVAL*, ULONG,
ULONG*, LDAPMessage**);
ULONG ldap_get_paged_count(PLDAP, PLDAPSearch, ULONG*, PLDAPMessage);
ULONG ldap_parse_page_controlA(PLDAP, PLDAPControlA*, ULONG*, BerValue**);
ULONG ldap_parse_page_controlW(PLDAP, PLDAPControlW*, ULONG*, BerValue**);
ULONG ldap_parse_sort_controlA(PLDAP, PLDAPControlA*, ULONG*, PCHAR*);
ULONG ldap_parse_sort_controlW(PLDAP, PLDAPControlW*, ULONG*, PWCHAR*);
INT ldap_parse_vlv_controlA(PLDAP, PLDAPControlA*, PULONG, PULONG,
BerValue**, PINT);
INT ldap_parse_vlv_controlW(PLDAP, PLDAPControlW*, PULONG, PULONG,
BerValue**, PINT);
PLDAPSearch ldap_search_init_pageA(PLDAP, PCSTR, ULONG, PCSTR, PZPSTR,
ULONG, PLDAPControlA*, PLDAPControlA*, ULONG, ULONG, PLDAPSortKeyA*);
PLDAPSearch ldap_search_init_pageW(PLDAP, PCWSTR, ULONG, PCWSTR, PZPWSTR,
ULONG, PLDAPControlW*, PLDAPControlW*, ULONG, ULONG, PLDAPSortKeyW*);
ULONG ldap_search_abandon_page(PLDAP, PLDAPSearch);
LDAP ldap_conn_from_msg(LDAP*, LDAPMessage*);
INT LdapUnicodeToUTF8(LPCWSTR, int, LPSTR, int);
INT LdapUTF8ToUnicode(LPCSTR, int, LPWSTR, int);
ULONG ldap_bindA(LDAP*, PSTR, PCHAR, ULONG);
ULONG ldap_bindW(LDAP*, PWSTR, PWCHAR, ULONG);
ULONG ldap_bind_sA(LDAP*, PSTR, PCHAR, ULONG);
ULONG ldap_bind_sW(LDAP*, PWSTR, PWCHAR, ULONG);
deprecated ("For LDAP 3 or later, use the ldap_rename_ext or ldap_rename_ext_s functions") {
ULONG ldap_modrdnA(LDAP*, PCSTR, PCSTR);
ULONG ldap_modrdnW(LDAP*, PCWSTR, PCWSTR);
ULONG ldap_modrdn_sA(LDAP*, PCSTR, PCSTR);
ULONG ldap_modrdn_sW(LDAP*, PCWSTR, PCWSTR);
ULONG ldap_modrdn2A(LDAP*, PCSTR, PCSTR, INT);
ULONG ldap_modrdn2W(LDAP*, PCWSTR, PCWSTR, INT);
ULONG ldap_modrdn2_sA(LDAP*, PCSTR, PCSTR, INT);
ULONG ldap_modrdn2_sW(LDAP*, PCWSTR, PCWSTR, INT);
}
}
version (Unicode) {
alias LDAPControlW LDAPControl;
alias PLDAPControlW PLDAPControl;
alias LDAPModW LDAPMod;
alias LDAPModW PLDAPMod;
alias LDAPSortKeyW LDAPSortKey;
alias PLDAPSortKeyW PLDAPSortKey;
alias LDAPAPIInfoW LDAPAPIInfo;
alias PLDAPAPIInfoW PLDAPAPIInfo;
alias LDAPAPIFeatureInfoW LDAPAPIFeatureInfo;
alias PLDAPAPIFeatureInfoW PLDAPAPIFeatureInfo;
alias cldap_openW cldap_open;
alias ldap_openW ldap_open;
alias ldap_simple_bindW ldap_simple_bind;
alias ldap_simple_bind_sW ldap_simple_bind_s;
alias ldap_sasl_bindW ldap_sasl_bind;
alias ldap_sasl_bind_sW ldap_sasl_bind_s;
alias ldap_initW ldap_init;
alias ldap_sslinitW ldap_sslinit;
alias ldap_get_optionW ldap_get_option;
alias ldap_set_optionW ldap_set_option;
alias ldap_start_tls_sW ldap_start_tls_s;
alias ldap_addW ldap_add;
alias ldap_add_extW ldap_add_ext;
alias ldap_add_sW ldap_add_s;
alias ldap_add_ext_sW ldap_add_ext_s;
alias ldap_compareW ldap_compare;
alias ldap_compare_extW ldap_compare_ext;
alias ldap_compare_sW ldap_compare_s;
alias ldap_compare_ext_sW ldap_compare_ext_s;
alias ldap_deleteW ldap_delete;
alias ldap_delete_extW ldap_delete_ext;
alias ldap_delete_sW ldap_delete_s;
alias ldap_delete_ext_sW ldap_delete_ext_s;
alias ldap_extended_operation_sW ldap_extended_operation_s;
alias ldap_extended_operationW ldap_extended_operation;
alias ldap_modifyW ldap_modify;
alias ldap_modify_extW ldap_modify_ext;
alias ldap_modify_sW ldap_modify_s;
alias ldap_modify_ext_sW ldap_modify_ext_s;
alias ldap_check_filterW ldap_check_filter;
alias ldap_count_valuesW ldap_count_values;
alias ldap_create_page_controlW ldap_create_page_control;
alias ldap_create_sort_controlW ldap_create_sort_control;
alias ldap_create_vlv_controlW ldap_create_vlv_control;
alias ldap_encode_sort_controlW ldap_encode_sort_control;
alias ldap_escape_filter_elementW ldap_escape_filter_element;
alias ldap_first_attributeW ldap_first_attribute;
alias ldap_next_attributeW ldap_next_attribute;
alias ldap_get_valuesW ldap_get_values;
alias ldap_get_values_lenW ldap_get_values_len;
alias ldap_parse_extended_resultW ldap_parse_extended_result;
alias ldap_parse_page_controlW ldap_parse_page_control;
alias ldap_parse_referenceW ldap_parse_reference;
alias ldap_parse_resultW ldap_parse_result;
alias ldap_parse_sort_controlW ldap_parse_sort_control;
alias ldap_parse_vlv_controlW ldap_parse_vlv_control;
alias ldap_searchW ldap_search;
alias ldap_search_sW ldap_search_s;
alias ldap_search_stW ldap_search_st;
alias ldap_search_extW ldap_search_ext;
alias ldap_search_ext_sW ldap_search_ext_s;
alias ldap_search_init_pageW ldap_search_init_page;
alias ldap_err2stringW ldap_err2string;
alias ldap_control_freeW ldap_control_free;
alias ldap_controls_freeW ldap_controls_free;
alias ldap_free_controlsW ldap_free_controls;
alias ldap_memfreeW ldap_memfree;
alias ldap_value_freeW ldap_value_free;
alias ldap_dn2ufnW ldap_dn2ufn;
alias ldap_ufn2dnW ldap_ufn2dn;
alias ldap_explode_dnW ldap_explode_dn;
alias ldap_get_dnW ldap_get_dn;
alias ldap_rename_extW ldap_rename;
alias ldap_rename_ext_sW ldap_rename_s;
alias ldap_rename_extW ldap_rename_ext;
alias ldap_rename_ext_sW ldap_rename_ext_s;
deprecated {
alias ldap_bindW ldap_bind;
alias ldap_bind_sW ldap_bind_s;
alias ldap_modrdnW ldap_modrdn;
alias ldap_modrdn_sW ldap_modrdn_s;
alias ldap_modrdn2W ldap_modrdn2;
alias ldap_modrdn2_sW ldap_modrdn2_s;
}
} else {
alias LDAPControlA LDAPControl;
alias PLDAPControlA PLDAPControl;
alias LDAPModA LDAPMod;
alias LDAPModA PLDAPMod;
alias LDAPSortKeyA LDAPSortKey;
alias PLDAPSortKeyA PLDAPSortKey;
alias LDAPAPIInfoA LDAPAPIInfo;
alias PLDAPAPIInfoA PLDAPAPIInfo;
alias LDAPAPIFeatureInfoA LDAPAPIFeatureInfo;
alias PLDAPAPIFeatureInfoA PLDAPAPIFeatureInfo;
alias cldap_openA cldap_open;
alias ldap_openA ldap_open;
alias ldap_simple_bindA ldap_simple_bind;
alias ldap_simple_bind_sA ldap_simple_bind_s;
alias ldap_sasl_bindA ldap_sasl_bind;
alias ldap_sasl_bind_sA ldap_sasl_bind_s;
alias ldap_initA ldap_init;
alias ldap_sslinitA ldap_sslinit;
alias ldap_get_optionA ldap_get_option;
alias ldap_set_optionA ldap_set_option;
alias ldap_start_tls_sA ldap_start_tls_s;
alias ldap_addA ldap_add;
alias ldap_add_extA ldap_add_ext;
alias ldap_add_sA ldap_add_s;
alias ldap_add_ext_sA ldap_add_ext_s;
alias ldap_compareA ldap_compare;
alias ldap_compare_extA ldap_compare_ext;
alias ldap_compare_sA ldap_compare_s;
alias ldap_compare_ext_sA ldap_compare_ext_s;
alias ldap_deleteA ldap_delete;
alias ldap_delete_extA ldap_delete_ext;
alias ldap_delete_sA ldap_delete_s;
alias ldap_delete_ext_sA ldap_delete_ext_s;
alias ldap_extended_operation_sA ldap_extended_operation_s;
alias ldap_extended_operationA ldap_extended_operation;
alias ldap_modifyA ldap_modify;
alias ldap_modify_extA ldap_modify_ext;
alias ldap_modify_sA ldap_modify_s;
alias ldap_modify_ext_sA ldap_modify_ext_s;
alias ldap_check_filterA ldap_check_filter;
alias ldap_count_valuesA ldap_count_values;
alias ldap_create_page_controlA ldap_create_page_control;
alias ldap_create_sort_controlA ldap_create_sort_control;
alias ldap_create_vlv_controlA ldap_create_vlv_control;
alias ldap_encode_sort_controlA ldap_encode_sort_control;
alias ldap_escape_filter_elementA ldap_escape_filter_element;
alias ldap_first_attributeA ldap_first_attribute;
alias ldap_next_attributeA ldap_next_attribute;
alias ldap_get_valuesA ldap_get_values;
alias ldap_get_values_lenA ldap_get_values_len;
alias ldap_parse_extended_resultA ldap_parse_extended_result;
alias ldap_parse_page_controlA ldap_parse_page_control;
alias ldap_parse_referenceA ldap_parse_reference;
alias ldap_parse_resultA ldap_parse_result;
alias ldap_parse_sort_controlA ldap_parse_sort_control;
alias ldap_parse_vlv_controlA ldap_parse_vlv_control;
alias ldap_searchA ldap_search;
alias ldap_search_sA ldap_search_s;
alias ldap_search_stA ldap_search_st;
alias ldap_search_extA ldap_search_ext;
alias ldap_search_ext_sA ldap_search_ext_s;
alias ldap_search_init_pageA ldap_search_init_page;
alias ldap_err2stringA ldap_err2string;
alias ldap_control_freeA ldap_control_free;
alias ldap_controls_freeA ldap_controls_free;
alias ldap_free_controlsA ldap_free_controls;
alias ldap_memfreeA ldap_memfree;
alias ldap_value_freeA ldap_value_free;
alias ldap_dn2ufnA ldap_dn2ufn;
alias ldap_ufn2dnA ldap_ufn2dn;
alias ldap_explode_dnA ldap_explode_dn;
alias ldap_get_dnA ldap_get_dn;
alias ldap_rename_extA ldap_rename;
alias ldap_rename_ext_sA ldap_rename_s;
alias ldap_rename_extA ldap_rename_ext;
alias ldap_rename_ext_sA ldap_rename_ext_s;
deprecated {
alias ldap_bindA ldap_bind;
alias ldap_bind_sA ldap_bind_s;
alias ldap_modrdnA ldap_modrdn;
alias ldap_modrdn_sA ldap_modrdn_s;
alias ldap_modrdn2A ldap_modrdn2;
alias ldap_modrdn2_sA ldap_modrdn2_s;
}
}
|
D
|
instance VLK_4148_GESTATH(NPC_DEFAULT)
{
name[0] = "Гестат";
guild = GIL_OUT;
id = 4148;
voice = 9;
flags = 0;
npctype = NPCTYPE_MAIN;
b_setattributestochapter(self,6);
fight_tactic = FAI_HUMAN_STRONG;
EquipItem(self,itmw_2h_sld_sword);
b_createambientinv(self);
b_setnpcvisual(self,MALE,"Hum_Head_Psionic",FACE_B_THORUS,BODYTEX_B,itar_djg_crawler);
Mdl_SetModelFatness(self,0);
Mdl_ApplyOverlayMds(self,"Humans_Relaxed.mds");
b_givenpctalents(self);
b_setfightskills(self,80);
daily_routine = rtn_start_4148;
};
func void rtn_start_4148()
{
ta_stand_guarding(8,0,23,0,"OW_DJG_ROCKCAMP_01");
ta_sit_campfire(23,0,8,0,"OW_DJG_ROCKCAMP_01");
};
|
D
|
/*
* Copyright (c) 2004-2009 Derelict Developers
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* * Neither the names 'Derelict', 'DerelictODE', nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
module derelict.ode.odefuncs;
private
{
import derelict.ode.odetypes;
import derelict.util.loader;
version(Tango)
{
import tango.stdc.stdio;
}
else
{
import std.c;
}
}
private void load(SharedLib lib)
{
bindFunc(dGetConfiguration)("dGetConfiguration", lib);
bindFunc(dCheckConfiguration)("dCheckConfiguration", lib);
bindFunc(dGeomDestroy)("dGeomDestroy", lib);
bindFunc(dGeomSetData)("dGeomSetData", lib);
bindFunc(dGeomGetData)("dGeomGetData", lib);
bindFunc(dGeomSetBody)("dGeomSetBody", lib);
bindFunc(dGeomGetBody)("dGeomGetBody", lib);
bindFunc(dGeomSetPosition)("dGeomSetPosition", lib);
bindFunc(dGeomSetRotation)("dGeomSetRotation", lib);
bindFunc(dGeomSetQuaternion)("dGeomSetQuaternion", lib);
bindFunc(dGeomGetPosition)("dGeomGetPosition", lib);
bindFunc(dGeomCopyPosition)("dGeomCopyPosition", lib);
bindFunc(dGeomGetRotation)("dGeomGetRotation", lib);
bindFunc(dGeomCopyRotation)("dGeomCopyRotation", lib);
bindFunc(dGeomGetQuaternion)("dGeomGetQuaternion", lib);
bindFunc(dGeomGetAABB)("dGeomGetAABB", lib);
bindFunc(dGeomIsSpace)("dGeomIsSpace", lib);
bindFunc(dGeomGetSpace)("dGeomGetSpace", lib);
bindFunc(dGeomGetClass)("dGeomGetClass", lib);
bindFunc(dGeomSetCategoryBits)("dGeomSetCategoryBits", lib);
bindFunc(dGeomSetCollideBits)("dGeomSetCollideBits", lib);
bindFunc(dGeomGetCategoryBits)("dGeomGetCategoryBits", lib);
bindFunc(dGeomGetCollideBits)("dGeomGetCollideBits", lib);
bindFunc(dGeomEnable)("dGeomEnable", lib);
bindFunc(dGeomDisable)("dGeomDisable", lib);
bindFunc(dGeomIsEnabled)("dGeomIsEnabled", lib);
bindFunc(dGeomSetOffsetPosition)("dGeomSetOffsetPosition", lib);
bindFunc(dGeomSetOffsetRotation)("dGeomSetOffsetRotation", lib);
bindFunc(dGeomSetOffsetQuaternion)("dGeomSetOffsetQuaternion", lib);
bindFunc(dGeomSetOffsetWorldPosition)("dGeomSetOffsetWorldPosition", lib);
bindFunc(dGeomSetOffsetWorldRotation)("dGeomSetOffsetWorldRotation", lib);
bindFunc(dGeomSetOffsetWorldQuaternion)("dGeomSetOffsetWorldQuaternion", lib);
bindFunc(dGeomClearOffset)("dGeomClearOffset", lib);
bindFunc(dGeomIsOffset)("dGeomIsOffset", lib);
bindFunc(dGeomGetOffsetPosition)("dGeomGetOffsetPosition", lib);
bindFunc(dGeomCopyOffsetPosition)("dGeomCopyOffsetPosition", lib);
bindFunc(dGeomGetOffsetRotation)("dGeomGetOffsetRotation", lib);
bindFunc(dGeomGetOffsetQuaternion)("dGeomGetOffsetQuaternion", lib);
bindFunc(dCollide)("dCollide", lib);
bindFunc(dSpaceCollide)("dSpaceCollide", lib);
bindFunc(dSpaceCollide2)("dSpaceCollide2", lib);
bindFunc(dCreateSphere)("dCreateSphere", lib);
bindFunc(dGeomSphereSetRadius)("dGeomSphereSetRadius", lib);
bindFunc(dGeomSphereGetRadius)("dGeomSphereGetRadius", lib);
bindFunc(dGeomSpherePointDepth)("dGeomSpherePointDepth", lib);
bindFunc(dCreateConvex)("dCreateConvex", lib);
bindFunc(dGeomSetConvex)("dGeomSetConvex", lib);
bindFunc(dCreateBox)("dCreateBox", lib);
bindFunc(dGeomBoxSetLengths)("dGeomBoxSetLengths", lib);
bindFunc(dGeomBoxGetLengths)("dGeomBoxGetLengths", lib);
bindFunc(dGeomBoxPointDepth)("dGeomBoxPointDepth", lib);
bindFunc(dCreatePlane)("dCreatePlane", lib);
bindFunc(dGeomPlaneSetParams)("dGeomPlaneSetParams", lib);
bindFunc(dGeomPlaneGetParams)("dGeomPlaneGetParams", lib);
bindFunc(dGeomPlanePointDepth)("dGeomPlanePointDepth", lib);
bindFunc(dCreateCapsule)("dCreateCapsule", lib);
bindFunc(dGeomCapsuleSetParams)("dGeomCapsuleSetParams", lib);
bindFunc(dGeomCapsuleGetParams)("dGeomCapsuleGetParams", lib);
bindFunc(dGeomCapsulePointDepth)("dGeomCapsulePointDepth", lib);
bindFunc(dCreateCylinder)("dCreateCylinder", lib);
bindFunc(dGeomCylinderSetParams)("dGeomCylinderSetParams", lib);
bindFunc(dGeomCylinderGetParams)("dGeomCylinderGetParams", lib);
bindFunc(dCreateRay)("dCreateRay", lib);
bindFunc(dGeomRaySetLength)("dGeomRaySetLength", lib);
bindFunc(dGeomRayGetLength)("dGeomRayGetLength", lib);
bindFunc(dGeomRaySet)("dGeomRaySet", lib);
bindFunc(dGeomRayGet)("dGeomRayGet", lib);
bindFunc(dGeomRaySetParams)("dGeomRaySetParams", lib);
bindFunc(dGeomRayGetParams)("dGeomRayGetParams", lib);
bindFunc(dGeomRaySetClosestHit)("dGeomRaySetClosestHit", lib);
bindFunc(dGeomRayGetClosestHit)("dGeomRayGetClosestHit", lib);
bindFunc(dCreateGeomTransform)("dCreateGeomTransform", lib);
bindFunc(dGeomTransformSetGeom)("dGeomTransformSetGeom", lib);
bindFunc(dGeomTransformGetGeom)("dGeomTransformGetGeom", lib);
bindFunc(dGeomTransformSetCleanup)("dGeomTransformSetCleanup", lib);
bindFunc(dGeomTransformGetCleanup)("dGeomTransformGetCleanup", lib);
bindFunc(dGeomTransformSetInfo)("dGeomTransformSetInfo", lib);
bindFunc(dGeomTransformGetInfo)("dGeomTransformGetInfo", lib);
bindFunc(dCreateHeightfield)("dCreateHeightfield", lib);
bindFunc(dGeomHeightfieldDataCreate)("dGeomHeightfieldDataCreate", lib);
bindFunc(dGeomHeightfieldDataDestroy)("dGeomHeightfieldDataDestroy", lib);
bindFunc(dGeomHeightfieldDataBuildCallback)("dGeomHeightfieldDataBuildCallback", lib);
bindFunc(dGeomHeightfieldDataBuildByte)("dGeomHeightfieldDataBuildByte", lib);
bindFunc(dGeomHeightfieldDataBuildShort)("dGeomHeightfieldDataBuildShort", lib);
bindFunc(dGeomHeightfieldDataBuildSingle)("dGeomHeightfieldDataBuildSingle", lib);
bindFunc(dGeomHeightfieldDataBuildDouble)("dGeomHeightfieldDataBuildDouble", lib);
bindFunc(dGeomHeightfieldDataSetBounds)("dGeomHeightfieldDataSetBounds", lib);
bindFunc(dGeomHeightfieldSetHeightfieldData)("dGeomHeightfieldSetHeightfieldData", lib);
bindFunc(dGeomHeightfieldGetHeightfieldData)("dGeomHeightfieldGetHeightfieldData", lib);
bindFunc(dClosestLineSegmentPoints)("dClosestLineSegmentPoints", lib);
bindFunc(dBoxTouchesBox)("dBoxTouchesBox", lib);
bindFunc(dBoxBox)("dBoxBox", lib);
bindFunc(dInfiniteAABB)("dInfiniteAABB", lib);
bindFunc(dCreateGeomClass)("dCreateGeomClass", lib);
bindFunc(dGeomGetClassData)("dGeomGetClassData", lib);
bindFunc(dCreateGeom)("dCreateGeom", lib);
bindFunc(dSetColliderOverride)("dSetColliderOverride", lib);
// collision_space.h
bindFunc(dSimpleSpaceCreate)("dSimpleSpaceCreate", lib);
bindFunc(dHashSpaceCreate)("dHashSpaceCreate", lib);
bindFunc(dQuadTreeSpaceCreate)("dQuadTreeSpaceCreate", lib);
bindFunc(dSweepAndPruneSpaceCreate)("dSweepAndPruneSpaceCreate", lib);
bindFunc(dSpaceDestroy)("dSpaceDestroy", lib);
bindFunc(dHashSpaceSetLevels)("dHashSpaceSetLevels", lib);
bindFunc(dHashSpaceGetLevels)("dHashSpaceGetLevels", lib);
bindFunc(dSpaceSetCleanup)("dSpaceSetCleanup", lib);
bindFunc(dSpaceGetCleanup)("dSpaceGetCleanup", lib);
bindFunc(dSpaceSetSublevel)("dSpaceSetSublevel", lib);
bindFunc(dSpaceGetSublevel)("dSpaceGetSublevel", lib);
bindFunc(dSpaceAdd)("dSpaceAdd", lib);
bindFunc(dSpaceRemove)("dSpaceRemove", lib);
bindFunc(dSpaceQuery)("dSpaceQuery", lib);
bindFunc(dSpaceClean)("dSpaceClean", lib);
bindFunc(dSpaceGetNumGeoms)("dSpaceGetNumGeoms", lib);
bindFunc(dSpaceGetGeom)("dSpaceGetGeom", lib);
bindFunc(dSpaceGetClass)("dSpaceGetClass", lib);
// collision_trimesh.h
bindFunc(dGeomTriMeshDataCreate)("dGeomTriMeshDataCreate", lib);
bindFunc(dGeomTriMeshDataDestroy)("dGeomTriMeshDataDestroy", lib);
bindFunc(dGeomTriMeshDataSet)("dGeomTriMeshDataSet", lib);
bindFunc(dGeomTriMeshDataGet)("dGeomTriMeshDataGet", lib);
bindFunc(dGeomTriMeshSetLastTransform)("dGeomTriMeshSetLastTransform", lib);
bindFunc(dGeomTriMeshGetLastTransform)("dGeomTriMeshGetLastTransform", lib);
bindFunc(dGeomTriMeshDataBuildSingle)("dGeomTriMeshDataBuildSingle", lib);
bindFunc(dGeomTriMeshDataBuildSingle1)("dGeomTriMeshDataBuildSingle1", lib);
bindFunc(dGeomTriMeshDataBuildDouble)("dGeomTriMeshDataBuildDouble", lib);
bindFunc(dGeomTriMeshDataBuildDouble1)("dGeomTriMeshDataBuildDouble1", lib);
bindFunc(dGeomTriMeshDataBuildSimple)("dGeomTriMeshDataBuildSimple", lib);
bindFunc(dGeomTriMeshDataBuildSimple1)("dGeomTriMeshDataBuildSimple1", lib);
bindFunc(dGeomTriMeshDataPreprocess)("dGeomTriMeshDataPreprocess", lib);
bindFunc(dGeomTriMeshDataGetBuffer)("dGeomTriMeshDataGetBuffer", lib);
bindFunc(dGeomTriMeshDataSetBuffer)("dGeomTriMeshDataSetBuffer", lib);
bindFunc(dGeomTriMeshSetCallback)("dGeomTriMeshSetCallback", lib);
bindFunc(dGeomTriMeshGetCallback)("dGeomTriMeshGetCallback", lib);
bindFunc(dGeomTriMeshSetArrayCallback)("dGeomTriMeshSetArrayCallback", lib);
bindFunc(dGeomTriMeshGetArrayCallback)("dGeomTriMeshGetArrayCallback", lib);
bindFunc(dGeomTriMeshSetRayCallback)("dGeomTriMeshSetRayCallback", lib);
bindFunc(dGeomTriMeshGetRayCallback)("dGeomTriMeshGetRayCallback", lib);
bindFunc(dGeomTriMeshSetTriMergeCallback)("dGeomTriMeshSetTriMergeCallback", lib);
bindFunc(dGeomTriMeshGetTriMergeCallback)("dGeomTriMeshGetTriMergeCallback", lib);
bindFunc(dCreateTriMesh)("dCreateTriMesh", lib);
bindFunc(dGeomTriMeshSetData)("dGeomTriMeshSetData", lib);
bindFunc(dGeomTriMeshGetData)("dGeomTriMeshGetData", lib);
bindFunc(dGeomTriMeshEnableTC)("dGeomTriMeshEnableTC", lib);
bindFunc(dGeomTriMeshIsTCEnabled)("dGeomTriMeshIsTCEnabled", lib);
bindFunc(dGeomTriMeshClearTCCache)("dGeomTriMeshClearTCCache", lib);
bindFunc(dGeomTriMeshGetTriMeshDataID)("dGeomTriMeshGetTriMeshDataID", lib);
bindFunc(dGeomTriMeshGetTriangle)("dGeomTriMeshGetTriangle", lib);
bindFunc(dGeomTriMeshGetPoint)("dGeomTriMeshGetPoint", lib);
bindFunc(dGeomTriMeshGetTriangleCount)("dGeomTriMeshGetTriangleCount", lib);
bindFunc(dGeomTriMeshDataUpdate)("dGeomTriMeshDataUpdate", lib);
// error.h
bindFunc(dSetErrorHandler)("dSetErrorHandler", lib);
bindFunc(dSetDebugHandler)("dSetDebugHandler", lib);
bindFunc(dSetMessageHandler)("dSetMessageHandler", lib);
bindFunc(dGetErrorHandler)("dGetErrorHandler", lib);
bindFunc(dGetDebugHandler)("dGetDebugHandler", lib);
bindFunc(dGetMessageHandler)("dGetMessageHandler", lib);
bindFunc(dError)("dError", lib);
bindFunc(dDebug)("dDebug", lib);
bindFunc(dMessage)("dMessage", lib);
// mass.h
bindFunc(dMassCheck)("dMassCheck", lib);
bindFunc(dMassSetZero)("dMassSetZero", lib);
bindFunc(dMassSetParameters)("dMassSetParameters", lib);
bindFunc(dMassSetSphere)("dMassSetSphere", lib);
bindFunc(dMassSetSphereTotal)("dMassSetSphereTotal", lib);
bindFunc(dMassSetCapsule)("dMassSetCapsule", lib);
bindFunc(dMassSetCapsuleTotal)("dMassSetCapsuleTotal", lib);
bindFunc(dMassSetCylinder)("dMassSetCylinder", lib);
bindFunc(dMassSetCylinderTotal)("dMassSetCylinderTotal", lib);
bindFunc(dMassSetBox)("dMassSetBox", lib);
bindFunc(dMassSetBoxTotal)("dMassSetBoxTotal", lib);
bindFunc(dMassSetTrimesh)("dMassSetTrimesh", lib);
bindFunc(dMassSetTrimeshTotal)("dMassSetTrimeshTotal", lib);
bindFunc(dMassAdjust)("dMassAdjust", lib);
bindFunc(dMassTranslate)("dMassTranslate", lib);
bindFunc(dMassRotate)("dMassRotate", lib);
bindFunc(dMassAdd)("dMassAdd", lib);
// matrix.h
bindFunc(dSetZero)("dSetZero", lib);
bindFunc(dSetValue)("dSetValue", lib);
bindFunc(dDot)("dDot", lib);
bindFunc(dMultiply0)("dMultiply0", lib);
bindFunc(dMultiply1)("dMultiply1", lib);
bindFunc(dMultiply2)("dMultiply2", lib);
bindFunc(dFactorCholesky)("dFactorCholesky", lib);
bindFunc(dSolveCholesky)("dSolveCholesky", lib);
bindFunc(dInvertPDMatrix)("dInvertPDMatrix", lib);
bindFunc(dIsPositiveDefinite)("dIsPositiveDefinite", lib);
bindFunc(dFactorLDLT)("dFactorLDLT", lib);
bindFunc(dSolveL1)("dSolveL1", lib);
bindFunc(dSolveL1T)("dSolveL1T", lib);
bindFunc(dVectorScale)("dVectorScale", lib);
bindFunc(dSolveLDLT)("dSolveLDLT", lib);
bindFunc(dLDLTAddTL)("dLDLTAddTL", lib);
bindFunc(dLDLTRemove)("dLDLTRemove", lib);
bindFunc(dRemoveRowCol)("dRemoveRowCol", lib);
// memory.h
bindFunc(dSetAllocHandler)("dSetAllocHandler", lib);
bindFunc(dSetReallocHandler)("dSetReallocHandler", lib);
bindFunc(dSetFreeHandler)("dSetFreeHandler", lib);
bindFunc(dGetAllocHandler)("dGetAllocHandler", lib);
bindFunc(dGetReallocHandler)("dGetReallocHandler", lib);
bindFunc(dGetFreeHandler)("dGetFreeHandler", lib);
bindFunc(dAlloc)("dAlloc", lib);
bindFunc(dRealloc)("dRealloc", lib);
bindFunc(dFree)("dFree", lib);
// misc.h
bindFunc(dTestRand)("dTestRand", lib);
bindFunc(dRand)("dRand", lib);
bindFunc(dRandGetSeed)("dRandGetSeed", lib);
bindFunc(dRandSetSeed)("dRandSetSeed", lib);
bindFunc(dRandInt)("dRandInt", lib);
bindFunc(dRandReal)("dRandReal", lib);
bindFunc(dPrintMatrix)("dPrintMatrix", lib);
bindFunc(dMakeRandomVector)("dMakeRandomVector", lib);
bindFunc(dMakeRandomMatrix)("dMakeRandomMatrix", lib);
bindFunc(dClearUpperTriangle)("dClearUpperTriangle", lib);
bindFunc(dMaxDifference)("dMaxDifference", lib);
bindFunc(dMaxDifferenceLowerTriangle)("dMaxDifferenceLowerTriangle", lib);
// objects.h
bindFunc(dWorldCreate)("dWorldCreate", lib);
bindFunc(dWorldDestroy)("dWorldDestroy", lib);
bindFunc(dWorldSetGravity)("dWorldSetGravity", lib);
bindFunc(dWorldGetGravity)("dWorldGetGravity", lib);
bindFunc(dWorldSetERP)("dWorldSetERP", lib);
bindFunc(dWorldGetERP)("dWorldGetERP", lib);
bindFunc(dWorldSetCFM)("dWorldSetCFM", lib);
bindFunc(dWorldGetCFM)("dWorldGetCFM", lib);
bindFunc(dWorldStep)("dWorldStep", lib);
bindFunc(dWorldImpulseToForce)("dWorldImpulseToForce", lib);
bindFunc(dWorldQuickStep)("dWorldQuickStep", lib);
bindFunc(dWorldSetQuickStepNumIterations)("dWorldSetQuickStepNumIterations", lib);
bindFunc(dWorldGetQuickStepNumIterations)("dWorldGetQuickStepNumIterations", lib);
bindFunc(dWorldSetQuickStepW)("dWorldSetQuickStepW", lib);
bindFunc(dWorldGetQuickStepW)("dWorldGetQuickStepW", lib);
bindFunc(dWorldSetContactMaxCorrectingVel)("dWorldSetContactMaxCorrectingVel", lib);
bindFunc(dWorldGetContactMaxCorrectingVel)("dWorldGetContactMaxCorrectingVel", lib);
bindFunc(dWorldSetContactSurfaceLayer)("dWorldSetContactSurfaceLayer", lib);
bindFunc(dWorldGetContactSurfaceLayer)("dWorldGetContactSurfaceLayer", lib);
bindFunc(dWorldStepFast1)("dWorldStepFast1", lib);
bindFunc(dWorldSetAutoEnableDepthSF1)("dWorldSetAutoEnableDepthSF1", lib);
bindFunc(dWorldGetAutoEnableDepthSF1)("dWorldGetAutoEnableDepthSF1", lib);
bindFunc(dWorldGetAutoDisableLinearThreshold)("dWorldGetAutoDisableLinearThreshold", lib);
bindFunc(dWorldSetAutoDisableLinearThreshold)("dWorldSetAutoDisableLinearThreshold", lib);
bindFunc(dWorldGetAutoDisableAngularThreshold)("dWorldGetAutoDisableAngularThreshold", lib);
bindFunc(dWorldSetAutoDisableAngularThreshold)("dWorldSetAutoDisableAngularThreshold", lib);
bindFunc(dWorldGetAutoDisableAverageSamplesCount)("dWorldGetAutoDisableAverageSamplesCount", lib);
bindFunc(dWorldSetAutoDisableAverageSamplesCount)("dWorldSetAutoDisableAverageSamplesCount", lib);
bindFunc(dWorldGetAutoDisableSteps)("dWorldGetAutoDisableSteps", lib);
bindFunc(dWorldSetAutoDisableSteps)("dWorldSetAutoDisableSteps", lib);
bindFunc(dWorldGetAutoDisableTime)("dWorldGetAutoDisableTime", lib);
bindFunc(dWorldSetAutoDisableTime)("dWorldSetAutoDisableTime", lib);
bindFunc(dWorldGetAutoDisableFlag)("dWorldGetAutoDisableFlag", lib);
bindFunc(dWorldSetAutoDisableFlag)("dWorldSetAutoDisableFlag", lib);
bindFunc(dWorldGetLinearDampingThreshold)("dWorldGetLinearDampingThreshold", lib);
bindFunc(dWorldSetLinearDampingThreshold)("dWorldSetLinearDampingThreshold", lib);
bindFunc(dWorldGetAngularDampingThreshold)("dWorldGetAngularDampingThreshold", lib);
bindFunc(dWorldSetAngularDampingThreshold)("dWorldSetAngularDampingThreshold", lib);
bindFunc(dWorldGetLinearDamping)("dWorldGetLinearDamping", lib);
bindFunc(dWorldSetLinearDamping)("dWorldSetLinearDamping", lib);
bindFunc(dWorldGetAngularDamping)("dWorldGetAngularDamping", lib);
bindFunc(dWorldSetAngularDamping)("dWorldSetAngularDamping", lib);
bindFunc(dWorldSetDamping)("dWorldSetDamping", lib);
bindFunc(dWorldGetMaxAngularSpeed)("dWorldGetMaxAngularSpeed", lib);
bindFunc(dWorldSetMaxAngularSpeed)("dWorldSetMaxAngularSpeed", lib);
bindFunc(dBodyGetAutoDisableLinearThreshold)("dBodyGetAutoDisableLinearThreshold", lib);
bindFunc(dBodySetAutoDisableLinearThreshold)("dBodySetAutoDisableLinearThreshold", lib);
bindFunc(dBodyGetAutoDisableAngularThreshold)("dBodyGetAutoDisableAngularThreshold", lib);
bindFunc(dBodySetAutoDisableAngularThreshold)("dBodySetAutoDisableAngularThreshold", lib);
bindFunc(dBodyGetAutoDisableAverageSamplesCount)("dBodyGetAutoDisableAverageSamplesCount", lib);
bindFunc(dBodySetAutoDisableAverageSamplesCount)("dBodySetAutoDisableAverageSamplesCount", lib);
bindFunc(dBodyGetAutoDisableSteps)("dBodyGetAutoDisableSteps", lib);
bindFunc(dBodySetAutoDisableSteps)("dBodySetAutoDisableSteps", lib);
bindFunc(dBodyGetAutoDisableTime)("dBodyGetAutoDisableTime", lib);
bindFunc(dBodySetAutoDisableTime)("dBodySetAutoDisableTime", lib);
bindFunc(dBodyGetAutoDisableFlag)("dBodyGetAutoDisableFlag", lib);
bindFunc(dBodySetAutoDisableFlag)("dBodySetAutoDisableFlag", lib);
bindFunc(dBodySetAutoDisableDefaults)("dBodySetAutoDisableDefaults", lib);
bindFunc(dBodyGetWorld)("dBodyGetWorld", lib);
bindFunc(dBodyCreate)("dBodyCreate", lib);
bindFunc(dBodyDestroy)("dBodyDestroy", lib);
bindFunc(dBodySetData)("dBodySetData", lib);
bindFunc(dBodyGetData)("dBodyGetData", lib);
bindFunc(dBodySetPosition)("dBodySetPosition", lib);
bindFunc(dBodySetRotation)("dBodySetRotation", lib);
bindFunc(dBodySetQuaternion)("dBodySetQuaternion", lib);
bindFunc(dBodySetLinearVel)("dBodySetLinearVel", lib);
bindFunc(dBodySetAngularVel)("dBodySetAngularVel", lib);
bindFunc(dBodyGetPosition)("dBodyGetPosition", lib);
bindFunc(dBodyCopyPosition)("dBodyCopyPosition", lib);
bindFunc(dBodyGetRotation)("dBodyGetRotation", lib);
bindFunc(dBodyCopyRotation)("dBodyCopyRotation", lib);
bindFunc(dBodyGetQuaternion)("dBodyGetQuaternion", lib);
bindFunc(dBodyCopyQuaternion)("dBodyCopyQuaternion", lib);
bindFunc(dBodyGetLinearVel)("dBodyGetLinearVel", lib);
bindFunc(dBodyGetAngularVel)("dBodyGetAngularVel", lib);
bindFunc(dBodySetMass)("dBodySetMass", lib);
bindFunc(dBodyGetMass)("dBodyGetMass", lib);
bindFunc(dBodyAddForce)("dBodyAddForce", lib);
bindFunc(dBodyAddTorque)("dBodyAddTorque", lib);
bindFunc(dBodyAddRelForce)("dBodyAddRelForce", lib);
bindFunc(dBodyAddRelTorque)("dBodyAddRelTorque", lib);
bindFunc(dBodyAddForceAtPos)("dBodyAddForceAtPos", lib);
bindFunc(dBodyAddForceAtRelPos)("dBodyAddForceAtRelPos", lib);
bindFunc(dBodyAddRelForceAtPos)("dBodyAddRelForceAtPos", lib);
bindFunc(dBodyAddRelForceAtRelPos)("dBodyAddRelForceAtRelPos", lib);
bindFunc(dBodyGetForce)("dBodyGetForce", lib);
bindFunc(dBodyGetTorque)("dBodyGetTorque", lib);
bindFunc(dBodySetForce)("dBodySetForce", lib);
bindFunc(dBodySetTorque)("dBodySetTorque", lib);
bindFunc(dBodyGetRelPointPos)("dBodyGetRelPointPos", lib);
bindFunc(dBodyGetRelPointVel)("dBodyGetRelPointVel", lib);
bindFunc(dBodyGetPointVel)("dBodyGetPointVel", lib);
bindFunc(dBodyGetPosRelPoint)("dBodyGetPosRelPoint", lib);
bindFunc(dBodyVectorToWorld)("dBodyVectorToWorld", lib);
bindFunc(dBodyVectorFromWorld)("dBodyVectorFromWorld", lib);
bindFunc(dBodySetFiniteRotationMode)("dBodySetFiniteRotationMode", lib);
bindFunc(dBodySetFiniteRotationAxis)("dBodySetFiniteRotationAxis", lib);
bindFunc(dBodyGetFiniteRotationMode)("dBodyGetFiniteRotationMode", lib);
bindFunc(dBodyGetFiniteRotationAxis)("dBodyGetFiniteRotationAxis", lib);
bindFunc(dBodyGetNumJoints)("dBodyGetNumJoints", lib);
bindFunc(dBodyGetJoint)("dBodyGetJoint", lib);
bindFunc(dBodySetDynamic)("dBodySetDynamic", lib);
bindFunc( dBodySetKinematic)("dBodySetKinematic", lib);
bindFunc(dBodyIsKinematic)("dBodyIsKinematic", lib);
bindFunc(dBodyEnable)("dBodyEnable", lib);
bindFunc(dBodyDisable)("dBodyDisable", lib);
bindFunc(dBodyIsEnabled)("dBodyIsEnabled", lib);
bindFunc(dBodySetGravityMode)("dBodySetGravityMode", lib);
bindFunc(dBodyGetGravityMode)("dBodyGetGravityMode", lib);
bindFunc(dBodySetMovedCallback)("dBodySetMovedCallback", lib);
bindFunc(dBodyGetFirstGeom)("dBodyGetFirstGeom", lib);
bindFunc(dBodyGetNextGeom)("dBodyGetNextGeom", lib);
bindFunc(dBodySetDampingDefaults)("dBodySetDampingDefaults", lib);
bindFunc(dBodyGetLinearDamping)("dBodyGetLinearDamping", lib);
bindFunc(dBodySetLinearDamping)("dBodySetLinearDamping", lib);
bindFunc(dBodyGetAngularDamping)("dBodyGetAngularDamping", lib);
bindFunc(dBodySetAngularDamping)("dBodySetAngularDamping", lib);
bindFunc(dBodySetDamping)("dBodySetDamping", lib);
bindFunc(dBodyGetLinearDampingThreshold)("dBodyGetLinearDampingThreshold", lib);
bindFunc(dBodySetLinearDampingThreshold)("dBodySetLinearDampingThreshold", lib);
bindFunc(dBodyGetAngularDampingThreshold)("dBodyGetAngularDampingThreshold", lib);
bindFunc(dBodySetAngularDampingThreshold)("dBodySetAngularDampingThreshold", lib);
bindFunc(dBodyGetMaxAngularSpeed)("dBodyGetMaxAngularSpeed", lib);
bindFunc(dBodySetMaxAngularSpeed)("dBodySetMaxAngularSpeed", lib);
bindFunc(dBodyGetGyroscopicMode)("dBodyGetGyroscopicMode", lib);
bindFunc(dBodySetGyroscopicMode)("dBodySetGyroscopicMode", lib);
bindFunc(dJointCreateBall)("dJointCreateBall", lib);
bindFunc(dJointCreateHinge)("dJointCreateHinge", lib);
bindFunc(dJointCreateSlider)("dJointCreateSlider", lib);
bindFunc(dJointCreateContact)("dJointCreateContact", lib);
bindFunc(dJointCreateHinge2)("dJointCreateHinge2", lib);
bindFunc(dJointCreateUniversal)("dJointCreateUniversal", lib);
bindFunc(dJointCreatePR)("dJointCreatePR", lib);
bindFunc(dJointCreatePU)("dJointCreatePU", lib);
bindFunc(dJointCreatePiston)("dJointCreatePiston", lib);
bindFunc(dJointCreateFixed)("dJointCreateFixed", lib);
bindFunc(dJointCreateNull)("dJointCreateNull", lib);
bindFunc(dJointCreateAMotor)("dJointCreateAMotor", lib);
bindFunc(dJointCreateLMotor)("dJointCreateLMotor", lib);
bindFunc(dJointCreatePlane2D)("dJointCreatePlane2D", lib);
bindFunc(dJointDestroy)("dJointDestroy", lib);
bindFunc(dJointGroupCreate)("dJointGroupCreate", lib);
bindFunc(dJointGroupDestroy)("dJointGroupDestroy", lib);
bindFunc(dJointGroupEmpty)("dJointGroupEmpty", lib);
bindFunc(dJointGetNumBodies)("dJointGetNumBodies", lib);
bindFunc(dJointAttach)("dJointAttach", lib);
bindFunc(dJointEnable)("dJointEnable", lib);
bindFunc(dJointDisable)("dJointDisable", lib);
bindFunc(dJointIsEnabled)("dJointIsEnabled", lib);
bindFunc(dJointSetData)("dJointSetData", lib);
bindFunc(dJointGetData)("dJointGetData", lib);
bindFunc(dJointGetType)("dJointGetType", lib);
bindFunc(dJointGetBody)("dJointGetBody", lib);
bindFunc(dJointSetFeedback)("dJointSetFeedback", lib);
bindFunc(dJointGetFeedback)("dJointGetFeedback", lib);
bindFunc(dJointSetBallAnchor)("dJointSetBallAnchor", lib);
bindFunc(dJointSetBallAnchor2)("dJointSetBallAnchor2", lib);
bindFunc(dJointSetBallParam)("dJointSetBallParam", lib);
bindFunc(dJointSetHingeAnchor)("dJointSetHingeAnchor", lib);
bindFunc(dJointSetHingeAnchorDelta)("dJointSetHingeAnchorDelta", lib);
bindFunc(dJointSetHingeAxis)("dJointSetHingeAxis", lib);
bindFunc(dJointSetHingeAxisOffset)("dJointSetHingeAxisOffset", lib);
bindFunc(dJointSetHingeParam)("dJointSetHingeParam", lib);
bindFunc(dJointAddHingeTorque)("dJointAddHingeTorque", lib);
bindFunc(dJointSetSliderAxis)("dJointSetSliderAxis", lib);
bindFunc(dJointSetSliderAxisDelta)("dJointSetSliderAxisDelta", lib);
bindFunc(dJointSetSliderParam)("dJointSetSliderParam", lib);
bindFunc(dJointAddSliderForce)("dJointAddSliderForce", lib);
bindFunc(dJointSetHinge2Anchor)("dJointSetHinge2Anchor", lib);
bindFunc(dJointSetHinge2Axis1)("dJointSetHinge2Axis1", lib);
bindFunc(dJointSetHinge2Axis2)("dJointSetHinge2Axis2", lib);
bindFunc(dJointSetHinge2Param)("dJointSetHinge2Param", lib);
bindFunc(dJointAddHinge2Torques)("dJointAddHinge2Torques", lib);
bindFunc(dJointSetUniversalAnchor)("dJointSetUniversalAnchor", lib);
bindFunc(dJointSetUniversalAxis1)("dJointSetUniversalAxis1", lib);
bindFunc(dJointSetUniversalAxis1Offset)("dJointSetUniversalAxis1Offset", lib);
bindFunc(dJointSetUniversalAxis2)("dJointSetUniversalAxis2", lib);
bindFunc(dJointSetUniversalAxis2Offset)("dJointSetUniversalAxis2Offset", lib);
bindFunc(dJointSetUniversalParam)("dJointSetUniversalParam", lib);
bindFunc(dJointAddUniversalTorques)("dJointAddUniversalTorques", lib);
bindFunc(dJointSetPRAnchor)("dJointSetPRAnchor", lib);
bindFunc(dJointSetPRAxis1)("dJointSetPRAxis1", lib);
bindFunc(dJointSetPRAxis2)("dJointSetPRAxis2", lib);
bindFunc(dJointSetPRParam)("dJointSetPRParam", lib);
bindFunc(dJointAddPRTorque)("dJointAddPRTorque", lib);
bindFunc(dJointSetPUAnchor)("dJointSetPUAnchor", lib);
bindFunc(dJointSetPUAnchorOffset)("dJointSetPUAnchorOffset", lib);
bindFunc(dJointSetPUAxis1)("dJointSetPUAxis1", lib);
bindFunc(dJointSetPUAxis2)("dJointSetPUAxis2", lib);
bindFunc(dJointSetPUAxis3)("dJointSetPUAxis3", lib);
bindFunc(dJointSetPUAxisP)("dJointSetPUAxisP", lib);
bindFunc(dJointSetPUParam)("dJointSetPUParam", lib);
bindFunc(dJointSetPistonAnchor)("dJointSetPistonAnchor", lib);
bindFunc(dJointSetPistonAnchorOffset)("dJointSetPistonAnchorOffset", lib);
bindFunc(dJointSetPistonAxis)("dJointSetPistonAxis", lib);
bindFunc(dJointSetPistonParam)("dJointSetPistonParam", lib);
bindFunc(dJointAddPistonForce)("dJointAddPistonForce", lib);
bindFunc(dJointSetFixed)("dJointSetFixed", lib);
bindFunc(dJointSetFixedParam)("dJointSetFixedParam", lib);
bindFunc(dJointSetAMotorNumAxes)("dJointSetAMotorNumAxes", lib);
bindFunc(dJointSetAMotorAxis)("dJointSetAMotorAxis", lib);
bindFunc(dJointSetAMotorAngle)("dJointSetAMotorAngle", lib);
bindFunc(dJointSetAMotorParam)("dJointSetAMotorParam", lib);
bindFunc(dJointSetAMotorMode)("dJointSetAMotorMode", lib);
bindFunc(dJointAddAMotorTorques)("dJointAddAMotorTorques", lib);
bindFunc(dJointSetLMotorNumAxes)("dJointSetLMotorNumAxes", lib);
bindFunc(dJointSetLMotorAxis)("dJointSetLMotorAxis", lib);
bindFunc(dJointSetLMotorParam)("dJointSetLMotorParam", lib);
bindFunc(dJointSetPlane2DXParam)("dJointSetPlane2DXParam", lib);
bindFunc(dJointSetPlane2DYParam)("dJointSetPlane2DYParam", lib);
bindFunc(dJointSetPlane2DAngleParam)("dJointSetPlane2DAngleParam", lib);
bindFunc(dJointGetBallAnchor)("dJointGetBallAnchor", lib);
bindFunc(dJointGetBallAnchor2)("dJointGetBallAnchor2", lib);
bindFunc(dJointGetBallParam)("dJointGetBallParam", lib);
bindFunc(dJointGetHingeAnchor)("dJointGetHingeAnchor", lib);
bindFunc(dJointGetHingeAnchor2)("dJointGetHingeAnchor2", lib);
bindFunc(dJointGetHingeAxis)("dJointGetHingeAxis", lib);
bindFunc(dJointGetHingeParam)("dJointGetHingeParam", lib);
bindFunc(dJointGetHingeAngle)("dJointGetHingeAngle", lib);
bindFunc(dJointGetHingeAngleRate)("dJointGetHingeAngleRate", lib);
bindFunc(dJointGetSliderPosition)("dJointGetSliderPosition", lib);
bindFunc(dJointGetSliderPositionRate)("dJointGetSliderPositionRate", lib);
bindFunc(dJointGetSliderAxis)("dJointGetSliderAxis", lib);
bindFunc(dJointGetSliderParam)("dJointGetSliderParam", lib);
bindFunc(dJointGetHinge2Anchor)("dJointGetHinge2Anchor", lib);
bindFunc(dJointGetHinge2Anchor2)("dJointGetHinge2Anchor2", lib);
bindFunc(dJointGetHinge2Axis1)("dJointGetHinge2Axis1", lib);
bindFunc(dJointGetHinge2Axis2)("dJointGetHinge2Axis2", lib);
bindFunc(dJointGetHinge2Param)("dJointGetHinge2Param", lib);
bindFunc(dJointGetHinge2Angle1)("dJointGetHinge2Angle1", lib);
bindFunc(dJointGetHinge2Angle1Rate)("dJointGetHinge2Angle1Rate", lib);
bindFunc(dJointGetHinge2Angle2Rate)("dJointGetHinge2Angle2Rate", lib);
bindFunc(dJointGetUniversalAnchor)("dJointGetUniversalAnchor", lib);
bindFunc(dJointGetUniversalAnchor2)("dJointGetUniversalAnchor2", lib);
bindFunc(dJointGetUniversalAxis1)("dJointGetUniversalAxis1", lib);
bindFunc(dJointGetUniversalAxis2)("dJointGetUniversalAxis2", lib);
bindFunc(dJointGetUniversalParam)("dJointGetUniversalParam", lib);
bindFunc(dJointGetUniversalAngles)("dJointGetUniversalAngles", lib);
bindFunc(dJointGetUniversalAngle1)("dJointGetUniversalAngle1", lib);
bindFunc(dJointGetUniversalAngle2)("dJointGetUniversalAngle2", lib);
bindFunc(dJointGetUniversalAngle1Rate)("dJointGetUniversalAngle1Rate", lib);
bindFunc(dJointGetUniversalAngle2Rate)("dJointGetUniversalAngle2Rate", lib);
bindFunc(dJointGetPRAnchor)("dJointGetPRAnchor", lib);
bindFunc(dJointGetPRPosition)("dJointGetPRPosition", lib);
bindFunc(dJointGetPRPositionRate)("dJointGetPRPositionRate", lib);
bindFunc(dJointGetPRAngle)("dJointGetPRAngle", lib);
bindFunc(dJointGetPRAngleRate)("dJointGetPRAngleRate", lib);
bindFunc(dJointGetPRAxis1)("dJointGetPRAxis1", lib);
bindFunc(dJointGetPRAxis2)("dJointGetPRAxis2", lib);
bindFunc(dJointGetPRParam)("dJointGetPRParam", lib);
bindFunc(dJointGetPUAnchor)("dJointGetPUAnchor", lib);
bindFunc(dJointGetPUPosition)("dJointGetPUPosition", lib);
bindFunc(dJointGetPUPositionRate)("dJointGetPUPositionRate", lib);
bindFunc(dJointGetPUAxis1)("dJointGetPUAxis1", lib);
bindFunc(dJointGetPUAxis2)("dJointGetPUAxis2", lib);
bindFunc(dJointGetPUAxis3)("dJointGetPUAxis3", lib);
bindFunc(dJointGetPUAxisP)("dJointGetPUAxisP", lib);
bindFunc(dJointGetPUAngles)("dJointGetPUAngles", lib);
bindFunc(dJointGetPUAngle1)("dJointGetPUAngle1", lib);
bindFunc(dJointGetPUAngle1Rate)("dJointGetPUAngle1Rate", lib);
bindFunc(dJointGetPUAngle2)("dJointGetPUAngle2", lib);
bindFunc(dJointGetPUAngle2Rate)("dJointGetPUAngle2Rate", lib);
bindFunc(dJointGetPUParam)("dJointGetPUParam", lib);
bindFunc(dJointGetPistonPosition)("dJointGetPistonPosition", lib);
bindFunc(dJointGetPistonPositionRate)("dJointGetPistonPositionRate", lib);
bindFunc(dJointGetPistonAngle)("dJointGetPistonAngle", lib);
bindFunc(dJointGetPistonAngleRate)("dJointGetPistonAngleRate", lib);
bindFunc(dJointGetPistonAnchor)("dJointGetPistonAnchor", lib);
bindFunc(dJointGetPistonAnchor2)("dJointGetPistonAnchor2", lib);
bindFunc(dJointGetPistonAxis)("dJointGetPistonAxis", lib);
bindFunc(dJointGetPistonParam)("dJointGetPistonParam", lib);
bindFunc(dJointGetAMotorNumAxes)("dJointGetAMotorNumAxes", lib);
bindFunc(dJointGetAMotorAxis)("dJointGetAMotorAxis", lib);
bindFunc(dJointGetAMotorAxisRel)("dJointGetAMotorAxisRel", lib);
bindFunc(dJointGetAMotorAngle)("dJointGetAMotorAngle", lib);
bindFunc(dJointGetAMotorAngleRate)("dJointGetAMotorAngleRate", lib);
bindFunc(dJointGetAMotorParam)("dJointGetAMotorParam", lib);
bindFunc(dJointGetAMotorMode)("dJointGetAMotorMode", lib);
bindFunc(dJointGetLMotorNumAxes)("dJointGetLMotorNumAxes", lib);
bindFunc(dJointGetLMotorAxis)("dJointGetLMotorAxis", lib);
bindFunc(dJointGetLMotorParam)("dJointGetLMotorParam", lib);
bindFunc(dJointGetFixedParam)("dJointGetFixedParam", lib);
bindFunc(dConnectingJoint)("dConnectingJoint", lib);
bindFunc(dConnectingJointList)("dConnectingJointList", lib);
bindFunc(dAreConnected)("dAreConnected", lib);
bindFunc(dAreConnectedExcluding)("dAreConnectedExcluding", lib);
// odeinit.h
bindFunc(dInitODE)("dInitODE", lib);
bindFunc(dInitODE2)("dInitODE2", lib);
bindFunc(dAllocateODEDataForThread)("dAllocateODEDataForThread", lib);
bindFunc(dCleanupODEAllDataForThread)("dCleanupODEAllDataForThread", lib);
bindFunc(dCloseODE)("dCloseODE", lib);
// rotation.h
bindFunc(dRSetIdentity)("dRSetIdentity", lib);
bindFunc(dRFromAxisAndAngle)("dRFromAxisAndAngle", lib);
bindFunc(dRFromEulerAngles)("dRFromEulerAngles", lib);
bindFunc(dRFrom2Axes)("dRFrom2Axes", lib);
bindFunc(dRFromZAxis)("dRFromZAxis", lib);
bindFunc(dQSetIdentity)("dQSetIdentity", lib);
bindFunc(dQFromAxisAndAngle)("dQFromAxisAndAngle", lib);
bindFunc(dQMultiply0)("dQMultiply0", lib);
bindFunc(dQMultiply1)("dQMultiply1", lib);
bindFunc(dQMultiply2)("dQMultiply2", lib);
bindFunc(dQMultiply3)("dQMultiply3", lib);
bindFunc(dRfromQ)("dRfromQ", lib);
bindFunc(dQfromR)("dQfromR", lib);
bindFunc(dDQfromW)("dDQfromW", lib);
// timer.h
bindFunc(dStopwatchReset)("dStopwatchReset", lib);
bindFunc(dStopwatchStart)("dStopwatchStart", lib);
bindFunc(dStopwatchStop)("dStopwatchStop", lib);
bindFunc(dStopwatchTime)("dStopwatchTime", lib);
bindFunc(dTimerStart)("dTimerStart", lib);
bindFunc(dTimerNow)("dTimerNow", lib);
bindFunc(dTimerEnd)("dTimerEnd", lib);
bindFunc(dTimerReport)("dTimerReport", lib);
bindFunc(dTimerTicksPerSecond)("dTimerTicksPerSecond", lib);
bindFunc(dTimerResolution)("dTimerResolution", lib);
// defined in interface, present in ODE source, but consistently fails to load
// bindFunc(dWorldExportDIF)("dWorldExportDIF", lib);
}
GenericLoader DerelictODE;
static this() {
version(DerelictODE_DoublePrecision)
{
char[] winlib = "ode_double.dll";
char[] linlib = "libode_double.so";
}
else
{
char[] winlib = "ode_single.dll";
char[] linlib = "ode_double.dll";
}
DerelictODE.setup(
winlib ~ ", ode.dll",
linlib ~ ", libode.so, libode.so.0, libode.so.0.8.0",
"",
&load
);
}
extern(C)
{
// common.h
char* function() dGetConfiguration;
int function(in char*) dCheckConfiguration;
// collision.h
void function(dGeomID) dGeomDestroy;
void function(dGeomID, void*) dGeomSetData;
void* function(dGeomID) dGeomGetData;
void function(dGeomID, dBodyID) dGeomSetBody;
dBodyID function(dGeomID) dGeomGetBody;
void function(dGeomID, dReal, dReal, dReal) dGeomSetPosition;
void function(dGeomID, in dMatrix3) dGeomSetRotation;
void function(dGeomID, in dQuaternion) dGeomSetQuaternion;
dReal* function(dGeomID) dGeomGetPosition;
void function(dGeomID, dVector3) dGeomCopyPosition;
dReal* function(dGeomID) dGeomGetRotation;
void function(dGeomID, dMatrix3) dGeomCopyRotation;
void function(dGeomID, dQuaternion) dGeomGetQuaternion;
void function(dGeomID, dReal[6]) dGeomGetAABB;
int function(dGeomID) dGeomIsSpace;
dSpaceID function(dGeomID) dGeomGetSpace;
int function(dGeomID) dGeomGetClass;
void function(dGeomID, uint) dGeomSetCategoryBits;
void function(dGeomID, uint) dGeomSetCollideBits;
uint function(dGeomID) dGeomGetCategoryBits;
uint function(dGeomID) dGeomGetCollideBits;
void function(dGeomID) dGeomEnable;
void function(dGeomID) dGeomDisable;
int function(dGeomID) dGeomIsEnabled;
void function(dGeomID, dReal, dReal, dReal) dGeomSetOffsetPosition;
void function(dGeomID, in dMatrix3) dGeomSetOffsetRotation;
void function(dGeomID, in dQuaternion) dGeomSetOffsetQuaternion;
void function(dGeomID, dReal, dReal, dReal) dGeomSetOffsetWorldPosition;
void function(dGeomID, in dMatrix3) dGeomSetOffsetWorldRotation;
void function(dGeomID, int dQuaternion) dGeomSetOffsetWorldQuaternion;
void function(dGeomID) dGeomClearOffset;
int function(dGeomID) dGeomIsOffset;
dReal* function(dGeomID) dGeomGetOffsetPosition;
void function(dGeomID, dVector3) dGeomCopyOffsetPosition;
dReal* function(dGeomID) dGeomGetOffsetRotation;
void function(dGeomID, dQuaternion) dGeomGetOffsetQuaternion;
int function(dGeomID, dGeomID, int, dContactGeom*) dCollide;
void function(dSpaceID, void*, dNearCallback) dSpaceCollide;
void function(dGeomID, dGeomID, void*, dNearCallback) dSpaceCollide2;
dGeomID function(dSpaceID, dReal) dCreateSphere;
void function(dGeomID, dReal) dGeomSphereSetRadius;
dReal function(dGeomID) dGeomSphereGetRadius;
dReal function(dGeomID, dReal, dReal, dReal) dGeomSpherePointDepth;
dGeomID function(dSpaceID, dReal*, uint, dReal*, uint, uint*) dCreateConvex;
void function(dGeomID, dReal*, uint, dReal*, uint, uint*) dGeomSetConvex;
dGeomID function(dSpaceID, dReal, dReal, dReal) dCreateBox;
void function(dGeomID, dReal, dReal, dReal) dGeomBoxSetLengths;
void function(dGeomID, dVector3) dGeomBoxGetLengths;
dReal function(dGeomID, dReal, dReal, dReal) dGeomBoxPointDepth;
dGeomID function(dSpaceID, dReal, dReal, dReal, dReal) dCreatePlane;
void function(dGeomID, dReal, dReal, dReal, dReal) dGeomPlaneSetParams;
void function(dGeomID, dVector4) dGeomPlaneGetParams;
dReal function(dGeomID, dReal, dReal, dReal) dGeomPlanePointDepth;
dGeomID function(dSpaceID, dReal, dReal) dCreateCapsule;
void function(dGeomID, dReal, dReal) dGeomCapsuleSetParams;
void function(dGeomID, dReal*, dReal*) dGeomCapsuleGetParams;
dReal function(dGeomID, dReal, dReal, dReal) dGeomCapsulePointDepth;
dGeomID function(dSpaceID, dReal, dReal) dCreateCylinder;
void function(dGeomID, dReal, dReal) dGeomCylinderSetParams;
void function(dGeomID, dReal*, dReal*) dGeomCylinderGetParams;
dGeomID function(dSpaceID, dReal) dCreateRay;
void function(dGeomID, dReal) dGeomRaySetLength;
dReal function(dGeomID) dGeomRayGetLength;
void function(dGeomID, dReal, dReal, dReal, dReal, dReal, dReal) dGeomRaySet;
void function(dGeomID, dVector3, dVector3) dGeomRayGet;
void function(dGeomID, int, int) dGeomRaySetParams;
void function(dGeomID, int*, int*) dGeomRayGetParams;
void function(dGeomID, int) dGeomRaySetClosestHit;
int function(dGeomID) dGeomRayGetClosestHit;
dGeomID function(dSpaceID) dCreateGeomTransform;
void function(dGeomID, dGeomID) dGeomTransformSetGeom;
dGeomID function(dGeomID) dGeomTransformGetGeom;
void function(dGeomID, int) dGeomTransformSetCleanup;
int function(dGeomID) dGeomTransformGetCleanup;
void function(dGeomID, int) dGeomTransformSetInfo;
int function(dGeomID) dGeomTransformGetInfo;
dGeomID function(dSpaceID, dHeightfieldDataID, int) dCreateHeightfield;
dHeightfieldDataID function() dGeomHeightfieldDataCreate;
void function(dHeightfieldDataID) dGeomHeightfieldDataDestroy;
void function(dHeightfieldDataID, void*, dHeightfieldGetHeight, dReal, dReal, int, int, dReal, dReal, dReal, int) dGeomHeightfieldDataBuildCallback;
void function(dHeightfieldDataID, in ubyte*, int, dReal, dReal, int, int, dReal, dReal, dReal, int) dGeomHeightfieldDataBuildByte;
void function(dHeightfieldDataID, in short*, int, dReal, dReal, int, int, dReal, dReal, dReal, int) dGeomHeightfieldDataBuildShort;
void function(dHeightfieldDataID, in float*, int, dReal, dReal, int, int, dReal, dReal, dReal, int) dGeomHeightfieldDataBuildSingle;
void function(dHeightfieldDataID, in double*, int, dReal, dReal, int, int, dReal, dReal, dReal, int) dGeomHeightfieldDataBuildDouble;
void function(dHeightfieldDataID, dReal, dReal) dGeomHeightfieldDataSetBounds;
void function(dGeomID, dHeightfieldDataID) dGeomHeightfieldSetHeightfieldData;
dHeightfieldDataID function(dGeomID) dGeomHeightfieldGetHeightfieldData;
void function(in dVector3, in dVector3, in dVector3, in dVector3, dVector3, dVector3) dClosestLineSegmentPoints;
int function(in dVector3, in dMatrix3, in dVector3, in dVector3, in dMatrix3, in dVector3) dBoxTouchesBox;
int function(in dVector3, in dMatrix3, in dVector3, in dVector3, in dMatrix3, in dVector3, dVector3, dReal*, int*, int, dContactGeom*, int) dBoxBox;
void function(dGeomID, dReal[6]) dInfiniteAABB;
int function(in dGeomClass*) dCreateGeomClass;
void* function(dGeomID) dGeomGetClassData;
dGeomID function(int) dCreateGeom;
void function(int, int, dColliderFn) dSetColliderOverride;
alias dCreateCapsule dCreateCCylinder;
alias dGeomCapsuleSetParams dGeomCCylinderSetParams;
alias dGeomCapsuleGetParams dGeomCCylinderGetParams;
alias dGeomCapsulePointDepth dGeomCCylinderPointDepth;
// collision_space.h
dSpaceID function(dSpaceID) dSimpleSpaceCreate;
dSpaceID function(dSpaceID) dHashSpaceCreate;
dSpaceID function(dSpaceID, in dVector3, in dVector3, int) dQuadTreeSpaceCreate;
dSpaceID function(dSpaceID, int) dSweepAndPruneSpaceCreate;
void function(dSpaceID) dSpaceDestroy;
void function(dSpaceID, int, int) dHashSpaceSetLevels;
void function(dSpaceID, int*, int*) dHashSpaceGetLevels;
void function(dSpaceID, int) dSpaceSetCleanup;
int function(dSpaceID) dSpaceGetCleanup;
void function(dSpaceID, int) dSpaceSetSublevel;
int function(dSpaceID) dSpaceGetSublevel;
void function(dSpaceID, dGeomID) dSpaceAdd;
void function(dSpaceID, dGeomID) dSpaceRemove;
int function(dSpaceID, dGeomID) dSpaceQuery;
void function(dSpaceID) dSpaceClean;
int function(dSpaceID) dSpaceGetNumGeoms;
dGeomID function(dSpaceID, int) dSpaceGetGeom;
int function(dSpaceID) dSpaceGetClass;
// collision_trimesh.h
dTriMeshDataID function() dGeomTriMeshDataCreate;
void function(dTriMeshDataID) dGeomTriMeshDataDestroy;
void function(dTriMeshDataID, int, void*) dGeomTriMeshDataSet;
void* function(dTriMeshDataID, int) dGeomTriMeshDataGet;
void function(dGeomID, dMatrix4) dGeomTriMeshSetLastTransform;
dReal* function(dGeomID) dGeomTriMeshGetLastTransform;
void function(dTriMeshDataID, in void*, int, int, in void*, int, int) dGeomTriMeshDataBuildSingle;
void function(dTriMeshDataID, in void*, int, int, in void*, int, int, in void*) dGeomTriMeshDataBuildSingle1;
void function(dTriMeshDataID, in void*, int, int, in void*, int, int) dGeomTriMeshDataBuildDouble;
void function(dTriMeshDataID, in void*, int, int, in void*, int, int, in void*) dGeomTriMeshDataBuildDouble1;
void function(dTriMeshDataID, in dReal*, int, in dTriIndex*, int) dGeomTriMeshDataBuildSimple;
void function(dTriMeshDataID, in dReal*, int, in dTriIndex*, int, in int*) dGeomTriMeshDataBuildSimple1;
void function(dTriMeshDataID) dGeomTriMeshDataPreprocess;
void function(dTriMeshDataID, ubyte**, int*) dGeomTriMeshDataGetBuffer;
void function(dTriMeshDataID, ubyte*) dGeomTriMeshDataSetBuffer;
void function(dGeomID, dTriCallback) dGeomTriMeshSetCallback;
dTriCallback function(dGeomID) dGeomTriMeshGetCallback;
void function(dGeomID, dTriArrayCallback) dGeomTriMeshSetArrayCallback;
dTriArrayCallback function(dGeomID) dGeomTriMeshGetArrayCallback;
void function(dGeomID, dTriRayCallback) dGeomTriMeshSetRayCallback;
dTriRayCallback function(dGeomID) dGeomTriMeshGetRayCallback;
void function(dGeomID, dTriTriMergeCallback) dGeomTriMeshSetTriMergeCallback;
dTriTriMergeCallback function(dGeomID) dGeomTriMeshGetTriMergeCallback;
dGeomID function(dSpaceID, dTriMeshDataID, dTriCallback, dTriArrayCallback, dTriRayCallback) dCreateTriMesh;
void function(dGeomID, dTriMeshDataID) dGeomTriMeshSetData;
dTriMeshDataID function(dGeomID) dGeomTriMeshGetData;
void function(dGeomID, int, int) dGeomTriMeshEnableTC;
int function(dGeomID, int) dGeomTriMeshIsTCEnabled;
void function(dGeomID) dGeomTriMeshClearTCCache;
dTriMeshDataID function(dGeomID) dGeomTriMeshGetTriMeshDataID;
void function(dGeomID, int, dVector3*, dVector3*, dVector3*) dGeomTriMeshGetTriangle;
void function(dGeomID, int, dReal, dReal, dVector3) dGeomTriMeshGetPoint;
int function(dGeomID) dGeomTriMeshGetTriangleCount;
void function(dTriMeshDataID) dGeomTriMeshDataUpdate;
// error.h
void function(dMessageFunction) dSetErrorHandler;
void function(dMessageFunction) dSetDebugHandler;
void function(dMessageFunction) dSetMessageHandler;
dMessageFunction function() dGetErrorHandler;
dMessageFunction function() dGetDebugHandler;
dMessageFunction function() dGetMessageHandler;
void function(int, in char*, ...) dError;
void function(int, in char*, ...) dDebug;
void function(int, in char*, ...) dMessage;
// mass.h
int function(in dMass*) dMassCheck;
void function(dMass*) dMassSetZero;
void function(dMass*, dReal, dReal, dReal, dReal, dReal, dReal, dReal, dReal, dReal, dReal) dMassSetParameters;
void function(dMass*, dReal, dReal) dMassSetSphere;
void function(dMass*, dReal, dReal) dMassSetSphereTotal;
void function(dMass*, dReal, int, dReal, dReal) dMassSetCapsule;
void function(dMass*, dReal, int, dReal, dReal) dMassSetCapsuleTotal;
void function(dMass*, dReal, int, dReal, dReal) dMassSetCylinder;
void function(dMass*, dReal, int, dReal, dReal) dMassSetCylinderTotal;
void function(dMass*, dReal, dReal, dReal, dReal) dMassSetBox;
void function(dMass*, dReal, dReal, dReal, dReal) dMassSetBoxTotal;
void function(dMass*, dReal, dGeomID) dMassSetTrimesh;
void function(dMass*, dReal, dGeomID) dMassSetTrimeshTotal;
void function(dMass*, dReal) dMassAdjust;
void function(dMass*, dReal, dReal, dReal) dMassTranslate;
void function(dMass*, in dMatrix3) dMassRotate;
void function(dMass*, in dMass*) dMassAdd;
// matrix.h
void function(dReal*, int) dSetZero;
void function(dReal*, int, dReal) dSetValue;
dReal function(in dReal*, in dReal*, int) dDot;
void function(dReal*, in dReal*, in dReal*, int, int, int) dMultiply0;
void function(dReal*, in dReal*, in dReal*, int, int, int) dMultiply1;
void function(dReal*, in dReal*, in dReal*, int, int, int) dMultiply2;
int function(dReal*, int) dFactorCholesky;
void function(in dReal*, dReal*, int) dSolveCholesky;
int function(in dReal*, dReal*, int) dInvertPDMatrix;
int function(in dReal*, int) dIsPositiveDefinite;
void function(dReal*, dReal*, int, int) dFactorLDLT;
void function(in dReal*, dReal*, int, int) dSolveL1;
void function(in dReal*, dReal*, int, int) dSolveL1T;
void function(dReal*, in dReal*, int) dVectorScale;
void function(in dReal*, in dReal*, dReal*, int, int) dSolveLDLT;
void function(dReal*, dReal*, in dReal*, int, int) dLDLTAddTL;
void function(dReal**, in int*, dReal*, dReal*, int, int, int, int) dLDLTRemove;
void function(dReal*, int, int, int) dRemoveRowCol;
// memory.h
void function(dAllocFunction) dSetAllocHandler;
void function(dReallocFunction) dSetReallocHandler;
void function(dFreeFunction) dSetFreeHandler;
dAllocFunction function() dGetAllocHandler;
dReallocFunction function() dGetReallocHandler;
dFreeFunction function() dGetFreeHandler;
void* function(size_t) dAlloc;
void* function(void*, size_t, size_t) dRealloc;
void function(void*, size_t) dFree;
// misc.h
int function() dTestRand;
uint function() dRand;
uint function() dRandGetSeed;
void function(uint) dRandSetSeed;
int function(int) dRandInt;
dReal function() dRandReal;
void function(in dReal*, int, int, char*, FILE*) dPrintMatrix;
void function(dReal, int, dReal) dMakeRandomVector;
void function(dReal*, int, int, dReal) dMakeRandomMatrix;
void function(dReal*, int) dClearUpperTriangle;
dReal function(in dReal*, in dReal*, int, int) dMaxDifference;
dReal function(in dReal*, in dReal*, int) dMaxDifferenceLowerTriangle;
// objects.h
dWorldID function() dWorldCreate;
void function(dWorldID) dWorldDestroy;
void function(dWorldID, dReal, dReal, dReal) dWorldSetGravity;
void function(dWorldID, dVector3) dWorldGetGravity;
void function(dWorldID, dReal) dWorldSetERP;
dReal function(dWorldID) dWorldGetERP;
void function(dWorldID, dReal) dWorldSetCFM;
dReal function(dWorldID) dWorldGetCFM;
void function(dWorldID, dReal) dWorldStep;
void function(dWorldID, dReal, dReal, dReal, dReal, dVector3) dWorldImpulseToForce;
void function(dWorldID, dReal) dWorldQuickStep;
void function(dWorldID, int) dWorldSetQuickStepNumIterations;
int function(dWorldID) dWorldGetQuickStepNumIterations;
void function(dWorldID, dReal) dWorldSetQuickStepW;
dReal function(dWorldID) dWorldGetQuickStepW;
void function(dWorldID, dReal) dWorldSetContactMaxCorrectingVel;
dReal function(dWorldID) dWorldGetContactMaxCorrectingVel;
void function(dWorldID, dReal) dWorldSetContactSurfaceLayer;
dReal function(dWorldID) dWorldGetContactSurfaceLayer;
void function(dWorldID, dReal, int) dWorldStepFast1;
void function(dWorldID, int) dWorldSetAutoEnableDepthSF1;
int function(dWorldID) dWorldGetAutoEnableDepthSF1;
dReal function(dWorldID) dWorldGetAutoDisableLinearThreshold;
void function(dWorldID, dReal) dWorldSetAutoDisableLinearThreshold;
dReal function(dWorldID) dWorldGetAutoDisableAngularThreshold;
void function(dWorldID, dReal) dWorldSetAutoDisableAngularThreshold;
int function(dWorldID) dWorldGetAutoDisableAverageSamplesCount;
void function(dWorldID, uint) dWorldSetAutoDisableAverageSamplesCount;
int function(dWorldID) dWorldGetAutoDisableSteps;
void function(dWorldID, int) dWorldSetAutoDisableSteps;
dReal function(dWorldID) dWorldGetAutoDisableTime;
void function(dWorldID, dReal) dWorldSetAutoDisableTime;
int function(dWorldID) dWorldGetAutoDisableFlag;
void function(dWorldID, int) dWorldSetAutoDisableFlag;
dReal function(dWorldID) dWorldGetLinearDampingThreshold;
void function(dWorldID, dReal) dWorldSetLinearDampingThreshold;
dReal function(dWorldID) dWorldGetAngularDampingThreshold;
void function(dWorldID, dReal) dWorldSetAngularDampingThreshold;
dReal function(dWorldID) dWorldGetLinearDamping;
void function(dWorldID, dReal) dWorldSetLinearDamping;
dReal function(dWorldID) dWorldGetAngularDamping;
void function(dWorldID, dReal) dWorldSetAngularDamping;
void function(dWorldID, dReal, dReal) dWorldSetDamping;
dReal function(dWorldID) dWorldGetMaxAngularSpeed;
void function(dWorldID, dReal) dWorldSetMaxAngularSpeed;
dReal function(dBodyID) dBodyGetAutoDisableLinearThreshold;
void function(dBodyID, dReal) dBodySetAutoDisableLinearThreshold;
dReal function(dBodyID) dBodyGetAutoDisableAngularThreshold;
void function(dBodyID, dReal) dBodySetAutoDisableAngularThreshold;
int function(dBodyID) dBodyGetAutoDisableAverageSamplesCount;
void function(dBodyID, uint) dBodySetAutoDisableAverageSamplesCount;
int function(dBodyID) dBodyGetAutoDisableSteps;
void function(dBodyID, int) dBodySetAutoDisableSteps;
dReal function(dBodyID) dBodyGetAutoDisableTime;
void function(dBodyID, dReal) dBodySetAutoDisableTime;
int function(dBodyID) dBodyGetAutoDisableFlag;
void function(dBodyID, int) dBodySetAutoDisableFlag;
void function(dBodyID) dBodySetAutoDisableDefaults;
dWorldID function(dBodyID) dBodyGetWorld;
dBodyID function(dWorldID) dBodyCreate;
void function(dBodyID) dBodyDestroy;
void function(dBodyID, void*) dBodySetData;
void* function(dBodyID) dBodyGetData;
void function(dBodyID, dReal, dReal, dReal) dBodySetPosition;
void function(dBodyID, in dMatrix3) dBodySetRotation;
void function(dBodyID, in dQuaternion) dBodySetQuaternion;
void function(dBodyID, dReal, dReal, dReal) dBodySetLinearVel;
void function(dBodyID, dReal, dReal, dReal) dBodySetAngularVel;
dReal* function(dBodyID) dBodyGetPosition;
void function(dBodyID, dVector3) dBodyCopyPosition;
dReal* function(dBodyID) dBodyGetRotation;
void function(dBodyID, dMatrix3) dBodyCopyRotation;
dReal* function(dBodyID) dBodyGetQuaternion;
void function(dBodyID, dQuaternion) dBodyCopyQuaternion;
dReal* function(dBodyID) dBodyGetLinearVel;
dReal* function(dBodyID) dBodyGetAngularVel;
void function(dBodyID, in dMass*) dBodySetMass;
void function(dBodyID, dMass*) dBodyGetMass;
void function(dBodyID, dReal, dReal, dReal) dBodyAddForce;
void function(dBodyID, dReal, dReal, dReal) dBodyAddTorque;
void function(dBodyID, dReal, dReal, dReal) dBodyAddRelForce;
void function(dBodyID, dReal, dReal, dReal) dBodyAddRelTorque;
void function(dBodyID, dReal, dReal, dReal, dReal, dReal, dReal) dBodyAddForceAtPos;
void function(dBodyID, dReal, dReal, dReal, dReal, dReal, dReal) dBodyAddForceAtRelPos;
void function(dBodyID, dReal, dReal, dReal, dReal, dReal, dReal) dBodyAddRelForceAtPos;
void function(dBodyID, dReal, dReal, dReal, dReal, dReal, dReal) dBodyAddRelForceAtRelPos;
dReal* function(dBodyID) dBodyGetForce;
dReal* function(dBodyID) dBodyGetTorque;
void function(dBodyID, dReal, dReal, dReal) dBodySetForce;
void function(dBodyID, dReal, dReal, dReal) dBodySetTorque;
void function(dBodyID, dReal, dReal, dReal, dVector3) dBodyGetRelPointPos;
void function(dBodyID, dReal, dReal, dReal, dVector3) dBodyGetRelPointVel;
void function(dBodyID, dReal, dReal, dReal, dVector3) dBodyGetPointVel;
void function(dBodyID, dReal, dReal, dReal, dVector3) dBodyGetPosRelPoint;
void function(dBodyID, dReal, dReal, dReal, dVector3) dBodyVectorToWorld;
void function(dBodyID, dReal, dReal, dReal, dVector3) dBodyVectorFromWorld;
void function(dBodyID, int) dBodySetFiniteRotationMode;
void function(dBodyID, dReal, dReal, dReal) dBodySetFiniteRotationAxis;
int function(dBodyID) dBodyGetFiniteRotationMode;
void function(dBodyID, dVector3) dBodyGetFiniteRotationAxis;
int function(dBodyID) dBodyGetNumJoints;
dJointID function(dBodyID) dBodyGetJoint;
void function(dBodyID) dBodySetDynamic;
void function(dBodyID) dBodySetKinematic;
int function(dBodyID) dBodyIsKinematic;
void function(dBodyID) dBodyEnable;
void function(dBodyID) dBodyDisable;
int function(dBodyID) dBodyIsEnabled;
void function(dBodyID, int) dBodySetGravityMode;
int function(dBodyID) dBodyGetGravityMode;
void function(dBodyID, void (*callback)(dBodyID)) dBodySetMovedCallback;
dGeomID function(dBodyID) dBodyGetFirstGeom;
dGeomID function(dGeomID) dBodyGetNextGeom;
void function(dBodyID) dBodySetDampingDefaults;
dReal function(dBodyID) dBodyGetLinearDamping;
void function(dBodyID, dReal) dBodySetLinearDamping;
dReal function(dBodyID) dBodyGetAngularDamping;
void function(dBodyID, dReal) dBodySetAngularDamping;
void function(dBodyID, dReal, dReal) dBodySetDamping;
dReal function(dBodyID) dBodyGetLinearDampingThreshold;
void function(dBodyID, dReal) dBodySetLinearDampingThreshold;
dReal function(dBodyID) dBodyGetAngularDampingThreshold;
void function(dBodyID, dReal) dBodySetAngularDampingThreshold;
dReal function(dBodyID) dBodyGetMaxAngularSpeed;
void function(dBodyID, dReal) dBodySetMaxAngularSpeed;
int function(dBodyID) dBodyGetGyroscopicMode;
void function(dBodyID, int) dBodySetGyroscopicMode;
dJointID function(dWorldID, dJointGroupID) dJointCreateBall;
dJointID function(dWorldID, dJointGroupID) dJointCreateHinge;
dJointID function(dWorldID, dJointGroupID) dJointCreateSlider;
dJointID function(dWorldID, dJointGroupID, in dContact*) dJointCreateContact;
dJointID function(dWorldID, dJointGroupID) dJointCreateHinge2;
dJointID function(dWorldID, dJointGroupID) dJointCreateUniversal;
dJointID function(dWorldID, dJointGroupID) dJointCreatePR;
dJointID function(dWorldID, dJointGroupID) dJointCreatePU;
dJointID function(dWorldID, dJointGroupID) dJointCreatePiston;
dJointID function(dWorldID, dJointGroupID) dJointCreateFixed;
dJointID function(dWorldID, dJointGroupID) dJointCreateNull;
dJointID function(dWorldID, dJointGroupID) dJointCreateAMotor;
dJointID function(dWorldID, dJointGroupID) dJointCreateLMotor;
dJointID function(dWorldID, dJointGroupID) dJointCreatePlane2D;
void function(dJointID) dJointDestroy;
dJointGroupID function(int) dJointGroupCreate;
void function(dJointGroupID) dJointGroupDestroy;
void function(dJointGroupID) dJointGroupEmpty;
int function(dJointID) dJointGetNumBodies;
void function(dJointID, dBodyID, dBodyID) dJointAttach;
void function(dJointID) dJointEnable;
void function(dJointID) dJointDisable;
int function(dJointID) dJointIsEnabled;
void function(dJointID, void*) dJointSetData;
void* function(dJointID) dJointGetData;
dJointType function(dJointID) dJointGetType;
dBodyID function(dJointID, int) dJointGetBody;
void function(dJointID, dJointFeedback*) dJointSetFeedback;
dJointFeedback* function(dJointID) dJointGetFeedback;
void function(dJointID, dReal, dReal, dReal) dJointSetBallAnchor;
void function(dJointID, dReal, dReal, dReal) dJointSetBallAnchor2;
void function(dJointID, int, dReal) dJointSetBallParam;
void function(dJointID, dReal, dReal, dReal) dJointSetHingeAnchor;
void function(dJointID, dReal, dReal, dReal, dReal, dReal, dReal) dJointSetHingeAnchorDelta;
void function(dJointID, dReal, dReal, dReal) dJointSetHingeAxis;
void function(dJointID, dReal, dReal, dReal, dReal) dJointSetHingeAxisOffset;
void function(dJointID, int, dReal) dJointSetHingeParam;
void function(dJointID, dReal) dJointAddHingeTorque;
void function(dJointID, dReal, dReal, dReal) dJointSetSliderAxis;
void function(dJointID, dReal, dReal, dReal, dReal, dReal, dReal) dJointSetSliderAxisDelta;
void function(dJointID, int, dReal) dJointSetSliderParam;
void function(dJointID, dReal) dJointAddSliderForce;
void function(dJointID, dReal, dReal, dReal) dJointSetHinge2Anchor;
void function(dJointID, dReal, dReal, dReal) dJointSetHinge2Axis1;
void function(dJointID, dReal, dReal, dReal) dJointSetHinge2Axis2;
void function(dJointID, int, dReal) dJointSetHinge2Param;
void function(dJointID, dReal, dReal) dJointAddHinge2Torques;
void function(dJointID, dReal, dReal, dReal) dJointSetUniversalAnchor;
void function(dJointID, dReal, dReal, dReal) dJointSetUniversalAxis1;
void function(dJointID, dReal, dReal, dReal, dReal, dReal) dJointSetUniversalAxis1Offset;
void function(dJointID, dReal, dReal, dReal) dJointSetUniversalAxis2;
void function(dJointID, dReal, dReal, dReal, dReal, dReal) dJointSetUniversalAxis2Offset;
void function(dJointID, int, dReal) dJointSetUniversalParam;
void function(dJointID, dReal, dReal) dJointAddUniversalTorques;
void function(dJointID, dReal, dReal, dReal) dJointSetPRAnchor;
void function(dJointID, dReal, dReal, dReal) dJointSetPRAxis1;
void function(dJointID, dReal, dReal, dReal) dJointSetPRAxis2;
void function(dJointID, int, dReal) dJointSetPRParam;
void function(dJointID, dReal) dJointAddPRTorque;
void function(dJointID, dReal, dReal, dReal) dJointSetPUAnchor;
void function(dJointID, dReal, dReal, dReal, dReal, dReal, dReal) dJointSetPUAnchorOffset;
void function(dJointID, dReal, dReal, dReal) dJointSetPUAxis1;
void function(dJointID, dReal, dReal, dReal) dJointSetPUAxis2;
void function(dJointID, dReal, dReal, dReal) dJointSetPUAxis3;
void function(dJointID, dReal, dReal, dReal) dJointSetPUAxisP;
void function(dJointID, int, dReal) dJointSetPUParam;
void function(dJointID, dReal, dReal, dReal) dJointSetPistonAnchor;
void function(dJointID, dReal, dReal, dReal, dReal, dReal, dReal) dJointSetPistonAnchorOffset;
void function(dJointID, dReal, dReal, dReal) dJointSetPistonAxis;
void function(dJointID, int, dReal) dJointSetPistonParam;
void function(dJointID, dReal) dJointAddPistonForce;
void function(dJointID) dJointSetFixed;
void function(dJointID, int, dReal) dJointSetFixedParam;
void function(dJointID, int) dJointSetAMotorNumAxes;
void function(dJointID, int, int, dReal, dReal, dReal) dJointSetAMotorAxis;
void function(dJointID, int, dReal) dJointSetAMotorAngle;
void function(dJointID, int, dReal) dJointSetAMotorParam;
void function(dJointID, int) dJointSetAMotorMode;
void function(dJointID, dReal, dReal, dReal) dJointAddAMotorTorques;
void function(dJointID, int) dJointSetLMotorNumAxes;
void function(dJointID, int, int, dReal, dReal, dReal) dJointSetLMotorAxis;
void function(dJointID, int, dReal) dJointSetLMotorParam;
void function(dJointID, int, dReal) dJointSetPlane2DXParam;
void function(dJointID, int, dReal) dJointSetPlane2DYParam;
void function(dJointID, int, dReal) dJointSetPlane2DAngleParam;
void function(dJointID, dVector3) dJointGetBallAnchor;
void function(dJointID, dVector3) dJointGetBallAnchor2;
dReal function(dJointID, int) dJointGetBallParam;
void function(dJointID, dVector3) dJointGetHingeAnchor;
void function(dJointID, dVector3) dJointGetHingeAnchor2;
void function(dJointID, dVector3) dJointGetHingeAxis;
dReal function(dJointID, int) dJointGetHingeParam;
dReal function(dJointID) dJointGetHingeAngle;
dReal function(dJointID) dJointGetHingeAngleRate;
dReal function(dJointID) dJointGetSliderPosition;
dReal function(dJointID) dJointGetSliderPositionRate;
void function(dJointID, dVector3) dJointGetSliderAxis;
dReal function(dJointID, int) dJointGetSliderParam;
void function(dJointID, dVector3) dJointGetHinge2Anchor;
void function(dJointID, dVector3) dJointGetHinge2Anchor2;
void function(dJointID, dVector3) dJointGetHinge2Axis1;
void function(dJointID, dVector3) dJointGetHinge2Axis2;
dReal function(dJointID, int) dJointGetHinge2Param;
dReal function(dJointID) dJointGetHinge2Angle1;
dReal function(dJointID) dJointGetHinge2Angle1Rate;
dReal function(dJointID) dJointGetHinge2Angle2Rate;
void function(dJointID, dVector3) dJointGetUniversalAnchor;
void function(dJointID, dVector3) dJointGetUniversalAnchor2;
void function(dJointID, dVector3) dJointGetUniversalAxis1;
void function(dJointID, dVector3) dJointGetUniversalAxis2;
dReal function(dJointID, int) dJointGetUniversalParam;
void function(dJointID, dReal*, dReal*) dJointGetUniversalAngles;
dReal function(dJointID) dJointGetUniversalAngle1;
dReal function(dJointID) dJointGetUniversalAngle2;
dReal function(dJointID) dJointGetUniversalAngle1Rate;
dReal function(dJointID) dJointGetUniversalAngle2Rate;
void function(dJointID, dVector3) dJointGetPRAnchor;
dReal function(dJointID) dJointGetPRPosition;
dReal function(dJointID) dJointGetPRPositionRate;
dReal function(dJointID) dJointGetPRAngle;
dReal function(dJointID) dJointGetPRAngleRate;
void function(dJointID, dVector3) dJointGetPRAxis1;
void function(dJointID, dVector3) dJointGetPRAxis2;
dReal function(dJointID, int) dJointGetPRParam;
void function(dJointID, dVector3) dJointGetPUAnchor;
dReal function(dJointID) dJointGetPUPosition;
dReal function(dJointID) dJointGetPUPositionRate;
void function(dJointID, dVector3) dJointGetPUAxis1;
void function(dJointID, dVector3) dJointGetPUAxis2;
void function(dJointID, dVector3) dJointGetPUAxis3;
void function(dJointID, dVector3) dJointGetPUAxisP;
void function(dJointID, dReal*, dReal*) dJointGetPUAngles;
dReal function(dJointID) dJointGetPUAngle1;
dReal function(dJointID) dJointGetPUAngle1Rate;
dReal function(dJointID) dJointGetPUAngle2;
dReal function(dJointID) dJointGetPUAngle2Rate;
dReal function(dJointID, int) dJointGetPUParam;
dReal function(dJointID) dJointGetPistonPosition;
dReal function(dJointID) dJointGetPistonPositionRate;
dReal function(dJointID) dJointGetPistonAngle;
dReal function(dJointID) dJointGetPistonAngleRate;
void function(dJointID, dVector3) dJointGetPistonAnchor;
void function(dJointID, dVector3) dJointGetPistonAnchor2;
void function(dJointID, dVector3) dJointGetPistonAxis;
dReal function(dJointID, int) dJointGetPistonParam;
int function(dJointID) dJointGetAMotorNumAxes;
void function(dJointID, int, dVector3) dJointGetAMotorAxis;
int function(dJointID, int) dJointGetAMotorAxisRel;
dReal function(dJointID, int) dJointGetAMotorAngle;
dReal function(dJointID, int) dJointGetAMotorAngleRate;
dReal function(dJointID, int) dJointGetAMotorParam;
int function(dJointID) dJointGetAMotorMode;
int function(dJointID) dJointGetLMotorNumAxes;
void function(dJointID, int, dVector3) dJointGetLMotorAxis;
dReal function(dJointID, int) dJointGetLMotorParam;
dReal function(dJointID, int) dJointGetFixedParam;
dJointID function(dBodyID, dBodyID) dConnectingJoint;
int function(dBodyID, dBodyID, dJointID*) dConnectingJointList;
int function(dBodyID, dBodyID) dAreConnected;
int function(dBodyID, dBodyID, int) dAreConnectedExcluding;
// odeinit.h
void function() dInitODE;
int function(uint) dInitODE2;
int function(uint) dAllocateODEDataForThread;
void function() dCleanupODEAllDataForThread;
void function() dCloseODE;
// rotation.h
void function(dMatrix3) dRSetIdentity;
void function(dMatrix3, dReal, dReal, dReal, dReal) dRFromAxisAndAngle;
void function(dMatrix3, dReal, dReal, dReal) dRFromEulerAngles;
void function(dMatrix3, dReal, dReal, dReal, dReal, dReal, dReal) dRFrom2Axes;
void function(dMatrix3, dReal, dReal, dReal) dRFromZAxis;
void function(dQuaternion) dQSetIdentity;
void function(dQuaternion, dReal, dReal, dReal, dReal) dQFromAxisAndAngle;
void function(dQuaternion, in dQuaternion, in dQuaternion) dQMultiply0;
void function(dQuaternion, in dQuaternion, in dQuaternion) dQMultiply1;
void function(dQuaternion, in dQuaternion, in dQuaternion) dQMultiply2;
void function(dQuaternion, in dQuaternion, in dQuaternion) dQMultiply3;
void function(dMatrix3, in dQuaternion) dRfromQ;
void function(dQuaternion, in dMatrix3) dQfromR;
void function(dReal[4], in dVector3, in dQuaternion) dDQfromW;
// timer.h
void function(dStopwatch*) dStopwatchReset;
void function(dStopwatch*) dStopwatchStart;
void function(dStopwatch*) dStopwatchStop;
double function(dStopwatch*) dStopwatchTime;
void function(in char*) dTimerStart;
void function(in char*) dTimerNow;
void function() dTimerEnd;
void function(FILE*, int) dTimerReport;
double function() dTimerTicksPerSecond;
double function() dTimerResolution;
// void function(dWorldID, FILE*, in char*) dWorldExportDIF;
}
|
D
|
import interfaces;
import category;
import std.traits;
bool isIn(immutable IMorphism c, immutable ICategory cat) {
return meet(c.category(), cat).isEqual(cat);
}
bool isIn(immutable IObject c, immutable ICategory cat) {
return meet(c.category(), cat).isEqual(cat);
}
bool allIn(immutable IObject[] obj, immutable ICategory cat) {
import std.algorithm;
return obj.all!(o => o.isIn(cat));
}
bool allIn(immutable IMorphism[] morph, immutable ICategory cat) {
import std.algorithm;
return morph.all!(o => o.isIn(cat));
}
bool allSameSource(immutable IMorphism[] morph) {
if (morph.length == 1) {
return true;
}
else {
return morph[0].source().isEqual(morph[1].source()) && allSameSource(morph[1 .. $]);
}
}
bool areComposableIn(immutable IMorphism[] morph, immutable ICategory cat) {
bool result = morph.allIn(cat);
for (int i = 0; i < morph.length - 1; i++) {
import std.stdio;
result &= morph[i].source().isEqual(morph[i + 1].target());
}
return result;
}
bool isInitialObjectIn(immutable IObject obj, immutable ICategory cat) {
if (cat.hasInitialObject() && cat.initialObject().isEqual(obj)) {
return true;
}
else if (auto cobj = cast(immutable CartesianProductObject)(obj)) {
return allSatisfy!(o => o.isInitialObjectIn(cat))(cobj);
}
else if (auto homSet = cast(immutable IHomSet)(obj)) {
if (cat.isEqual(Set)) {
auto hcat = homSet.morphismCategory();
return homSet.isIn(cat) && homSet.target.isInitialObjectIn(cat);
}
if (cat.isEqual(Vec)) {
return obj.isTerminalObjectIn(cat);
}
return false;
}
else {
return false;
}
}
bool isTerminalObjectIn(immutable IObject obj, immutable ICategory cat) {
if (cat.hasTerminalObject() && cat.terminalObject().isEqual(obj)) {
return true;
}
else if (auto cobj = cast(immutable CartesianProductObject)(obj)) {
return allSatisfy!(o => o.isTerminalObjectIn(cat))(cobj);
}
else if (auto homSet = cast(immutable IHomSet)(obj)) {
auto hcat = homSet.morphismCategory();
return homSet.isIn(cat) && (homSet.target.isTerminalObjectIn(hcat)
|| homSet.source.isInitialObjectIn(hcat));
}
else {
return false;
}
}
bool allSatisfy(alias pred, X)(immutable X x)
if (hasMember!(X, "opIndex") && hasMember!(X, "size")) {
bool result = true;
foreach (i; 0 .. x.size())
result &= pred(x[i]);
return result;
}
bool anySatisfy(alias pred, X)(immutable X x)
if (hasMember!(X, "opIndex") && hasMember!(X, "size")) {
foreach (i; 0 .. x.size())
if (pred(x[i]))
return true;
return false;
}
|
D
|
/**
Package file for all lowlevel stuff
*/
module d2d.core.render.lowlevel;
public import d2d.core.render.lowlevel.gputexture;
public import d2d.core.render.lowlevel.buffer;
public import d2d.core.render.lowlevel.vao;
|
D
|
instance BAU_902_Gunnar(Npc_Default)
{
name[0] = "Gunnar";
guild = GIL_BAU;
id = 902;
voice = 10;
flags = 0;
npcType = npctype_main;
B_SetAttributesToChapter(self,2);
fight_tactic = FAI_HUMAN_STRONG;
EquipItem(self,ItMw_2h_Bau_Axe);
B_CreateAmbientInv(self);
B_SetNpcVisual(self,MALE,"Hum_Head_FatBald",Face_N_NormalBart03,BodyTex_N,ITAR_Bau_M);
Mdl_SetModelFatness(self,1);
Mdl_ApplyOverlayMds(self,"Humans_Relaxed.mds");
B_GiveNpcTalents(self);
B_SetFightSkills(self,25);
daily_routine = Rtn_Start_902;
};
func void Rtn_Start_902()
{
TA_Smalltalk(8,0,19,59,"NW_BIGFARM_STABLE_OUT_01");
TA_Sit_Chair(19,59,8,0,"NW_BIGFARM_STABLE_06");
};
|
D
|
// Written in the D programming language.
/++
This module defines functions related to exceptions and general error
handling. It also defines functions intended to aid in unit testing.
Synopsis of some of std.exception's functions:
--------------------
string synopsis()
{
FILE* f = enforce(fopen("some/file"));
// f is not null from here on
FILE* g = enforce!WriteException(fopen("some/other/file", "w"));
// g is not null from here on
Exception e = collectException(write(g, readln(f)));
if (e)
{
... an exception occurred...
... We have the exception to play around with...
}
string msg = collectExceptionMsg(write(g, readln(f)));
if (msg)
{
... an exception occurred...
... We have the message from the exception but not the exception...
}
char[] line;
enforce(readln(f, line));
return assumeUnique(line);
}
--------------------
Copyright: Copyright Andrei Alexandrescu 2008-, Jonathan M Davis 2011-.
License: $(HTTP boost.org/LICENSE_1_0.txt, Boost License 1.0)
Authors: $(HTTP erdani.org, Andrei Alexandrescu) and Jonathan M Davis
Source: $(PHOBOSSRC std/_exception.d)
+/
module std.exception;
import std.range.primitives;
import std.traits;
/++
Asserts that the given expression does $(I not) throw the given type
of $(D Throwable). If a $(D Throwable) of the given type is thrown,
it is caught and does not escape assertNotThrown. Rather, an
$(D AssertError) is thrown. However, any other $(D Throwable)s will escape.
Params:
T = The $(D Throwable) to test for.
expression = The expression to test.
msg = Optional message to output on test failure.
If msg is empty, and the thrown exception has a
non-empty msg field, the exception's msg field
will be output on test failure.
file = The file where the error occurred.
Defaults to $(D __FILE__).
line = The line where the error occurred.
Defaults to $(D __LINE__).
Throws:
$(D AssertError) if the given $(D Throwable) is thrown.
Returns:
the result of `expression`.
+/
auto assertNotThrown(T : Throwable = Exception, E)
(lazy E expression,
string msg = null,
string file = __FILE__,
size_t line = __LINE__)
{
import core.exception : AssertError;
try
{
return expression();
}
catch (T t)
{
immutable message = msg.length == 0 ? t.msg : msg;
immutable tail = message.length == 0 ? "." : ": " ~ message;
throw new AssertError("assertNotThrown failed: " ~ T.stringof ~ " was thrown" ~ tail, file, line, t);
}
}
///
@system unittest
{
import core.exception : AssertError;
import std.string;
assertNotThrown!StringException(enforce!StringException(true, "Error!"));
//Exception is the default.
assertNotThrown(enforce!StringException(true, "Error!"));
assert(collectExceptionMsg!AssertError(assertNotThrown!StringException(
enforce!StringException(false, "Error!"))) ==
`assertNotThrown failed: StringException was thrown: Error!`);
}
@system unittest
{
import core.exception : AssertError;
import std.string;
assert(collectExceptionMsg!AssertError(assertNotThrown!StringException(
enforce!StringException(false, ""), "Error!")) ==
`assertNotThrown failed: StringException was thrown: Error!`);
assert(collectExceptionMsg!AssertError(assertNotThrown!StringException(
enforce!StringException(false, ""))) ==
`assertNotThrown failed: StringException was thrown.`);
assert(collectExceptionMsg!AssertError(assertNotThrown!StringException(
enforce!StringException(false, ""), "")) ==
`assertNotThrown failed: StringException was thrown.`);
}
@system unittest
{
import core.exception : AssertError;
void throwEx(Throwable t) { throw t; }
bool nothrowEx() { return true; }
try
{
assert(assertNotThrown!Exception(nothrowEx()));
}
catch (AssertError) assert(0);
try
{
assert(assertNotThrown!Exception(nothrowEx(), "It's a message"));
}
catch (AssertError) assert(0);
try
{
assert(assertNotThrown!AssertError(nothrowEx()));
}
catch (AssertError) assert(0);
try
{
assert(assertNotThrown!AssertError(nothrowEx(), "It's a message"));
}
catch (AssertError) assert(0);
{
bool thrown = false;
try
{
assertNotThrown!Exception(
throwEx(new Exception("It's an Exception")));
}
catch (AssertError) thrown = true;
assert(thrown);
}
{
bool thrown = false;
try
{
assertNotThrown!Exception(
throwEx(new Exception("It's an Exception")), "It's a message");
}
catch (AssertError) thrown = true;
assert(thrown);
}
{
bool thrown = false;
try
{
assertNotThrown!AssertError(
throwEx(new AssertError("It's an AssertError", __FILE__, __LINE__)));
}
catch (AssertError) thrown = true;
assert(thrown);
}
{
bool thrown = false;
try
{
assertNotThrown!AssertError(
throwEx(new AssertError("It's an AssertError", __FILE__, __LINE__)),
"It's a message");
}
catch (AssertError) thrown = true;
assert(thrown);
}
}
/++
Asserts that the given expression throws the given type of $(D Throwable).
The $(D Throwable) is caught and does not escape assertThrown. However,
any other $(D Throwable)s $(I will) escape, and if no $(D Throwable)
of the given type is thrown, then an $(D AssertError) is thrown.
Params:
T = The $(D Throwable) to test for.
expression = The expression to test.
msg = Optional message to output on test failure.
file = The file where the error occurred.
Defaults to $(D __FILE__).
line = The line where the error occurred.
Defaults to $(D __LINE__).
Throws:
$(D AssertError) if the given $(D Throwable) is not thrown.
+/
void assertThrown(T : Throwable = Exception, E)
(lazy E expression,
string msg = null,
string file = __FILE__,
size_t line = __LINE__)
{
import core.exception : AssertError;
try
expression();
catch (T)
return;
throw new AssertError("assertThrown failed: No " ~ T.stringof ~ " was thrown"
~ (msg.length == 0 ? "." : ": ") ~ msg,
file, line);
}
///
@system unittest
{
import core.exception : AssertError;
import std.string;
assertThrown!StringException(enforce!StringException(false, "Error!"));
//Exception is the default.
assertThrown(enforce!StringException(false, "Error!"));
assert(collectExceptionMsg!AssertError(assertThrown!StringException(
enforce!StringException(true, "Error!"))) ==
`assertThrown failed: No StringException was thrown.`);
}
@system unittest
{
import core.exception : AssertError;
void throwEx(Throwable t) { throw t; }
void nothrowEx() { }
try
{
assertThrown!Exception(throwEx(new Exception("It's an Exception")));
}
catch (AssertError) assert(0);
try
{
assertThrown!Exception(throwEx(new Exception("It's an Exception")),
"It's a message");
}
catch (AssertError) assert(0);
try
{
assertThrown!AssertError(throwEx(new AssertError("It's an AssertError",
__FILE__, __LINE__)));
}
catch (AssertError) assert(0);
try
{
assertThrown!AssertError(throwEx(new AssertError("It's an AssertError",
__FILE__, __LINE__)),
"It's a message");
}
catch (AssertError) assert(0);
{
bool thrown = false;
try
assertThrown!Exception(nothrowEx());
catch (AssertError)
thrown = true;
assert(thrown);
}
{
bool thrown = false;
try
assertThrown!Exception(nothrowEx(), "It's a message");
catch (AssertError)
thrown = true;
assert(thrown);
}
{
bool thrown = false;
try
assertThrown!AssertError(nothrowEx());
catch (AssertError)
thrown = true;
assert(thrown);
}
{
bool thrown = false;
try
assertThrown!AssertError(nothrowEx(), "It's a message");
catch (AssertError)
thrown = true;
assert(thrown);
}
}
/++
Enforces that the given value is true.
Params:
value = The value to test.
E = Exception type to throw if the value evalues to false.
msg = The error message to put in the exception if it is thrown.
file = The source file of the caller.
line = The line number of the caller.
Returns: $(D value), if `cast(bool)value` is true. Otherwise,
$(D new Exception(msg)) is thrown.
Note:
$(D enforce) is used to throw exceptions and is therefore intended to
aid in error handling. It is $(I not) intended for verifying the logic
of your program. That is what $(D assert) is for. Also, do not use
$(D enforce) inside of contracts (i.e. inside of $(D in) and $(D out)
blocks and $(D invariant)s), because they will be compiled out when
compiling with $(I -release). Use $(D assert) in contracts.
Example:
--------------------
auto f = enforce(fopen("data.txt"));
auto line = readln(f);
enforce(line.length, "Expected a non-empty line.");
--------------------
+/
T enforce(E : Throwable = Exception, T)(T value, lazy const(char)[] msg = null,
string file = __FILE__, size_t line = __LINE__) if (is(typeof({ if (!value) {} })))
{
if (!value) bailOut!E(file, line, msg);
return value;
}
/++
Enforces that the given value is true.
Params:
value = The value to test.
dg = The delegate to be called if the value evaluates to false.
file = The source file of the caller.
line = The line number of the caller.
Returns: $(D value), if `cast(bool)value` is true. Otherwise, the given
delegate is called.
The safety and purity of this function are inferred from $(D Dg)'s safety
and purity.
+/
T enforce(T, Dg, string file = __FILE__, size_t line = __LINE__)
(T value, scope Dg dg)
if (isSomeFunction!Dg && is(typeof( dg() )) &&
is(typeof({ if (!value) {} })))
{
if (!value) dg();
return value;
}
private void bailOut(E : Throwable = Exception)(string file, size_t line, in char[] msg)
{
static if (is(typeof(new E(string.init, string.init, size_t.init))))
{
throw new E(msg ? msg.idup : "Enforcement failed", file, line);
}
else static if (is(typeof(new E(string.init, size_t.init))))
{
throw new E(file, line);
}
else
{
static assert(0, "Expected this(string, string, size_t) or this(string, size_t)" ~
" constructor for " ~ __traits(identifier, E));
}
}
@safe unittest
{
assert (enforce(123) == 123);
try
{
enforce(false, "error");
assert (false);
}
catch (Exception e)
{
assert (e.msg == "error");
assert (e.file == __FILE__);
assert (e.line == __LINE__-7);
}
}
@safe unittest
{
// Issue 10510
extern(C) void cFoo() { }
enforce(false, &cFoo);
}
// purity and safety inference test
@system unittest
{
import std.meta : AliasSeq;
foreach (EncloseSafe; AliasSeq!(false, true))
foreach (EnclosePure; AliasSeq!(false, true))
{
foreach (BodySafe; AliasSeq!(false, true))
foreach (BodyPure; AliasSeq!(false, true))
{
enum code =
"delegate void() " ~
(EncloseSafe ? "@safe " : "") ~
(EnclosePure ? "pure " : "") ~
"{ enforce(true, { " ~
"int n; " ~
(BodySafe ? "" : "auto p = &n + 10; " ) ~ // unsafe code
(BodyPure ? "" : "static int g; g = 10; ") ~ // impure code
"}); " ~
"}";
enum expect =
(BodySafe || !EncloseSafe) && (!EnclosePure || BodyPure);
version(none)
pragma(msg, "safe = ", EncloseSafe?1:0, "/", BodySafe?1:0, ", ",
"pure = ", EnclosePure?1:0, "/", BodyPure?1:0, ", ",
"expect = ", expect?"OK":"NG", ", ",
"code = ", code);
static assert(__traits(compiles, mixin(code)()) == expect);
}
}
}
// Test for bugzilla 8637
@system unittest
{
struct S
{
static int g;
~this() {} // impure & unsafe destructor
bool opCast(T:bool)() {
int* p = cast(int*)0; // unsafe operation
int n = g; // impure operation
return true;
}
}
S s;
enforce(s);
enforce(s, {});
enforce(s, new Exception(""));
errnoEnforce(s);
alias E1 = Exception;
static class E2 : Exception
{
this(string fn, size_t ln) { super("", fn, ln); }
}
static class E3 : Exception
{
this(string msg) { super(msg, __FILE__, __LINE__); }
}
enforce!E1(s);
enforce!E2(s);
}
@safe unittest
{
// Issue 14685
class E : Exception
{
this() { super("Not found"); }
}
static assert(!__traits(compiles, { enforce!E(false); }));
}
/++
Enforces that the given value is true.
Params:
value = The value to test.
ex = The exception to throw if the value evaluates to false.
Returns: $(D value), if `cast(bool)value` is true. Otherwise, $(D ex) is
thrown.
Example:
--------------------
auto f = enforce(fopen("data.txt"));
auto line = readln(f);
enforce(line.length, new IOException); // expect a non-empty line
--------------------
+/
T enforce(T)(T value, lazy Throwable ex)
{
if (!value) throw ex();
return value;
}
@safe unittest
{
assertNotThrown(enforce(true, new Exception("this should not be thrown")));
assertThrown(enforce(false, new Exception("this should be thrown")));
}
/++
Enforces that the given value is true, throwing an `ErrnoException` if it
is not.
Params:
value = The value to test.
msg = The message to include in the `ErrnoException` if it is thrown.
Returns: $(D value), if `cast(bool)value` is true. Otherwise,
$(D new ErrnoException(msg)) is thrown. It is assumed that the last
operation set $(D errno) to an error code corresponding with the failed
condition.
Example:
--------------------
auto f = errnoEnforce(fopen("data.txt"));
auto line = readln(f);
enforce(line.length); // expect a non-empty line
--------------------
+/
T errnoEnforce(T, string file = __FILE__, size_t line = __LINE__)
(T value, lazy string msg = null)
{
if (!value) throw new ErrnoException(msg, file, line);
return value;
}
/++
If $(D !value) is $(D false), $(D value) is returned. Otherwise,
$(D new E(msg, file, line)) is thrown. Or if $(D E) doesn't take a message
and can be constructed with $(D new E(file, line)), then
$(D new E(file, line)) will be thrown.
This is legacy name, it is recommended to use $(D enforce!E) instead.
Example:
--------------------
auto f = enforceEx!FileMissingException(fopen("data.txt"));
auto line = readln(f);
enforceEx!DataCorruptionException(line.length);
--------------------
+/
template enforceEx(E : Throwable)
if (is(typeof(new E("", __FILE__, __LINE__))))
{
/++ Ditto +/
T enforceEx(T)(T value, lazy string msg = "", string file = __FILE__, size_t line = __LINE__)
{
if (!value) throw new E(msg, file, line);
return value;
}
}
/++ Ditto +/
template enforceEx(E : Throwable)
if (is(typeof(new E(__FILE__, __LINE__))) && !is(typeof(new E("", __FILE__, __LINE__))))
{
/++ Ditto +/
T enforceEx(T)(T value, string file = __FILE__, size_t line = __LINE__)
{
if (!value) throw new E(file, line);
return value;
}
}
@system unittest
{
import std.array : empty;
import core.exception : OutOfMemoryError;
assertNotThrown(enforceEx!Exception(true));
assertNotThrown(enforceEx!Exception(true, "blah"));
assertNotThrown(enforceEx!OutOfMemoryError(true));
{
auto e = collectException(enforceEx!Exception(false));
assert(e !is null);
assert(e.msg.empty);
assert(e.file == __FILE__);
assert(e.line == __LINE__ - 4);
}
{
auto e = collectException(enforceEx!Exception(false, "hello", "file", 42));
assert(e !is null);
assert(e.msg == "hello");
assert(e.file == "file");
assert(e.line == 42);
}
{
auto e = collectException!Error(enforceEx!OutOfMemoryError(false));
assert(e !is null);
assert(e.msg == "Memory allocation failed");
assert(e.file == __FILE__);
assert(e.line == __LINE__ - 4);
}
{
auto e = collectException!Error(enforceEx!OutOfMemoryError(false, "file", 42));
assert(e !is null);
assert(e.msg == "Memory allocation failed");
assert(e.file == "file");
assert(e.line == 42);
}
static assert(!is(typeof(enforceEx!int(true))));
}
@safe unittest
{
alias enf = enforceEx!Exception;
assertNotThrown(enf(true));
assertThrown(enf(false, "blah"));
}
/++
Catches and returns the exception thrown from the given expression.
If no exception is thrown, then null is returned and $(D result) is
set to the result of the expression.
Note that while $(D collectException) $(I can) be used to collect any
$(D Throwable) and not just $(D Exception)s, it is generally ill-advised to
catch anything that is neither an $(D Exception) nor a type derived from
$(D Exception). So, do not use $(D collectException) to collect
non-$(D Exception)s unless you're sure that that's what you really want to
do.
Params:
T = The type of exception to catch.
expression = The expression which may throw an exception.
result = The result of the expression if no exception is thrown.
+/
T collectException(T = Exception, E)(lazy E expression, ref E result)
{
try
{
result = expression();
}
catch (T e)
{
return e;
}
return null;
}
///
@system unittest
{
int b;
int foo() { throw new Exception("blah"); }
assert(collectException(foo(), b));
int[] a = new int[3];
import core.exception : RangeError;
assert(collectException!RangeError(a[4], b));
}
/++
Catches and returns the exception thrown from the given expression.
If no exception is thrown, then null is returned. $(D E) can be
$(D void).
Note that while $(D collectException) $(I can) be used to collect any
$(D Throwable) and not just $(D Exception)s, it is generally ill-advised to
catch anything that is neither an $(D Exception) nor a type derived from
$(D Exception). So, do not use $(D collectException) to collect
non-$(D Exception)s unless you're sure that that's what you really want to
do.
Params:
T = The type of exception to catch.
expression = The expression which may throw an exception.
+/
T collectException(T : Throwable = Exception, E)(lazy E expression)
{
try
{
expression();
}
catch (T t)
{
return t;
}
return null;
}
@safe unittest
{
int foo() { throw new Exception("blah"); }
assert(collectException(foo()));
}
/++
Catches the exception thrown from the given expression and returns the
msg property of that exception. If no exception is thrown, then null is
returned. $(D E) can be $(D void).
If an exception is thrown but it has an empty message, then
$(D emptyExceptionMsg) is returned.
Note that while $(D collectExceptionMsg) $(I can) be used to collect any
$(D Throwable) and not just $(D Exception)s, it is generally ill-advised to
catch anything that is neither an $(D Exception) nor a type derived from
$(D Exception). So, do not use $(D collectExceptionMsg) to collect
non-$(D Exception)s unless you're sure that that's what you really want to
do.
Params:
T = The type of exception to catch.
expression = The expression which may throw an exception.
+/
string collectExceptionMsg(T = Exception, E)(lazy E expression)
{
import std.array : empty;
try
{
expression();
return cast(string)null;
}
catch (T e)
return e.msg.empty ? emptyExceptionMsg : e.msg;
}
///
@safe unittest
{
void throwFunc() { throw new Exception("My Message."); }
assert(collectExceptionMsg(throwFunc()) == "My Message.");
void nothrowFunc() {}
assert(collectExceptionMsg(nothrowFunc()) is null);
void throwEmptyFunc() { throw new Exception(""); }
assert(collectExceptionMsg(throwEmptyFunc()) == emptyExceptionMsg);
}
/++
Value that collectExceptionMsg returns when it catches an exception
with an empty exception message.
+/
enum emptyExceptionMsg = "<Empty Exception Message>";
/**
* Casts a mutable array to an immutable array in an idiomatic
* manner. Technically, $(D assumeUnique) just inserts a cast,
* but its name documents assumptions on the part of the
* caller. $(D assumeUnique(arr)) should only be called when
* there are no more active mutable aliases to elements of $(D
* arr). To strengthen this assumption, $(D assumeUnique(arr))
* also clears $(D arr) before returning. Essentially $(D
* assumeUnique(arr)) indicates commitment from the caller that there
* is no more mutable access to any of $(D arr)'s elements
* (transitively), and that all future accesses will be done through
* the immutable array returned by $(D assumeUnique).
*
* Typically, $(D assumeUnique) is used to return arrays from
* functions that have allocated and built them.
*
* Params:
* array = The array to cast to immutable.
*
* Returns: The immutable array.
*
* Example:
*
* ----
* string letters()
* {
* char[] result = new char['z' - 'a' + 1];
* foreach (i, ref e; result)
* {
* e = cast(char)('a' + i);
* }
* return assumeUnique(result);
* }
* ----
*
* The use in the example above is correct because $(D result)
* was private to $(D letters) and is inaccessible in writing
* after the function returns. The following example shows an
* incorrect use of $(D assumeUnique).
*
* Bad:
*
* ----
* private char[] buffer;
* string letters(char first, char last)
* {
* if (first >= last) return null; // fine
* auto sneaky = buffer;
* sneaky.length = last - first + 1;
* foreach (i, ref e; sneaky)
* {
* e = cast(char)('a' + i);
* }
* return assumeUnique(sneaky); // BAD
* }
* ----
*
* The example above wreaks havoc on client code because it is
* modifying arrays that callers considered immutable. To obtain an
* immutable array from the writable array $(D buffer), replace
* the last line with:
* ----
* return to!(string)(sneaky); // not that sneaky anymore
* ----
*
* The call will duplicate the array appropriately.
*
* Note that checking for uniqueness during compilation is
* possible in certain cases, especially when a function is
* marked as a pure function. The following example does not
* need to call assumeUnique because the compiler can infer the
* uniqueness of the array in the pure function:
* ----
* string letters() pure
* {
* char[] result = new char['z' - 'a' + 1];
* foreach (i, ref e; result)
* {
* e = cast(char)('a' + i);
* }
* return result;
* }
* ----
*
* For more on infering uniqueness see the $(B unique) and
* $(B lent) keywords in the
* $(HTTP archjava.fluid.cs.cmu.edu/papers/oopsla02.pdf, ArchJava)
* language.
*
* The downside of using $(D assumeUnique)'s
* convention-based usage is that at this time there is no
* formal checking of the correctness of the assumption;
* on the upside, the idiomatic use of $(D assumeUnique) is
* simple and rare enough to be tolerable.
*
*/
immutable(T)[] assumeUnique(T)(T[] array) pure nothrow
{
return .assumeUnique(array); // call ref version
}
/// ditto
immutable(T)[] assumeUnique(T)(ref T[] array) pure nothrow
{
auto result = cast(immutable(T)[]) array;
array = null;
return result;
}
@system unittest
{
// @system due to assumeUnique
int[] arr = new int[1];
auto arr1 = assumeUnique(arr);
assert(is(typeof(arr1) == immutable(int)[]) && arr == null);
}
immutable(T[U]) assumeUnique(T, U)(ref T[U] array) pure nothrow
{
auto result = cast(immutable(T[U])) array;
array = null;
return result;
}
// @@@BUG@@@
version(none) @system unittest
{
int[string] arr = ["a":1];
auto arr1 = assumeUnique(arr);
assert(is(typeof(arr1) == immutable(int[string])) && arr == null);
}
/**
* Wraps a possibly-throwing expression in a $(D nothrow) wrapper so that it
* can be called by a $(D nothrow) function.
*
* This wrapper function documents commitment on the part of the caller that
* the appropriate steps have been taken to avoid whatever conditions may
* trigger an exception during the evaluation of $(D expr). If it turns out
* that the expression $(I does) throw at runtime, the wrapper will throw an
* $(D AssertError).
*
* (Note that $(D Throwable) objects such as $(D AssertError) that do not
* subclass $(D Exception) may be thrown even from $(D nothrow) functions,
* since they are considered to be serious runtime problems that cannot be
* recovered from.)
*
* Params:
* expr = The expression asserted not to throw.
* msg = The message to include in the `AssertError` if the assumption turns
* out to be false.
* file = The source file name of the caller.
* line = The line number of the caller.
*
* Returns:
* The value of `expr`, if any.
*/
T assumeWontThrow(T)(lazy T expr,
string msg = null,
string file = __FILE__,
size_t line = __LINE__) nothrow
{
import core.exception : AssertError;
try
{
return expr;
}
catch (Exception e)
{
import std.range.primitives : empty;
immutable tail = msg.empty ? "." : ": " ~ msg;
throw new AssertError("assumeWontThrow failed: Expression did throw" ~
tail, file, line);
}
}
///
@safe unittest
{
import std.math : sqrt;
// This function may throw.
int squareRoot(int x)
{
if (x < 0)
throw new Exception("Tried to take root of negative number");
return cast(int)sqrt(cast(double)x);
}
// This function never throws.
int computeLength(int x, int y) nothrow
{
// Since x*x + y*y is always positive, we can safely assume squareRoot
// won't throw, and use it to implement this nothrow function. If it
// does throw (e.g., if x*x + y*y overflows a 32-bit value), then the
// program will terminate.
return assumeWontThrow(squareRoot(x*x + y*y));
}
assert(computeLength(3, 4) == 5);
}
@system unittest
{
import core.exception : AssertError;
void alwaysThrows()
{
throw new Exception("I threw up");
}
void bad() nothrow
{
assumeWontThrow(alwaysThrows());
}
assertThrown!AssertError(bad());
}
/**
Checks whether a given source object contains pointers or references to a given
target object.
Params:
source = The source object
target = The target object
Returns: $(D true) if $(D source)'s representation embeds a pointer
that points to $(D target)'s representation or somewhere inside
it.
If $(D source) is or contains a dynamic array, then, then these functions will check
if there is overlap between the dynamic array and $(D target)'s representation.
If $(D source) is a class, then it will be handled as a pointer.
If $(D target) is a pointer, a dynamic array or a class, then these functions will only
check if $(D source) points to $(D target), $(I not) what $(D target) references.
If $(D source) is or contains a union, then there may be either false positives or
false negatives:
$(D doesPointTo) will return $(D true) if it is absolutely certain
$(D source) points to $(D target). It may produce false negatives, but never
false positives. This function should be prefered when trying to validate
input data.
$(D mayPointTo) will return $(D false) if it is absolutely certain
$(D source) does not point to $(D target). It may produce false positives, but never
false negatives. This function should be prefered for defensively choosing a
code path.
Note: Evaluating $(D doesPointTo(x, x)) checks whether $(D x) has
internal pointers. This should only be done as an assertive test,
as the language is free to assume objects don't have internal pointers
(TDPL 7.1.3.5).
*/
bool doesPointTo(S, T, Tdummy=void)(auto ref const S source, ref const T target) @trusted pure nothrow
if (__traits(isRef, source) || isDynamicArray!S ||
isPointer!S || is(S == class))
{
static if (isPointer!S || is(S == class) || is(S == interface))
{
const m = *cast(void**) &source;
const b = cast(void*) ⌖
const e = b + target.sizeof;
return b <= m && m < e;
}
else static if (is(S == struct) || is(S == union))
{
foreach (i, Subobj; typeof(source.tupleof))
static if (!isUnionAliased!(S, i))
if (doesPointTo(source.tupleof[i], target)) return true;
return false;
}
else static if (isStaticArray!S)
{
foreach (size_t i; 0 .. S.length)
if (doesPointTo(source[i], target)) return true;
return false;
}
else static if (isDynamicArray!S)
{
import std.array : overlap;
return overlap(cast(void[])source, cast(void[])(&target)[0 .. 1]).length != 0;
}
else
{
return false;
}
}
// for shared objects
/// ditto
bool doesPointTo(S, T)(auto ref const shared S source, ref const shared T target) @trusted pure nothrow
{
return doesPointTo!(shared S, shared T, void)(source, target);
}
/// ditto
bool mayPointTo(S, T, Tdummy=void)(auto ref const S source, ref const T target) @trusted pure nothrow
if (__traits(isRef, source) || isDynamicArray!S ||
isPointer!S || is(S == class))
{
static if (isPointer!S || is(S == class) || is(S == interface))
{
const m = *cast(void**) &source;
const b = cast(void*) ⌖
const e = b + target.sizeof;
return b <= m && m < e;
}
else static if (is(S == struct) || is(S == union))
{
foreach (i, Subobj; typeof(source.tupleof))
if (mayPointTo(source.tupleof[i], target)) return true;
return false;
}
else static if (isStaticArray!S)
{
foreach (size_t i; 0 .. S.length)
if (mayPointTo(source[i], target)) return true;
return false;
}
else static if (isDynamicArray!S)
{
import std.array : overlap;
return overlap(cast(void[])source, cast(void[])(&target)[0 .. 1]).length != 0;
}
else
{
return false;
}
}
// for shared objects
/// ditto
bool mayPointTo(S, T)(auto ref const shared S source, ref const shared T target) @trusted pure nothrow
{
return mayPointTo!(shared S, shared T, void)(source, target);
}
/// Pointers
@system unittest
{
int i = 0;
int* p = null;
assert(!p.doesPointTo(i));
p = &i;
assert( p.doesPointTo(i));
}
/// Structs and Unions
@system unittest
{
struct S
{
int v;
int* p;
}
int i;
auto s = S(0, &i);
// structs and unions "own" their members
// pointsTo will answer true if one of the members pointsTo.
assert(!s.doesPointTo(s.v)); //s.v is just v member of s, so not pointed.
assert( s.p.doesPointTo(i)); //i is pointed by s.p.
assert( s .doesPointTo(i)); //which means i is pointed by s itself.
// Unions will behave exactly the same. Points to will check each "member"
// individually, even if they share the same memory
}
/// Arrays (dynamic and static)
@system unittest
{
int i;
int[] slice = [0, 1, 2, 3, 4];
int[5] arr = [0, 1, 2, 3, 4];
int*[] slicep = [&i];
int*[1] arrp = [&i];
// A slice points to all of its members:
assert( slice.doesPointTo(slice[3]));
assert(!slice[0 .. 2].doesPointTo(slice[3])); // Object 3 is outside of the
// slice [0 .. 2]
// Note that a slice will not take into account what its members point to.
assert( slicep[0].doesPointTo(i));
assert(!slicep .doesPointTo(i));
// static arrays are objects that own their members, just like structs:
assert(!arr.doesPointTo(arr[0])); // arr[0] is just a member of arr, so not
// pointed.
assert( arrp[0].doesPointTo(i)); // i is pointed by arrp[0].
assert( arrp .doesPointTo(i)); // which means i is pointed by arrp
// itself.
// Notice the difference between static and dynamic arrays:
assert(!arr .doesPointTo(arr[0]));
assert( arr[].doesPointTo(arr[0]));
assert( arrp .doesPointTo(i));
assert(!arrp[].doesPointTo(i));
}
/// Classes
@system unittest
{
class C
{
this(int* p){this.p = p;}
int* p;
}
int i;
C a = new C(&i);
C b = a;
// Classes are a bit particular, as they are treated like simple pointers
// to a class payload.
assert( a.p.doesPointTo(i)); // a.p points to i.
assert(!a .doesPointTo(i)); // Yet a itself does not point i.
//To check the class payload itself, iterate on its members:
()
{
foreach (index, _; Fields!C)
if (doesPointTo(a.tupleof[index], i))
return;
assert(0);
}();
// To check if a class points a specific payload, a direct memmory check
// can be done:
auto aLoc = cast(ubyte[__traits(classInstanceSize, C)]*) a;
assert(b.doesPointTo(*aLoc)); // b points to where a is pointing
}
@system unittest
{
struct S1 { int a; S1 * b; }
S1 a1;
S1 * p = &a1;
assert(doesPointTo(p, a1));
S1 a2;
a2.b = &a1;
assert(doesPointTo(a2, a1));
struct S3 { int[10] a; }
S3 a3;
auto a4 = a3.a[2 .. 3];
assert(doesPointTo(a4, a3));
auto a5 = new double[4];
auto a6 = a5[1 .. 2];
assert(!doesPointTo(a5, a6));
auto a7 = new double[3];
auto a8 = new double[][1];
a8[0] = a7;
assert(!doesPointTo(a8[0], a8[0]));
// don't invoke postblit on subobjects
{
static struct NoCopy { this(this) { assert(0); } }
static struct Holder { NoCopy a, b, c; }
Holder h;
cast(void)doesPointTo(h, h);
}
shared S3 sh3;
shared sh3sub = sh3.a[];
assert(doesPointTo(sh3sub, sh3));
int[] darr = [1, 2, 3, 4];
//dynamic arrays don't point to each other, or slices of themselves
assert(!doesPointTo(darr, darr));
assert(!doesPointTo(darr[0 .. 1], darr));
//But they do point their elements
foreach (i; 0 .. 4)
assert(doesPointTo(darr, darr[i]));
assert(doesPointTo(darr[0..3], darr[2]));
assert(!doesPointTo(darr[0..3], darr[3]));
}
@system unittest
{
//tests with static arrays
//Static arrays themselves are just objects, and don't really *point* to anything.
//They aggregate their contents, much the same way a structure aggregates its attributes.
//*However* The elements inside the static array may themselves point to stuff.
//Standard array
int[2] k;
assert(!doesPointTo(k, k)); //an array doesn't point to itself
//Technically, k doesn't point its elements, although it does alias them
assert(!doesPointTo(k, k[0]));
assert(!doesPointTo(k, k[1]));
//But an extracted slice will point to the same array.
assert(doesPointTo(k[], k));
assert(doesPointTo(k[], k[1]));
//An array of pointers
int*[2] pp;
int a;
int b;
pp[0] = &a;
assert( doesPointTo(pp, a)); //The array contains a pointer to a
assert(!doesPointTo(pp, b)); //The array does NOT contain a pointer to b
assert(!doesPointTo(pp, pp)); //The array does not point itslef
//A struct containing a static array of pointers
static struct S
{
int*[2] p;
}
S s;
s.p[0] = &a;
assert( doesPointTo(s, a)); //The struct contains an array that points a
assert(!doesPointTo(s, b)); //But doesn't point b
assert(!doesPointTo(s, s)); //The struct doesn't actually point itslef.
//An array containing structs that have pointers
static struct SS
{
int* p;
}
SS[2] ss = [SS(&a), SS(null)];
assert( doesPointTo(ss, a)); //The array contains a struct that points to a
assert(!doesPointTo(ss, b)); //The array doesn't contains a struct that points to b
assert(!doesPointTo(ss, ss)); //The array doesn't point itself.
}
@system unittest //Unions
{
int i;
union U //Named union
{
size_t asInt = 0;
int* asPointer;
}
struct S
{
union //Anonymous union
{
size_t asInt = 0;
int* asPointer;
}
}
U u;
S s;
assert(!doesPointTo(u, i));
assert(!doesPointTo(s, i));
assert(!mayPointTo(u, i));
assert(!mayPointTo(s, i));
u.asPointer = &i;
s.asPointer = &i;
assert(!doesPointTo(u, i));
assert(!doesPointTo(s, i));
assert( mayPointTo(u, i));
assert( mayPointTo(s, i));
u.asInt = cast(size_t)&i;
s.asInt = cast(size_t)&i;
assert(!doesPointTo(u, i));
assert(!doesPointTo(s, i));
assert( mayPointTo(u, i));
assert( mayPointTo(s, i));
}
@system unittest //Classes
{
int i;
static class A
{
int* p;
}
A a = new A, b = a;
assert(!doesPointTo(a, b)); //a does not point to b
a.p = &i;
assert(!doesPointTo(a, i)); //a does not point to i
}
@safe unittest //alias this test
{
static int i;
static int j;
struct S
{
int* p;
@property int* foo(){return &i;}
alias foo this;
}
assert(is(S : int*));
S s = S(&j);
assert(!doesPointTo(s, i));
assert( doesPointTo(s, j));
assert( doesPointTo(cast(int*)s, i));
assert(!doesPointTo(cast(int*)s, j));
}
@safe unittest //more alias this opCast
{
void* p;
class A
{
void* opCast(T)() if (is(T == void*))
{
return p;
}
alias foo = opCast!(void*);
alias foo this;
}
assert(!doesPointTo(A.init, p));
assert(!mayPointTo(A.init, p));
}
/+
Returns true if the field at index $(D i) in ($D T) shares its address with another field.
Note: This does not merelly check if the field is a member of an union, but also that
it is not a single child.
+/
package enum isUnionAliased(T, size_t i) = isUnionAliasedImpl!T(T.tupleof[i].offsetof);
private bool isUnionAliasedImpl(T)(size_t offset)
{
int count = 0;
foreach (i, U; typeof(T.tupleof))
if (T.tupleof[i].offsetof == offset)
++count;
return count >= 2;
}
//
@safe unittest
{
static struct S
{
int a0; //Not aliased
union
{
int a1; //Not aliased
}
union
{
int a2; //Aliased
int a3; //Aliased
}
union A4
{
int b0; //Not aliased
}
A4 a4;
union A5
{
int b0; //Aliased
int b1; //Aliased
}
A5 a5;
}
static assert(!isUnionAliased!(S, 0)); //a0;
static assert(!isUnionAliased!(S, 1)); //a1;
static assert( isUnionAliased!(S, 2)); //a2;
static assert( isUnionAliased!(S, 3)); //a3;
static assert(!isUnionAliased!(S, 4)); //a4;
static assert(!isUnionAliased!(S.A4, 0)); //a4.b0;
static assert(!isUnionAliased!(S, 5)); //a5;
static assert( isUnionAliased!(S.A5, 0)); //a5.b0;
static assert( isUnionAliased!(S.A5, 1)); //a5.b1;
}
/*********************
* Thrown if errors that set $(D errno) occur.
*/
class ErrnoException : Exception
{
final @property uint errno() { return _errno; } /// Operating system error code.
private uint _errno;
this(string msg, string file = null, size_t line = 0) @trusted
{
import core.stdc.errno : errno;
import core.stdc.string : strlen;
_errno = errno;
version (CRuntime_Glibc)
{
import core.stdc.string : strerror_r;
char[1024] buf = void;
auto s = strerror_r(errno, buf.ptr, buf.length);
}
else
{
import core.stdc.string : strerror;
auto s = strerror(errno);
}
super(msg ~ " (" ~ s[0..s.strlen].idup ~ ")", file, line);
}
}
/++
ML-style functional exception handling. Runs the supplied expression and
returns its result. If the expression throws a $(D Throwable), runs the
supplied error handler instead and return its result. The error handler's
type must be the same as the expression's type.
Params:
E = The type of $(D Throwable)s to catch. Defaults to $(D Exception)
T1 = The type of the expression.
T2 = The return type of the error handler.
expression = The expression to run and return its result.
errorHandler = The handler to run if the expression throwed.
Returns:
expression, if it does not throw. Otherwise, returns the result of
errorHandler.
Example:
--------------------
//Revert to a default value upon an error:
assert("x".to!int().ifThrown(0) == 0);
--------------------
You can also chain multiple calls to ifThrown, each capturing errors from the
entire preceding expression.
Example:
--------------------
//Chaining multiple calls to ifThrown to attempt multiple things in a row:
string s="true";
assert(s.to!int().
ifThrown(cast(int)s.to!double()).
ifThrown(cast(int)s.to!bool())
== 1);
//Respond differently to different types of errors
assert(enforce("x".to!int() < 1).to!string()
.ifThrown!ConvException("not a number")
.ifThrown!Exception("number too small")
== "not a number");
--------------------
The expression and the errorHandler must have a common type they can both
be implicitly casted to, and that type will be the type of the compound
expression.
Example:
--------------------
//null and new Object have a common type(Object).
static assert(is(typeof(null.ifThrown(new Object())) == Object));
static assert(is(typeof((new Object()).ifThrown(null)) == Object));
//1 and new Object do not have a common type.
static assert(!__traits(compiles, 1.ifThrown(new Object())));
static assert(!__traits(compiles, (new Object()).ifThrown(1)));
--------------------
If you need to use the actual thrown exception, you can use a delegate.
Example:
--------------------
//Use a lambda to get the thrown object.
assert("%s".format().ifThrown!Exception(e => e.classinfo.name) == "std.format.FormatException");
--------------------
+/
//lazy version
CommonType!(T1, T2) ifThrown(E : Throwable = Exception, T1, T2)(lazy scope T1 expression, lazy scope T2 errorHandler)
{
static assert(!is(typeof(return) == void),
"The error handler's return value("
~ T2.stringof ~
") does not have a common type with the expression("
~ T1.stringof ~
")."
);
try
{
return expression();
}
catch (E)
{
return errorHandler();
}
}
///ditto
//delegate version
CommonType!(T1, T2) ifThrown(E : Throwable, T1, T2)(lazy scope T1 expression, scope T2 delegate(E) errorHandler)
{
static assert(!is(typeof(return) == void),
"The error handler's return value("
~ T2.stringof ~
") does not have a common type with the expression("
~ T1.stringof ~
")."
);
try
{
return expression();
}
catch (E e)
{
return errorHandler(e);
}
}
///ditto
//delegate version, general overload to catch any Exception
CommonType!(T1, T2) ifThrown(T1, T2)(lazy scope T1 expression, scope T2 delegate(Exception) errorHandler)
{
static assert(!is(typeof(return) == void),
"The error handler's return value("
~ T2.stringof ~
") does not have a common type with the expression("
~ T1.stringof ~
")."
);
try
{
return expression();
}
catch (Exception e)
{
return errorHandler(e);
}
}
//Verify Examples
@system unittest
{
import std.string;
import std.conv;
//Revert to a default value upon an error:
assert("x".to!int().ifThrown(0) == 0);
//Chaining multiple calls to ifThrown to attempt multiple things in a row:
string s="true";
assert(s.to!int().
ifThrown(cast(int)s.to!double()).
ifThrown(cast(int)s.to!bool())
== 1);
//Respond differently to different types of errors
assert(enforce("x".to!int() < 1).to!string()
.ifThrown!ConvException("not a number")
.ifThrown!Exception("number too small")
== "not a number");
//null and new Object have a common type(Object).
static assert(is(typeof(null.ifThrown(new Object())) == Object));
static assert(is(typeof((new Object()).ifThrown(null)) == Object));
//1 and new Object do not have a common type.
static assert(!__traits(compiles, 1.ifThrown(new Object())));
static assert(!__traits(compiles, (new Object()).ifThrown(1)));
//Use a lambda to get the thrown object.
assert("%s".format().ifThrown(e => e.classinfo.name) == "std.format.FormatException");
}
@system unittest
{
import std.string;
import std.conv;
import core.exception;
//Basic behaviour - all versions.
assert("1".to!int().ifThrown(0) == 1);
assert("x".to!int().ifThrown(0) == 0);
assert("1".to!int().ifThrown!ConvException(0) == 1);
assert("x".to!int().ifThrown!ConvException(0) == 0);
assert("1".to!int().ifThrown(e=>0) == 1);
assert("x".to!int().ifThrown(e=>0) == 0);
static if (__traits(compiles, 0.ifThrown!Exception(e => 0))) //This will only work with a fix that was not yet pulled
{
assert("1".to!int().ifThrown!ConvException(e=>0) == 1);
assert("x".to!int().ifThrown!ConvException(e=>0) == 0);
}
//Exceptions other than stated not caught.
assert("x".to!int().ifThrown!StringException(0).collectException!ConvException() !is null);
static if (__traits(compiles, 0.ifThrown!Exception(e => 0))) //This will only work with a fix that was not yet pulled
{
assert("x".to!int().ifThrown!StringException(e=>0).collectException!ConvException() !is null);
}
//Default does not include errors.
int throwRangeError() { throw new RangeError; }
assert(throwRangeError().ifThrown(0).collectException!RangeError() !is null);
assert(throwRangeError().ifThrown(e=>0).collectException!RangeError() !is null);
//Incompatible types are not accepted.
static assert(!__traits(compiles, 1.ifThrown(new Object())));
static assert(!__traits(compiles, (new Object()).ifThrown(1)));
static assert(!__traits(compiles, 1.ifThrown(e=>new Object())));
static assert(!__traits(compiles, (new Object()).ifThrown(e=>1)));
}
version(unittest) package
@property void assertCTFEable(alias dg)()
{
static assert({ cast(void)dg(); return true; }());
cast(void)dg();
}
/** This $(D enum) is used to select the primitives of the range to handle by the
$(LREF handle) range wrapper. The values of the $(D enum) can be $(D OR)'d to
select multiple primitives to be handled.
$(D RangePrimitive.access) is a shortcut for the access primitives; $(D front),
$(D back) and $(D opIndex).
$(D RangePrimitive.pop) is a shortcut for the mutating primitives;
$(D popFront) and $(D popBack).
*/
enum RangePrimitive
{
front = 0b00_0000_0001, ///
back = 0b00_0000_0010, /// Ditto
popFront = 0b00_0000_0100, /// Ditto
popBack = 0b00_0000_1000, /// Ditto
empty = 0b00_0001_0000, /// Ditto
save = 0b00_0010_0000, /// Ditto
length = 0b00_0100_0000, /// Ditto
opDollar = 0b00_1000_0000, /// Ditto
opIndex = 0b01_0000_0000, /// Ditto
opSlice = 0b10_0000_0000, /// Ditto
access = front | back | opIndex, /// Ditto
pop = popFront | popBack, /// Ditto
}
/** Handle exceptions thrown from range primitives.
Use the $(LREF RangePrimitive) enum to specify which primitives to _handle.
Multiple range primitives can be handled at once by using the $(D OR) operator
or the pseudo-primitives $(D RangePrimitive.access) and $(D RangePrimitive.pop).
All handled primitives must have return types or values compatible with the
user-supplied handler.
Params:
E = The type of $(D Throwable) to _handle.
primitivesToHandle = Set of range primitives to _handle.
handler = The callable that is called when a handled primitive throws a
$(D Throwable) of type $(D E). The handler must accept arguments of
the form $(D E, ref IRange) and its return value is used as the primitive's
return value whenever $(D E) is thrown. For $(D opIndex), the handler can
optionally recieve a third argument; the index that caused the exception.
input = The range to _handle.
Returns: A wrapper $(D struct) that preserves the range interface of $(D input).
opSlice:
Infinite ranges with slicing support must return an instance of
$(REF Take, std,range) when sliced with a specific lower and upper
bound (see $(REF hasSlicing, std,range,primitives)); $(D handle) deals with
this by $(D take)ing 0 from the return value of the handler function and
returning that when an exception is caught.
*/
auto handle(E : Throwable, RangePrimitive primitivesToHandle, alias handler, Range)(Range input)
if (isInputRange!Range)
{
static struct Handler
{
private Range range;
static if (isForwardRange!Range)
{
@property typeof(this) save()
{
static if (primitivesToHandle & RangePrimitive.save)
{
try
{
return typeof(this)(range.save);
}
catch (E exception)
{
return typeof(this)(handler(exception, this.range));
}
}
else
return typeof(this)(range.save);
}
}
static if (isInfinite!Range)
{
enum bool empty = false;
}
else
{
@property bool empty()
{
static if (primitivesToHandle & RangePrimitive.empty)
{
try
{
return this.range.empty;
}
catch (E exception)
{
return handler(exception, this.range);
}
}
else
return this.range.empty;
}
}
@property auto ref front()
{
static if (primitivesToHandle & RangePrimitive.front)
{
try
{
return this.range.front;
}
catch (E exception)
{
return handler(exception, this.range);
}
}
else
return this.range.front;
}
void popFront()
{
static if (primitivesToHandle & RangePrimitive.popFront)
{
try
{
this.range.popFront();
}
catch (E exception)
{
handler(exception, this.range);
}
}
else
this.range.popFront();
}
static if (isBidirectionalRange!Range)
{
@property auto ref back()
{
static if (primitivesToHandle & RangePrimitive.back)
{
try
{
return this.range.back;
}
catch (E exception)
{
return handler(exception, this.range);
}
}
else
return this.range.back;
}
void popBack()
{
static if (primitivesToHandle & RangePrimitive.popBack)
{
try
{
this.range.popBack();
}
catch (E exception)
{
handler(exception, this.range);
}
}
else
this.range.popBack();
}
}
static if (isRandomAccessRange!Range)
{
auto ref opIndex(size_t index)
{
static if (primitivesToHandle & RangePrimitive.opIndex)
{
try
{
return this.range[index];
}
catch (E exception)
{
static if (__traits(compiles, handler(exception, this.range, index)))
return handler(exception, this.range, index);
else
return handler(exception, this.range);
}
}
else
return this.range[index];
}
}
static if (hasLength!Range)
{
@property auto length()
{
static if (primitivesToHandle & RangePrimitive.length)
{
try
{
return this.range.length;
}
catch (E exception)
{
return handler(exception, this.range);
}
}
else
return this.range.length;
}
}
static if (hasSlicing!Range)
{
static if (hasLength!Range)
{
typeof(this) opSlice(size_t lower, size_t upper)
{
static if (primitivesToHandle & RangePrimitive.opSlice)
{
try
{
return typeof(this)(this.range[lower .. upper]);
}
catch (E exception)
{
return typeof(this)(handler(exception, this.range));
}
}
else
return typeof(this)(this.range[lower .. upper]);
}
}
else static if (is(typeof(Range.init[size_t.init .. $])))
{
import std.range : Take, takeExactly;
static struct DollarToken {}
enum opDollar = DollarToken.init;
typeof(this) opSlice(size_t lower, DollarToken)
{
static if (primitivesToHandle & RangePrimitive.opSlice)
{
try
{
return typeof(this)(this.range[lower .. $]);
}
catch (E exception)
{
return typeof(this)(handler(exception, this.range));
}
}
else
return typeof(this)(this.range[lower .. $]);
}
Take!Handler opSlice(size_t lower, size_t upper)
{
static if (primitivesToHandle & RangePrimitive.opSlice)
{
try
{
return takeExactly(typeof(this)(this.range[lower .. $]), upper - 1);
}
catch (E exception)
{
return takeExactly(typeof(this)(handler(exception, this.range)), 0);
}
}
else
return takeExactly(typeof(this)(this.range[lower .. $]), upper - 1);
}
}
}
}
return Handler(input);
}
///
pure @safe unittest
{
import std.algorithm : equal, map, splitter;
import std.conv : to, ConvException;
auto s = "12,1337z32,54,2,7,9,1z,6,8";
// The next line composition will throw when iterated
// as some elements of the input do not convert to integer
auto r = s.splitter(',').map!(a => to!int(a));
// Substitute 0 for cases of ConvException
auto h = r.handle!(ConvException, RangePrimitive.front, (e, r) => 0);
assert(h.equal([12, 0, 54, 2, 7, 9, 0, 6, 8]));
}
///
pure @safe unittest
{
import std.algorithm : equal;
import std.range : retro;
import std.utf : UTFException;
auto str = "hello\xFFworld"; // 0xFF is an invalid UTF-8 code unit
auto handled = str.handle!(UTFException, RangePrimitive.access,
(e, r) => ' '); // Replace invalid code points with spaces
assert(handled.equal("hello world")); // `front` is handled,
assert(handled.retro.equal("dlrow olleh")); // as well as `back`
}
pure nothrow @safe unittest
{
static struct ThrowingRange
{
pure @safe:
@property bool empty()
{
throw new Exception("empty has thrown");
}
@property int front()
{
throw new Exception("front has thrown");
}
@property int back()
{
throw new Exception("back has thrown");
}
void popFront()
{
throw new Exception("popFront has thrown");
}
void popBack()
{
throw new Exception("popBack has thrown");
}
int opIndex(size_t)
{
throw new Exception("opIndex has thrown");
}
ThrowingRange opSlice(size_t, size_t)
{
throw new Exception("opSlice has thrown");
}
@property size_t length()
{
throw new Exception("length has thrown");
}
alias opDollar = length;
@property ThrowingRange save()
{
throw new Exception("save has thrown");
}
}
static assert(isInputRange!ThrowingRange);
static assert(isForwardRange!ThrowingRange);
static assert(isBidirectionalRange!ThrowingRange);
static assert(hasSlicing!ThrowingRange);
static assert(hasLength!ThrowingRange);
auto f = ThrowingRange();
auto fb = f.handle!(Exception, RangePrimitive.front | RangePrimitive.back,
(e, r) => -1)();
assert(fb.front == -1);
assert(fb.back == -1);
assertThrown(fb.popFront());
assertThrown(fb.popBack());
assertThrown(fb.empty);
assertThrown(fb.save);
assertThrown(fb[0]);
auto accessRange = f.handle!(Exception, RangePrimitive.access,
(e, r) => -1);
assert(accessRange.front == -1);
assert(accessRange.back == -1);
assert(accessRange[0] == -1);
assertThrown(accessRange.popFront());
assertThrown(accessRange.popBack());
auto pfb = f.handle!(Exception, RangePrimitive.pop, (e, r) => -1)();
pfb.popFront(); // this would throw otherwise
pfb.popBack(); // this would throw otherwise
auto em = f.handle!(Exception,
RangePrimitive.empty, (e, r) => false)();
assert(!em.empty);
auto arr = f.handle!(Exception,
RangePrimitive.opIndex, (e, r) => 1337)();
assert(arr[0] == 1337);
auto arr2 = f.handle!(Exception,
RangePrimitive.opIndex, (e, r, i) => i)();
assert(arr2[0] == 0);
assert(arr2[1337] == 1337);
auto save = f.handle!(Exception,
RangePrimitive.save,
function(Exception e, ref ThrowingRange r) {
return ThrowingRange();
})();
save.save;
auto slice = f.handle!(Exception,
RangePrimitive.opSlice, (e, r) => ThrowingRange())();
auto sliced = slice[0 .. 1337]; // this would throw otherwise
static struct Infinite
{
import std.range : Take;
pure @safe:
enum bool empty = false;
int front() { assert(false); }
void popFront() { assert(false); }
Infinite save() @property { assert(false); }
static struct DollarToken {}
enum opDollar = DollarToken.init;
Take!Infinite opSlice(size_t, size_t) { assert(false); }
Infinite opSlice(size_t, DollarToken)
{
throw new Exception("opSlice has thrown");
}
}
static assert(isInputRange!Infinite);
static assert(isInfinite!Infinite);
static assert(hasSlicing!Infinite);
assertThrown(Infinite()[0 .. $]);
auto infinite = Infinite.init.handle!(Exception,
RangePrimitive.opSlice, (e, r) => Infinite())();
auto infSlice = infinite[0 .. $]; // this would throw otherwise
}
/++
Convenience mixin for trivially sub-classing exceptions
Even trivially sub-classing an exception involves writing boilerplate code
for the constructor to: 1) correctly pass in the source file and line number
the exception was thrown from; 2) be usable with $(LREF enforce) which
expects exception constructors to take arguments in a fixed order. This
mixin provides that boilerplate code.
Note however that you need to mark the $(B mixin) line with at least a
minimal (i.e. just $(B ///)) DDoc comment if you want the mixed-in
constructors to be documented in the newly created Exception subclass.
$(RED Current limitation): Due to
$(LINK2 https://issues.dlang.org/show_bug.cgi?id=11500, bug #11500),
currently the constructors specified in this mixin cannot be overloaded with
any other custom constructors. Thus this mixin can currently only be used
when no such custom constructors need to be explicitly specified.
+/
mixin template basicExceptionCtors()
{
/++
Params:
msg = The message for the exception.
file = The file where the exception occurred.
line = The line number where the exception occurred.
next = The previous exception in the chain of exceptions, if any.
+/
this(string msg, string file = __FILE__, size_t line = __LINE__,
Throwable next = null) @nogc @safe pure nothrow
{
super(msg, file, line, next);
}
/++
Params:
msg = The message for the exception.
next = The previous exception in the chain of exceptions.
file = The file where the exception occurred.
line = The line number where the exception occurred.
+/
this(string msg, Throwable next, string file = __FILE__,
size_t line = __LINE__) @nogc @safe pure nothrow
{
super(msg, file, line, next);
}
}
///
@safe unittest
{
class MeaCulpa: Exception
{
///
mixin basicExceptionCtors;
}
try
throw new MeaCulpa("test");
catch (MeaCulpa e)
{
assert(e.msg == "test");
assert(e.file == __FILE__);
assert(e.line == __LINE__ - 5);
}
}
@safe pure nothrow unittest
{
class TestException : Exception { mixin basicExceptionCtors; }
auto e = new Exception("msg");
auto te1 = new TestException("foo");
auto te2 = new TestException("foo", e);
}
@safe unittest
{
class TestException : Exception { mixin basicExceptionCtors; }
auto e = new Exception("!!!");
auto te1 = new TestException("message", "file", 42, e);
assert(te1.msg == "message");
assert(te1.file == "file");
assert(te1.line == 42);
assert(te1.next is e);
auto te2 = new TestException("message", e, "file", 42);
assert(te2.msg == "message");
assert(te2.file == "file");
assert(te2.line == 42);
assert(te2.next is e);
auto te3 = new TestException("foo");
assert(te3.msg == "foo");
assert(te3.file == __FILE__);
assert(te3.line == __LINE__ - 3);
assert(te3.next is null);
auto te4 = new TestException("foo", e);
assert(te4.msg == "foo");
assert(te4.file == __FILE__);
assert(te4.line == __LINE__ - 3);
assert(te4.next is e);
}
|
D
|
/Users/jonb/Documents/GitHub/rustapps/twitterplotter/target/debug/build/rand_chacha-b56070b60231b1f4/build_script_build-b56070b60231b1f4: /Users/jonb/.cargo/registry/src/github.com-1ecc6299db9ec823/rand_chacha-0.1.1/build.rs
/Users/jonb/Documents/GitHub/rustapps/twitterplotter/target/debug/build/rand_chacha-b56070b60231b1f4/build_script_build-b56070b60231b1f4.d: /Users/jonb/.cargo/registry/src/github.com-1ecc6299db9ec823/rand_chacha-0.1.1/build.rs
/Users/jonb/.cargo/registry/src/github.com-1ecc6299db9ec823/rand_chacha-0.1.1/build.rs:
|
D
|
// Compiler implementation of the D programming language
// Copyright (c) 1999-2015 by Digital Mars
// All Rights Reserved
// written by Walter Bright
// http://www.digitalmars.com
// Distributed under the Boost Software License, Version 1.0.
// http://www.boost.org/LICENSE_1_0.txt
module ddmd.func;
import core.stdc.stdio;
import core.stdc.string;
import ddmd.aggregate;
import ddmd.arraytypes;
import ddmd.attrib;
import ddmd.gluelayer;
import ddmd.builtin;
import ddmd.ctfeexpr;
import ddmd.dclass;
import ddmd.declaration;
import ddmd.delegatize;
import ddmd.dinterpret;
import ddmd.dmodule;
import ddmd.doc;
import ddmd.dscope;
import ddmd.dstruct;
import ddmd.dsymbol;
import ddmd.dtemplate;
import ddmd.errors;
import ddmd.escape;
import ddmd.expression;
import ddmd.globals;
import ddmd.hdrgen;
import ddmd.id;
import ddmd.identifier;
import ddmd.init;
import ddmd.inline;
import ddmd.mars;
import ddmd.mtype;
import ddmd.nogc;
import ddmd.objc;
import ddmd.opover;
import ddmd.root.filename;
import ddmd.root.outbuffer;
import ddmd.root.rmem;
import ddmd.root.rootobject;
import ddmd.statement;
import ddmd.target;
import ddmd.tokens;
import ddmd.visitor;
enum ILS : int
{
ILSuninitialized, // not computed yet
ILSno, // cannot inline
ILSyes, // can inline
}
alias ILSuninitialized = ILS.ILSuninitialized;
alias ILSno = ILS.ILSno;
alias ILSyes = ILS.ILSyes;
enum BUILTIN : int
{
BUILTINunknown = -1, // not known if this is a builtin
BUILTINno, // this is not a builtin
BUILTINyes, // this is a builtin
}
alias BUILTINunknown = BUILTIN.BUILTINunknown;
alias BUILTINno = BUILTIN.BUILTINno;
alias BUILTINyes = BUILTIN.BUILTINyes;
/* A visitor to walk entire statements and provides ability to replace any sub-statements.
*/
extern (C++) class StatementRewriteWalker : Visitor
{
alias visit = super.visit;
/* Point the currently visited statement.
* By using replaceCurrent() method, you can replace AST during walking.
*/
Statement* ps;
public:
final void visitStmt(ref Statement s)
{
ps = &s;
s.accept(this);
}
final void replaceCurrent(Statement s)
{
*ps = s;
}
override void visit(ErrorStatement s)
{
}
override void visit(PeelStatement s)
{
if (s.s)
visitStmt(s.s);
}
override void visit(ExpStatement s)
{
}
override void visit(DtorExpStatement s)
{
}
override void visit(CompileStatement s)
{
}
override void visit(CompoundStatement s)
{
if (s.statements && s.statements.dim)
{
for (size_t i = 0; i < s.statements.dim; i++)
{
if ((*s.statements)[i])
visitStmt((*s.statements)[i]);
}
}
}
override void visit(CompoundDeclarationStatement s)
{
visit(cast(CompoundStatement)s);
}
override void visit(UnrolledLoopStatement s)
{
if (s.statements && s.statements.dim)
{
for (size_t i = 0; i < s.statements.dim; i++)
{
if ((*s.statements)[i])
visitStmt((*s.statements)[i]);
}
}
}
override void visit(ScopeStatement s)
{
if (s.statement)
visitStmt(s.statement);
}
override void visit(WhileStatement s)
{
if (s._body)
visitStmt(s._body);
}
override void visit(DoStatement s)
{
if (s._body)
visitStmt(s._body);
}
override void visit(ForStatement s)
{
if (s._init)
visitStmt(s._init);
if (s._body)
visitStmt(s._body);
}
override void visit(ForeachStatement s)
{
if (s._body)
visitStmt(s._body);
}
override void visit(ForeachRangeStatement s)
{
if (s._body)
visitStmt(s._body);
}
override void visit(IfStatement s)
{
if (s.ifbody)
visitStmt(s.ifbody);
if (s.elsebody)
visitStmt(s.elsebody);
}
override void visit(ConditionalStatement s)
{
}
override void visit(PragmaStatement s)
{
}
override void visit(StaticAssertStatement s)
{
}
override void visit(SwitchStatement s)
{
if (s._body)
visitStmt(s._body);
}
override void visit(CaseStatement s)
{
if (s.statement)
visitStmt(s.statement);
}
override void visit(CaseRangeStatement s)
{
if (s.statement)
visitStmt(s.statement);
}
override void visit(DefaultStatement s)
{
if (s.statement)
visitStmt(s.statement);
}
override void visit(GotoDefaultStatement s)
{
}
override void visit(GotoCaseStatement s)
{
}
override void visit(SwitchErrorStatement s)
{
}
override void visit(ReturnStatement s)
{
}
override void visit(BreakStatement s)
{
}
override void visit(ContinueStatement s)
{
}
override void visit(SynchronizedStatement s)
{
if (s._body)
visitStmt(s._body);
}
override void visit(WithStatement s)
{
if (s._body)
visitStmt(s._body);
}
override void visit(TryCatchStatement s)
{
if (s._body)
visitStmt(s._body);
if (s.catches && s.catches.dim)
{
for (size_t i = 0; i < s.catches.dim; i++)
{
Catch c = (*s.catches)[i];
if (c && c.handler)
visitStmt(c.handler);
}
}
}
override void visit(TryFinallyStatement s)
{
if (s._body)
visitStmt(s._body);
if (s.finalbody)
visitStmt(s.finalbody);
}
override void visit(OnScopeStatement s)
{
}
override void visit(ThrowStatement s)
{
}
override void visit(DebugStatement s)
{
if (s.statement)
visitStmt(s.statement);
}
override void visit(GotoStatement s)
{
}
override void visit(LabelStatement s)
{
if (s.statement)
visitStmt(s.statement);
}
override void visit(AsmStatement s)
{
}
override void visit(ImportStatement s)
{
}
}
/* Tweak all return statements and dtor call for nrvo_var, for correct NRVO.
*/
extern (C++) final class NrvoWalker : StatementRewriteWalker
{
alias visit = super.visit;
public:
FuncDeclaration fd;
Scope* sc;
override void visit(ReturnStatement s)
{
// See if all returns are instead to be replaced with a goto returnLabel;
if (fd.returnLabel)
{
/* Rewrite:
* return exp;
* as:
* vresult = exp; goto Lresult;
*/
auto gs = new GotoStatement(s.loc, Id.returnLabel);
gs.label = fd.returnLabel;
Statement s1 = gs;
if (s.exp)
s1 = new CompoundStatement(s.loc, new ExpStatement(s.loc, s.exp), gs);
replaceCurrent(s1);
}
}
override void visit(TryFinallyStatement s)
{
DtorExpStatement des;
if (fd.nrvo_can && s.finalbody && (des = s.finalbody.isDtorExpStatement()) !is null && fd.nrvo_var == des.var)
{
/* Normally local variable dtors are called regardless exceptions.
* But for nrvo_var, its dtor should be called only when exception is thrown.
*
* Rewrite:
* try { s->body; } finally { nrvo_var->edtor; }
* // equivalent with:
* // s->body; scope(exit) nrvo_var->edtor;
* as:
* try { s->body; } catch(__o) { nrvo_var->edtor; throw __o; }
* // equivalent with:
* // s->body; scope(failure) nrvo_var->edtor;
*/
Statement sexception = new DtorExpStatement(Loc(), fd.nrvo_var.edtor, fd.nrvo_var);
Identifier id = Identifier.generateId("__o");
Statement handler = new PeelStatement(sexception);
if (sexception.blockExit(fd, false) & BEfallthru)
{
auto ts = new ThrowStatement(Loc(), new IdentifierExp(Loc(), id));
ts.internalThrow = true;
handler = new CompoundStatement(Loc(), handler, ts);
}
auto catches = new Catches();
auto ctch = new Catch(Loc(), null, id, handler);
ctch.internalCatch = true;
ctch.semantic(sc); // Run semantic to resolve identifier '__o'
catches.push(ctch);
Statement s2 = new TryCatchStatement(Loc(), s._body, catches);
replaceCurrent(s2);
s2.accept(this);
}
else
StatementRewriteWalker.visit(s);
}
}
enum FUNCFLAGpurityInprocess = 1; // working on determining purity
enum FUNCFLAGsafetyInprocess = 2; // working on determining safety
enum FUNCFLAGnothrowInprocess = 4; // working on determining nothrow
enum FUNCFLAGnogcInprocess = 8; // working on determining @nogc
enum FUNCFLAGreturnInprocess = 0x10; // working on inferring 'return' for parameters
enum FUNCFLAGinlineScanned = 0x20; // function has been scanned for inline possibilities
/***********************************************************
*/
extern (C++) class FuncDeclaration : Declaration
{
public:
Types* fthrows; // Array of Type's of exceptions (not used)
Statement frequire;
Statement fensure;
Statement fbody;
FuncDeclarations foverrides; // functions this function overrides
FuncDeclaration fdrequire; // function that does the in contract
FuncDeclaration fdensure; // function that does the out contract
const(char)* mangleString; // mangled symbol created from mangleExact()
Identifier outId; // identifier for out statement
VarDeclaration vresult; // variable corresponding to outId
LabelDsymbol returnLabel; // where the return goes
// used to prevent symbols in different
// scopes from having the same name
DsymbolTable localsymtab;
VarDeclaration vthis; // 'this' parameter (member and nested)
VarDeclaration v_arguments; // '_arguments' parameter
Objc_FuncDeclaration objc;
version (IN_GCC)
{
VarDeclaration v_argptr; // '_argptr' variable
}
VarDeclaration v_argsave; // save area for args passed in registers for variadic functions
VarDeclarations* parameters; // Array of VarDeclaration's for parameters
DsymbolTable labtab; // statement label symbol table
Dsymbol overnext; // next in overload list
FuncDeclaration overnext0; // next in overload list (only used during IFTI)
Loc endloc; // location of closing curly bracket
int vtblIndex = -1; // for member functions, index into vtbl[]
bool naked; // true if naked
ILS inlineStatusStmt = ILSuninitialized;
ILS inlineStatusExp = ILSuninitialized;
PINLINE inlining = PINLINEdefault;
CompiledCtfeFunction* ctfeCode; // Compiled code for interpreter
int inlineNest; // !=0 if nested inline
bool isArrayOp; // true if array operation
// true if errors in semantic3 this function's frame ptr
bool semantic3Errors;
ForeachStatement fes; // if foreach body, this is the foreach
BaseClass* interfaceVirtual; // if virtual, but only appears in base interface vtbl[]
bool introducing; // true if 'introducing' function
// if !=NULL, then this is the type
// of the 'introducing' function
// this one is overriding
Type tintro;
bool inferRetType; // true if return type is to be inferred
StorageClass storage_class2; // storage class for template onemember's
// Things that should really go into Scope
// 1 if there's a return exp; statement
// 2 if there's a throw statement
// 4 if there's an assert(0)
// 8 if there's inline asm
int hasReturnExp;
// Support for NRVO (named return value optimization)
bool nrvo_can = true; // true means we can do it
VarDeclaration nrvo_var; // variable to replace with shidden
Symbol* shidden; // hidden pointer passed to function
ReturnStatements* returns;
GotoStatements* gotos; // Gotos with forward references
// set if this is a known, builtin function we can evaluate at compile time
BUILTIN builtin = BUILTINunknown;
// set if someone took the address of this function
int tookAddressOf;
bool requiresClosure; // this function needs a closure
// local variables in this function which are referenced by nested functions
VarDeclarations closureVars;
// Sibling nested functions which called this one
FuncDeclarations siblingCallers;
uint flags; // FUNCFLAGxxxxx
final extern (D) this(Loc loc, Loc endloc, Identifier id, StorageClass storage_class, Type type)
{
super(id);
objc = Objc_FuncDeclaration(this);
//printf("FuncDeclaration(id = '%s', type = %p)\n", id->toChars(), type);
//printf("storage_class = x%x\n", storage_class);
this.storage_class = storage_class;
this.type = type;
if (type)
{
// Normalize storage_class, because function-type related attributes
// are already set in the 'type' in parsing phase.
this.storage_class &= ~(STC_TYPECTOR | STC_FUNCATTR);
}
this.loc = loc;
this.endloc = endloc;
/* The type given for "infer the return type" is a TypeFunction with
* NULL for the return type.
*/
inferRetType = (type && type.nextOf() is null);
}
override Dsymbol syntaxCopy(Dsymbol s)
{
//printf("FuncDeclaration::syntaxCopy('%s')\n", toChars());
FuncDeclaration f = s ? cast(FuncDeclaration)s : new FuncDeclaration(loc, endloc, ident, storage_class, type.syntaxCopy());
f.outId = outId;
f.frequire = frequire ? frequire.syntaxCopy() : null;
f.fensure = fensure ? fensure.syntaxCopy() : null;
f.fbody = fbody ? fbody.syntaxCopy() : null;
assert(!fthrows); // deprecated
return f;
}
// Do the semantic analysis on the external interface to the function.
override void semantic(Scope* sc)
{
TypeFunction f;
AggregateDeclaration ad;
InterfaceDeclaration id;
version (none)
{
printf("FuncDeclaration::semantic(sc = %p, this = %p, '%s', linkage = %d)\n", sc, this, toPrettyChars(), sc.linkage);
if (isFuncLiteralDeclaration())
printf("\tFuncLiteralDeclaration()\n");
printf("sc->parent = %s, parent = %s\n", sc.parent.toChars(), parent ? parent.toChars() : "");
printf("type: %p, %s\n", type, type.toChars());
}
if (semanticRun != PASSinit && isFuncLiteralDeclaration())
{
/* Member functions that have return types that are
* forward references can have semantic() run more than
* once on them.
* See test\interface2.d, test20
*/
return;
}
if (semanticRun >= PASSsemanticdone)
return;
assert(semanticRun <= PASSsemantic);
semanticRun = PASSsemantic;
parent = sc.parent;
Dsymbol parent = toParent();
if (_scope)
{
sc = _scope;
_scope = null;
}
uint dprogress_save = Module.dprogress;
foverrides.setDim(0); // reset in case semantic() is being retried for this function
storage_class |= sc.stc & ~STCref;
ad = isThis();
if (ad)
{
storage_class |= ad.storage_class & (STC_TYPECTOR | STCsynchronized);
if (StructDeclaration sd = ad.isStructDeclaration())
sd.makeNested();
}
if (sc.func)
storage_class |= sc.func.storage_class & STCdisable;
// Remove prefix storage classes silently.
if ((storage_class & STC_TYPECTOR) && !(ad || isNested()))
storage_class &= ~STC_TYPECTOR;
//printf("function storage_class = x%llx, sc->stc = x%llx, %x\n", storage_class, sc->stc, Declaration::isFinal());
FuncLiteralDeclaration fld = isFuncLiteralDeclaration();
if (fld && fld.treq)
{
Type treq = fld.treq;
assert(treq.nextOf().ty == Tfunction);
if (treq.ty == Tdelegate)
fld.tok = TOKdelegate;
else if (treq.ty == Tpointer && treq.nextOf().ty == Tfunction)
fld.tok = TOKfunction;
else
assert(0);
linkage = (cast(TypeFunction)treq.nextOf()).linkage;
}
else
linkage = sc.linkage;
inlining = sc.inlining;
protection = sc.protection;
userAttribDecl = sc.userAttribDecl;
if (!originalType)
originalType = type.syntaxCopy();
if (!type.deco)
{
sc = sc.push();
sc.stc |= storage_class & (STCdisable | STCdeprecated); // forward to function type
TypeFunction tf = cast(TypeFunction)type;
if (sc.func)
{
/* If the parent is @safe, then this function defaults to safe too.
*/
if (tf.trust == TRUSTdefault)
{
FuncDeclaration fd = sc.func;
/* If the parent's @safe-ty is inferred, then this function's @safe-ty needs
* to be inferred first.
* If this function's @safe-ty is inferred, then it needs to be infeerd first.
* (local template function inside @safe function can be inferred to @system).
*/
if (fd.isSafeBypassingInference() && !isInstantiated())
tf.trust = TRUSTsafe; // default to @safe
}
/* If the nesting parent is pure without inference,
* then this function defaults to pure too.
*
* auto foo() pure {
* auto bar() {} // become a weak purity funciton
* class C { // nested class
* auto baz() {} // become a weak purity funciton
* }
*
* static auto boo() {} // typed as impure
* // Even though, boo cannot call any impure functions.
* // See also Expression::checkPurity().
* }
*/
if (tf.purity == PUREimpure && (isNested() || isThis()))
{
FuncDeclaration fd = null;
for (Dsymbol p = toParent2(); p; p = p.toParent2())
{
if (AggregateDeclaration adx = p.isAggregateDeclaration())
{
if (adx.isNested())
continue;
break;
}
if ((fd = p.isFuncDeclaration()) !is null)
break;
}
/* If the parent's purity is inferred, then this function's purity needs
* to be inferred first.
*/
if (fd && fd.isPureBypassingInference() >= PUREweak && !isInstantiated())
{
tf.purity = PUREfwdref; // default to pure
}
}
}
if (tf.isref)
sc.stc |= STCref;
if (tf.isnothrow)
sc.stc |= STCnothrow;
if (tf.isnogc)
sc.stc |= STCnogc;
if (tf.isproperty)
sc.stc |= STCproperty;
if (tf.purity == PUREfwdref)
sc.stc |= STCpure;
if (tf.trust != TRUSTdefault)
sc.stc &= ~(STCsafe | STCsystem | STCtrusted);
if (tf.trust == TRUSTsafe)
sc.stc |= STCsafe;
if (tf.trust == TRUSTsystem)
sc.stc |= STCsystem;
if (tf.trust == TRUSTtrusted)
sc.stc |= STCtrusted;
if (isCtorDeclaration())
{
sc.flags |= SCOPEctor;
Type tret = ad.handleType();
assert(tret);
tret = tret.addStorageClass(storage_class | sc.stc);
tret = tret.addMod(type.mod);
tf.next = tret;
if (ad.isStructDeclaration())
sc.stc |= STCref;
}
sc.linkage = linkage;
if (!tf.isNaked() && !(isThis() || isNested()))
{
OutBuffer buf;
MODtoBuffer(&buf, tf.mod);
error("without 'this' cannot be %s", buf.peekString());
tf.mod = 0; // remove qualifiers
}
/* Apply const, immutable, wild and shared storage class
* to the function type. Do this before type semantic.
*/
StorageClass stc = storage_class;
if (type.isImmutable())
stc |= STCimmutable;
if (type.isConst())
stc |= STCconst;
if (type.isShared() || storage_class & STCsynchronized)
stc |= STCshared;
if (type.isWild())
stc |= STCwild;
switch (stc & STC_TYPECTOR)
{
case STCimmutable:
case STCimmutable | STCconst:
case STCimmutable | STCwild:
case STCimmutable | STCwild | STCconst:
case STCimmutable | STCshared:
case STCimmutable | STCshared | STCconst:
case STCimmutable | STCshared | STCwild:
case STCimmutable | STCshared | STCwild | STCconst:
// Don't use immutableOf(), as that will do a merge()
type = type.makeImmutable();
break;
case STCconst:
type = type.makeConst();
break;
case STCwild:
type = type.makeWild();
break;
case STCwild | STCconst:
type = type.makeWildConst();
break;
case STCshared:
type = type.makeShared();
break;
case STCshared | STCconst:
type = type.makeSharedConst();
break;
case STCshared | STCwild:
type = type.makeSharedWild();
break;
case STCshared | STCwild | STCconst:
type = type.makeSharedWildConst();
break;
case 0:
break;
default:
assert(0);
}
type = type.semantic(loc, sc);
sc = sc.pop();
}
if (type.ty != Tfunction)
{
if (type.ty != Terror)
{
error("%s must be a function instead of %s", toChars(), type.toChars());
type = Type.terror;
}
errors = true;
return;
}
else
{
// Merge back function attributes into 'originalType'.
// It's used for mangling, ddoc, and json output.
TypeFunction tfo = cast(TypeFunction)originalType;
TypeFunction tfx = cast(TypeFunction)type;
tfo.mod = tfx.mod;
tfo.isref = tfx.isref;
tfo.isnothrow = tfx.isnothrow;
tfo.isnogc = tfx.isnogc;
tfo.isproperty = tfx.isproperty;
tfo.purity = tfx.purity;
tfo.trust = tfx.trust;
storage_class &= ~(STC_TYPECTOR | STC_FUNCATTR);
}
f = cast(TypeFunction)type;
size_t nparams = Parameter.dim(f.parameters);
if ((storage_class & STCauto) && !f.isref && !inferRetType)
error("storage class 'auto' has no effect if return type is not inferred");
if (storage_class & STCscope)
error("functions cannot be scope");
if (isAbstract() && !isVirtual())
{
const(char)* sfunc;
if (isStatic())
sfunc = "static";
else if (protection.kind == PROTprivate || protection.kind == PROTpackage)
sfunc = protectionToChars(protection.kind);
else
sfunc = "non-virtual";
error("%s functions cannot be abstract", sfunc);
}
if (isOverride() && !isVirtual())
{
PROTKIND kind = prot().kind;
if ((kind == PROTprivate || kind == PROTpackage) && isMember())
error("%s method is not virtual and cannot override", protectionToChars(kind));
else
error("cannot override a non-virtual function");
}
if (isAbstract() && isFinalFunc())
error("cannot be both final and abstract");
version (none)
{
if (isAbstract() && fbody)
error("abstract functions cannot have bodies");
}
version (none)
{
if (isStaticConstructor() || isStaticDestructor())
{
if (!isStatic() || type.nextOf().ty != Tvoid)
error("static constructors / destructors must be static void");
if (f.arguments && f.arguments.dim)
error("static constructors / destructors must have empty parameter list");
// BUG: check for invalid storage classes
}
}
id = parent.isInterfaceDeclaration();
if (id)
{
storage_class |= STCabstract;
if (isCtorDeclaration() || isPostBlitDeclaration() || isDtorDeclaration() || isInvariantDeclaration() || isNewDeclaration() || isDelete())
error("constructors, destructors, postblits, invariants, new and delete functions are not allowed in interface %s", id.toChars());
if (fbody && isVirtual())
error("function body only allowed in final functions in interface %s", id.toChars());
}
if (UnionDeclaration ud = parent.isUnionDeclaration())
{
if (isPostBlitDeclaration() || isDtorDeclaration() || isInvariantDeclaration())
error("destructors, postblits and invariants are not allowed in union %s", ud.toChars());
}
/* Contracts can only appear without a body when they are virtual interface functions
*/
if (!fbody && (fensure || frequire) && !(id && isVirtual()))
error("in and out contracts require function body");
if (StructDeclaration sd = parent.isStructDeclaration())
{
if (isCtorDeclaration())
{
goto Ldone;
}
}
if (ClassDeclaration cd = parent.isClassDeclaration())
{
if (isCtorDeclaration())
{
goto Ldone;
}
if (storage_class & STCabstract)
cd.isabstract = true;
// if static function, do not put in vtbl[]
if (!isVirtual())
{
//printf("\tnot virtual\n");
goto Ldone;
}
// Suppress further errors if the return type is an error
if (type.nextOf() == Type.terror)
goto Ldone;
bool may_override = false;
for (size_t i = 0; i < cd.baseclasses.dim; i++)
{
BaseClass* b = (*cd.baseclasses)[i];
ClassDeclaration cbd = b.type.toBasetype().isClassHandle();
if (!cbd)
continue;
for (size_t j = 0; j < cbd.vtbl.dim; j++)
{
FuncDeclaration f2 = cbd.vtbl[j].isFuncDeclaration();
if (!f2 || f2.ident != ident)
continue;
if (cbd.parent && cbd.parent.isTemplateInstance())
{
if (!f2.functionSemantic())
goto Ldone;
}
may_override = true;
}
}
if (may_override && type.nextOf() is null)
{
/* If same name function exists in base class but 'this' is auto return,
* cannot find index of base class's vtbl[] to override.
*/
error("return type inference is not supported if may override base class function");
}
/* Find index of existing function in base class's vtbl[] to override
* (the index will be the same as in cd's current vtbl[])
*/
int vi = cd.baseClass ? findVtblIndex(cast(Dsymbols*)&cd.baseClass.vtbl, cast(int)cd.baseClass.vtbl.dim) : -1;
bool doesoverride = false;
switch (vi)
{
case -1:
Lintro:
/* Didn't find one, so
* This is an 'introducing' function which gets a new
* slot in the vtbl[].
*/
// Verify this doesn't override previous final function
if (cd.baseClass)
{
Dsymbol s = cd.baseClass.search(loc, ident);
if (s)
{
FuncDeclaration f2 = s.isFuncDeclaration();
if (f2)
{
f2 = f2.overloadExactMatch(type);
if (f2 && f2.isFinalFunc() && f2.prot().kind != PROTprivate)
error("cannot override final function %s", f2.toPrettyChars());
}
}
}
/* These quirky conditions mimic what VC++ appears to do
*/
if (global.params.mscoff && cd.cpp &&
cd.baseClass && cd.baseClass.vtbl.dim)
{
/* if overriding an interface function, then this is not
* introducing and don't put it in the class vtbl[]
*/
interfaceVirtual = overrideInterface();
if (interfaceVirtual)
{
//printf("\tinterface function %s\n", toChars());
cd.vtblFinal.push(this);
goto Linterfaces;
}
}
if (isFinalFunc())
{
// Don't check here, as it may override an interface function
//if (isOverride())
//error("is marked as override, but does not override any function");
cd.vtblFinal.push(this);
}
else
{
//printf("\tintroducing function %s\n", toChars());
introducing = 1;
if (cd.cpp && Target.reverseCppOverloads)
{
// with dmc, overloaded functions are grouped and in reverse order
vtblIndex = cast(int)cd.vtbl.dim;
for (size_t i = 0; i < cd.vtbl.dim; i++)
{
if (cd.vtbl[i].ident == ident && cd.vtbl[i].parent == parent)
{
vtblIndex = cast(int)i;
break;
}
}
// shift all existing functions back
for (size_t i = cd.vtbl.dim; i > vtblIndex; i--)
{
FuncDeclaration fd = cd.vtbl[i - 1].isFuncDeclaration();
assert(fd);
fd.vtblIndex++;
}
cd.vtbl.insert(vtblIndex, this);
}
else
{
// Append to end of vtbl[]
vi = cast(int)cd.vtbl.dim;
cd.vtbl.push(this);
vtblIndex = vi;
}
}
break;
case -2:
// can't determine because of fwd refs
cd.sizeok = SIZEOKfwd; // can't finish due to forward reference
Module.dprogress = dprogress_save;
return;
default:
{
FuncDeclaration fdv = cd.baseClass.vtbl[vi].isFuncDeclaration();
FuncDeclaration fdc = cd.vtbl[vi].isFuncDeclaration();
// This function is covariant with fdv
if (fdc == this)
{
doesoverride = true;
break;
}
if (fdc.toParent() == parent)
{
//printf("vi = %d,\tthis = %p %s %s @ [%s]\n\tfdc = %p %s %s @ [%s]\n\tfdv = %p %s %s @ [%s]\n",
// vi, this, this->toChars(), this->type->toChars(), this->loc.toChars(),
// fdc, fdc ->toChars(), fdc ->type->toChars(), fdc ->loc.toChars(),
// fdv, fdv ->toChars(), fdv ->type->toChars(), fdv ->loc.toChars());
// fdc overrides fdv exactly, then this introduces new function.
if (fdc.type.mod == fdv.type.mod && this.type.mod != fdv.type.mod)
goto Lintro;
}
// This function overrides fdv
if (fdv.isFinalFunc())
error("cannot override final function %s", fdv.toPrettyChars());
doesoverride = true;
if (!isOverride())
.deprecation(loc, "implicitly overriding base class method %s with %s deprecated; add 'override' attribute", fdv.toPrettyChars(), toPrettyChars());
if (fdc.toParent() == parent)
{
// If both are mixins, or both are not, then error.
// If either is not, the one that is not overrides the other.
bool thismixin = this.parent.isClassDeclaration() !is null;
bool fdcmixin = fdc.parent.isClassDeclaration() !is null;
if (thismixin == fdcmixin)
{
error("multiple overrides of same function");
}
else if (!thismixin) // fdc overrides fdv
{
// this doesn't override any function
break;
}
}
cd.vtbl[vi] = this;
vtblIndex = vi;
/* Remember which functions this overrides
*/
foverrides.push(fdv);
/* This works by whenever this function is called,
* it actually returns tintro, which gets dynamically
* cast to type. But we know that tintro is a base
* of type, so we could optimize it by not doing a
* dynamic cast, but just subtracting the isBaseOf()
* offset if the value is != null.
*/
if (fdv.tintro)
tintro = fdv.tintro;
else if (!type.equals(fdv.type))
{
/* Only need to have a tintro if the vptr
* offsets differ
*/
int offset;
if (fdv.type.nextOf().isBaseOf(type.nextOf(), &offset))
{
tintro = fdv.type;
}
}
break;
}
}
/* Go through all the interface bases.
* If this function is covariant with any members of those interface
* functions, set the tintro.
*/
Linterfaces:
foreach (b; cd.interfaces)
{
vi = findVtblIndex(cast(Dsymbols*)&b.sym.vtbl, cast(int)b.sym.vtbl.dim);
switch (vi)
{
case -1:
break;
case -2:
cd.sizeok = SIZEOKfwd; // can't finish due to forward reference
Module.dprogress = dprogress_save;
return;
default:
{
FuncDeclaration fdv = cast(FuncDeclaration)b.sym.vtbl[vi];
Type ti = null;
/* Remember which functions this overrides
*/
foverrides.push(fdv);
/* Should we really require 'override' when implementing
* an interface function?
*/
//if (!isOverride())
//warning(loc, "overrides base class function %s, but is not marked with 'override'", fdv->toPrettyChars());
if (fdv.tintro)
ti = fdv.tintro;
else if (!type.equals(fdv.type))
{
/* Only need to have a tintro if the vptr
* offsets differ
*/
uint errors = global.errors;
global.gag++; // suppress printing of error messages
int offset;
int baseOf = fdv.type.nextOf().isBaseOf(type.nextOf(), &offset);
global.gag--; // suppress printing of error messages
if (errors != global.errors)
{
// any error in isBaseOf() is a forward reference error, so we bail out
global.errors = errors;
cd.sizeok = SIZEOKfwd; // can't finish due to forward reference
Module.dprogress = dprogress_save;
return;
}
if (baseOf)
{
ti = fdv.type;
}
}
if (ti)
{
if (tintro)
{
if (!tintro.nextOf().equals(ti.nextOf()) && !tintro.nextOf().isBaseOf(ti.nextOf(), null) && !ti.nextOf().isBaseOf(tintro.nextOf(), null))
{
error("incompatible covariant types %s and %s", tintro.toChars(), ti.toChars());
}
}
tintro = ti;
}
goto L2;
}
}
}
if (!doesoverride && isOverride() && (type.nextOf() || !may_override))
{
Dsymbol s = null;
for (size_t i = 0; i < cd.baseclasses.dim; i++)
{
s = (*cd.baseclasses)[i].sym.search_correct(ident);
if (s)
break;
}
if (s)
error("does not override any function, did you mean to override '%s'?", s.toPrettyChars());
else
error("does not override any function");
}
L2:
/* Go through all the interface bases.
* Disallow overriding any final functions in the interface(s).
*/
foreach (b; cd.interfaces)
{
if (b.sym)
{
Dsymbol s = search_function(b.sym, ident);
if (s)
{
FuncDeclaration f2 = s.isFuncDeclaration();
if (f2)
{
f2 = f2.overloadExactMatch(type);
if (f2 && f2.isFinalFunc() && f2.prot().kind != PROTprivate)
error("cannot override final function %s.%s", b.sym.toChars(), f2.toPrettyChars());
}
}
}
}
}
else if (isOverride() && !parent.isTemplateInstance())
error("override only applies to class member functions");
// Reflect this->type to f because it could be changed by findVtblIndex
assert(type.ty == Tfunction);
f = cast(TypeFunction)type;
/* Do not allow template instances to add virtual functions
* to a class.
*/
if (isVirtual())
{
TemplateInstance ti = parent.isTemplateInstance();
if (ti)
{
// Take care of nested templates
while (1)
{
TemplateInstance ti2 = ti.tempdecl.parent.isTemplateInstance();
if (!ti2)
break;
ti = ti2;
}
// If it's a member template
ClassDeclaration cd = ti.tempdecl.isClassMember();
if (cd)
{
error("cannot use template to add virtual function to class '%s'", cd.toChars());
}
}
}
if (isMain())
{
// Check parameters to see if they are either () or (char[][] args)
switch (nparams)
{
case 0:
break;
case 1:
{
Parameter fparam0 = Parameter.getNth(f.parameters, 0);
if (fparam0.type.ty != Tarray || fparam0.type.nextOf().ty != Tarray || fparam0.type.nextOf().nextOf().ty != Tchar || fparam0.storageClass & (STCout | STCref | STClazy))
goto Lmainerr;
break;
}
default:
goto Lmainerr;
}
if (!f.nextOf())
error("must return int or void");
else if (f.nextOf().ty != Tint32 && f.nextOf().ty != Tvoid)
error("must return int or void, not %s", f.nextOf().toChars());
if (f.varargs)
{
Lmainerr:
error("parameters must be main() or main(string[] args)");
}
}
if (isVirtual() && semanticRun != PASSsemanticdone)
{
/* Rewrite contracts as nested functions, then call them.
* Doing it as nested functions means that overriding functions
* can call them.
*/
if (frequire)
{
/* in { ... }
* becomes:
* void __require() { ... }
* __require();
*/
Loc loc = frequire.loc;
auto tf = new TypeFunction(null, Type.tvoid, 0, LINKd);
tf.isnothrow = f.isnothrow;
tf.isnogc = f.isnogc;
tf.purity = f.purity;
tf.trust = f.trust;
auto fd = new FuncDeclaration(loc, loc, Id.require, STCundefined, tf);
fd.fbody = frequire;
Statement s1 = new ExpStatement(loc, fd);
Expression e = new CallExp(loc, new VarExp(loc, fd, false), cast(Expressions*)null);
Statement s2 = new ExpStatement(loc, e);
frequire = new CompoundStatement(loc, s1, s2);
fdrequire = fd;
}
if (!outId && f.nextOf() && f.nextOf().toBasetype().ty != Tvoid)
outId = Id.result; // provide a default
if (fensure)
{
/* out (result) { ... }
* becomes:
* void __ensure(ref tret result) { ... }
* __ensure(result);
*/
Loc loc = fensure.loc;
auto fparams = new Parameters();
Parameter p = null;
if (outId)
{
p = new Parameter(STCref | STCconst, f.nextOf(), outId, null);
fparams.push(p);
}
auto tf = new TypeFunction(fparams, Type.tvoid, 0, LINKd);
tf.isnothrow = f.isnothrow;
tf.isnogc = f.isnogc;
tf.purity = f.purity;
tf.trust = f.trust;
auto fd = new FuncDeclaration(loc, loc, Id.ensure, STCundefined, tf);
fd.fbody = fensure;
Statement s1 = new ExpStatement(loc, fd);
Expression eresult = null;
if (outId)
eresult = new IdentifierExp(loc, outId);
Expression e = new CallExp(loc, new VarExp(loc, fd, false), eresult);
Statement s2 = new ExpStatement(loc, e);
fensure = new CompoundStatement(loc, s1, s2);
fdensure = fd;
}
}
Ldone:
/* Purity and safety can be inferred for some functions by examining
* the function body.
*/
TemplateInstance ti;
if (fbody && (isFuncLiteralDeclaration() || (storage_class & STCinference) || (inferRetType && !isCtorDeclaration()) || isInstantiated() && !isVirtualMethod() && !(ti = parent.isTemplateInstance(), ti && !ti.isTemplateMixin() && ti.tempdecl.ident != ident)))
{
if (f.purity == PUREimpure) // purity not specified
flags |= FUNCFLAGpurityInprocess;
if (f.trust == TRUSTdefault)
flags |= FUNCFLAGsafetyInprocess;
if (!f.isnothrow)
flags |= FUNCFLAGnothrowInprocess;
if (!f.isnogc)
flags |= FUNCFLAGnogcInprocess;
if (!isVirtual() || introducing)
flags |= FUNCFLAGreturnInprocess;
}
Module.dprogress++;
semanticRun = PASSsemanticdone;
/* Save scope for possible later use (if we need the
* function internals)
*/
_scope = sc.copy();
_scope.setNoFree();
static __gshared bool printedMain = false; // semantic might run more than once
if (global.params.verbose && !printedMain)
{
const(char)* type = isMain() ? "main" : isWinMain() ? "winmain" : isDllMain() ? "dllmain" : cast(const(char)*)null;
Module mod = sc._module;
if (type && mod)
{
printedMain = true;
const(char)* name = FileName.searchPath(global.path, mod.srcfile.toChars(), true);
fprintf(global.stdmsg, "entry %-10s\t%s\n", type, name);
}
}
if (fbody && isMain() && sc._module.isRoot())
genCmain(sc);
assert(type.ty != Terror || errors);
}
override final void semantic2(Scope* sc)
{
if (semanticRun >= PASSsemantic2done)
return;
assert(semanticRun <= PASSsemantic2);
semanticRun = PASSsemantic2;
objc_FuncDeclaration_semantic_setSelector(this, sc);
objc_FuncDeclaration_semantic_validateSelector(this);
if (ClassDeclaration cd = parent.isClassDeclaration())
{
objc_FuncDeclaration_semantic_checkLinkage(this);
}
}
// Do the semantic analysis on the internals of the function.
override final void semantic3(Scope* sc)
{
VarDeclaration argptr = null;
VarDeclaration _arguments = null;
if (!parent)
{
if (global.errors)
return;
//printf("FuncDeclaration::semantic3(%s '%s', sc = %p)\n", kind(), toChars(), sc);
assert(0);
}
if (isError(parent))
return;
//printf("FuncDeclaration::semantic3('%s.%s', %p, sc = %p, loc = %s)\n", parent->toChars(), toChars(), this, sc, loc.toChars());
//fflush(stdout);
//printf("storage class = x%x %x\n", sc->stc, storage_class);
//{ static int x; if (++x == 2) *(char*)0=0; }
//printf("\tlinkage = %d\n", sc->linkage);
if (ident == Id.assign && !inuse)
{
if (storage_class & STCinference)
{
/* Bugzilla 15044: For generated opAssign function, any errors
* from its body need to be gagged.
*/
uint oldErrors = global.startGagging();
++inuse;
semantic3(sc);
--inuse;
if (global.endGagging(oldErrors)) // if errors happened
{
// Disable generated opAssign, because some members forbid identity assignment.
storage_class |= STCdisable;
fbody = null; // remove fbody which contains the error
semantic3Errors = false;
}
return;
}
}
//printf(" sc->incontract = %d\n", (sc->flags & SCOPEcontract));
if (semanticRun >= PASSsemantic3)
return;
semanticRun = PASSsemantic3;
semantic3Errors = false;
if (!type || type.ty != Tfunction)
return;
TypeFunction f = cast(TypeFunction)type;
if (!inferRetType && f.next.ty == Terror)
return;
if (!fbody && inferRetType && !f.next)
{
error("has no function body with return type inference");
return;
}
uint oldErrors = global.errors;
if (frequire)
{
for (size_t i = 0; i < foverrides.dim; i++)
{
FuncDeclaration fdv = foverrides[i];
if (fdv.fbody && !fdv.frequire)
{
error("cannot have an in contract when overriden function %s does not have an in contract", fdv.toPrettyChars());
break;
}
}
}
frequire = mergeFrequire(frequire);
fensure = mergeFensure(fensure, outId);
if (fbody || frequire || fensure)
{
/* Symbol table into which we place parameters and nested functions,
* solely to diagnose name collisions.
*/
localsymtab = new DsymbolTable();
// Establish function scope
auto ss = new ScopeDsymbol();
ss.parent = sc.scopesym;
Scope* sc2 = sc.push(ss);
sc2.func = this;
sc2.parent = this;
sc2.callSuper = 0;
sc2.sbreak = null;
sc2.scontinue = null;
sc2.sw = null;
sc2.fes = fes;
sc2.linkage = LINKd;
sc2.stc &= ~(STCauto | STCscope | STCstatic | STCabstract | STCdeprecated | STCoverride | STC_TYPECTOR | STCfinal | STCtls | STCgshared | STCref | STCreturn | STCproperty | STCnothrow | STCpure | STCsafe | STCtrusted | STCsystem);
sc2.protection = Prot(PROTpublic);
sc2.explicitProtection = 0;
sc2.structalign = STRUCTALIGN_DEFAULT;
if (this.ident != Id.require && this.ident != Id.ensure)
sc2.flags = sc.flags & ~SCOPEcontract;
sc2.flags &= ~SCOPEcompile;
sc2.tf = null;
sc2.os = null;
sc2.noctor = 0;
sc2.userAttribDecl = null;
if (sc2.intypeof == 1)
sc2.intypeof = 2;
sc2.fieldinit = null;
sc2.fieldinit_dim = 0;
if (isMember2())
{
FuncLiteralDeclaration fld = isFuncLiteralDeclaration();
if (fld && !sc.intypeof)
{
if (fld.tok == TOKreserved)
fld.tok = TOKfunction;
if (isNested())
{
error("cannot be class members");
return;
}
}
assert(!isNested() || sc.intypeof); // can't be both member and nested
}
// Declare 'this'
AggregateDeclaration ad = isThis();
vthis = declareThis(sc2, ad);
// Declare hidden variable _arguments[] and _argptr
if (f.varargs == 1)
{
static if (!IN_GCC)
{
if (global.params.is64bit && !global.params.isWindows)
{
// Declare save area for varargs registers
Type t = new TypeIdentifier(loc, Id.va_argsave_t);
t = t.semantic(loc, sc);
if (t == Type.terror)
{
error("must import core.vararg to use variadic functions");
return;
}
else
{
v_argsave = new VarDeclaration(loc, t, Id.va_argsave, null);
v_argsave.storage_class |= STCtemp;
v_argsave.semantic(sc2);
sc2.insert(v_argsave);
v_argsave.parent = this;
}
}
}
if (f.linkage == LINKd)
{
// Declare _arguments[]
v_arguments = new VarDeclaration(Loc(), Type.typeinfotypelist.type, Id._arguments_typeinfo, null);
v_arguments.storage_class |= STCtemp | STCparameter;
v_arguments.semantic(sc2);
sc2.insert(v_arguments);
v_arguments.parent = this;
//Type *t = Type::typeinfo->type->constOf()->arrayOf();
Type t = Type.dtypeinfo.type.arrayOf();
_arguments = new VarDeclaration(Loc(), t, Id._arguments, null);
_arguments.storage_class |= STCtemp;
_arguments.semantic(sc2);
sc2.insert(_arguments);
_arguments.parent = this;
}
if (f.linkage == LINKd || (f.parameters && Parameter.dim(f.parameters)))
{
// Declare _argptr
Type t = Type.tvalist;
argptr = new VarDeclaration(Loc(), t, Id._argptr, null);
argptr.storage_class |= STCtemp;
argptr.semantic(sc2);
sc2.insert(argptr);
argptr.parent = this;
}
}
/* Declare all the function parameters as variables
* and install them in parameters[]
*/
size_t nparams = Parameter.dim(f.parameters);
if (nparams)
{
/* parameters[] has all the tuples removed, as the back end
* doesn't know about tuples
*/
parameters = new VarDeclarations();
parameters.reserve(nparams);
for (size_t i = 0; i < nparams; i++)
{
Parameter fparam = Parameter.getNth(f.parameters, i);
Identifier id = fparam.ident;
StorageClass stc = 0;
if (!id)
{
/* Generate identifier for un-named parameter,
* because we need it later on.
*/
fparam.ident = id = Identifier.generateId("_param_", i);
stc |= STCtemp;
}
Type vtype = fparam.type;
auto v = new VarDeclaration(loc, vtype, id, null);
//printf("declaring parameter %s of type %s\n", v->toChars(), v->type->toChars());
stc |= STCparameter;
if (f.varargs == 2 && i + 1 == nparams)
stc |= STCvariadic;
stc |= fparam.storageClass & (STCin | STCout | STCref | STCreturn | STClazy | STCfinal | STC_TYPECTOR | STCnodtor);
v.storage_class = stc;
v.semantic(sc2);
if (!sc2.insert(v))
error("parameter %s.%s is already defined", toChars(), v.toChars());
else
parameters.push(v);
localsymtab.insert(v);
v.parent = this;
}
}
// Declare the tuple symbols and put them in the symbol table,
// but not in parameters[].
if (f.parameters)
{
for (size_t i = 0; i < f.parameters.dim; i++)
{
Parameter fparam = (*f.parameters)[i];
if (!fparam.ident)
continue;
// never used, so ignore
if (fparam.type.ty == Ttuple)
{
TypeTuple t = cast(TypeTuple)fparam.type;
size_t dim = Parameter.dim(t.arguments);
auto exps = new Objects();
exps.setDim(dim);
for (size_t j = 0; j < dim; j++)
{
Parameter narg = Parameter.getNth(t.arguments, j);
assert(narg.ident);
VarDeclaration v = sc2.search(Loc(), narg.ident, null).isVarDeclaration();
assert(v);
Expression e = new VarExp(v.loc, v);
(*exps)[j] = e;
}
assert(fparam.ident);
auto v = new TupleDeclaration(loc, fparam.ident, exps);
//printf("declaring tuple %s\n", v->toChars());
v.isexp = true;
if (!sc2.insert(v))
error("parameter %s.%s is already defined", toChars(), v.toChars());
localsymtab.insert(v);
v.parent = this;
}
}
}
// Precondition invariant
Statement fpreinv = null;
if (addPreInvariant())
{
Expression e = addInvariant(loc, sc, ad, vthis, isDtorDeclaration() !is null);
if (e)
fpreinv = new ExpStatement(Loc(), e);
}
// Postcondition invariant
Statement fpostinv = null;
if (addPostInvariant())
{
Expression e = addInvariant(loc, sc, ad, vthis, isCtorDeclaration() !is null);
if (e)
fpostinv = new ExpStatement(Loc(), e);
}
Scope* scout = null;
if (fensure || addPostInvariant())
{
if ((fensure && global.params.useOut) || fpostinv)
{
returnLabel = new LabelDsymbol(Id.returnLabel);
}
// scope of out contract (need for vresult->semantic)
auto sym = new ScopeDsymbol();
sym.parent = sc2.scopesym;
scout = sc2.push(sym);
}
if (fbody)
{
auto sym = new ScopeDsymbol();
sym.parent = sc2.scopesym;
sc2 = sc2.push(sym);
AggregateDeclaration ad2 = isAggregateMember2();
/* If this is a class constructor
*/
if (ad2 && isCtorDeclaration())
{
sc2.allocFieldinit(ad2.fields.dim);
foreach (v; ad2.fields)
{
v.ctorinit = 0;
}
}
if (!inferRetType && retStyle(f) != RETstack)
nrvo_can = 0;
bool inferRef = (f.isref && (storage_class & STCauto));
fbody = fbody.semantic(sc2);
if (!fbody)
fbody = new CompoundStatement(Loc(), new Statements());
assert(type == f || (type.ty == Tfunction && f.purity == PUREimpure && (cast(TypeFunction)type).purity >= PUREfwdref));
f = cast(TypeFunction)type;
if (inferRetType)
{
// If no return type inferred yet, then infer a void
if (!f.next)
f.next = Type.tvoid;
if (f.checkRetType(loc))
fbody = new ErrorStatement();
}
if (global.params.vcomplex && f.next !is null)
f.next.checkComplexTransition(loc);
if (returns && !fbody.isErrorStatement())
{
for (size_t i = 0; i < returns.dim;)
{
Expression exp = (*returns)[i].exp;
if (exp.op == TOKvar && (cast(VarExp)exp).var == vresult)
{
if (f.next.ty == Tvoid && isMain())
exp.type = Type.tint32;
else
exp.type = f.next;
// Remove `return vresult;` from returns
returns.remove(i);
continue;
}
if (inferRef && f.isref && !exp.type.constConv(f.next)) // Bugzilla 13336
f.isref = false;
i++;
}
}
if (f.isref) // Function returns a reference
{
if (storage_class & STCauto)
storage_class &= ~STCauto;
}
if (retStyle(f) != RETstack)
nrvo_can = 0;
if (fbody.isErrorStatement())
{
}
else if (isStaticCtorDeclaration())
{
/* It's a static constructor. Ensure that all
* ctor consts were initialized.
*/
ScopeDsymbol pd = toParent().isScopeDsymbol();
for (size_t i = 0; i < pd.members.dim; i++)
{
Dsymbol s = (*pd.members)[i];
s.checkCtorConstInit();
}
}
else if (ad2 && isCtorDeclaration())
{
ClassDeclaration cd = ad2.isClassDeclaration();
// Verify that all the ctorinit fields got initialized
if (!(sc2.callSuper & CSXthis_ctor))
{
for (size_t i = 0; i < ad2.fields.dim; i++)
{
VarDeclaration v = ad2.fields[i];
if (v.ctorinit == 0)
{
/* Current bugs in the flow analysis:
* 1. union members should not produce error messages even if
* not assigned to
* 2. structs should recognize delegating opAssign calls as well
* as delegating calls to other constructors
*/
if (v.isCtorinit() && !v.type.isMutable() && cd)
error("missing initializer for %s field %s", MODtoChars(v.type.mod), v.toChars());
else if (v.storage_class & STCnodefaultctor)
.error(loc, "field %s must be initialized in constructor", v.toChars());
else if (v.type.needsNested())
.error(loc, "field %s must be initialized in constructor, because it is nested struct", v.toChars());
}
else
{
bool mustInit = (v.storage_class & STCnodefaultctor || v.type.needsNested());
if (mustInit && !(sc2.fieldinit[i] & CSXthis_ctor))
{
error("field %s must be initialized but skipped", v.toChars());
}
}
}
}
sc2.freeFieldinit();
if (cd && !(sc2.callSuper & CSXany_ctor) && cd.baseClass && cd.baseClass.ctor)
{
sc2.callSuper = 0;
// Insert implicit super() at start of fbody
FuncDeclaration fd = resolveFuncCall(Loc(), sc2, cd.baseClass.ctor, null, null, null, 1);
if (!fd)
{
error("no match for implicit super() call in constructor");
}
else if (fd.storage_class & STCdisable)
{
error("cannot call super() implicitly because it is annotated with @disable");
}
else
{
Expression e1 = new SuperExp(Loc());
Expression e = new CallExp(Loc(), e1);
e = e.semantic(sc2);
Statement s = new ExpStatement(Loc(), e);
fbody = new CompoundStatement(Loc(), s, fbody);
}
}
//printf("callSuper = x%x\n", sc2->callSuper);
}
int blockexit = BEnone;
if (!fbody.isErrorStatement())
{
// Check for errors related to 'nothrow'.
uint nothrowErrors = global.errors;
blockexit = fbody.blockExit(this, f.isnothrow);
if (f.isnothrow && (global.errors != nothrowErrors))
.error(loc, "%s '%s' is nothrow yet may throw", kind(), toPrettyChars());
if (flags & FUNCFLAGnothrowInprocess)
{
if (type == f)
f = cast(TypeFunction)f.copy();
f.isnothrow = !(blockexit & BEthrow);
}
}
if (fbody.isErrorStatement())
{
}
else if (ad2 && isCtorDeclaration())
{
/* Append:
* return this;
* to function body
*/
if (blockexit & BEfallthru)
{
Statement s = new ReturnStatement(loc, null);
s = s.semantic(sc2);
fbody = new CompoundStatement(loc, fbody, s);
hasReturnExp |= 1;
}
}
else if (fes)
{
// For foreach(){} body, append a return 0;
if (blockexit & BEfallthru)
{
Expression e = new IntegerExp(0);
Statement s = new ReturnStatement(Loc(), e);
fbody = new CompoundStatement(Loc(), fbody, s);
hasReturnExp |= 1;
}
assert(!returnLabel);
}
else
{
const(bool) inlineAsm = (hasReturnExp & 8) != 0;
if ((blockexit & BEfallthru) && f.next.ty != Tvoid && !inlineAsm)
{
Expression e;
if (!hasReturnExp)
error("has no return statement, but is expected to return a value of type %s", f.next.toChars());
else
error("no return exp; or assert(0); at end of function");
if (global.params.useAssert && !global.params.useInline)
{
/* Add an assert(0, msg); where the missing return
* should be.
*/
e = new AssertExp(endloc, new IntegerExp(0), new StringExp(loc, cast(char*)"missing return expression"));
}
else
e = new HaltExp(endloc);
e = new CommaExp(Loc(), e, f.next.defaultInit());
e = e.semantic(sc2);
Statement s = new ExpStatement(Loc(), e);
fbody = new CompoundStatement(Loc(), fbody, s);
}
}
if (returns)
{
bool implicit0 = (f.next.ty == Tvoid && isMain());
Type tret = implicit0 ? Type.tint32 : f.next;
assert(tret.ty != Tvoid);
if (vresult || returnLabel)
buildResultVar(scout ? scout : sc2, tret);
/* Cannot move this loop into NrvoWalker, because
* returns[i] may be in the nested delegate for foreach-body.
*/
for (size_t i = 0; i < returns.dim; i++)
{
ReturnStatement rs = (*returns)[i];
Expression exp = rs.exp;
if (exp.op == TOKerror)
continue;
if (tret.ty == Terror)
{
// Bugzilla 13702
exp = checkGC(sc2, exp);
continue;
}
if (!exp.implicitConvTo(tret) && parametersIntersect(exp.type))
{
if (exp.type.immutableOf().implicitConvTo(tret))
exp = exp.castTo(sc2, exp.type.immutableOf());
else if (exp.type.wildOf().implicitConvTo(tret))
exp = exp.castTo(sc2, exp.type.wildOf());
}
exp = exp.implicitCastTo(sc2, tret);
if (f.isref)
{
// Function returns a reference
exp = exp.toLvalue(sc2, exp);
checkEscapeRef(sc2, exp, false);
}
else
{
exp = exp.optimize(WANTvalue);
/* Bugzilla 10789:
* If NRVO is not possible, all returned lvalues should call their postblits.
*/
if (!nrvo_can)
exp = doCopyOrMove(sc2, exp);
checkEscape(sc2, exp, false);
}
exp = checkGC(sc2, exp);
if (vresult)
{
// Create: return vresult = exp;
exp = new BlitExp(rs.loc, vresult, exp);
exp.type = vresult.type;
if (rs.caseDim)
exp = Expression.combine(exp, new IntegerExp(rs.caseDim));
}
else if (tintro && !tret.equals(tintro.nextOf()))
{
exp = exp.implicitCastTo(sc2, tintro.nextOf());
}
rs.exp = exp;
}
}
if (nrvo_var || returnLabel)
{
scope NrvoWalker nw = new NrvoWalker();
nw.fd = this;
nw.sc = sc2;
nw.visitStmt(fbody);
}
sc2 = sc2.pop();
}
Statement freq = frequire;
Statement fens = fensure;
/* Do the semantic analysis on the [in] preconditions and
* [out] postconditions.
*/
if (freq)
{
/* frequire is composed of the [in] contracts
*/
auto sym = new ScopeDsymbol();
sym.parent = sc2.scopesym;
sc2 = sc2.push(sym);
sc2.flags = (sc2.flags & ~SCOPEcontract) | SCOPErequire;
// BUG: need to error if accessing out parameters
// BUG: need to treat parameters as const
// BUG: need to disallow returns and throws
// BUG: verify that all in and ref parameters are read
freq = freq.semantic(sc2);
sc2 = sc2.pop();
if (!global.params.useIn)
freq = null;
}
if (fens)
{
/* fensure is composed of the [out] contracts
*/
if (f.next.ty == Tvoid && outId)
error("void functions have no result");
if (fensure && f.next.ty != Tvoid)
buildResultVar(scout, f.next);
sc2 = scout; //push
sc2.flags = (sc2.flags & ~SCOPEcontract) | SCOPEensure;
// BUG: need to treat parameters as const
// BUG: need to disallow returns and throws
if (inferRetType && fdensure && (cast(TypeFunction)fdensure.type).parameters)
{
// Return type was unknown in the first semantic pass
Parameter p = (*(cast(TypeFunction)fdensure.type).parameters)[0];
p.type = f.next;
}
fens = fens.semantic(sc2);
sc2 = sc2.pop();
if (!global.params.useOut)
fens = null;
}
if (fbody && fbody.isErrorStatement())
{
}
else
{
auto a = new Statements();
// Merge in initialization of 'out' parameters
if (parameters)
{
for (size_t i = 0; i < parameters.dim; i++)
{
VarDeclaration v = (*parameters)[i];
if (v.storage_class & STCout)
{
assert(v._init);
ExpInitializer ie = v._init.isExpInitializer();
assert(ie);
if (ie.exp.op == TOKconstruct)
ie.exp.op = TOKassign; // construction occured in parameter processing
a.push(new ExpStatement(Loc(), ie.exp));
}
}
}
if (argptr)
{
// Initialize _argptr
version (IN_GCC)
{
// Handled in FuncDeclaration::toObjFile
v_argptr = argptr;
v_argptr._init = new VoidInitializer(loc);
}
else
{
Type t = argptr.type;
if (global.params.is64bit && !global.params.isWindows)
{
// Initialize _argptr to point to v_argsave
Expression e1 = new VarExp(Loc(), argptr);
Expression e = new SymOffExp(Loc(), v_argsave, 6 * 8 + 8 * 16);
e.type = argptr.type;
e = new AssignExp(Loc(), e1, e);
e = e.semantic(sc2);
a.push(new ExpStatement(Loc(), e));
}
else
{
// Initialize _argptr to point past non-variadic arg
VarDeclaration p;
uint offset = 0;
Expression e;
Expression e1 = new VarExp(Loc(), argptr);
// Find the last non-ref parameter
if (parameters && parameters.dim)
{
size_t lastNonref = parameters.dim - 1;
p = (*parameters)[lastNonref];
/* The trouble with out and ref parameters is that taking
* the address of it doesn't work, because later processing
* adds in an extra level of indirection. So we skip over them.
*/
while (p.storage_class & (STCout | STCref))
{
offset += Target.ptrsize;
if (lastNonref-- == 0)
{
p = v_arguments;
break;
}
p = (*parameters)[lastNonref];
}
}
else
p = v_arguments; // last parameter is _arguments[]
if (global.params.is64bit && global.params.isWindows)
{
offset += Target.ptrsize;
if ((p.storage_class & STClazy) || p.type.size() > Target.ptrsize)
{
/* Necessary to offset the extra level of indirection the Win64
* ABI demands
*/
e = new SymOffExp(Loc(), p, 0);
e.type = Type.tvoidptr;
e = new AddrExp(Loc(), e);
e.type = Type.tvoidptr;
e = new AddExp(Loc(), e, new IntegerExp(offset));
e.type = Type.tvoidptr;
goto L1;
}
}
else if (p.storage_class & STClazy)
{
// If the last parameter is lazy, it's the size of a delegate
offset += Target.ptrsize * 2;
}
else
offset += p.type.size();
offset = (offset + Target.ptrsize - 1) & ~(Target.ptrsize - 1); // assume stack aligns on pointer size
e = new SymOffExp(Loc(), p, offset);
e.type = Type.tvoidptr;
//e = e->semantic(sc);
L1:
e = new AssignExp(Loc(), e1, e);
e.type = t;
a.push(new ExpStatement(Loc(), e));
p.isargptr = true;
}
}
}
if (_arguments)
{
/* Advance to elements[] member of TypeInfo_Tuple with:
* _arguments = v_arguments.elements;
*/
Expression e = new VarExp(Loc(), v_arguments);
e = new DotIdExp(Loc(), e, Id.elements);
e = new ConstructExp(Loc(), _arguments, e);
e = e.semantic(sc2);
_arguments._init = new ExpInitializer(Loc(), e);
auto de = new DeclarationExp(Loc(), _arguments);
a.push(new ExpStatement(Loc(), de));
}
// Merge contracts together with body into one compound statement
if (freq || fpreinv)
{
if (!freq)
freq = fpreinv;
else if (fpreinv)
freq = new CompoundStatement(Loc(), freq, fpreinv);
a.push(freq);
}
if (fbody)
a.push(fbody);
if (fens || fpostinv)
{
if (!fens)
fens = fpostinv;
else if (fpostinv)
fens = new CompoundStatement(Loc(), fpostinv, fens);
auto ls = new LabelStatement(Loc(), Id.returnLabel, fens);
returnLabel.statement = ls;
a.push(returnLabel.statement);
if (f.next.ty != Tvoid && vresult)
{
// Create: return vresult;
Expression e = new VarExp(Loc(), vresult);
if (tintro)
{
e = e.implicitCastTo(sc, tintro.nextOf());
e = e.semantic(sc);
}
auto s = new ReturnStatement(Loc(), e);
a.push(s);
}
}
if (isMain() && f.next.ty == Tvoid)
{
// Add a return 0; statement
Statement s = new ReturnStatement(Loc(), new IntegerExp(0));
a.push(s);
}
Statement sbody = new CompoundStatement(Loc(), a);
/* Append destructor calls for parameters as finally blocks.
*/
if (parameters)
{
for (size_t i = 0; i < parameters.dim; i++)
{
VarDeclaration v = (*parameters)[i];
if (v.storage_class & (STCref | STCout | STClazy))
continue;
if (v.needsScopeDtor())
{
Statement s = new ExpStatement(Loc(), v.edtor);
s = s.semantic(sc2);
uint nothrowErrors = global.errors;
bool isnothrow = f.isnothrow & !(flags & FUNCFLAGnothrowInprocess);
int blockexit = s.blockExit(this, isnothrow);
if (f.isnothrow && (global.errors != nothrowErrors))
.error(loc, "%s '%s' is nothrow yet may throw", kind(), toPrettyChars());
if (flags & FUNCFLAGnothrowInprocess && blockexit & BEthrow)
f.isnothrow = false;
if (sbody.blockExit(this, f.isnothrow) == BEfallthru)
sbody = new CompoundStatement(Loc(), sbody, s);
else
sbody = new TryFinallyStatement(Loc(), sbody, s);
}
}
}
// from this point on all possible 'throwers' are checked
flags &= ~FUNCFLAGnothrowInprocess;
if (isSynchronized())
{
/* Wrap the entire function body in a synchronized statement
*/
ClassDeclaration cd = isThis() ? isThis().isClassDeclaration() : parent.isClassDeclaration();
if (cd)
{
if (!global.params.is64bit && global.params.isWindows && !isStatic() && !sbody.usesEH() && !global.params.trace)
{
/* The back end uses the "jmonitor" hack for syncing;
* no need to do the sync at this level.
*/
}
else
{
Expression vsync;
if (isStatic())
{
// The monitor is in the ClassInfo
vsync = new DotIdExp(loc, DsymbolExp.resolve(loc, sc2, cd, false), Id.classinfo);
}
else
{
// 'this' is the monitor
vsync = new VarExp(loc, vthis);
}
sbody = new PeelStatement(sbody); // don't redo semantic()
sbody = new SynchronizedStatement(loc, vsync, sbody);
sbody = sbody.semantic(sc2);
}
}
else
{
error("synchronized function %s must be a member of a class", toChars());
}
}
// If declaration has no body, don't set sbody to prevent incorrect codegen.
InterfaceDeclaration id = parent.isInterfaceDeclaration();
if (fbody || id && (fdensure || fdrequire) && isVirtual())
fbody = sbody;
}
// Fix up forward-referenced gotos
if (gotos)
{
for (size_t i = 0; i < gotos.dim; ++i)
{
(*gotos)[i].checkLabel();
}
}
if (naked && (fensure || frequire))
error("naked assembly functions with contracts are not supported");
sc2.callSuper = 0;
sc2.pop();
}
if (checkClosure())
{
// We should be setting errors here instead of relying on the global error count.
//errors = true;
}
/* If function survived being marked as impure, then it is pure
*/
if (flags & FUNCFLAGpurityInprocess)
{
flags &= ~FUNCFLAGpurityInprocess;
if (type == f)
f = cast(TypeFunction)f.copy();
f.purity = PUREfwdref;
}
if (flags & FUNCFLAGsafetyInprocess)
{
flags &= ~FUNCFLAGsafetyInprocess;
if (type == f)
f = cast(TypeFunction)f.copy();
f.trust = TRUSTsafe;
}
if (flags & FUNCFLAGnogcInprocess)
{
flags &= ~FUNCFLAGnogcInprocess;
if (type == f)
f = cast(TypeFunction)f.copy();
f.isnogc = true;
}
flags &= ~FUNCFLAGreturnInprocess;
// reset deco to apply inference result to mangled name
if (f != type)
f.deco = null;
// Do semantic type AFTER pure/nothrow inference.
if (!f.deco && ident != Id.xopEquals && ident != Id.xopCmp)
{
sc = sc.push();
if (isCtorDeclaration()) // Bugzilla #15665
sc.flags |= SCOPEctor;
sc.stc = 0;
sc.linkage = linkage; // Bugzilla 8496
type = f.semantic(loc, sc);
sc = sc.pop();
}
/* If this function had instantiated with gagging, error reproduction will be
* done by TemplateInstance::semantic.
* Otherwise, error gagging should be temporarily ungagged by functionSemantic3.
*/
semanticRun = PASSsemantic3done;
semantic3Errors = (global.errors != oldErrors) || (fbody && fbody.isErrorStatement());
if (type.ty == Terror)
errors = true;
//printf("-FuncDeclaration::semantic3('%s.%s', sc = %p, loc = %s)\n", parent->toChars(), toChars(), sc, loc.toChars());
//fflush(stdout);
}
/****************************************************
* Resolve forward reference of function signature -
* parameter types, return type, and attributes.
* Returns false if any errors exist in the signature.
*/
final bool functionSemantic()
{
if (!_scope)
return !errors;
if (!originalType) // semantic not yet run
{
TemplateInstance spec = isSpeculative();
uint olderrs = global.errors;
uint oldgag = global.gag;
if (global.gag && !spec)
global.gag = 0;
semantic(_scope);
global.gag = oldgag;
if (spec && global.errors != olderrs)
spec.errors = (global.errors - olderrs != 0);
if (olderrs != global.errors) // if errors compiling this function
return false;
}
// if inferring return type, sematic3 needs to be run
// - When the function body contains any errors, we cannot assume
// the inferred return type is valid.
// So, the body errors should become the function signature error.
if (inferRetType && type && !type.nextOf())
return functionSemantic3();
TemplateInstance ti;
if (isInstantiated() && !isVirtualMethod() &&
!(ti = parent.isTemplateInstance(), ti && !ti.isTemplateMixin() && ti.tempdecl.ident != ident))
{
AggregateDeclaration ad = isMember2();
if (ad && ad.sizeok != SIZEOKdone)
{
/* Currently dmd cannot resolve forward references per methods,
* then setting SIZOKfwd is too conservative and would break existing code.
* So, just stop method attributes inference until ad->semantic() done.
*/
//ad->sizeok = SIZEOKfwd;
}
else
return functionSemantic3() || !errors;
}
if (storage_class & STCinference)
return functionSemantic3() || !errors;
return !errors;
}
/****************************************************
* Resolve forward reference of function body.
* Returns false if any errors exist in the body.
*/
final bool functionSemantic3()
{
if (semanticRun < PASSsemantic3 && _scope)
{
/* Forward reference - we need to run semantic3 on this function.
* If errors are gagged, and it's not part of a template instance,
* we need to temporarily ungag errors.
*/
TemplateInstance spec = isSpeculative();
uint olderrs = global.errors;
uint oldgag = global.gag;
if (global.gag && !spec)
global.gag = 0;
semantic3(_scope);
global.gag = oldgag;
// If it is a speculatively-instantiated template, and errors occur,
// we need to mark the template as having errors.
if (spec && global.errors != olderrs)
spec.errors = (global.errors - olderrs != 0);
if (olderrs != global.errors) // if errors compiling this function
return false;
}
return !errors && !semantic3Errors;
}
// called from semantic3
final VarDeclaration declareThis(Scope* sc, AggregateDeclaration ad)
{
if (ad && !isFuncLiteralDeclaration())
{
Type thandle = ad.handleType();
assert(thandle);
thandle = thandle.addMod(type.mod);
thandle = thandle.addStorageClass(storage_class);
VarDeclaration v = new ThisDeclaration(loc, thandle);
v.storage_class |= STCparameter;
if (thandle.ty == Tstruct)
{
v.storage_class |= STCref;
// if member function is marked 'inout', then 'this' is 'return ref'
if (type.ty == Tfunction && (cast(TypeFunction)type).iswild & 2)
v.storage_class |= STCreturn;
}
if (type.ty == Tfunction && (cast(TypeFunction)type).isreturn)
v.storage_class |= STCreturn;
v.semantic(sc);
if (!sc.insert(v))
assert(0);
v.parent = this;
return v;
}
if (isNested())
{
/* The 'this' for a nested function is the link to the
* enclosing function's stack frame.
* Note that nested functions and member functions are disjoint.
*/
VarDeclaration v = new ThisDeclaration(loc, Type.tvoid.pointerTo());
v.storage_class |= STCparameter;
v.semantic(sc);
if (!sc.insert(v))
assert(0);
v.parent = this;
return v;
}
return null;
}
override final bool equals(RootObject o)
{
if (this == o)
return true;
Dsymbol s = isDsymbol(o);
if (s)
{
FuncDeclaration fd1 = this;
FuncDeclaration fd2 = s.isFuncDeclaration();
if (!fd2)
return false;
FuncAliasDeclaration fa1 = fd1.isFuncAliasDeclaration();
FuncAliasDeclaration fa2 = fd2.isFuncAliasDeclaration();
if (fa1 && fa2)
{
return fa1.toAliasFunc().equals(fa2.toAliasFunc()) && fa1.hasOverloads == fa2.hasOverloads;
}
if (fa1 && (fd1 = fa1.toAliasFunc()).isUnique() && !fa1.hasOverloads)
fa1 = null;
if (fa2 && (fd2 = fa2.toAliasFunc()).isUnique() && !fa2.hasOverloads)
fa2 = null;
if ((fa1 !is null) != (fa2 !is null))
return false;
return fd1.toParent().equals(fd2.toParent()) && fd1.ident.equals(fd2.ident) && fd1.type.equals(fd2.type);
}
return false;
}
/****************************************************
* Determine if 'this' overrides fd.
* Return !=0 if it does.
*/
final int overrides(FuncDeclaration fd)
{
int result = 0;
if (fd.ident == ident)
{
int cov = type.covariant(fd.type);
if (cov)
{
ClassDeclaration cd1 = toParent().isClassDeclaration();
ClassDeclaration cd2 = fd.toParent().isClassDeclaration();
if (cd1 && cd2 && cd2.isBaseOf(cd1, null))
result = 1;
}
}
return result;
}
/*************************************************
* Find index of function in vtbl[0..dim] that
* this function overrides.
* Prefer an exact match to a covariant one.
* Returns:
* -1 didn't find one
* -2 can't determine because of forward references
*/
final int findVtblIndex(Dsymbols* vtbl, int dim)
{
FuncDeclaration mismatch = null;
StorageClass mismatchstc = 0;
int mismatchvi = -1;
int exactvi = -1;
int bestvi = -1;
for (int vi = 0; vi < dim; vi++)
{
FuncDeclaration fdv = (*vtbl)[vi].isFuncDeclaration();
if (fdv && fdv.ident == ident)
{
if (type.equals(fdv.type)) // if exact match
{
if (fdv.parent.isClassDeclaration())
return vi; // no need to look further
if (exactvi >= 0)
{
error("cannot determine overridden function");
return exactvi;
}
exactvi = vi;
bestvi = vi;
continue;
}
StorageClass stc = 0;
int cov = type.covariant(fdv.type, &stc);
//printf("\tbaseclass cov = %d\n", cov);
switch (cov)
{
case 0:
// types are distinct
break;
case 1:
bestvi = vi; // covariant, but not identical
break;
// keep looking for an exact match
case 2:
mismatchvi = vi;
mismatchstc = stc;
mismatch = fdv; // overrides, but is not covariant
break;
// keep looking for an exact match
case 3:
return -2; // forward references
default:
assert(0);
}
}
}
if (bestvi == -1 && mismatch)
{
//type->print();
//mismatch->type->print();
//printf("%s %s\n", type->deco, mismatch->type->deco);
//printf("stc = %llx\n", mismatchstc);
if (mismatchstc)
{
// Fix it by modifying the type to add the storage classes
type = type.addStorageClass(mismatchstc);
bestvi = mismatchvi;
}
}
return bestvi;
}
/*********************************
* If function a function in a base class,
* return that base class.
* Params:
* cd = class that function is in
* Returns:
* base class if overriding, null if not
*/
final BaseClass* overrideInterface()
{
ClassDeclaration cd = parent.isClassDeclaration();
foreach (b; cd.interfaces)
{
auto v = findVtblIndex(cast(Dsymbols*)&b.sym.vtbl, cast(int)b.sym.vtbl.dim);
if (v >= 0)
return b;
}
return null;
}
/****************************************************
* Overload this FuncDeclaration with the new one f.
* Return true if successful; i.e. no conflict.
*/
override bool overloadInsert(Dsymbol s)
{
//printf("FuncDeclaration::overloadInsert(s = %s) this = %s\n", s->toChars(), toChars());
assert(s != this);
AliasDeclaration ad = s.isAliasDeclaration();
if (ad)
{
if (overnext)
return overnext.overloadInsert(ad);
if (!ad.aliassym && ad.type.ty != Tident && ad.type.ty != Tinstance)
{
//printf("\tad = '%s'\n", ad->type->toChars());
return false;
}
overnext = ad;
//printf("\ttrue: no conflict\n");
return true;
}
TemplateDeclaration td = s.isTemplateDeclaration();
if (td)
{
if (!td.funcroot)
td.funcroot = this;
if (overnext)
return overnext.overloadInsert(td);
overnext = td;
return true;
}
FuncDeclaration fd = s.isFuncDeclaration();
if (!fd)
return false;
version (none)
{
/* Disable this check because:
* const void foo();
* semantic() isn't run yet on foo(), so the const hasn't been
* applied yet.
*/
if (type)
{
printf("type = %s\n", type.toChars());
printf("fd->type = %s\n", fd.type.toChars());
}
// fd->type can be NULL for overloaded constructors
if (type && fd.type && fd.type.covariant(type) && fd.type.mod == type.mod && !isFuncAliasDeclaration())
{
//printf("\tfalse: conflict %s\n", kind());
return false;
}
}
if (overnext)
{
td = overnext.isTemplateDeclaration();
if (td)
fd.overloadInsert(td);
else
return overnext.overloadInsert(fd);
}
overnext = fd;
//printf("\ttrue: no conflict\n");
return true;
}
/********************************************
* Find function in overload list that exactly matches t.
*/
final FuncDeclaration overloadExactMatch(Type t)
{
FuncDeclaration fd;
overloadApply(this, (Dsymbol s)
{
auto f = s.isFuncDeclaration();
if (!f)
return 0;
if (t.equals(f.type))
{
fd = f;
return 1;
}
/* Allow covariant matches, as long as the return type
* is just a const conversion.
* This allows things like pure functions to match with an impure function type.
*/
if (t.ty == Tfunction)
{
auto tf = cast(TypeFunction)f.type;
if (tf.covariant(t) == 1 &&
tf.nextOf().implicitConvTo(t.nextOf()) >= MATCHconst)
{
fd = f;
return 1;
}
}
return 0;
});
return fd;
}
/********************************************
* Find function in overload list that matches to the 'this' modifier.
* There's four result types.
*
* 1. If the 'tthis' matches only one candidate, it's an "exact match".
* Returns the function and 'hasOverloads' is set to false.
* eg. If 'tthis" is mutable and there's only one mutable method.
* 2. If there's two or more match candidates, but a candidate function will be
* a "better match".
* Returns the better match function but 'hasOverloads' is set to true.
* eg. If 'tthis' is mutable, and there's both mutable and const methods,
* the mutable method will be a better match.
* 3. If there's two or more match candidates, but there's no better match,
* Returns null and 'hasOverloads' is set to true to represent "ambiguous match".
* eg. If 'tthis' is mutable, and there's two or more mutable methods.
* 4. If there's no candidates, it's "no match" and returns null with error report.
* e.g. If 'tthis' is const but there's no const methods.
*/
final FuncDeclaration overloadModMatch(Loc loc, Type tthis, ref bool hasOverloads)
{
//printf("FuncDeclaration::overloadModMatch('%s')\n", toChars());
Match m;
m.last = MATCHnomatch;
overloadApply(this, (Dsymbol s)
{
auto f = s.isFuncDeclaration();
if (!f || f == m.lastf) // skip duplicates
return 0;
m.anyf = f;
auto tf = cast(TypeFunction)f.type;
//printf("tf = %s\n", tf->toChars());
MATCH match;
if (tthis) // non-static functions are preferred than static ones
{
if (f.needThis())
match = f.isCtorDeclaration() ? MATCHexact : MODmethodConv(tthis.mod, tf.mod);
else
match = MATCHconst; // keep static funciton in overload candidates
}
else // static functions are preferred than non-static ones
{
if (f.needThis())
match = MATCHconvert;
else
match = MATCHexact;
}
if (match == MATCHnomatch)
return 0;
if (match > m.last) goto LcurrIsBetter;
if (match < m.last) goto LlastIsBetter;
// See if one of the matches overrides the other.
if (m.lastf.overrides(f)) goto LlastIsBetter;
if (f.overrides(m.lastf)) goto LcurrIsBetter;
Lambiguous:
//printf("\tambiguous\n");
m.nextf = f;
m.count++;
return 0;
LlastIsBetter:
//printf("\tlastbetter\n");
m.count++; // count up
return 0;
LcurrIsBetter:
//printf("\tisbetter\n");
if (m.last <= MATCHconvert)
{
// clear last secondary matching
m.nextf = null;
m.count = 0;
}
m.last = match;
m.lastf = f;
m.count++; // count up
return 0;
});
if (m.count == 1) // exact match
{
hasOverloads = false;
}
else if (m.count > 1) // better or ambiguous match
{
hasOverloads = true;
}
else // no match
{
hasOverloads = true;
auto tf = cast(TypeFunction)this.type;
assert(tthis);
assert(!MODimplicitConv(tthis.mod, tf.mod)); // modifier mismatch
{
OutBuffer thisBuf, funcBuf;
MODMatchToBuffer(&thisBuf, tthis.mod, tf.mod);
MODMatchToBuffer(&funcBuf, tf.mod, tthis.mod);
.error(loc, "%smethod %s is not callable using a %sobject",
funcBuf.peekString(), this.toPrettyChars(), thisBuf.peekString());
}
}
return m.lastf;
}
/********************************************
* find function template root in overload list
*/
final TemplateDeclaration findTemplateDeclRoot()
{
FuncDeclaration f = this;
while (f && f.overnext)
{
//printf("f->overnext = %p %s\n", f->overnext, f->overnext->toChars());
TemplateDeclaration td = f.overnext.isTemplateDeclaration();
if (td)
return td;
f = f.overnext.isFuncDeclaration();
}
return null;
}
/********************************************
* Returns true if function was declared
* directly or indirectly in a unittest block
*/
final bool inUnittest()
{
Dsymbol f = this;
do
{
if (f.isUnitTestDeclaration())
return true;
f = f.toParent();
}
while (f);
return false;
}
/*************************************
* Determine partial specialization order of 'this' vs g.
* This is very similar to TemplateDeclaration::leastAsSpecialized().
* Returns:
* match 'this' is at least as specialized as g
* 0 g is more specialized than 'this'
*/
final MATCH leastAsSpecialized(FuncDeclaration g)
{
enum LOG_LEASTAS = 0;
static if (LOG_LEASTAS)
{
printf("%s.leastAsSpecialized(%s)\n", toChars(), g.toChars());
printf("%s, %s\n", type.toChars(), g.type.toChars());
}
/* This works by calling g() with f()'s parameters, and
* if that is possible, then f() is at least as specialized
* as g() is.
*/
TypeFunction tf = cast(TypeFunction)type;
TypeFunction tg = cast(TypeFunction)g.type;
size_t nfparams = Parameter.dim(tf.parameters);
/* If both functions have a 'this' pointer, and the mods are not
* the same and g's is not const, then this is less specialized.
*/
if (needThis() && g.needThis() && tf.mod != tg.mod)
{
if (isCtorDeclaration())
{
if (!MODimplicitConv(tg.mod, tf.mod))
return MATCHnomatch;
}
else
{
if (!MODimplicitConv(tf.mod, tg.mod))
return MATCHnomatch;
}
}
/* Create a dummy array of arguments out of the parameters to f()
*/
Expressions args;
args.setDim(nfparams);
for (size_t u = 0; u < nfparams; u++)
{
Parameter p = Parameter.getNth(tf.parameters, u);
Expression e;
if (p.storageClass & (STCref | STCout))
{
e = new IdentifierExp(Loc(), p.ident);
e.type = p.type;
}
else
e = p.type.defaultInitLiteral(Loc());
args[u] = e;
}
MATCH m = cast(MATCH)tg.callMatch(null, &args, 1);
if (m > MATCHnomatch)
{
/* A variadic parameter list is less specialized than a
* non-variadic one.
*/
if (tf.varargs && !tg.varargs)
goto L1;
// less specialized
static if (LOG_LEASTAS)
{
printf(" matches %d, so is least as specialized\n", m);
}
return m;
}
L1:
static if (LOG_LEASTAS)
{
printf(" doesn't match, so is not as specialized\n");
}
return MATCHnomatch;
}
/********************************
* Labels are in a separate scope, one per function.
*/
final LabelDsymbol searchLabel(Identifier ident)
{
Dsymbol s;
if (!labtab)
labtab = new DsymbolTable(); // guess we need one
s = labtab.lookup(ident);
if (!s)
{
s = new LabelDsymbol(ident);
labtab.insert(s);
}
return cast(LabelDsymbol)s;
}
/****************************************
* If non-static member function that has a 'this' pointer,
* return the aggregate it is a member of.
* Otherwise, return NULL.
*/
override AggregateDeclaration isThis()
{
//printf("+FuncDeclaration::isThis() '%s'\n", toChars());
AggregateDeclaration ad = null;
if ((storage_class & STCstatic) == 0 && !isFuncLiteralDeclaration())
{
ad = isMember2();
}
//printf("-FuncDeclaration::isThis() %p\n", ad);
return ad;
}
final AggregateDeclaration isMember2()
{
//printf("+FuncDeclaration::isMember2() '%s'\n", toChars());
AggregateDeclaration ad = null;
for (Dsymbol s = this; s; s = s.parent)
{
//printf("\ts = '%s', parent = '%s', kind = %s\n", s->toChars(), s->parent->toChars(), s->parent->kind());
ad = s.isMember();
if (ad)
{
break;
}
if (!s.parent || (!s.parent.isTemplateInstance()))
{
break;
}
}
//printf("-FuncDeclaration::isMember2() %p\n", ad);
return ad;
}
/*****************************************
* Determine lexical level difference from 'this' to nested function 'fd'.
* Error if this cannot call fd.
* Returns:
* 0 same level
* >0 decrease nesting by number
* -1 increase nesting by 1 (fd is nested within 'this')
* -2 error
*/
final int getLevel(Loc loc, Scope* sc, FuncDeclaration fd)
{
int level;
Dsymbol s;
Dsymbol fdparent;
//printf("FuncDeclaration::getLevel(fd = '%s')\n", fd.toChars());
fdparent = fd.toParent2();
if (fdparent == this)
return -1;
s = this;
level = 0;
while (fd != s && fdparent != s.toParent2())
{
//printf("\ts = %s, '%s'\n", s.kind(), s.toChars());
FuncDeclaration thisfd = s.isFuncDeclaration();
if (thisfd)
{
if (!thisfd.isNested() && !thisfd.vthis && !sc.intypeof)
goto Lerr;
}
else
{
AggregateDeclaration thiscd = s.isAggregateDeclaration();
if (thiscd)
{
/* AggregateDeclaration::isNested returns true only when
* it has a hidden pointer.
* But, calling the function belongs unrelated lexical scope
* is still allowed inside typeof.
*
* struct Map(alias fun) {
* typeof({ return fun(); }) RetType;
* // No member function makes Map struct 'not nested'.
* }
*/
if (!thiscd.isNested() && !sc.intypeof)
goto Lerr;
}
else
goto Lerr;
}
s = s.toParent2();
assert(s);
level++;
}
return level;
Lerr:
// Don't give error if in template constraint
if (!(sc.flags & SCOPEconstraint))
{
const(char)* xstatic = isStatic() ? "static " : "";
// better diagnostics for static functions
.error(loc, "%s%s %s cannot access frame of function %s", xstatic, kind(), toPrettyChars(), fd.toPrettyChars());
return -2;
}
return 1;
}
override const(char)* toPrettyChars(bool QualifyTypes = false)
{
if (isMain())
return "D main";
else
return Dsymbol.toPrettyChars(QualifyTypes);
}
/** for diagnostics, e.g. 'int foo(int x, int y) pure' */
final const(char)* toFullSignature()
{
OutBuffer buf;
functionToBufferWithIdent(cast(TypeFunction)type, &buf, toChars());
return buf.extractString();
}
final bool isMain()
{
return ident == Id.main && linkage != LINKc && !isMember() && !isNested();
}
final bool isCMain()
{
return ident == Id.main && linkage == LINKc && !isMember() && !isNested();
}
final bool isWinMain()
{
//printf("FuncDeclaration::isWinMain() %s\n", toChars());
version (none)
{
bool x = ident == Id.WinMain && linkage != LINKc && !isMember();
printf("%s\n", x ? "yes" : "no");
return x;
}
else
{
return ident == Id.WinMain && linkage != LINKc && !isMember();
}
}
final bool isDllMain()
{
return ident == Id.DllMain && linkage != LINKc && !isMember();
}
override final bool isExport()
{
return protection.kind == PROTexport;
}
override final bool isImportedSymbol()
{
//printf("isImportedSymbol()\n");
//printf("protection = %d\n", protection);
return (protection.kind == PROTexport) && !fbody;
}
override final bool isCodeseg()
{
return true; // functions are always in the code segment
}
override final bool isOverloadable()
{
return true; // functions can be overloaded
}
final PURE isPure()
{
//printf("FuncDeclaration::isPure() '%s'\n", toChars());
assert(type.ty == Tfunction);
TypeFunction tf = cast(TypeFunction)type;
if (flags & FUNCFLAGpurityInprocess)
setImpure();
if (tf.purity == PUREfwdref)
tf.purityLevel();
PURE purity = tf.purity;
if (purity > PUREweak && isNested())
purity = PUREweak;
if (purity > PUREweak && needThis())
{
// The attribute of the 'this' reference affects purity strength
if (type.mod & MODimmutable)
{
}
else if (type.mod & (MODconst | MODwild) && purity >= PUREconst)
purity = PUREconst;
else
purity = PUREweak;
}
tf.purity = purity;
// ^ This rely on the current situation that every FuncDeclaration has a
// unique TypeFunction.
return purity;
}
final PURE isPureBypassingInference()
{
if (flags & FUNCFLAGpurityInprocess)
return PUREfwdref;
else
return isPure();
}
/**************************************
* The function is doing something impure,
* so mark it as impure.
* If there's a purity error, return true.
*/
final bool setImpure()
{
if (flags & FUNCFLAGpurityInprocess)
{
flags &= ~FUNCFLAGpurityInprocess;
if (fes)
fes.func.setImpure();
}
else if (isPure())
return true;
return false;
}
final bool isSafe()
{
assert(type.ty == Tfunction);
if (flags & FUNCFLAGsafetyInprocess)
setUnsafe();
return (cast(TypeFunction)type).trust == TRUSTsafe;
}
final bool isSafeBypassingInference()
{
return !(flags & FUNCFLAGsafetyInprocess) && isSafe();
}
final bool isTrusted()
{
assert(type.ty == Tfunction);
if (flags & FUNCFLAGsafetyInprocess)
setUnsafe();
return (cast(TypeFunction)type).trust == TRUSTtrusted;
}
/**************************************
* The function is doing something unsave,
* so mark it as unsafe.
* If there's a safe error, return true.
*/
final bool setUnsafe()
{
if (flags & FUNCFLAGsafetyInprocess)
{
flags &= ~FUNCFLAGsafetyInprocess;
(cast(TypeFunction)type).trust = TRUSTsystem;
if (fes)
fes.func.setUnsafe();
}
else if (isSafe())
return true;
return false;
}
final bool isNogc()
{
assert(type.ty == Tfunction);
if (flags & FUNCFLAGnogcInprocess)
setGC();
return (cast(TypeFunction)type).isnogc;
}
final bool isNogcBypassingInference()
{
return !(flags & FUNCFLAGnogcInprocess) && isNogc();
}
/**************************************
* The function is doing something that may allocate with the GC,
* so mark it as not nogc (not no-how).
* Returns:
* true if function is marked as @nogc, meaning a user error occurred
*/
final bool setGC()
{
if (flags & FUNCFLAGnogcInprocess)
{
flags &= ~FUNCFLAGnogcInprocess;
(cast(TypeFunction)type).isnogc = false;
if (fes)
fes.func.setGC();
}
else if (isNogc())
return true;
return false;
}
final void printGCUsage(Loc loc, const(char)* warn)
{
if (!global.params.vgc)
return;
Module m = getModule();
if (m && m.isRoot() && !inUnittest())
{
fprintf(global.stdmsg, "%s: vgc: %s\n", loc.toChars(), warn);
}
}
/********************************************
* Returns true if the function return value has no indirection
* which comes from the parameters.
*/
final bool isolateReturn()
{
assert(type.ty == Tfunction);
TypeFunction tf = cast(TypeFunction)type;
assert(tf.next);
Type treti = tf.next;
treti = tf.isref ? treti : getIndirection(treti);
if (!treti)
return true; // target has no mutable indirection
return parametersIntersect(treti);
}
/********************************************
* Returns true if an object typed t can have indirections
* which come from the parameters.
*/
final bool parametersIntersect(Type t)
{
assert(t);
if (!isPureBypassingInference() || isNested())
return false;
assert(type.ty == Tfunction);
TypeFunction tf = cast(TypeFunction)type;
//printf("parametersIntersect(%s) t = %s\n", tf->toChars(), t->toChars());
size_t dim = Parameter.dim(tf.parameters);
for (size_t i = 0; i < dim; i++)
{
Parameter fparam = Parameter.getNth(tf.parameters, i);
if (!fparam.type)
continue;
Type tprmi = (fparam.storageClass & (STClazy | STCout | STCref)) ? fparam.type : getIndirection(fparam.type);
if (!tprmi)
continue;
// there is no mutable indirection
//printf("\t[%d] tprmi = %d %s\n", i, tprmi->ty, tprmi->toChars());
if (traverseIndirections(tprmi, t))
return false;
}
if (AggregateDeclaration ad = isCtorDeclaration() ? null : isThis())
{
Type tthis = ad.getType().addMod(tf.mod);
//printf("\ttthis = %s\n", tthis->toChars());
if (traverseIndirections(tthis, t))
return false;
}
return true;
}
// Determine if function needs
// a static frame pointer to its lexically enclosing function
bool isNested()
{
FuncDeclaration f = toAliasFunc();
//printf("\ttoParent2() = '%s'\n", f->toParent2()->toChars());
return ((f.storage_class & STCstatic) == 0) && (f.linkage == LINKd) && (f.toParent2().isFuncDeclaration() !is null);
}
override final bool needThis()
{
//printf("FuncDeclaration::needThis() '%s'\n", toChars());
return toAliasFunc().isThis() !is null;
}
// Determine if a function is pedantically virtual
final bool isVirtualMethod()
{
if (toAliasFunc() != this)
return toAliasFunc().isVirtualMethod();
//printf("FuncDeclaration::isVirtualMethod() %s\n", toChars());
if (!isVirtual())
return false;
// If it's a final method, and does not override anything, then it is not virtual
if (isFinalFunc() && foverrides.dim == 0)
{
return false;
}
return true;
}
// Determine if function goes into virtual function pointer table
bool isVirtual()
{
if (toAliasFunc() != this)
return toAliasFunc().isVirtual();
Dsymbol p = toParent();
version (none)
{
printf("FuncDeclaration::isVirtual(%s)\n", toChars());
printf("isMember:%p isStatic:%d private:%d ctor:%d !Dlinkage:%d\n", isMember(), isStatic(), protection == PROTprivate, isCtorDeclaration(), linkage != LINKd);
printf("result is %d\n", isMember() && !(isStatic() || protection == PROTprivate || protection == PROTpackage) && p.isClassDeclaration() && !(p.isInterfaceDeclaration() && isFinalFunc()));
}
return isMember() && !(isStatic() || protection.kind == PROTprivate || protection.kind == PROTpackage) && p.isClassDeclaration() && !(p.isInterfaceDeclaration() && isFinalFunc());
}
bool isFinalFunc()
{
if (toAliasFunc() != this)
return toAliasFunc().isFinalFunc();
ClassDeclaration cd;
version (none)
{
printf("FuncDeclaration::isFinalFunc(%s), %x\n", toChars(), Declaration.isFinal());
printf("%p %d %d %d\n", isMember(), isStatic(), Declaration.isFinal(), ((cd = toParent().isClassDeclaration()) !is null && cd.storage_class & STCfinal));
printf("result is %d\n", isMember() && (Declaration.isFinal() || ((cd = toParent().isClassDeclaration()) !is null && cd.storage_class & STCfinal)));
if (cd)
printf("\tmember of %s\n", cd.toChars());
}
return isMember() && (Declaration.isFinal() || ((cd = toParent().isClassDeclaration()) !is null && cd.storage_class & STCfinal));
}
bool addPreInvariant()
{
AggregateDeclaration ad = isThis();
ClassDeclaration cd = ad ? ad.isClassDeclaration() : null;
return (ad && !(cd && cd.isCPPclass()) && global.params.useInvariants && (protection.kind == PROTprotected || protection.kind == PROTpublic || protection.kind == PROTexport) && !naked);
}
bool addPostInvariant()
{
AggregateDeclaration ad = isThis();
ClassDeclaration cd = ad ? ad.isClassDeclaration() : null;
return (ad && !(cd && cd.isCPPclass()) && ad.inv && global.params.useInvariants && (protection.kind == PROTprotected || protection.kind == PROTpublic || protection.kind == PROTexport) && !naked);
}
override const(char)* kind() const
{
return "function";
}
/********************************************
* If there are no overloads of function f, return that function,
* otherwise return NULL.
*/
final FuncDeclaration isUnique()
{
FuncDeclaration result = null;
overloadApply(this, (Dsymbol s)
{
auto f = s.isFuncDeclaration();
if (!f)
return 0;
if (result)
{
result = null;
return 1; // ambiguous, done
}
else
{
result = f;
return 0;
}
});
return result;
}
/*********************************************
* In the current function, we are calling 'this' function.
* 1. Check to see if the current function can call 'this' function, issue error if not.
* 2. If the current function is not the parent of 'this' function, then add
* the current function to the list of siblings of 'this' function.
* 3. If the current function is a literal, and it's accessing an uplevel scope,
* then mark it as a delegate.
* Returns true if error occurs.
*/
final bool checkNestedReference(Scope* sc, Loc loc)
{
//printf("FuncDeclaration::checkNestedReference() %s\n", toPrettyChars());
if (auto fld = this.isFuncLiteralDeclaration())
{
if (fld.tok == TOKreserved)
{
fld.tok = TOKfunction;
fld.vthis = null;
}
}
if (!parent || parent == sc.parent)
return false;
if (ident == Id.require || ident == Id.ensure)
return false;
if (!isThis() && !isNested())
return false;
// The current function
FuncDeclaration fdthis = sc.parent.isFuncDeclaration();
if (!fdthis)
return false; // out of function scope
Dsymbol p = toParent2();
// Function literals from fdthis to p must be delegates
checkNestedRef(fdthis, p);
if (isNested())
{
// The function that this function is in
FuncDeclaration fdv = p.isFuncDeclaration();
if (!fdv)
return false;
if (fdv == fdthis)
return false;
//printf("this = %s in [%s]\n", this.toChars(), this.loc.toChars());
//printf("fdv = %s in [%s]\n", fdv .toChars(), fdv .loc.toChars());
//printf("fdthis = %s in [%s]\n", fdthis.toChars(), fdthis.loc.toChars());
// Add this function to the list of those which called us
if (fdthis != this)
{
bool found = false;
for (size_t i = 0; i < siblingCallers.dim; ++i)
{
if (siblingCallers[i] == fdthis)
found = true;
}
if (!found)
{
//printf("\tadding sibling %s\n", fdthis.toPrettyChars());
if (!sc.intypeof && !(sc.flags & SCOPEcompile))
siblingCallers.push(fdthis);
}
}
int lv = fdthis.getLevel(loc, sc, fdv);
if (lv == -2)
return true; // error
if (lv == -1)
return false; // downlevel call
if (lv == 0)
return false; // same level call
// Uplevel call
}
return false;
}
/*******************************
* Look at all the variables in this function that are referenced
* by nested functions, and determine if a closure needs to be
* created for them.
*/
final bool needsClosure()
{
/* Need a closure for all the closureVars[] if any of the
* closureVars[] are accessed by a
* function that escapes the scope of this function.
* We take the conservative approach and decide that a function needs
* a closure if it:
* 1) is a virtual function
* 2) has its address taken
* 3) has a parent that escapes
* 4) calls another nested function that needs a closure
* -or-
* 5) this function returns a local struct/class
*
* Note that since a non-virtual function can be called by
* a virtual one, if that non-virtual function accesses a closure
* var, the closure still has to be taken. Hence, we check for isThis()
* instead of isVirtual(). (thanks to David Friedman)
*/
//printf("FuncDeclaration::needsClosure() %s\n", toChars());
if (requiresClosure)
goto Lyes;
for (size_t i = 0; i < closureVars.dim; i++)
{
VarDeclaration v = closureVars[i];
//printf("\tv = %s\n", v->toChars());
for (size_t j = 0; j < v.nestedrefs.dim; j++)
{
FuncDeclaration f = v.nestedrefs[j];
assert(f != this);
//printf("\t\tf = %s, isVirtual=%d, isThis=%p, tookAddressOf=%d\n", f->toChars(), f->isVirtual(), f->isThis(), f->tookAddressOf);
/* Look to see if f escapes. We consider all parents of f within
* this, and also all siblings which call f; if any of them escape,
* so does f.
* Mark all affected functions as requiring closures.
*/
for (Dsymbol s = f; s && s != this; s = s.parent)
{
FuncDeclaration fx = s.isFuncDeclaration();
if (!fx)
continue;
if (fx.isThis() || fx.tookAddressOf)
{
//printf("\t\tfx = %s, isVirtual=%d, isThis=%p, tookAddressOf=%d\n", fx->toChars(), fx->isVirtual(), fx->isThis(), fx->tookAddressOf);
/* Mark as needing closure any functions between this and f
*/
markAsNeedingClosure((fx == f) ? fx.parent : fx, this);
requiresClosure = true;
}
/* We also need to check if any sibling functions that
* called us, have escaped. This is recursive: we need
* to check the callers of our siblings.
*/
if (checkEscapingSiblings(fx, this))
requiresClosure = true;
/* Bugzilla 12406: Iterate all closureVars to mark all descendant
* nested functions that access to the closing context of this funciton.
*/
}
}
}
if (requiresClosure)
goto Lyes;
/* Look for case (5)
*/
if (closureVars.dim)
{
assert(type.ty == Tfunction);
Type tret = (cast(TypeFunction)type).next;
assert(tret);
tret = tret.toBasetype();
//printf("\t\treturning %s\n", tret->toChars());
if (tret.ty == Tclass || tret.ty == Tstruct)
{
Dsymbol st = tret.toDsymbol(null);
//printf("\t\treturning class/struct %s\n", tret->toChars());
for (Dsymbol s = st.parent; s; s = s.parent)
{
//printf("\t\t\tparent = %s %s\n", s->kind(), s->toChars());
if (s == this)
{
//printf("\t\treturning local %s\n", st->toChars());
goto Lyes;
}
}
}
}
return false;
Lyes:
//printf("\tneeds closure\n");
return true;
}
/***********************************************
* Check that the function contains any closure.
* If it's @nogc, report suitable errors.
* This is mostly consistent with FuncDeclaration::needsClosure().
*
* Returns:
* true if any errors occur.
*/
final bool checkClosure()
{
if (!needsClosure())
return false;
if (setGC())
{
error("is @nogc yet allocates closures with the GC");
if (global.gag) // need not report supplemental errors
return true;
}
else
{
printGCUsage(loc, "using closure causes GC allocation");
return false;
}
FuncDeclarations a;
foreach (v; closureVars)
{
foreach (f; v.nestedrefs)
{
assert(f !is this);
LcheckAncestorsOfANestedRef:
for (Dsymbol s = f; s && s !is this; s = s.parent)
{
auto fx = s.isFuncDeclaration();
if (!fx)
continue;
if (fx.isThis() ||
fx.tookAddressOf ||
checkEscapingSiblings(fx, this))
{
foreach (f2; a)
{
if (f2 == f)
break LcheckAncestorsOfANestedRef;
}
a.push(f);
.errorSupplemental(f.loc, "%s closes over variable %s at %s",
f.toPrettyChars(), v.toChars(), v.loc.toChars());
break LcheckAncestorsOfANestedRef;
}
}
}
}
return true;
}
/***********************************************
* Determine if function's variables are referenced by a function
* nested within it.
*/
final bool hasNestedFrameRefs()
{
if (closureVars.dim)
return true;
/* If a virtual function has contracts, assume its variables are referenced
* by those contracts, even if they aren't. Because they might be referenced
* by the overridden or overriding function's contracts.
* This can happen because frequire and fensure are implemented as nested functions,
* and they can be called directly by an overriding function and the overriding function's
* context had better match, or Bugzilla 7335 will bite.
*/
if (fdrequire || fdensure)
return true;
if (foverrides.dim && isVirtualMethod())
{
for (size_t i = 0; i < foverrides.dim; i++)
{
FuncDeclaration fdv = foverrides[i];
if (fdv.hasNestedFrameRefs())
return true;
}
}
return false;
}
/****************************************************
* Declare result variable lazily.
*/
final void buildResultVar(Scope* sc, Type tret)
{
if (!vresult)
{
Loc loc = fensure ? fensure.loc : this.loc;
/* If inferRetType is true, tret may not be a correct return type yet.
* So, in here it may be a temporary type for vresult, and after
* fbody->semantic() running, vresult->type might be modified.
*/
vresult = new VarDeclaration(loc, tret, outId ? outId : Id.result, null);
vresult.noscope = true;
if (outId == Id.result)
vresult.storage_class |= STCtemp;
if (!isVirtual())
vresult.storage_class |= STCconst;
vresult.storage_class |= STCresult;
// set before the semantic() for checkNestedReference()
vresult.parent = this;
}
if (sc && vresult.sem == SemanticStart)
{
assert(type.ty == Tfunction);
TypeFunction tf = cast(TypeFunction)type;
if (tf.isref)
vresult.storage_class |= STCref | STCforeach;
vresult.type = tret;
vresult.semantic(sc);
if (!sc.insert(vresult))
error("out result %s is already defined", vresult.toChars());
assert(vresult.parent == this);
}
}
/****************************************************
* Merge into this function the 'in' contracts of all it overrides.
* 'in's are OR'd together, i.e. only one of them needs to pass.
*/
final Statement mergeFrequire(Statement sf)
{
/* If a base function and its override both have an IN contract, then
* only one of them needs to succeed. This is done by generating:
*
* void derived.in() {
* try {
* base.in();
* }
* catch () {
* ... body of derived.in() ...
* }
* }
*
* So if base.in() doesn't throw, derived.in() need not be executed, and the contract is valid.
* If base.in() throws, then derived.in()'s body is executed.
*/
/* Implementing this is done by having the overriding function call
* nested functions (the fdrequire functions) nested inside the overridden
* function. This requires that the stack layout of the calling function's
* parameters and 'this' pointer be in the same place (as the nested
* function refers to them).
* This is easy for the parameters, as they are all on the stack in the same
* place by definition, since it's an overriding function. The problem is
* getting the 'this' pointer in the same place, since it is a local variable.
* We did some hacks in the code generator to make this happen:
* 1. always generate exception handler frame, or at least leave space for it
* in the frame (Windows 32 SEH only)
* 2. always generate an EBP style frame
* 3. since 'this' is passed in a register that is subsequently copied into
* a stack local, allocate that local immediately following the exception
* handler block, so it is always at the same offset from EBP.
*/
for (size_t i = 0; i < foverrides.dim; i++)
{
FuncDeclaration fdv = foverrides[i];
/* The semantic pass on the contracts of the overridden functions must
* be completed before code generation occurs (bug 3602).
*/
if (fdv.fdrequire && fdv.fdrequire.semanticRun != PASSsemantic3done)
{
assert(fdv._scope);
Scope* sc = fdv._scope.push();
sc.stc &= ~STCoverride;
fdv.semantic3(sc);
sc.pop();
}
sf = fdv.mergeFrequire(sf);
if (sf && fdv.fdrequire)
{
//printf("fdv->frequire: %s\n", fdv->frequire->toChars());
/* Make the call:
* try { __require(); }
* catch { frequire; }
*/
Expression eresult = null;
Expression e = new CallExp(loc, new VarExp(loc, fdv.fdrequire, false), eresult);
Statement s2 = new ExpStatement(loc, e);
auto c = new Catch(loc, null, null, sf);
c.internalCatch = true;
auto catches = new Catches();
catches.push(c);
sf = new TryCatchStatement(loc, s2, catches);
}
else
return null;
}
return sf;
}
/****************************************************
* Merge into this function the 'out' contracts of all it overrides.
* 'out's are AND'd together, i.e. all of them need to pass.
*/
final Statement mergeFensure(Statement sf, Identifier oid)
{
/* Same comments as for mergeFrequire(), except that we take care
* of generating a consistent reference to the 'result' local by
* explicitly passing 'result' to the nested function as a reference
* argument.
* This won't work for the 'this' parameter as it would require changing
* the semantic code for the nested function so that it looks on the parameter
* list for the 'this' pointer, something that would need an unknown amount
* of tweaking of various parts of the compiler that I'd rather leave alone.
*/
for (size_t i = 0; i < foverrides.dim; i++)
{
FuncDeclaration fdv = foverrides[i];
/* The semantic pass on the contracts of the overridden functions must
* be completed before code generation occurs (bug 3602 and 5230).
*/
if (fdv.fdensure && fdv.fdensure.semanticRun != PASSsemantic3done)
{
assert(fdv._scope);
Scope* sc = fdv._scope.push();
sc.stc &= ~STCoverride;
fdv.semantic3(sc);
sc.pop();
}
sf = fdv.mergeFensure(sf, oid);
if (fdv.fdensure)
{
//printf("fdv->fensure: %s\n", fdv->fensure->toChars());
// Make the call: __ensure(result)
Expression eresult = null;
if (outId)
{
eresult = new IdentifierExp(loc, oid);
Type t1 = fdv.type.nextOf().toBasetype();
Type t2 = this.type.nextOf().toBasetype();
if (t1.isBaseOf(t2, null))
{
/* Making temporary reference variable is necessary
* in covariant return.
* See bugzilla 5204 and 10479.
*/
auto ei = new ExpInitializer(Loc(), eresult);
auto v = new VarDeclaration(Loc(), t1, Identifier.generateId("__covres"), ei);
v.storage_class |= STCtemp;
auto de = new DeclarationExp(Loc(), v);
auto ve = new VarExp(Loc(), v);
eresult = new CommaExp(Loc(), de, ve);
}
}
Expression e = new CallExp(loc, new VarExp(loc, fdv.fdensure, false), eresult);
Statement s2 = new ExpStatement(loc, e);
if (sf)
{
sf = new CompoundStatement(sf.loc, s2, sf);
}
else
sf = s2;
}
}
return sf;
}
/*********************************************
* Return the function's parameter list, and whether
* it is variadic or not.
*/
final Parameters* getParameters(int* pvarargs)
{
Parameters* fparameters = null;
int fvarargs = 0;
if (type)
{
assert(type.ty == Tfunction);
TypeFunction fdtype = cast(TypeFunction)type;
fparameters = fdtype.parameters;
fvarargs = fdtype.varargs;
}
if (pvarargs)
*pvarargs = fvarargs;
return fparameters;
}
/**********************************
* Generate a FuncDeclaration for a runtime library function.
*/
final static FuncDeclaration genCfunc(Parameters* fparams, Type treturn, const(char)* name, StorageClass stc = 0)
{
return genCfunc(fparams, treturn, Identifier.idPool(name), stc);
}
final static FuncDeclaration genCfunc(Parameters* fparams, Type treturn, Identifier id, StorageClass stc = 0)
{
FuncDeclaration fd;
TypeFunction tf;
Dsymbol s;
static __gshared DsymbolTable st = null;
//printf("genCfunc(name = '%s')\n", id->toChars());
//printf("treturn\n\t"); treturn->print();
// See if already in table
if (!st)
st = new DsymbolTable();
s = st.lookup(id);
if (s)
{
fd = s.isFuncDeclaration();
assert(fd);
assert(fd.type.nextOf().equals(treturn));
}
else
{
tf = new TypeFunction(fparams, treturn, 0, LINKc, stc);
fd = new FuncDeclaration(Loc(), Loc(), id, STCstatic, tf);
fd.protection = Prot(PROTpublic);
fd.linkage = LINKc;
st.insert(fd);
}
return fd;
}
override final inout(FuncDeclaration) isFuncDeclaration() inout
{
return this;
}
FuncDeclaration toAliasFunc()
{
return this;
}
override void accept(Visitor v)
{
v.visit(this);
}
}
/********************************************************
* Generate Expression to call the invariant.
* Input:
* ad aggregate with the invariant
* vthis variable with 'this'
* direct call invariant directly
* Returns:
* void expression that calls the invariant
*/
extern (C++) Expression addInvariant(Loc loc, Scope* sc, AggregateDeclaration ad, VarDeclaration vthis, bool direct)
{
Expression e = null;
if (direct)
{
// Call invariant directly only if it exists
FuncDeclaration inv = ad.inv;
ClassDeclaration cd = ad.isClassDeclaration();
while (!inv && cd)
{
cd = cd.baseClass;
if (!cd)
break;
inv = cd.inv;
}
if (inv)
{
version (all)
{
// Workaround for bugzilla 13394: For the correct mangling,
// run attribute inference on inv if needed.
inv.functionSemantic();
}
//e = new DsymbolExp(Loc(), inv);
//e = new CallExp(Loc(), e);
//e = e->semantic(sc2);
/* Bugzilla 13113: Currently virtual invariant calls completely
* bypass attribute enforcement.
* Change the behavior of pre-invariant call by following it.
*/
e = new ThisExp(Loc());
e.type = vthis.type;
e = new DotVarExp(Loc(), e, inv, false);
e.type = inv.type;
e = new CallExp(Loc(), e);
e.type = Type.tvoid;
}
}
else
{
version (all)
{
// Workaround for bugzilla 13394: For the correct mangling,
// run attribute inference on inv if needed.
if (ad.isStructDeclaration() && ad.inv)
ad.inv.functionSemantic();
}
// Call invariant virtually
Expression v = new ThisExp(Loc());
v.type = vthis.type;
if (ad.isStructDeclaration())
v = v.addressOf();
e = new StringExp(Loc(), cast(char*)"null this");
e = new AssertExp(loc, v, e);
e = e.semantic(sc);
}
return e;
}
/***************************************************
* Visit each overloaded function/template in turn, and call dg(s) on it.
* Exit when no more, or dg(s) returns nonzero.
* Returns:
* ==0 continue
* !=0 done
*/
extern (D) int overloadApply(Dsymbol fstart, scope int delegate(Dsymbol) dg)
{
Dsymbol next;
for (Dsymbol d = fstart; d; d = next)
{
if (auto od = d.isOverDeclaration())
{
if (od.hasOverloads)
{
if (int r = overloadApply(od.aliassym, dg))
return r;
}
else
{
if (int r = dg(od.aliassym))
return r;
}
next = od.overnext;
}
else if (auto fa = d.isFuncAliasDeclaration())
{
if (fa.hasOverloads)
{
if (int r = overloadApply(fa.funcalias, dg))
return r;
}
else if (auto fd = fa.toAliasFunc())
{
if (int r = dg(fd))
return r;
}
else
{
d.error("is aliased to a function");
break;
}
next = fa.overnext;
}
else if (auto ad = d.isAliasDeclaration())
{
next = ad.toAlias();
if (next == ad)
break;
if (next == fstart)
break;
}
else if (auto td = d.isTemplateDeclaration())
{
if (int r = dg(td))
return r;
next = td.overnext;
}
else if (auto fd = d.isFuncDeclaration())
{
if (int r = dg(fd))
return r;
next = fd.overnext;
}
else
{
d.error("is aliased to a function");
break;
// BUG: should print error message?
}
}
return 0;
}
extern (C++) int overloadApply(Dsymbol fstart, void* param, int function(void*, Dsymbol) fp)
{
return overloadApply(fstart, s => (*fp)(param, s));
}
extern (C++) static void MODMatchToBuffer(OutBuffer* buf, ubyte lhsMod, ubyte rhsMod)
{
bool bothMutable = ((lhsMod & rhsMod) == 0);
bool sharedMismatch = ((lhsMod ^ rhsMod) & MODshared) != 0;
bool sharedMismatchOnly = ((lhsMod ^ rhsMod) == MODshared);
if (lhsMod & MODshared)
buf.writestring("shared ");
else if (sharedMismatch && !(lhsMod & MODimmutable))
buf.writestring("non-shared ");
if (bothMutable && sharedMismatchOnly)
{
}
else if (lhsMod & MODimmutable)
buf.writestring("immutable ");
else if (lhsMod & MODconst)
buf.writestring("const ");
else if (lhsMod & MODwild)
buf.writestring("inout ");
else
buf.writestring("mutable ");
}
/*******************************************
* Given a symbol that could be either a FuncDeclaration or
* a function template, resolve it to a function symbol.
* loc instantiation location
* sc instantiation scope
* tiargs initial list of template arguments
* tthis if !NULL, the 'this' pointer argument
* fargs arguments to function
* flags 1: do not issue error message on no match, just return NULL
* 2: overloadResolve only
*/
extern (C++) FuncDeclaration resolveFuncCall(Loc loc, Scope* sc, Dsymbol s, Objects* tiargs, Type tthis, Expressions* fargs, int flags = 0)
{
if (!s)
return null; // no match
version (none)
{
printf("resolveFuncCall('%s')\n", s.toChars());
if (fargs)
{
for (size_t i = 0; i < fargs.dim; i++)
{
Expression arg = (*fargs)[i];
assert(arg.type);
printf("\t%s: ", arg.toChars());
arg.type.print();
}
}
}
if (tiargs && arrayObjectIsError(tiargs) || fargs && arrayObjectIsError(cast(Objects*)fargs))
{
return null;
}
Match m;
m.last = MATCHnomatch;
functionResolve(&m, s, loc, sc, tiargs, tthis, fargs);
if (m.last > MATCHnomatch && m.lastf)
{
if (m.count == 1) // exactly one match
{
if (!(flags & 1))
m.lastf.functionSemantic();
return m.lastf;
}
if ((flags & 2) && !tthis && m.lastf.needThis())
{
return m.lastf;
}
}
/* Failed to find a best match.
* Do nothing or print error.
*/
if (m.last <= MATCHnomatch)
{
// error was caused on matched function
if (m.count == 1)
return m.lastf;
// if do not print error messages
if (flags & 1)
return null; // no match
}
FuncDeclaration fd = s.isFuncDeclaration();
TemplateDeclaration td = s.isTemplateDeclaration();
if (td && td.funcroot)
s = fd = td.funcroot;
OutBuffer tiargsBuf;
arrayObjectsToBuffer(&tiargsBuf, tiargs);
OutBuffer fargsBuf;
fargsBuf.writeByte('(');
argExpTypesToCBuffer(&fargsBuf, fargs);
fargsBuf.writeByte(')');
if (tthis)
tthis.modToBuffer(&fargsBuf);
// max num of overloads to print (-v overrides this).
enum int numOverloadsDisplay = 5;
if (!m.lastf && !(flags & 1)) // no match
{
if (td && !fd) // all of overloads are templates
{
.error(loc, "%s %s.%s cannot deduce function from argument types !(%s)%s, candidates are:", td.kind(), td.parent.toPrettyChars(), td.ident.toChars(), tiargsBuf.peekString(), fargsBuf.peekString());
// Display candidate templates (even if there are no multiple overloads)
int numToDisplay = numOverloadsDisplay;
overloadApply(td, (Dsymbol s)
{
auto td = s.isTemplateDeclaration();
if (!td)
return 0;
.errorSupplemental(td.loc, "%s", td.toPrettyChars());
if (global.params.verbose || --numToDisplay != 0 || !td.overnext)
return 0;
// Too many overloads to sensibly display.
// Just show count of remaining overloads.
int num = 0;
overloadApply(td.overnext, (s) { ++num; return 0; });
if (num > 0)
.errorSupplemental(loc, "... (%d more, -v to show) ...", num);
return 1; // stop iterating
});
}
else
{
assert(fd);
bool hasOverloads = fd.overnext !is null;
TypeFunction tf = cast(TypeFunction)fd.type;
if (tthis && !MODimplicitConv(tthis.mod, tf.mod)) // modifier mismatch
{
OutBuffer thisBuf, funcBuf;
MODMatchToBuffer(&thisBuf, tthis.mod, tf.mod);
MODMatchToBuffer(&funcBuf, tf.mod, tthis.mod);
if (hasOverloads)
{
.error(loc, "None of the overloads of '%s' are callable using a %sobject, candidates are:",
fd.ident.toChars(), thisBuf.peekString());
}
else
{
.error(loc, "%smethod %s is not callable using a %sobject",
funcBuf.peekString(), fd.toPrettyChars(),
thisBuf.peekString());
}
}
else
{
//printf("tf = %s, args = %s\n", tf->deco, (*fargs)[0]->type->deco);
if (hasOverloads)
{
.error(loc, "None of the overloads of '%s' are callable using argument types %s, candidates are:",
fd.ident.toChars(), fargsBuf.peekString());
}
else
{
fd.error(loc, "%s%s is not callable using argument types %s",
parametersTypeToChars(tf.parameters, tf.varargs),
tf.modToChars(), fargsBuf.peekString());
}
}
// Display candidate functions
int numToDisplay = numOverloadsDisplay;
overloadApply(hasOverloads ? fd : null, (Dsymbol s)
{
auto fd = s.isFuncDeclaration();
if (!fd || fd.errors || fd.type.ty == Terror)
return 0;
auto tf = cast(TypeFunction)fd.type;
.errorSupplemental(fd.loc, "%s%s", fd.toPrettyChars(),
parametersTypeToChars(tf.parameters, tf.varargs));
if (global.params.verbose || --numToDisplay != 0 || !fd.overnext)
return 0;
// Too many overloads to sensibly display.
int num = 0;
overloadApply(fd.overnext, (s){ num += !!s.isFuncDeclaration(); return 0; });
if (num > 0)
.errorSupplemental(loc, "... (%d more, -v to show) ...", num);
return 1; // stop iterating
});
}
}
else if (m.nextf)
{
TypeFunction tf1 = cast(TypeFunction)m.lastf.type;
TypeFunction tf2 = cast(TypeFunction)m.nextf.type;
const(char)* lastprms = parametersTypeToChars(tf1.parameters, tf1.varargs);
const(char)* nextprms = parametersTypeToChars(tf2.parameters, tf2.varargs);
.error(loc, "%s.%s called with argument types %s matches both:\n%s: %s%s\nand:\n%s: %s%s", s.parent.toPrettyChars(), s.ident.toChars(), fargsBuf.peekString(), m.lastf.loc.toChars(), m.lastf.toPrettyChars(), lastprms, m.nextf.loc.toChars(), m.nextf.toPrettyChars(), nextprms);
}
return null;
}
/**************************************
* Returns an indirect type one step from t.
*/
extern (C++) Type getIndirection(Type t)
{
t = t.baseElemOf();
if (t.ty == Tarray || t.ty == Tpointer)
return t.nextOf().toBasetype();
if (t.ty == Taarray || t.ty == Tclass)
return t;
if (t.ty == Tstruct)
return t.hasPointers() ? t : null; // TODO
// should consider TypeDelegate?
return null;
}
/**************************************
* Returns true if memory reachable through a reference B to a value of type tb,
* which has been constructed with a reference A to a value of type ta
* available, can alias memory reachable from A based on the types involved
* (either directly or via any number of indirections).
*
* Note that this relation is not symmetric in the two arguments. For example,
* a const(int) reference can point to a pre-existing int, but not the other
* way round.
*/
extern (C++) bool traverseIndirections(Type ta, Type tb, void* p = null, bool reversePass = false)
{
Type source = ta;
Type target = tb;
if (reversePass)
{
source = tb;
target = ta;
}
if (source.constConv(target))
return true;
else if (target.ty == Tvoid && MODimplicitConv(source.mod, target.mod))
return true;
// No direct match, so try breaking up one of the types (starting with tb).
Type tbb = tb.toBasetype().baseElemOf();
if (tbb != tb)
return traverseIndirections(ta, tbb, p, reversePass);
// context date to detect circular look up
struct Ctxt
{
Ctxt* prev;
Type type;
}
Ctxt* ctxt = cast(Ctxt*)p;
if (tb.ty == Tclass || tb.ty == Tstruct)
{
for (Ctxt* c = ctxt; c; c = c.prev)
if (tb == c.type)
return false;
Ctxt c;
c.prev = ctxt;
c.type = tb;
AggregateDeclaration sym = tb.toDsymbol(null).isAggregateDeclaration();
for (size_t i = 0; i < sym.fields.dim; i++)
{
VarDeclaration v = sym.fields[i];
Type tprmi = v.type.addMod(tb.mod);
//printf("\ttb = %s, tprmi = %s\n", tb->toChars(), tprmi->toChars());
if (traverseIndirections(ta, tprmi, &c, reversePass))
return true;
}
}
else if (tb.ty == Tarray || tb.ty == Taarray || tb.ty == Tpointer)
{
Type tind = tb.nextOf();
if (traverseIndirections(ta, tind, ctxt, reversePass))
return true;
}
else if (tb.hasPointers())
{
// FIXME: function pointer/delegate types should be considered.
return true;
}
// Still no match, so try breaking up ta if we have note done so yet.
if (!reversePass)
return traverseIndirections(tb, ta, ctxt, true);
return false;
}
/* For all functions between outerFunc and f, mark them as needing
* a closure.
*/
extern (C++) void markAsNeedingClosure(Dsymbol f, FuncDeclaration outerFunc)
{
for (Dsymbol sx = f; sx && sx != outerFunc; sx = sx.parent)
{
FuncDeclaration fy = sx.isFuncDeclaration();
if (fy && fy.closureVars.dim)
{
/* fy needs a closure if it has closureVars[],
* because the frame pointer in the closure will be accessed.
*/
fy.requiresClosure = true;
}
}
}
/* Given a nested function f inside a function outerFunc, check
* if any sibling callers of f have escaped. If so, mark
* all the enclosing functions as needing closures.
* Return true if any closures were detected.
* This is recursive: we need to check the callers of our siblings.
* Note that nested functions can only call lexically earlier nested
* functions, so loops are impossible.
*/
extern (C++) bool checkEscapingSiblings(FuncDeclaration f, FuncDeclaration outerFunc, void* p = null)
{
struct PrevSibling
{
PrevSibling* p;
FuncDeclaration f;
}
PrevSibling ps;
ps.p = cast(PrevSibling*)p;
ps.f = f;
//printf("checkEscapingSiblings(f = %s, outerfunc = %s)\n", f->toChars(), outerFunc->toChars());
bool bAnyClosures = false;
for (size_t i = 0; i < f.siblingCallers.dim; ++i)
{
FuncDeclaration g = f.siblingCallers[i];
if (g.isThis() || g.tookAddressOf)
{
markAsNeedingClosure(g, outerFunc);
bAnyClosures = true;
}
PrevSibling* prev = cast(PrevSibling*)p;
while (1)
{
if (!prev)
{
bAnyClosures |= checkEscapingSiblings(g, outerFunc, &ps);
break;
}
if (prev.f == g)
break;
prev = prev.p;
}
}
//printf("\t%d\n", bAnyClosures);
return bAnyClosures;
}
/***********************************************************
* Used as a way to import a set of functions from another scope into this one.
*/
extern (C++) final class FuncAliasDeclaration : FuncDeclaration
{
public:
FuncDeclaration funcalias;
bool hasOverloads;
extern (D) this(Identifier ident, FuncDeclaration funcalias, bool hasOverloads = true)
{
super(funcalias.loc, funcalias.endloc, ident, funcalias.storage_class, funcalias.type);
assert(funcalias != this);
this.funcalias = funcalias;
this.hasOverloads = hasOverloads;
if (hasOverloads)
{
if (FuncAliasDeclaration fad = funcalias.isFuncAliasDeclaration())
this.hasOverloads = fad.hasOverloads;
}
else
{
// for internal use
assert(!funcalias.isFuncAliasDeclaration());
this.hasOverloads = false;
}
userAttribDecl = funcalias.userAttribDecl;
}
override inout(FuncAliasDeclaration) isFuncAliasDeclaration() inout
{
return this;
}
override const(char)* kind() const
{
return "function alias";
}
override FuncDeclaration toAliasFunc()
{
return funcalias.toAliasFunc();
}
override void accept(Visitor v)
{
v.visit(this);
}
}
/***********************************************************
*/
extern (C++) final class FuncLiteralDeclaration : FuncDeclaration
{
public:
TOK tok; // TOKfunction or TOKdelegate
Type treq; // target of return type inference
extern (D) this(Loc loc, Loc endloc, Type type, TOK tok, ForeachStatement fes, Identifier id = null)
{
super(loc, endloc, null, STCundefined, type);
this.ident = id ? id : Id.empty;
this.tok = tok;
this.fes = fes;
//printf("FuncLiteralDeclaration() id = '%s', type = '%s'\n", this->ident->toChars(), type->toChars());
}
override Dsymbol syntaxCopy(Dsymbol s)
{
//printf("FuncLiteralDeclaration::syntaxCopy('%s')\n", toChars());
assert(!s);
auto f = new FuncLiteralDeclaration(loc, endloc, type.syntaxCopy(), tok, fes, ident);
f.treq = treq; // don't need to copy
return FuncDeclaration.syntaxCopy(f);
}
override bool isNested()
{
//printf("FuncLiteralDeclaration::isNested() '%s'\n", toChars());
return (tok != TOKfunction);
}
override bool isVirtual()
{
return false;
}
override bool addPreInvariant()
{
return false;
}
override bool addPostInvariant()
{
return false;
}
/*******************************
* Modify all expression type of return statements to tret.
*
* On function literals, return type may be modified based on the context type
* after its semantic3 is done, in FuncExp::implicitCastTo.
*
* A function() dg = (){ return new B(); } // OK if is(B : A) == true
*
* If B to A conversion is convariant that requires offseet adjusting,
* all return statements should be adjusted to return expressions typed A.
*/
void modifyReturns(Scope* sc, Type tret)
{
extern (C++) final class RetWalker : StatementRewriteWalker
{
alias visit = super.visit;
public:
Scope* sc;
Type tret;
FuncLiteralDeclaration fld;
override void visit(ReturnStatement s)
{
Expression exp = s.exp;
if (exp && !exp.type.equals(tret))
{
s.exp = exp.castTo(sc, tret);
}
}
}
if (semanticRun < PASSsemantic3done)
return;
if (fes)
return;
scope RetWalker w = new RetWalker();
w.sc = sc;
w.tret = tret;
w.fld = this;
fbody.accept(w);
// Also update the inferred function type to match the new return type.
// This is required so the code generator does not try to cast the
// modified returns back to the original type.
if (inferRetType && type.nextOf() != tret)
(cast(TypeFunction)type).next = tret;
}
override inout(FuncLiteralDeclaration) isFuncLiteralDeclaration() inout
{
return this;
}
override const(char)* kind() const
{
// GCC requires the (char*) casts
return (tok != TOKfunction) ? cast(char*)"delegate" : cast(char*)"function";
}
override const(char)* toPrettyChars(bool QualifyTypes = false)
{
if (parent)
{
TemplateInstance ti = parent.isTemplateInstance();
if (ti)
return ti.tempdecl.toPrettyChars(QualifyTypes);
}
return Dsymbol.toPrettyChars(QualifyTypes);
}
override void accept(Visitor v)
{
v.visit(this);
}
}
/***********************************************************
*/
extern (C++) final class CtorDeclaration : FuncDeclaration
{
public:
extern (D) this(Loc loc, Loc endloc, StorageClass stc, Type type)
{
super(loc, endloc, Id.ctor, stc, type);
//printf("CtorDeclaration(loc = %s) %s\n", loc.toChars(), toChars());
}
override Dsymbol syntaxCopy(Dsymbol s)
{
assert(!s);
auto f = new CtorDeclaration(loc, endloc, storage_class, type.syntaxCopy());
return FuncDeclaration.syntaxCopy(f);
}
override void semantic(Scope* sc)
{
//printf("CtorDeclaration::semantic() %s\n", toChars());
if (semanticRun >= PASSsemanticdone)
return;
if (_scope)
{
sc = _scope;
_scope = null;
}
parent = sc.parent;
Dsymbol p = toParent2();
AggregateDeclaration ad = p.isAggregateDeclaration();
if (!ad)
{
.error(loc, "constructor can only be a member of aggregate, not %s %s", p.kind(), p.toChars());
type = Type.terror;
errors = true;
return;
}
sc = sc.push();
sc.stc &= ~STCstatic; // not a static constructor
sc.flags |= SCOPEctor;
FuncDeclaration.semantic(sc);
sc.pop();
if (errors)
return;
TypeFunction tf = cast(TypeFunction)type;
assert(tf && tf.ty == Tfunction);
/* See if it's the default constructor
* But, template constructor should not become a default constructor.
*/
if (ad && (!parent.isTemplateInstance() || parent.isTemplateMixin()))
{
immutable dim = Parameter.dim(tf.parameters);
if (auto sd = ad.isStructDeclaration())
{
if (dim == 0 && tf.varargs == 0) // empty default ctor w/o any varargs
{
if (fbody || !(storage_class & STCdisable))
{
error("default constructor for structs only allowed " ~
"with @disable, no body, and no parameters");
storage_class |= STCdisable;
fbody = null;
}
sd.noDefaultCtor = true;
}
else if (dim == 0 && tf.varargs) // allow varargs only ctor
{
}
else if (dim && Parameter.getNth(tf.parameters, 0).defaultArg)
{
// if the first parameter has a default argument, then the rest does as well
if (storage_class & STCdisable)
{
deprecation("@disable'd constructor cannot have default "~
"arguments for all parameters.");
deprecationSupplemental(loc, "Use @disable this(); if you want to disable default initialization.");
}
else
deprecation("all parameters have default arguments, "~
"but structs cannot have default constructors.");
}
}
else if (dim == 0 && tf.varargs == 0)
{
ad.defaultCtor = this;
}
}
}
override const(char)* kind() const
{
return "constructor";
}
override const(char)* toChars() const
{
return "this";
}
override bool isVirtual()
{
return false;
}
override bool addPreInvariant()
{
return false;
}
override bool addPostInvariant()
{
return (isThis() && vthis && global.params.useInvariants);
}
override inout(CtorDeclaration) isCtorDeclaration() inout
{
return this;
}
override void accept(Visitor v)
{
v.visit(this);
}
}
/***********************************************************
*/
extern (C++) final class PostBlitDeclaration : FuncDeclaration
{
public:
extern (D) this(Loc loc, Loc endloc, StorageClass stc, Identifier id)
{
super(loc, endloc, id, stc, null);
}
override Dsymbol syntaxCopy(Dsymbol s)
{
assert(!s);
auto dd = new PostBlitDeclaration(loc, endloc, storage_class, ident);
return FuncDeclaration.syntaxCopy(dd);
}
override void semantic(Scope* sc)
{
//printf("PostBlitDeclaration::semantic() %s\n", toChars());
//printf("ident: %s, %s, %p, %p\n", ident->toChars(), Id::dtor->toChars(), ident, Id::dtor);
//printf("stc = x%llx\n", sc->stc);
if (semanticRun >= PASSsemanticdone)
return;
if (_scope)
{
sc = _scope;
_scope = null;
}
parent = sc.parent;
Dsymbol p = toParent2();
StructDeclaration ad = p.isStructDeclaration();
if (!ad)
{
.error(loc, "postblit can only be a member of struct/union, not %s %s", p.kind(), p.toChars());
type = Type.terror;
errors = true;
return;
}
if (ident == Id.postblit && semanticRun < PASSsemantic)
ad.postblits.push(this);
if (!type)
type = new TypeFunction(null, Type.tvoid, false, LINKd, storage_class);
sc = sc.push();
sc.stc &= ~STCstatic; // not static
sc.linkage = LINKd;
FuncDeclaration.semantic(sc);
sc.pop();
}
override bool isVirtual()
{
return false;
}
override bool addPreInvariant()
{
return false;
}
override bool addPostInvariant()
{
return (isThis() && vthis && global.params.useInvariants);
}
override bool overloadInsert(Dsymbol s)
{
return false; // cannot overload postblits
}
override inout(PostBlitDeclaration) isPostBlitDeclaration() inout
{
return this;
}
override void accept(Visitor v)
{
v.visit(this);
}
}
/***********************************************************
*/
extern (C++) final class DtorDeclaration : FuncDeclaration
{
public:
extern (D) this(Loc loc, Loc endloc)
{
super(loc, endloc, Id.dtor, STCundefined, null);
}
extern (D) this(Loc loc, Loc endloc, StorageClass stc, Identifier id)
{
super(loc, endloc, id, stc, null);
}
override Dsymbol syntaxCopy(Dsymbol s)
{
assert(!s);
auto dd = new DtorDeclaration(loc, endloc, storage_class, ident);
return FuncDeclaration.syntaxCopy(dd);
}
override void semantic(Scope* sc)
{
//printf("DtorDeclaration::semantic() %s\n", toChars());
//printf("ident: %s, %s, %p, %p\n", ident->toChars(), Id::dtor->toChars(), ident, Id::dtor);
if (semanticRun >= PASSsemanticdone)
return;
if (_scope)
{
sc = _scope;
_scope = null;
}
parent = sc.parent;
Dsymbol p = toParent2();
AggregateDeclaration ad = p.isAggregateDeclaration();
if (!ad)
{
.error(loc, "destructor can only be a member of aggregate, not %s %s", p.kind(), p.toChars());
type = Type.terror;
errors = true;
return;
}
if (ident == Id.dtor && semanticRun < PASSsemantic)
ad.dtors.push(this);
if (!type)
type = new TypeFunction(null, Type.tvoid, false, LINKd, storage_class);
sc = sc.push();
sc.stc &= ~STCstatic; // not a static destructor
if (sc.linkage != LINKcpp)
sc.linkage = LINKd;
FuncDeclaration.semantic(sc);
sc.pop();
}
override const(char)* kind() const
{
return "destructor";
}
override const(char)* toChars() const
{
return "~this";
}
override bool isVirtual()
{
// false so that dtor's don't get put into the vtbl[]
return false;
}
override bool addPreInvariant()
{
return (isThis() && vthis && global.params.useInvariants);
}
override bool addPostInvariant()
{
return false;
}
override bool overloadInsert(Dsymbol s)
{
return false; // cannot overload destructors
}
override inout(DtorDeclaration) isDtorDeclaration() inout
{
return this;
}
override void accept(Visitor v)
{
v.visit(this);
}
}
/***********************************************************
*/
extern (C++) class StaticCtorDeclaration : FuncDeclaration
{
public:
final extern (D) this(Loc loc, Loc endloc, StorageClass stc)
{
super(loc, endloc, Identifier.generateId("_staticCtor"), STCstatic | stc, null);
}
final extern (D) this(Loc loc, Loc endloc, const(char)* name, StorageClass stc)
{
super(loc, endloc, Identifier.generateId(name), STCstatic | stc, null);
}
override Dsymbol syntaxCopy(Dsymbol s)
{
assert(!s);
auto scd = new StaticCtorDeclaration(loc, endloc, storage_class);
return FuncDeclaration.syntaxCopy(scd);
}
override final void semantic(Scope* sc)
{
//printf("StaticCtorDeclaration::semantic()\n");
if (semanticRun >= PASSsemanticdone)
return;
if (_scope)
{
sc = _scope;
_scope = null;
}
parent = sc.parent;
Dsymbol p = parent.pastMixin();
if (!p.isScopeDsymbol())
{
const(char)* s = (isSharedStaticCtorDeclaration() ? "shared " : "");
.error(loc, "%sstatic constructor can only be member of module/aggregate/template, not %s %s", s, p.kind(), p.toChars());
type = Type.terror;
errors = true;
return;
}
if (!type)
type = new TypeFunction(null, Type.tvoid, false, LINKd, storage_class);
/* If the static ctor appears within a template instantiation,
* it could get called multiple times by the module constructors
* for different modules. Thus, protect it with a gate.
*/
if (isInstantiated() && semanticRun < PASSsemantic)
{
/* Add this prefix to the function:
* static int gate;
* if (++gate != 1) return;
* Note that this is not thread safe; should not have threads
* during static construction.
*/
auto v = new VarDeclaration(Loc(), Type.tint32, Id.gate, null);
v.storage_class = STCtemp | (isSharedStaticCtorDeclaration() ? STCstatic : STCtls);
auto sa = new Statements();
Statement s = new ExpStatement(Loc(), v);
sa.push(s);
Expression e = new IdentifierExp(Loc(), v.ident);
e = new AddAssignExp(Loc(), e, new IntegerExp(1));
e = new EqualExp(TOKnotequal, Loc(), e, new IntegerExp(1));
s = new IfStatement(Loc(), null, e, new ReturnStatement(Loc(), null), null);
sa.push(s);
if (fbody)
sa.push(fbody);
fbody = new CompoundStatement(Loc(), sa);
}
FuncDeclaration.semantic(sc);
// We're going to need ModuleInfo
Module m = getModule();
if (!m)
m = sc._module;
if (m)
{
m.needmoduleinfo = 1;
//printf("module1 %s needs moduleinfo\n", m->toChars());
}
}
override final AggregateDeclaration isThis()
{
return null;
}
override final bool isVirtual()
{
return false;
}
override final bool addPreInvariant()
{
return false;
}
override final bool addPostInvariant()
{
return false;
}
override final bool hasStaticCtorOrDtor()
{
return true;
}
override final inout(StaticCtorDeclaration) isStaticCtorDeclaration() inout
{
return this;
}
override void accept(Visitor v)
{
v.visit(this);
}
}
/***********************************************************
*/
extern (C++) final class SharedStaticCtorDeclaration : StaticCtorDeclaration
{
public:
extern (D) this(Loc loc, Loc endloc, StorageClass stc)
{
super(loc, endloc, "_sharedStaticCtor", stc);
}
override Dsymbol syntaxCopy(Dsymbol s)
{
assert(!s);
auto scd = new SharedStaticCtorDeclaration(loc, endloc, storage_class);
return FuncDeclaration.syntaxCopy(scd);
}
override inout(SharedStaticCtorDeclaration) isSharedStaticCtorDeclaration() inout
{
return this;
}
override void accept(Visitor v)
{
v.visit(this);
}
}
/***********************************************************
*/
extern (C++) class StaticDtorDeclaration : FuncDeclaration
{
public:
VarDeclaration vgate; // 'gate' variable
final extern (D) this(Loc loc, Loc endloc, StorageClass stc)
{
super(loc, endloc, Identifier.generateId("_staticDtor"), STCstatic | stc, null);
}
final extern (D) this(Loc loc, Loc endloc, const(char)* name, StorageClass stc)
{
super(loc, endloc, Identifier.generateId(name), STCstatic | stc, null);
}
override Dsymbol syntaxCopy(Dsymbol s)
{
assert(!s);
auto sdd = new StaticDtorDeclaration(loc, endloc, storage_class);
return FuncDeclaration.syntaxCopy(sdd);
}
override final void semantic(Scope* sc)
{
if (semanticRun >= PASSsemanticdone)
return;
if (_scope)
{
sc = _scope;
_scope = null;
}
parent = sc.parent;
Dsymbol p = parent.pastMixin();
if (!p.isScopeDsymbol())
{
const(char)* s = (isSharedStaticDtorDeclaration() ? "shared " : "");
.error(loc, "%sstatic destructor can only be member of module/aggregate/template, not %s %s", s, p.kind(), p.toChars());
type = Type.terror;
errors = true;
return;
}
if (!type)
type = new TypeFunction(null, Type.tvoid, false, LINKd, storage_class);
/* If the static ctor appears within a template instantiation,
* it could get called multiple times by the module constructors
* for different modules. Thus, protect it with a gate.
*/
if (isInstantiated() && semanticRun < PASSsemantic)
{
/* Add this prefix to the function:
* static int gate;
* if (--gate != 0) return;
* Increment gate during constructor execution.
* Note that this is not thread safe; should not have threads
* during static destruction.
*/
auto v = new VarDeclaration(Loc(), Type.tint32, Id.gate, null);
v.storage_class = STCtemp | (isSharedStaticDtorDeclaration() ? STCstatic : STCtls);
auto sa = new Statements();
Statement s = new ExpStatement(Loc(), v);
sa.push(s);
Expression e = new IdentifierExp(Loc(), v.ident);
e = new AddAssignExp(Loc(), e, new IntegerExp(-1));
e = new EqualExp(TOKnotequal, Loc(), e, new IntegerExp(0));
s = new IfStatement(Loc(), null, e, new ReturnStatement(Loc(), null), null);
sa.push(s);
if (fbody)
sa.push(fbody);
fbody = new CompoundStatement(Loc(), sa);
vgate = v;
}
FuncDeclaration.semantic(sc);
// We're going to need ModuleInfo
Module m = getModule();
if (!m)
m = sc._module;
if (m)
{
m.needmoduleinfo = 1;
//printf("module2 %s needs moduleinfo\n", m->toChars());
}
}
override final AggregateDeclaration isThis()
{
return null;
}
override final bool isVirtual()
{
return false;
}
override final bool hasStaticCtorOrDtor()
{
return true;
}
override final bool addPreInvariant()
{
return false;
}
override final bool addPostInvariant()
{
return false;
}
override final inout(StaticDtorDeclaration) isStaticDtorDeclaration() inout
{
return this;
}
override void accept(Visitor v)
{
v.visit(this);
}
}
/***********************************************************
*/
extern (C++) final class SharedStaticDtorDeclaration : StaticDtorDeclaration
{
public:
extern (D) this(Loc loc, Loc endloc, StorageClass stc)
{
super(loc, endloc, "_sharedStaticDtor", stc);
}
override Dsymbol syntaxCopy(Dsymbol s)
{
assert(!s);
auto sdd = new SharedStaticDtorDeclaration(loc, endloc, storage_class);
return FuncDeclaration.syntaxCopy(sdd);
}
override inout(SharedStaticDtorDeclaration) isSharedStaticDtorDeclaration() inout
{
return this;
}
override void accept(Visitor v)
{
v.visit(this);
}
}
/***********************************************************
*/
extern (C++) final class InvariantDeclaration : FuncDeclaration
{
public:
extern (D) this(Loc loc, Loc endloc, StorageClass stc, Identifier id = null)
{
super(loc, endloc, id ? id : Identifier.generateId("__invariant"), stc, null);
}
override Dsymbol syntaxCopy(Dsymbol s)
{
assert(!s);
auto id = new InvariantDeclaration(loc, endloc, storage_class);
return FuncDeclaration.syntaxCopy(id);
}
override void semantic(Scope* sc)
{
if (semanticRun >= PASSsemanticdone)
return;
if (_scope)
{
sc = _scope;
_scope = null;
}
parent = sc.parent;
Dsymbol p = parent.pastMixin();
AggregateDeclaration ad = p.isAggregateDeclaration();
if (!ad)
{
.error(loc, "invariant can only be a member of aggregate, not %s %s", p.kind(), p.toChars());
type = Type.terror;
errors = true;
return;
}
if (ident != Id.classInvariant && semanticRun < PASSsemantic)
ad.invs.push(this);
if (!type)
type = new TypeFunction(null, Type.tvoid, false, LINKd, storage_class);
sc = sc.push();
sc.stc &= ~STCstatic; // not a static invariant
sc.stc |= STCconst; // invariant() is always const
sc.flags = (sc.flags & ~SCOPEcontract) | SCOPEinvariant;
sc.linkage = LINKd;
FuncDeclaration.semantic(sc);
sc.pop();
}
override bool isVirtual()
{
return false;
}
override bool addPreInvariant()
{
return false;
}
override bool addPostInvariant()
{
return false;
}
override inout(InvariantDeclaration) isInvariantDeclaration() inout
{
return this;
}
override void accept(Visitor v)
{
v.visit(this);
}
}
/***********************************************************
* Generate unique unittest function Id so we can have multiple
* instances per module.
*/
extern (C++) static Identifier unitTestId(Loc loc)
{
OutBuffer buf;
buf.printf("__unittestL%u_", loc.linnum);
return Identifier.generateId(buf.peekString());
}
/***********************************************************
*/
extern (C++) final class UnitTestDeclaration : FuncDeclaration
{
public:
char* codedoc; // for documented unittest
// toObjFile() these nested functions after this one
FuncDeclarations deferredNested;
extern (D) this(Loc loc, Loc endloc, StorageClass stc, char* codedoc)
{
super(loc, endloc, unitTestId(loc), stc, null);
this.codedoc = codedoc;
}
override Dsymbol syntaxCopy(Dsymbol s)
{
assert(!s);
auto utd = new UnitTestDeclaration(loc, endloc, storage_class, codedoc);
return FuncDeclaration.syntaxCopy(utd);
}
override void semantic(Scope* sc)
{
if (semanticRun >= PASSsemanticdone)
return;
if (_scope)
{
sc = _scope;
_scope = null;
}
protection = sc.protection;
parent = sc.parent;
Dsymbol p = parent.pastMixin();
if (!p.isScopeDsymbol())
{
.error(loc, "unittest can only be a member of module/aggregate/template, not %s %s", p.kind(), p.toChars());
type = Type.terror;
errors = true;
return;
}
if (global.params.useUnitTests)
{
if (!type)
type = new TypeFunction(null, Type.tvoid, false, LINKd, storage_class);
Scope* sc2 = sc.push();
sc2.linkage = LINKd;
FuncDeclaration.semantic(sc2);
sc2.pop();
}
version (none)
{
// We're going to need ModuleInfo even if the unit tests are not
// compiled in, because other modules may import this module and refer
// to this ModuleInfo.
// (This doesn't make sense to me?)
Module m = getModule();
if (!m)
m = sc._module;
if (m)
{
//printf("module3 %s needs moduleinfo\n", m->toChars());
m.needmoduleinfo = 1;
}
}
}
override AggregateDeclaration isThis()
{
return null;
}
override bool isVirtual()
{
return false;
}
override bool addPreInvariant()
{
return false;
}
override bool addPostInvariant()
{
return false;
}
override inout(UnitTestDeclaration) isUnitTestDeclaration() inout
{
return this;
}
override void accept(Visitor v)
{
v.visit(this);
}
}
/***********************************************************
*/
extern (C++) final class NewDeclaration : FuncDeclaration
{
public:
Parameters* parameters;
int varargs;
extern (D) this(Loc loc, Loc endloc, StorageClass stc, Parameters* fparams, int varargs)
{
super(loc, endloc, Id.classNew, STCstatic | stc, null);
this.parameters = fparams;
this.varargs = varargs;
}
override Dsymbol syntaxCopy(Dsymbol s)
{
assert(!s);
auto f = new NewDeclaration(loc, endloc, storage_class, Parameter.arraySyntaxCopy(parameters), varargs);
return FuncDeclaration.syntaxCopy(f);
}
override void semantic(Scope* sc)
{
//printf("NewDeclaration::semantic()\n");
if (semanticRun >= PASSsemanticdone)
return;
if (_scope)
{
sc = _scope;
_scope = null;
}
parent = sc.parent;
Dsymbol p = parent.pastMixin();
if (!p.isAggregateDeclaration())
{
.error(loc, "allocator can only be a member of aggregate, not %s %s", p.kind(), p.toChars());
type = Type.terror;
errors = true;
return;
}
Type tret = Type.tvoid.pointerTo();
if (!type)
type = new TypeFunction(parameters, tret, varargs, LINKd, storage_class);
type = type.semantic(loc, sc);
assert(type.ty == Tfunction);
// Check that there is at least one argument of type size_t
TypeFunction tf = cast(TypeFunction)type;
if (Parameter.dim(tf.parameters) < 1)
{
error("at least one argument of type size_t expected");
}
else
{
Parameter fparam = Parameter.getNth(tf.parameters, 0);
if (!fparam.type.equals(Type.tsize_t))
error("first argument must be type size_t, not %s", fparam.type.toChars());
}
FuncDeclaration.semantic(sc);
}
override const(char)* kind() const
{
return "allocator";
}
override bool isVirtual()
{
return false;
}
override bool addPreInvariant()
{
return false;
}
override bool addPostInvariant()
{
return false;
}
override inout(NewDeclaration) isNewDeclaration() inout
{
return this;
}
override void accept(Visitor v)
{
v.visit(this);
}
}
/***********************************************************
*/
extern (C++) final class DeleteDeclaration : FuncDeclaration
{
public:
Parameters* parameters;
extern (D) this(Loc loc, Loc endloc, StorageClass stc, Parameters* fparams)
{
super(loc, endloc, Id.classDelete, STCstatic | stc, null);
this.parameters = fparams;
}
override Dsymbol syntaxCopy(Dsymbol s)
{
assert(!s);
auto f = new DeleteDeclaration(loc, endloc, storage_class, Parameter.arraySyntaxCopy(parameters));
return FuncDeclaration.syntaxCopy(f);
}
override void semantic(Scope* sc)
{
//printf("DeleteDeclaration::semantic()\n");
if (semanticRun >= PASSsemanticdone)
return;
if (_scope)
{
sc = _scope;
_scope = null;
}
parent = sc.parent;
Dsymbol p = parent.pastMixin();
if (!p.isAggregateDeclaration())
{
.error(loc, "deallocator can only be a member of aggregate, not %s %s", p.kind(), p.toChars());
type = Type.terror;
errors = true;
return;
}
if (!type)
type = new TypeFunction(parameters, Type.tvoid, 0, LINKd, storage_class);
type = type.semantic(loc, sc);
assert(type.ty == Tfunction);
// Check that there is only one argument of type void*
TypeFunction tf = cast(TypeFunction)type;
if (Parameter.dim(tf.parameters) != 1)
{
error("one argument of type void* expected");
}
else
{
Parameter fparam = Parameter.getNth(tf.parameters, 0);
if (!fparam.type.equals(Type.tvoid.pointerTo()))
error("one argument of type void* expected, not %s", fparam.type.toChars());
}
FuncDeclaration.semantic(sc);
}
override const(char)* kind() const
{
return "deallocator";
}
override bool isDelete()
{
return true;
}
override bool isVirtual()
{
return false;
}
override bool addPreInvariant()
{
return false;
}
override bool addPostInvariant()
{
return false;
}
override inout(DeleteDeclaration) isDeleteDeclaration() inout
{
return this;
}
override void accept(Visitor v)
{
v.visit(this);
}
}
|
D
|
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric, std.container, std.range;
void get(Args...)(ref Args args)
{
import std.traits, std.meta, std.typecons;
static if (Args.length == 1) {
alias Arg = Args[0];
static if (isArray!Arg) {
static if (isSomeChar!(ElementType!Arg)) {
args[0] = readln.chomp.to!Arg;
} else {
args[0] = readln.split.to!Arg;
}
} else static if (isTuple!Arg) {
auto input = readln.split;
static foreach (i; 0..Fields!Arg.length) {
args[0][i] = input[i].to!(Fields!Arg[i]);
}
} else {
args[0] = readln.chomp.to!Arg;
}
} else {
auto input = readln.split;
assert(input.length == Args.length);
static foreach (i; 0..Args.length) {
args[i] = input[i].to!(Args[i]);
}
}
}
void get_lines(Args...)(size_t N, ref Args args)
{
import std.traits, std.range;
static foreach (i; 0..Args.length) {
static assert(isArray!(Args[i]));
args[i].length = N;
}
foreach (i; 0..N) {
static if (Args.length == 1) {
get(args[0][i]);
} else {
auto input = readln.split;
static foreach (j; 0..Args.length) {
args[j][i] = input[j].to!(ElementType!(Args[j]));
}
}
}
}
void main()
{
int N; long L; get(N, L);
int[] XS; long[] AS; get_lines(N, XS, AS);
long l = -1, r = long.max / 3;
while (l + 1 < r) {
auto t = (l + r) / 2;
auto h = t, p = 0;
foreach (i; 0..N) {
auto x = XS[i];
auto a = AS[i];
h = min(t, h + (x - p)) - a;
if (h < 0) goto ng;
p = x;
}
r = t;
continue;
ng:
l = t;
}
writeln(r);
}
|
D
|
/*******************************************************************************
* Copyright (c) 2000, 2003 IBM Corporation and others.
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/epl-v10.html
*
* Contributors:
* IBM Corporation - initial API and implementation
* Port to the D programming language:
* Frank Benoit <benoit@tionex.de>
*******************************************************************************/
module org.eclipse.swt.internal.image.JPEGStartOfImage;
import org.eclipse.swt.internal.image.JPEGFixedSizeSegment;
import org.eclipse.swt.internal.image.LEDataInputStream;
import org.eclipse.swt.internal.image.JPEGFileFormat;
final class JPEGStartOfImage : JPEGFixedSizeSegment {
public this() {
super();
}
public this(byte[] reference) {
super(reference);
}
public this(LEDataInputStream byteStream) {
super(byteStream);
}
public override int signature() {
return JPEGFileFormat.SOI;
}
public override int fixedSize() {
return 2;
}
}
|
D
|
module webkit2webextension.DOMHTMLAnchorElement;
private import glib.Str;
private import webkit2webextension.DOMHTMLElement;
private import webkit2webextension.c.functions;
public import webkit2webextension.c.types;
/** */
public class DOMHTMLAnchorElement : DOMHTMLElement
{
/** the main Gtk struct */
protected WebKitDOMHTMLAnchorElement* webKitDOMHTMLAnchorElement;
/** Get the main Gtk struct */
public WebKitDOMHTMLAnchorElement* getDOMHTMLAnchorElementStruct(bool transferOwnership = false)
{
if (transferOwnership)
ownedRef = false;
return webKitDOMHTMLAnchorElement;
}
/** the main Gtk struct as a void* */
protected override void* getStruct()
{
return cast(void*)webKitDOMHTMLAnchorElement;
}
/**
* Sets our main struct and passes it to the parent class.
*/
public this (WebKitDOMHTMLAnchorElement* webKitDOMHTMLAnchorElement, bool ownedRef = false)
{
this.webKitDOMHTMLAnchorElement = webKitDOMHTMLAnchorElement;
super(cast(WebKitDOMHTMLElement*)webKitDOMHTMLAnchorElement, ownedRef);
}
/** */
public static GType getType()
{
return webkit_dom_html_anchor_element_get_type();
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Returns: A #gchar
*/
public string getCharset()
{
auto retStr = webkit_dom_html_anchor_element_get_charset(webKitDOMHTMLAnchorElement);
scope(exit) Str.freeString(retStr);
return Str.toString(retStr);
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Returns: A #gchar
*/
public string getCoords()
{
auto retStr = webkit_dom_html_anchor_element_get_coords(webKitDOMHTMLAnchorElement);
scope(exit) Str.freeString(retStr);
return Str.toString(retStr);
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Returns: A #gchar
*/
public string getHash()
{
auto retStr = webkit_dom_html_anchor_element_get_hash(webKitDOMHTMLAnchorElement);
scope(exit) Str.freeString(retStr);
return Str.toString(retStr);
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Returns: A #gchar
*/
public string getHost()
{
auto retStr = webkit_dom_html_anchor_element_get_host(webKitDOMHTMLAnchorElement);
scope(exit) Str.freeString(retStr);
return Str.toString(retStr);
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Returns: A #gchar
*/
public string getHostname()
{
auto retStr = webkit_dom_html_anchor_element_get_hostname(webKitDOMHTMLAnchorElement);
scope(exit) Str.freeString(retStr);
return Str.toString(retStr);
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Returns: A #gchar
*/
public string getHref()
{
auto retStr = webkit_dom_html_anchor_element_get_href(webKitDOMHTMLAnchorElement);
scope(exit) Str.freeString(retStr);
return Str.toString(retStr);
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Returns: A #gchar
*/
public string getHreflang()
{
auto retStr = webkit_dom_html_anchor_element_get_hreflang(webKitDOMHTMLAnchorElement);
scope(exit) Str.freeString(retStr);
return Str.toString(retStr);
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Returns: A #gchar
*/
public string getName()
{
auto retStr = webkit_dom_html_anchor_element_get_name(webKitDOMHTMLAnchorElement);
scope(exit) Str.freeString(retStr);
return Str.toString(retStr);
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Returns: A #gchar
*/
public string getPathname()
{
auto retStr = webkit_dom_html_anchor_element_get_pathname(webKitDOMHTMLAnchorElement);
scope(exit) Str.freeString(retStr);
return Str.toString(retStr);
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Returns: A #gchar
*/
public string getPort()
{
auto retStr = webkit_dom_html_anchor_element_get_port(webKitDOMHTMLAnchorElement);
scope(exit) Str.freeString(retStr);
return Str.toString(retStr);
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Returns: A #gchar
*/
public string getProtocol()
{
auto retStr = webkit_dom_html_anchor_element_get_protocol(webKitDOMHTMLAnchorElement);
scope(exit) Str.freeString(retStr);
return Str.toString(retStr);
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Returns: A #gchar
*/
public string getRel()
{
auto retStr = webkit_dom_html_anchor_element_get_rel(webKitDOMHTMLAnchorElement);
scope(exit) Str.freeString(retStr);
return Str.toString(retStr);
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Returns: A #gchar
*/
public string getRev()
{
auto retStr = webkit_dom_html_anchor_element_get_rev(webKitDOMHTMLAnchorElement);
scope(exit) Str.freeString(retStr);
return Str.toString(retStr);
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Returns: A #gchar
*/
public string getSearch()
{
auto retStr = webkit_dom_html_anchor_element_get_search(webKitDOMHTMLAnchorElement);
scope(exit) Str.freeString(retStr);
return Str.toString(retStr);
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Returns: A #gchar
*/
public string getShape()
{
auto retStr = webkit_dom_html_anchor_element_get_shape(webKitDOMHTMLAnchorElement);
scope(exit) Str.freeString(retStr);
return Str.toString(retStr);
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Returns: A #gchar
*/
public string getTarget()
{
auto retStr = webkit_dom_html_anchor_element_get_target(webKitDOMHTMLAnchorElement);
scope(exit) Str.freeString(retStr);
return Str.toString(retStr);
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Returns: A #gchar
*/
public string getText()
{
auto retStr = webkit_dom_html_anchor_element_get_text(webKitDOMHTMLAnchorElement);
scope(exit) Str.freeString(retStr);
return Str.toString(retStr);
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Returns: A #gchar
*/
public string getTypeAttr()
{
auto retStr = webkit_dom_html_anchor_element_get_type_attr(webKitDOMHTMLAnchorElement);
scope(exit) Str.freeString(retStr);
return Str.toString(retStr);
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Params:
* value = A #gchar
*/
public void setCharset(string value)
{
webkit_dom_html_anchor_element_set_charset(webKitDOMHTMLAnchorElement, Str.toStringz(value));
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Params:
* value = A #gchar
*/
public void setCoords(string value)
{
webkit_dom_html_anchor_element_set_coords(webKitDOMHTMLAnchorElement, Str.toStringz(value));
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Params:
* value = A #gchar
*/
public void setHash(string value)
{
webkit_dom_html_anchor_element_set_hash(webKitDOMHTMLAnchorElement, Str.toStringz(value));
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Params:
* value = A #gchar
*/
public void setHost(string value)
{
webkit_dom_html_anchor_element_set_host(webKitDOMHTMLAnchorElement, Str.toStringz(value));
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Params:
* value = A #gchar
*/
public void setHostname(string value)
{
webkit_dom_html_anchor_element_set_hostname(webKitDOMHTMLAnchorElement, Str.toStringz(value));
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Params:
* value = A #gchar
*/
public void setHref(string value)
{
webkit_dom_html_anchor_element_set_href(webKitDOMHTMLAnchorElement, Str.toStringz(value));
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Params:
* value = A #gchar
*/
public void setHreflang(string value)
{
webkit_dom_html_anchor_element_set_hreflang(webKitDOMHTMLAnchorElement, Str.toStringz(value));
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Params:
* value = A #gchar
*/
public void setName(string value)
{
webkit_dom_html_anchor_element_set_name(webKitDOMHTMLAnchorElement, Str.toStringz(value));
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Params:
* value = A #gchar
*/
public void setPathname(string value)
{
webkit_dom_html_anchor_element_set_pathname(webKitDOMHTMLAnchorElement, Str.toStringz(value));
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Params:
* value = A #gchar
*/
public void setPort(string value)
{
webkit_dom_html_anchor_element_set_port(webKitDOMHTMLAnchorElement, Str.toStringz(value));
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Params:
* value = A #gchar
*/
public void setProtocol(string value)
{
webkit_dom_html_anchor_element_set_protocol(webKitDOMHTMLAnchorElement, Str.toStringz(value));
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Params:
* value = A #gchar
*/
public void setRel(string value)
{
webkit_dom_html_anchor_element_set_rel(webKitDOMHTMLAnchorElement, Str.toStringz(value));
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Params:
* value = A #gchar
*/
public void setRev(string value)
{
webkit_dom_html_anchor_element_set_rev(webKitDOMHTMLAnchorElement, Str.toStringz(value));
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Params:
* value = A #gchar
*/
public void setSearch(string value)
{
webkit_dom_html_anchor_element_set_search(webKitDOMHTMLAnchorElement, Str.toStringz(value));
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Params:
* value = A #gchar
*/
public void setShape(string value)
{
webkit_dom_html_anchor_element_set_shape(webKitDOMHTMLAnchorElement, Str.toStringz(value));
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Params:
* value = A #gchar
*/
public void setTarget(string value)
{
webkit_dom_html_anchor_element_set_target(webKitDOMHTMLAnchorElement, Str.toStringz(value));
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Params:
* value = A #gchar
*
* Since: 2.16
*/
public void setText(string value)
{
webkit_dom_html_anchor_element_set_text(webKitDOMHTMLAnchorElement, Str.toStringz(value));
}
/**
*
*
* Deprecated: Use JavaScriptCore API instead
*
* Params:
* value = A #gchar
*/
public void setTypeAttr(string value)
{
webkit_dom_html_anchor_element_set_type_attr(webKitDOMHTMLAnchorElement, Str.toStringz(value));
}
}
|
D
|
// Copyright 2018 - 2022 Michael D. Parker
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
module bindbc.sdl.bind.sdlscancode;
import bindbc.sdl.config;
static if(sdlSupport >= SDLSupport.sdl206) {
enum SDL_Scancode {
SDL_SCANCODE_UNKNOWN = 0,
SDL_SCANCODE_A = 4,
SDL_SCANCODE_B = 5,
SDL_SCANCODE_C = 6,
SDL_SCANCODE_D = 7,
SDL_SCANCODE_E = 8,
SDL_SCANCODE_F = 9,
SDL_SCANCODE_G = 10,
SDL_SCANCODE_H = 11,
SDL_SCANCODE_I = 12,
SDL_SCANCODE_J = 13,
SDL_SCANCODE_K = 14,
SDL_SCANCODE_L = 15,
SDL_SCANCODE_M = 16,
SDL_SCANCODE_N = 17,
SDL_SCANCODE_O = 18,
SDL_SCANCODE_P = 19,
SDL_SCANCODE_Q = 20,
SDL_SCANCODE_R = 21,
SDL_SCANCODE_S = 22,
SDL_SCANCODE_T = 23,
SDL_SCANCODE_U = 24,
SDL_SCANCODE_V = 25,
SDL_SCANCODE_W = 26,
SDL_SCANCODE_X = 27,
SDL_SCANCODE_Y = 28,
SDL_SCANCODE_Z = 29,
SDL_SCANCODE_1 = 30,
SDL_SCANCODE_2 = 31,
SDL_SCANCODE_3 = 32,
SDL_SCANCODE_4 = 33,
SDL_SCANCODE_5 = 34,
SDL_SCANCODE_6 = 35,
SDL_SCANCODE_7 = 36,
SDL_SCANCODE_8 = 37,
SDL_SCANCODE_9 = 38,
SDL_SCANCODE_0 = 39,
SDL_SCANCODE_RETURN = 40,
SDL_SCANCODE_ESCAPE = 41,
SDL_SCANCODE_BACKSPACE = 42,
SDL_SCANCODE_TAB = 43,
SDL_SCANCODE_SPACE = 44,
SDL_SCANCODE_MINUS = 45,
SDL_SCANCODE_EQUALS = 46,
SDL_SCANCODE_LEFTBRACKET = 47,
SDL_SCANCODE_RIGHTBRACKET = 48,
SDL_SCANCODE_BACKSLASH = 49,
SDL_SCANCODE_NONUSHASH = 50,
SDL_SCANCODE_SEMICOLON = 51,
SDL_SCANCODE_APOSTROPHE = 52,
SDL_SCANCODE_GRAVE = 53,
SDL_SCANCODE_COMMA = 54,
SDL_SCANCODE_PERIOD = 55,
SDL_SCANCODE_SLASH = 56,
SDL_SCANCODE_CAPSLOCK = 57,
SDL_SCANCODE_F1 = 58,
SDL_SCANCODE_F2 = 59,
SDL_SCANCODE_F3 = 60,
SDL_SCANCODE_F4 = 61,
SDL_SCANCODE_F5 = 62,
SDL_SCANCODE_F6 = 63,
SDL_SCANCODE_F7 = 64,
SDL_SCANCODE_F8 = 65,
SDL_SCANCODE_F9 = 66,
SDL_SCANCODE_F10 = 67,
SDL_SCANCODE_F11 = 68,
SDL_SCANCODE_F12 = 69,
SDL_SCANCODE_PRINTSCREEN = 70,
SDL_SCANCODE_SCROLLLOCK = 71,
SDL_SCANCODE_PAUSE = 72,
SDL_SCANCODE_INSERT = 73,
SDL_SCANCODE_HOME = 74,
SDL_SCANCODE_PAGEUP = 75,
SDL_SCANCODE_DELETE = 76,
SDL_SCANCODE_END = 77,
SDL_SCANCODE_PAGEDOWN = 78,
SDL_SCANCODE_RIGHT = 79,
SDL_SCANCODE_LEFT = 80,
SDL_SCANCODE_DOWN = 81,
SDL_SCANCODE_UP = 82,
SDL_SCANCODE_NUMLOCKCLEAR = 83,
SDL_SCANCODE_KP_DIVIDE = 84,
SDL_SCANCODE_KP_MULTIPLY = 85,
SDL_SCANCODE_KP_MINUS = 86,
SDL_SCANCODE_KP_PLUS = 87,
SDL_SCANCODE_KP_ENTER = 88,
SDL_SCANCODE_KP_1 = 89,
SDL_SCANCODE_KP_2 = 90,
SDL_SCANCODE_KP_3 = 91,
SDL_SCANCODE_KP_4 = 92,
SDL_SCANCODE_KP_5 = 93,
SDL_SCANCODE_KP_6 = 94,
SDL_SCANCODE_KP_7 = 95,
SDL_SCANCODE_KP_8 = 96,
SDL_SCANCODE_KP_9 = 97,
SDL_SCANCODE_KP_0 = 98,
SDL_SCANCODE_KP_PERIOD = 99,
SDL_SCANCODE_NONUSBACKSLASH = 100,
SDL_SCANCODE_APPLICATION = 101,
SDL_SCANCODE_POWER = 102,
SDL_SCANCODE_KP_EQUALS = 103,
SDL_SCANCODE_F13 = 104,
SDL_SCANCODE_F14 = 105,
SDL_SCANCODE_F15 = 106,
SDL_SCANCODE_F16 = 107,
SDL_SCANCODE_F17 = 108,
SDL_SCANCODE_F18 = 109,
SDL_SCANCODE_F19 = 110,
SDL_SCANCODE_F20 = 111,
SDL_SCANCODE_F21 = 112,
SDL_SCANCODE_F22 = 113,
SDL_SCANCODE_F23 = 114,
SDL_SCANCODE_F24 = 115,
SDL_SCANCODE_EXECUTE = 116,
SDL_SCANCODE_HELP = 117,
SDL_SCANCODE_MENU = 118,
SDL_SCANCODE_SELECT = 119,
SDL_SCANCODE_STOP = 120,
SDL_SCANCODE_AGAIN = 121,
SDL_SCANCODE_UNDO = 122,
SDL_SCANCODE_CUT = 123,
SDL_SCANCODE_COPY = 124,
SDL_SCANCODE_PASTE = 125,
SDL_SCANCODE_FIND = 126,
SDL_SCANCODE_MUTE = 127,
SDL_SCANCODE_VOLUMEUP = 128,
SDL_SCANCODE_VOLUMEDOWN = 129,
SDL_SCANCODE_KP_COMMA = 133,
SDL_SCANCODE_KP_EQUALSAS400 = 134,
SDL_SCANCODE_INTERNATIONAL1 = 135,
SDL_SCANCODE_INTERNATIONAL2 = 136,
SDL_SCANCODE_INTERNATIONAL3 = 137,
SDL_SCANCODE_INTERNATIONAL4 = 138,
SDL_SCANCODE_INTERNATIONAL5 = 139,
SDL_SCANCODE_INTERNATIONAL6 = 140,
SDL_SCANCODE_INTERNATIONAL7 = 141,
SDL_SCANCODE_INTERNATIONAL8 = 142,
SDL_SCANCODE_INTERNATIONAL9 = 143,
SDL_SCANCODE_LANG1 = 144,
SDL_SCANCODE_LANG2 = 145,
SDL_SCANCODE_LANG3 = 146,
SDL_SCANCODE_LANG4 = 147,
SDL_SCANCODE_LANG5 = 148,
SDL_SCANCODE_LANG6 = 149,
SDL_SCANCODE_LANG7 = 150,
SDL_SCANCODE_LANG8 = 151,
SDL_SCANCODE_LANG9 = 152,
SDL_SCANCODE_ALTERASE = 153,
SDL_SCANCODE_SYSREQ = 154,
SDL_SCANCODE_CANCEL = 155,
SDL_SCANCODE_CLEAR = 156,
SDL_SCANCODE_PRIOR = 157,
SDL_SCANCODE_RETURN2 = 158,
SDL_SCANCODE_SEPARATOR = 159,
SDL_SCANCODE_OUT = 160,
SDL_SCANCODE_OPER = 161,
SDL_SCANCODE_CLEARAGAIN = 162,
SDL_SCANCODE_CRSEL = 163,
SDL_SCANCODE_EXSEL = 164,
SDL_SCANCODE_KP_00 = 176,
SDL_SCANCODE_KP_000 = 177,
SDL_SCANCODE_THOUSANDSSEPARATOR = 178,
SDL_SCANCODE_DECIMALSEPARATOR = 179,
SDL_SCANCODE_CURRENCYUNIT = 180,
SDL_SCANCODE_CURRENCYSUBUNIT = 181,
SDL_SCANCODE_KP_LEFTPAREN = 182,
SDL_SCANCODE_KP_RIGHTPAREN = 183,
SDL_SCANCODE_KP_LEFTBRACE = 184,
SDL_SCANCODE_KP_RIGHTBRACE = 185,
SDL_SCANCODE_KP_TAB = 186,
SDL_SCANCODE_KP_BACKSPACE = 187,
SDL_SCANCODE_KP_A = 188,
SDL_SCANCODE_KP_B = 189,
SDL_SCANCODE_KP_C = 190,
SDL_SCANCODE_KP_D = 191,
SDL_SCANCODE_KP_E = 192,
SDL_SCANCODE_KP_F = 193,
SDL_SCANCODE_KP_XOR = 194,
SDL_SCANCODE_KP_POWER = 195,
SDL_SCANCODE_KP_PERCENT = 196,
SDL_SCANCODE_KP_LESS = 197,
SDL_SCANCODE_KP_GREATER = 198,
SDL_SCANCODE_KP_AMPERSAND = 199,
SDL_SCANCODE_KP_DBLAMPERSAND = 200,
SDL_SCANCODE_KP_VERTICALBAR = 201,
SDL_SCANCODE_KP_DBLVERTICALBAR = 202,
SDL_SCANCODE_KP_COLON = 203,
SDL_SCANCODE_KP_HASH = 204,
SDL_SCANCODE_KP_SPACE = 205,
SDL_SCANCODE_KP_AT = 206,
SDL_SCANCODE_KP_EXCLAM = 207,
SDL_SCANCODE_KP_MEMSTORE = 208,
SDL_SCANCODE_KP_MEMRECALL = 209,
SDL_SCANCODE_KP_MEMCLEAR = 210,
SDL_SCANCODE_KP_MEMADD = 211,
SDL_SCANCODE_KP_MEMSUBTRACT = 212,
SDL_SCANCODE_KP_MEMMULTIPLY = 213,
SDL_SCANCODE_KP_MEMDIVIDE = 214,
SDL_SCANCODE_KP_PLUSMINUS = 215,
SDL_SCANCODE_KP_CLEAR = 216,
SDL_SCANCODE_KP_CLEARENTRY = 217,
SDL_SCANCODE_KP_BINARY = 218,
SDL_SCANCODE_KP_OCTAL = 219,
SDL_SCANCODE_KP_DECIMAL = 220,
SDL_SCANCODE_KP_HEXADECIMAL = 221,
SDL_SCANCODE_LCTRL = 224,
SDL_SCANCODE_LSHIFT = 225,
SDL_SCANCODE_LALT = 226,
SDL_SCANCODE_LGUI = 227,
SDL_SCANCODE_RCTRL = 228,
SDL_SCANCODE_RSHIFT = 229,
SDL_SCANCODE_RALT = 230,
SDL_SCANCODE_RGUI = 231,
SDL_SCANCODE_MODE = 257,
SDL_SCANCODE_AUDIONEXT = 258,
SDL_SCANCODE_AUDIOPREV = 259,
SDL_SCANCODE_AUDIOSTOP = 260,
SDL_SCANCODE_AUDIOPLAY = 261,
SDL_SCANCODE_AUDIOMUTE = 262,
SDL_SCANCODE_MEDIASELECT = 263,
SDL_SCANCODE_WWW = 264,
SDL_SCANCODE_MAIL = 265,
SDL_SCANCODE_CALCULATOR = 266,
SDL_SCANCODE_COMPUTER = 267,
SDL_SCANCODE_AC_SEARCH = 268,
SDL_SCANCODE_AC_HOME = 269,
SDL_SCANCODE_AC_BACK = 270,
SDL_SCANCODE_AC_FORWARD = 271,
SDL_SCANCODE_AC_STOP = 272,
SDL_SCANCODE_AC_REFRESH = 273,
SDL_SCANCODE_AC_BOOKMARKS = 274,
SDL_SCANCODE_BRIGHTNESSDOWN = 275,
SDL_SCANCODE_BRIGHTNESSUP = 276,
SDL_SCANCODE_DISPLAYSWITCH = 277,
SDL_SCANCODE_KBDILLUMTOGGLE = 278,
SDL_SCANCODE_KBDILLUMDOWN = 279,
SDL_SCANCODE_KBDILLUMUP = 280,
SDL_SCANCODE_EJECT = 281,
SDL_SCANCODE_SLEEP = 282,
SDL_SCANCODE_APP1 = 283,
SDL_SCANCODE_APP2 = 284,
SDL_SCANCODE_AUDIOREWIND = 285,
SDL_SCANCODE_AUDIOFASTFORWARD = 286,
SDL_NUM_SCANCODES = 512
}
}
else {
enum SDL_Scancode {
SDL_SCANCODE_UNKNOWN = 0,
SDL_SCANCODE_A = 4,
SDL_SCANCODE_B = 5,
SDL_SCANCODE_C = 6,
SDL_SCANCODE_D = 7,
SDL_SCANCODE_E = 8,
SDL_SCANCODE_F = 9,
SDL_SCANCODE_G = 10,
SDL_SCANCODE_H = 11,
SDL_SCANCODE_I = 12,
SDL_SCANCODE_J = 13,
SDL_SCANCODE_K = 14,
SDL_SCANCODE_L = 15,
SDL_SCANCODE_M = 16,
SDL_SCANCODE_N = 17,
SDL_SCANCODE_O = 18,
SDL_SCANCODE_P = 19,
SDL_SCANCODE_Q = 20,
SDL_SCANCODE_R = 21,
SDL_SCANCODE_S = 22,
SDL_SCANCODE_T = 23,
SDL_SCANCODE_U = 24,
SDL_SCANCODE_V = 25,
SDL_SCANCODE_W = 26,
SDL_SCANCODE_X = 27,
SDL_SCANCODE_Y = 28,
SDL_SCANCODE_Z = 29,
SDL_SCANCODE_1 = 30,
SDL_SCANCODE_2 = 31,
SDL_SCANCODE_3 = 32,
SDL_SCANCODE_4 = 33,
SDL_SCANCODE_5 = 34,
SDL_SCANCODE_6 = 35,
SDL_SCANCODE_7 = 36,
SDL_SCANCODE_8 = 37,
SDL_SCANCODE_9 = 38,
SDL_SCANCODE_0 = 39,
SDL_SCANCODE_RETURN = 40,
SDL_SCANCODE_ESCAPE = 41,
SDL_SCANCODE_BACKSPACE = 42,
SDL_SCANCODE_TAB = 43,
SDL_SCANCODE_SPACE = 44,
SDL_SCANCODE_MINUS = 45,
SDL_SCANCODE_EQUALS = 46,
SDL_SCANCODE_LEFTBRACKET = 47,
SDL_SCANCODE_RIGHTBRACKET = 48,
SDL_SCANCODE_BACKSLASH = 49,
SDL_SCANCODE_NONUSHASH = 50,
SDL_SCANCODE_SEMICOLON = 51,
SDL_SCANCODE_APOSTROPHE = 52,
SDL_SCANCODE_GRAVE = 53,
SDL_SCANCODE_COMMA = 54,
SDL_SCANCODE_PERIOD = 55,
SDL_SCANCODE_SLASH = 56,
SDL_SCANCODE_CAPSLOCK = 57,
SDL_SCANCODE_F1 = 58,
SDL_SCANCODE_F2 = 59,
SDL_SCANCODE_F3 = 60,
SDL_SCANCODE_F4 = 61,
SDL_SCANCODE_F5 = 62,
SDL_SCANCODE_F6 = 63,
SDL_SCANCODE_F7 = 64,
SDL_SCANCODE_F8 = 65,
SDL_SCANCODE_F9 = 66,
SDL_SCANCODE_F10 = 67,
SDL_SCANCODE_F11 = 68,
SDL_SCANCODE_F12 = 69,
SDL_SCANCODE_PRINTSCREEN = 70,
SDL_SCANCODE_SCROLLLOCK = 71,
SDL_SCANCODE_PAUSE = 72,
SDL_SCANCODE_INSERT = 73,
SDL_SCANCODE_HOME = 74,
SDL_SCANCODE_PAGEUP = 75,
SDL_SCANCODE_DELETE = 76,
SDL_SCANCODE_END = 77,
SDL_SCANCODE_PAGEDOWN = 78,
SDL_SCANCODE_RIGHT = 79,
SDL_SCANCODE_LEFT = 80,
SDL_SCANCODE_DOWN = 81,
SDL_SCANCODE_UP = 82,
SDL_SCANCODE_NUMLOCKCLEAR = 83,
SDL_SCANCODE_KP_DIVIDE = 84,
SDL_SCANCODE_KP_MULTIPLY = 85,
SDL_SCANCODE_KP_MINUS = 86,
SDL_SCANCODE_KP_PLUS = 87,
SDL_SCANCODE_KP_ENTER = 88,
SDL_SCANCODE_KP_1 = 89,
SDL_SCANCODE_KP_2 = 90,
SDL_SCANCODE_KP_3 = 91,
SDL_SCANCODE_KP_4 = 92,
SDL_SCANCODE_KP_5 = 93,
SDL_SCANCODE_KP_6 = 94,
SDL_SCANCODE_KP_7 = 95,
SDL_SCANCODE_KP_8 = 96,
SDL_SCANCODE_KP_9 = 97,
SDL_SCANCODE_KP_0 = 98,
SDL_SCANCODE_KP_PERIOD = 99,
SDL_SCANCODE_NONUSBACKSLASH = 100,
SDL_SCANCODE_APPLICATION = 101,
SDL_SCANCODE_POWER = 102,
SDL_SCANCODE_KP_EQUALS = 103,
SDL_SCANCODE_F13 = 104,
SDL_SCANCODE_F14 = 105,
SDL_SCANCODE_F15 = 106,
SDL_SCANCODE_F16 = 107,
SDL_SCANCODE_F17 = 108,
SDL_SCANCODE_F18 = 109,
SDL_SCANCODE_F19 = 110,
SDL_SCANCODE_F20 = 111,
SDL_SCANCODE_F21 = 112,
SDL_SCANCODE_F22 = 113,
SDL_SCANCODE_F23 = 114,
SDL_SCANCODE_F24 = 115,
SDL_SCANCODE_EXECUTE = 116,
SDL_SCANCODE_HELP = 117,
SDL_SCANCODE_MENU = 118,
SDL_SCANCODE_SELECT = 119,
SDL_SCANCODE_STOP = 120,
SDL_SCANCODE_AGAIN = 121,
SDL_SCANCODE_UNDO = 122,
SDL_SCANCODE_CUT = 123,
SDL_SCANCODE_COPY = 124,
SDL_SCANCODE_PASTE = 125,
SDL_SCANCODE_FIND = 126,
SDL_SCANCODE_MUTE = 127,
SDL_SCANCODE_VOLUMEUP = 128,
SDL_SCANCODE_VOLUMEDOWN = 129,
SDL_SCANCODE_KP_COMMA = 133,
SDL_SCANCODE_KP_EQUALSAS400 = 134,
SDL_SCANCODE_INTERNATIONAL1 = 135,
SDL_SCANCODE_INTERNATIONAL2 = 136,
SDL_SCANCODE_INTERNATIONAL3 = 137,
SDL_SCANCODE_INTERNATIONAL4 = 138,
SDL_SCANCODE_INTERNATIONAL5 = 139,
SDL_SCANCODE_INTERNATIONAL6 = 140,
SDL_SCANCODE_INTERNATIONAL7 = 141,
SDL_SCANCODE_INTERNATIONAL8 = 142,
SDL_SCANCODE_INTERNATIONAL9 = 143,
SDL_SCANCODE_LANG1 = 144,
SDL_SCANCODE_LANG2 = 145,
SDL_SCANCODE_LANG3 = 146,
SDL_SCANCODE_LANG4 = 147,
SDL_SCANCODE_LANG5 = 148,
SDL_SCANCODE_LANG6 = 149,
SDL_SCANCODE_LANG7 = 150,
SDL_SCANCODE_LANG8 = 151,
SDL_SCANCODE_LANG9 = 152,
SDL_SCANCODE_ALTERASE = 153,
SDL_SCANCODE_SYSREQ = 154,
SDL_SCANCODE_CANCEL = 155,
SDL_SCANCODE_CLEAR = 156,
SDL_SCANCODE_PRIOR = 157,
SDL_SCANCODE_RETURN2 = 158,
SDL_SCANCODE_SEPARATOR = 159,
SDL_SCANCODE_OUT = 160,
SDL_SCANCODE_OPER = 161,
SDL_SCANCODE_CLEARAGAIN = 162,
SDL_SCANCODE_CRSEL = 163,
SDL_SCANCODE_EXSEL = 164,
SDL_SCANCODE_KP_00 = 176,
SDL_SCANCODE_KP_000 = 177,
SDL_SCANCODE_THOUSANDSSEPARATOR = 178,
SDL_SCANCODE_DECIMALSEPARATOR = 179,
SDL_SCANCODE_CURRENCYUNIT = 180,
SDL_SCANCODE_CURRENCYSUBUNIT = 181,
SDL_SCANCODE_KP_LEFTPAREN = 182,
SDL_SCANCODE_KP_RIGHTPAREN = 183,
SDL_SCANCODE_KP_LEFTBRACE = 184,
SDL_SCANCODE_KP_RIGHTBRACE = 185,
SDL_SCANCODE_KP_TAB = 186,
SDL_SCANCODE_KP_BACKSPACE = 187,
SDL_SCANCODE_KP_A = 188,
SDL_SCANCODE_KP_B = 189,
SDL_SCANCODE_KP_C = 190,
SDL_SCANCODE_KP_D = 191,
SDL_SCANCODE_KP_E = 192,
SDL_SCANCODE_KP_F = 193,
SDL_SCANCODE_KP_XOR = 194,
SDL_SCANCODE_KP_POWER = 195,
SDL_SCANCODE_KP_PERCENT = 196,
SDL_SCANCODE_KP_LESS = 197,
SDL_SCANCODE_KP_GREATER = 198,
SDL_SCANCODE_KP_AMPERSAND = 199,
SDL_SCANCODE_KP_DBLAMPERSAND = 200,
SDL_SCANCODE_KP_VERTICALBAR = 201,
SDL_SCANCODE_KP_DBLVERTICALBAR = 202,
SDL_SCANCODE_KP_COLON = 203,
SDL_SCANCODE_KP_HASH = 204,
SDL_SCANCODE_KP_SPACE = 205,
SDL_SCANCODE_KP_AT = 206,
SDL_SCANCODE_KP_EXCLAM = 207,
SDL_SCANCODE_KP_MEMSTORE = 208,
SDL_SCANCODE_KP_MEMRECALL = 209,
SDL_SCANCODE_KP_MEMCLEAR = 210,
SDL_SCANCODE_KP_MEMADD = 211,
SDL_SCANCODE_KP_MEMSUBTRACT = 212,
SDL_SCANCODE_KP_MEMMULTIPLY = 213,
SDL_SCANCODE_KP_MEMDIVIDE = 214,
SDL_SCANCODE_KP_PLUSMINUS = 215,
SDL_SCANCODE_KP_CLEAR = 216,
SDL_SCANCODE_KP_CLEARENTRY = 217,
SDL_SCANCODE_KP_BINARY = 218,
SDL_SCANCODE_KP_OCTAL = 219,
SDL_SCANCODE_KP_DECIMAL = 220,
SDL_SCANCODE_KP_HEXADECIMAL = 221,
SDL_SCANCODE_LCTRL = 224,
SDL_SCANCODE_LSHIFT = 225,
SDL_SCANCODE_LALT = 226,
SDL_SCANCODE_LGUI = 227,
SDL_SCANCODE_RCTRL = 228,
SDL_SCANCODE_RSHIFT = 229,
SDL_SCANCODE_RALT = 230,
SDL_SCANCODE_RGUI = 231,
SDL_SCANCODE_MODE = 257,
SDL_SCANCODE_AUDIONEXT = 258,
SDL_SCANCODE_AUDIOPREV = 259,
SDL_SCANCODE_AUDIOSTOP = 260,
SDL_SCANCODE_AUDIOPLAY = 261,
SDL_SCANCODE_AUDIOMUTE = 262,
SDL_SCANCODE_MEDIASELECT = 263,
SDL_SCANCODE_WWW = 264,
SDL_SCANCODE_MAIL = 265,
SDL_SCANCODE_CALCULATOR = 266,
SDL_SCANCODE_COMPUTER = 267,
SDL_SCANCODE_AC_SEARCH = 268,
SDL_SCANCODE_AC_HOME = 269,
SDL_SCANCODE_AC_BACK = 270,
SDL_SCANCODE_AC_FORWARD = 271,
SDL_SCANCODE_AC_STOP = 272,
SDL_SCANCODE_AC_REFRESH = 273,
SDL_SCANCODE_AC_BOOKMARKS = 274,
SDL_SCANCODE_BRIGHTNESSDOWN = 275,
SDL_SCANCODE_BRIGHTNESSUP = 276,
SDL_SCANCODE_DISPLAYSWITCH = 277,
SDL_SCANCODE_KBDILLUMTOGGLE = 278,
SDL_SCANCODE_KBDILLUMDOWN = 279,
SDL_SCANCODE_KBDILLUMUP = 280,
SDL_SCANCODE_EJECT = 281,
SDL_SCANCODE_SLEEP = 282,
SDL_SCANCODE_APP1 = 283,
SDL_SCANCODE_APP2 = 284,
SDL_NUM_SCANCODES = 512
}
}
mixin(expandEnum!SDL_Scancode);
|
D
|
// Copyright Ahmet Sait Koçak 2020.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// https://www.boost.org/LICENSE_1_0.txt)
module bindbc.hb.bind.ot.deprecated_;
version(HB_with_deprecated):
import bindbc.hb.bind.common;
import bindbc.hb.bind.face;
import bindbc.hb.bind.ot.math;
import bindbc.hb.bind.ot.name;
extern(C) @nogc nothrow:
/* https://github.com/harfbuzz/harfbuzz/issues/1734 */
enum HB_MATH_GLYPH_PART_FLAG_EXTENDER = HB_OT_MATH_GLYPH_PART_FLAG_EXTENDER;
/* Like hb_ot_layout_table_find_script, but takes zero-terminated array of scripts to test */
version(BindHB_Static)
hb_bool_t hb_ot_layout_table_choose_script (
hb_face_t* face,
hb_tag_t table_tag,
const(hb_tag_t)* script_tags,
uint* script_index,
hb_tag_t* chosen_script);
else
{
private alias fp_hb_ot_layout_table_choose_script = hb_bool_t function (
hb_face_t* face,
hb_tag_t table_tag,
const(hb_tag_t)* script_tags,
uint* script_index,
hb_tag_t* chosen_script);
__gshared fp_hb_ot_layout_table_choose_script hb_ot_layout_table_choose_script;
}
version(BindHB_Static)
hb_bool_t hb_ot_layout_script_find_language (
hb_face_t* face,
hb_tag_t table_tag,
uint script_index,
hb_tag_t language_tag,
uint* language_index);
else
{
private alias fp_hb_ot_layout_script_find_language = hb_bool_t function (
hb_face_t* face,
hb_tag_t table_tag,
uint script_index,
hb_tag_t language_tag,
uint* language_index);
__gshared fp_hb_ot_layout_script_find_language hb_ot_layout_script_find_language;
}
version(BindHB_Static)
void hb_ot_tags_from_script (
hb_script_t script,
hb_tag_t* script_tag_1,
hb_tag_t* script_tag_2);
else
{
private alias fp_hb_ot_tags_from_script = void function (
hb_script_t script,
hb_tag_t* script_tag_1,
hb_tag_t* script_tag_2);
__gshared fp_hb_ot_tags_from_script hb_ot_tags_from_script;
}
version(BindHB_Static)
hb_tag_t hb_ot_tag_from_language (hb_language_t language);
else
{
private alias fp_hb_ot_tag_from_language = hb_tag_t function (hb_language_t language);
__gshared fp_hb_ot_tag_from_language hb_ot_tag_from_language;
}
/**
* HB_OT_VAR_NO_AXIS_INDEX:
*
* Since: 1.4.2
* Deprecated: 2.2.0
*/
enum HB_OT_VAR_NO_AXIS_INDEX = 0xFFFFFFFFu;
/**
* hb_ot_var_axis_t:
*
* Since: 1.4.2
* Deprecated: 2.2.0
*/
struct hb_ot_var_axis_t
{
hb_tag_t tag;
hb_ot_name_id_t name_id;
float min_value;
float default_value;
float max_value;
}
/* IN/OUT */
/* OUT */
version(BindHB_Static)
uint hb_ot_var_get_axes (
hb_face_t* face,
uint start_offset,
uint* axes_count,
hb_ot_var_axis_t* axes_array);
else
{
private alias fp_hb_ot_var_get_axes = uint function (
hb_face_t* face,
uint start_offset,
uint* axes_count,
hb_ot_var_axis_t* axes_array);
__gshared fp_hb_ot_var_get_axes hb_ot_var_get_axes;
}
version(BindHB_Static)
hb_bool_t hb_ot_var_find_axis (
hb_face_t* face,
hb_tag_t axis_tag,
uint* axis_index,
hb_ot_var_axis_t* axis_info);
else
{
private alias fp_hb_ot_var_find_axis = hb_bool_t function (
hb_face_t* face,
hb_tag_t axis_tag,
uint* axis_index,
hb_ot_var_axis_t* axis_info);
__gshared fp_hb_ot_var_find_axis hb_ot_var_find_axis;
}
|
D
|
/*
* #20 Kirgo doesn't give a beer to the player
*
* The dialog function is called (the dialog lines are aborted) and the number of beers in the hero inventory are
* counted
*
* Expected behavior: The hero will receive one beer from Kirgo (automatically removed after the test is complete)
*/
func int G1CP_Test_020() {
// Check status of the test
var int passed; passed = TRUE;
// Find Kirgo first
var int symbId; symbId = MEM_GetSymbolIndex("Grd_251_Kirgo");
if (symbId == -1) {
G1CP_TestsuiteErrorDetail("NPC 'Grd_251_Kirgo' not found");
passed = FALSE;
};
// Check if Kirgo exists in the world
var C_Npc kirgo; kirgo = Hlp_GetNpc(symbId);
if (!Hlp_IsValidNpc(kirgo)) {
G1CP_TestsuiteErrorDetail("NPC 'Grd_251_Kirgo' not valid");
passed = FALSE;
};
// Check if the dialog function exists
var int funcId; funcId = MEM_GetSymbolIndex("Info_Kirgo_Charge_Beer");
if (funcId == -1) {
G1CP_TestsuiteErrorDetail("Dialog function 'Info_Kirgo_Charge_Beer' not found");
passed = FALSE;
};
// Check if the beer item exists
var int beerId; beerId = MEM_GetSymbolIndex("ItFoBeer");
if (beerId == -1) {
G1CP_TestsuiteErrorDetail("Item 'ItFoBeer' not found");
passed = FALSE;
};
// At the latest now, we need to stop if there are fails already
if (!passed) {
return FALSE;
};
// Remember the number of beers the player has before
CreateInvItem(hero, beerId); // Have at least one (to see if the number decreases)
var int beersBefore; beersBefore = Npc_HasItems(hero, beerId);
// Backup self and other
var C_Npc slfBak; slfBak = MEM_CpyInst(self);
var C_Npc othBak; othBak = MEM_CpyInst(other);
// Set self and other
self = MEM_CpyInst(kirgo);
other = MEM_CpyInst(hero);
// Just run the dialog and see what happens
MEM_CallByID(funcId);
// Restore self and other
self = MEM_CpyInst(slfBak);
other = MEM_CpyInst(othBak);
// Stop the output units
Npc_ClearAIQueue(hero);
AI_StandUpQuick(hero);
// Check how many beers the player has now
var int beersAfter; beersAfter = Npc_HasItems(hero, beerId);
// Revert to the previous number
if (beersAfter < beersBefore-1) {
CreateInvItems(hero, beerId, (beersBefore-1) - beersAfter);
} else if (beersAfter > beersBefore-1) {
Npc_RemoveInvItems(hero, beerId, beersAfter - (beersBefore-1));
};
// Confirm that the fix worked
var string msg;
if (beersAfter == beersBefore) {
G1CP_TestsuiteErrorDetail("The hero did not receive a beer");
return FALSE;
} else if (beersAfter > beersBefore+1) {
msg = ConcatStrings("The hero received ", IntToString(beersAfter-(beersBefore+1)));
msg = ConcatStrings(msg, " beers too many");
G1CP_TestsuiteErrorDetail(msg);
return FALSE;
} else if (beersAfter < beersBefore) {
msg = ConcatStrings("The hero lost ", IntToString(beersBefore-beersAfter));
msg = ConcatStrings(msg, " beers");
G1CP_TestsuiteErrorDetail(msg);
return FALSE;
} else { // (beersAfter == beersBefore+1)
return TRUE;
};
};
|
D
|
module graphic.internal.vars;
/*
* All global state of package graphic.internal goes in here.
*/
import basics.globals;
import basics.matrix;
import graphic.cutbit;
import graphic.internal.names;
public import graphic.color;
public import net.style;
package:
bool wantRecoloredGraphics;
Cutbit[InternalImage.max + 1] loadedCutbitMayBeScaled;
Cutbit[Style.max] spritesheets;
Cutbit[Style.max] panelInfoIcons;
Cutbit[Style.max] skillButtonIcons;
Cutbit[Style.max] goalMarkers;
Cutbit nullCutbit; // invalid bitmap to return instead of null pointer
Alcol3D[Style.max] alcol3DforStyles;
Matrix!Point eyesOnSpritesheet;
enum SpecialRecol {
ordinary,
spritesheets,
panelInfoIcons,
skillButtonIcons,
}
string scaleDir() // From which dir should we load?
{
return _scaleDir != "" ? _scaleDir : dirDataBitmap.rootless;
}
void implSetScale(in float scale)
{
_scaleDir =
scale < 1.5f ? dirDataBitmap.rootless
: scale < 2.0f ? dirDataBitmapScale ~ "150/"
: scale < 3.0f ? dirDataBitmapScale ~ "200/"
: dirDataBitmapScale ~ "300/";
}
private string _scaleDir = "";
|
D
|
/++
$(H2 Multidimensional mutation algorithms)
This is a submodule of $(MREF mir,ndslice).
$(BOOKTABLE $(H2 Function),
$(TR $(TH Function Name) $(TH Description))
$(T2 transposeInPlace, Transposes square matrix in place.)
)
License: $(HTTP boost.org/LICENSE_1_0.txt, Boost License 1.0).
Copyright: Copyright © 2016-, Ilya Yaroshenko
Authors: Ilya Yaroshenko
Macros:
SUBREF = $(REF_ALTTEXT $(TT $2), $2, mir, ndslice, $1)$(NBSP)
T2=$(TR $(TDNW $(LREF $1)) $(TD $+))
+/
module mir.ndslice.mutation;
import mir.ndslice.algorithm: eachUploPair;
import mir.utility: swap;
deprecated("use eachUploPair!swap instead")
alias transposeInPlace = eachUploPair!swap;
|
D
|
# FIXED
svgen_current.obj: C:/ti/motorware/motorware_1_01_00_18/sw/modules/svgen/src/32b/svgen_current.c
svgen_current.obj: C:/ti/motorware/motorware_1_01_00_18/sw/modules/svgen/src/32b/svgen_current.h
svgen_current.obj: C:/ti/motorware/motorware_1_01_00_18/sw/modules/math/src/32b/math.h
svgen_current.obj: C:/ti/motorware/motorware_1_01_00_18/sw/modules/iqmath/src/32b/IQmathLib.h
svgen_current.obj: C:/ti/ccsv7/tools/compiler/ti-cgt-c2000_16.9.3.LTS/include/limits.h
svgen_current.obj: C:/ti/motorware/motorware_1_01_00_18/sw/modules/types/src/types.h
svgen_current.obj: C:/ti/ccsv7/tools/compiler/ti-cgt-c2000_16.9.3.LTS/include/stdbool.h
svgen_current.obj: C:/ti/ccsv7/tools/compiler/ti-cgt-c2000_16.9.3.LTS/include/string.h
svgen_current.obj: C:/ti/ccsv7/tools/compiler/ti-cgt-c2000_16.9.3.LTS/include/linkage.h
svgen_current.obj: C:/ti/ccsv7/tools/compiler/ti-cgt-c2000_16.9.3.LTS/include/stdint.h
C:/ti/motorware/motorware_1_01_00_18/sw/modules/svgen/src/32b/svgen_current.c:
C:/ti/motorware/motorware_1_01_00_18/sw/modules/svgen/src/32b/svgen_current.h:
C:/ti/motorware/motorware_1_01_00_18/sw/modules/math/src/32b/math.h:
C:/ti/motorware/motorware_1_01_00_18/sw/modules/iqmath/src/32b/IQmathLib.h:
C:/ti/ccsv7/tools/compiler/ti-cgt-c2000_16.9.3.LTS/include/limits.h:
C:/ti/motorware/motorware_1_01_00_18/sw/modules/types/src/types.h:
C:/ti/ccsv7/tools/compiler/ti-cgt-c2000_16.9.3.LTS/include/stdbool.h:
C:/ti/ccsv7/tools/compiler/ti-cgt-c2000_16.9.3.LTS/include/string.h:
C:/ti/ccsv7/tools/compiler/ti-cgt-c2000_16.9.3.LTS/include/linkage.h:
C:/ti/ccsv7/tools/compiler/ti-cgt-c2000_16.9.3.LTS/include/stdint.h:
|
D
|
/Users/edwardhuang/Documents/MichiganHackersiOSApp/DerivedData/Michigan\ Hackers/Build/Intermediates.noindex/Pods.build/Debug-iphonesimulator/JTAppleCalendar.build/Objects-normal/x86_64/JTAppleCalendarView.o : /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/JTAppleCell.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/JTAppleCalendarDelegateProtocol.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/JTAppleCalendarLayoutProtocol.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/JTAppleCalendarVariables.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/UIScrollViewDelegates.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/UICollectionViewDelegates.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/JTCalendarProtocols.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/CalendarEnums.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/GlobalFunctionsAndExtensions.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/InternalActionFunctions.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/UserInteractionFunctions.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/InternalQueryFunctions.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/CalendarStructs.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/JTAppleCalendarLayout.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/JTAppleCollectionReusableView.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/JTAppleCalendarView.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Metal.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreFoundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/Target\ Support\ Files/JTAppleCalendar/JTAppleCalendar-umbrella.h /Users/edwardhuang/Documents/MichiganHackersiOSApp/DerivedData/Michigan\ Hackers/Build/Intermediates.noindex/Pods.build/Debug-iphonesimulator/JTAppleCalendar.build/unextended-module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/OpenGLES.framework/Headers/OpenGLES.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/UIKit.framework/Headers/UIKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
/Users/edwardhuang/Documents/MichiganHackersiOSApp/DerivedData/Michigan\ Hackers/Build/Intermediates.noindex/Pods.build/Debug-iphonesimulator/JTAppleCalendar.build/Objects-normal/x86_64/JTAppleCalendarView~partial.swiftmodule : /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/JTAppleCell.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/JTAppleCalendarDelegateProtocol.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/JTAppleCalendarLayoutProtocol.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/JTAppleCalendarVariables.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/UIScrollViewDelegates.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/UICollectionViewDelegates.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/JTCalendarProtocols.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/CalendarEnums.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/GlobalFunctionsAndExtensions.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/InternalActionFunctions.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/UserInteractionFunctions.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/InternalQueryFunctions.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/CalendarStructs.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/JTAppleCalendarLayout.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/JTAppleCollectionReusableView.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/JTAppleCalendarView.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Metal.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreFoundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/Target\ Support\ Files/JTAppleCalendar/JTAppleCalendar-umbrella.h /Users/edwardhuang/Documents/MichiganHackersiOSApp/DerivedData/Michigan\ Hackers/Build/Intermediates.noindex/Pods.build/Debug-iphonesimulator/JTAppleCalendar.build/unextended-module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/OpenGLES.framework/Headers/OpenGLES.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/UIKit.framework/Headers/UIKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
/Users/edwardhuang/Documents/MichiganHackersiOSApp/DerivedData/Michigan\ Hackers/Build/Intermediates.noindex/Pods.build/Debug-iphonesimulator/JTAppleCalendar.build/Objects-normal/x86_64/JTAppleCalendarView~partial.swiftdoc : /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/JTAppleCell.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/JTAppleCalendarDelegateProtocol.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/JTAppleCalendarLayoutProtocol.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/JTAppleCalendarVariables.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/UIScrollViewDelegates.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/UICollectionViewDelegates.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/JTCalendarProtocols.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/CalendarEnums.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/GlobalFunctionsAndExtensions.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/InternalActionFunctions.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/UserInteractionFunctions.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/InternalQueryFunctions.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/CalendarStructs.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/JTAppleCalendarLayout.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/JTAppleCollectionReusableView.swift /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/JTAppleCalendar/Sources/JTAppleCalendarView.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Metal.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreFoundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Users/edwardhuang/Documents/MichiganHackersiOSApp/Pods/Target\ Support\ Files/JTAppleCalendar/JTAppleCalendar-umbrella.h /Users/edwardhuang/Documents/MichiganHackersiOSApp/DerivedData/Michigan\ Hackers/Build/Intermediates.noindex/Pods.build/Debug-iphonesimulator/JTAppleCalendar.build/unextended-module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/OpenGLES.framework/Headers/OpenGLES.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/UIKit.framework/Headers/UIKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
|
D
|
module godot.c.transform2d;
@nogc nothrow:
extern(C):
struct godot_transform2d {
//ubyte[24] _dont_touch_that;
ulong[3] _opaque; /// temporary workaround for SysV ABI violation (bugs 5570 & 13207)
}
|
D
|
struct ClassFlags {
alias Type = uint;
enum Enum : int {
isCOMclass = 0x1,
noPointers = 0x2,
hasOffTi = 0x4,
hasCtor = 0x8,
hasGetMembers = 0x10,
hasTypeInfo = 0x20,
isAbstract = 0x40,
isCPPclass = 0x80,
hasDtor = 0x100,
}
alias isCOMclass = Enum.isCOMclass;
alias noPointers = Enum.noPointers;
alias hasOffTi = Enum.hasOffTi;
alias hasCtor = Enum.hasCtor;
alias hasGetMembers = Enum.hasGetMembers;
alias hasTypeInfo = Enum.hasTypeInfo;
alias isAbstract = Enum.isAbstract;
alias isCPPclass = Enum.isCPPclass;
alias hasDtor = Enum.hasDtor;
}
|
D
|
/Users/admin/Desktop/krishnarjun/ImagineMovie/build/ImagineMovie.build/Debug-iphonesimulator/ImagineMovie.build/Objects-normal/x86_64/HomeViewController.o : /Users/admin/Desktop/krishnarjun/ImagineMovie/CommunicationModule/WebAPI.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/Model/Movie.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/AppDelegate.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/Cells/PopularTableViewCell.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/Cells/NewReleaseCollectionViewCell.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/Cells/InTheaterCollectionViewCell.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/Model/DataProvider.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/CinemaViewController.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/HomeViewController.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/ComingSoonViewController.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/UserViewController.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/ContentViewController.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/LoyaltyViewController.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/Model/Constants.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Metal.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreFoundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/OpenGLES.framework/Headers/OpenGLES.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/UIKit.framework/Headers/UIKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
/Users/admin/Desktop/krishnarjun/ImagineMovie/build/ImagineMovie.build/Debug-iphonesimulator/ImagineMovie.build/Objects-normal/x86_64/HomeViewController~partial.swiftmodule : /Users/admin/Desktop/krishnarjun/ImagineMovie/CommunicationModule/WebAPI.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/Model/Movie.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/AppDelegate.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/Cells/PopularTableViewCell.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/Cells/NewReleaseCollectionViewCell.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/Cells/InTheaterCollectionViewCell.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/Model/DataProvider.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/CinemaViewController.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/HomeViewController.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/ComingSoonViewController.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/UserViewController.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/ContentViewController.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/LoyaltyViewController.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/Model/Constants.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Metal.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreFoundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/OpenGLES.framework/Headers/OpenGLES.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/UIKit.framework/Headers/UIKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
/Users/admin/Desktop/krishnarjun/ImagineMovie/build/ImagineMovie.build/Debug-iphonesimulator/ImagineMovie.build/Objects-normal/x86_64/HomeViewController~partial.swiftdoc : /Users/admin/Desktop/krishnarjun/ImagineMovie/CommunicationModule/WebAPI.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/Model/Movie.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/AppDelegate.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/Cells/PopularTableViewCell.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/Cells/NewReleaseCollectionViewCell.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/Cells/InTheaterCollectionViewCell.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/Model/DataProvider.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/CinemaViewController.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/HomeViewController.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/ComingSoonViewController.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/UserViewController.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/ContentViewController.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/ImagineMovie/LoyaltyViewController.swift /Users/admin/Desktop/krishnarjun/ImagineMovie/Model/Constants.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Metal.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreFoundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/OpenGLES.framework/Headers/OpenGLES.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/UIKit.framework/Headers/UIKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
|
D
|
// Written in the D programming language.
/**
This module contains common Dialog implementation.
Synopsis:
----
import dlangui.dialogs.msgbox;
// show message box with single Ok button
window.showMessageBox(UIString("Dialog title"d), UIString("Some message"d));
// show message box with OK and CANCEL buttons, cancel by default, and handle its result
window.showMessageBox(UIString("Dialog title"d), UIString("Some message"d), [ACTION_OK, ACTION_CANCEL], 1, delegate(const Action a) {
if (a.id == StandardAction.Ok)
Log.d("OK pressed");
else if (a.id == StandardAction.Cancel)
Log.d("CANCEL pressed");
return true;
});
----
Copyright: Vadim Lopatin, 2014
License: Boost License 1.0
Authors: Vadim Lopatin, coolreader.org@gmail.com
*/
module dlangui.dialogs.msgbox;
import dlangui.core.i18n;
import dlangui.core.signals;
import dlangui.core.stdaction;
import dlangui.widgets.layouts;
import dlangui.widgets.controls;
import dlangui.platforms.common.platform;
import dlangui.dialogs.dialog;
/// Message box
class MessageBox : Dialog {
protected UIString _message;
protected const(Action)[] _actions;
protected int _defaultButtonIndex;
this(UIString caption, UIString message, Window parentWindow = null, const(Action) [] buttons = [ACTION_OK], int defaultButtonIndex = 0, bool delegate(const Action result) handler = null) {
super(caption, parentWindow, DialogFlag.Modal | (Platform.instance.uiDialogDisplayMode & DialogDisplayMode.messageBoxInPopup ? DialogFlag.Popup : 0));
_message = message;
_actions = buttons;
_defaultButtonIndex = defaultButtonIndex;
if (handler) {
dialogResult = delegate (Dialog dlg, const Action action) {
handler(action);
};
}
}
/// override to implement creation of dialog controls
override void initialize() {
TextWidget msg = new MultilineTextWidget("msg", _message);
padding(Rect(10, 10, 10, 10));
msg.padding(Rect(10, 10, 10, 10));
addChild(msg);
addChild(createButtonsPanel(_actions, _defaultButtonIndex, 0));
}
}
|
D
|
import std.stdio;
import std.datetime;
import std.random;
const long N = 20000;
const int size = 10;
alias int value_type;
alias long result_type;
alias value_type[] vector_t;
alias ulong size_type;
value_type scalar_product(const ref vector_t x, const ref vector_t y) {
value_type res = 0;
size_type siz = x.length;
for (size_type i = 0; i < siz; ++i)
res += x[i] * y[i];
return res;
}
int main() {
auto tm_before = Clock.currTime();
// 1. allocate and fill randomly many short vectors
vector_t[] xs;
xs.length = N;
for (int i = 0; i < N; ++i) {
xs[i].length = size;
}
writefln("allocation: %s ", (Clock.currTime() - tm_before));
tm_before = Clock.currTime();
for (int i = 0; i < N; ++i)
for (int j = 0; j < size; ++j)
xs[i][j] = uniform(-1000, 1000);
writefln("random: %s ", (Clock.currTime() - tm_before));
tm_before = Clock.currTime();
// 2. compute all pairwise scalar products:
result_type avg = cast(result_type) 0;
for (int i = 0; i < N; ++i)
for (int j = 0; j < N; ++j)
avg += scalar_product(xs[i], xs[j]);
avg = avg / N*N;
writefln("result: %s", avg);
auto time = Clock.currTime() - tm_before;
writefln("scalar products: %s ", time);
return 0;
}
|
D
|
a wrong action attributable to bad judgment or ignorance or inattention
an understanding of something that is not correct
part of a statement that is not correct
identify incorrectly
to make a mistake or be incorrect
|
D
|
module ogre.general.atomicwrappers;
import core.atomic;
import core.sync.mutex;
/** \addtogroup Core
* @{
*/
/** \addtogroup General
* @{
*/
struct AtomicScalar(T) {
this (T initial)
{
mField = initial;
//mField = new T();
//*mField = initial;
}
this (AtomicScalar!T cousin)
{
mField = cousin.mField;
//mField = new T();
//*mField = cousin.mField;
}
//this (){ }
void opAssign (AtomicScalar!T cousin)
{
set(cousin.mField);
}
T get ()
{
// no lock required here
// since get will not interfere with set or cas
// we may get a stale value, but this is ok
return mField;
//return atomicLoad(mField);
}
void set (T v)
{
atomicStore(mField, v);
//atomicStore(*mField, v);
}
bool cas (T old,T nu)
{
return core.atomic.cas(&mField, old, nu);
}
T opUnary (string op)()
{
if (op == "++")
return opAddAssign(cast(T)1);
else if (op == "--")
return opSubAssign(cast(T)1);
}
T opBinary (string op)(int i)
{
return mixin(`atomicOp!"`~ op ~ `"(mField, i)`);
}
T opAddAssign(T add)
{
return atomicOp!"+="(mField, add);
}
T opSubAssign(T sub)
{
return atomicOp!"-="(mField, sub);
}
protected:
//volatile
shared T mField;
// Use heap memory to ensure an optimizing
// compiler doesn't put things in registers.
//T *mField = new T();
// but pointer stuff is used with atomicFence() ?
}
//class
struct AtomicScalarWithMutex(T) {
public:
this (T initial)
{
mLock = new Mutex;
mField = initial;
}
this (AtomicScalar!T cousin)
{
mLock = new Mutex;
mField = cousin.mField;
}
//this (){ }
void opAssign (AtomicScalar!T cousin)
{
synchronized(mLock)
{
mField = cousin.mField;
}
}
T get ()
{
// no lock required here
// since get will not interfere with set or cas
// we may get a stale value, but this is ok
return mField;
}
void set (T v)
{
synchronized(mLock)
{
mField = v;
}
}
bool cas (T old,T nu)
{
synchronized(mLock)
{
if (mField != old) return false;
mField = nu;
return true;
}
}
T opUnary (string op)()
{
if(op == "++")
{
synchronized(mLock)
return ++mField;
}
else if(op == "--")
{
synchronized(mLock)
return --mField;
}
}
T opUnary (string op)(int)
{
if(op == "++")
{
synchronized(mLock)
return ++mField;
}
else if(op == "--")
{
synchronized(mLock)
return --mField;
}
}
T opAddAssign(T add)
{
synchronized(mLock)
{
mField += add;
return mField;
}
}
T opSubAssign(T sub)
{
synchronized(mLock)
{
mField -= sub;
return mField;
}
}
protected:
Mutex mLock;
//volatile
T mField;
invariant()
{
assert(mLock !is null);
}
}
/** @} */
/** @} */
|
D
|
instance Pal_239_Ritter (Npc_Default)
{
// ------ NSC ------
name = NAME_Ritter;
guild = GIL_PAL;
id = 239;
voice = 12;
flags = 0;
npctype = NPCTYPE_AMBIENT;
// ------ Attribute ------
B_SetAttributesToChapter (self, 5);
// ------ Kampf-Taktik ------
fight_tactic = FAI_HUMAN_MASTER;
// ------ Equippte Waffen ------
EquipItem (self, ItMw_1H_Pal_Sword);
// ------ Inventory ------
B_CreateAmbientInv (self);
// ------ visuals ------
B_SetNpcVisual (self, MALE, "Hum_Head_Fighter", Face_N_NormalBart_Grim, BodyTex_N, ITAR_PAL_M);
Mdl_SetModelFatness (self, 0);
Mdl_ApplyOverlayMds (self, "Humans_Militia.mds");
// ------ NSC-relevante Talente vergeben ------
B_GiveNpcTalents (self);
// ------ Kampf-Talente ------
B_SetFightSkills (self, 80);
// ------ TA anmelden ------
daily_routine = Rtn_Start_239;
};
FUNC VOID Rtn_Start_239 ()
{
TA_Smalltalk (08,00,23,00,"NW_CITY_PALCAMP_03");
TA_Stand_WP (23,00,08,00,"NW_CITY_PALCAMP_10");
};
|
D
|
/*******************************************************************************
copyright: Copyright (c) 2008. Fawzi Mohamed
license: BSD стиль: $(LICENSE)
version: Initial release: July 2008
author: Fawzi Mohamed
*******************************************************************************/
module math.random.ExpSource;
private import Целое = text.convert.Integer;
import math.Math:эксп,лог;
import math.random.Ziggurat;
import core.Traits:типРеал_ли;
/// class that returns exponential distributed numbers (f=эксп(-x) for x>0, 0 otherwise)
final class ЭкспИсточник(СлучГ,T){
static assert(типРеал_ли!(T),T.stringof~" not acceptable, only floating точка variables supported");
/// probability ни в каком дистрибутиве
static реал плотностьВерФ(реал x){ return эксп(-x); }
/// inverse probability ни в каком дистрибутиве
static реал инвПлотностьВерФ(реал x){ return -лог(x); }
/// complement of the cumulative density ни в каком дистрибутиве (integral x..infinity плотностьВерФ)
static реал кумПлотностьВерФКомпл(реал x){ return эксп(-x); }
/// хвост for exponential ни в каком дистрибутиве
static T хвостГенератор(СлучГ r, T dMin)
{
return dMin-лог(r.униформа!(T));
}
alias Циггурат!(СлучГ,T,плотностьВерФ,хвостГенератор,нет) ТИсток;
/// internal источник of эксп distribued numbers
ТИсток источник;
/// initializes the probability ни в каком дистрибутиве
this(СлучГ r){
источник=ТИсток.создай!(инвПлотностьВерФ,кумПлотностьВерФКомпл)(r,0xf.64ec94bf5dc14bcp-1L);
}
/// chainable вызов стиль initialization of variables (thorugh a вызов в_ рандомируй)
ЭкспИсточник opCall(U,S...)(ref U a,S арги){
рандомируй(a,арги);
return this;
}
/// returns a эксп distribued число
T дайСлучайный(){
return источник.дайСлучайный();
}
/// returns a эксп distribued число with the given бета (survival rate, average)
/// f=1/бета*эксп(-x/бета)
T дайСлучайный(T бета){
return бета*источник.дайСлучайный();
}
/// initializes the given переменная with an exponentially distribued число
U рандомируй(U)(ref U x){
return источник.рандомируй(x);
}
/// initializes the given переменная with an exponentially distribued число with
/// шкала parameter бета
U рандомируй(U,V)(ref U x,V бета){
return источник.рандомирОп((T el){ return el*cast(T)бета; },x);
}
/// initializes the given переменная with an exponentially distribued число и maps op on it
U рандомирОп(U,S)(S delegate(T)op,ref U a){
return источник.рандомирОп(op,a);
}
/// эксп ни в каком дистрибутиве with different default шкала parameter бета
/// f=1/бета*эксп(-x/бета) for x>0, 0 otherwise
struct ЭкспДистрибуция{
T бета;
ЭкспИсточник источник; // does not use Циггурат directly в_ keep this struct small
/// constructor
static ЭкспДистрибуция создай()(ЭкспИсточник источник,T бета){
ЭкспДистрибуция рез;
рез.бета=бета;
рез.источник=источник;
return рез;
}
/// chainable вызов стиль initialization of variables (thorugh a вызов в_ рандомируй)
ЭкспДистрибуция opCall(U,S...)(ref U a,S арги){
рандомируй(a,арги);
return *this;
}
/// returns a single число
T дайСлучайный(){
return бета*источник.дайСлучайный();
}
/// инициализуй a
U рандомируй(U)(ref U a){
return источник.рандомирОп((T x){return бета*x; },a);
}
/// инициализуй a
U рандомируй(U,V)(ref U a,V b){
return источник.рандомирОп((T x){return (cast(T)b)*x; },a);
}
}
/// returns an эксп ни в каком дистрибутиве with a different бета
ЭкспДистрибуция экспД(T бета){
return ЭкспДистрибуция.создай(this,бета);
}
}
|
D
|
/*
* Hunt - a framework for web and console application based on Collie using Dlang development
*
* Copyright (C) 2015-2017 Shanghai Putao Technology Co., Ltd
*
* Developer: HuntLabs
*
* Licensed under the Apache-2.0 License.
*
*/
module hunt.routing.define;
public import kiss.logger;
public import hunt.http.request;
public import std.exception;
// default route group name
enum DEFAULT_ROUTE_GROUP = "default";
alias HandleFunction = void function(Request);
// support methods
enum HTTP_METHODS {
GET = 1,
POST,
PUT,
DELETE,
HEAD,
OPTIONS,
PATCH,
ALL
}
HTTP_METHODS getMethod(string method)
{
with(HTTP_METHODS){
if(method == "POST")
return POST;
else if (method == "GET")
return GET;
else if (method == "PUT")
return PUT;
else if (method == "DELETE")
return DELETE;
else if (method == "HEAD")
return HEAD;
else if (method == "OPTIONS")
return OPTIONS;
else if (method == "PATCH")
return PATCH;
else if (method == "*")
return ALL;
else
throw new Exception("unkonw method");
}
}
HTTP_METHODS[] stringToHTTPMethods(string method)
{
with(HTTP_METHODS){
if(method == "POST")
return [POST];
else if (method == "GET")
return [GET];
else if (method == "PUT")
return [PUT];
else if (method == "DELETE")
return [DELETE];
else if (method == "HEAD")
return [HEAD];
else if (method == "OPTIONS")
return [OPTIONS];
else if (method == "PATCH")
return [PATCH];
else if (method == "*")
return [GET,POST,PUT,DELETE,HEAD,OPTIONS,PATCH];
else
throw new Exception("unkonw method");
}
}
|
D
|
/**
* $(RED Deprecated. Use $(D core.sys.darwin.sys.cdefs) instead. This module
* will be removed in June 2018.)
*
* D header file for OSX
*
* Authors: Martin Nowak
*/
module core.sys.osx.sys.cdefs;
public import core.sys.darwin.sys.cdefs;
|
D
|
/* ----------------------------------------------------------------------------
* This file was automatically generated by SWIG (http://www.swig.org).
* Version 2.0.4
*
* Do not make changes to this file unless you know what you are doing--modify
* the SWIG interface file instead.
* ----------------------------------------------------------------------------- */
module TagLib.RIFF.RIFF;
static import TagLibD_im;
static import std.conv;
static import std.string;
import std.conv;
import std.string;
import core.stdc.stdlib;
static import TagLib.TagLib;
class File : TagLib.TagLib.File {
private void* swigCPtr;
public this(void* cObject, bool ownCObject) {
super(TagLibD_im.TagLib_RIFF_File_Upcast(cObject), ownCObject);
swigCPtr = cObject;
}
public static void* swigGetCPtr(File obj) {
return (obj is null) ? null : obj.swigCPtr;
}
mixin TagLibD_im.SwigOperatorDefinitions;
~this() {
dispose();
}
public override void dispose() {
synchronized(this) {
if (swigCPtr !is null) {
if (swigCMemOwn) {
swigCMemOwn = false;
TagLibD_im.delete_TagLib_RIFF_File(cast(void*)swigCPtr);
}
swigCPtr = null;
super.dispose();
}
}
}
}
|
D
|
/**
Copyright: Copyright (c) 2013-2018 Andrey Penechko.
License: $(WEB boost.org/LICENSE_1_0.txt, Boost License 1.0).
Authors: Andrey Penechko.
*/
module voxelman.world.gen.utils;
import voxelman.log;
import voxelman.math : ivec3, SimplexNoise;
import voxelman.world.block;
import voxelman.core.config;
import voxelman.thread.worker;
import voxelman.world.storage.chunk;
import voxelman.world.storage.coordinates;
enum AIR = 1;
enum GRASS = 2;
enum DIRT = 3;
enum STONE = 4;
enum SAND = 5;
enum WATER = 6;
enum LAVA = 7;
enum SNOW = 8;
struct ChunkGeneratorResult
{
bool uniform;
BlockId uniformBlockId;
}
double noise2d(int x, int z)
{
enum NUM_OCTAVES = 8;
enum DIVIDER = 50; // bigger - smoother
enum HEIGHT_MODIFIER = 4; // bigger - higher
double noise = 0.0;
foreach(i; 1..NUM_OCTAVES+1)
{
// [-1; 1]
noise += SimplexNoise.noise(cast(double)x/(DIVIDER*i), cast(double)z/(DIVIDER*i))*i*HEIGHT_MODIFIER;
}
return noise;
}
struct HeightmapChunkData
{
int[CHUNK_SIZE_SQR] heightMap = void;
int minHeight = int.max;
int maxHeight = int.min;
void generate(ivec3 chunkOffset)
{
foreach(i, ref elem; heightMap)
{
int cx = i & CHUNK_SIZE_BITS;
int cz = (i / CHUNK_SIZE) & CHUNK_SIZE_BITS;
elem = cast(int)noise2d(chunkOffset.x + cx, chunkOffset.z + cz);
if (elem > maxHeight)
maxHeight = elem;
if (elem < minHeight)
minHeight = elem;
}
}
}
|
D
|
/* $OpenBSD: dh.h,v 1.35 2022/07/12 14:42:49 kn Exp $ */
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
* All rights reserved.
*
* This package is an SSL implementation written
* by Eric Young (eay@cryptsoft.com).
* The implementation was written so as to conform with Netscapes SSL.
*
* This library is free for commercial and non-commercial use as long as
* the following conditions are aheared to. The following conditions
* apply to all code found in this distribution, be it the RC4, RSA,
* lhash, DES, etc., code; not just the SSL code. The SSL documentation
* included with this distribution is covered by the same copyright terms
* except that the holder is Tim Hudson (tjh@cryptsoft.com).
*
* Copyright remains Eric Young's, and as such any Copyright notices in
* the code are not to be removed.
* If this package is used in a product, Eric Young should be given attribution
* as the author of the parts of the library used.
* This can be in the form of a textual message at program startup or
* in documentation (online or textual) provided with the package.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* "This product includes cryptographic software written by
* Eric Young (eay@cryptsoft.com)"
* The word 'cryptographic' can be left out if the rouines from the library
* being used are not cryptographic related :-).
* 4. If you include any Windows specific code (or a derivative thereof) from
* the apps directory (application code) you must include an acknowledgement:
* "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
*
* THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* The licence and distribution terms for any publically available version or
* derivative of this code cannot be changed. i.e. this code cannot simply be
* copied and put under another distribution licence
* [including the GNU Public Licence.]
*/
module libressl.openssl.dh;
private static import core.stdc.config;
private static import libressl.compat.stdio;
private static import libressl.openssl.evp;
public import libressl.openssl.opensslconf;
public import libressl.openssl.ossl_typ;
version (OPENSSL_NO_DH) {
static assert(false, "DH is disabled.");
}
version (OPENSSL_NO_BIO) {
} else {
public import libressl.openssl.bio;
}
version (OPENSSL_NO_DEPRECATED) {
} else {
public import libressl.openssl.bn;
}
//#if !defined(OPENSSL_DH_MAX_MODULUS_BITS)
enum OPENSSL_DH_MAX_MODULUS_BITS = 10000;
//#endif
enum DH_FLAG_CACHE_MONT_P = 0x01;
/**
* If this flag is set the DH method is FIPS compliant and can be used
* in FIPS mode. This is set in the validated module method. If an
* application sets this flag in its own methods it is its reposibility
* to ensure the result is compliant.
*/
enum DH_FLAG_FIPS_METHOD = 0x0400;
/**
* If this flag is set the operations normally disabled in FIPS mode are
* permitted it is then the applications responsibility to ensure that the
* usage is compliant.
*/
enum DH_FLAG_NON_FIPS_ALLOW = 0x0400;
extern (C):
nothrow @nogc:
enum DH_GENERATOR_2 = 2;
/* enum DH_GENERATOR_3 = 3; */
enum DH_GENERATOR_5 = 5;
/* DH_check error codes */
enum DH_CHECK_P_NOT_PRIME = 0x01;
enum DH_CHECK_P_NOT_SAFE_PRIME = 0x02;
enum DH_UNABLE_TO_CHECK_GENERATOR = 0x04;
enum DH_NOT_SUITABLE_GENERATOR = 0x08;
enum DH_CHECK_Q_NOT_PRIME = 0x10;
enum DH_CHECK_INVALID_Q_VALUE = 0x20;
enum DH_CHECK_INVALID_J_VALUE = 0x40;
/* DH_check_pub_key error codes */
enum DH_CHECK_PUBKEY_TOO_SMALL = 0x01;
enum DH_CHECK_PUBKEY_TOO_LARGE = 0x02;
enum DH_CHECK_PUBKEY_INVALID = 0x04;
/**
* primes p where (p-1)/2 is prime too are called "safe"; we define
* this for backward compatibility:
*/
enum DH_CHECK_P_NOT_STRONG_PRIME = .DH_CHECK_P_NOT_SAFE_PRIME;
libressl.openssl.ossl_typ.DH* d2i_DHparams_bio(libressl.openssl.ossl_typ.BIO* bp, libressl.openssl.ossl_typ.DH** a);
int i2d_DHparams_bio(libressl.openssl.ossl_typ.BIO* bp, libressl.openssl.ossl_typ.DH* a);
libressl.openssl.ossl_typ.DH* d2i_DHparams_fp(libressl.compat.stdio.FILE* fp, libressl.openssl.ossl_typ.DH** a);
int i2d_DHparams_fp(libressl.compat.stdio.FILE* fp, libressl.openssl.ossl_typ.DH* a);
libressl.openssl.ossl_typ.DH* DHparams_dup(libressl.openssl.ossl_typ.DH*);
const (libressl.openssl.ossl_typ.DH_METHOD)* DH_OpenSSL();
void DH_set_default_method(const (libressl.openssl.ossl_typ.DH_METHOD)* meth);
const (libressl.openssl.ossl_typ.DH_METHOD)* DH_get_default_method();
int DH_set_method(libressl.openssl.ossl_typ.DH* dh, const (libressl.openssl.ossl_typ.DH_METHOD)* meth);
libressl.openssl.ossl_typ.DH* DH_new_method(libressl.openssl.ossl_typ.ENGINE* engine);
libressl.openssl.ossl_typ.DH* DH_new();
void DH_free(libressl.openssl.ossl_typ.DH* dh);
int DH_up_ref(libressl.openssl.ossl_typ.DH* dh);
int DH_size(const (libressl.openssl.ossl_typ.DH)* dh);
int DH_bits(const (libressl.openssl.ossl_typ.DH)* dh);
int DH_get_ex_new_index(core.stdc.config.c_long argl, void* argp, libressl.openssl.ossl_typ.CRYPTO_EX_new new_func, libressl.openssl.ossl_typ.CRYPTO_EX_dup dup_func, libressl.openssl.ossl_typ.CRYPTO_EX_free free_func);
int DH_set_ex_data(libressl.openssl.ossl_typ.DH* d, int idx, void* arg);
void* DH_get_ex_data(libressl.openssl.ossl_typ.DH* d, int idx);
int DH_security_bits(const (libressl.openssl.ossl_typ.DH)* dh);
libressl.openssl.ossl_typ.ENGINE* DH_get0_engine(libressl.openssl.ossl_typ.DH* d);
void DH_get0_pqg(const (libressl.openssl.ossl_typ.DH)* dh, const (libressl.openssl.ossl_typ.BIGNUM)** p, const (libressl.openssl.ossl_typ.BIGNUM)** q, const (libressl.openssl.ossl_typ.BIGNUM)** g);
int DH_set0_pqg(libressl.openssl.ossl_typ.DH* dh, libressl.openssl.ossl_typ.BIGNUM* p, libressl.openssl.ossl_typ.BIGNUM* q, libressl.openssl.ossl_typ.BIGNUM* g);
void DH_get0_key(const (libressl.openssl.ossl_typ.DH)* dh, const (libressl.openssl.ossl_typ.BIGNUM)** pub_key, const (libressl.openssl.ossl_typ.BIGNUM)** priv_key);
int DH_set0_key(libressl.openssl.ossl_typ.DH* dh, libressl.openssl.ossl_typ.BIGNUM* pub_key, libressl.openssl.ossl_typ.BIGNUM* priv_key);
const (libressl.openssl.ossl_typ.BIGNUM)* DH_get0_p(const (libressl.openssl.ossl_typ.DH)* dh);
const (libressl.openssl.ossl_typ.BIGNUM)* DH_get0_q(const (libressl.openssl.ossl_typ.DH)* dh);
const (libressl.openssl.ossl_typ.BIGNUM)* DH_get0_g(const (libressl.openssl.ossl_typ.DH)* dh);
const (libressl.openssl.ossl_typ.BIGNUM)* DH_get0_priv_key(const (libressl.openssl.ossl_typ.DH)* dh);
const (libressl.openssl.ossl_typ.BIGNUM)* DH_get0_pub_key(const (libressl.openssl.ossl_typ.DH)* dh);
void DH_clear_flags(libressl.openssl.ossl_typ.DH* dh, int flags);
int DH_test_flags(const (libressl.openssl.ossl_typ.DH)* dh, int flags);
void DH_set_flags(libressl.openssl.ossl_typ.DH* dh, int flags);
core.stdc.config.c_long DH_get_length(const (libressl.openssl.ossl_typ.DH)* dh);
int DH_set_length(libressl.openssl.ossl_typ.DH* dh, core.stdc.config.c_long length_);
/* Deprecated version */
version (OPENSSL_NO_DEPRECATED) {
} else {
libressl.openssl.ossl_typ.DH* DH_generate_parameters(int prime_len, int generator, void function(int, int, void*) nothrow @nogc callback, void* cb_arg);
}
/* New version */
int DH_generate_parameters_ex(libressl.openssl.ossl_typ.DH* dh, int prime_len, int generator, libressl.openssl.ossl_typ.BN_GENCB* cb);
int DH_check(const (libressl.openssl.ossl_typ.DH)* dh, int* codes);
int DH_check_pub_key(const (libressl.openssl.ossl_typ.DH)* dh, const (libressl.openssl.ossl_typ.BIGNUM)* pub_key, int* codes);
int DH_generate_key(libressl.openssl.ossl_typ.DH* dh);
int DH_compute_key(ubyte* key, const (libressl.openssl.ossl_typ.BIGNUM)* pub_key, libressl.openssl.ossl_typ.DH* dh);
libressl.openssl.ossl_typ.DH* d2i_DHparams(libressl.openssl.ossl_typ.DH** a, const (ubyte)** pp, core.stdc.config.c_long length_);
int i2d_DHparams(const (libressl.openssl.ossl_typ.DH)* a, ubyte** pp);
int DHparams_print_fp(libressl.compat.stdio.FILE* fp, const (libressl.openssl.ossl_typ.DH)* x);
version(OPENSSL_NO_BIO) {
int DHparams_print(char* bp, const (libressl.openssl.ossl_typ.DH)* x);
} else {
int DHparams_print(libressl.openssl.ossl_typ.BIO* bp, const (libressl.openssl.ossl_typ.DH)* x);
}
pragma(inline, true)
int EVP_PKEY_CTX_set_dh_paramgen_prime_len(libressl.openssl.ossl_typ.EVP_PKEY_CTX* ctx, int len)
do
{
return libressl.openssl.evp.EVP_PKEY_CTX_ctrl(ctx, libressl.openssl.evp.EVP_PKEY_DH, libressl.openssl.evp.EVP_PKEY_OP_PARAMGEN, .EVP_PKEY_CTRL_DH_PARAMGEN_PRIME_LEN, len, null);
}
pragma(inline, true)
int EVP_PKEY_CTX_set_dh_paramgen_generator(libressl.openssl.ossl_typ.EVP_PKEY_CTX* ctx, int gen)
do
{
return libressl.openssl.evp.EVP_PKEY_CTX_ctrl(ctx, libressl.openssl.evp.EVP_PKEY_DH, libressl.openssl.evp.EVP_PKEY_OP_PARAMGEN, .EVP_PKEY_CTRL_DH_PARAMGEN_GENERATOR, gen, null);
}
enum EVP_PKEY_CTRL_DH_PARAMGEN_PRIME_LEN = libressl.openssl.evp.EVP_PKEY_ALG_CTRL + 1;
enum EVP_PKEY_CTRL_DH_PARAMGEN_GENERATOR = libressl.openssl.evp.EVP_PKEY_ALG_CTRL + 2;
void ERR_load_DH_strings();
/* Error codes for the DH functions. */
/* Function codes. */
enum DH_F_COMPUTE_KEY = 102;
enum DH_F_DHPARAMS_PRINT_FP = 101;
enum DH_F_DH_BUILTIN_GENPARAMS = 106;
enum DH_F_DH_COMPUTE_KEY = 114;
enum DH_F_DH_GENERATE_KEY = 115;
enum DH_F_DH_GENERATE_PARAMETERS_EX = 116;
enum DH_F_DH_NEW_METHOD = 105;
enum DH_F_DH_PARAM_DECODE = 107;
enum DH_F_DH_PRIV_DECODE = 110;
enum DH_F_DH_PRIV_ENCODE = 111;
enum DH_F_DH_PUB_DECODE = 108;
enum DH_F_DH_PUB_ENCODE = 109;
enum DH_F_DO_DH_PRINT = 100;
enum DH_F_GENERATE_KEY = 103;
enum DH_F_GENERATE_PARAMETERS = 104;
enum DH_F_PKEY_DH_DERIVE = 112;
enum DH_F_PKEY_DH_KEYGEN = 113;
/* Reason codes. */
enum DH_R_BAD_GENERATOR = 101;
enum DH_R_BN_DECODE_ERROR = 109;
enum DH_R_BN_ERROR = 106;
enum DH_R_DECODE_ERROR = 104;
enum DH_R_INVALID_PUBKEY = 102;
enum DH_R_KEYS_NOT_SET = 108;
enum DH_R_KEY_SIZE_TOO_SMALL = 110;
enum DH_R_MODULUS_TOO_LARGE = 103;
enum DH_R_NON_FIPS_METHOD = 111;
enum DH_R_NO_PARAMETERS_SET = 107;
enum DH_R_NO_PRIVATE_VALUE = 100;
enum DH_R_PARAMETER_ENCODING_ERROR = 105;
enum DH_R_CHECK_INVALID_J_VALUE = 115;
enum DH_R_CHECK_INVALID_Q_VALUE = 116;
enum DH_R_CHECK_PUBKEY_INVALID = 122;
enum DH_R_CHECK_PUBKEY_TOO_LARGE = 123;
enum DH_R_CHECK_PUBKEY_TOO_SMALL = 124;
enum DH_R_CHECK_P_NOT_PRIME = 117;
enum DH_R_CHECK_P_NOT_SAFE_PRIME = 118;
enum DH_R_CHECK_Q_NOT_PRIME = 119;
enum DH_R_MISSING_PUBKEY = 125;
enum DH_R_NOT_SUITABLE_GENERATOR = 120;
enum DH_R_UNABLE_TO_CHECK_GENERATOR = 121;
|
D
|
/Users/wox/Desktop/ios11/Weapons/DerivedData/Weapons/Build/Intermediates.noindex/SwiftMigration/Weapons/Intermediates.noindex/Weapons.build/Debug-iphonesimulator/Weapons.build/Objects-normal/x86_64/DetailController.o : /Users/wox/Desktop/ios11/Weapons/Weapons/AppDelegate.swift /Users/wox/Desktop/ios11/Weapons/Weapons/CardCell.swift /Users/wox/Desktop/ios11/Weapons/Weapons/DetailCell.swift /Users/wox/Desktop/ios11/Weapons/Weapons/pickerViewFill.swift /Users/wox/Desktop/ios11/Weapons/Weapons/Weapon.swift /Users/wox/Desktop/ios11/Weapons/Weapons/RateController.swift /Users/wox/Desktop/ios11/Weapons/Weapons/DetailController.swift /Users/wox/Desktop/ios11/Weapons/Weapons/NewWeaponController.swift /Users/wox/Desktop/ios11/Weapons/Weapons/WeaponsTableViewController.swift /Users/wox/Desktop/ios11/Weapons/Weapons/UIViewHelper.swift /Users/wox/Desktop/ios11/Weapons/Weapons/MediaSelect.swift /Users/wox/Desktop/ios11/Weapons/Weapons/NaviExt.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreMedia.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/simd.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Metal.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/AVFoundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreFoundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreAudio.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/OpenGLES.framework/Headers/OpenGLES.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/CoreMedia.framework/Headers/CoreMedia.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/AVFoundation.framework/Headers/AVFoundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/UIKit.framework/Headers/UIKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/AVKit.framework/Headers/AVKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/MediaToolbox.framework/Headers/MediaToolbox.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/AudioToolbox.framework/Headers/AudioToolbox.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
/Users/wox/Desktop/ios11/Weapons/DerivedData/Weapons/Build/Intermediates.noindex/SwiftMigration/Weapons/Intermediates.noindex/Weapons.build/Debug-iphonesimulator/Weapons.build/Objects-normal/x86_64/DetailController~partial.swiftmodule : /Users/wox/Desktop/ios11/Weapons/Weapons/AppDelegate.swift /Users/wox/Desktop/ios11/Weapons/Weapons/CardCell.swift /Users/wox/Desktop/ios11/Weapons/Weapons/DetailCell.swift /Users/wox/Desktop/ios11/Weapons/Weapons/pickerViewFill.swift /Users/wox/Desktop/ios11/Weapons/Weapons/Weapon.swift /Users/wox/Desktop/ios11/Weapons/Weapons/RateController.swift /Users/wox/Desktop/ios11/Weapons/Weapons/DetailController.swift /Users/wox/Desktop/ios11/Weapons/Weapons/NewWeaponController.swift /Users/wox/Desktop/ios11/Weapons/Weapons/WeaponsTableViewController.swift /Users/wox/Desktop/ios11/Weapons/Weapons/UIViewHelper.swift /Users/wox/Desktop/ios11/Weapons/Weapons/MediaSelect.swift /Users/wox/Desktop/ios11/Weapons/Weapons/NaviExt.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreMedia.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/simd.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Metal.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/AVFoundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreFoundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreAudio.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/OpenGLES.framework/Headers/OpenGLES.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/CoreMedia.framework/Headers/CoreMedia.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/AVFoundation.framework/Headers/AVFoundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/UIKit.framework/Headers/UIKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/AVKit.framework/Headers/AVKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/MediaToolbox.framework/Headers/MediaToolbox.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/AudioToolbox.framework/Headers/AudioToolbox.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
/Users/wox/Desktop/ios11/Weapons/DerivedData/Weapons/Build/Intermediates.noindex/SwiftMigration/Weapons/Intermediates.noindex/Weapons.build/Debug-iphonesimulator/Weapons.build/Objects-normal/x86_64/DetailController~partial.swiftdoc : /Users/wox/Desktop/ios11/Weapons/Weapons/AppDelegate.swift /Users/wox/Desktop/ios11/Weapons/Weapons/CardCell.swift /Users/wox/Desktop/ios11/Weapons/Weapons/DetailCell.swift /Users/wox/Desktop/ios11/Weapons/Weapons/pickerViewFill.swift /Users/wox/Desktop/ios11/Weapons/Weapons/Weapon.swift /Users/wox/Desktop/ios11/Weapons/Weapons/RateController.swift /Users/wox/Desktop/ios11/Weapons/Weapons/DetailController.swift /Users/wox/Desktop/ios11/Weapons/Weapons/NewWeaponController.swift /Users/wox/Desktop/ios11/Weapons/Weapons/WeaponsTableViewController.swift /Users/wox/Desktop/ios11/Weapons/Weapons/UIViewHelper.swift /Users/wox/Desktop/ios11/Weapons/Weapons/MediaSelect.swift /Users/wox/Desktop/ios11/Weapons/Weapons/NaviExt.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreMedia.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/simd.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Metal.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/AVFoundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreFoundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreAudio.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/OpenGLES.framework/Headers/OpenGLES.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/CoreMedia.framework/Headers/CoreMedia.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/AVFoundation.framework/Headers/AVFoundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/UIKit.framework/Headers/UIKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/AVKit.framework/Headers/AVKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/MediaToolbox.framework/Headers/MediaToolbox.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/AudioToolbox.framework/Headers/AudioToolbox.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.0.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
|
D
|
module java.text.Collator;
import java.lang.all;
import java.util.Comparator;
class Collator : Comparator {
public static Collator getInstance(){
implMissing( __FILE__, __LINE__ );
return null;
}
private this(){
}
int compare(Object o1, Object o2){
implMissing( __FILE__, __LINE__ );
return 0;
}
}
|
D
|
// Written in the D programming language.
/**
This is a submodule of $(MREF std, algorithm).
It contains generic _iteration algorithms.
$(SCRIPT inhibitQuickIndex = 1;)
$(BOOKTABLE Cheat Sheet,
$(TR $(TH Function Name) $(TH Description))
$(T2 cache,
Eagerly evaluates and caches another range's `front`.)
$(T2 cacheBidirectional,
As above, but also provides `back` and `popBack`.)
$(T2 chunkBy,
`chunkBy!((a,b) => a[1] == b[1])([[1, 1], [1, 2], [2, 2], [2, 1]])`
returns a range containing 3 subranges: the first with just
`[1, 1]`; the second with the elements `[1, 2]` and `[2, 2]`;
and the third with just `[2, 1]`.)
$(T2 cumulativeFold,
`cumulativeFold!((a, b) => a + b)([1, 2, 3, 4])` returns a
lazily-evaluated range containing the successive reduced values `1`,
`3`, `6`, `10`.)
$(T2 each,
`each!writeln([1, 2, 3])` eagerly prints the numbers `1`, `2`
and `3` on their own lines.)
$(T2 filter,
`filter!(a => a > 0)([1, -1, 2, 0, -3])` iterates over elements `1`
and `2`.)
$(T2 filterBidirectional,
Similar to `filter`, but also provides `back` and `popBack` at
a small increase in cost.)
$(T2 fold,
`fold!((a, b) => a + b)([1, 2, 3, 4])` returns `10`.)
$(T2 group,
`group([5, 2, 2, 3, 3])` returns a range containing the tuples
`tuple(5, 1)`, `tuple(2, 2)`, and `tuple(3, 2)`.)
$(T2 joiner,
`joiner(["hello", "world!"], "; ")` returns a range that iterates
over the characters `"hello; world!"`. No new string is created -
the existing inputs are iterated.)
$(T2 map,
`map!(a => a * 2)([1, 2, 3])` lazily returns a range with the numbers
`2`, `4`, `6`.)
$(T2 permutations,
Lazily computes all permutations using Heap's algorithm.)
$(T2 reduce,
`reduce!((a, b) => a + b)([1, 2, 3, 4])` returns `10`.
This is the old implementation of `fold`.)
$(T2 splitter,
Lazily splits a range by a separator.)
$(T2 substitute,
`[1, 2].substitute(1, 0.1)` returns `[0.1, 2]`.)
$(T2 sum,
Same as `fold`, but specialized for accurate summation.)
$(T2 uniq,
Iterates over the unique elements in a range, which is assumed sorted.)
)
Copyright: Andrei Alexandrescu 2008-.
License: $(HTTP boost.org/LICENSE_1_0.txt, Boost License 1.0).
Authors: $(HTTP erdani.com, Andrei Alexandrescu)
Source: $(PHOBOSSRC std/algorithm/_iteration.d)
Macros:
T2=$(TR $(TDNW $(LREF $1)) $(TD $+))
*/
module std.algorithm.iteration;
// FIXME
import std.functional; // : unaryFun, binaryFun;
import std.range.primitives;
import std.traits;
private template aggregate(fun...)
if (fun.length >= 1)
{
/* --Intentionally not ddoc--
* Aggregates elements in each subrange of the given range of ranges using
* the given aggregating function(s).
* Params:
* fun = One or more aggregating functions (binary functions that return a
* single _aggregate value of their arguments).
* ror = A range of ranges to be aggregated.
*
* Returns:
* A range representing the aggregated value(s) of each subrange
* of the original range. If only one aggregating function is specified,
* each element will be the aggregated value itself; if multiple functions
* are specified, each element will be a tuple of the aggregated values of
* each respective function.
*/
auto aggregate(RoR)(RoR ror)
if (isInputRange!RoR && isIterable!(ElementType!RoR))
{
return ror.map!(reduce!fun);
}
@safe unittest
{
import std.algorithm.comparison : equal, max, min;
auto data = [[4, 2, 1, 3], [4, 9, -1, 3, 2], [3]];
// Single aggregating function
auto agg1 = data.aggregate!max;
assert(agg1.equal([4, 9, 3]));
// Multiple aggregating functions
import std.typecons : tuple;
auto agg2 = data.aggregate!(max, min);
assert(agg2.equal([
tuple(4, 1),
tuple(9, -1),
tuple(3, 3)
]));
}
}
/++
`cache` eagerly evaluates `front` of `range`
on each construction or call to `popFront`,
to store the result in a _cache.
The result is then directly returned when `front` is called,
rather than re-evaluated.
This can be a useful function to place in a chain, after functions
that have expensive evaluation, as a lazy alternative to $(REF array, std,array).
In particular, it can be placed after a call to `map`, or before a call
to `filter`.
`cache` may provide
$(REF_ALTTEXT bidirectional _range, isBidirectionalRange, std,_range,primitives)
iteration if needed, but since this comes at an increased cost, it must be explicitly requested via the
call to `cacheBidirectional`. Furthermore, a bidirectional _cache will
evaluate the "center" element twice, when there is only one element left in
the _range.
`cache` does not provide random access primitives,
as `cache` would be unable to _cache the random accesses.
If `Range` provides slicing primitives,
then `cache` will provide the same slicing primitives,
but `hasSlicing!Cache` will not yield true (as the $(REF hasSlicing, std,_range,primitives)
trait also checks for random access).
Params:
range = an $(REF_ALTTEXT input _range, isInputRange, std,_range,primitives)
Returns:
an input _range with the cached values of _range
+/
auto cache(Range)(Range range)
if (isInputRange!Range)
{
return _Cache!(Range, false)(range);
}
/// ditto
auto cacheBidirectional(Range)(Range range)
if (isBidirectionalRange!Range)
{
return _Cache!(Range, true)(range);
}
///
@safe unittest
{
import std.algorithm.comparison : equal;
import std.range, std.stdio;
import std.typecons : tuple;
ulong counter = 0;
double fun(int x)
{
++counter;
// http://en.wikipedia.org/wiki/Quartic_function
return ( (x + 4.0) * (x + 1.0) * (x - 1.0) * (x - 3.0) ) / 14.0 + 0.5;
}
// Without cache, with array (greedy)
auto result1 = iota(-4, 5).map!(a =>tuple(a, fun(a)))()
.filter!(a => a[1] < 0)()
.map!(a => a[0])()
.array();
// the values of x that have a negative y are:
assert(equal(result1, [-3, -2, 2]));
// Check how many times fun was evaluated.
// As many times as the number of items in both source and result.
assert(counter == iota(-4, 5).length + result1.length);
counter = 0;
// Without array, with cache (lazy)
auto result2 = iota(-4, 5).map!(a =>tuple(a, fun(a)))()
.cache()
.filter!(a => a[1] < 0)()
.map!(a => a[0])();
// the values of x that have a negative y are:
assert(equal(result2, [-3, -2, 2]));
// Check how many times fun was evaluated.
// Only as many times as the number of items in source.
assert(counter == iota(-4, 5).length);
}
/++
Tip: `cache` is eager when evaluating elements. If calling front on the
underlying _range has a side effect, it will be observable before calling
front on the actual cached _range.
Furthermore, care should be taken composing `cache` with $(REF take, std,_range).
By placing `take` before `cache`, then `cache` will be "aware"
of when the _range ends, and correctly stop caching elements when needed.
If calling front has no side effect though, placing `take` after `cache`
may yield a faster _range.
Either way, the resulting ranges will be equivalent, but maybe not at the
same cost or side effects.
+/
@safe unittest
{
import std.algorithm.comparison : equal;
import std.range;
int i = 0;
auto r = iota(0, 4).tee!((a){i = a;}, No.pipeOnPop);
auto r1 = r.take(3).cache();
auto r2 = r.cache().take(3);
assert(equal(r1, [0, 1, 2]));
assert(i == 2); //The last "seen" element was 2. The data in cache has been cleared.
assert(equal(r2, [0, 1, 2]));
assert(i == 3); //cache has accessed 3. It is still stored internally by cache.
}
@safe unittest
{
import std.algorithm.comparison : equal;
import std.range;
auto a = [1, 2, 3, 4];
assert(equal(a.map!(a => (a - 1) * a)().cache(), [ 0, 2, 6, 12]));
assert(equal(a.map!(a => (a - 1) * a)().cacheBidirectional().retro(), [12, 6, 2, 0]));
auto r1 = [1, 2, 3, 4].cache() [1 .. $];
auto r2 = [1, 2, 3, 4].cacheBidirectional()[1 .. $];
assert(equal(r1, [2, 3, 4]));
assert(equal(r2, [2, 3, 4]));
}
@safe unittest
{
import std.algorithm.comparison : equal;
//immutable test
static struct S
{
int i;
this(int i)
{
//this.i = i;
}
}
immutable(S)[] s = [S(1), S(2), S(3)];
assert(equal(s.cache(), s));
assert(equal(s.cacheBidirectional(), s));
}
@safe pure nothrow unittest
{
import std.algorithm.comparison : equal;
//safety etc
auto a = [1, 2, 3, 4];
assert(equal(a.cache(), a));
assert(equal(a.cacheBidirectional(), a));
}
@safe unittest
{
char[][] stringbufs = ["hello".dup, "world".dup];
auto strings = stringbufs.map!((a)=>a.idup)().cache();
assert(strings.front is strings.front);
}
@safe unittest
{
import std.range : cycle;
import std.algorithm.comparison : equal;
auto c = [1, 2, 3].cycle().cache();
c = c[1 .. $];
auto d = c[0 .. 1];
assert(d.equal([2]));
}
@safe unittest
{
static struct Range
{
bool initialized = false;
bool front() @property {return initialized = true;}
void popFront() {initialized = false;}
enum empty = false;
}
auto r = Range().cache();
assert(r.source.initialized == true);
}
private struct _Cache(R, bool bidir)
{
import core.exception : RangeError;
private
{
import std.algorithm.internal : algoFormat;
import std.meta : AliasSeq;
alias E = ElementType!R;
alias UE = Unqual!E;
R source;
static if (bidir) alias CacheTypes = AliasSeq!(UE, UE);
else alias CacheTypes = AliasSeq!UE;
CacheTypes caches;
static assert(isAssignable!(UE, E) && is(UE : E),
algoFormat(
"Cannot instantiate range with %s because %s elements are not assignable to %s.",
R.stringof,
E.stringof,
UE.stringof
)
);
}
this(R range)
{
source = range;
if (!range.empty)
{
caches[0] = source.front;
static if (bidir)
caches[1] = source.back;
}
}
static if (isInfinite!R)
enum empty = false;
else
bool empty() @property
{
return source.empty;
}
static if (hasLength!R) auto length() @property
{
return source.length;
}
E front() @property
{
version(assert) if (empty) throw new RangeError();
return caches[0];
}
static if (bidir) E back() @property
{
version(assert) if (empty) throw new RangeError();
return caches[1];
}
void popFront()
{
version(assert) if (empty) throw new RangeError();
source.popFront();
if (!source.empty)
caches[0] = source.front;
else
caches = CacheTypes.init;
}
static if (bidir) void popBack()
{
version(assert) if (empty) throw new RangeError();
source.popBack();
if (!source.empty)
caches[1] = source.back;
else
caches = CacheTypes.init;
}
static if (isForwardRange!R)
{
private this(R source, ref CacheTypes caches)
{
this.source = source;
this.caches = caches;
}
typeof(this) save() @property
{
return typeof(this)(source.save, caches);
}
}
static if (hasSlicing!R)
{
enum hasEndSlicing = is(typeof(source[size_t.max .. $]));
static if (hasEndSlicing)
{
private static struct DollarToken{}
enum opDollar = DollarToken.init;
auto opSlice(size_t low, DollarToken)
{
return typeof(this)(source[low .. $]);
}
}
static if (!isInfinite!R)
{
typeof(this) opSlice(size_t low, size_t high)
{
return typeof(this)(source[low .. high]);
}
}
else static if (hasEndSlicing)
{
auto opSlice(size_t low, size_t high)
in
{
assert(low <= high, "Bounds error when slicing cache.");
}
do
{
import std.range : takeExactly;
return this[low .. $].takeExactly(high - low);
}
}
}
}
/**
`auto map(Range)(Range r) if (isInputRange!(Unqual!Range));`
Implements the homonym function (also known as `transform`) present
in many languages of functional flavor. The call `map!(fun)(range)`
returns a range of which elements are obtained by applying `fun(a)`
left to right for all elements `a` in `range`. The original ranges are
not changed. Evaluation is done lazily.
Params:
fun = one or more transformation functions
r = an $(REF_ALTTEXT input range, isInputRange, std,range,primitives)
Returns:
a range with each fun applied to all the elements. If there is more than one
fun, the element type will be `Tuple` containing one element for each fun.
See_Also:
$(HTTP en.wikipedia.org/wiki/Map_(higher-order_function), Map (higher-order function))
*/
template map(fun...)
if (fun.length >= 1)
{
auto map(Range)(Range r) if (isInputRange!(Unqual!Range))
{
import std.meta : AliasSeq, staticMap;
alias RE = ElementType!(Range);
static if (fun.length > 1)
{
import std.functional : adjoin;
import std.meta : staticIndexOf;
alias _funs = staticMap!(unaryFun, fun);
alias _fun = adjoin!_funs;
// Once DMD issue #5710 is fixed, this validation loop can be moved into a template.
foreach (f; _funs)
{
static assert(!is(typeof(f(RE.init)) == void),
"Mapping function(s) must not return void: " ~ _funs.stringof);
}
}
else
{
alias _fun = unaryFun!fun;
alias _funs = AliasSeq!(_fun);
// Do the validation separately for single parameters due to DMD issue #15777.
static assert(!is(typeof(_fun(RE.init)) == void),
"Mapping function(s) must not return void: " ~ _funs.stringof);
}
return MapResult!(_fun, Range)(r);
}
}
///
@safe unittest
{
import std.algorithm.comparison : equal;
import std.range : chain;
int[] arr1 = [ 1, 2, 3, 4 ];
int[] arr2 = [ 5, 6 ];
auto squares = map!(a => a * a)(chain(arr1, arr2));
assert(equal(squares, [ 1, 4, 9, 16, 25, 36 ]));
}
/**
Multiple functions can be passed to `map`. In that case, the
element type of `map` is a tuple containing one element for each
function.
*/
@safe unittest
{
auto sums = [2, 4, 6, 8];
auto products = [1, 4, 9, 16];
size_t i = 0;
foreach (result; [ 1, 2, 3, 4 ].map!("a + a", "a * a"))
{
assert(result[0] == sums[i]);
assert(result[1] == products[i]);
++i;
}
}
/**
You may alias `map` with some function(s) to a symbol and use
it separately:
*/
@safe unittest
{
import std.algorithm.comparison : equal;
import std.conv : to;
alias stringize = map!(to!string);
assert(equal(stringize([ 1, 2, 3, 4 ]), [ "1", "2", "3", "4" ]));
}
@safe unittest
{
// Verify workaround for DMD #15777
import std.algorithm.mutation, std.string;
auto foo(string[] args)
{
return args.map!strip;
}
}
private struct MapResult(alias fun, Range)
{
alias R = Unqual!Range;
R _input;
static if (isBidirectionalRange!R)
{
@property auto ref back()()
{
assert(!empty, "Attempting to fetch the back of an empty map.");
return fun(_input.back);
}
void popBack()()
{
assert(!empty, "Attempting to popBack an empty map.");
_input.popBack();
}
}
this(R input)
{
_input = input;
}
static if (isInfinite!R)
{
// Propagate infinite-ness.
enum bool empty = false;
}
else
{
@property bool empty()
{
return _input.empty;
}
}
void popFront()
{
assert(!empty, "Attempting to popFront an empty map.");
_input.popFront();
}
@property auto ref front()
{
assert(!empty, "Attempting to fetch the front of an empty map.");
return fun(_input.front);
}
static if (isRandomAccessRange!R)
{
static if (is(typeof(_input[ulong.max])))
private alias opIndex_t = ulong;
else
private alias opIndex_t = uint;
auto ref opIndex(opIndex_t index)
{
return fun(_input[index]);
}
}
static if (hasLength!R)
{
@property auto length()
{
return _input.length;
}
alias opDollar = length;
}
static if (hasSlicing!R)
{
static if (is(typeof(_input[ulong.max .. ulong.max])))
private alias opSlice_t = ulong;
else
private alias opSlice_t = uint;
static if (hasLength!R)
{
auto opSlice(opSlice_t low, opSlice_t high)
{
return typeof(this)(_input[low .. high]);
}
}
else static if (is(typeof(_input[opSlice_t.max .. $])))
{
struct DollarToken{}
enum opDollar = DollarToken.init;
auto opSlice(opSlice_t low, DollarToken)
{
return typeof(this)(_input[low .. $]);
}
auto opSlice(opSlice_t low, opSlice_t high)
{
import std.range : takeExactly;
return this[low .. $].takeExactly(high - low);
}
}
}
static if (isForwardRange!R)
{
@property auto save()
{
return typeof(this)(_input.save);
}
}
}
@safe unittest
{
import std.algorithm.comparison : equal;
import std.conv : to;
import std.functional : adjoin;
alias stringize = map!(to!string);
assert(equal(stringize([ 1, 2, 3, 4 ]), [ "1", "2", "3", "4" ]));
uint counter;
alias count = map!((a) { return counter++; });
assert(equal(count([ 10, 2, 30, 4 ]), [ 0, 1, 2, 3 ]));
counter = 0;
adjoin!((a) { return counter++; }, (a) { return counter++; })(1);
alias countAndSquare = map!((a) { return counter++; }, (a) { return counter++; });
//assert(equal(countAndSquare([ 10, 2 ]), [ tuple(0u, 100), tuple(1u, 4) ]));
}
@safe unittest
{
import std.algorithm.comparison : equal;
import std.ascii : toUpper;
import std.internal.test.dummyrange;
import std.range;
import std.typecons : tuple;
import std.random : unpredictableSeed, uniform, Random;
int[] arr1 = [ 1, 2, 3, 4 ];
const int[] arr1Const = arr1;
int[] arr2 = [ 5, 6 ];
auto squares = map!("a * a")(arr1Const);
assert(squares[$ - 1] == 16);
assert(equal(squares, [ 1, 4, 9, 16 ][]));
assert(equal(map!("a * a")(chain(arr1, arr2)), [ 1, 4, 9, 16, 25, 36 ][]));
// Test the caching stuff.
assert(squares.back == 16);
auto squares2 = squares.save;
assert(squares2.back == 16);
assert(squares2.front == 1);
squares2.popFront();
assert(squares2.front == 4);
squares2.popBack();
assert(squares2.front == 4);
assert(squares2.back == 9);
assert(equal(map!("a * a")(chain(arr1, arr2)), [ 1, 4, 9, 16, 25, 36 ][]));
uint i;
foreach (e; map!("a", "a * a")(arr1))
{
assert(e[0] == ++i);
assert(e[1] == i * i);
}
// Test length.
assert(squares.length == 4);
assert(map!"a * a"(chain(arr1, arr2)).length == 6);
// Test indexing.
assert(squares[0] == 1);
assert(squares[1] == 4);
assert(squares[2] == 9);
assert(squares[3] == 16);
// Test slicing.
auto squareSlice = squares[1 .. squares.length - 1];
assert(equal(squareSlice, [4, 9][]));
assert(squareSlice.back == 9);
assert(squareSlice[1] == 9);
// Test on a forward range to make sure it compiles when all the fancy
// stuff is disabled.
auto fibsSquares = map!"a * a"(recurrence!("a[n-1] + a[n-2]")(1, 1));
assert(fibsSquares.front == 1);
fibsSquares.popFront();
fibsSquares.popFront();
assert(fibsSquares.front == 4);
fibsSquares.popFront();
assert(fibsSquares.front == 9);
auto repeatMap = map!"a"(repeat(1));
auto gen = Random(unpredictableSeed);
auto index = uniform(0, 1024, gen);
static assert(isInfinite!(typeof(repeatMap)));
assert(repeatMap[index] == 1);
auto intRange = map!"a"([1,2,3]);
static assert(isRandomAccessRange!(typeof(intRange)));
assert(equal(intRange, [1, 2, 3]));
foreach (DummyType; AllDummyRanges)
{
DummyType d;
auto m = map!"a * a"(d);
static assert(propagatesRangeType!(typeof(m), DummyType));
assert(equal(m, [1,4,9,16,25,36,49,64,81,100]));
}
//Test string access
string s1 = "hello world!";
dstring s2 = "日本語";
dstring s3 = "hello world!"d;
auto ms1 = map!(std.ascii.toUpper)(s1);
auto ms2 = map!(std.ascii.toUpper)(s2);
auto ms3 = map!(std.ascii.toUpper)(s3);
static assert(!is(ms1[0])); //narrow strings can't be indexed
assert(ms2[0] == '日');
assert(ms3[0] == 'H');
static assert(!is(ms1[0 .. 1])); //narrow strings can't be sliced
assert(equal(ms2[0 .. 2], "日本"w));
assert(equal(ms3[0 .. 2], "HE"));
// Issue 5753
static void voidFun(int) {}
static int nonvoidFun(int) { return 0; }
static assert(!__traits(compiles, map!voidFun([1])));
static assert(!__traits(compiles, map!(voidFun, voidFun)([1])));
static assert(!__traits(compiles, map!(nonvoidFun, voidFun)([1])));
static assert(!__traits(compiles, map!(voidFun, nonvoidFun)([1])));
static assert(!__traits(compiles, map!(a => voidFun(a))([1])));
// Phobos issue #15480
auto dd = map!(z => z * z, c => c * c * c)([ 1, 2, 3, 4 ]);
assert(dd[0] == tuple(1, 1));
assert(dd[1] == tuple(4, 8));
assert(dd[2] == tuple(9, 27));
assert(dd[3] == tuple(16, 64));
assert(dd.length == 4);
}
@safe unittest
{
import std.algorithm.comparison : equal;
import std.range;
auto LL = iota(1L, 4L);
auto m = map!"a*a"(LL);
assert(equal(m, [1L, 4L, 9L]));
}
@safe unittest
{
import std.range : iota;
// Issue #10130 - map of iota with const step.
const step = 2;
assert(map!(i => i)(iota(0, 10, step)).walkLength == 5);
// Need these to all by const to repro the float case, due to the
// CommonType template used in the float specialization of iota.
const floatBegin = 0.0;
const floatEnd = 1.0;
const floatStep = 0.02;
assert(map!(i => i)(iota(floatBegin, floatEnd, floatStep)).walkLength == 50);
}
@safe unittest
{
import std.algorithm.comparison : equal;
import std.range;
//slicing infinites
auto rr = iota(0, 5).cycle().map!"a * a"();
alias RR = typeof(rr);
static assert(hasSlicing!RR);
rr = rr[6 .. $]; //Advances 1 cycle and 1 unit
assert(equal(rr[0 .. 5], [1, 4, 9, 16, 0]));
}
@safe unittest
{
import std.range;
struct S {int* p;}
auto m = immutable(S).init.repeat().map!"a".save;
assert(m.front == immutable(S)(null));
}
// each
/**
Eagerly iterates over `r` and calls `pred` over _each element.
If no predicate is specified, `each` will default to doing nothing
but consuming the entire range. `.front` will be evaluated, but this
can be avoided by explicitly specifying a predicate lambda with a
`lazy` parameter.
`each` also supports `opApply`-based iterators, so it will work
with e.g. $(REF parallel, std,parallelism).
Params:
pred = predicate to apply to each element of the range
r = range or iterable over which each iterates
See_Also: $(REF tee, std,range)
*/
template each(alias pred = "a")
{
import std.meta : AliasSeq;
import std.traits : Parameters;
private:
alias BinaryArgs = AliasSeq!(pred, "i", "a");
enum isRangeUnaryIterable(R) =
is(typeof(unaryFun!pred(R.init.front)));
enum isRangeBinaryIterable(R) =
is(typeof(binaryFun!BinaryArgs(0, R.init.front)));
enum isRangeIterable(R) =
isInputRange!R &&
(isRangeUnaryIterable!R || isRangeBinaryIterable!R);
enum isForeachUnaryIterable(R) =
is(typeof((R r) {
foreach (ref a; r)
cast(void) unaryFun!pred(a);
}));
enum isForeachBinaryIterable(R) =
is(typeof((R r) {
foreach (ref i, ref a; r)
cast(void) binaryFun!BinaryArgs(i, a);
}));
enum isForeachIterable(R) =
(!isForwardRange!R || isDynamicArray!R) &&
(isForeachUnaryIterable!R || isForeachBinaryIterable!R);
public:
void each(Range)(Range r)
if (!isForeachIterable!Range && (
isRangeIterable!Range ||
__traits(compiles, typeof(r.front).length)))
{
static if (isRangeIterable!Range)
{
debug(each) pragma(msg, "Using while for ", Range.stringof);
static if (isRangeUnaryIterable!Range)
{
while (!r.empty)
{
cast(void) unaryFun!pred(r.front);
r.popFront();
}
}
else // if (isRangeBinaryIterable!Range)
{
size_t i = 0;
while (!r.empty)
{
cast(void) binaryFun!BinaryArgs(i, r.front);
r.popFront();
i++;
}
}
}
else
{
// range interface with >2 parameters.
for (auto range = r; !range.empty; range.popFront())
pred(range.front.expand);
}
}
void each(Iterable)(auto ref Iterable r)
if (isForeachIterable!Iterable ||
__traits(compiles, Parameters!(Parameters!(r.opApply))))
{
static if (isForeachIterable!Iterable)
{
debug(each) pragma(msg, "Using foreach for ", Iterable.stringof);
static if (isForeachUnaryIterable!Iterable)
{
foreach (ref e; r)
cast(void) unaryFun!pred(e);
}
else // if (isForeachBinaryIterable!Iterable)
{
foreach (ref i, ref e; r)
cast(void) binaryFun!BinaryArgs(i, e);
}
}
else
{
// opApply with >2 parameters. count the delegate args.
// only works if it is not templated (otherwise we cannot count the args)
auto dg(Parameters!(Parameters!(r.opApply)) params) {
pred(params);
return 0; // tells opApply to continue iteration
}
r.opApply(&dg);
}
}
}
///
@system unittest
{
import std.range : iota;
long[] arr;
iota(5).each!(n => arr ~= n);
assert(arr == [0, 1, 2, 3, 4]);
// If the range supports it, the value can be mutated in place
arr.each!((ref n) => n++);
assert(arr == [1, 2, 3, 4, 5]);
arr.each!"a++";
assert(arr == [2, 3, 4, 5, 6]);
// by-ref lambdas are not allowed for non-ref ranges
static assert(!is(typeof(arr.map!(n => n).each!((ref n) => n++))));
// The default predicate consumes the range
auto m = arr.map!(n => n);
(&m).each();
assert(m.empty);
// Indexes are also available for in-place mutations
arr[] = 0;
arr.each!"a=i"();
assert(arr == [0, 1, 2, 3, 4]);
// opApply iterators work as well
static class S
{
int x;
int opApply(scope int delegate(ref int _x) dg) { return dg(x); }
}
auto s = new S;
s.each!"a++";
assert(s.x == 1);
}
// binary foreach with two ref args
@system unittest
{
import std.range : lockstep;
auto a = [ 1, 2, 3 ];
auto b = [ 2, 3, 4 ];
a.lockstep(b).each!((ref x, ref y) { ++x; ++y; });
assert(a == [ 2, 3, 4 ]);
assert(b == [ 3, 4, 5 ]);
}
// #15358: application of `each` with >2 args (opApply)
@system unittest
{
import std.range : lockstep;
auto a = [0,1,2];
auto b = [3,4,5];
auto c = [6,7,8];
lockstep(a, b, c).each!((ref x, ref y, ref z) { ++x; ++y; ++z; });
assert(a == [1,2,3]);
assert(b == [4,5,6]);
assert(c == [7,8,9]);
}
// #15358: application of `each` with >2 args (range interface)
@safe unittest
{
import std.range : zip;
auto a = [0,1,2];
auto b = [3,4,5];
auto c = [6,7,8];
int[] res;
zip(a, b, c).each!((x, y, z) { res ~= x + y + z; });
assert(res == [9, 12, 15]);
}
// #16255: `each` on opApply doesn't support ref
@safe unittest
{
int[] dynamicArray = [1, 2, 3, 4, 5];
int[5] staticArray = [1, 2, 3, 4, 5];
dynamicArray.each!((ref x) => x++);
assert(dynamicArray == [2, 3, 4, 5, 6]);
staticArray.each!((ref x) => x++);
assert(staticArray == [2, 3, 4, 5, 6]);
staticArray[].each!((ref x) => x++);
assert(staticArray == [3, 4, 5, 6, 7]);
}
// #16255: `each` on opApply doesn't support ref
@system unittest
{
struct S
{
int x;
int opApply(int delegate(ref int _x) dg) { return dg(x); }
}
S s;
foreach (ref a; s) ++a;
assert(s.x == 1);
s.each!"++a";
assert(s.x == 2);
}
// filter
/**
`auto filter(Range)(Range rs) if (isInputRange!(Unqual!Range));`
Implements the higher order _filter function. The predicate is passed to
$(REF unaryFun, std,functional), and can either accept a string, or any callable
that can be executed via `pred(element)`.
Params:
predicate = Function to apply to each element of range
range = Input range of elements
Returns:
`filter!(predicate)(range)` returns a new range containing only elements `x` in `range` for
which `predicate(x)` returns `true`.
See_Also:
$(HTTP en.wikipedia.org/wiki/Filter_(higher-order_function), Filter (higher-order function))
*/
template filter(alias predicate)
if (is(typeof(unaryFun!predicate)))
{
auto filter(Range)(Range range) if (isInputRange!(Unqual!Range))
{
return FilterResult!(unaryFun!predicate, Range)(range);
}
}
///
@safe unittest
{
import std.algorithm.comparison : equal;
import std.math : approxEqual;
import std.range;
int[] arr = [ 1, 2, 3, 4, 5 ];
// Filter below 3
auto small = filter!(a => a < 3)(arr);
assert(equal(small, [ 1, 2 ]));
// Filter again, but with Uniform Function Call Syntax (UFCS)
auto sum = arr.filter!(a => a < 3);
assert(equal(sum, [ 1, 2 ]));
// In combination with chain() to span multiple ranges
int[] a = [ 3, -2, 400 ];
int[] b = [ 100, -101, 102 ];
auto r = chain(a, b).filter!(a => a > 0);
assert(equal(r, [ 3, 400, 100, 102 ]));
// Mixing convertible types is fair game, too
double[] c = [ 2.5, 3.0 ];
auto r1 = chain(c, a, b).filter!(a => cast(int) a != a);
assert(approxEqual(r1, [ 2.5 ]));
}
private struct FilterResult(alias pred, Range)
{
alias R = Unqual!Range;
R _input;
private bool _primed;
private void prime()
{
if (_primed) return;
while (!_input.empty && !pred(_input.front))
{
_input.popFront();
}
_primed = true;
}
this(R r)
{
_input = r;
}
private this(R r, bool primed)
{
_input = r;
_primed = primed;
}
auto opSlice() { return this; }
static if (isInfinite!Range)
{
enum bool empty = false;
}
else
{
@property bool empty() { prime; return _input.empty; }
}
void popFront()
{
do
{
_input.popFront();
} while (!_input.empty && !pred(_input.front));
_primed = true;
}
@property auto ref front()
{
prime;
assert(!empty, "Attempting to fetch the front of an empty filter.");
return _input.front;
}
static if (isForwardRange!R)
{
@property auto save()
{
return typeof(this)(_input.save, _primed);
}
}
}
@safe unittest
{
import std.algorithm.comparison : equal;
import std.internal.test.dummyrange;
import std.range;
auto shouldNotLoop4ever = repeat(1).filter!(x => x % 2 == 0);
static assert(isInfinite!(typeof(shouldNotLoop4ever)));
assert(!shouldNotLoop4ever.empty);
int[] a = [ 3, 4, 2 ];
auto r = filter!("a > 3")(a);
static assert(isForwardRange!(typeof(r)));
assert(equal(r, [ 4 ][]));
a = [ 1, 22, 3, 42, 5 ];
auto under10 = filter!("a < 10")(a);
assert(equal(under10, [1, 3, 5][]));
static assert(isForwardRange!(typeof(under10)));
under10.front = 4;
assert(equal(under10, [4, 3, 5][]));
under10.front = 40;
assert(equal(under10, [40, 3, 5][]));
under10.front = 1;
auto infinite = filter!"a > 2"(repeat(3));
static assert(isInfinite!(typeof(infinite)));
static assert(isForwardRange!(typeof(infinite)));
assert(infinite.front == 3);
foreach (DummyType; AllDummyRanges)
{
DummyType d;
auto f = filter!"a & 1"(d);
assert(equal(f, [1,3,5,7,9]));
static if (isForwardRange!DummyType)
{
static assert(isForwardRange!(typeof(f)));
}
}
// With delegates
int x = 10;
int overX(int a) { return a > x; }
typeof(filter!overX(a)) getFilter()
{
return filter!overX(a);
}
auto r1 = getFilter();
assert(equal(r1, [22, 42]));
// With chain
auto nums = [0,1,2,3,4];
assert(equal(filter!overX(chain(a, nums)), [22, 42]));
// With copying of inner struct Filter to Map
auto arr = [1,2,3,4,5];
auto m = map!"a + 1"(filter!"a < 4"(arr));
assert(equal(m, [2, 3, 4]));
}
@safe unittest
{
import std.algorithm.comparison : equal;
int[] a = [ 3, 4 ];
const aConst = a;
auto r = filter!("a > 3")(aConst);
assert(equal(r, [ 4 ][]));
a = [ 1, 22, 3, 42, 5 ];
auto under10 = filter!("a < 10")(a);
assert(equal(under10, [1, 3, 5][]));
assert(equal(under10.save, [1, 3, 5][]));
assert(equal(under10.save, under10));
}
@safe unittest
{
import std.algorithm.comparison : equal;
import std.functional : compose, pipe;
assert(equal(compose!(map!"2 * a", filter!"a & 1")([1,2,3,4,5]),
[2,6,10]));
assert(equal(pipe!(filter!"a & 1", map!"2 * a")([1,2,3,4,5]),
[2,6,10]));
}
@safe unittest
{
import std.algorithm.comparison : equal;
int x = 10;
int underX(int a) { return a < x; }
const(int)[] list = [ 1, 2, 10, 11, 3, 4 ];
assert(equal(filter!underX(list), [ 1, 2, 3, 4 ]));
}
/**
* `auto filterBidirectional(Range)(Range r) if (isBidirectionalRange!(Unqual!Range));`
*
* Similar to `filter`, except it defines a
* $(REF_ALTTEXT bidirectional range, isBidirectionalRange, std,range,primitives).
* There is a speed disadvantage - the constructor spends time
* finding the last element in the range that satisfies the filtering
* condition (in addition to finding the first one). The advantage is
* that the filtered range can be spanned from both directions. Also,
* $(REF retro, std,range) can be applied against the filtered range.
*
* The predicate is passed to $(REF unaryFun, std,functional), and can either
* accept a string, or any callable that can be executed via `pred(element)`.
*
* Params:
* pred = Function to apply to each element of range
* r = Bidirectional range of elements
*
* Returns:
* a new range containing only the elements in r for which pred returns `true`.
*/
template filterBidirectional(alias pred)
{
auto filterBidirectional(Range)(Range r) if (isBidirectionalRange!(Unqual!Range))
{
return FilterBidiResult!(unaryFun!pred, Range)(r);
}
}
///
@safe unittest
{
import std.algorithm.comparison : equal;
import std.range;
int[] arr = [ 1, 2, 3, 4, 5 ];
auto small = filterBidirectional!("a < 3")(arr);
static assert(isBidirectionalRange!(typeof(small)));
assert(small.back == 2);
assert(equal(small, [ 1, 2 ]));
assert(equal(retro(small), [ 2, 1 ]));
// In combination with chain() to span multiple ranges
int[] a = [ 3, -2, 400 ];
int[] b = [ 100, -101, 102 ];
auto r = filterBidirectional!("a > 0")(chain(a, b));
assert(r.back == 102);
}
private struct FilterBidiResult(alias pred, Range)
{
alias R = Unqual!Range;
R _input;
this(R r)
{
_input = r;
while (!_input.empty && !pred(_input.front)) _input.popFront();
while (!_input.empty && !pred(_input.back)) _input.popBack();
}
@property bool empty() { return _input.empty; }
void popFront()
{
do
{
_input.popFront();
} while (!_input.empty && !pred(_input.front));
}
@property auto ref front()
{
assert(!empty, "Attempting to fetch the front of an empty filterBidirectional.");
return _input.front;
}
void popBack()
{
do
{
_input.popBack();
} while (!_input.empty && !pred(_input.back));
}
@property auto ref back()
{
assert(!empty, "Attempting to fetch the back of an empty filterBidirectional.");
return _input.back;
}
@property auto save()
{
return typeof(this)(_input.save);
}
}
/**
Groups consecutively equivalent elements into a single tuple of the element and
the number of its repetitions.
Similarly to `uniq`, `group` produces a range that iterates over unique
consecutive elements of the given range. Each element of this range is a tuple
of the element and the number of times it is repeated in the original range.
Equivalence of elements is assessed by using the predicate `pred`, which
defaults to `"a == b"`. The predicate is passed to $(REF binaryFun, std,functional),
and can either accept a string, or any callable that can be executed via
`pred(element, element)`.
Params:
pred = Binary predicate for determining equivalence of two elements.
r = The $(REF_ALTTEXT input range, isInputRange, std,range,primitives) to
iterate over.
Returns: A range of elements of type `Tuple!(ElementType!R, uint)`,
representing each consecutively unique element and its respective number of
occurrences in that run. This will be an input range if `R` is an input
range, and a forward range in all other cases.
See_Also: $(LREF chunkBy), which chunks an input range into subranges
of equivalent adjacent elements.
*/
Group!(pred, Range) group(alias pred = "a == b", Range)(Range r)
{
return typeof(return)(r);
}
/// ditto
struct Group(alias pred, R)
if (isInputRange!R)
{
import std.typecons : Rebindable, tuple, Tuple;
private alias comp = binaryFun!pred;
private alias E = ElementType!R;
static if ((is(E == class) || is(E == interface)) &&
(is(E == const) || is(E == immutable)))
{
private alias MutableE = Rebindable!E;
}
else static if (is(E : Unqual!E))
{
private alias MutableE = Unqual!E;
}
else
{
private alias MutableE = E;
}
private R _input;
private Tuple!(MutableE, uint) _current;
///
this(R input)
{
_input = input;
if (!_input.empty) popFront();
}
///
void popFront()
{
if (_input.empty)
{
_current[1] = 0;
}
else
{
_current = tuple(_input.front, 1u);
_input.popFront();
while (!_input.empty && comp(_current[0], _input.front))
{
++_current[1];
_input.popFront();
}
}
}
static if (isInfinite!R)
{
///
enum bool empty = false; // Propagate infiniteness.
}
else
{
///
@property bool empty()
{
return _current[1] == 0;
}
}
///
@property auto ref front()
{
assert(!empty, "Attempting to fetch the front of an empty Group.");
return _current;
}
static if (isForwardRange!R)
{
///
@property typeof(this) save() {
typeof(this) ret = this;
ret._input = this._input.save;
ret._current = this._current;
return ret;
}
}
}
///
@safe unittest
{
import std.algorithm.comparison : equal;
import std.typecons : tuple, Tuple;
int[] arr = [ 1, 2, 2, 2, 2, 3, 4, 4, 4, 5 ];
assert(equal(group(arr), [ tuple(1, 1u), tuple(2, 4u), tuple(3, 1u),
tuple(4, 3u), tuple(5, 1u) ][]));
}
/**
* Using group, an associative array can be easily generated with the count of each
* unique element in the range.
*/
@safe unittest
{
import std.algorithm.sorting : sort;
import std.array : assocArray;
uint[string] result;
auto range = ["a", "b", "a", "c", "b", "c", "c", "d", "e"];
result = range.sort!((a, b) => a < b)
.group
.assocArray;
assert(result == ["a": 2U, "b": 2U, "c": 3U, "d": 1U, "e": 1U]);
}
@safe unittest
{
import std.algorithm.comparison : equal;
import std.internal.test.dummyrange;
import std.typecons : tuple, Tuple;
int[] arr = [ 1, 2, 2, 2, 2, 3, 4, 4, 4, 5 ];
assert(equal(group(arr), [ tuple(1, 1u), tuple(2, 4u), tuple(3, 1u),
tuple(4, 3u), tuple(5, 1u) ][]));
static assert(isForwardRange!(typeof(group(arr))));
foreach (DummyType; AllDummyRanges)
{
DummyType d;
auto g = group(d);
static assert(d.rt == RangeType.Input || isForwardRange!(typeof(g)));
assert(equal(g, [tuple(1, 1u), tuple(2, 1u), tuple(3, 1u), tuple(4, 1u),
tuple(5, 1u), tuple(6, 1u), tuple(7, 1u), tuple(8, 1u),
tuple(9, 1u), tuple(10, 1u)]));
}
}
@safe unittest
{
import std.algorithm.comparison : equal;
import std.typecons : tuple;
// Issue 13857
immutable(int)[] a1 = [1,1,2,2,2,3,4,4,5,6,6,7,8,9,9,9];
auto g1 = group(a1);
assert(equal(g1, [ tuple(1, 2u), tuple(2, 3u), tuple(3, 1u),
tuple(4, 2u), tuple(5, 1u), tuple(6, 2u),
tuple(7, 1u), tuple(8, 1u), tuple(9, 3u)
]));
// Issue 13162
immutable(ubyte)[] a2 = [1, 1, 1, 0, 0, 0];
auto g2 = a2.group;
assert(equal(g2, [ tuple(1, 3u), tuple(0, 3u) ]));
// Issue 10104
const a3 = [1, 1, 2, 2];
auto g3 = a3.group;
assert(equal(g3, [ tuple(1, 2u), tuple(2, 2u) ]));
interface I {}
class C : I {}
const C[] a4 = [new const C()];
auto g4 = a4.group!"a is b";
assert(g4.front[1] == 1);
immutable I[] a5 = [new immutable C()];
auto g5 = a5.group!"a is b";
assert(g5.front[1] == 1);
const(int[][]) a6 = [[1], [1]];
auto g6 = a6.group;
assert(equal(g6.front[0], [1]));
}
// Used by implementation of chunkBy for non-forward input ranges.
private struct ChunkByChunkImpl(alias pred, Range)
if (isInputRange!Range && !isForwardRange!Range)
{
alias fun = binaryFun!pred;
private Range r;
private ElementType!Range prev;
this(Range range, ElementType!Range _prev)
{
r = range;
prev = _prev;
}
@property bool empty()
{
return r.empty || !fun(prev, r.front);
}
@property ElementType!Range front() { return r.front; }
void popFront() { r.popFront(); }
}
private template ChunkByImplIsUnary(alias pred, Range)
{
static if (is(typeof(binaryFun!pred(ElementType!Range.init,
ElementType!Range.init)) : bool))
enum ChunkByImplIsUnary = false;
else static if (is(typeof(
unaryFun!pred(ElementType!Range.init) ==
unaryFun!pred(ElementType!Range.init))))
enum ChunkByImplIsUnary = true;
else
static assert(0, "chunkBy expects either a binary predicate or "~
"a unary predicate on range elements of type: "~
ElementType!Range.stringof);
}
// Implementation of chunkBy for non-forward input ranges.
private struct ChunkByImpl(alias pred, Range)
if (isInputRange!Range && !isForwardRange!Range)
{
enum bool isUnary = ChunkByImplIsUnary!(pred, Range);
static if (isUnary)
alias eq = binaryFun!((a, b) => unaryFun!pred(a) == unaryFun!pred(b));
else
alias eq = binaryFun!pred;
private Range r;
private ElementType!Range _prev;
this(Range _r)
{
r = _r;
if (!empty)
{
// Check reflexivity if predicate is claimed to be an equivalence
// relation.
assert(eq(r.front, r.front),
"predicate is not reflexive");
// _prev's type may be a nested struct, so must be initialized
// directly in the constructor (cannot call savePred()).
_prev = r.front;
}
else
{
// We won't use _prev, but must be initialized.
_prev = typeof(_prev).init;
}
}
@property bool empty() { return r.empty; }
@property auto front()
{
static if (isUnary)
{
import std.typecons : tuple;
return tuple(unaryFun!pred(_prev),
ChunkByChunkImpl!(eq, Range)(r, _prev));
}
else
{
return ChunkByChunkImpl!(eq, Range)(r, _prev);
}
}
void popFront()
{
while (!r.empty)
{
if (!eq(_prev, r.front))
{
_prev = r.front;
break;
}
r.popFront();
}
}
}
// Single-pass implementation of chunkBy for forward ranges.
private struct ChunkByImpl(alias pred, Range)
if (isForwardRange!Range)
{
import std.typecons : RefCounted;
enum bool isUnary = ChunkByImplIsUnary!(pred, Range);
static if (isUnary)
alias eq = binaryFun!((a, b) => unaryFun!pred(a) == unaryFun!pred(b));
else
alias eq = binaryFun!pred;
// Outer range
static struct Impl
{
size_t groupNum;
Range current;
Range next;
}
// Inner range
static struct Group
{
private size_t groupNum;
private Range start;
private Range current;
private RefCounted!Impl mothership;
this(RefCounted!Impl origin)
{
groupNum = origin.groupNum;
start = origin.current.save;
current = origin.current.save;
assert(!start.empty);
mothership = origin;
// Note: this requires reflexivity.
assert(eq(start.front, current.front),
"predicate is not reflexive");
}
@property bool empty() { return groupNum == size_t.max; }
@property auto ref front() { return current.front; }
void popFront()
{
current.popFront();
// Note: this requires transitivity.
if (current.empty || !eq(start.front, current.front))
{
if (groupNum == mothership.groupNum)
{
// If parent range hasn't moved on yet, help it along by
// saving location of start of next Group.
mothership.next = current.save;
}
groupNum = size_t.max;
}
}
@property auto save()
{
auto copy = this;
copy.current = current.save;
return copy;
}
}
static assert(isForwardRange!Group);
private RefCounted!Impl impl;
this(Range r)
{
impl = RefCounted!Impl(0, r, r.save);
}
@property bool empty() { return impl.current.empty; }
@property auto front()
{
static if (isUnary)
{
import std.typecons : tuple;
return tuple(unaryFun!pred(impl.current.front), Group(impl));
}
else
{
return Group(impl);
}
}
void popFront()
{
// Scan for next group. If we're lucky, one of our Groups would have
// already set .next to the start of the next group, in which case the
// loop is skipped.
while (!impl.next.empty && eq(impl.current.front, impl.next.front))
{
impl.next.popFront();
}
impl.current = impl.next.save;
// Indicate to any remaining Groups that we have moved on.
impl.groupNum++;
}
@property auto save()
{
// Note: the new copy of the range will be detached from any existing
// satellite Groups, and will not benefit from the .next acceleration.
return typeof(this)(impl.current.save);
}
static assert(isForwardRange!(typeof(this)));
}
@system unittest
{
import std.algorithm.comparison : equal;
size_t popCount = 0;
class RefFwdRange
{
int[] impl;
@safe nothrow:
this(int[] data) { impl = data; }
@property bool empty() { return impl.empty; }
@property auto ref front() { return impl.front; }
void popFront()
{
impl.popFront();
popCount++;
}
@property auto save() { return new RefFwdRange(impl); }
}
static assert(isForwardRange!RefFwdRange);
auto testdata = new RefFwdRange([1, 3, 5, 2, 4, 7, 6, 8, 9]);
auto groups = testdata.chunkBy!((a,b) => (a % 2) == (b % 2));
auto outerSave1 = groups.save;
// Sanity test
assert(groups.equal!equal([[1, 3, 5], [2, 4], [7], [6, 8], [9]]));
assert(groups.empty);
// Performance test for single-traversal use case: popFront should not have
// been called more times than there are elements if we traversed the
// segmented range exactly once.
assert(popCount == 9);
// Outer range .save test
groups = outerSave1.save;
assert(!groups.empty);
// Inner range .save test
auto grp1 = groups.front.save;
auto grp1b = grp1.save;
assert(grp1b.equal([1, 3, 5]));
assert(grp1.save.equal([1, 3, 5]));
// Inner range should remain consistent after outer range has moved on.
groups.popFront();
assert(grp1.save.equal([1, 3, 5]));
// Inner range should not be affected by subsequent inner ranges.
assert(groups.front.equal([2, 4]));
assert(grp1.save.equal([1, 3, 5]));
}
/**
* Chunks an input range into subranges of equivalent adjacent elements.
* In other languages this is often called `partitionBy`, `groupBy`
* or `sliceWhen`.
*
* Equivalence is defined by the predicate `pred`, which can be either
* binary, which is passed to $(REF binaryFun, std,functional), or unary, which is
* passed to $(REF unaryFun, std,functional). In the binary form, two _range elements
* `a` and `b` are considered equivalent if `pred(a,b)` is true. In
* unary form, two elements are considered equivalent if `pred(a) == pred(b)`
* is true.
*
* This predicate must be an equivalence relation, that is, it must be
* reflexive (`pred(x,x)` is always true), symmetric
* (`pred(x,y) == pred(y,x)`), and transitive (`pred(x,y) && pred(y,z)`
* implies `pred(x,z)`). If this is not the case, the range returned by
* chunkBy may assert at runtime or behave erratically.
*
* Params:
* pred = Predicate for determining equivalence.
* r = An $(REF_ALTTEXT input range, isInputRange, std,range,primitives) to be chunked.
*
* Returns: With a binary predicate, a range of ranges is returned in which
* all elements in a given subrange are equivalent under the given predicate.
* With a unary predicate, a range of tuples is returned, with the tuple
* consisting of the result of the unary predicate for each subrange, and the
* subrange itself.
*
* Notes:
*
* Equivalent elements separated by an intervening non-equivalent element will
* appear in separate subranges; this function only considers adjacent
* equivalence. Elements in the subranges will always appear in the same order
* they appear in the original range.
*
* See_also:
* $(LREF group), which collapses adjacent equivalent elements into a single
* element.
*/
auto chunkBy(alias pred, Range)(Range r)
if (isInputRange!Range)
{
return ChunkByImpl!(pred, Range)(r);
}
/// Showing usage with binary predicate:
/*FIXME: @safe*/ @system unittest
{
import std.algorithm.comparison : equal;
// Grouping by particular attribute of each element:
auto data = [
[1, 1],
[1, 2],
[2, 2],
[2, 3]
];
auto r1 = data.chunkBy!((a,b) => a[0] == b[0]);
assert(r1.equal!equal([
[[1, 1], [1, 2]],
[[2, 2], [2, 3]]
]));
auto r2 = data.chunkBy!((a,b) => a[1] == b[1]);
assert(r2.equal!equal([
[[1, 1]],
[[1, 2], [2, 2]],
[[2, 3]]
]));
}
version(none) // this example requires support for non-equivalence relations
@safe unittest
{
// Grouping by maximum adjacent difference:
import std.math : abs;
auto r3 = [1, 3, 2, 5, 4, 9, 10].chunkBy!((a, b) => abs(a-b) < 3);
assert(r3.equal!equal([
[1, 3, 2],
[5, 4],
[9, 10]
]));
}
/// Showing usage with unary predicate:
/* FIXME: pure @safe nothrow*/ @system unittest
{
import std.algorithm.comparison : equal;
import std.range.primitives;
import std.typecons : tuple;
// Grouping by particular attribute of each element:
auto range =
[
[1, 1],
[1, 1],
[1, 2],
[2, 2],
[2, 3],
[2, 3],
[3, 3]
];
auto byX = chunkBy!(a => a[0])(range);
auto expected1 =
[
tuple(1, [[1, 1], [1, 1], [1, 2]]),
tuple(2, [[2, 2], [2, 3], [2, 3]]),
tuple(3, [[3, 3]])
];
foreach (e; byX)
{
assert(!expected1.empty);
assert(e[0] == expected1.front[0]);
assert(e[1].equal(expected1.front[1]));
expected1.popFront();
}
auto byY = chunkBy!(a => a[1])(range);
auto expected2 =
[
tuple(1, [[1, 1], [1, 1]]),
tuple(2, [[1, 2], [2, 2]]),
tuple(3, [[2, 3], [2, 3], [3, 3]])
];
foreach (e; byY)
{
assert(!expected2.empty);
assert(e[0] == expected2.front[0]);
assert(e[1].equal(expected2.front[1]));
expected2.popFront();
}
}
/*FIXME: pure @safe nothrow*/ @system unittest
{
import std.algorithm.comparison : equal;
import std.typecons : tuple;
struct Item { int x, y; }
// Force R to have only an input range API with reference semantics, so
// that we're not unknowingly making use of array semantics outside of the
// range API.
class RefInputRange(R)
{
R data;
this(R _data) pure @safe nothrow { data = _data; }
@property bool empty() pure @safe nothrow { return data.empty; }
@property auto front() pure @safe nothrow { return data.front; }
void popFront() pure @safe nothrow { data.popFront(); }
}
auto refInputRange(R)(R range) { return new RefInputRange!R(range); }
{
auto arr = [ Item(1,2), Item(1,3), Item(2,3) ];
static assert(isForwardRange!(typeof(arr)));
auto byX = chunkBy!(a => a.x)(arr);
static assert(isForwardRange!(typeof(byX)));
auto byX_subrange1 = byX.front[1].save;
auto byX_subrange2 = byX.front[1].save;
static assert(isForwardRange!(typeof(byX_subrange1)));
static assert(isForwardRange!(typeof(byX_subrange2)));
byX.popFront();
assert(byX_subrange1.equal([ Item(1,2), Item(1,3) ]));
byX_subrange1.popFront();
assert(byX_subrange1.equal([ Item(1,3) ]));
assert(byX_subrange2.equal([ Item(1,2), Item(1,3) ]));
auto byY = chunkBy!(a => a.y)(arr);
static assert(isForwardRange!(typeof(byY)));
auto byY2 = byY.save;
static assert(is(typeof(byY) == typeof(byY2)));
byY.popFront();
assert(byY.front[0] == 3);
assert(byY.front[1].equal([ Item(1,3), Item(2,3) ]));
assert(byY2.front[0] == 2);
assert(byY2.front[1].equal([ Item(1,2) ]));
}
// Test non-forward input ranges.
{
auto range = refInputRange([ Item(1,1), Item(1,2), Item(2,2) ]);
auto byX = chunkBy!(a => a.x)(range);
assert(byX.front[0] == 1);
assert(byX.front[1].equal([ Item(1,1), Item(1,2) ]));
byX.popFront();
assert(byX.front[0] == 2);
assert(byX.front[1].equal([ Item(2,2) ]));
byX.popFront();
assert(byX.empty);
assert(range.empty);
range = refInputRange([ Item(1,1), Item(1,2), Item(2,2) ]);
auto byY = chunkBy!(a => a.y)(range);
assert(byY.front[0] == 1);
assert(byY.front[1].equal([ Item(1,1) ]));
byY.popFront();
assert(byY.front[0] == 2);
assert(byY.front[1].equal([ Item(1,2), Item(2,2) ]));
byY.popFront();
assert(byY.empty);
assert(range.empty);
}
}
// Issue 13595
version(none) // This requires support for non-equivalence relations
@system unittest
{
import std.algorithm.comparison : equal;
auto r = [1, 2, 3, 4, 5, 6, 7, 8, 9].chunkBy!((x, y) => ((x*y) % 3) == 0);
assert(r.equal!equal([
[1],
[2, 3, 4],
[5, 6, 7],
[8, 9]
]));
}
// Issue 13805
@system unittest
{
[""].map!((s) => s).chunkBy!((x, y) => true);
}
// joiner
/**
Lazily joins a range of ranges with a separator. The separator itself
is a range. If a separator is not provided, then the ranges are
joined directly without anything in between them (often called `flatten`
in other languages).
Params:
r = An $(REF_ALTTEXT input range, isInputRange, std,range,primitives) of input
ranges to be joined.
sep = A $(REF_ALTTEXT forward range, isForwardRange, std,range,primitives) of
element(s) to serve as separators in the joined range.
Returns:
A range of elements in the joined range. This will be a forward range if
both outer and inner ranges of `RoR` are forward ranges; otherwise it will
be only an input range.
See_also:
$(REF chain, std,range), which chains a sequence of ranges with compatible elements
into a single range.
*/
auto joiner(RoR, Separator)(RoR r, Separator sep)
if (isInputRange!RoR && isInputRange!(ElementType!RoR)
&& isForwardRange!Separator
&& is(ElementType!Separator : ElementType!(ElementType!RoR)))
{
static struct Result
{
private RoR _items;
private ElementType!RoR _current;
private Separator _sep, _currentSep;
// This is a mixin instead of a function for the following reason (as
// explained by Kenji Hara): "This is necessary from 2.061. If a
// struct has a nested struct member, it must be directly initialized
// in its constructor to avoid leaving undefined state. If you change
// setItem to a function, the initialization of _current field is
// wrapped into private member function, then compiler could not detect
// that is correctly initialized while constructing. To avoid the
// compiler error check, string mixin is used."
private enum setItem =
q{
if (!_items.empty)
{
// If we're exporting .save, we must not consume any of the
// subranges, since RoR.save does not guarantee that the states
// of the subranges are also saved.
static if (isForwardRange!RoR &&
isForwardRange!(ElementType!RoR))
_current = _items.front.save;
else
_current = _items.front;
}
};
private void useSeparator()
{
// Separator must always come after an item.
assert(_currentSep.empty && !_items.empty,
"joiner: internal error");
_items.popFront();
// If there are no more items, we're done, since separators are not
// terminators.
if (_items.empty) return;
if (_sep.empty)
{
// Advance to the next range in the
// input
while (_items.front.empty)
{
_items.popFront();
if (_items.empty) return;
}
mixin(setItem);
}
else
{
_currentSep = _sep.save;
assert(!_currentSep.empty);
}
}
private enum useItem =
q{
// FIXME: this will crash if either _currentSep or _current are
// class objects, because .init is null when the ctor invokes this
// mixin.
//assert(_currentSep.empty && _current.empty,
// "joiner: internal error");
// Use the input
if (_items.empty) return;
mixin(setItem);
if (_current.empty)
{
// No data in the current item - toggle to use the separator
useSeparator();
}
};
this(RoR items, Separator sep)
{
_items = items;
_sep = sep;
//mixin(useItem); // _current should be initialized in place
if (_items.empty)
_current = _current.init; // set invalid state
else
{
// If we're exporting .save, we must not consume any of the
// subranges, since RoR.save does not guarantee that the states
// of the subranges are also saved.
static if (isForwardRange!RoR &&
isForwardRange!(ElementType!RoR))
_current = _items.front.save;
else
_current = _items.front;
if (_current.empty)
{
// No data in the current item - toggle to use the separator
useSeparator();
}
}
}
@property auto empty()
{
return _items.empty;
}
@property ElementType!(ElementType!RoR) front()
{
if (!_currentSep.empty) return _currentSep.front;
assert(!_current.empty, "Attempting to fetch the front of an empty joiner.");
return _current.front;
}
void popFront()
{
assert(!_items.empty, "Attempting to popFront an empty joiner.");
// Using separator?
if (!_currentSep.empty)
{
_currentSep.popFront();
if (!_currentSep.empty) return;
mixin(useItem);
}
else
{
// we're using the range
_current.popFront();
if (!_current.empty) return;
useSeparator();
}
}
static if (isForwardRange!RoR && isForwardRange!(ElementType!RoR))
{
@property auto save()
{
Result copy = this;
copy._items = _items.save;
copy._current = _current.save;
copy._sep = _sep.save;
copy._currentSep = _currentSep.save;
return copy;
}
}
}
return Result(r, sep);
}
///
@safe unittest
{
import std.algorithm.comparison : equal;
import std.conv : text;
assert(["abc", "def"].joiner.equal("abcdef"));
assert(["Mary", "has", "a", "little", "lamb"]
.joiner("...")
.equal("Mary...has...a...little...lamb"));
assert(["", "abc"].joiner("xyz").equal("xyzabc"));
assert([""].joiner("xyz").equal(""));
assert(["", ""].joiner("xyz").equal("xyz"));
}
@system unittest
{
import std.algorithm.comparison : equal;
import std.range.interfaces;
import std.range.primitives;
// joiner() should work for non-forward ranges too.
auto r = inputRangeObject(["abc", "def"]);
assert(equal(joiner(r, "xyz"), "abcxyzdef"));
}
@system unittest
{
import std.algorithm.comparison : equal;
import std.range;
// Related to issue 8061
auto r = joiner([
inputRangeObject("abc"),
inputRangeObject("def"),
], "-*-");
assert(equal(r, "abc-*-def"));
// Test case where separator is specified but is empty.
auto s = joiner([
inputRangeObject("abc"),
inputRangeObject("def"),
], "");
assert(equal(s, "abcdef"));
// Test empty separator with some empty elements
auto t = joiner([
inputRangeObject("abc"),
inputRangeObject(""),
inputRangeObject("def"),
inputRangeObject(""),
], "");
assert(equal(t, "abcdef"));
// Test empty elements with non-empty separator
auto u = joiner([
inputRangeObject(""),
inputRangeObject("abc"),
inputRangeObject(""),
inputRangeObject("def"),
inputRangeObject(""),
], "+-");
assert(equal(u, "+-abc+-+-def+-"));
// Issue 13441: only(x) as separator
string[][] lines = [null];
lines
.joiner(only("b"))
.array();
}
@safe unittest
{
import std.algorithm.comparison : equal;
// Transience correctness test
struct TransientRange
{
@safe:
int[][] src;
int[] buf;
this(int[][] _src)
{
src = _src;
buf.length = 100;
}
@property bool empty() { return src.empty; }
@property int[] front()
{
assert(src.front.length <= buf.length);
buf[0 .. src.front.length] = src.front[0..$];
return buf[0 .. src.front.length];
}
void popFront() { src.popFront(); }
}
// Test embedded empty elements
auto tr1 = TransientRange([[], [1,2,3], [], [4]]);
assert(equal(joiner(tr1, [0]), [0,1,2,3,0,0,4]));
// Test trailing empty elements
auto tr2 = TransientRange([[], [1,2,3], []]);
assert(equal(joiner(tr2, [0]), [0,1,2,3,0]));
// Test no empty elements
auto tr3 = TransientRange([[1,2], [3,4]]);
assert(equal(joiner(tr3, [0,1]), [1,2,0,1,3,4]));
// Test consecutive empty elements
auto tr4 = TransientRange([[1,2], [], [], [], [3,4]]);
assert(equal(joiner(tr4, [0,1]), [1,2,0,1,0,1,0,1,0,1,3,4]));
// Test consecutive trailing empty elements
auto tr5 = TransientRange([[1,2], [3,4], [], []]);
assert(equal(joiner(tr5, [0,1]), [1,2,0,1,3,4,0,1,0,1]));
}
@safe unittest
{
static assert(isInputRange!(typeof(joiner([""], ""))));
static assert(isForwardRange!(typeof(joiner([""], ""))));
}
/// Ditto
auto joiner(RoR)(RoR r)
if (isInputRange!RoR && isInputRange!(ElementType!RoR))
{
static struct Result
{
private:
RoR _items;
ElementType!RoR _current;
enum prepare =
q{
// Skip over empty subranges.
if (_items.empty) return;
while (_items.front.empty)
{
_items.popFront();
if (_items.empty) return;
}
// We cannot export .save method unless we ensure subranges are not
// consumed when a .save'd copy of ourselves is iterated over. So
// we need to .save each subrange we traverse.
static if (isForwardRange!RoR && isForwardRange!(ElementType!RoR))
_current = _items.front.save;
else
_current = _items.front;
};
this(RoR items, ElementType!RoR current)
{
_items = items;
_current = current;
}
public:
this(RoR r)
{
_items = r;
//mixin(prepare); // _current should be initialized in place
// Skip over empty subranges.
while (!_items.empty && _items.front.empty)
_items.popFront();
if (_items.empty)
_current = _current.init; // set invalid state
else
{
// We cannot export .save method unless we ensure subranges are not
// consumed when a .save'd copy of ourselves is iterated over. So
// we need to .save each subrange we traverse.
static if (isForwardRange!RoR && isForwardRange!(ElementType!RoR))
_current = _items.front.save;
else
_current = _items.front;
}
}
static if (isInfinite!RoR)
{
enum bool empty = false;
}
else
{
@property auto empty()
{
return _items.empty;
}
}
@property auto ref front()
{
assert(!empty, "Attempting to fetch the front of an empty joiner.");
return _current.front;
}
void popFront()
{
assert(!_current.empty, "Attempting to popFront an empty joiner.");
_current.popFront();
if (_current.empty)
{
assert(!_items.empty);
_items.popFront();
mixin(prepare);
}
}
static if (isForwardRange!RoR && isForwardRange!(ElementType!RoR))
{
@property auto save()
{
return Result(_items.save, _current.save);
}
}
static if (hasAssignableElements!(ElementType!RoR))
{
@property void front(ElementType!(ElementType!RoR) element)
{
assert(!empty, "Attempting to assign to front of an empty joiner.");
_current.front = element;
}
@property void front(ref ElementType!(ElementType!RoR) element)
{
assert(!empty, "Attempting to assign to front of an empty joiner.");
_current.front = element;
}
}
}
return Result(r);
}
@safe unittest
{
import std.algorithm.comparison : equal;
import std.range.interfaces : inputRangeObject;
import std.range : repeat;
static assert(isInputRange!(typeof(joiner([""]))));
static assert(isForwardRange!(typeof(joiner([""]))));
assert(equal(joiner([""]), ""));
assert(equal(joiner(["", ""]), ""));
assert(equal(joiner(["", "abc"]), "abc"));
assert(equal(joiner(["abc", ""]), "abc"));
assert(equal(joiner(["abc", "def"]), "abcdef"));
assert(equal(joiner(["Mary", "has", "a", "little", "lamb"]),
"Maryhasalittlelamb"));
assert(equal(joiner(repeat("abc", 3)), "abcabcabc"));
// joiner allows in-place mutation!
auto a = [ [1, 2, 3], [42, 43] ];
auto j = joiner(a);
j.front = 44;
assert(a == [ [44, 2, 3], [42, 43] ]);
assert(equal(j, [44, 2, 3, 42, 43]));
}
@system unittest
{
import std.algorithm.comparison : equal;
import std.range.interfaces : inputRangeObject;
// bugzilla 8240
assert(equal(joiner([inputRangeObject("")]), ""));
// issue 8792
auto b = [[1], [2], [3]];
auto jb = joiner(b);
auto js = jb.save;
assert(equal(jb, js));
auto js2 = jb.save;
jb.popFront();
assert(!equal(jb, js));
assert(equal(js2, js));
js.popFront();
assert(equal(jb, js));
assert(!equal(js2, js));
}
@safe unittest
{
import std.algorithm.comparison : equal;
struct TransientRange
{
@safe:
int[] _buf;
int[][] _values;
this(int[][] values)
{
_values = values;
_buf = new int[128];
}
@property bool empty()
{
return _values.length == 0;
}
@property auto front()
{
foreach (i; 0 .. _values.front.length)
{
_buf[i] = _values[0][i];
}
return _buf[0 .. _values.front.length];
}
void popFront()
{
_values = _values[1 .. $];
}
}
auto rr = TransientRange([[1,2], [3,4,5], [], [6,7]]);
// Can't use array() or equal() directly because they fail with transient
// .front.
int[] result;
foreach (c; rr.joiner())
{
result ~= c;
}
assert(equal(result, [1,2,3,4,5,6,7]));
}
@safe unittest
{
import std.algorithm.comparison : equal;
import std.algorithm.internal : algoFormat;
struct TransientRange
{
@safe:
dchar[] _buf;
dstring[] _values;
this(dstring[] values)
{
_buf.length = 128;
_values = values;
}
@property bool empty()
{
return _values.length == 0;
}
@property auto front()
{
foreach (i; 0 .. _values.front.length)
{
_buf[i] = _values[0][i];
}
return _buf[0 .. _values.front.length];
}
void popFront()
{
_values = _values[1 .. $];
}
}
auto rr = TransientRange(["abc"d, "12"d, "def"d, "34"d]);
// Can't use array() or equal() directly because they fail with transient
// .front.
dchar[] result;
foreach (c; rr.joiner())
{
result ~= c;
}
import std.conv : to;
assert(equal(result, "abc12def34"d),
//Convert to string for assert's message
to!string("Unexpected result: '%s'"d.algoFormat(result)));
}
// Issue 8061
@system unittest
{
import std.conv : to;
import std.range.interfaces;
auto r = joiner([inputRangeObject("ab"), inputRangeObject("cd")]);
assert(isForwardRange!(typeof(r)));
auto str = to!string(r);
assert(str == "abcd");
}
@safe unittest
{
import std.range : repeat;
class AssignableRange
{
@safe:
int element;
@property int front()
{
return element;
}
enum empty = false;
void popFront()
{
}
@property void front(int newValue)
{
element = newValue;
}
}
static assert(isInputRange!AssignableRange);
static assert(is(ElementType!AssignableRange == int));
static assert(hasAssignableElements!AssignableRange);
static assert(!hasLvalueElements!AssignableRange);
auto range = new AssignableRange();
assert(range.element == 0);
auto joined = joiner(repeat(range));
joined.front = 5;
assert(range.element == 5);
assert(joined.front == 5);
joined.popFront;
int byRef = 7;
joined.front = byRef;
assert(range.element == byRef);
assert(joined.front == byRef);
}
/++
Implements the homonym function (also known as `accumulate`, $(D
compress), `inject`, or `foldl`) present in various programming
languages of functional flavor. There is also $(LREF fold) which does
the same thing but with the opposite parameter order.
The call `reduce!(fun)(seed, range)` first assigns `seed` to
an internal variable `result`, also called the accumulator.
Then, for each element `x` in `range`, `result = fun(result, x)`
gets evaluated. Finally, `result` is returned.
The one-argument version `reduce!(fun)(range)`
works similarly, but it uses the first element of the range as the
seed (the range must be non-empty).
Returns:
the accumulated `result`
Params:
fun = one or more functions
See_Also:
$(HTTP en.wikipedia.org/wiki/Fold_(higher-order_function), Fold (higher-order function))
$(LREF fold) is functionally equivalent to $(LREF _reduce) with the argument
order reversed, and without the need to use $(REF_ALTTEXT $(D tuple),tuple,std,typecons)
for multiple seeds. This makes it easier to use in UFCS chains.
$(LREF sum) is similar to `reduce!((a, b) => a + b)` that offers
pairwise summing of floating point numbers.
+/
template reduce(fun...)
if (fun.length >= 1)
{
import std.meta : staticMap;
alias binfuns = staticMap!(binaryFun, fun);
static if (fun.length > 1)
import std.typecons : tuple, isTuple;
/++
No-seed version. The first element of `r` is used as the seed's value.
For each function `f` in `fun`, the corresponding
seed type `S` is `Unqual!(typeof(f(e, e)))`, where `e` is an
element of `r`: `ElementType!R` for ranges,
and `ForeachType!R` otherwise.
Once S has been determined, then `S s = e;` and `s = f(s, e);`
must both be legal.
If `r` is empty, an `Exception` is thrown.
Params:
r = an iterable value as defined by `isIterable`
Returns:
the final result of the accumulator applied to the iterable
+/
auto reduce(R)(R r)
if (isIterable!R)
{
import std.exception : enforce;
alias E = Select!(isInputRange!R, ElementType!R, ForeachType!R);
alias Args = staticMap!(ReduceSeedType!E, binfuns);
static if (isInputRange!R)
{
enforce(!r.empty, "Cannot reduce an empty input range w/o an explicit seed value.");
Args result = r.front;
r.popFront();
return reduceImpl!false(r, result);
}
else
{
auto result = Args.init;
return reduceImpl!true(r, result);
}
}
/++
Seed version. The seed should be a single value if `fun` is a
single function. If `fun` is multiple functions, then `seed`
should be a $(REF Tuple, std,typecons), with one field per function in `f`.
For convenience, if the seed is const, or has qualified fields, then
`reduce` will operate on an unqualified copy. If this happens
then the returned type will not perfectly match `S`.
Use `fold` instead of `reduce` to use the seed version in a UFCS chain.
Params:
seed = the initial value of the accumulator
r = an iterable value as defined by `isIterable`
Returns:
the final result of the accumulator applied to the iterable
+/
auto reduce(S, R)(S seed, R r)
if (isIterable!R)
{
static if (fun.length == 1)
return reducePreImpl(r, seed);
else
{
import std.algorithm.internal : algoFormat;
static assert(isTuple!S, algoFormat("Seed %s should be a Tuple", S.stringof));
return reducePreImpl(r, seed.expand);
}
}
private auto reducePreImpl(R, Args...)(R r, ref Args args)
{
alias Result = staticMap!(Unqual, Args);
static if (is(Result == Args))
alias result = args;
else
Result result = args;
return reduceImpl!false(r, result);
}
private auto reduceImpl(bool mustInitialize, R, Args...)(R r, ref Args args)
if (isIterable!R)
{
import std.algorithm.internal : algoFormat;
static assert(Args.length == fun.length,
algoFormat("Seed %s does not have the correct amount of fields (should be %s)", Args.stringof, fun.length));
alias E = Select!(isInputRange!R, ElementType!R, ForeachType!R);
static if (mustInitialize) bool initialized = false;
foreach (/+auto ref+/ E e; r) // @@@4707@@@
{
foreach (i, f; binfuns)
{
static assert(!is(typeof(f(args[i], e))) || is(typeof(args[i] = f(args[i], e))),
algoFormat(
"Incompatible function/seed/element: %s/%s/%s",
fullyQualifiedName!f,
Args[i].stringof,
E.stringof
)
);
}
static if (mustInitialize) if (initialized == false)
{
import std.conv : emplaceRef;
foreach (i, f; binfuns)
emplaceRef!(Args[i])(args[i], e);
initialized = true;
continue;
}
foreach (i, f; binfuns)
args[i] = f(args[i], e);
}
static if (mustInitialize)
if (!initialized)
throw new Exception("Cannot reduce an empty iterable w/o an explicit seed value.");
static if (Args.length == 1)
return args[0];
else
return tuple(args);
}
}
/**
Many aggregate range operations turn out to be solved with `reduce`
quickly and easily. The example below illustrates `reduce`'s
remarkable power and flexibility.
*/
@safe unittest
{
import std.algorithm.comparison : max, min;
import std.math : approxEqual;
import std.range;
int[] arr = [ 1, 2, 3, 4, 5 ];
// Sum all elements
auto sum = reduce!((a,b) => a + b)(0, arr);
assert(sum == 15);
// Sum again, using a string predicate with "a" and "b"
sum = reduce!"a + b"(0, arr);
assert(sum == 15);
// Compute the maximum of all elements
auto largest = reduce!(max)(arr);
assert(largest == 5);
// Max again, but with Uniform Function Call Syntax (UFCS)
largest = arr.reduce!(max);
assert(largest == 5);
// Compute the number of odd elements
auto odds = reduce!((a,b) => a + (b & 1))(0, arr);
assert(odds == 3);
// Compute the sum of squares
auto ssquares = reduce!((a,b) => a + b * b)(0, arr);
assert(ssquares == 55);
// Chain multiple ranges into seed
int[] a = [ 3, 4 ];
int[] b = [ 100 ];
auto r = reduce!("a + b")(chain(a, b));
assert(r == 107);
// Mixing convertible types is fair game, too
double[] c = [ 2.5, 3.0 ];
auto r1 = reduce!("a + b")(chain(a, b, c));
assert(approxEqual(r1, 112.5));
// To minimize nesting of parentheses, Uniform Function Call Syntax can be used
auto r2 = chain(a, b, c).reduce!("a + b");
assert(approxEqual(r2, 112.5));
}
/**
Sometimes it is very useful to compute multiple aggregates in one pass.
One advantage is that the computation is faster because the looping overhead
is shared. That's why `reduce` accepts multiple functions.
If two or more functions are passed, `reduce` returns a
$(REF Tuple, std,typecons) object with one member per passed-in function.
The number of seeds must be correspondingly increased.
*/
@safe unittest
{
import std.algorithm.comparison : max, min;
import std.math : approxEqual, sqrt;
import std.typecons : tuple, Tuple;
double[] a = [ 3.0, 4, 7, 11, 3, 2, 5 ];
// Compute minimum and maximum in one pass
auto r = reduce!(min, max)(a);
// The type of r is Tuple!(int, int)
assert(approxEqual(r[0], 2)); // minimum
assert(approxEqual(r[1], 11)); // maximum
// Compute sum and sum of squares in one pass
r = reduce!("a + b", "a + b * b")(tuple(0.0, 0.0), a);
assert(approxEqual(r[0], 35)); // sum
assert(approxEqual(r[1], 233)); // sum of squares
// Compute average and standard deviation from the above
auto avg = r[0] / a.length;
assert(avg == 5);
auto stdev = sqrt(r[1] / a.length - avg * avg);
assert(cast(int) stdev == 2);
}
@safe unittest
{
import std.algorithm.comparison : max, min;
import std.range : chain;
import std.typecons : tuple, Tuple;
double[] a = [ 3, 4 ];
auto r = reduce!("a + b")(0.0, a);
assert(r == 7);
r = reduce!("a + b")(a);
assert(r == 7);
r = reduce!(min)(a);
assert(r == 3);
double[] b = [ 100 ];
auto r1 = reduce!("a + b")(chain(a, b));
assert(r1 == 107);
// two funs
auto r2 = reduce!("a + b", "a - b")(tuple(0.0, 0.0), a);
assert(r2[0] == 7 && r2[1] == -7);
auto r3 = reduce!("a + b", "a - b")(a);
assert(r3[0] == 7 && r3[1] == -1);
a = [ 1, 2, 3, 4, 5 ];
// Stringize with commas
string rep = reduce!("a ~ `, ` ~ to!(string)(b)")("", a);
assert(rep[2 .. $] == "1, 2, 3, 4, 5", "["~rep[2 .. $]~"]");
}
@safe unittest
{
import std.algorithm.comparison : max, min;
import std.exception : assertThrown;
import std.range : iota;
import std.typecons : tuple, Tuple;
// Test the opApply case.
static struct OpApply
{
bool actEmpty;
int opApply(scope int delegate(ref int) @safe dg)
{
int res;
if (actEmpty) return res;
foreach (i; 0 .. 100)
{
res = dg(i);
if (res) break;
}
return res;
}
}
OpApply oa;
auto hundredSum = reduce!"a + b"(iota(100));
assert(reduce!"a + b"(5, oa) == hundredSum + 5);
assert(reduce!"a + b"(oa) == hundredSum);
assert(reduce!("a + b", max)(oa) == tuple(hundredSum, 99));
assert(reduce!("a + b", max)(tuple(5, 0), oa) == tuple(hundredSum + 5, 99));
// Test for throwing on empty range plus no seed.
assertThrown(reduce!"a + b"([1, 2][0 .. 0]));
oa.actEmpty = true;
assertThrown(reduce!"a + b"(oa));
}
@safe unittest
{
const float a = 0.0;
const float[] b = [ 1.2, 3, 3.3 ];
float[] c = [ 1.2, 3, 3.3 ];
auto r = reduce!"a + b"(a, b);
r = reduce!"a + b"(a, c);
assert(r == 7.5);
}
@safe unittest
{
// Issue #10408 - Two-function reduce of a const array.
import std.algorithm.comparison : max, min;
import std.typecons : tuple, Tuple;
const numbers = [10, 30, 20];
immutable m = reduce!(min)(numbers);
assert(m == 10);
immutable minmax = reduce!(min, max)(numbers);
assert(minmax == tuple(10, 30));
}
@safe unittest
{
//10709
import std.typecons : tuple, Tuple;
enum foo = "a + 0.5 * b";
auto r = [0, 1, 2, 3];
auto r1 = reduce!foo(r);
auto r2 = reduce!(foo, foo)(r);
assert(r1 == 3);
assert(r2 == tuple(3, 3));
}
@safe unittest
{
static struct OpApply
{
int opApply(int delegate(ref int) @safe dg)
{
int[] a = [1, 2, 3];
int res = 0;
foreach (ref e; a)
{
res = dg(e);
if (res) break;
}
return res;
}
}
//test CTFE and functions with context
int fun(int a, int b) @safe {return a + b + 1;}
auto foo()
{
import std.algorithm.comparison : max;
import std.typecons : tuple, Tuple;
auto a = reduce!(fun)([1, 2, 3]);
auto b = reduce!(fun, fun)([1, 2, 3]);
auto c = reduce!(fun)(0, [1, 2, 3]);
auto d = reduce!(fun, fun)(tuple(0, 0), [1, 2, 3]);
auto e = reduce!(fun)(0, OpApply());
auto f = reduce!(fun, fun)(tuple(0, 0), OpApply());
return max(a, b.expand, c, d.expand, e, f.expand);
}
auto a = foo();
assert(a == 9);
enum b = foo();
assert(b == 9);
}
@safe unittest
{
import std.algorithm.comparison : max, min;
import std.typecons : tuple, Tuple;
//http://forum.dlang.org/post/oghtttkopzjshsuflelk@forum.dlang.org
//Seed is tuple of const.
static auto minmaxElement(alias F = min, alias G = max, R)(in R range)
@safe pure nothrow
if (isInputRange!R)
{
return reduce!(F, G)(tuple(ElementType!R.max,
ElementType!R.min), range);
}
assert(minmaxElement([1, 2, 3]) == tuple(1, 3));
}
@safe unittest //12569
{
import std.algorithm.comparison : max, min;
import std.typecons : tuple;
dchar c = 'a';
reduce!(min, max)(tuple(c, c), "hello"); // OK
static assert(!is(typeof(reduce!(min, max)(tuple(c), "hello"))));
static assert(!is(typeof(reduce!(min, max)(tuple(c, c, c), "hello"))));
//"Seed dchar should be a Tuple"
static assert(!is(typeof(reduce!(min, max)(c, "hello"))));
//"Seed (dchar) does not have the correct amount of fields (should be 2)"
static assert(!is(typeof(reduce!(min, max)(tuple(c), "hello"))));
//"Seed (dchar, dchar, dchar) does not have the correct amount of fields (should be 2)"
static assert(!is(typeof(reduce!(min, max)(tuple(c, c, c), "hello"))));
//"Incompatable function/seed/element: all(alias pred = "a")/int/dchar"
static assert(!is(typeof(reduce!all(1, "hello"))));
static assert(!is(typeof(reduce!(all, all)(tuple(1, 1), "hello"))));
}
@safe unittest //13304
{
int[] data;
static assert(is(typeof(reduce!((a, b) => a + b)(data))));
assert(data.length == 0);
}
//Helper for Reduce
private template ReduceSeedType(E)
{
static template ReduceSeedType(alias fun)
{
import std.algorithm.internal : algoFormat;
alias ReduceSeedType = Unqual!(typeof(fun(lvalueOf!E, lvalueOf!E)));
//Check the Seed type is useable.
ReduceSeedType s = ReduceSeedType.init;
static assert(is(typeof({ReduceSeedType s = lvalueOf!E;})) &&
is(typeof(lvalueOf!ReduceSeedType = fun(lvalueOf!ReduceSeedType, lvalueOf!E))),
algoFormat(
"Unable to deduce an acceptable seed type for %s with element type %s.",
fullyQualifiedName!fun,
E.stringof
)
);
}
}
/++
Implements the homonym function (also known as `accumulate`, $(D
compress), `inject`, or `foldl`) present in various programming
languages of functional flavor. The call `fold!(fun)(range, seed)`
first assigns `seed` to an internal variable `result`,
also called the accumulator. Then, for each element `x` in $(D
range), `result = fun(result, x)` gets evaluated. Finally, $(D
result) is returned. The one-argument version `fold!(fun)(range)`
works similarly, but it uses the first element of the range as the
seed (the range must be non-empty).
Returns:
the accumulated `result`
See_Also:
$(HTTP en.wikipedia.org/wiki/Fold_(higher-order_function), Fold (higher-order function))
$(LREF sum) is similar to `fold!((a, b) => a + b)` that offers
precise summing of floating point numbers.
This is functionally equivalent to $(LREF reduce) with the argument order
reversed, and without the need to use $(REF_ALTTEXT $(D tuple),tuple,std,typecons)
for multiple seeds.
+/
template fold(fun...)
if (fun.length >= 1)
{
auto fold(R, S...)(R r, S seed)
{
static if (S.length < 2)
{
return reduce!fun(seed, r);
}
else
{
import std.typecons : tuple;
return reduce!fun(tuple(seed), r);
}
}
}
///
@safe pure unittest
{
immutable arr = [1, 2, 3, 4, 5];
// Sum all elements
assert(arr.fold!((a, b) => a + b) == 15);
// Sum all elements with explicit seed
assert(arr.fold!((a, b) => a + b)(6) == 21);
import std.algorithm.comparison : min, max;
import std.typecons : tuple;
// Compute minimum and maximum at the same time
assert(arr.fold!(min, max) == tuple(1, 5));
// Compute minimum and maximum at the same time with seeds
assert(arr.fold!(min, max)(0, 7) == tuple(0, 7));
// Can be used in a UFCS chain
assert(arr.map!(a => a + 1).fold!((a, b) => a + b) == 20);
// Return the last element of any range
assert(arr.fold!((a, b) => b) == 5);
}
@safe @nogc pure nothrow unittest
{
int[1] arr;
static assert(!is(typeof(arr.fold!())));
static assert(!is(typeof(arr.fold!(a => a))));
static assert(is(typeof(arr.fold!((a, b) => a))));
static assert(is(typeof(arr.fold!((a, b) => a)(1))));
assert(arr.length == 1);
}
/++
Similar to `fold`, but returns a range containing the successive reduced values.
The call `cumulativeFold!(fun)(range, seed)` first assigns `seed` to an
internal variable `result`, also called the accumulator.
The returned range contains the values `result = fun(result, x)` lazily
evaluated for each element `x` in `range`. Finally, the last element has the
same value as `fold!(fun)(seed, range)`.
The one-argument version `cumulativeFold!(fun)(range)` works similarly, but
it returns the first element unchanged and uses it as seed for the next
elements.
This function is also known as
$(HTTP en.cppreference.com/w/cpp/algorithm/partial_sum, partial_sum),
$(HTTP docs.python.org/3/library/itertools.html#itertools.accumulate, accumulate),
$(HTTP hackage.haskell.org/package/base-4.8.2.0/docs/Prelude.html#v:scanl, scan),
$(HTTP mathworld.wolfram.com/CumulativeSum.html, Cumulative Sum).
Params:
fun = one or more functions to use as fold operation
Returns:
The function returns a range containing the consecutive reduced values. If
there is more than one `fun`, the element type will be $(REF Tuple,
std,typecons) containing one element for each `fun`.
See_Also:
$(HTTP en.wikipedia.org/wiki/Prefix_sum, Prefix Sum)
Note:
In functional programming languages this is typically called `scan`, `scanl`,
`scanLeft` or `reductions`.
+/
template cumulativeFold(fun...)
if (fun.length >= 1)
{
import std.meta : staticMap;
private alias binfuns = staticMap!(binaryFun, fun);
/++
No-seed version. The first element of `r` is used as the seed's value.
For each function `f` in `fun`, the corresponding seed type `S` is
`Unqual!(typeof(f(e, e)))`, where `e` is an element of `r`:
`ElementType!R`.
Once `S` has been determined, then `S s = e;` and `s = f(s, e);` must
both be legal.
Params:
range = An $(REF_ALTTEXT input range, isInputRange, std,range,primitives)
Returns:
a range containing the consecutive reduced values.
+/
auto cumulativeFold(R)(R range)
if (isInputRange!(Unqual!R))
{
return cumulativeFoldImpl(range);
}
/++
Seed version. The seed should be a single value if `fun` is a single
function. If `fun` is multiple functions, then `seed` should be a
$(REF Tuple, std,typecons), with one field per function in `f`.
For convenience, if the seed is `const`, or has qualified fields, then
`cumulativeFold` will operate on an unqualified copy. If this happens
then the returned type will not perfectly match `S`.
Params:
range = An $(REF_ALTTEXT input range, isInputRange, std,range,primitives)
seed = the initial value of the accumulator
Returns:
a range containing the consecutive reduced values.
+/
auto cumulativeFold(R, S)(R range, S seed)
if (isInputRange!(Unqual!R))
{
static if (fun.length == 1)
return cumulativeFoldImpl(range, seed);
else
return cumulativeFoldImpl(range, seed.expand);
}
private auto cumulativeFoldImpl(R, Args...)(R range, ref Args args)
{
import std.algorithm.internal : algoFormat;
static assert(Args.length == 0 || Args.length == fun.length,
algoFormat("Seed %s does not have the correct amount of fields (should be %s)",
Args.stringof, fun.length));
static if (args.length)
alias State = staticMap!(Unqual, Args);
else
alias State = staticMap!(ReduceSeedType!(ElementType!R), binfuns);
foreach (i, f; binfuns)
{
static assert(!__traits(compiles, f(args[i], e)) || __traits(compiles,
{ args[i] = f(args[i], e); }()),
algoFormat("Incompatible function/seed/element: %s/%s/%s",
fullyQualifiedName!f, Args[i].stringof, E.stringof));
}
static struct Result
{
private:
R source;
State state;
this(R range, ref Args args)
{
source = range;
if (source.empty)
return;
foreach (i, f; binfuns)
{
static if (args.length)
state[i] = f(args[i], source.front);
else
state[i] = source.front;
}
}
public:
@property bool empty()
{
return source.empty;
}
@property auto front()
{
assert(!empty, "Attempting to fetch the front of an empty cumulativeFold.");
static if (fun.length > 1)
{
import std.typecons : tuple;
return tuple(state);
}
else
{
return state[0];
}
}
void popFront()
{
assert(!empty, "Attempting to popFront an empty cumulativeFold.");
source.popFront;
if (source.empty)
return;
foreach (i, f; binfuns)
state[i] = f(state[i], source.front);
}
static if (isForwardRange!R)
{
@property auto save()
{
auto result = this;
result.source = source.save;
return result;
}
}
static if (hasLength!R)
{
@property size_t length()
{
return source.length;
}
}
}
return Result(range, args);
}
}
///
@safe unittest
{
import std.algorithm.comparison : max, min;
import std.array : array;
import std.math : approxEqual;
import std.range : chain;
int[] arr = [1, 2, 3, 4, 5];
// Partial sum of all elements
auto sum = cumulativeFold!((a, b) => a + b)(arr, 0);
assert(sum.array == [1, 3, 6, 10, 15]);
// Partial sum again, using a string predicate with "a" and "b"
auto sum2 = cumulativeFold!"a + b"(arr, 0);
assert(sum2.array == [1, 3, 6, 10, 15]);
// Compute the partial maximum of all elements
auto largest = cumulativeFold!max(arr);
assert(largest.array == [1, 2, 3, 4, 5]);
// Partial max again, but with Uniform Function Call Syntax (UFCS)
largest = arr.cumulativeFold!max;
assert(largest.array == [1, 2, 3, 4, 5]);
// Partial count of odd elements
auto odds = arr.cumulativeFold!((a, b) => a + (b & 1))(0);
assert(odds.array == [1, 1, 2, 2, 3]);
// Compute the partial sum of squares
auto ssquares = arr.cumulativeFold!((a, b) => a + b * b)(0);
assert(ssquares.array == [1, 5, 14, 30, 55]);
// Chain multiple ranges into seed
int[] a = [3, 4];
int[] b = [100];
auto r = cumulativeFold!"a + b"(chain(a, b));
assert(r.array == [3, 7, 107]);
// Mixing convertible types is fair game, too
double[] c = [2.5, 3.0];
auto r1 = cumulativeFold!"a + b"(chain(a, b, c));
assert(approxEqual(r1, [3, 7, 107, 109.5, 112.5]));
// To minimize nesting of parentheses, Uniform Function Call Syntax can be used
auto r2 = chain(a, b, c).cumulativeFold!"a + b";
assert(approxEqual(r2, [3, 7, 107, 109.5, 112.5]));
}
/**
Sometimes it is very useful to compute multiple aggregates in one pass.
One advantage is that the computation is faster because the looping overhead
is shared. That's why `cumulativeFold` accepts multiple functions.
If two or more functions are passed, `cumulativeFold` returns a $(REF Tuple,
std,typecons) object with one member per passed-in function.
The number of seeds must be correspondingly increased.
*/
@safe unittest
{
import std.algorithm.comparison : max, min;
import std.algorithm.iteration : map;
import std.math : approxEqual;
import std.typecons : tuple;
double[] a = [3.0, 4, 7, 11, 3, 2, 5];
// Compute minimum and maximum in one pass
auto r = a.cumulativeFold!(min, max);
// The type of r is Tuple!(int, int)
assert(approxEqual(r.map!"a[0]", [3, 3, 3, 3, 3, 2, 2])); // minimum
assert(approxEqual(r.map!"a[1]", [3, 4, 7, 11, 11, 11, 11])); // maximum
// Compute sum and sum of squares in one pass
auto r2 = a.cumulativeFold!("a + b", "a + b * b")(tuple(0.0, 0.0));
assert(approxEqual(r2.map!"a[0]", [3, 7, 14, 25, 28, 30, 35])); // sum
assert(approxEqual(r2.map!"a[1]", [9, 25, 74, 195, 204, 208, 233])); // sum of squares
}
@safe unittest
{
import std.algorithm.comparison : equal, max, min;
import std.conv : to;
import std.range : chain;
import std.typecons : tuple;
double[] a = [3, 4];
auto r = a.cumulativeFold!("a + b")(0.0);
assert(r.equal([3, 7]));
auto r2 = cumulativeFold!("a + b")(a);
assert(r2.equal([3, 7]));
auto r3 = cumulativeFold!(min)(a);
assert(r3.equal([3, 3]));
double[] b = [100];
auto r4 = cumulativeFold!("a + b")(chain(a, b));
assert(r4.equal([3, 7, 107]));
// two funs
auto r5 = cumulativeFold!("a + b", "a - b")(a, tuple(0.0, 0.0));
assert(r5.equal([tuple(3, -3), tuple(7, -7)]));
auto r6 = cumulativeFold!("a + b", "a - b")(a);
assert(r6.equal([tuple(3, 3), tuple(7, -1)]));
a = [1, 2, 3, 4, 5];
// Stringize with commas
auto rep = cumulativeFold!("a ~ `, ` ~ to!string(b)")(a, "");
assert(rep.map!"a[2 .. $]".equal(["1", "1, 2", "1, 2, 3", "1, 2, 3, 4", "1, 2, 3, 4, 5"]));
// Test for empty range
a = [];
assert(a.cumulativeFold!"a + b".empty);
assert(a.cumulativeFold!"a + b"(2.0).empty);
}
@safe unittest
{
import std.algorithm.comparison : max, min;
import std.array : array;
import std.math : approxEqual;
import std.typecons : tuple;
const float a = 0.0;
const float[] b = [1.2, 3, 3.3];
float[] c = [1.2, 3, 3.3];
auto r = cumulativeFold!"a + b"(b, a);
assert(approxEqual(r, [1.2, 4.2, 7.5]));
auto r2 = cumulativeFold!"a + b"(c, a);
assert(approxEqual(r2, [1.2, 4.2, 7.5]));
const numbers = [10, 30, 20];
enum m = numbers.cumulativeFold!(min).array;
assert(m == [10, 10, 10]);
enum minmax = numbers.cumulativeFold!(min, max).array;
assert(minmax == [tuple(10, 10), tuple(10, 30), tuple(10, 30)]);
}
@safe unittest
{
import std.math : approxEqual;
import std.typecons : tuple;
enum foo = "a + 0.5 * b";
auto r = [0, 1, 2, 3];
auto r1 = r.cumulativeFold!foo;
auto r2 = r.cumulativeFold!(foo, foo);
assert(approxEqual(r1, [0, 0.5, 1.5, 3]));
assert(approxEqual(r2.map!"a[0]", [0, 0.5, 1.5, 3]));
assert(approxEqual(r2.map!"a[1]", [0, 0.5, 1.5, 3]));
}
@safe unittest
{
import std.algorithm.comparison : equal, max, min;
import std.array : array;
import std.typecons : tuple;
//Seed is tuple of const.
static auto minmaxElement(alias F = min, alias G = max, R)(in R range)
@safe pure nothrow
if (isInputRange!R)
{
return range.cumulativeFold!(F, G)(tuple(ElementType!R.max, ElementType!R.min));
}
assert(minmaxElement([1, 2, 3]).equal([tuple(1, 1), tuple(1, 2), tuple(1, 3)]));
}
@safe unittest //12569
{
import std.algorithm.comparison : equal, max, min;
import std.typecons : tuple;
dchar c = 'a';
assert(cumulativeFold!(min, max)("hello", tuple(c, c)).equal([tuple('a', 'h'),
tuple('a', 'h'), tuple('a', 'l'), tuple('a', 'l'), tuple('a', 'o')]));
static assert(!__traits(compiles, cumulativeFold!(min, max)("hello", tuple(c))));
static assert(!__traits(compiles, cumulativeFold!(min, max)("hello", tuple(c, c, c))));
//"Seed dchar should be a Tuple"
static assert(!__traits(compiles, cumulativeFold!(min, max)("hello", c)));
//"Seed (dchar) does not have the correct amount of fields (should be 2)"
static assert(!__traits(compiles, cumulativeFold!(min, max)("hello", tuple(c))));
//"Seed (dchar, dchar, dchar) does not have the correct amount of fields (should be 2)"
static assert(!__traits(compiles, cumulativeFold!(min, max)("hello", tuple(c, c, c))));
//"Incompatable function/seed/element: all(alias pred = "a")/int/dchar"
static assert(!__traits(compiles, cumulativeFold!all("hello", 1)));
static assert(!__traits(compiles, cumulativeFold!(all, all)("hello", tuple(1, 1))));
}
@safe unittest //13304
{
int[] data;
assert(data.cumulativeFold!((a, b) => a + b).empty);
}
@safe unittest
{
import std.algorithm.comparison : equal;
import std.internal.test.dummyrange : AllDummyRanges, propagatesLength,
propagatesRangeType, RangeType;
foreach (DummyType; AllDummyRanges)
{
DummyType d;
auto m = d.cumulativeFold!"a * b";
static assert(propagatesLength!(typeof(m), DummyType));
static if (DummyType.rt <= RangeType.Forward)
static assert(propagatesRangeType!(typeof(m), DummyType));
assert(m.equal([1, 2, 6, 24, 120, 720, 5040, 40_320, 362_880, 3_628_800]));
}
}
// splitter
/**
Lazily splits a range using an element as a separator. This can be used with
any narrow string type or sliceable range type, but is most popular with string
types.
Two adjacent separators are considered to surround an empty element in
the split range. Use `filter!(a => !a.empty)` on the result to compress
empty elements.
The predicate is passed to $(REF binaryFun, std,functional), and can either accept
a string, or any callable that can be executed via `pred(element, s)`.
If the empty range is given, the result is an empty range. If a range with
one separator is given, the result is a range with two empty elements.
If splitting a string on whitespace and token compression is desired,
consider using `splitter` without specifying a separator (see fourth overload
below).
Params:
pred = The predicate for comparing each element with the separator,
defaulting to `"a == b"`.
r = The $(REF_ALTTEXT input range, isInputRange, std,range,primitives) to be
split. Must support slicing and `.length`.
s = The element to be treated as the separator between range segments to be
split.
Constraints:
The predicate `pred` needs to accept an element of `r` and the
separator `s`.
Returns:
An input range of the subranges of elements between separators. If `r`
is a $(REF_ALTTEXT forward range, isForwardRange, std,range,primitives)
or $(REF_ALTTEXT bidirectional range, isBidirectionalRange, std,range,primitives),
the returned range will be likewise.
See_Also:
$(REF _splitter, std,regex) for a version that splits using a regular
expression defined separator.
*/
auto splitter(alias pred = "a == b", Range, Separator)(Range r, Separator s)
if (is(typeof(binaryFun!pred(r.front, s)) : bool)
&& ((hasSlicing!Range && hasLength!Range) || isNarrowString!Range))
{
import std.algorithm.searching : find;
import std.conv : unsigned;
static struct Result
{
private:
Range _input;
Separator _separator;
// Do we need hasLength!Range? popFront uses _input.length...
enum size_t _unComputed = size_t.max - 1, _atEnd = size_t.max;
size_t _frontLength = _unComputed;
size_t _backLength = _unComputed;
static if (isNarrowString!Range)
{
size_t _separatorLength;
}
else
{
enum _separatorLength = 1;
}
static if (isBidirectionalRange!Range)
{
static size_t lastIndexOf(Range haystack, Separator needle)
{
import std.range : retro;
auto r = haystack.retro().find!pred(needle);
return r.retro().length - 1;
}
}
public:
this(Range input, Separator separator)
{
_input = input;
_separator = separator;
static if (isNarrowString!Range)
{
import std.utf : codeLength;
_separatorLength = codeLength!(ElementEncodingType!Range)(separator);
}
if (_input.empty)
_frontLength = _atEnd;
}
static if (isInfinite!Range)
{
enum bool empty = false;
}
else
{
@property bool empty()
{
return _frontLength == _atEnd;
}
}
@property Range front()
{
assert(!empty, "Attempting to fetch the front of an empty splitter.");
if (_frontLength == _unComputed)
{
auto r = _input.find!pred(_separator);
_frontLength = _input.length - r.length;
}
return _input[0 .. _frontLength];
}
void popFront()
{
assert(!empty, "Attempting to popFront an empty splitter.");
if (_frontLength == _unComputed)
{
front;
}
assert(_frontLength <= _input.length);
if (_frontLength == _input.length)
{
// no more input and need to fetch => done
_frontLength = _atEnd;
// Probably don't need this, but just for consistency:
_backLength = _atEnd;
}
else
{
_input = _input[_frontLength + _separatorLength .. _input.length];
_frontLength = _unComputed;
}
}
static if (isForwardRange!Range)
{
@property typeof(this) save()
{
auto ret = this;
ret._input = _input.save;
return ret;
}
}
static if (isBidirectionalRange!Range)
{
@property Range back()
{
assert(!empty, "Attempting to fetch the back of an empty splitter.");
if (_backLength == _unComputed)
{
immutable lastIndex = lastIndexOf(_input, _separator);
if (lastIndex == -1)
{
_backLength = _input.length;
}
else
{
_backLength = _input.length - lastIndex - 1;
}
}
return _input[_input.length - _backLength .. _input.length];
}
void popBack()
{
assert(!empty, "Attempting to popBack an empty splitter.");
if (_backLength == _unComputed)
{
// evaluate back to make sure it's computed
back;
}
assert(_backLength <= _input.length);
if (_backLength == _input.length)
{
// no more input and need to fetch => done
_frontLength = _atEnd;
_backLength = _atEnd;
}
else
{
_input = _input[0 .. _input.length - _backLength - _separatorLength];
_backLength = _unComputed;
}
}
}
}
return Result(r, s);
}
///
@safe unittest
{
import std.algorithm.comparison : equal;
import std.ascii : toLower;
import std.range : empty, retro;
// Basic splitting with characters and numbers.
assert(equal(splitter("a|bc|def", '|'), [ "a", "bc", "def" ]));
int[] a = [1, 0, 2, 3, 0, 4, 5, 6];
int[][] w = [ [1], [2, 3], [4, 5, 6] ];
assert(equal(splitter(a, 0), w));
// Adjacent separators.
assert(equal(splitter("a|b||c", '|'), [ "a", "b", "", "c" ]));
assert(equal(splitter("hello world", ' '), [ "hello", "", "world" ]));
a = [ 1, 2, 0, 0, 3, 0, 4, 5, 0 ];
w = [ [1, 2], [], [3], [4, 5], [] ];
assert(equal(splitter(a, 0), w));
// Empty and separator-only ranges.
assert(splitter("", '|').empty);
assert(equal(splitter("|", '|'), [ "", "" ]));
assert(equal(splitter("||", '|'), [ "", "", "" ]));
// Leading separators, trailing separators, or no separators.
assert(equal(splitter("|ab|", '|'), [ "", "ab", "" ]));
assert(equal(splitter("ab", '|'), [ "ab" ]));
// Predicate functions.
assert(equal(splitter!"a.toLower == b"("abXcdxef", 'x'),
[ "ab", "cd", "ef" ]));
w = [ [0], [1], [2] ];
assert(equal(splitter!"a.front == b"(w, 1), [ [[0]], [[2]] ]));
// Bidirectional ranges.
assert(equal(splitter("a|bc|def", '|').retro, [ "def", "bc", "a" ]));
}
@safe unittest
{
import std.algorithm;
import std.array : array;
import std.internal.test.dummyrange;
import std.range : retro;
assert(equal(splitter("hello world", ' '), [ "hello", "", "world" ]));
assert(equal(splitter("žlutoučkýřkůň", 'ř'), [ "žlutoučký", "kůň" ]));
int[] a = [ 1, 2, 0, 0, 3, 0, 4, 5, 0 ];
int[][] w = [ [1, 2], [], [3], [4, 5], [] ];
static assert(isForwardRange!(typeof(splitter(a, 0))));
assert(equal(splitter(a, 0), w));
a = null;
assert(equal(splitter(a, 0), (int[][]).init));
a = [ 0 ];
assert(equal(splitter(a, 0), [ (int[]).init, (int[]).init ][]));
a = [ 0, 1 ];
assert(equal(splitter(a, 0), [ [], [1] ]));
assert(equal(splitter(a, 0), [ [], [1] ][]));
// Thoroughly exercise the bidirectional stuff.
auto str = "abc abcd abcde ab abcdefg abcdefghij ab ac ar an at ada";
assert(equal(
retro(splitter(str, 'a')),
retro(array(splitter(str, 'a')))
));
// Test interleaving front and back.
auto split = splitter(str, 'a');
assert(split.front == "");
assert(split.back == "");
split.popBack();
assert(split.back == "d");
split.popFront();
assert(split.front == "bc ");
assert(split.back == "d");
split.popFront();
split.popBack();
assert(split.back == "t ");
split.popBack();
split.popBack();
split.popFront();
split.popFront();
assert(split.front == "b ");
assert(split.back == "r ");
foreach (DummyType; AllDummyRanges) { // Bug 4408
static if (isRandomAccessRange!DummyType)
{
static assert(isBidirectionalRange!DummyType);
DummyType d;
auto s = splitter(d, 5);
assert(equal(s.front, [1,2,3,4]));
assert(equal(s.back, [6,7,8,9,10]));
auto s2 = splitter(d, [4, 5]);
assert(equal(s2.front, [1,2,3]));
}
}
}
@safe unittest
{
import std.algorithm;
import std.range;
auto L = retro(iota(1L, 10L));
auto s = splitter(L, 5L);
assert(equal(s.front, [9L, 8L, 7L, 6L]));
s.popFront();
assert(equal(s.front, [4L, 3L, 2L, 1L]));
s.popFront();
assert(s.empty);
}
/**
Similar to the previous overload of `splitter`, except this one uses another
range as a separator. This can be used with any narrow string type or sliceable
range type, but is most popular with string types. The predicate is passed to
$(REF binaryFun, std,functional), and can either accept a string, or any callable
that can be executed via `pred(r.front, s.front)`.
Two adjacent separators are considered to surround an empty element in
the split range. Use `filter!(a => !a.empty)` on the result to compress
empty elements.
Unlike the previous overload of `splitter`, this one will not return a
bidirectional range.
Params:
pred = The predicate for comparing each element with the separator,
defaulting to `"a == b"`.
r = The $(REF_ALTTEXT input range, isInputRange, std,range,primitives) to be
split.
s = The $(REF_ALTTEXT forward range, isForwardRange, std,range,primitives) to
be treated as the separator between segments of `r` to be split.
Constraints:
The predicate `pred` needs to accept an element of `r` and an
element of `s`.
Returns:
An input range of the subranges of elements between separators. If `r`
is a forward range, the returned range will be a forward range.
See_Also: $(REF _splitter, std,regex) for a version that splits using a regular
expression defined separator.
*/
auto splitter(alias pred = "a == b", Range, Separator)(Range r, Separator s)
if (is(typeof(binaryFun!pred(r.front, s.front)) : bool)
&& (hasSlicing!Range || isNarrowString!Range)
&& isForwardRange!Separator
&& (hasLength!Separator || isNarrowString!Separator))
{
import std.algorithm.searching : find;
import std.conv : unsigned;
static struct Result
{
private:
Range _input;
Separator _separator;
// _frontLength == size_t.max means empty
size_t _frontLength = size_t.max;
@property auto separatorLength() { return _separator.length; }
void ensureFrontLength()
{
if (_frontLength != _frontLength.max) return;
assert(!_input.empty);
// compute front length
_frontLength = (_separator.empty) ? 1 :
_input.length - find!pred(_input, _separator).length;
}
public:
this(Range input, Separator separator)
{
_input = input;
_separator = separator;
}
@property Range front()
{
assert(!empty, "Attempting to fetch the front of an empty splitter.");
ensureFrontLength();
return _input[0 .. _frontLength];
}
static if (isInfinite!Range)
{
enum bool empty = false; // Propagate infiniteness
}
else
{
@property bool empty()
{
return _frontLength == size_t.max && _input.empty;
}
}
void popFront()
{
assert(!empty, "Attempting to popFront an empty splitter.");
ensureFrontLength();
if (_frontLength == _input.length)
{
// done, there's no separator in sight
_input = _input[_frontLength .. _frontLength];
_frontLength = _frontLength.max;
return;
}
if (_frontLength + separatorLength == _input.length)
{
// Special case: popping the first-to-last item; there is
// an empty item right after this.
_input = _input[_input.length .. _input.length];
_frontLength = 0;
return;
}
// Normal case, pop one item and the separator, get ready for
// reading the next item
_input = _input[_frontLength + separatorLength .. _input.length];
// mark _frontLength as uninitialized
_frontLength = _frontLength.max;
}
static if (isForwardRange!Range)
{
@property typeof(this) save()
{
auto ret = this;
ret._input = _input.save;
return ret;
}
}
}
return Result(r, s);
}
///
@safe unittest
{
import std.algorithm.comparison : equal;
assert(equal(splitter("a=>bc=>def", "=>"), [ "a", "bc", "def" ]));
assert(equal(splitter("a|b||c", "||"), [ "a|b", "c" ]));
assert(equal(splitter("hello world", " "), [ "hello", "world" ]));
int[] a = [ 1, 2, 0, 0, 3, 0, 4, 5, 0 ];
int[][] w = [ [1, 2], [3, 0, 4, 5, 0] ];
assert(equal(splitter(a, [0, 0]), w));
a = [ 0, 0 ];
assert(equal(splitter(a, [0, 0]), [ (int[]).init, (int[]).init ]));
a = [ 0, 0, 1 ];
assert(equal(splitter(a, [0, 0]), [ [], [1] ]));
}
@safe unittest
{
import std.algorithm.comparison : equal;
import std.typecons : Tuple;
alias C = Tuple!(int, "x", int, "y");
auto a = [C(1,0), C(2,0), C(3,1), C(4,0)];
assert(equal(splitter!"a.x == b"(a, [2, 3]), [ [C(1,0)], [C(4,0)] ]));
}
@safe unittest
{
import std.algorithm.comparison : equal;
import std.array : split;
import std.conv : text;
auto s = ",abc, de, fg,hi,";
auto sp0 = splitter(s, ',');
assert(equal(sp0, ["", "abc", " de", " fg", "hi", ""][]));
auto s1 = ", abc, de, fg, hi, ";
auto sp1 = splitter(s1, ", ");
assert(equal(sp1, ["", "abc", "de", " fg", "hi", ""][]));
static assert(isForwardRange!(typeof(sp1)));
int[] a = [ 1, 2, 0, 3, 0, 4, 5, 0 ];
int[][] w = [ [1, 2], [3], [4, 5], [] ];
uint i;
foreach (e; splitter(a, 0))
{
assert(i < w.length);
assert(e == w[i++]);
}
assert(i == w.length);
wstring names = ",peter,paul,jerry,";
auto words = split(names, ",");
assert(walkLength(words) == 5, text(walkLength(words)));
}
@safe unittest
{
int[][] a = [ [1], [2], [0], [3], [0], [4], [5], [0] ];
int[][][] w = [ [[1], [2]], [[3]], [[4], [5]], [] ];
uint i;
foreach (e; splitter!"a.front == 0"(a, 0))
{
assert(i < w.length);
assert(e == w[i++]);
}
assert(i == w.length);
}
@safe unittest
{
import std.algorithm.comparison : equal;
auto s6 = ",";
auto sp6 = splitter(s6, ',');
foreach (e; sp6) {}
assert(equal(sp6, ["", ""][]));
}
@safe unittest
{
import std.algorithm.comparison : equal;
// Issue 10773
auto s = splitter("abc", "");
assert(s.equal(["a", "b", "c"]));
}
@safe unittest
{
import std.algorithm.comparison : equal;
// Test by-reference separator
class RefSep {
@safe:
string _impl;
this(string s) { _impl = s; }
@property empty() { return _impl.empty; }
@property auto front() { return _impl.front; }
void popFront() { _impl = _impl[1..$]; }
@property RefSep save() { return new RefSep(_impl); }
@property auto length() { return _impl.length; }
}
auto sep = new RefSep("->");
auto data = "i->am->pointing";
auto words = splitter(data, sep);
assert(words.equal([ "i", "am", "pointing" ]));
}
/**
Similar to the previous overload of `splitter`, except this one does not use a separator.
Instead, the predicate is an unary function on the input range's element type.
The `isTerminator` predicate is passed to $(REF unaryFun, std,functional) and can
either accept a string, or any callable that can be executed via `pred(element, s)`.
Two adjacent separators are considered to surround an empty element in
the split range. Use `filter!(a => !a.empty)` on the result to compress
empty elements.
Params:
isTerminator = The predicate for deciding where to split the range.
input = The $(REF_ALTTEXT input range, isInputRange, std,range,primitives) to
be split.
Constraints:
The predicate `isTerminator` needs to accept an element of `input`.
Returns:
An input range of the subranges of elements between separators. If `input`
is a forward range or $(REF_ALTTEXT bidirectional range, isBidirectionalRange, std,range,primitives),
the returned range will be likewise.
See_Also: $(REF _splitter, std,regex) for a version that splits using a regular
expression defined separator.
*/
auto splitter(alias isTerminator, Range)(Range input)
if (isForwardRange!Range && is(typeof(unaryFun!isTerminator(input.front))))
{
return SplitterResult!(unaryFun!isTerminator, Range)(input);
}
///
@safe unittest
{
import std.algorithm.comparison : equal;
import std.range.primitives : front;
assert(equal(splitter!(a => a == '|')("a|bc|def"), [ "a", "bc", "def" ]));
assert(equal(splitter!(a => a == ' ')("hello world"), [ "hello", "", "world" ]));
int[] a = [ 1, 2, 0, 0, 3, 0, 4, 5, 0 ];
int[][] w = [ [1, 2], [], [3], [4, 5], [] ];
assert(equal(splitter!(a => a == 0)(a), w));
a = [ 0 ];
assert(equal(splitter!(a => a == 0)(a), [ (int[]).init, (int[]).init ]));
a = [ 0, 1 ];
assert(equal(splitter!(a => a == 0)(a), [ [], [1] ]));
w = [ [0], [1], [2] ];
assert(equal(splitter!(a => a.front == 1)(w), [ [[0]], [[2]] ]));
}
private struct SplitterResult(alias isTerminator, Range)
{
import std.algorithm.searching : find;
enum fullSlicing = (hasLength!Range && hasSlicing!Range) || isSomeString!Range;
private Range _input;
private size_t _end = 0;
static if (!fullSlicing)
private Range _next;
private void findTerminator()
{
static if (fullSlicing)
{
auto r = find!isTerminator(_input.save);
_end = _input.length - r.length;
}
else
for ( _end = 0; !_next.empty ; _next.popFront)
{
if (isTerminator(_next.front))
break;
++_end;
}
}
this(Range input)
{
_input = input;
static if (!fullSlicing)
_next = _input.save;
if (!_input.empty)
findTerminator();
else
_end = size_t.max;
}
static if (isInfinite!Range)
{
enum bool empty = false; // Propagate infiniteness.
}
else
{
@property bool empty()
{
return _end == size_t.max;
}
}
@property auto front()
{
version(assert)
{
import core.exception : RangeError;
if (empty)
throw new RangeError();
}
static if (fullSlicing)
return _input[0 .. _end];
else
{
import std.range : takeExactly;
return _input.takeExactly(_end);
}
}
void popFront()
{
version(assert)
{
import core.exception : RangeError;
if (empty)
throw new RangeError();
}
static if (fullSlicing)
{
_input = _input[_end .. _input.length];
if (_input.empty)
{
_end = size_t.max;
return;
}
_input.popFront();
}
else
{
if (_next.empty)
{
_input = _next;
_end = size_t.max;
return;
}
_next.popFront();
_input = _next.save;
}
findTerminator();
}
@property typeof(this) save()
{
auto ret = this;
ret._input = _input.save;
static if (!fullSlicing)
ret._next = _next.save;
return ret;
}
}
@safe unittest
{
import std.algorithm.comparison : equal;
import std.range : iota;
auto L = iota(1L, 10L);
auto s = splitter(L, [5L, 6L]);
assert(equal(s.front, [1L, 2L, 3L, 4L]));
s.popFront();
assert(equal(s.front, [7L, 8L, 9L]));
s.popFront();
assert(s.empty);
}
@safe unittest
{
import std.algorithm.comparison : equal;
import std.algorithm.internal : algoFormat;
import std.internal.test.dummyrange;
void compare(string sentence, string[] witness)
{
auto r = splitter!"a == ' '"(sentence);
assert(equal(r.save, witness), algoFormat("got: %(%s, %) expected: %(%s, %)", r, witness));
}
compare(" Mary has a little lamb. ",
["", "Mary", "", "has", "a", "little", "lamb.", "", "", ""]);
compare("Mary has a little lamb. ",
["Mary", "", "has", "a", "little", "lamb.", "", "", ""]);
compare("Mary has a little lamb.",
["Mary", "", "has", "a", "little", "lamb."]);
compare("", (string[]).init);
compare(" ", ["", ""]);
static assert(isForwardRange!(typeof(splitter!"a == ' '"("ABC"))));
foreach (DummyType; AllDummyRanges)
{
static if (isRandomAccessRange!DummyType)
{
auto rangeSplit = splitter!"a == 5"(DummyType.init);
assert(equal(rangeSplit.front, [1,2,3,4]));
rangeSplit.popFront();
assert(equal(rangeSplit.front, [6,7,8,9,10]));
}
}
}
@safe unittest
{
import std.algorithm.comparison : equal;
import std.algorithm.internal : algoFormat;
import std.range;
struct Entry
{
int low;
int high;
int[][] result;
}
Entry[] entries = [
Entry(0, 0, []),
Entry(0, 1, [[0]]),
Entry(1, 2, [[], []]),
Entry(2, 7, [[2], [4], [6]]),
Entry(1, 8, [[], [2], [4], [6], []]),
];
foreach ( entry ; entries )
{
auto a = iota(entry.low, entry.high).filter!"true"();
auto b = splitter!"a%2"(a);
assert(equal!equal(b.save, entry.result), algoFormat("got: %(%s, %) expected: %(%s, %)", b, entry.result));
}
}
@safe unittest
{
import std.algorithm.comparison : equal;
import std.uni : isWhite;
//@@@6791@@@
assert(equal(
splitter("là dove terminava quella valle"),
["là", "dove", "terminava", "quella", "valle"]
));
assert(equal(
splitter!(std.uni.isWhite)("là dove terminava quella valle"),
["là", "dove", "terminava", "quella", "valle"]
));
assert(equal(splitter!"a=='本'"("日本語"), ["日", "語"]));
}
/++
Lazily splits the string `s` into words, using whitespace as the delimiter.
This function is string specific and, contrary to
`splitter!(std.uni.isWhite)`, runs of whitespace will be merged together
(no empty tokens will be produced).
Params:
s = The string to be split.
Returns:
An $(REF_ALTTEXT input range, isInputRange, std,range,primitives) of slices of
the original string split by whitespace.
+/
auto splitter(C)(C[] s)
if (isSomeChar!C)
{
import std.algorithm.searching : find;
static struct Result
{
private:
import core.exception : RangeError;
C[] _s;
size_t _frontLength;
void getFirst() pure @safe
{
import std.uni : isWhite;
auto r = find!(isWhite)(_s);
_frontLength = _s.length - r.length;
}
public:
this(C[] s) pure @safe
{
import std.string : strip;
_s = s.strip();
getFirst();
}
@property C[] front() pure @safe
{
version(assert) if (empty) throw new RangeError();
return _s[0 .. _frontLength];
}
void popFront() pure @safe
{
import std.string : stripLeft;
version(assert) if (empty) throw new RangeError();
_s = _s[_frontLength .. $].stripLeft();
getFirst();
}
@property bool empty() const @safe pure nothrow
{
return _s.empty;
}
@property inout(Result) save() inout @safe pure nothrow
{
return this;
}
}
return Result(s);
}
///
@safe pure unittest
{
import std.algorithm.comparison : equal;
auto a = " a bcd ef gh ";
assert(equal(splitter(a), ["a", "bcd", "ef", "gh"][]));
}
@safe pure unittest
{
import std.algorithm.comparison : equal;
import std.meta : AliasSeq;
static foreach (S; AliasSeq!(string, wstring, dstring))
{{
import std.conv : to;
S a = " a bcd ef gh ";
assert(equal(splitter(a), [to!S("a"), to!S("bcd"), to!S("ef"), to!S("gh")]));
a = "";
assert(splitter(a).empty);
}}
immutable string s = " a bcd ef gh ";
assert(equal(splitter(s), ["a", "bcd", "ef", "gh"][]));
}
@safe unittest
{
import std.conv : to;
import std.string : strip;
// TDPL example, page 8
uint[string] dictionary;
char[][3] lines;
lines[0] = "line one".dup;
lines[1] = "line \ttwo".dup;
lines[2] = "yah last line\ryah".dup;
foreach (line; lines)
{
foreach (word; splitter(strip(line)))
{
if (word in dictionary) continue; // Nothing to do
auto newID = dictionary.length;
dictionary[to!string(word)] = cast(uint) newID;
}
}
assert(dictionary.length == 5);
assert(dictionary["line"]== 0);
assert(dictionary["one"]== 1);
assert(dictionary["two"]== 2);
assert(dictionary["yah"]== 3);
assert(dictionary["last"]== 4);
}
@safe unittest
{
import std.algorithm.comparison : equal;
import std.algorithm.internal : algoFormat;
import std.array : split;
import std.conv : text;
// Check consistency:
// All flavors of split should produce the same results
foreach (input; [(int[]).init,
[0],
[0, 1, 0],
[1, 1, 0, 0, 1, 1],
])
{
foreach (s; [0, 1])
{
auto result = split(input, s);
assert(equal(result, split(input, [s])), algoFormat(`"[%(%s,%)]"`, split(input, [s])));
//assert(equal(result, split(input, [s].filter!"true"()))); //Not yet implemented
assert(equal(result, split!((a) => a == s)(input)), text(split!((a) => a == s)(input)));
//assert(equal!equal(result, split(input.filter!"true"(), s))); //Not yet implemented
//assert(equal!equal(result, split(input.filter!"true"(), [s]))); //Not yet implemented
//assert(equal!equal(result, split(input.filter!"true"(), [s].filter!"true"()))); //Not yet implemented
assert(equal!equal(result, split!((a) => a == s)(input.filter!"true"())));
assert(equal(result, splitter(input, s)));
assert(equal(result, splitter(input, [s])));
//assert(equal(result, splitter(input, [s].filter!"true"()))); //Not yet implemented
assert(equal(result, splitter!((a) => a == s)(input)));
//assert(equal!equal(result, splitter(input.filter!"true"(), s))); //Not yet implemented
//assert(equal!equal(result, splitter(input.filter!"true"(), [s]))); //Not yet implemented
//assert(equal!equal(result, splitter(input.filter!"true"(), [s].filter!"true"()))); //Not yet implemented
assert(equal!equal(result, splitter!((a) => a == s)(input.filter!"true"())));
}
}
foreach (input; [string.init,
" ",
" hello ",
"hello hello",
" hello what heck this ? "
])
{
foreach (s; [' ', 'h'])
{
auto result = split(input, s);
assert(equal(result, split(input, [s])));
//assert(equal(result, split(input, [s].filter!"true"()))); //Not yet implemented
assert(equal(result, split!((a) => a == s)(input)));
//assert(equal!equal(result, split(input.filter!"true"(), s))); //Not yet implemented
//assert(equal!equal(result, split(input.filter!"true"(), [s]))); //Not yet implemented
//assert(equal!equal(result, split(input.filter!"true"(), [s].filter!"true"()))); //Not yet implemented
assert(equal!equal(result, split!((a) => a == s)(input.filter!"true"())));
assert(equal(result, splitter(input, s)));
assert(equal(result, splitter(input, [s])));
//assert(equal(result, splitter(input, [s].filter!"true"()))); //Not yet implemented
assert(equal(result, splitter!((a) => a == s)(input)));
//assert(equal!equal(result, splitter(input.filter!"true"(), s))); //Not yet implemented
//assert(equal!equal(result, splitter(input.filter!"true"(), [s]))); //Not yet implemented
//assert(equal!equal(result, splitter(input.filter!"true"(), [s].filter!"true"()))); //Not yet implemented
assert(equal!equal(result, splitter!((a) => a == s)(input.filter!"true"())));
}
}
}
// In same combinations substitute needs to calculate the auto-decoded length
// of its needles
private template hasDifferentAutodecoding(Range, Needles...)
{
import std.meta : anySatisfy;
/* iff
- the needles needs auto-decoding, but the incoming range doesn't (or vice versa)
- both (range, needle) need auto-decoding and don't share the same common type
*/
enum needlesAreNarrow = anySatisfy!(isNarrowString, Needles);
enum sourceIsNarrow = isNarrowString!Range;
enum hasDifferentAutodecoding = sourceIsNarrow != needlesAreNarrow ||
(sourceIsNarrow && needlesAreNarrow &&
is(CommonType!(Range, Needles) == void));
}
@safe nothrow @nogc pure unittest
{
import std.meta : AliasSeq; // used for better clarity
static assert(!hasDifferentAutodecoding!(string, AliasSeq!(string, string)));
static assert(!hasDifferentAutodecoding!(wstring, AliasSeq!(wstring, wstring)));
static assert(!hasDifferentAutodecoding!(dstring, AliasSeq!(dstring, dstring)));
// the needles needs auto-decoding, but the incoming range doesn't (or vice versa)
static assert(hasDifferentAutodecoding!(string, AliasSeq!(wstring, wstring)));
static assert(hasDifferentAutodecoding!(string, AliasSeq!(dstring, dstring)));
static assert(hasDifferentAutodecoding!(wstring, AliasSeq!(string, string)));
static assert(hasDifferentAutodecoding!(wstring, AliasSeq!(dstring, dstring)));
static assert(hasDifferentAutodecoding!(dstring, AliasSeq!(string, string)));
static assert(hasDifferentAutodecoding!(dstring, AliasSeq!(wstring, wstring)));
// both (range, needle) need auto-decoding and don't share the same common type
static foreach (T; AliasSeq!(string, wstring, dstring))
{
static assert(hasDifferentAutodecoding!(T, AliasSeq!(wstring, string)));
static assert(hasDifferentAutodecoding!(T, AliasSeq!(dstring, string)));
static assert(hasDifferentAutodecoding!(T, AliasSeq!(wstring, dstring)));
}
}
// substitute
/**
Returns a range with all occurrences of `substs` in `r`.
replaced with their substitution.
Single value replacements (`'ö'.substitute!('ä', 'a', 'ö', 'o', 'ü', 'u)`) are
supported as well and in $(BIGOH 1).
Params:
r = an $(REF_ALTTEXT input range, isInputRange, std,range,primitives)
value = a single value which can be substituted in $(BIGOH 1)
substs = a set of replacements/substitutions
Returns: a range with the substitutions replaced.
See_Also:
$(REF replace, std, array) for an eager replace algorithm or
$(REF translate, std, string), and $(REF tr, std, string)
for string algorithms with translation tables.
*/
template substitute(substs...)
if (substs.length >= 2 && isExpressions!substs)
{
import std.range.primitives : ElementType;
import std.traits : CommonType;
static assert(!(substs.length & 1), "The number of substitution parameters must be even");
/**
Substitute single values with compile-time substitution mappings.
Complexity: $(BIGOH 1) due to D's $(D switch) guaranteeing $(BIGOH 1);
*/
auto substitute(Value)(Value value)
if (isInputRange!Value || !is(CommonType!(Value, typeof(substs[0])) == void))
{
static if (isInputRange!Value)
{
static if (!is(CommonType!(ElementType!Value, typeof(substs[0])) == void))
{
// Substitute single range elements with compile-time substitution mappings
return value.map!(a => substitute(a));
}
else static if (isInputRange!Value &&
!is(CommonType!(ElementType!Value, ElementType!(typeof(substs[0]))) == void))
{
// not implemented yet, fallback to runtime variant for now
return .substitute(value, substs);
}
else
{
static assert(0, `Compile-time substitutions must be elements or ranges of the same type of ` ~
Value.stringof ~ `.`);
}
}
// Substitute single values with compile-time substitution mappings.
else // static if (!is(CommonType!(Value, typeof(substs[0])) == void))
{
switch (value)
{
static foreach (i; 0 .. substs.length / 2)
case substs[2 * i]:
return substs[2 * i + 1];
default: return value;
}
}
}
}
/// ditto
auto substitute(alias pred = (a, b) => a == b, R, Substs...)(R r, Substs substs)
if (isInputRange!R && Substs.length >= 2 && !is(CommonType!(Substs) == void))
{
import std.range.primitives : ElementType;
import std.meta : allSatisfy;
import std.traits : CommonType;
static assert(!(Substs.length & 1), "The number of substitution parameters must be even");
enum n = Substs.length / 2;
// Substitute individual elements
static if (!is(CommonType!(ElementType!R, Substs) == void))
{
import std.functional : binaryFun;
// Imitate a value closure to be @nogc
static struct ReplaceElement
{
private Substs substs;
this(Substs substs)
{
this.substs = substs;
}
auto opCall(E)(E e)
{
static foreach (i; 0 .. n)
if (binaryFun!pred(e, substs[2 * i]))
return substs[2 * i + 1];
return e;
}
}
auto er = ReplaceElement(substs);
return r.map!er;
}
// Substitute subranges
else static if (!is(CommonType!(ElementType!R, ElementType!(Substs[0])) == void) &&
allSatisfy!(isForwardRange, Substs))
{
import std.range : choose, take;
import std.meta : Stride;
auto replaceElement(E)(E e)
{
alias ReturnA = typeof(e[0]);
alias ReturnB = typeof(substs[0 .. 1].take(1));
// 1-based index
const auto hitNr = e[1];
switch (hitNr)
{
// no hit
case 0:
// use choose trick for non-common range
static if (is(CommonType!(ReturnA, ReturnB) == void))
return choose(1, e[0], ReturnB.init);
else
return e[0];
// all replacements
static foreach (i; 0 .. n)
case i + 1:
// use choose trick for non-common ranges
static if (is(CommonType!(ReturnA, ReturnB) == void))
return choose(0, e[0], substs[2 * i + 1].take(size_t.max));
else
return substs[2 * i + 1].take(size_t.max);
default:
assert(0, "hitNr should always be found.");
}
}
alias Ins = Stride!(2, Substs);
static struct SubstituteSplitter
{
import std.range : drop;
import std.typecons : Tuple;
private
{
typeof(R.init.drop(0)) rest;
Ins needles;
typeof(R.init.take(0)) skip; // skip before next hit
alias Hit = size_t; // 0 iff no hit, otherwise hit in needles[index-1]
alias E = Tuple!(typeof(skip), Hit);
Hit hitNr; // hit number: 0 means no hit, otherwise index+1 to needles that matched
bool hasHit; // is there a replacement hit which should be printed?
enum hasDifferentAutodecoding = .hasDifferentAutodecoding!(typeof(rest), Ins);
// calculating the needle length for narrow strings might be expensive -> cache it
static if (hasDifferentAutodecoding)
ptrdiff_t[n] needleLengths = -1;
}
this(R haystack, Ins needles)
{
hasHit = !haystack.empty;
this.rest = haystack.drop(0);
this.needles = needles;
popFront;
static if (hasNested!(typeof(skip)))
skip = rest.take(0);
}
/* If `skip` is non-empty, it's returned as (skip, 0) tuple
otherwise a similar (<empty>, hitNr) tuple is returned.
`replaceElement` maps based on the second item (`hitNr`).
*/
@property auto ref front()
{
assert(!empty, "Attempting to fetch the front of an empty substitute.");
return !skip.empty ? E(skip, 0) : E(typeof(skip).init, hitNr);
}
static if (isInfinite!R)
enum empty = false; // propagate infiniteness
else
@property bool empty()
{
return skip.empty && !hasHit;
}
/* If currently in a skipping phase => reset.
Otherwise try to find the next occurrence of `needles`
If valid match
- if there are elements before the match, set skip with these elements
(on the next popFront, the range will be in the skip state once)
- `rest`: advance to the end of the match
- set hasHit
Otherwise skip to the end
*/
void popFront()
{
assert(!empty, "Attempting to popFront an empty substitute.");
if (!skip.empty)
{
skip = typeof(skip).init; // jump over skip
}
else
{
import std.algorithm.searching : countUntil, find;
auto match = rest.find!pred(needles);
static if (needles.length >= 2) // variadic version of find (returns a tuple)
{
// find with variadic needles returns a (range, needleNr) tuple
// needleNr is a 1-based index
auto hitValue = match[0];
hitNr = match[1];
}
else
{
// find with one needle returns the range
auto hitValue = needles[0];
hitNr = match.empty ? 0 : 1;
}
if (hitNr == 0) // no more hits
{
skip = rest.take(size_t.max);
hasHit = false;
rest = typeof(rest).init;
}
else
{
auto hitLength = size_t.max;
switchL: switch (hitNr - 1)
{
static foreach (i; 0 .. n)
{
case i:
static if (hasDifferentAutodecoding)
{
import std.utf : codeLength;
// cache calculated needle length
if (needleLengths[i] != -1)
hitLength = needleLengths[i];
else
hitLength = needleLengths[i] = codeLength!dchar(needles[i]);
}
else
{
hitLength = needles[i].length;
}
break switchL;
}
default:
assert(0, "hitNr should always be found");
}
const pos = rest.countUntil(hitValue);
if (pos > 0) // match not at start of rest
skip = rest.take(pos);
hasHit = true;
// iff the source range and the substitutions are narrow strings,
// we can avoid calling the auto-decoding `popFront` (via drop)
static if (isNarrowString!(typeof(hitValue)) && !hasDifferentAutodecoding)
rest = hitValue[hitLength .. $];
else
rest = hitValue.drop(hitLength);
}
}
}
}
// extract inputs
Ins ins;
static foreach (i; 0 .. n)
ins[i] = substs[2 * i];
return SubstituteSplitter(r, ins)
.map!(a => replaceElement(a))
.joiner;
}
else
{
static assert(0, "The substitutions must either substitute a single element or a save-able subrange.");
}
}
///
@safe pure unittest
{
import std.algorithm.comparison : equal;
// substitute single elements
assert("do_it".substitute('_', ' ').equal("do it"));
// substitute multiple, single elements
assert("do_it".substitute('_', ' ',
'd', 'g',
'i', 't',
't', 'o')
.equal("go to"));
// substitute subranges
assert("do_it".substitute("_", " ",
"do", "done")
.equal("done it"));
// substitution works for any ElementType
int[] x = [1, 2, 3];
auto y = x.substitute(1, 0.1);
assert(y.equal([0.1, 2, 3]));
static assert(is(typeof(y.front) == double));
import std.range : retro;
assert([1, 2, 3].substitute(1, 0.1).retro.equal([3, 2, 0.1]));
}
/// Use the faster compile-time overload
@safe pure unittest
{
import std.algorithm.comparison : equal;
// substitute subranges of a range
assert("apple_tree".substitute!("apple", "banana",
"tree", "shrub").equal("banana_shrub"));
// substitute subranges of a range
assert("apple_tree".substitute!('a', 'b',
't', 'f').equal("bpple_free"));
// substitute values
assert('a'.substitute!('a', 'b', 't', 'f') == 'b');
}
/// Multiple substitutes
@safe pure unittest
{
import std.algorithm.comparison : equal;
import std.range.primitives : ElementType;
int[3] x = [1, 2, 3];
auto y = x[].substitute(1, 0.1)
.substitute(0.1, 0.2);
static assert(is(typeof(y.front) == double));
assert(y.equal([0.2, 2, 3]));
auto z = "42".substitute('2', '3')
.substitute('3', '1');
static assert(is(ElementType!(typeof(z)) == dchar));
assert(equal(z, "41"));
}
// Test the first example with compile-time overloads
@safe pure unittest
{
import std.algorithm.comparison : equal;
// substitute single elements
assert("do_it".substitute!('_', ' ').equal("do it"));
// substitute multiple, single elements
assert("do_it".substitute!('_', ' ',
'd', 'g',
'i', 't',
't', 'o')
.equal(`go to`));
// substitute subranges
assert("do_it".substitute!("_", " ",
"do", "done")
.equal("done it"));
// substitution works for any ElementType
int[3] x = [1, 2, 3];
auto y = x[].substitute!(1, 0.1);
assert(y.equal([0.1, 2, 3]));
static assert(is(typeof(y.front) == double));
import std.range : retro;
assert([1, 2, 3].substitute!(1, 0.1).retro.equal([3, 2, 0.1]));
}
// test infinite ranges
@safe pure nothrow unittest
{
import std.algorithm.comparison : equal;
import std.range : cycle, take;
int[] x = [1, 2, 3];
assert(x.cycle.substitute!(1, 0.1).take(4).equal([0.1, 2, 3, 0.1]));
assert(x.cycle.substitute(1, 0.1).take(4).equal([0.1, 2, 3, 0.1]));
}
// test infinite ranges
@safe pure nothrow unittest
{
import std.algorithm.comparison : equal;
import std.internal.test.dummyrange : AllDummyRanges;
foreach (R; AllDummyRanges)
{
assert(R.init
.substitute!(2, 22, 3, 33, 5, 55, 9, 99)
.equal([1, 22, 33, 4, 55, 6, 7, 8, 99, 10]));
assert(R.init
.substitute(2, 22, 3, 33, 5, 55, 9, 99)
.equal([1, 22, 33, 4, 55, 6, 7, 8, 99, 10]));
}
}
// test multiple replacements
@safe pure unittest
{
import std.algorithm.comparison : equal;
assert("alpha.beta.gamma"
.substitute("alpha", "1",
"gamma", "3",
"beta", "2").equal("1.2.3"));
assert("alpha.beta.gamma."
.substitute("alpha", "1",
"gamma", "3",
"beta", "2").equal("1.2.3."));
assert("beta.beta.beta"
.substitute("alpha", "1",
"gamma", "3",
"beta", "2").equal("2.2.2"));
assert("alpha.alpha.alpha"
.substitute("alpha", "1",
"gamma", "3",
"beta", "2").equal("1.1.1"));
}
// test combination of subrange + element replacement
@safe pure unittest
{
import std.algorithm.comparison : equal;
assert(("abcDe".substitute("a", "AA",
"b", "DD")
.substitute('A', 'y',
'D', 'x',
'e', '1'))
.equal("yyxxcx1"));
}
// test const + immutable storage groups
@safe pure unittest
{
import std.algorithm.comparison : equal;
auto xyz_abc(T)(T value)
{
immutable a = "a";
const b = "b";
auto c = "c";
return value.substitute!("x", a,
"y", b,
"z", c);
}
assert(xyz_abc("_x").equal("_a"));
assert(xyz_abc(".y.").equal(".b."));
assert(xyz_abc("z").equal("c"));
assert(xyz_abc("w").equal("w"));
}
// test with narrow strings (auto-decoding) and subranges
@safe pure unittest
{
import std.algorithm.comparison : equal;
assert("äöü€".substitute("ä", "b", "ü", "u").equal("böu€"));
assert("äöü€".substitute!("ä", "b", "ü", "u").equal("böu€"));
assert("ä...öü€".substitute("ä", "b", "ü", "u").equal("b...öu€"));
auto expected = "emoticons😄😅.😇😈Rock";
assert("emoticons😄😅😆😇😈rock"
.substitute("r", "R", "😆", ".").equal(expected));
assert("emoticons😄😅😆😇😈rock"
.substitute!("r", "R", "😆", ".").equal(expected));
}
// test with narrow strings (auto-decoding) and single elements
@safe pure unittest
{
import std.algorithm.comparison : equal;
assert("äöü€".substitute('ä', 'b', 'ü', 'u').equal("böu€"));
assert("äöü€".substitute!('ä', 'b', 'ü', 'u').equal("böu€"));
auto expected = "emoticons😄😅.😇😈Rock";
assert("emoticons😄😅😆😇😈rock"
.substitute('r', 'R', '😆', '.').equal(expected));
assert("emoticons😄😅😆😇😈rock"
.substitute!('r', 'R', '😆', '.').equal(expected));
}
// test auto-decoding {n,w,d} strings X {n,w,d} strings
@safe pure unittest
{
import std.algorithm.comparison : equal;
assert("ääöü€".substitute("ä", "b", "ü", "u").equal("bböu€"));
assert("ääöü€".substitute("ä"w, "b"w, "ü"w, "u"w).equal("bböu€"));
assert("ääöü€".substitute("ä"d, "b"d, "ü"d, "u"d).equal("bböu€"));
assert("ääöü€"w.substitute("ä", "b", "ü", "u").equal("bböu€"));
assert("ääöü€"w.substitute("ä"w, "b"w, "ü"w, "u"w).equal("bböu€"));
assert("ääöü€"w.substitute("ä"d, "b"d, "ü"d, "u"d).equal("bböu€"));
assert("ääöü€"d.substitute("ä", "b", "ü", "u").equal("bböu€"));
assert("ääöü€"d.substitute("ä"w, "b"w, "ü"w, "u"w).equal("bböu€"));
assert("ääöü€"d.substitute("ä"d, "b"d, "ü"d, "u"d).equal("bböu€"));
// auto-decoding is done before by a different range
assert("ääöü€".filter!(a => true).substitute("ä", "b", "ü", "u").equal("bböu€"));
assert("ääöü€".filter!(a => true).substitute("ä"w, "b"w, "ü"w, "u"w).equal("bböu€"));
assert("ääöü€".filter!(a => true).substitute("ä"d, "b"d, "ü"d, "u"d).equal("bböu€"));
}
// test repeated replacement
@safe pure nothrow unittest
{
import std.algorithm.comparison : equal;
assert([1, 2, 3, 1, 1, 2].substitute(1, 0).equal([0, 2, 3, 0, 0, 2]));
assert([1, 2, 3, 1, 1, 2].substitute!(1, 0).equal([0, 2, 3, 0, 0, 2]));
assert([1, 2, 3, 1, 1, 2].substitute(1, 2, 2, 9).equal([2, 9, 3, 2, 2, 9]));
}
// test @nogc for single element replacements
@safe @nogc unittest
{
import std.algorithm.comparison : equal;
static immutable arr = [1, 2, 3, 1, 1, 2];
static immutable expected = [0, 2, 3, 0, 0, 2];
assert(arr.substitute!(1, 0).equal(expected));
assert(arr.substitute(1, 0).equal(expected));
}
// test different range types
@safe pure nothrow unittest
{
import std.algorithm.comparison : equal;
import std.internal.test.dummyrange : AllDummyRanges;
static foreach (DummyType; AllDummyRanges)
{{
DummyType dummyRange;
// single substitution
dummyRange.substitute (2, 22).equal([1, 22, 3, 4, 5, 6, 7, 8, 9, 10]);
dummyRange.substitute!(2, 22).equal([1, 22, 3, 4, 5, 6, 7, 8, 9, 10]);
// multiple substitution
dummyRange.substitute (2, 22, 5, 55, 7, 77).equal([1, 22, 3, 4, 55, 6, 77, 8, 9, 10]);
dummyRange.substitute!(2, 22, 5, 55, 7, 77).equal([1, 22, 3, 4, 55, 6, 77, 8, 9, 10]);
}}
}
// sum
/**
Sums elements of `r`, which must be a finite
$(REF_ALTTEXT input range, isInputRange, std,range,primitives). Although
conceptually `sum(r)` is equivalent to $(LREF fold)!((a, b) => a +
b)(r, 0), `sum` uses specialized algorithms to maximize accuracy,
as follows.
$(UL
$(LI If `$(REF ElementType, std,range,primitives)!R` is a floating-point
type and `R` is a
$(REF_ALTTEXT random-access range, isRandomAccessRange, std,range,primitives) with
length and slicing, then `sum` uses the
$(HTTP en.wikipedia.org/wiki/Pairwise_summation, pairwise summation)
algorithm.)
$(LI If `ElementType!R` is a floating-point type and `R` is a
finite input range (but not a random-access range with slicing), then
`sum` uses the $(HTTP en.wikipedia.org/wiki/Kahan_summation,
Kahan summation) algorithm.)
$(LI In all other cases, a simple element by element addition is done.)
)
For floating point inputs, calculations are made in
$(DDLINK spec/type, Types, `real`)
precision for `real` inputs and in `double` precision otherwise
(Note this is a special case that deviates from `fold`'s behavior,
which would have kept `float` precision for a `float` range).
For all other types, the calculations are done in the same type obtained
from from adding two elements of the range, which may be a different
type from the elements themselves (for example, in case of
$(DDSUBLINK spec/type,integer-promotions, integral promotion)).
A seed may be passed to `sum`. Not only will this seed be used as an initial
value, but its type will override all the above, and determine the algorithm
and precision used for summation.
Note that these specialized summing algorithms execute more primitive operations
than vanilla summation. Therefore, if in certain cases maximum speed is required
at expense of precision, one can use `fold!((a, b) => a + b)(r, 0)`, which
is not specialized for summation.
Params:
seed = the initial value of the summation
r = a finite input range
Returns:
The sum of all the elements in the range r.
*/
auto sum(R)(R r)
if (isInputRange!R && !isInfinite!R && is(typeof(r.front + r.front)))
{
alias E = Unqual!(ElementType!R);
static if (isFloatingPoint!E)
alias Seed = typeof(E.init + 0.0); //biggest of double/real
else
alias Seed = typeof(r.front + r.front);
return sum(r, Unqual!Seed(0));
}
/// ditto
auto sum(R, E)(R r, E seed)
if (isInputRange!R && !isInfinite!R && is(typeof(seed = seed + r.front)))
{
static if (isFloatingPoint!E)
{
static if (hasLength!R && hasSlicing!R)
{
if (r.empty) return seed;
return seed + sumPairwise!E(r);
}
else
return sumKahan!E(seed, r);
}
else
{
return reduce!"a + b"(seed, r);
}
}
/// Ditto
@safe pure nothrow unittest
{
import std.range;
//simple integral sumation
assert(sum([ 1, 2, 3, 4]) == 10);
//with integral promotion
assert(sum([false, true, true, false, true]) == 3);
assert(sum(ubyte.max.repeat(100)) == 25500);
//The result may overflow
assert(uint.max.repeat(3).sum() == 4294967293U );
//But a seed can be used to change the sumation primitive
assert(uint.max.repeat(3).sum(ulong.init) == 12884901885UL);
//Floating point sumation
assert(sum([1.0, 2.0, 3.0, 4.0]) == 10);
//Floating point operations have double precision minimum
static assert(is(typeof(sum([1F, 2F, 3F, 4F])) == double));
assert(sum([1F, 2, 3, 4]) == 10);
//Force pair-wise floating point sumation on large integers
import std.math : approxEqual;
assert(iota(ulong.max / 2, ulong.max / 2 + 4096).sum(0.0)
.approxEqual((ulong.max / 2) * 4096.0 + 4096^^2 / 2));
}
// Pairwise summation http://en.wikipedia.org/wiki/Pairwise_summation
private auto sumPairwise(F, R)(R data)
if (isInputRange!R && !isInfinite!R)
{
import core.bitop : bsf;
// Works for r with at least length < 2^^(64 + log2(16)), in keeping with the use of size_t
// elsewhere in std.algorithm and std.range on 64 bit platforms. The 16 in log2(16) comes
// from the manual unrolling in sumPairWise16
F[64] store = void;
size_t idx = 0;
void collapseStore(T)(T k)
{
auto lastToKeep = idx - cast(uint) bsf(k+1);
while (idx > lastToKeep)
{
store[idx - 1] += store[idx];
--idx;
}
}
static if (hasLength!R)
{
foreach (k; 0 .. data.length / 16)
{
static if (isRandomAccessRange!R && hasSlicing!R)
{
store[idx] = sumPairwise16!F(data);
data = data[16 .. data.length];
}
else store[idx] = sumPairwiseN!(16, false, F)(data);
collapseStore(k);
++idx;
}
size_t i = 0;
foreach (el; data)
{
store[idx] = el;
collapseStore(i);
++idx;
++i;
}
}
else
{
size_t k = 0;
while (!data.empty)
{
store[idx] = sumPairwiseN!(16, true, F)(data);
collapseStore(k);
++idx;
++k;
}
}
F s = store[idx - 1];
foreach_reverse (j; 0 .. idx - 1)
s += store[j];
return s;
}
private auto sumPairwise16(F, R)(R r)
if (isRandomAccessRange!R)
{
return (((cast(F) r[ 0] + r[ 1]) + (cast(F) r[ 2] + r[ 3]))
+ ((cast(F) r[ 4] + r[ 5]) + (cast(F) r[ 6] + r[ 7])))
+ (((cast(F) r[ 8] + r[ 9]) + (cast(F) r[10] + r[11]))
+ ((cast(F) r[12] + r[13]) + (cast(F) r[14] + r[15])));
}
private auto sumPair(bool needEmptyChecks, F, R)(ref R r)
if (isForwardRange!R && !isRandomAccessRange!R)
{
static if (needEmptyChecks) if (r.empty) return F(0);
F s0 = r.front;
r.popFront();
static if (needEmptyChecks) if (r.empty) return s0;
s0 += r.front;
r.popFront();
return s0;
}
private auto sumPairwiseN(size_t N, bool needEmptyChecks, F, R)(ref R r)
if (isForwardRange!R && !isRandomAccessRange!R)
{
import std.math : isPowerOf2;
static assert(isPowerOf2(N));
static if (N == 2) return sumPair!(needEmptyChecks, F)(r);
else return sumPairwiseN!(N/2, needEmptyChecks, F)(r)
+ sumPairwiseN!(N/2, needEmptyChecks, F)(r);
}
// Kahan algo http://en.wikipedia.org/wiki/Kahan_summation_algorithm
private auto sumKahan(Result, R)(Result result, R r)
{
static assert(isFloatingPoint!Result && isMutable!Result);
Result c = 0;
for (; !r.empty; r.popFront())
{
immutable y = r.front - c;
immutable t = result + y;
c = (t - result) - y;
result = t;
}
return result;
}
@safe pure nothrow unittest
{
static assert(is(typeof(sum([cast( byte) 1])) == int));
static assert(is(typeof(sum([cast(ubyte) 1])) == int));
static assert(is(typeof(sum([ 1, 2, 3, 4])) == int));
static assert(is(typeof(sum([ 1U, 2U, 3U, 4U])) == uint));
static assert(is(typeof(sum([ 1L, 2L, 3L, 4L])) == long));
static assert(is(typeof(sum([1UL, 2UL, 3UL, 4UL])) == ulong));
int[] empty;
assert(sum(empty) == 0);
assert(sum([42]) == 42);
assert(sum([42, 43]) == 42 + 43);
assert(sum([42, 43, 44]) == 42 + 43 + 44);
assert(sum([42, 43, 44, 45]) == 42 + 43 + 44 + 45);
}
@safe pure nothrow unittest
{
static assert(is(typeof(sum([1.0, 2.0, 3.0, 4.0])) == double));
static assert(is(typeof(sum([ 1F, 2F, 3F, 4F])) == double));
const(float[]) a = [1F, 2F, 3F, 4F];
assert(sum(a) == 10F);
static assert(is(typeof(sum(a)) == double));
double[] empty;
assert(sum(empty) == 0);
assert(sum([42.]) == 42);
assert(sum([42., 43.]) == 42 + 43);
assert(sum([42., 43., 44.]) == 42 + 43 + 44);
assert(sum([42., 43., 44., 45.5]) == 42 + 43 + 44 + 45.5);
}
@safe pure nothrow unittest
{
import std.container;
static assert(is(typeof(sum(SList!float()[])) == double));
static assert(is(typeof(sum(SList!double()[])) == double));
static assert(is(typeof(sum(SList!real()[])) == real));
assert(sum(SList!double()[]) == 0);
assert(sum(SList!double(1)[]) == 1);
assert(sum(SList!double(1, 2)[]) == 1 + 2);
assert(sum(SList!double(1, 2, 3)[]) == 1 + 2 + 3);
assert(sum(SList!double(1, 2, 3, 4)[]) == 10);
}
@safe pure nothrow unittest // 12434
{
immutable a = [10, 20];
auto s1 = sum(a);
assert(s1 == 30);
auto s2 = a.map!(x => x).sum;
assert(s2 == 30);
}
@system unittest
{
import std.bigint;
import std.range;
immutable BigInt[] a = BigInt("1_000_000_000_000_000_000").repeat(10).array();
immutable ulong[] b = (ulong.max/2).repeat(10).array();
auto sa = a.sum();
auto sb = b.sum(BigInt(0)); //reduce ulongs into bigint
assert(sa == BigInt("10_000_000_000_000_000_000"));
assert(sb == (BigInt(ulong.max/2) * 10));
}
@safe pure nothrow @nogc unittest
{
import std.range;
foreach (n; iota(50))
assert(repeat(1.0, n).sum == n);
}
/**
Finds the mean (colloquially known as the average) of a range.
For built-in numerical types, accurate Knuth & Welford mean calculation
is used. For user-defined types, element by element summation is used.
Additionally an extra parameter `seed` is needed in order to correctly
seed the summation with the equivalent to `0`.
The first overload of this function will return `T.init` if the range
is empty. However, the second overload will return `seed` on empty ranges.
This function is $(BIGOH r.length).
Params:
r = An $(REF_ALTTEXT input range, isInputRange, std,range,primitives)
seed = For user defined types. Should be equivalent to `0`.
Returns:
The mean of `r` when `r` is non-empty.
*/
T mean(T = double, R)(R r)
if (isInputRange!R &&
isNumeric!(ElementType!R) &&
!isInfinite!R)
{
if (r.empty)
return T.init;
Unqual!T meanRes = 0;
size_t i = 1;
// Knuth & Welford mean calculation
// division per element is slower, but more accurate
for (; !r.empty; r.popFront())
{
T delta = r.front - meanRes;
meanRes += delta / i++;
}
return meanRes;
}
/// ditto
auto mean(R, T)(R r, T seed)
if (isInputRange!R &&
!isNumeric!(ElementType!R) &&
is(typeof(r.front + seed)) &&
is(typeof(r.front / size_t(1))) &&
!isInfinite!R)
{
import std.algorithm.iteration : sum, reduce;
// per item division vis-a-vis the previous overload is too
// inaccurate for integer division, which the user defined
// types might be representing
static if (hasLength!R)
{
if (r.length == 0)
return seed;
return sum(r, seed) / r.length;
}
else
{
import std.typecons : tuple;
if (r.empty)
return seed;
auto pair = reduce!((a, b) => tuple(a[0] + 1, a[1] + b))
(tuple(size_t(0), seed), r);
return pair[1] / pair[0];
}
}
///
@safe @nogc pure nothrow unittest
{
import std.math : approxEqual, isNaN;
static immutable arr1 = [1, 2, 3];
static immutable arr2 = [1.5, 2.5, 12.5];
assert(arr1.mean.approxEqual(2));
assert(arr2.mean.approxEqual(5.5));
assert(arr1[0 .. 0].mean.isNaN);
}
@safe pure nothrow unittest
{
import std.internal.test.dummyrange : ReferenceInputRange;
import std.math : approxEqual;
auto r1 = new ReferenceInputRange!int([1, 2, 3]);
assert(r1.mean.approxEqual(2));
auto r2 = new ReferenceInputRange!double([1.5, 2.5, 12.5]);
assert(r2.mean.approxEqual(5.5));
}
// Test user defined types
@system pure unittest
{
import std.bigint : BigInt;
import std.internal.test.dummyrange : ReferenceInputRange;
import std.math : approxEqual;
auto bigint_arr = [BigInt("1"), BigInt("2"), BigInt("3"), BigInt("6")];
auto bigint_arr2 = new ReferenceInputRange!BigInt([
BigInt("1"), BigInt("2"), BigInt("3"), BigInt("6")
]);
assert(bigint_arr.mean(BigInt(0)) == BigInt("3"));
assert(bigint_arr2.mean(BigInt(0)) == BigInt("3"));
BigInt[] bigint_arr3 = [];
assert(bigint_arr3.mean(BigInt(0)) == BigInt(0));
struct MyFancyDouble
{
double v;
alias v this;
}
// both overloads
auto d_arr = [MyFancyDouble(10), MyFancyDouble(15), MyFancyDouble(30)];
assert(mean!(double)(cast(double[]) d_arr).approxEqual(18.333));
assert(mean(d_arr, MyFancyDouble(0)).approxEqual(18.333));
}
// uniq
/**
Lazily iterates unique consecutive elements of the given range (functionality
akin to the $(HTTP wikipedia.org/wiki/_Uniq, _uniq) system
utility). Equivalence of elements is assessed by using the predicate
`pred`, by default `"a == b"`. The predicate is passed to
$(REF binaryFun, std,functional), and can either accept a string, or any callable
that can be executed via `pred(element, element)`. If the given range is
bidirectional, `uniq` also yields a
$(REF_ALTTEXT bidirectional range, isBidirectionalRange, std,range,primitives).
Params:
pred = Predicate for determining equivalence between range elements.
r = An $(REF_ALTTEXT input range, isInputRange, std,range,primitives) of
elements to filter.
Returns:
An $(REF_ALTTEXT input range, isInputRange, std,range,primitives) of
consecutively unique elements in the original range. If `r` is also a
forward range or bidirectional range, the returned range will be likewise.
*/
auto uniq(alias pred = "a == b", Range)(Range r)
if (isInputRange!Range && is(typeof(binaryFun!pred(r.front, r.front)) == bool))
{
return UniqResult!(binaryFun!pred, Range)(r);
}
///
@safe unittest
{
import std.algorithm.comparison : equal;
import std.algorithm.mutation : copy;
int[] arr = [ 1, 2, 2, 2, 2, 3, 4, 4, 4, 5 ];
assert(equal(uniq(arr), [ 1, 2, 3, 4, 5 ][]));
// Filter duplicates in-place using copy
arr.length -= arr.uniq().copy(arr).length;
assert(arr == [ 1, 2, 3, 4, 5 ]);
// Note that uniqueness is only determined consecutively; duplicated
// elements separated by an intervening different element will not be
// eliminated:
assert(equal(uniq([ 1, 1, 2, 1, 1, 3, 1]), [1, 2, 1, 3, 1]));
}
private struct UniqResult(alias pred, Range)
{
Range _input;
this(Range input)
{
_input = input;
}
auto opSlice()
{
return this;
}
void popFront()
{
assert(!empty, "Attempting to popFront an empty uniq.");
auto last = _input.front;
do
{
_input.popFront();
}
while (!_input.empty && pred(last, _input.front));
}
@property ElementType!Range front()
{
assert(!empty, "Attempting to fetch the front of an empty uniq.");
return _input.front;
}
static if (isBidirectionalRange!Range)
{
void popBack()
{
assert(!empty, "Attempting to popBack an empty uniq.");
auto last = _input.back;
do
{
_input.popBack();
}
while (!_input.empty && pred(last, _input.back));
}
@property ElementType!Range back()
{
assert(!empty, "Attempting to fetch the back of an empty uniq.");
return _input.back;
}
}
static if (isInfinite!Range)
{
enum bool empty = false; // Propagate infiniteness.
}
else
{
@property bool empty() { return _input.empty; }
}
static if (isForwardRange!Range)
{
@property typeof(this) save() {
return typeof(this)(_input.save);
}
}
}
@safe unittest
{
import std.algorithm.comparison : equal;
import std.internal.test.dummyrange;
import std.range;
int[] arr = [ 1, 2, 2, 2, 2, 3, 4, 4, 4, 5 ];
auto r = uniq(arr);
static assert(isForwardRange!(typeof(r)));
assert(equal(r, [ 1, 2, 3, 4, 5 ][]));
assert(equal(retro(r), retro([ 1, 2, 3, 4, 5 ][])));
foreach (DummyType; AllDummyRanges)
{
DummyType d;
auto u = uniq(d);
assert(equal(u, [1,2,3,4,5,6,7,8,9,10]));
static assert(d.rt == RangeType.Input || isForwardRange!(typeof(u)));
static if (d.rt >= RangeType.Bidirectional)
{
assert(equal(retro(u), [10,9,8,7,6,5,4,3,2,1]));
}
}
}
@safe unittest // https://issues.dlang.org/show_bug.cgi?id=17264
{
import std.algorithm.comparison : equal;
const(int)[] var = [0, 1, 1, 2];
assert(var.uniq.equal([0, 1, 2]));
}
/**
Lazily computes all _permutations of `r` using $(HTTP
en.wikipedia.org/wiki/Heap%27s_algorithm, Heap's algorithm).
Returns:
A $(REF_ALTTEXT forward range, isForwardRange, std,range,primitives)
the elements of which are an $(REF indexed, std,range) view into `r`.
See_Also:
$(REF nextPermutation, std,algorithm,sorting).
*/
Permutations!Range permutations(Range)(Range r)
if (isRandomAccessRange!Range && hasLength!Range)
{
return typeof(return)(r);
}
/// ditto
struct Permutations(Range)
if (isRandomAccessRange!Range && hasLength!Range)
{
private size_t[] _indices, _state;
private Range _r;
private bool _empty;
///
this(Range r)
{
import std.array : array;
import std.range : iota;
this._r = r;
_state = r.length ? new size_t[r.length-1] : null;
_indices = iota(size_t(r.length)).array;
_empty = r.length == 0;
}
///
@property bool empty() const pure nothrow @safe @nogc
{
return _empty;
}
///
@property auto front()
{
import std.range : indexed;
return _r.indexed(_indices);
}
///
void popFront()
{
void next(int n)
{
import std.algorithm.mutation : swap;
if (n > _indices.length)
{
_empty = true;
return;
}
if (n % 2 == 1)
swap(_indices[0], _indices[n-1]);
else
swap(_indices[_state[n-2]], _indices[n-1]);
if (++_state[n-2] == n)
{
_state[n-2] = 0;
next(n+1);
}
}
next(2);
}
}
///
@safe unittest
{
import std.algorithm.comparison : equal;
import std.range : iota;
assert(equal!equal(iota(3).permutations,
[[0, 1, 2],
[1, 0, 2],
[2, 0, 1],
[0, 2, 1],
[1, 2, 0],
[2, 1, 0]]));
}
|
D
|
/Users/martyn/Development/AppCoordinatorsLearning/DerivedData/AppCoordinatorsLearning/Build/Intermediates.noindex/Pods.build/Debug-iphonesimulator/RxSwift.build/Objects-normal/x86_64/VirtualTimeScheduler.o : /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Amb.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/SingleAsync.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/DistinctUntilChanged.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Deferred.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Deprecated.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/AsMaybe.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Sequence.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/Platform/DataStructures/InfiniteSequence.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Traits/PrimitiveSequence.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Debounce.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Reduce.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Range.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Merge.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Take.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/Internal/AnonymousInvocable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Subjects/Variable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Cancelable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/ScheduledDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/CompositeDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/SerialDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/BooleanDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/SubscriptionDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/NopDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/AnonymousDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/SingleAssignmentDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/RefCountDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/BinaryDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/GroupedObservable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/AsSingle.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/TakeWhile.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/SkipWhile.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Sample.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Throttle.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/ShareReplayScope.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Concurrency/SynchronizedSubscribeType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Concurrency/SynchronizedUnsubscribeType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/Internal/InvocableType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/ObservableType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/ConnectableObservableType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/ObservableConvertibleType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Concurrency/SynchronizedDisposeType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/Internal/ScheduledItemType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Concurrency/SynchronizedOnType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/SchedulerType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/ImmediateSchedulerType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Concurrency/LockOwnerType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/VirtualTimeConverterType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/ObserverType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Subjects/SubjectType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/DisposeBase.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observers/ObserverBase.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Create.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Generate.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/Platform/DataStructures/Queue.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/Platform/DataStructures/PriorityQueue.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Reactive.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Materialize.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Dematerialize.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/AddRef.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/Platform/DataStructures/Bag.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/DisposeBag.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Using.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Debug.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Catch.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Switch.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/StartWith.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Concurrency/Lock.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Concurrency/AsyncLock.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/Platform/RecursiveLock.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Sink.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observers/TailRecursiveSink.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Optional.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/TakeUntil.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/SkipUntil.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/Internal/ScheduledItem.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/Internal/InvocableScheduledItem.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/WithLatestFrom.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/SubscribeOn.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/ObserveOn.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Scan.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Traits/Completable+AndThen.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/RetryWhen.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/Platform/Platform.Darwin.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/SchedulerServices+Emulation.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/Internal/DispatchQueueConfiguration.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Zip+Collection.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/CombineLatest+Collection.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/DelaySubscription.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Do.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Map.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Zip.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Skip.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Producer.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Buffer.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/CurrentThreadScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/VirtualTimeScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/ImmediateScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/SerialDispatchQueueScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/ConcurrentDispatchQueueScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/OperationQueueScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/RecursiveScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/HistoricalScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/MainScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/ConcurrentMainScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Timer.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Filter.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/HistoricalSchedulerTimeConverter.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Never.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observers/AnonymousObserver.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/AnyObserver.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Error.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/Disposables.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/ObservableType+Extensions.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/Platform/DispatchQueue+Extensions.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Errors.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/ElementAt.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Concat.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Repeat.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Subjects/AsyncSubject.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Subjects/PublishSubject.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Subjects/BehaviorSubject.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Subjects/ReplaySubject.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Event.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/TakeLast.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Multicast.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/CombineLatest.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Just.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Timeout.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Window.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Extensions/Bag+Rx.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Extensions/String+Rx.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Rx.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/RxMutableBox.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/Platform/Platform.Linux.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/GroupBy.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Delay.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/ToArray.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Traits/PrimitiveSequence+Zip+arity.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Zip+arity.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/CombineLatest+arity.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Empty.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/SwitchIfEmpty.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/DefaultIfEmpty.swift /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Metal.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreFoundation.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Users/martyn/Development/AppCoordinatorsLearning/Pods/Target\ Support\ Files/RxSwift/RxSwift-umbrella.h /Users/martyn/Development/AppCoordinatorsLearning/DerivedData/AppCoordinatorsLearning/Build/Intermediates.noindex/Pods.build/Debug-iphonesimulator/RxSwift.build/unextended-module.modulemap /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/usr/include/objc/ObjectiveC.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/System/Library/Frameworks/OpenGLES.framework/Headers/OpenGLES.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/usr/include/Darwin.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/System/Library/Frameworks/UIKit.framework/Headers/UIKit.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes
/Users/martyn/Development/AppCoordinatorsLearning/DerivedData/AppCoordinatorsLearning/Build/Intermediates.noindex/Pods.build/Debug-iphonesimulator/RxSwift.build/Objects-normal/x86_64/VirtualTimeScheduler~partial.swiftmodule : /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Amb.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/SingleAsync.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/DistinctUntilChanged.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Deferred.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Deprecated.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/AsMaybe.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Sequence.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/Platform/DataStructures/InfiniteSequence.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Traits/PrimitiveSequence.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Debounce.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Reduce.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Range.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Merge.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Take.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/Internal/AnonymousInvocable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Subjects/Variable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Cancelable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/ScheduledDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/CompositeDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/SerialDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/BooleanDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/SubscriptionDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/NopDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/AnonymousDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/SingleAssignmentDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/RefCountDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/BinaryDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/GroupedObservable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/AsSingle.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/TakeWhile.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/SkipWhile.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Sample.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Throttle.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/ShareReplayScope.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Concurrency/SynchronizedSubscribeType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Concurrency/SynchronizedUnsubscribeType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/Internal/InvocableType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/ObservableType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/ConnectableObservableType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/ObservableConvertibleType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Concurrency/SynchronizedDisposeType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/Internal/ScheduledItemType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Concurrency/SynchronizedOnType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/SchedulerType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/ImmediateSchedulerType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Concurrency/LockOwnerType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/VirtualTimeConverterType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/ObserverType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Subjects/SubjectType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/DisposeBase.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observers/ObserverBase.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Create.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Generate.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/Platform/DataStructures/Queue.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/Platform/DataStructures/PriorityQueue.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Reactive.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Materialize.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Dematerialize.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/AddRef.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/Platform/DataStructures/Bag.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/DisposeBag.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Using.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Debug.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Catch.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Switch.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/StartWith.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Concurrency/Lock.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Concurrency/AsyncLock.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/Platform/RecursiveLock.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Sink.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observers/TailRecursiveSink.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Optional.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/TakeUntil.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/SkipUntil.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/Internal/ScheduledItem.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/Internal/InvocableScheduledItem.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/WithLatestFrom.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/SubscribeOn.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/ObserveOn.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Scan.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Traits/Completable+AndThen.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/RetryWhen.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/Platform/Platform.Darwin.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/SchedulerServices+Emulation.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/Internal/DispatchQueueConfiguration.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Zip+Collection.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/CombineLatest+Collection.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/DelaySubscription.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Do.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Map.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Zip.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Skip.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Producer.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Buffer.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/CurrentThreadScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/VirtualTimeScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/ImmediateScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/SerialDispatchQueueScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/ConcurrentDispatchQueueScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/OperationQueueScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/RecursiveScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/HistoricalScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/MainScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/ConcurrentMainScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Timer.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Filter.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/HistoricalSchedulerTimeConverter.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Never.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observers/AnonymousObserver.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/AnyObserver.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Error.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/Disposables.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/ObservableType+Extensions.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/Platform/DispatchQueue+Extensions.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Errors.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/ElementAt.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Concat.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Repeat.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Subjects/AsyncSubject.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Subjects/PublishSubject.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Subjects/BehaviorSubject.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Subjects/ReplaySubject.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Event.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/TakeLast.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Multicast.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/CombineLatest.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Just.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Timeout.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Window.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Extensions/Bag+Rx.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Extensions/String+Rx.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Rx.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/RxMutableBox.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/Platform/Platform.Linux.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/GroupBy.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Delay.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/ToArray.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Traits/PrimitiveSequence+Zip+arity.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Zip+arity.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/CombineLatest+arity.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Empty.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/SwitchIfEmpty.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/DefaultIfEmpty.swift /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Metal.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreFoundation.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Users/martyn/Development/AppCoordinatorsLearning/Pods/Target\ Support\ Files/RxSwift/RxSwift-umbrella.h /Users/martyn/Development/AppCoordinatorsLearning/DerivedData/AppCoordinatorsLearning/Build/Intermediates.noindex/Pods.build/Debug-iphonesimulator/RxSwift.build/unextended-module.modulemap /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/usr/include/objc/ObjectiveC.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/System/Library/Frameworks/OpenGLES.framework/Headers/OpenGLES.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/usr/include/Darwin.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/System/Library/Frameworks/UIKit.framework/Headers/UIKit.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes
/Users/martyn/Development/AppCoordinatorsLearning/DerivedData/AppCoordinatorsLearning/Build/Intermediates.noindex/Pods.build/Debug-iphonesimulator/RxSwift.build/Objects-normal/x86_64/VirtualTimeScheduler~partial.swiftdoc : /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Amb.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/SingleAsync.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/DistinctUntilChanged.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Deferred.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Deprecated.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/AsMaybe.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Sequence.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/Platform/DataStructures/InfiniteSequence.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Traits/PrimitiveSequence.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Debounce.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Reduce.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Range.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Merge.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Take.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/Internal/AnonymousInvocable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Subjects/Variable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Cancelable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/ScheduledDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/CompositeDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/SerialDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/BooleanDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/SubscriptionDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/NopDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/AnonymousDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/SingleAssignmentDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/RefCountDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/BinaryDisposable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/GroupedObservable.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/AsSingle.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/TakeWhile.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/SkipWhile.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Sample.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Throttle.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/ShareReplayScope.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Concurrency/SynchronizedSubscribeType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Concurrency/SynchronizedUnsubscribeType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/Internal/InvocableType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/ObservableType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/ConnectableObservableType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/ObservableConvertibleType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Concurrency/SynchronizedDisposeType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/Internal/ScheduledItemType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Concurrency/SynchronizedOnType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/SchedulerType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/ImmediateSchedulerType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Concurrency/LockOwnerType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/VirtualTimeConverterType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/ObserverType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Subjects/SubjectType.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/DisposeBase.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observers/ObserverBase.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Create.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Generate.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/Platform/DataStructures/Queue.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/Platform/DataStructures/PriorityQueue.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Reactive.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Materialize.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Dematerialize.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/AddRef.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/Platform/DataStructures/Bag.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/DisposeBag.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Using.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Debug.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Catch.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Switch.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/StartWith.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Concurrency/Lock.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Concurrency/AsyncLock.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/Platform/RecursiveLock.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Sink.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observers/TailRecursiveSink.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Optional.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/TakeUntil.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/SkipUntil.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/Internal/ScheduledItem.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/Internal/InvocableScheduledItem.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/WithLatestFrom.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/SubscribeOn.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/ObserveOn.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Scan.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Traits/Completable+AndThen.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/RetryWhen.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/Platform/Platform.Darwin.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/SchedulerServices+Emulation.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/Internal/DispatchQueueConfiguration.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Zip+Collection.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/CombineLatest+Collection.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/DelaySubscription.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Do.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Map.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Zip.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Skip.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Producer.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Buffer.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/CurrentThreadScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/VirtualTimeScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/ImmediateScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/SerialDispatchQueueScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/ConcurrentDispatchQueueScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/OperationQueueScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/RecursiveScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/HistoricalScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/MainScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/ConcurrentMainScheduler.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Timer.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Filter.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Schedulers/HistoricalSchedulerTimeConverter.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Never.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observers/AnonymousObserver.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/AnyObserver.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Error.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Disposables/Disposables.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/ObservableType+Extensions.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/Platform/DispatchQueue+Extensions.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Errors.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/ElementAt.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Concat.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Repeat.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Subjects/AsyncSubject.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Subjects/PublishSubject.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Subjects/BehaviorSubject.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Subjects/ReplaySubject.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Event.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/TakeLast.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Multicast.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/CombineLatest.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Just.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Timeout.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Window.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Extensions/Bag+Rx.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Extensions/String+Rx.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Rx.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/RxMutableBox.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/Platform/Platform.Linux.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/GroupBy.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Delay.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/ToArray.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Traits/PrimitiveSequence+Zip+arity.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Zip+arity.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/CombineLatest+arity.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/Empty.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/SwitchIfEmpty.swift /Users/martyn/Development/AppCoordinatorsLearning/Pods/RxSwift/RxSwift/Observables/DefaultIfEmpty.swift /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Metal.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreFoundation.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Users/martyn/Development/AppCoordinatorsLearning/Pods/Target\ Support\ Files/RxSwift/RxSwift-umbrella.h /Users/martyn/Development/AppCoordinatorsLearning/DerivedData/AppCoordinatorsLearning/Build/Intermediates.noindex/Pods.build/Debug-iphonesimulator/RxSwift.build/unextended-module.modulemap /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/usr/include/objc/ObjectiveC.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/System/Library/Frameworks/OpenGLES.framework/Headers/OpenGLES.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/usr/include/Darwin.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/System/Library/Frameworks/UIKit.framework/Headers/UIKit.apinotes /Users/martyn/Downloads/Xcode9.1.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.1.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes
|
D
|
module perfontain.shader.resource;
import std, perfontain;
enum ProgramSource
{
header,
misc,
depth,
shadows,
lighting,
light_compute,
gui,
draw
}
ProgramSource programSource(string name)
{
foreach (ps; EnumMembers!ProgramSource)
if (ps.to!string == name)
return ps;
assert(false, name);
}
string shaderSource(ProgramSource pt)
{
foreach (ps; EnumMembers!ProgramSource)
if (ps == pt)
{
enum Name = ps.to!string ~ `.c`;
debug return PEfs.get(`../source/perfontain/shader/res/` ~ Name).assumeUTF;
else return import(Name);
}
assert(false);
}
|
D
|
/Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Build/Intermediates.noindex/IBDesignables/Intermediates.noindex/Pods.build/Debug-iphonesimulator/Alamofire.build/Objects-normal/x86_64/Alamofire.o : /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/MultipartFormData.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/Timeline.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/DispatchQueue+Alamofire.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/Alamofire.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/Response.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/TaskDelegate.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/SessionDelegate.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/ParameterEncoding.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/Validation.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/ResponseSerialization.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/SessionManager.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/NetworkReachabilityManager.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/AFError.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/Notifications.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/Result.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/Request.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/ServerTrustPolicy.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Metal.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreFoundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Target\ Support\ Files/Alamofire/Alamofire-umbrella.h /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Build/Intermediates.noindex/IBDesignables/Intermediates.noindex/Pods.build/Debug-iphonesimulator/Alamofire.build/unextended-module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/System/Library/Frameworks/OpenGLES.framework/Headers/OpenGLES.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/System/Library/Frameworks/UIKit.framework/Headers/UIKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes
/Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Build/Intermediates.noindex/IBDesignables/Intermediates.noindex/Pods.build/Debug-iphonesimulator/Alamofire.build/Objects-normal/x86_64/Alamofire~partial.swiftmodule : /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/MultipartFormData.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/Timeline.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/DispatchQueue+Alamofire.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/Alamofire.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/Response.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/TaskDelegate.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/SessionDelegate.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/ParameterEncoding.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/Validation.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/ResponseSerialization.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/SessionManager.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/NetworkReachabilityManager.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/AFError.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/Notifications.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/Result.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/Request.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/ServerTrustPolicy.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Metal.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreFoundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Target\ Support\ Files/Alamofire/Alamofire-umbrella.h /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Build/Intermediates.noindex/IBDesignables/Intermediates.noindex/Pods.build/Debug-iphonesimulator/Alamofire.build/unextended-module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/System/Library/Frameworks/OpenGLES.framework/Headers/OpenGLES.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/System/Library/Frameworks/UIKit.framework/Headers/UIKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes
/Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Build/Intermediates.noindex/IBDesignables/Intermediates.noindex/Pods.build/Debug-iphonesimulator/Alamofire.build/Objects-normal/x86_64/Alamofire~partial.swiftdoc : /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/MultipartFormData.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/Timeline.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/DispatchQueue+Alamofire.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/Alamofire.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/Response.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/TaskDelegate.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/SessionDelegate.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/ParameterEncoding.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/Validation.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/ResponseSerialization.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/SessionManager.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/NetworkReachabilityManager.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/AFError.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/Notifications.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/Result.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/Request.swift /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Alamofire/Source/ServerTrustPolicy.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Metal.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreFoundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Pods/Target\ Support\ Files/Alamofire/Alamofire-umbrella.h /Users/babaiholdings/Documents/AlchemintWalletiOS/AlchemintProject/Build/Intermediates.noindex/IBDesignables/Intermediates.noindex/Pods.build/Debug-iphonesimulator/Alamofire.build/unextended-module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/System/Library/Frameworks/OpenGLES.framework/Headers/OpenGLES.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/System/Library/Frameworks/UIKit.framework/Headers/UIKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.4.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes
|
D
|
module startup;
version(GNU)
{
static import gcc.attribute; // we need this to get the section, weak and alias attributes
void wfi(){ version(ALLOW_WFI){ asm{ "wfi"; } } }
}
else version(LDC)
{
import ldc.llvmasm;
void wfi(){ version(ALLOW_WFI){ __asm("wfi"); } }
}
import core.stdc.config; // we need this for c_ulong, so we can get symbols from the linker-script
import core.stdc.stdint; // these are the types normally used on microcontrollers
// Create convenience enums and aliases for the weak and alias attributes:
enum isr_vector = gcc.attribute.attribute("section",".isr_vector.ro");
enum naked = gcc.attribute.attribute("naked");
enum weak = gcc.attribute.attribute("weak");
alias Tuple(A...) = A;
alias rst = Tuple!(weak, gcc.attribute.attribute("alias", "defaultResetHandler"));
alias exc = Tuple!(weak, gcc.attribute.attribute("alias", "defaultExceptionHandler"));
// The following symbols are provided by our linker-script:
extern(C) extern __gshared c_ulong _stack; // initial stack address
extern(C) extern __gshared c_ulong _siccmram; // pointer to read-only data that needs to be copied to CCMRAM
extern(C) extern __gshared c_ulong _sccmram; // start address of .ccmram section (somewhere within CCMRAM)
extern(C) extern __gshared c_ulong _eccmram; // end address of .ccmram section (somewhere within CCMRAM)
extern(C) extern __gshared c_ulong _sirelocated; // pointer to read-only data that needs to be copied to normal SRAM
extern(C) extern __gshared c_ulong _srelocated; // start address of .relocated section (somewhere within SRAM)
extern(C) extern __gshared c_ulong _erelocated; // end address of .relocated section (somewhere within SRAM)
extern(C) extern __gshared c_ulong _szeroed; // start address of .zeroed section (somewhere within SRAM or CCMRAM)
extern(C) extern __gshared c_ulong _ezeroed; // end address of .zeroed section (somewhere within SRAM or CCMRAM)
// Create a convenience alias for our vector functions:
//alias extern(C) const void function() VectorFunc; // currently, this won't work for me
alias extern(C) const void *VectorFunc; // so I'm using a void* instead.
@rst extern(C) void Reset_Handler();
@exc extern(C) void NMI_Handler();
@exc extern(C) void HardFault_Handler();
@exc extern(C) void SVC_Handler();
@exc extern(C) void PendSV_Handler();
@exc extern(C) void SysTick_Handler();
@exc extern(C) void WWDG_IRQHandler();
@exc extern(C) void PVD_VDDIO2_IRQHandler();
@exc extern(C) void RTC_IRQHandler();
@exc extern(C) void FLASH_IRQHandler();
@exc extern(C) void RCC_CRS_IRQHandler();
@exc extern(C) void EXTI0_1_IRQHandler();
@exc extern(C) void EXTI2_3_IRQHandler();
@exc extern(C) void EXTI4_15_IRQHandler();
@exc extern(C) void TSC_IRQHandler();
@exc extern(C) void DMA1_Ch1_IRQHandler();
@exc extern(C) void DMA1_Ch2_3_DMA2_Ch1_2_IRQHandler();
@exc extern(C) void DMA1_Ch4_7_DMA2_Ch3_5_IRQHandler();
@exc extern(C) void ADC1_COMP_IRQHandler();
@exc extern(C) void TIM1_BRK_UP_TRG_COM_IRQHandler();
@exc extern(C) void TIM1_CC_IRQHandler();
@exc extern(C) void TIM2_IRQHandler();
@exc extern(C) void TIM3_IRQHandler();
@exc extern(C) void TIM6_DAC_IRQHandler();
@exc extern(C) void TIM7_IRQHandler();
@exc extern(C) void TIM14_IRQHandler();
@exc extern(C) void TIM15_IRQHandler();
@exc extern(C) void TIM16_IRQHandler();
@exc extern(C) void TIM17_IRQHandler();
@exc extern(C) void I2C1_IRQHandler();
@exc extern(C) void I2C2_IRQHandler();
@exc extern(C) void SPI1_IRQHandler();
@exc extern(C) void SPI2_IRQHandler();
@exc extern(C) void USART1_IRQHandler();
@exc extern(C) void USART2_IRQHandler();
@exc extern(C) void USART3_8_IRQHandler();
@exc extern(C) void CEC_CAN_IRQHandler();
@isr_vector VectorFunc[47] g_pfnVectors = [
cast(VectorFunc)&_stack, /* -16 $0000 Initial Stack Pointer */
&Reset_Handler, /* -15 $0004 Reset Vector */
&NMI_Handler, /* -14 $0008 Non Maskable Interrupt Vector */
&HardFault_Handler, /* -13 $000c Hard Fault Vector */
cast(VectorFunc)0, /* -12 $0010 Reserved */
cast(VectorFunc)0, /* -11 $0014 Reserved */
cast(VectorFunc)0, /* -10 $0018 Reserved */
cast(VectorFunc)0, /* -9 $001c Reserved */
cast(VectorFunc)0, /* -8 $0020 Reserved */
cast(VectorFunc)0, /* -7 $0024 Reserved */
cast(VectorFunc)0, /* -6 $0028 Reserved */
&SVC_Handler, /* -5 $002c SuperVisor Call Vector */
cast(VectorFunc)0, /* -4 $0030 Reserved */
cast(VectorFunc)0, /* -3 $0034 Reserved */
&PendSV_Handler, /* -2 $0038 Pending SuperVisor Vector */
&SysTick_Handler, /* -1 $003c System Tick Vector */
&WWDG_IRQHandler, /* 0 $0040 Windowed WatchDog */
&PVD_VDDIO2_IRQHandler, /* 1 $0044 PVD and VDDIO2 through EXTI Line detection */
&RTC_IRQHandler, /* 2 $0048 RTC through the EXTI line */
&FLASH_IRQHandler, /* 3 $004c FLASH */
&RCC_CRS_IRQHandler, /* 4 $0050 RCC and CRS */
&EXTI0_1_IRQHandler, /* 5 $0054 EXTI Line 0 and 1 */
&EXTI2_3_IRQHandler, /* 6 $0058 EXTI Line 2 and 3 */
&EXTI4_15_IRQHandler, /* 7 $005c EXTI Line 4 to 15 */
&TSC_IRQHandler, /* 8 $0060 TSC */
&DMA1_Ch1_IRQHandler, /* 9 $0064 DMA1 Channel 1 */
&DMA1_Ch2_3_DMA2_Ch1_2_IRQHandler, /* 10 $0068 DMA1 Channel 2 and 3 & DMA2 Channel 1 and 2 */
&DMA1_Ch4_7_DMA2_Ch3_5_IRQHandler, /* 11 $006c DMA1 Channel 4 to 7 & DMA2 Channel 3 to 5 */
&ADC1_COMP_IRQHandler, /* 12 $0070 ADC1, COMP1 and COMP2 */
&TIM1_BRK_UP_TRG_COM_IRQHandler, /* 13 $0074 TIM1 Break, Update, Trigger and Commutation */
&TIM1_CC_IRQHandler, /* 14 $0078 TIM1 Capture Compare */
&TIM2_IRQHandler, /* 15 $007c TIM2 */
&TIM3_IRQHandler, /* 16 $0080 TIM3 */
&TIM6_DAC_IRQHandler, /* 17 $0084 TIM6 and DAC */
&TIM7_IRQHandler, /* 18 $0088 TIM7 */
&TIM14_IRQHandler, /* 19 $008c TIM14 */
&TIM15_IRQHandler, /* 20 $0090 TIM15 */
&TIM16_IRQHandler, /* 21 $0094 TIM16 */
&TIM17_IRQHandler, /* 22 $0098 TIM17 */
&I2C1_IRQHandler, /* 23 $009c I2C1 */
&I2C2_IRQHandler, /* 24 $00a0 I2C2 */
&SPI1_IRQHandler, /* 25 $00a4 SPI1 */
&SPI2_IRQHandler, /* 26 $00a8 SPI2 */
&USART1_IRQHandler, /* 27 $00ac USART1 */
&USART2_IRQHandler, /* 28 $00b0 USART2 */
&USART3_8_IRQHandler, /* 29 $00b4 USART3, USART4, USART5, USART6, USART7, USART8 */
&CEC_CAN_IRQHandler, /* 30 $00b8 CEC and CAN */
];
@weak extern(C) void LowLevelInit();
@weak extern(C) void SystemInit();
@weak extern(C) void __libc_init_array();
@weak extern(C) extern __gshared c_ulong SystemCoreClock;
extern(C) void main();
void copyBlock(const(void) *aSource, void *aDestination, void *aDestinationEnd)
{
const(uint32_t) *s = cast(const(uint32_t) *)aSource;
uint32_t *d = cast(uint32_t *)aDestination;
uint32_t *e = cast(uint32_t *)aDestinationEnd;
while(d < e)
{
*d++ = *s++;
}
}
void zeroBlock(void *aDestination, void *aDestinationEnd)
{
uint32_t *d = cast(uint32_t *)aDestination;
uint32_t *e = cast(uint32_t *)aDestinationEnd;
while(d < e)
{
*d++ = 0;
}
}
@naked extern(C) void defaultResetHandler() /* we can mark this naked, as it never returns and should never save any registers on the stack */
{
uint32_t saveFreq;
LowLevelInit();
SystemInit();
saveFreq = SystemCoreClock;
copyBlock(&_siccmram, &_sccmram, &_eccmram);
copyBlock(&_sirelocated, &_srelocated, &_erelocated);
zeroBlock(&_szeroed, &_ezeroed);
__libc_init_array();
if(&SystemCoreClock) SystemCoreClock = saveFreq;
main();
defaultExceptionHandler();
}
@naked extern(C) void defaultExceptionHandler()
{
while(true)
{
wfi();
}
}
|
D
|
/**
* Copyright: Copyright (c) 2007-2011 Jacob Carlborg. All rights reserved.
* Authors: Jacob Carlborg
* Version: Initial created: 2007
* License: $(LINK2 http://www.boost.org/LICENSE_1_0.txt, Boost Software License 1.0)
*
*/
module orange.core.io;
import std.stdio;
alias write print;
alias writeln println;
|
D
|
/Users/petercernak/vapor/TILApp/Build/Intermediates.noindex/TILApp.build/Debug/Command.build/Objects-normal/x86_64/Exports.o : /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Command/Command.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Base/CommandRunnable.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Run/Output+Autocomplete.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Config/CommandConfig.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Base/CommandOption.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Run/Console+Run.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Run/Output+Help.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Group/CommandGroup.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Group/BasicCommandGroup.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Utilities/CommandError.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Config/Commands.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Utilities/Utilities.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Utilities/Exports.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Command/CommandArgument.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Run/CommandInput.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Run/CommandContext.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Dispatch.apinotesc /Users/petercernak/vapor/TILApp/Build/Products/Debug/NIO.framework/Modules/NIO.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/Async.framework/Modules/Async.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/Service.framework/Modules/Service.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/Console.framework/Modules/Console.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/Core.framework/Modules/Core.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/Logging.framework/Modules/Logging.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/Debugging.framework/Modules/Debugging.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/COperatingSystem.framework/Modules/COperatingSystem.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/NIOConcurrencyHelpers.framework/Modules/NIOConcurrencyHelpers.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/Bits.framework/Modules/Bits.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/NIOFoundationCompat.framework/Modules/NIOFoundationCompat.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/CoreFoundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/IOKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/SwiftOnoneSupport.swiftmodule /Users/petercernak/vapor/TILApp/.build/checkouts/swift-nio.git--2128188973977302459/Sources/CNIOAtomics/include/cpp_magic.h /Users/petercernak/vapor/TILApp/.build/checkouts/swift-nio.git--2128188973977302459/Sources/CNIODarwin/include/c_nio_darwin.h /Users/petercernak/vapor/TILApp/.build/checkouts/swift-nio.git--2128188973977302459/Sources/CNIOAtomics/include/c-atomics.h /Users/petercernak/vapor/TILApp/.build/checkouts/swift-nio.git--2128188973977302459/Sources/CNIOLinux/include/c_nio_linux.h /Users/petercernak/vapor/TILApp/TILApp.xcodeproj/GeneratedModuleMap/CNIOSHA1/module.modulemap /Users/petercernak/vapor/TILApp/.build/checkouts/swift-nio-zlib-support.git--6538424668019974428/module.modulemap /Users/petercernak/vapor/TILApp/TILApp.xcodeproj/GeneratedModuleMap/CNIODarwin/module.modulemap /Users/petercernak/vapor/TILApp/TILApp.xcodeproj/GeneratedModuleMap/CNIOAtomics/module.modulemap /Users/petercernak/vapor/TILApp/TILApp.xcodeproj/GeneratedModuleMap/CNIOLinux/module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.14.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.14.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.14.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.14.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.14.sdk/System/Library/Frameworks/ApplicationServices.framework/Headers/ApplicationServices.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.14.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.14.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
/Users/petercernak/vapor/TILApp/Build/Intermediates.noindex/TILApp.build/Debug/Command.build/Objects-normal/x86_64/Exports~partial.swiftmodule : /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Command/Command.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Base/CommandRunnable.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Run/Output+Autocomplete.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Config/CommandConfig.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Base/CommandOption.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Run/Console+Run.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Run/Output+Help.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Group/CommandGroup.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Group/BasicCommandGroup.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Utilities/CommandError.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Config/Commands.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Utilities/Utilities.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Utilities/Exports.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Command/CommandArgument.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Run/CommandInput.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Run/CommandContext.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Dispatch.apinotesc /Users/petercernak/vapor/TILApp/Build/Products/Debug/NIO.framework/Modules/NIO.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/Async.framework/Modules/Async.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/Service.framework/Modules/Service.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/Console.framework/Modules/Console.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/Core.framework/Modules/Core.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/Logging.framework/Modules/Logging.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/Debugging.framework/Modules/Debugging.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/COperatingSystem.framework/Modules/COperatingSystem.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/NIOConcurrencyHelpers.framework/Modules/NIOConcurrencyHelpers.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/Bits.framework/Modules/Bits.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/NIOFoundationCompat.framework/Modules/NIOFoundationCompat.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/CoreFoundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/IOKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/SwiftOnoneSupport.swiftmodule /Users/petercernak/vapor/TILApp/.build/checkouts/swift-nio.git--2128188973977302459/Sources/CNIOAtomics/include/cpp_magic.h /Users/petercernak/vapor/TILApp/.build/checkouts/swift-nio.git--2128188973977302459/Sources/CNIODarwin/include/c_nio_darwin.h /Users/petercernak/vapor/TILApp/.build/checkouts/swift-nio.git--2128188973977302459/Sources/CNIOAtomics/include/c-atomics.h /Users/petercernak/vapor/TILApp/.build/checkouts/swift-nio.git--2128188973977302459/Sources/CNIOLinux/include/c_nio_linux.h /Users/petercernak/vapor/TILApp/TILApp.xcodeproj/GeneratedModuleMap/CNIOSHA1/module.modulemap /Users/petercernak/vapor/TILApp/.build/checkouts/swift-nio-zlib-support.git--6538424668019974428/module.modulemap /Users/petercernak/vapor/TILApp/TILApp.xcodeproj/GeneratedModuleMap/CNIODarwin/module.modulemap /Users/petercernak/vapor/TILApp/TILApp.xcodeproj/GeneratedModuleMap/CNIOAtomics/module.modulemap /Users/petercernak/vapor/TILApp/TILApp.xcodeproj/GeneratedModuleMap/CNIOLinux/module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.14.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.14.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.14.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.14.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.14.sdk/System/Library/Frameworks/ApplicationServices.framework/Headers/ApplicationServices.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.14.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.14.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
/Users/petercernak/vapor/TILApp/Build/Intermediates.noindex/TILApp.build/Debug/Command.build/Objects-normal/x86_64/Exports~partial.swiftdoc : /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Command/Command.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Base/CommandRunnable.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Run/Output+Autocomplete.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Config/CommandConfig.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Base/CommandOption.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Run/Console+Run.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Run/Output+Help.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Group/CommandGroup.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Group/BasicCommandGroup.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Utilities/CommandError.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Config/Commands.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Utilities/Utilities.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Utilities/Exports.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Command/CommandArgument.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Run/CommandInput.swift /Users/petercernak/vapor/TILApp/.build/checkouts/console.git-5752444009020230057/Sources/Command/Run/CommandContext.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Dispatch.apinotesc /Users/petercernak/vapor/TILApp/Build/Products/Debug/NIO.framework/Modules/NIO.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/Async.framework/Modules/Async.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/Service.framework/Modules/Service.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/Console.framework/Modules/Console.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/Core.framework/Modules/Core.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/Logging.framework/Modules/Logging.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/Debugging.framework/Modules/Debugging.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/COperatingSystem.framework/Modules/COperatingSystem.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/NIOConcurrencyHelpers.framework/Modules/NIOConcurrencyHelpers.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/Bits.framework/Modules/Bits.swiftmodule/x86_64.swiftmodule /Users/petercernak/vapor/TILApp/Build/Products/Debug/NIOFoundationCompat.framework/Modules/NIOFoundationCompat.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/CoreFoundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/IOKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/SwiftOnoneSupport.swiftmodule /Users/petercernak/vapor/TILApp/.build/checkouts/swift-nio.git--2128188973977302459/Sources/CNIOAtomics/include/cpp_magic.h /Users/petercernak/vapor/TILApp/.build/checkouts/swift-nio.git--2128188973977302459/Sources/CNIODarwin/include/c_nio_darwin.h /Users/petercernak/vapor/TILApp/.build/checkouts/swift-nio.git--2128188973977302459/Sources/CNIOAtomics/include/c-atomics.h /Users/petercernak/vapor/TILApp/.build/checkouts/swift-nio.git--2128188973977302459/Sources/CNIOLinux/include/c_nio_linux.h /Users/petercernak/vapor/TILApp/TILApp.xcodeproj/GeneratedModuleMap/CNIOSHA1/module.modulemap /Users/petercernak/vapor/TILApp/.build/checkouts/swift-nio-zlib-support.git--6538424668019974428/module.modulemap /Users/petercernak/vapor/TILApp/TILApp.xcodeproj/GeneratedModuleMap/CNIODarwin/module.modulemap /Users/petercernak/vapor/TILApp/TILApp.xcodeproj/GeneratedModuleMap/CNIOAtomics/module.modulemap /Users/petercernak/vapor/TILApp/TILApp.xcodeproj/GeneratedModuleMap/CNIOLinux/module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.14.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.14.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.14.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.14.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.14.sdk/System/Library/Frameworks/ApplicationServices.framework/Headers/ApplicationServices.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.14.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.14.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
|
D
|
/Users/dali/Documents/GitHub/rustlings/target/debug/deps/float_cmp-5bf9ef2cb1799e33.rmeta: /Users/dali/.cargo/registry/src/mirrors.ustc.edu.cn-61ef6e0cd06fb9b8/float-cmp-0.8.0/src/lib.rs /Users/dali/.cargo/registry/src/mirrors.ustc.edu.cn-61ef6e0cd06fb9b8/float-cmp-0.8.0/src/macros.rs /Users/dali/.cargo/registry/src/mirrors.ustc.edu.cn-61ef6e0cd06fb9b8/float-cmp-0.8.0/src/ulps.rs /Users/dali/.cargo/registry/src/mirrors.ustc.edu.cn-61ef6e0cd06fb9b8/float-cmp-0.8.0/src/ulps_eq.rs /Users/dali/.cargo/registry/src/mirrors.ustc.edu.cn-61ef6e0cd06fb9b8/float-cmp-0.8.0/src/eq.rs /Users/dali/.cargo/registry/src/mirrors.ustc.edu.cn-61ef6e0cd06fb9b8/float-cmp-0.8.0/src/ratio.rs
/Users/dali/Documents/GitHub/rustlings/target/debug/deps/float_cmp-5bf9ef2cb1799e33.d: /Users/dali/.cargo/registry/src/mirrors.ustc.edu.cn-61ef6e0cd06fb9b8/float-cmp-0.8.0/src/lib.rs /Users/dali/.cargo/registry/src/mirrors.ustc.edu.cn-61ef6e0cd06fb9b8/float-cmp-0.8.0/src/macros.rs /Users/dali/.cargo/registry/src/mirrors.ustc.edu.cn-61ef6e0cd06fb9b8/float-cmp-0.8.0/src/ulps.rs /Users/dali/.cargo/registry/src/mirrors.ustc.edu.cn-61ef6e0cd06fb9b8/float-cmp-0.8.0/src/ulps_eq.rs /Users/dali/.cargo/registry/src/mirrors.ustc.edu.cn-61ef6e0cd06fb9b8/float-cmp-0.8.0/src/eq.rs /Users/dali/.cargo/registry/src/mirrors.ustc.edu.cn-61ef6e0cd06fb9b8/float-cmp-0.8.0/src/ratio.rs
/Users/dali/.cargo/registry/src/mirrors.ustc.edu.cn-61ef6e0cd06fb9b8/float-cmp-0.8.0/src/lib.rs:
/Users/dali/.cargo/registry/src/mirrors.ustc.edu.cn-61ef6e0cd06fb9b8/float-cmp-0.8.0/src/macros.rs:
/Users/dali/.cargo/registry/src/mirrors.ustc.edu.cn-61ef6e0cd06fb9b8/float-cmp-0.8.0/src/ulps.rs:
/Users/dali/.cargo/registry/src/mirrors.ustc.edu.cn-61ef6e0cd06fb9b8/float-cmp-0.8.0/src/ulps_eq.rs:
/Users/dali/.cargo/registry/src/mirrors.ustc.edu.cn-61ef6e0cd06fb9b8/float-cmp-0.8.0/src/eq.rs:
/Users/dali/.cargo/registry/src/mirrors.ustc.edu.cn-61ef6e0cd06fb9b8/float-cmp-0.8.0/src/ratio.rs:
|
D
|
// This file is part of Visual D
//
// Visual D integrates the D programming language into Visual Studio
// Copyright (c) 2010-2011 by Rainer Schuetze, All Rights Reserved
//
// Distributed under the Boost Software License, Version 1.0.
// See accompanying file LICENSE.txt or copy at http://www.boost.org/LICENSE_1_0.txt
module vdc.parser.misc;
import vdc.util;
import vdc.lexer;
import vdc.parser.engine;
import vdc.parser.expr;
import vdc.parser.decl;
import vdc.parser.stmt;
import vdc.parser.mod;
import ast = vdc.ast.all;
import stdext.util;
//-- GRAMMAR_BEGIN --
//EnumDeclaration:
// enum EnumTag EnumBody
// enum EnumBody
// enum EnumTag : EnumBaseType EnumBody
// enum : EnumBaseType EnumBody
// enum EnumTag ;
// enum EnumInitializers ;
// enum Type EnumInitializers ;
//
//EnumTag:
// Identifier
//
//EnumBaseType:
// Type
//
//EnumInitializers:
// EnumInitializer
// EnumInitializers , EnumInitializer
//
//EnumInitializer:
// Identifier = AssignExpression
class EnumDeclaration
{
static Action enter(Parser p)
{
if(p.tok.id != TOK_enum)
return p.parseError("enum expected");
p.pushNode(new ast.EnumDeclaration(p.tok));
p.pushState(&shiftEnum);
return Accept;
}
static Action shiftEnum(Parser p)
{
switch(p.tok.id)
{
case TOK_lcurly:
p.pushState(&shiftEnumBody);
return EnumBody.enter(p);
case TOK_colon:
p.pushState(&shiftColon);
return Accept;
case TOK_Identifier:
p.pushToken(p.tok);
p.pushState(&shiftIdentifier);
return Accept;
default:
p.pushState(&shiftType);
return Type.enter(p);
}
}
static Action shiftColon(Parser p)
{
p.pushState(&shiftBaseType);
return Type.enter(p);
}
static Action shiftType(Parser p)
{
p.popAppendTopNode!(ast.EnumDeclaration)();
switch(p.tok.id)
{
case TOK_Identifier:
p.topNode!(ast.EnumDeclaration)().ident = p.tok.txt;
p.pushState(&shiftAssignAfterType);
return Accept;
default:
return p.parseError("identifier expected after enum type");
}
}
// assumes token on stack
static Action shiftIdentifier(Parser p)
{
switch(p.tok.id)
{
case TOK_colon:
p.topNode!(ast.EnumDeclaration)().ident = p.popToken().txt;
p.pushState(&shiftColon);
return Accept;
case TOK_semicolon:
p.topNode!(ast.EnumDeclaration)().ident = p.popToken().txt;
return Accept;
case TOK_assign:
p.topNode!(ast.EnumDeclaration)().ident = p.popToken().txt;
p.pushState(&shiftAssign);
return Accept;
case TOK_lcurly:
p.topNode!(ast.EnumDeclaration)().ident = p.popToken().txt;
p.pushState(&shiftEnumBody);
return EnumBody.enter(p);
default:
p.pushState(&shiftType);
return Type.enterIdentifier(p);
}
}
static Action shiftBaseType(Parser p)
{
p.popAppendTopNode!(ast.EnumDeclaration)();
p.pushState(&shiftEnumBody);
return EnumBody.enter(p);
}
static Action shiftEnumBody(Parser p)
{
p.popAppendTopNode!(ast.EnumDeclaration)();
return Forward;
}
static Action shiftAssignAfterType(Parser p)
{
switch(p.tok.id)
{
case TOK_assign:
p.pushState(&shiftAssign);
return Accept;
default:
return p.parseError("'=' expected to initialize enum");
}
}
static Action shiftAssign(Parser p)
{
p.pushState(&shiftExpression);
return AssignExpression.enter(p);
}
static Action shiftExpression(Parser p)
{
auto expr = p.popNode();
auto ed = p.topNode!(ast.EnumDeclaration)();
// rebuild as anonymous enum with single member
auto b = new ast.EnumBody(TOK_lcurly, ed.span);
auto m = new ast.EnumMembers(TOK_Identifier, ed.span);
auto e = new ast.EnumMember(TOK_Identifier, ed.span);
e.addMember(expr);
e.ident = ed.ident;
m.addMember(e);
b.addMember(m);
ed.ident = null;
ed.isDecl = true;
ed.addMember(b);
switch(p.tok.id)
{
case TOK_semicolon:
return Accept;
case TOK_comma:
p.pushState(&shiftNextIdentifier);
return Accept;
default:
return p.parseError("';' expected after single line enum");
}
}
static Action shiftNextIdentifier(Parser p)
{
switch(p.tok.id)
{
case TOK_Identifier:
auto e = new ast.EnumMember(p.tok);
e.ident = p.tok.txt;
p.pushNode(e);
p.pushState(&shiftAssignAfterNextIdentifier);
return Accept;
default:
return p.parseError("identifier expected after enum type");
}
}
static Action shiftAssignAfterNextIdentifier(Parser p)
{
switch(p.tok.id)
{
case TOK_assign:
p.pushState(&shiftNextAssign);
return Accept;
default:
return p.parseError("'=' expected to initialize enum");
}
}
static Action shiftNextAssign(Parser p)
{
p.pushState(&shiftNextExpression);
return AssignExpression.enter(p);
}
static Action shiftNextExpression(Parser p)
{
p.popAppendTopNode!(ast.EnumMember)();
auto m = p.popNode!(ast.EnumMember)();
auto ed = p.topNode!(ast.EnumDeclaration)();
auto eb = ed.getBody();
auto em = static_cast!(ast.EnumMembers)(eb.getMember(0));
em.addMember(m);
switch(p.tok.id)
{
case TOK_semicolon:
return Accept;
case TOK_comma:
p.pushState(&shiftNextIdentifier);
return Accept;
default:
return p.parseError("';' expected after single line enum");
}
}
}
//-- GRAMMAR_BEGIN --
// forward declaration not needed with proper handling
//EnumBody:
// ;
// { EnumMembers }
class EnumBody
{
mixin SequenceNode!(ast.EnumBody, TOK_lcurly, EnumMembersRecover, TOK_rcurly);
}
class EnumMembersRecover
{
static Action enter(Parser p)
{
p.pushNode(new ast.EnumMembers(p.tok));
// recover code inserted into EnumMembers.enter
p.pushRecoverState(&recover);
p.pushState(&Parser.keepRecover); // add a "guard" state to avoid popping recover
p.pushState(&verifyCurly);
p.pushState(&EnumMembers.shift);
return EnumMember.enter(p);
}
static Action verifyCurly(Parser p)
{
if(p.tok.id != TOK_rcurly)
return p.parseError("'}' expected after enum");
return Forward;
}
static Action recover(Parser p)
{
return Parser.recoverSemiCurly(p);
}
}
//-- GRAMMAR_BEGIN --
//EnumMembers:
// EnumMember
// EnumMember ,
// EnumMember , EnumMembers
class EnumMembers
{
mixin ListNode!(ast.EnumMembers, EnumMember, TOK_comma, true);
}
//-- GRAMMAR_BEGIN --
//EnumMember:
// Identifier
// Identifier = AssignExpression
// Type Identifier = AssignExpression
class EnumMember
{
static Action enter(Parser p)
{
p.pushNode(new ast.EnumMember(p.tok));
if(p.tok.id != TOK_Identifier)
{
p.pushState(&shiftType);
return Type.enter(p);
}
p.pushState(&shiftIdentifierOrType);
p.pushToken(p.tok);
return Accept;
}
static Action shiftIdentifierOrType(Parser p)
{
if(p.tok.id != TOK_assign && p.tok.id != TOK_comma && p.tok.id != TOK_rcurly)
{
p.pushState(&shiftType);
return Type.enterIdentifier(p);
}
Token tok = p.popToken();
ast.EnumMember em = p.topNode!(ast.EnumMember)();
em.ident = tok.txt;
return shiftIdentifier(p);
}
static Action shiftAssign(Parser p)
{
p.pushState(&shiftExpression);
return AssignExpression.enter(p);
}
static Action shiftExpression(Parser p)
{
p.popAppendTopNode!(ast.EnumMember, ast.Expression)();
return Forward;
}
static Action shiftType(Parser p)
{
if(p.tok.id != TOK_Identifier)
return p.parseError("identifier expected after type in enum");
p.popAppendTopNode!(ast.EnumMember, ast.Type)();
auto em = p.topNode!(ast.EnumMember)();
em.ident = p.tok.txt;
p.pushState(&shiftIdentifier);
return Accept;
}
static Action shiftIdentifier(Parser p)
{
if(p.tok.id != TOK_assign)
return Forward;
p.pushState(&shiftAssign);
return Accept;
}
}
////////////////////////////////////////////////////////////////
//-- GRAMMAR_BEGIN --
//FunctionBody:
// BlockStatement
// BodyStatement
// InStatement BodyStatement
// OutStatement BodyStatement
// InStatement OutStatement BodyStatement
// OutStatement InStatement BodyStatement
//
//InStatement:
// in BlockStatement
//
//OutStatement:
// out BlockStatement
// out ( Identifier ) BlockStatement
//
//BodyStatement:
// body BlockStatement
//
// body statement might be missing in interface contracts
//
class FunctionBody
{
static bool isInitTerminal(Token tok)
{
switch(tok.id)
{
case TOK_lcurly:
case TOK_body:
case TOK_in:
case TOK_out:
return true;
default:
return false;
}
}
static Action enter(Parser p)
{
ast.FunctionBody fb = new ast.FunctionBody(p.tok);
p.pushNode(fb);
if(p.tok.id == TOK_lcurly)
{
p.pushState(&shiftBodyStatement);
return BlockStatement.enter(p);
}
return shiftStatement(p);
}
static Action shiftBodyStatement(Parser p)
{
auto bodyStmt = p.topNode!(ast.BlockStatement)();
p.popAppendTopNode();
p.topNode!(ast.FunctionBody)().bodyStatement = bodyStmt;
return Forward;
}
static Action shiftInStatement(Parser p)
{
auto inStmt = p.topNode!(ast.BlockStatement)();
p.popAppendTopNode();
p.topNode!(ast.FunctionBody)().inStatement = inStmt;
return shiftStatement(p);
}
static Action shiftOutStatement(Parser p)
{
auto outStmt = p.topNode!(ast.BlockStatement)();
p.popAppendTopNode();
p.topNode!(ast.FunctionBody)().outStatement = outStmt;
return shiftStatement(p);
}
static Action shiftStatement(Parser p)
{
switch(p.tok.id)
{
case TOK_body:
p.pushState(&shiftBodyStatement);
p.pushState(&BlockStatement.enter);
return Accept;
case TOK_in:
if(p.topNode!(ast.FunctionBody)().inStatement)
return p.parseError("duplicate in block");
p.pushState(&shiftInStatement);
p.pushState(&BlockStatement.enter);
return Accept;
case TOK_out:
if(p.topNode!(ast.FunctionBody)().outStatement)
return p.parseError("duplicate out block");
p.pushState(&shiftOut);
return Accept;
default:
return Forward; // p.parseError("expected body or in or out block");
}
}
static Action shiftOut(Parser p)
{
if(p.tok.id == TOK_lparen)
{
p.pushState(&shiftLparen);
return Accept;
}
p.pushState(&shiftOutStatement);
return BlockStatement.enter(p);
}
static Action shiftLparen(Parser p)
{
if(p.tok.id != TOK_Identifier)
return p.parseError("identifier expected for return value in out contract");
auto outid = new ast.OutIdentifier(p.tok);
p.topNode!(ast.FunctionBody)().addMember(outid);
p.topNode!(ast.FunctionBody)().outIdentifier = outid;
p.pushState(&shiftOutIdentifier);
return Accept;
}
static Action shiftOutIdentifier(Parser p)
{
if(p.tok.id != TOK_rparen)
return p.parseError("closing parenthesis expected in out contract");
p.pushState(&shiftOutStatement);
p.pushState(&BlockStatement.enter);
return Accept;
}
}
////////////////////////////////////////////////////////////////
// disambiguate between VersionCondition and VersionSpecification
class VersionCondOrSpec
{
static Action enter(Parser p)
{
assert(p.tok.id == TOK_version);
p.pushState(&shiftVersion);
return Accept;
}
static Action shiftVersion(Parser p)
{
switch(p.tok.id)
{
case TOK_assign:
return VersionSpecification.enterAfterVersion(p);
case TOK_lparen:
return ConditionalDeclaration.enterAfterVersion(p);
default:
return p.parseError("'=' or '(' expected after version");
}
}
}
//-- GRAMMAR_BEGIN --
//ConditionalDeclaration:
// Condition DeclarationBlock
// Condition DeclarationBlock else DeclarationBlock
// Condition: DeclDefs_opt
class ConditionalDeclaration
{
// Condition DeclarationBlock else $ DeclarationBlock
mixin stateAppendClass!(DeclarationBlock, Parser.forward) stateElseDecl;
// Condition DeclarationBlock $ else DeclarationBlock
mixin stateShiftToken!(TOK_else, stateElseDecl.shift,
-1, Parser.forward) stateElse;
// Condition $ DeclarationBlock else DeclarationBlock
mixin stateAppendClass!(DeclarationBlock, stateElse.shift) stateThenDecl;
static Action shiftCondition(Parser p)
{
switch(p.tok.id)
{
case TOK_colon:
auto declblk = new ast.DeclarationBlock(p.tok);
p.topNode!(ast.ConditionalDeclaration).id = TOK_colon;
p.pushNode(declblk);
p.pushState(&enterDeclarationBlock);
return Accept;
default:
return stateThenDecl.shift(p);
}
}
static Action enterDeclarationBlock(Parser p)
{
switch(p.tok.id)
{
case TOK_rcurly:
case TOK_EOF:
return shiftDeclarationBlock(p);
default:
p.pushState(&shiftDeclarationBlock);
return DeclDefs.enter(p);
}
}
static Action shiftDeclarationBlock(Parser p)
{
p.popAppendTopNode!(ast.ConditionalDeclaration,ast.DeclarationBlock)();
return Forward;
}
// $ Condition DeclarationBlock else DeclarationBlock
mixin stateEnterClass!(Condition, ast.ConditionalDeclaration, shiftCondition);
static Action enterAfterVersion(Parser p)
{
p.pushNode(new ast.ConditionalDeclaration(p.tok));
p.pushState(&enterReduce);
return VersionCondition.enterAfterVersion(p);
}
static Action enterAfterDebug(Parser p)
{
p.pushNode(new ast.ConditionalDeclaration(p.tok));
p.pushState(&enterReduce);
return DebugCondition.enterAfterDebug(p);
}
static Action enterAfterStatic(Parser p)
{
p.pushNode(new ast.ConditionalDeclaration(p.tok));
p.pushState(&enterReduce);
return StaticIfCondition.enterAfterStatic(p);
}
}
//-- GRAMMAR_BEGIN --
//ConditionalStatement:
// Condition NoScopeNonEmptyStatement
// Condition NoScopeNonEmptyStatement else NoScopeNonEmptyStatement
class ConditionalStatement
{
// Condition $ NoScopeNonEmptyStatement else NoScopeNonEmptyStatement
mixin stateAppendClass!(NoScopeNonEmptyStatement, Parser.forward) stateElseStmt;
mixin stateShiftToken!(TOK_else, stateElseStmt.shift,
-1, Parser.forward) stateElse;
// Condition $ NoScopeNonEmptyStatement else NoScopeNonEmptyStatement
mixin stateAppendClass!(NoScopeNonEmptyStatement, stateElse.shift) stateThenStmt;
// $ Condition NoScopeNonEmptyStatement else NoScopeNonEmptyStatement
mixin stateEnterClass!(Condition, ast.ConditionalStatement, stateThenStmt.shift);
static Action enterAfterStatic(Parser p)
{
p.pushNode(new ast.ConditionalStatement(p.tok));
p.pushState(&enterReduce);
return StaticIfCondition.enterAfterStatic(p);
}
}
//-- GRAMMAR_BEGIN --
//Condition:
// VersionCondition
// DebugCondition
// StaticIfCondition
class Condition
{
static Action enter(Parser p)
{
switch(p.tok.id)
{
case TOK_version:
return VersionCondition.enter(p);
case TOK_debug:
return DebugCondition.enter(p);
case TOK_static:
return StaticIfCondition.enter(p);
default:
return p.parseError("version, debug or static if expected");
}
}
}
//-- GRAMMAR_BEGIN --
//VersionCondition:
// version ( Integer )
// version ( Identifier )
// version ( unittest )
// version ( assert )
class VersionCondition
{
// version ( Integer $ )
mixin stateShiftToken!(TOK_rparen, Parser.forward) stateRparen;
// version ( $ Integer )
mixin stateAppendClass!(IdentifierOrInteger, stateRparen.shift) stateArgument2;
static Action shiftUnittest(Parser p)
{
p.topNode!(ast.VersionCondition).id = TOK_unittest;
return stateRparen.shift(p);
}
static Action shiftAssert(Parser p)
{
p.topNode!(ast.VersionCondition).id = TOK_assert;
return stateRparen.shift(p);
}
mixin stateShiftToken!(TOK_unittest, shiftUnittest,
TOK_assert, shiftAssert,
-1, stateArgument2.shift) stateArgument;
// version $ ( Integer )
mixin stateShiftToken!(TOK_lparen, stateArgument.shift) stateLparen;
// $ version ( Integer )
mixin stateEnterToken!(TOK_version, ast.VersionCondition, stateLparen.shift);
static Action enterAfterVersion(Parser p)
{
p.pushNode(new ast.VersionCondition(p.tok));
return stateLparen.shift(p);
}
}
//-- GRAMMAR_BEGIN --
//VersionSpecification:
// version = Identifier ;
// version = Integer ;
class VersionSpecification
{
mixin stateShiftToken!(TOK_semicolon, Parser.forward) stateSemi;
mixin stateAppendClass!(IdentifierOrInteger, stateSemi.shift) stateArgument;
mixin stateShiftToken!(TOK_assign, stateArgument.shift) stateAssign;
mixin stateEnterToken!(TOK_version, ast.VersionSpecification, stateAssign.shift);
static Action enterAfterVersion(Parser p)
{
p.pushNode(new ast.VersionSpecification(p.tok));
return stateAssign.shift(p);
}
}
// disambiguate between DebugCondition and DebugSpecification
class DebugCondOrSpec
{
static Action enter(Parser p)
{
assert(p.tok.id == TOK_debug);
p.pushState(&shiftDebug);
return Accept;
}
static Action shiftDebug(Parser p)
{
switch(p.tok.id)
{
case TOK_assign:
return DebugSpecification.enterAfterDebug(p);
default:
return ConditionalDeclaration.enterAfterDebug(p);
}
}
}
//-- GRAMMAR_BEGIN --
//DebugCondition:
// debug
// debug ( Integer )
// debug ( Identifier )
class DebugCondition
{
// debug ( Integer $ )
mixin stateShiftToken!(TOK_rparen, Parser.forward) stateRparen;
// debug ( $ Integer )
mixin stateAppendClass!(IdentifierOrInteger, stateRparen.shift) stateArgument;
// debug $ ( Integer )
mixin stateShiftToken!(TOK_lparen, stateArgument.shift,
-1, Parser.forward) stateLparen;
// $ debug ( Integer )
mixin stateEnterToken!(TOK_debug, ast.DebugCondition, stateLparen.shift);
static Action enterAfterDebug(Parser p)
{
p.pushNode(new ast.DebugCondition(p.tok));
return stateLparen.shift(p);
}
}
//-- GRAMMAR_BEGIN --
//DebugSpecification:
// debug = Identifier ;
// debug = Integer ;
class DebugSpecification
{
// debug = Integer $ ;
mixin stateShiftToken!(TOK_semicolon, Parser.forward) stateSemi;
// debug = $ Integer ;
mixin stateAppendClass!(IdentifierOrInteger, stateSemi.shift) stateArgument;
// debug $ = Integer ;
mixin stateShiftToken!(TOK_assign, stateArgument.shift) stateAssign;
// $ debug = Integer ;
mixin stateEnterToken!(TOK_debug, ast.DebugSpecification, stateAssign.shift);
static Action enterAfterDebug(Parser p)
{
p.pushNode(new ast.DebugSpecification(p.tok));
return stateAssign.shift(p);
}
}
class IdentifierOrInteger
{
static Action enter(Parser p)
{
switch(p.tok.id)
{
case TOK_IntegerLiteral:
p.pushNode(new ast.IntegerLiteralExpression(p.tok));
return Accept;
case TOK_Identifier:
p.pushNode(new ast.Identifier(p.tok));
return Accept;
default:
return p.parseError("integer or identifier expected");
}
}
}
//-- GRAMMAR_BEGIN --
//StaticIfCondition:
// static if ( AssignExpression )
class StaticIfCondition
{
mixin SequenceNode!(ast.StaticIfCondition, TOK_static, TOK_if, TOK_lparen, AssignExpression, TOK_rparen);
static Action enterAfterStatic(Parser p)
{
p.pushNode(new ast.StaticIfCondition(p.tok));
return shift1.shift(p); // jump into sequence before TOK_if
}
}
//-- GRAMMAR_BEGIN --
//StaticAssert:
// static assert ( AssignExpression ) ;
// static assert ( AssignExpression , AssignExpression ) ;
class StaticAssert
{
mixin SequenceNode!(ast.StaticAssert, TOK_static, TOK_assert, TOK_lparen, ArgumentList, TOK_rparen, TOK_semicolon);
static Action enterAfterStatic(Parser p)
{
p.pushNode(new ast.StaticAssert(p.tok));
return shift1.shift(p); // jump into sequence before TOK_assert
}
}
|
D
|
/Users/michael/Desktop/Buildcoin/ChartTest/build/Pods.build/Debug-iphonesimulator/Charts.build/Objects-normal/x86_64/LineChartRenderer.o : /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/ChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/CombinedChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/PieChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/BubbleChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/BarLineScatterCandleBubbleChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/CandleChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/LineChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/BarChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/RadarChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/ScatterChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Jobs/ViewPortJob.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Jobs/AnimatedViewPortJob.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Jobs/MoveViewJob.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Jobs/AnimatedMoveViewJob.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Jobs/ZoomViewJob.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Jobs/AnimatedZoomViewJob.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/Legend.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/MarkerImage.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/Range.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/ChartLimitLine.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/ChartDataRendererBase.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/AxisRendererBase.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/AxisBase.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/ComponentBase.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/ChartViewBase.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/BarLineChartViewBase.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/PieRadarChartViewBase.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/ChartDataEntryBase.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Animation/ChartAnimationEasing.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Utils/Fill.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Utils/Platform.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/Description.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Interfaces/ChartDataProvider.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Interfaces/CombinedChartDataProvider.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Interfaces/BubbleChartDataProvider.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Interfaces/BarLineScatterCandleBubbleChartDataProvider.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Interfaces/CandleChartDataProvider.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Interfaces/LineChartDataProvider.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Interfaces/BarChartDataProvider.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Interfaces/ScatterChartDataProvider.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/IMarker.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Utils/ViewPortHandler.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Utils/Transformer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Renderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/LegendRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/BarLineScatterCandleBubbleRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Scatter/IShapeRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Scatter/XShapeRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Scatter/CircleShapeRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Scatter/TriangleShapeRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Scatter/SquareShapeRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Scatter/ChevronDownShapeRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Scatter/ChevronUpShapeRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Scatter/CrossShapeRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/LineScatterCandleRadarRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/LineRadarRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/XAxisRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/YAxisRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/CombinedChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/PieChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/BubbleChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/LineChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/CandleStickChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/BarChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/HorizontalBarChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/RadarChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/ScatterChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/IHighlighter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/CombinedHighlighter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/PieHighlighter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/BarHighlighter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/HorizontalBarHighlighter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/RadarHighlighter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/PieRadarHighlighter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/ChartHighlighter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Formatters/IValueFormatter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Formatters/IAxisValueFormatter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Formatters/DefaultAxisValueFormatter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Formatters/IndexAxisValueFormatter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Formatters/DefaultValueFormatter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Formatters/IFillFormatter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Formatters/DefaultFillFormatter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Animation/Animator.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Filters/DataApproximator.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Utils/ChartColorTemplates.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/XAxis.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/YAxis.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Utils/ChartUtils.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/ChartBaseDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/ChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/IChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/PieChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/IPieChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/BubbleChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/IBubbleChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/BarLineScatterCandleBubbleChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/IBarLineScatterCandleBubbleChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/CandleChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/ICandleChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/LineChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/ILineChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/BarChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/IBarChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/RadarChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/IRadarChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/LineScatterCandleRadarChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/ILineScatterCandleRadarChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/LineRadarChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/ILineRadarChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/ScatterChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/IScatterChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/Highlight.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Utils/TransformerHorizontalBarChart.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/XAxisRendererHorizontalBarChart.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/YAxisRendererHorizontalBarChart.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/XAxisRendererRadarChart.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/YAxisRendererRadarChart.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/MarkerView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/CombinedChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/PieChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/BubbleChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/LineChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/CandleStickChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/BarChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/HorizontalBarChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/RadarChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/ScatterChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/ChartDataEntry.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/PieChartDataEntry.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/BubbleChartDataEntry.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/CandleChartDataEntry.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/BarChartDataEntry.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/RadarChartDataEntry.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/LegendEntry.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Metal.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreFoundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Target\ Support\ Files/Charts/Charts-umbrella.h /Users/michael/Desktop/Buildcoin/ChartTest/build/Pods.build/Debug-iphonesimulator/Charts.build/unextended-module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.0.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.0.sdk/System/Library/Frameworks/OpenGLES.framework/Headers/OpenGLES.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.0.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.0.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.0.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.0.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.0.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.0.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes
/Users/michael/Desktop/Buildcoin/ChartTest/build/Pods.build/Debug-iphonesimulator/Charts.build/Objects-normal/x86_64/LineChartRenderer~partial.swiftmodule : /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/ChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/CombinedChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/PieChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/BubbleChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/BarLineScatterCandleBubbleChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/CandleChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/LineChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/BarChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/RadarChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/ScatterChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Jobs/ViewPortJob.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Jobs/AnimatedViewPortJob.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Jobs/MoveViewJob.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Jobs/AnimatedMoveViewJob.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Jobs/ZoomViewJob.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Jobs/AnimatedZoomViewJob.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/Legend.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/MarkerImage.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/Range.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/ChartLimitLine.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/ChartDataRendererBase.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/AxisRendererBase.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/AxisBase.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/ComponentBase.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/ChartViewBase.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/BarLineChartViewBase.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/PieRadarChartViewBase.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/ChartDataEntryBase.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Animation/ChartAnimationEasing.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Utils/Fill.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Utils/Platform.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/Description.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Interfaces/ChartDataProvider.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Interfaces/CombinedChartDataProvider.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Interfaces/BubbleChartDataProvider.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Interfaces/BarLineScatterCandleBubbleChartDataProvider.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Interfaces/CandleChartDataProvider.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Interfaces/LineChartDataProvider.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Interfaces/BarChartDataProvider.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Interfaces/ScatterChartDataProvider.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/IMarker.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Utils/ViewPortHandler.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Utils/Transformer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Renderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/LegendRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/BarLineScatterCandleBubbleRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Scatter/IShapeRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Scatter/XShapeRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Scatter/CircleShapeRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Scatter/TriangleShapeRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Scatter/SquareShapeRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Scatter/ChevronDownShapeRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Scatter/ChevronUpShapeRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Scatter/CrossShapeRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/LineScatterCandleRadarRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/LineRadarRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/XAxisRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/YAxisRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/CombinedChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/PieChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/BubbleChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/LineChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/CandleStickChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/BarChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/HorizontalBarChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/RadarChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/ScatterChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/IHighlighter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/CombinedHighlighter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/PieHighlighter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/BarHighlighter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/HorizontalBarHighlighter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/RadarHighlighter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/PieRadarHighlighter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/ChartHighlighter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Formatters/IValueFormatter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Formatters/IAxisValueFormatter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Formatters/DefaultAxisValueFormatter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Formatters/IndexAxisValueFormatter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Formatters/DefaultValueFormatter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Formatters/IFillFormatter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Formatters/DefaultFillFormatter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Animation/Animator.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Filters/DataApproximator.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Utils/ChartColorTemplates.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/XAxis.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/YAxis.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Utils/ChartUtils.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/ChartBaseDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/ChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/IChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/PieChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/IPieChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/BubbleChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/IBubbleChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/BarLineScatterCandleBubbleChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/IBarLineScatterCandleBubbleChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/CandleChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/ICandleChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/LineChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/ILineChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/BarChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/IBarChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/RadarChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/IRadarChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/LineScatterCandleRadarChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/ILineScatterCandleRadarChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/LineRadarChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/ILineRadarChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/ScatterChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/IScatterChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/Highlight.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Utils/TransformerHorizontalBarChart.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/XAxisRendererHorizontalBarChart.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/YAxisRendererHorizontalBarChart.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/XAxisRendererRadarChart.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/YAxisRendererRadarChart.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/MarkerView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/CombinedChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/PieChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/BubbleChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/LineChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/CandleStickChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/BarChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/HorizontalBarChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/RadarChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/ScatterChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/ChartDataEntry.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/PieChartDataEntry.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/BubbleChartDataEntry.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/CandleChartDataEntry.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/BarChartDataEntry.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/RadarChartDataEntry.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/LegendEntry.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Metal.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreFoundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Target\ Support\ Files/Charts/Charts-umbrella.h /Users/michael/Desktop/Buildcoin/ChartTest/build/Pods.build/Debug-iphonesimulator/Charts.build/unextended-module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.0.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.0.sdk/System/Library/Frameworks/OpenGLES.framework/Headers/OpenGLES.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.0.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.0.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.0.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.0.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.0.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.0.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes
/Users/michael/Desktop/Buildcoin/ChartTest/build/Pods.build/Debug-iphonesimulator/Charts.build/Objects-normal/x86_64/LineChartRenderer~partial.swiftdoc : /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/ChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/CombinedChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/PieChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/BubbleChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/BarLineScatterCandleBubbleChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/CandleChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/LineChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/BarChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/RadarChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/ScatterChartData.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Jobs/ViewPortJob.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Jobs/AnimatedViewPortJob.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Jobs/MoveViewJob.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Jobs/AnimatedMoveViewJob.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Jobs/ZoomViewJob.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Jobs/AnimatedZoomViewJob.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/Legend.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/MarkerImage.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/Range.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/ChartLimitLine.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/ChartDataRendererBase.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/AxisRendererBase.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/AxisBase.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/ComponentBase.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/ChartViewBase.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/BarLineChartViewBase.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/PieRadarChartViewBase.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/ChartDataEntryBase.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Animation/ChartAnimationEasing.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Utils/Fill.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Utils/Platform.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/Description.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Interfaces/ChartDataProvider.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Interfaces/CombinedChartDataProvider.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Interfaces/BubbleChartDataProvider.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Interfaces/BarLineScatterCandleBubbleChartDataProvider.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Interfaces/CandleChartDataProvider.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Interfaces/LineChartDataProvider.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Interfaces/BarChartDataProvider.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Interfaces/ScatterChartDataProvider.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/IMarker.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Utils/ViewPortHandler.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Utils/Transformer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Renderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/LegendRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/BarLineScatterCandleBubbleRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Scatter/IShapeRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Scatter/XShapeRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Scatter/CircleShapeRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Scatter/TriangleShapeRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Scatter/SquareShapeRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Scatter/ChevronDownShapeRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Scatter/ChevronUpShapeRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/Scatter/CrossShapeRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/LineScatterCandleRadarRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/LineRadarRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/XAxisRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/YAxisRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/CombinedChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/PieChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/BubbleChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/LineChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/CandleStickChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/BarChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/HorizontalBarChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/RadarChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/ScatterChartRenderer.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/IHighlighter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/CombinedHighlighter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/PieHighlighter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/BarHighlighter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/HorizontalBarHighlighter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/RadarHighlighter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/PieRadarHighlighter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/ChartHighlighter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Formatters/IValueFormatter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Formatters/IAxisValueFormatter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Formatters/DefaultAxisValueFormatter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Formatters/IndexAxisValueFormatter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Formatters/DefaultValueFormatter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Formatters/IFillFormatter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Formatters/DefaultFillFormatter.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Animation/Animator.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Filters/DataApproximator.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Utils/ChartColorTemplates.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/XAxis.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/YAxis.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Utils/ChartUtils.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/ChartBaseDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/ChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/IChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/PieChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/IPieChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/BubbleChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/IBubbleChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/BarLineScatterCandleBubbleChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/IBarLineScatterCandleBubbleChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/CandleChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/ICandleChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/LineChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/ILineChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/BarChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/IBarChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/RadarChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/IRadarChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/LineScatterCandleRadarChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/ILineScatterCandleRadarChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/LineRadarChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/ILineRadarChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/ScatterChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Interfaces/IScatterChartDataSet.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Highlight/Highlight.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Utils/TransformerHorizontalBarChart.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/XAxisRendererHorizontalBarChart.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/YAxisRendererHorizontalBarChart.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/XAxisRendererRadarChart.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Renderers/YAxisRendererRadarChart.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/MarkerView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/CombinedChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/PieChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/BubbleChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/LineChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/CandleStickChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/BarChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/HorizontalBarChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/RadarChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Charts/ScatterChartView.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/ChartDataEntry.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/PieChartDataEntry.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/BubbleChartDataEntry.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/CandleChartDataEntry.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/BarChartDataEntry.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Data/Implementations/Standard/RadarChartDataEntry.swift /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Charts/Source/Charts/Components/LegendEntry.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Metal.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreFoundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Users/michael/Desktop/Buildcoin/ChartTest/Pods/Target\ Support\ Files/Charts/Charts-umbrella.h /Users/michael/Desktop/Buildcoin/ChartTest/build/Pods.build/Debug-iphonesimulator/Charts.build/unextended-module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.0.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.0.sdk/System/Library/Frameworks/OpenGLES.framework/Headers/OpenGLES.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.0.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.0.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.0.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.0.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.0.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator11.0.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes
|
D
|
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric, std.container, std.range;
void main()
{
auto N = readln.chomp.to!int;
auto as = readln.split.to!(int[]);
auto a_max = as.maxElement;
if (as.all!(a => a == a_max) && a_max+1 == N) {
writeln("Yes");
return;
}
int c = a_max, n = N;
foreach (a; as) {
if (a == a_max-1) {
--c;
--n;
} else if (a != a_max) {
writeln("No");
return;
}
}
writeln(c < 1 || c*2 > n ? "No" : "Yes");
}
|
D
|
module exec.cache;
import exec.iexecprovider;
import std.typecons: Tuple;
import std.traits: ReturnType;
import std.algorithm: sort;
import vibe.core.log;
/++
Execution provider that implements caching
for an allowed white list of source code files.
+/
class Cache: IExecProvider
{
private IExecProvider realExecProvider_;
private alias ResultTuple = ReturnType!compileAndExecute;
private alias HashType = ReturnType!getSourceCodeHash;
private ResultTuple[HashType] sourceHashToOutput_;
private HashType[] allowedSources_; ///< Hash of allowed source code contents
/++
Params:
realExecProvider = the execution provider if cache
can't give the answer
sourceCodeWhitelist = raw source code only allowed
to be cached
+/
this(IExecProvider realExecProvider,
string[] sourceCodeWhitelist)
{
import std.algorithm: map;
import std.array: array;
this.realExecProvider_ = realExecProvider;
// allowedSources is no longer used
//this.allowedSources_ = sourceCodeWhitelist
//.map!(x => x.getSourceCodeHash)
//.array;
//sort(this.allowedSources_);
//assert(sourceCodeWhitelist.length == this.allowedSources_.length);
}
Tuple!(string, "output", bool, "success") compileAndExecute(RunInput input)
{
import std.range: assumeSorted;
import std.algorithm: min, canFind;
auto hash = getSourceCodeHash(input);
// allowedSources is no longer used
//if (!assumeSorted(this.allowedSources_).canFind(hash)) {
//auto result = realExecProvider_.compileAndExecute(input);
//return result;
if (auto cache = hash in sourceHashToOutput_) {
logInfo("Fetching %s from cache", input.source[0 .. min($, 20)]);
return *cache;
} else {
auto result = realExecProvider_.compileAndExecute(input);
sourceHashToOutput_[hash] = result;
return result;
}
}
Package[] installedPackages()
{
return realExecProvider_.installedPackages;
}
}
private uint getSourceCodeHash(IExecProvider.RunInput input)
{
import std.string : representation;
import std.digest.crc : CRC32;
CRC32 crc;
crc.put(input.source.representation);
crc.put(input.compiler.representation);
crc.put(input.stdin.representation);
crc.put(input.args.representation);
crc.put(input.color);
union view {
ubyte[4] source;
uint uint_;
}
view ret = cast(view) crc.finish;
return ret.uint_ ;
}
unittest
{
auto sourceCode1 = "test123";
auto sourceCode2 = "void main() {}";
auto sourceCode3 = "12838389349493";
auto getSourceCodeHash2(string source)
{
IExecProvider.RunInput input = {source: source};
return input;
}
import std.stdio: writeln;
auto hash1 = getSourceCodeHash2(sourceCode1);
writeln("hash1 = ", hash1);
auto hash2 = getSourceCodeHash2(sourceCode2);
writeln("hash2 = ", hash2);
auto hash3 = getSourceCodeHash2(sourceCode3);
writeln("hash3 = ", hash3);
assert(hash1 != hash2);
assert(hash2 != hash3);
// allowedSources is no longer used
//auto cache = new Cache(null,
//[ sourceCode1, sourceCode2, sourceCode3 ]);
//assert(cache.allowedSources_.length == 3);
//import std.algorithm: canFind;
//assert(cache.allowedSources_.canFind(hash1));
//assert(cache.allowedSources_.canFind(hash2));
//assert(cache.allowedSources_.canFind(hash3));
}
// #668 - different compilers should not use the same hash
unittest
{
import std.stdio: writeln;
IExecProvider.RunInput input;
auto hash1 = getSourceCodeHash(input);
writeln("hash1 = ", hash1);
input.source = "aa";
auto hash2 = getSourceCodeHash(input);
writeln("hash2 = ", hash2);
input.compiler = "ldc";
auto hash3 = getSourceCodeHash(input);
writeln("hash3 = ", hash3);
assert(hash1 != hash2 && hash2 != hash3 && hash1 != hash3);
IExecProvider.RunInput input2 = {
source: "aa"
};
auto hash4 = getSourceCodeHash(input2);
assert(hash4 == hash2);
}
|
D
|
/Users/pol/Projects/Skillbox/di/build/macos/Build/Intermediates.noindex/Runner.build/Debug/Runner.build/Objects-normal/x86_64/MainFlutterWindow.o : /Users/pol/Projects/Skillbox/di/macos/Runner/AppDelegate.swift /Users/pol/Projects/Skillbox/di/macos/Flutter/GeneratedPluginRegistrant.swift /Users/pol/Projects/Skillbox/di/macos/Runner/MainFlutterWindow.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/XPC.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/ObjectiveC.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreMedia.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreData.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreImage.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Combine.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/QuartzCore.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Dispatch.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Metal.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Darwin.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreLocation.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Foundation.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreFoundation.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreAudio.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreGraphics.swiftmodule/x86_64-apple-macos.swiftmodule /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/shared_preferences_macos/shared_preferences_macos.framework/Modules/shared_preferences_macos.swiftmodule/x86_64-apple-macos.swiftmodule /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/connectivity_macos/connectivity_macos.framework/Modules/connectivity_macos.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Swift.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/IOKit.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CloudKit.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/AppKit.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/SwiftOnoneSupport.swiftmodule/x86_64-apple-macos.swiftmodule /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterPluginMacOS.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterPluginRegistrarMacOS.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterMacOS.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/shared_preferences_macos/shared_preferences_macos.framework/Headers/shared_preferences_macos-umbrella.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/connectivity_macos/connectivity_macos.framework/Headers/connectivity_macos-umbrella.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/Reachability/Reachability.framework/Headers/Reachability-umbrella.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterEngine.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterTexture.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterAppDelegate.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterBinaryMessenger.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterViewController.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/connectivity_macos/connectivity_macos.framework/Headers/IPHelper.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterCodecs.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterChannels.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterMacros.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterDartProject.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/shared_preferences_macos/shared_preferences_macos.framework/Headers/shared_preferences_macos-Swift.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/connectivity_macos/connectivity_macos.framework/Headers/connectivity_macos-Swift.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/Reachability/Reachability.framework/Headers/Reachability.h /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/usr/include/mach-o/dyld.modulemap /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Modules/module.modulemap /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/shared_preferences_macos/shared_preferences_macos.framework/Modules/module.modulemap /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/connectivity_macos/connectivity_macos.framework/Modules/module.modulemap /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/Reachability/Reachability.framework/Modules/module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/usr/include/mach-o/compact_unwind_encoding.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/usr/include/xpc/XPC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreWLAN.framework/Headers/CoreWLAN.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreMedia.framework/Headers/CoreMedia.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreData.framework/Headers/CoreData.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/apinotes/Dispatch.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreLocation.framework/Headers/CoreLocation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/ApplicationServices.framework/Headers/ApplicationServices.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreAudioTypes.framework/Headers/CoreAudioTypes.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CloudKit.framework/Headers/CloudKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/AppKit.framework/Headers/AppKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
/Users/pol/Projects/Skillbox/di/build/macos/Build/Intermediates.noindex/Runner.build/Debug/Runner.build/Objects-normal/x86_64/MainFlutterWindow~partial.swiftmodule : /Users/pol/Projects/Skillbox/di/macos/Runner/AppDelegate.swift /Users/pol/Projects/Skillbox/di/macos/Flutter/GeneratedPluginRegistrant.swift /Users/pol/Projects/Skillbox/di/macos/Runner/MainFlutterWindow.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/XPC.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/ObjectiveC.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreMedia.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreData.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreImage.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Combine.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/QuartzCore.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Dispatch.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Metal.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Darwin.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreLocation.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Foundation.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreFoundation.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreAudio.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreGraphics.swiftmodule/x86_64-apple-macos.swiftmodule /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/shared_preferences_macos/shared_preferences_macos.framework/Modules/shared_preferences_macos.swiftmodule/x86_64-apple-macos.swiftmodule /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/connectivity_macos/connectivity_macos.framework/Modules/connectivity_macos.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Swift.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/IOKit.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CloudKit.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/AppKit.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/SwiftOnoneSupport.swiftmodule/x86_64-apple-macos.swiftmodule /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterPluginMacOS.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterPluginRegistrarMacOS.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterMacOS.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/shared_preferences_macos/shared_preferences_macos.framework/Headers/shared_preferences_macos-umbrella.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/connectivity_macos/connectivity_macos.framework/Headers/connectivity_macos-umbrella.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/Reachability/Reachability.framework/Headers/Reachability-umbrella.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterEngine.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterTexture.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterAppDelegate.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterBinaryMessenger.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterViewController.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/connectivity_macos/connectivity_macos.framework/Headers/IPHelper.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterCodecs.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterChannels.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterMacros.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterDartProject.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/shared_preferences_macos/shared_preferences_macos.framework/Headers/shared_preferences_macos-Swift.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/connectivity_macos/connectivity_macos.framework/Headers/connectivity_macos-Swift.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/Reachability/Reachability.framework/Headers/Reachability.h /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/usr/include/mach-o/dyld.modulemap /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Modules/module.modulemap /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/shared_preferences_macos/shared_preferences_macos.framework/Modules/module.modulemap /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/connectivity_macos/connectivity_macos.framework/Modules/module.modulemap /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/Reachability/Reachability.framework/Modules/module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/usr/include/mach-o/compact_unwind_encoding.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/usr/include/xpc/XPC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreWLAN.framework/Headers/CoreWLAN.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreMedia.framework/Headers/CoreMedia.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreData.framework/Headers/CoreData.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/apinotes/Dispatch.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreLocation.framework/Headers/CoreLocation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/ApplicationServices.framework/Headers/ApplicationServices.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreAudioTypes.framework/Headers/CoreAudioTypes.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CloudKit.framework/Headers/CloudKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/AppKit.framework/Headers/AppKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
/Users/pol/Projects/Skillbox/di/build/macos/Build/Intermediates.noindex/Runner.build/Debug/Runner.build/Objects-normal/x86_64/MainFlutterWindow~partial.swiftdoc : /Users/pol/Projects/Skillbox/di/macos/Runner/AppDelegate.swift /Users/pol/Projects/Skillbox/di/macos/Flutter/GeneratedPluginRegistrant.swift /Users/pol/Projects/Skillbox/di/macos/Runner/MainFlutterWindow.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/XPC.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/ObjectiveC.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreMedia.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreData.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreImage.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Combine.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/QuartzCore.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Dispatch.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Metal.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Darwin.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreLocation.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Foundation.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreFoundation.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreAudio.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreGraphics.swiftmodule/x86_64-apple-macos.swiftmodule /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/shared_preferences_macos/shared_preferences_macos.framework/Modules/shared_preferences_macos.swiftmodule/x86_64-apple-macos.swiftmodule /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/connectivity_macos/connectivity_macos.framework/Modules/connectivity_macos.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Swift.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/IOKit.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CloudKit.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/AppKit.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/SwiftOnoneSupport.swiftmodule/x86_64-apple-macos.swiftmodule /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterPluginMacOS.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterPluginRegistrarMacOS.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterMacOS.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/shared_preferences_macos/shared_preferences_macos.framework/Headers/shared_preferences_macos-umbrella.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/connectivity_macos/connectivity_macos.framework/Headers/connectivity_macos-umbrella.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/Reachability/Reachability.framework/Headers/Reachability-umbrella.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterEngine.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterTexture.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterAppDelegate.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterBinaryMessenger.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterViewController.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/connectivity_macos/connectivity_macos.framework/Headers/IPHelper.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterCodecs.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterChannels.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterMacros.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterDartProject.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/shared_preferences_macos/shared_preferences_macos.framework/Headers/shared_preferences_macos-Swift.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/connectivity_macos/connectivity_macos.framework/Headers/connectivity_macos-Swift.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/Reachability/Reachability.framework/Headers/Reachability.h /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/usr/include/mach-o/dyld.modulemap /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Modules/module.modulemap /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/shared_preferences_macos/shared_preferences_macos.framework/Modules/module.modulemap /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/connectivity_macos/connectivity_macos.framework/Modules/module.modulemap /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/Reachability/Reachability.framework/Modules/module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/usr/include/mach-o/compact_unwind_encoding.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/usr/include/xpc/XPC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreWLAN.framework/Headers/CoreWLAN.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreMedia.framework/Headers/CoreMedia.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreData.framework/Headers/CoreData.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/apinotes/Dispatch.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreLocation.framework/Headers/CoreLocation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/ApplicationServices.framework/Headers/ApplicationServices.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreAudioTypes.framework/Headers/CoreAudioTypes.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CloudKit.framework/Headers/CloudKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/AppKit.framework/Headers/AppKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
/Users/pol/Projects/Skillbox/di/build/macos/Build/Intermediates.noindex/Runner.build/Debug/Runner.build/Objects-normal/x86_64/MainFlutterWindow~partial.swiftsourceinfo : /Users/pol/Projects/Skillbox/di/macos/Runner/AppDelegate.swift /Users/pol/Projects/Skillbox/di/macos/Flutter/GeneratedPluginRegistrant.swift /Users/pol/Projects/Skillbox/di/macos/Runner/MainFlutterWindow.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/XPC.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/ObjectiveC.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreMedia.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreData.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreImage.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Combine.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/QuartzCore.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Dispatch.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Metal.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Darwin.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreLocation.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Foundation.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreFoundation.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreAudio.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreGraphics.swiftmodule/x86_64-apple-macos.swiftmodule /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/shared_preferences_macos/shared_preferences_macos.framework/Modules/shared_preferences_macos.swiftmodule/x86_64-apple-macos.swiftmodule /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/connectivity_macos/connectivity_macos.framework/Modules/connectivity_macos.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Swift.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/IOKit.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CloudKit.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/AppKit.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/SwiftOnoneSupport.swiftmodule/x86_64-apple-macos.swiftmodule /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterPluginMacOS.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterPluginRegistrarMacOS.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterMacOS.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/shared_preferences_macos/shared_preferences_macos.framework/Headers/shared_preferences_macos-umbrella.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/connectivity_macos/connectivity_macos.framework/Headers/connectivity_macos-umbrella.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/Reachability/Reachability.framework/Headers/Reachability-umbrella.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterEngine.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterTexture.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterAppDelegate.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterBinaryMessenger.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterViewController.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/connectivity_macos/connectivity_macos.framework/Headers/IPHelper.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterCodecs.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterChannels.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterMacros.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Headers/FlutterDartProject.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/shared_preferences_macos/shared_preferences_macos.framework/Headers/shared_preferences_macos-Swift.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/connectivity_macos/connectivity_macos.framework/Headers/connectivity_macos-Swift.h /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/Reachability/Reachability.framework/Headers/Reachability.h /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/usr/include/mach-o/dyld.modulemap /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/FlutterMacOS.framework/Modules/module.modulemap /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/shared_preferences_macos/shared_preferences_macos.framework/Modules/module.modulemap /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/connectivity_macos/connectivity_macos.framework/Modules/module.modulemap /Users/pol/Projects/Skillbox/di/build/macos/Build/Products/Debug/Reachability/Reachability.framework/Modules/module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/usr/include/mach-o/compact_unwind_encoding.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/usr/include/xpc/XPC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreWLAN.framework/Headers/CoreWLAN.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreMedia.framework/Headers/CoreMedia.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreData.framework/Headers/CoreData.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/apinotes/Dispatch.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreLocation.framework/Headers/CoreLocation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/ApplicationServices.framework/Headers/ApplicationServices.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreAudioTypes.framework/Headers/CoreAudioTypes.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CloudKit.framework/Headers/CloudKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/AppKit.framework/Headers/AppKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX11.1.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
|
D
|
///* Licensed under the Apache License, Version 2.0 (the "License");
// * you may not use this file except in compliance with the License.
// * You may obtain a copy of the License at
// *
// * http://www.apache.org/licenses/LICENSE-2.0
// *
// * Unless required by applicable law or agreed to in writing, software
// * distributed under the License is distributed on an "AS IS" BASIS,
// * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// * See the License for the specific language governing permissions and
// * limitations under the License.
// */
//
//
//import flow.common.interceptor.CommandContext;
//
//import com.fasterxml.jackson.databind.node.ObjectNode;
//
//abstract class AbstractNeedsHistoricActivityHistoryJsonTransformer : AbstractHistoryJsonTransformer {
//
// override
// public bool isApplicable(ObjectNode historicalData, CommandContext commandContext) {
// return historicActivityInstanceExistsForDataIncludingFinished(historicalData, commandContext);
// }
//
//}
|
D
|
module graphics.frameBuffer;
import graphics.image;
import graphics.color;
import math.matrix;
import std.stdio;
class FrameBuffer : Image
{
private bool alphaBlending = true;
private bool depthCheck = true;
public float[] depthBuffer;
public this(int w, int h, bool alpha, bool depth)
{
alphaBlending = alpha;
depthCheck = depth;
if(depth)
{
depthBuffer = new float[w*h];
clearDepth();
}
super(w, h);
}
override public void setPixel3D(vec3 p, Color c)
{
int x = cast(int) p.x;
int y = cast(int) p.y;
if(depthCheck)
{
if(depth(x,y) < p.z)
{
if(alphaBlending)
{
m_data[x + y*m_width] = alphaBlend(c, m_data[x + y*m_width]);
}
else
{
m_data[x + y*m_width] = c;
}
depth(x,y) = p.z;
}
}
else
{
if(alphaBlending)
{
m_data[x + y*m_width] = alphaBlend(c, m_data[x + y*m_width]);
}
else
{
m_data[x + y*m_width] = c;
}
}
}
public ref depth(int x, int y)
{
return depthBuffer[x + y*m_width];
}
public float depthLookupNearest(vec2 uv)
{
import std.math;
int w,h;
w = this.Width;
h = this.Height;
float inBounds(int xl, int yl)
{
if(xl < 0 || yl < 0 || xl >= w || yl >= h) return float.infinity;
return depth(xl,yl);
}
float u = uv.x;
float v = uv.y;
float x = (u*(w/2.0f) + (w/2.0f));
float y = (v*(h/2.0f) + (h/2.0f));
int ix = cast(int)x;
int iy = cast(int)y;
return inBounds(ix,iy);
}
public void clearDepth()
{
for(int i = 0; i < m_width*m_height; i++) depthBuffer[i] = -float.infinity;
}
}
|
D
|
module android.java.java.lang.reflect.MalformedParametersException;
public import android.java.java.lang.reflect.MalformedParametersException_d_interface;
import arsd.jni : ImportExportImpl;
mixin ImportExportImpl!MalformedParametersException;
import import4 = android.java.java.lang.Class;
import import3 = android.java.java.lang.StackTraceElement;
import import0 = android.java.java.lang.JavaThrowable;
|
D
|
module UnrealScript.TribesGame.TrAccolade_NoJoy;
import ScriptClasses;
import UnrealScript.Helpers;
import UnrealScript.TribesGame.TrAccolade;
extern(C++) interface TrAccolade_NoJoy : TrAccolade
{
public extern(D):
private static __gshared ScriptClass mStaticClass;
@property final static ScriptClass StaticClass() { mixin(MGSCC("Class TribesGame.TrAccolade_NoJoy")); }
private static __gshared TrAccolade_NoJoy mDefaultProperties;
@property final static TrAccolade_NoJoy DefaultProperties() { mixin(MGDPC("TrAccolade_NoJoy", "TrAccolade_NoJoy TribesGame.Default__TrAccolade_NoJoy")); }
}
|
D
|
/**
* Copyright: <a href="http://www.boost.org/LICENSE_1_0.txt">Boost License 1.0</a>.
* Authors: $(LINK2 http://cattermole.co.nz, Richard Andrew Cattermole)
*/
module cf.spew.events.windowing;
import cf.spew.events.defs;
///
enum Windowing_Events_Types {
/// Prefix to determine if it is standard windowing types
Prefix = EventType.from("w_"),
///
Window_Moved = EventType.from("w_moved"),
///
Window_Resized = EventType.from("w_resize"),
///
Window_Focused = EventType.from("w_focus"),
///
Window_CursorMoved = EventType.from("w_curmvd"),
///
Window_CursorAction = EventType.from("w_curac"),
///
Window_CursorActionEnd = EventType.from("w_/curac"),
///
Window_CursorActionDo = EventType.from("w_!curac"),
///
Window_CursorScroll = EventType.from("w_cursc"),
///
Window_KeyDown = EventType.from("w_kdw"),
///
Window_KeyUp = EventType.from("w_k/dw"),
///
Window_KeyInput = EventType.from("w_ki"),
///
Window_RequestClose = EventType.from("w_reqclo"),
}
///
union Windowing_Events {
///
Windowing_Event_Cursor_Action cursorAction;
///
Windowing_Event_Moved cursorMoved;
///
Windowing_Event_Scroll scroll;
///
Windowing_Event_Resized windowResized;
///
Windowing_Event_Moved windowMoved;
///
Windowing_Event_Moved stoppedMoving;
///
Windowing_Event_Key keyDown;
///
Windowing_Event_Key keyUp;
/// singular event aka press
Windowing_Event_Key keyInput;
}
///
struct Windowing_Event_Moved {
///
int newX, newY;
}
///
struct Windowing_Event_Cursor_Action {
///
int x, y;
///
CursorEventAction action;
///
bool isDoubleClick;
}
///
struct Windowing_Event_Scroll {
///
int x, y;
///
int amount;
}
///
struct Windowing_Event_Resized {
///
uint newWidth, newHeight;
}
///
struct Windowing_Event_Key {
///
dchar key;
/// See_Also: KeyModifiers
ushort modifiers;
///
SpecialKey special;
}
///
enum CursorEventAction {
/**
* Triggered when the left mouse button is clicked when backed by a mouse.
*/
Select,
/**
* Triggered when the right mouse button is clicked when backed by a mouse.
*/
Alter,
/**
* Triggered when the middle mouse button is clicked when backed by a mouse.
*/
ViewChange
}
///
enum KeyModifiers : ushort {
///
None = 0,
///
Control = 1 << 1,
///
LControl = Control | (1 << 2),
///
RControl = Control | (1 << 3),
///
Alt = 1 << 4,
///
LAlt = Alt | (1 << 5),
///
RAlt = Alt | (1 << 6),
///
Shift = 1 << 7,
///
LShift = Shift | (1 << 8),
///
RShift = Shift | (1 << 9),
///
Super = 1 << 10,
///
LSuper = Super | (1 << 11),
///
RSuper = Super | (1 << 12),
///
Capslock = 1 << 13,
///
Numlock = 1 << 14
}
///
enum SpecialKey {
///
None,
///
F1,
///
F2,
///
F3,
///
F4,
///
F5,
///
F6,
///
F7,
///
F8,
///
F9,
///
F10,
///
F11,
///
F12,
///
F13,
///
F14,
///
F15,
///
F16,
///
F17,
///
F18,
///
F19,
///
F20,
///
F21,
///
F22,
///
F23,
///
F24,
///
Escape,
///
Enter,
///
Backspace,
///
Tab,
///
PageUp,
///
PageDown,
///
End,
///
Home,
///
Insert,
///
Delete,
///
Pause,
///
LeftArrow,
///
RightArrow,
///
UpArrow,
///
DownArrow,
///
ScrollLock
}
|
D
|
PLONG PLAT ED95 KD LOMAGAGE HIMAGAGE SLAT SLONG RESULTNO DP DM WT ROCKTYPE
292.5 65.5 1.60000002 262.700012 34 39 -38.7999992 143.399994 7097 2.5 2.5 0.697163631 sediments, red-brown clays
264.399994 75 15.6000004 0 2 65 -8.80000019 126.699997 1206 10.3999996 18 0.307014128 extrusives, intrusives
346 61 9 41.2000008 35 100 -31.3999996 138.600006 1170 13 15 0.425327413 sediments
333 45 9 16.5 35 100 -30.3999996 139.399994 1161 17 18 0.425327413 sediments, tillite
317 57 5 200 35 100 -30.5 139.300003 1165 9 10 0.480672042 sediments, redbeds
329 58 25 4.0999999 35 100 -30.2000008 139 1166 41.5999985 45.5999985 0.132368412 sediments, sandstone, tillite
349.5 78.1999969 4.69999981 999.900024 5 35 -36.0999985 149.100006 1153 6.0999999 7.5999999 0.492714916 sediments, weathered volcanics
223 26 13 14.8000002 35 100 -30.2999992 139.5 1157 26 26 0.351146086 extrusives
320 63 9 15.5 34 65 -38 145.5 1854 16 16 0.44989317 extrusives
317 63 14 16 23 56 -32.5 151 1840 20 20 0.353755618 extrusives, basalts
302.700012 66.8000031 6.80000019 35 34 65 -38 145.5 1819 10.8000002 12.1000004 0.483431822 extrusives
305 73 17 29 23 56 -42 147 1821 25 29 0.293364012 extrusives, basalts
275.5 71.0999985 3.5 45.5 33 36 -31.7000008 150.199997 1891 4.80000019 4.80000019 0.819905815 extrusives
236.600006 78.5 18.0739223 7.5 0 35 -17.2000008 131.5 1894 0 0 0.256223878 sediments, red mudstones
274 66 27.6000004 8.60000038 25 65 -41.2999992 145.899994 1873 39.7999992 46.9000015 0.117001791 intrusives, granite
321 64 6 27.5 25 65 -35.5999985 137.5 1874 10 11 0.486558173 sediments
294 75 11 7 25 65 -41.0999985 146.100006 1871 16.2999992 18.8999996 0.407114083 sediments, sandstone
315 66 10.5 18 25 65 -41 145.5 1872 18.2000008 19.6000004 0.416352269 extrusives, sediments
295.100006 74.0999985 5.19999981 0 23 35 -27 143 1971 6.5999999 6.5999999 0.512507081 sediments, weathered
298 58.7999992 2.4000001 0 35 65 -27 141.5 1972 3.79999995 3.79999995 0.510307452 sediments, weathered
272.399994 68.9000015 4.30000019 0 25 35 -35 150 1926 4.30000019 4.30000019 0.529871906 extrusives, basalts
|
D
|
/*
* wincon.d
*
* This module binds WinCon.h to D. The original copyright notice is preserved
* below.
*
* Author: Dave Wilkinson
* Originated: November 25th, 2009
*
*/
module binding.win32.wincon;
import binding.win32.windef;
import binding.win32.winnt;
import binding.win32.wingdi;
import binding.win32.winbase;
extern(System):
/*++ BUILD Version: 0002 // Increment this if a change has global effects
Copyright (c) Microsoft Corporation. All rights reserved.
Module Name:
wincon.h
Abstract:
This module contains the public data structures, data types,
and procedures exported by the NT console subsystem.
Created:
26-Oct-1990
Revision History:
--*/
struct COORD {
SHORT X;
SHORT Y;
}
alias COORD* PCOORD;
struct SMALL_RECT {
SHORT Left;
SHORT Top;
SHORT Right;
SHORT Bottom;
}
alias SMALL_RECT* PSMALL_RECT;
struct KEY_EVENT_RECORD {
BOOL bKeyDown;
WORD wRepeatCount;
WORD wVirtualKeyCode;
WORD wVirtualScanCode;
union _inner_union {
WCHAR UnicodeChar;
CHAR AsciiChar;
}
_inner_union uChar;
DWORD dwControlKeyState;
}
alias KEY_EVENT_RECORD* PKEY_EVENT_RECORD;
//
// ControlKeyState flags
//
const auto RIGHT_ALT_PRESSED = 0x0001; // the right alt key is pressed.
const auto LEFT_ALT_PRESSED = 0x0002; // the left alt key is pressed.
const auto RIGHT_CTRL_PRESSED = 0x0004; // the right ctrl key is pressed.
const auto LEFT_CTRL_PRESSED = 0x0008; // the left ctrl key is pressed.
const auto SHIFT_PRESSED = 0x0010; // the shift key is pressed.
const auto NUMLOCK_ON = 0x0020; // the numlock light is on.
const auto SCROLLLOCK_ON = 0x0040; // the scrolllock light is on.
const auto CAPSLOCK_ON = 0x0080; // the capslock light is on.
const auto ENHANCED_KEY = 0x0100; // the key is enhanced.
const auto NLS_DBCSCHAR = 0x00010000; // DBCS for JPN: SBCS/DBCS mode.
const auto NLS_ALPHANUMERIC = 0x00000000; // DBCS for JPN: Alphanumeric mode.
const auto NLS_KATAKANA = 0x00020000; // DBCS for JPN: Katakana mode.
const auto NLS_HIRAGANA = 0x00040000; // DBCS for JPN: Hiragana mode.
const auto NLS_ROMAN = 0x00400000; // DBCS for JPN: Roman/Noroman mode.
const auto NLS_IME_CONVERSION = 0x00800000; // DBCS for JPN: IME conversion.
const auto NLS_IME_DISABLE = 0x20000000; // DBCS for JPN: IME enable/disable.
struct MOUSE_EVENT_RECORD {
COORD dwMousePosition;
DWORD dwButtonState;
DWORD dwControlKeyState;
DWORD dwEventFlags;
}
alias MOUSE_EVENT_RECORD* PMOUSE_EVENT_RECORD;
//
// ButtonState flags
//
const auto FROM_LEFT_1ST_BUTTON_PRESSED = 0x0001;
const auto RIGHTMOST_BUTTON_PRESSED = 0x0002;
const auto FROM_LEFT_2ND_BUTTON_PRESSED = 0x0004;
const auto FROM_LEFT_3RD_BUTTON_PRESSED = 0x0008;
const auto FROM_LEFT_4TH_BUTTON_PRESSED = 0x0010;
//
// EventFlags
//
const auto MOUSE_MOVED = 0x0001;
const auto DOUBLE_CLICK = 0x0002;
const auto MOUSE_WHEELED = 0x0004;
const auto MOUSE_HWHEELED = 0x0008;
struct WINDOW_BUFFER_SIZE_RECORD {
COORD dwSize;
}
alias WINDOW_BUFFER_SIZE_RECORD* PWINDOW_BUFFER_SIZE_RECORD;
struct MENU_EVENT_RECORD {
UINT dwCommandId;
}
alias MENU_EVENT_RECORD* PMENU_EVENT_RECORD;
struct FOCUS_EVENT_RECORD {
BOOL bSetFocus;
}
alias FOCUS_EVENT_RECORD* PFOCUS_EVENT_RECORD;
struct INPUT_RECORD {
WORD EventType;
union _inner_union {
KEY_EVENT_RECORD KeyEvent;
MOUSE_EVENT_RECORD MouseEvent;
WINDOW_BUFFER_SIZE_RECORD WindowBufferSizeEvent;
MENU_EVENT_RECORD MenuEvent;
FOCUS_EVENT_RECORD FocusEvent;
}
_inner_union Event;
}
alias INPUT_RECORD* PINPUT_RECORD;
//
// EventType flags:
//
const auto KEY_EVENT = 0x0001; // Event contains key event record
const auto MOUSE_EVENT = 0x0002; // Event contains mouse event record
const auto WINDOW_BUFFER_SIZE_EVENT = 0x0004; // Event contains window change event record
const auto MENU_EVENT = 0x0008; // Event contains menu event record
const auto FOCUS_EVENT = 0x0010; // event contains focus change
struct CHAR_INFO {
union _inner_union {
WCHAR UnicodeChar;
CHAR AsciiChar;
}
_inner_union Char;
WORD Attributes;
}
alias CHAR_INFO* PCHAR_INFO;
//
// Attributes flags:
//
const auto FOREGROUND_BLUE = 0x0001; // text color contains blue.
const auto FOREGROUND_GREEN = 0x0002; // text color contains green.
const auto FOREGROUND_RED = 0x0004; // text color contains red.
const auto FOREGROUND_INTENSITY = 0x0008; // text color is intensified.
const auto BACKGROUND_BLUE = 0x0010; // background color contains blue.
const auto BACKGROUND_GREEN = 0x0020; // background color contains green.
const auto BACKGROUND_RED = 0x0040; // background color contains red.
const auto BACKGROUND_INTENSITY = 0x0080; // background color is intensified.
const auto COMMON_LVB_LEADING_BYTE = 0x0100; // Leading Byte of DBCS
const auto COMMON_LVB_TRAILING_BYTE = 0x0200; // Trailing Byte of DBCS
const auto COMMON_LVB_GRID_HORIZONTAL = 0x0400; // DBCS: Grid attribute: top horizontal.
const auto COMMON_LVB_GRID_LVERTICAL = 0x0800; // DBCS: Grid attribute: left vertical.
const auto COMMON_LVB_GRID_RVERTICAL = 0x1000; // DBCS: Grid attribute: right vertical.
const auto COMMON_LVB_REVERSE_VIDEO = 0x4000; // DBCS: Reverse fore/back ground attribute.
const auto COMMON_LVB_UNDERSCORE = 0x8000; // DBCS: Underscore.
const auto COMMON_LVB_SBCSDBCS = 0x0300; // SBCS or DBCS flag.
struct CONSOLE_SCREEN_BUFFER_INFO {
COORD dwSize;
COORD dwCursorPosition;
WORD wAttributes;
SMALL_RECT srWindow;
COORD dwMaximumWindowSize;
}
alias CONSOLE_SCREEN_BUFFER_INFO* PCONSOLE_SCREEN_BUFFER_INFO;
struct CONSOLE_SCREEN_BUFFER_INFOEX {
ULONG cbSize;
COORD dwSize;
COORD dwCursorPosition;
WORD wAttributes;
SMALL_RECT srWindow;
COORD dwMaximumWindowSize;
WORD wPopupAttributes;
BOOL bFullscreenSupported;
COLORREF ColorTable[16];
}
alias CONSOLE_SCREEN_BUFFER_INFOEX* PCONSOLE_SCREEN_BUFFER_INFOEX;
struct CONSOLE_CURSOR_INFO {
DWORD dwSize;
BOOL bVisible;
}
alias CONSOLE_CURSOR_INFO* PCONSOLE_CURSOR_INFO;
struct CONSOLE_FONT_INFO {
DWORD nFont;
COORD dwFontSize;
}
alias CONSOLE_FONT_INFO* PCONSOLE_FONT_INFO;
version(NOGDI) {
}
else {
struct CONSOLE_FONT_INFOEX {
ULONG cbSize;
DWORD nFont;
COORD dwFontSize;
UINT FontFamily;
UINT FontWeight;
WCHAR[LF_FACESIZE] FaceName;
}
alias CONSOLE_FONT_INFOEX* PCONSOLE_FONT_INFOEX;
}
const auto HISTORY_NO_DUP_FLAG = 0x1;
struct CONSOLE_HISTORY_INFO {
UINT cbSize;
UINT HistoryBufferSize;
UINT NumberOfHistoryBuffers;
DWORD dwFlags;
}
alias CONSOLE_HISTORY_INFO* PCONSOLE_HISTORY_INFO;
struct CONSOLE_SELECTION_INFO {
DWORD dwFlags;
COORD dwSelectionAnchor;
SMALL_RECT srSelection;
}
alias CONSOLE_SELECTION_INFO* PCONSOLE_SELECTION_INFO;
//
// Selection flags
//
const auto CONSOLE_NO_SELECTION = 0x0000;
const auto CONSOLE_SELECTION_IN_PROGRESS = 0x0001; // selection has begun
const auto CONSOLE_SELECTION_NOT_EMPTY = 0x0002; // non-null select rectangle
const auto CONSOLE_MOUSE_SELECTION = 0x0004; // selecting with mouse
const auto CONSOLE_MOUSE_DOWN = 0x0008; // mouse is down
//
// alias for ctrl-c handler routines
//
alias BOOL function(DWORD CtrlType) PHANDLER_ROUTINE;
const auto CTRL_C_EVENT = 0;
const auto CTRL_BREAK_EVENT = 1;
const auto CTRL_CLOSE_EVENT = 2;
// 3 is reserved!
// 4 is reserved!
const auto CTRL_LOGOFF_EVENT = 5;
const auto CTRL_SHUTDOWN_EVENT = 6;
//
// Input Mode flags:
//
const auto ENABLE_PROCESSED_INPUT = 0x0001;
const auto ENABLE_LINE_INPUT = 0x0002;
const auto ENABLE_ECHO_INPUT = 0x0004;
const auto ENABLE_WINDOW_INPUT = 0x0008;
const auto ENABLE_MOUSE_INPUT = 0x0010;
const auto ENABLE_INSERT_MODE = 0x0020;
const auto ENABLE_QUICK_EDIT_MODE = 0x0040;
const auto ENABLE_EXTENDED_FLAGS = 0x0080;
const auto ENABLE_AUTO_POSITION = 0x0100;
//
// Output Mode flags:
//
const auto ENABLE_PROCESSED_OUTPUT = 0x0001;
const auto ENABLE_WRAP_AT_EOL_OUTPUT = 0x0002;
//
// direct API definitions.
//
BOOL PeekConsoleInputA(
HANDLE hConsoleInput,
PINPUT_RECORD lpBuffer,
DWORD nLength,
LPDWORD lpNumberOfEventsRead
);
BOOL PeekConsoleInputW(
HANDLE hConsoleInput,
PINPUT_RECORD lpBuffer,
DWORD nLength,
LPDWORD lpNumberOfEventsRead
);
version(UNICODE) {
alias PeekConsoleInputW PeekConsoleInput;
}
else {
alias PeekConsoleInputA PeekConsoleInput;
}
BOOL ReadConsoleInputA(
HANDLE hConsoleInput,
PINPUT_RECORD lpBuffer,
DWORD nLength,
LPDWORD lpNumberOfEventsRead
);
BOOL ReadConsoleInputW(
HANDLE hConsoleInput,
PINPUT_RECORD lpBuffer,
DWORD nLength,
LPDWORD lpNumberOfEventsRead
);
version(UNICODE) {
alias ReadConsoleInputW ReadConsoleInput;
}
else {
alias ReadConsoleInputA ReadConsoleInput;
}
BOOL WriteConsoleInputA(
HANDLE hConsoleInput,
INPUT_RECORD *lpBuffer,
DWORD nLength,
LPDWORD lpNumberOfEventsWritten
);
BOOL WriteConsoleInputW(
HANDLE hConsoleInput,
INPUT_RECORD *lpBuffer,
DWORD nLength,
LPDWORD lpNumberOfEventsWritten
);
version(UNICODE) {
alias WriteConsoleInputW WriteConsoleInput;
}
else {
alias WriteConsoleInputA WriteConsoleInput;
}
BOOL ReadConsoleOutputA(
HANDLE hConsoleOutput,
PCHAR_INFO lpBuffer,
COORD dwBufferSize,
COORD dwBufferCoord,
PSMALL_RECT lpReadRegion
);
BOOL ReadConsoleOutputW(
HANDLE hConsoleOutput,
PCHAR_INFO lpBuffer,
COORD dwBufferSize,
COORD dwBufferCoord,
PSMALL_RECT lpReadRegion
);
version(UNICODE) {
alias ReadConsoleOutputW ReadConsoleOutput;
}
else {
alias ReadConsoleOutputA ReadConsoleOutput;
}
BOOL WriteConsoleOutputA(
HANDLE hConsoleOutput,
CHAR_INFO *lpBuffer,
COORD dwBufferSize,
COORD dwBufferCoord,
PSMALL_RECT lpWriteRegion
);
BOOL WriteConsoleOutputW(
HANDLE hConsoleOutput,
CHAR_INFO *lpBuffer,
COORD dwBufferSize,
COORD dwBufferCoord,
PSMALL_RECT lpWriteRegion
);
version(UNICODE) {
alias WriteConsoleOutputW WriteConsoleOutput;
}
else {
alias WriteConsoleOutputA WriteConsoleOutput;
}
BOOL ReadConsoleOutputCharacterA(
HANDLE hConsoleOutput,
LPSTR lpCharacter,
DWORD nLength,
COORD dwReadCoord,
LPDWORD lpNumberOfCharsRead
);
BOOL ReadConsoleOutputCharacterW(
HANDLE hConsoleOutput,
LPWSTR lpCharacter,
DWORD nLength,
COORD dwReadCoord,
LPDWORD lpNumberOfCharsRead
);
version(UNICODE) {
alias ReadConsoleOutputCharacterW ReadConsoleOutputCharacter;
}
else {
alias ReadConsoleOutputCharacterA ReadConsoleOutputCharacter;
}
BOOL ReadConsoleOutputAttribute(
HANDLE hConsoleOutput,
LPWORD lpAttribute,
DWORD nLength,
COORD dwReadCoord,
LPDWORD lpNumberOfAttrsRead
);
BOOL WriteConsoleOutputCharacterA(
HANDLE hConsoleOutput,
LPCSTR lpCharacter,
DWORD nLength,
COORD dwWriteCoord,
LPDWORD lpNumberOfCharsWritten
);
BOOL WriteConsoleOutputCharacterW(
HANDLE hConsoleOutput,
LPCWSTR lpCharacter,
DWORD nLength,
COORD dwWriteCoord,
LPDWORD lpNumberOfCharsWritten
);
version(UNICODE) {
alias WriteConsoleOutputCharacterW WriteConsoleOutputCharacter;
}
else {
alias WriteConsoleOutputCharacterA WriteConsoleOutputCharacter;
}
BOOL WriteConsoleOutputAttribute(
HANDLE hConsoleOutput,
WORD *lpAttribute,
DWORD nLength,
COORD dwWriteCoord,
LPDWORD lpNumberOfAttrsWritten
);
BOOL FillConsoleOutputCharacterA(
HANDLE hConsoleOutput,
CHAR cCharacter,
DWORD nLength,
COORD dwWriteCoord,
LPDWORD lpNumberOfCharsWritten
);
BOOL FillConsoleOutputCharacterW(
HANDLE hConsoleOutput,
WCHAR cCharacter,
DWORD nLength,
COORD dwWriteCoord,
LPDWORD lpNumberOfCharsWritten
);
version(UNICODE) {
alias FillConsoleOutputCharacterW FillConsoleOutputCharacter;
}
else {
alias FillConsoleOutputCharacterA FillConsoleOutputCharacter;
}
BOOL FillConsoleOutputAttribute(
HANDLE hConsoleOutput,
WORD wAttribute,
DWORD nLength,
COORD dwWriteCoord,
LPDWORD lpNumberOfAttrsWritten
);
BOOL GetConsoleMode(
HANDLE hConsoleHandle,
LPDWORD lpMode
);
BOOL GetNumberOfConsoleInputEvents(
HANDLE hConsoleInput,
LPDWORD lpNumberOfEvents
);
const HANDLE CONSOLE_REAL_OUTPUT_HANDLE = (cast(HANDLE)(-2));
const HANDLE CONSOLE_REAL_INPUT_HANDLE = (cast(HANDLE)(-3));
BOOL GetConsoleScreenBufferInfo(
HANDLE hConsoleOutput,
PCONSOLE_SCREEN_BUFFER_INFO lpConsoleScreenBufferInfo
);
BOOL GetConsoleScreenBufferInfoEx(
HANDLE hConsoleOutput,
PCONSOLE_SCREEN_BUFFER_INFOEX lpConsoleScreenBufferInfoEx);
BOOL SetConsoleScreenBufferInfoEx(
HANDLE hConsoleOutput,
PCONSOLE_SCREEN_BUFFER_INFOEX lpConsoleScreenBufferInfoEx);
COORD GetLargestConsoleWindowSize(
HANDLE hConsoleOutput
);
BOOL GetConsoleCursorInfo(
HANDLE hConsoleOutput,
PCONSOLE_CURSOR_INFO lpConsoleCursorInfo
);
BOOL GetCurrentConsoleFont(
HANDLE hConsoleOutput,
BOOL bMaximumWindow,
PCONSOLE_FONT_INFO lpConsoleCurrentFont
);
version(NOGDI) {
}
else {
BOOL GetCurrentConsoleFontEx(
HANDLE hConsoleOutput,
BOOL bMaximumWindow,
PCONSOLE_FONT_INFOEX lpConsoleCurrentFontEx);
BOOL SetCurrentConsoleFontEx(
HANDLE hConsoleOutput,
BOOL bMaximumWindow,
PCONSOLE_FONT_INFOEX lpConsoleCurrentFontEx);
}
BOOL GetConsoleHistoryInfo(
PCONSOLE_HISTORY_INFO lpConsoleHistoryInfo);
BOOL SetConsoleHistoryInfo(
PCONSOLE_HISTORY_INFO lpConsoleHistoryInfo);
COORD GetConsoleFontSize(
HANDLE hConsoleOutput,
DWORD nFont
);
BOOL GetConsoleSelectionInfo(
PCONSOLE_SELECTION_INFO lpConsoleSelectionInfo
);
BOOL GetNumberOfConsoleMouseButtons(
LPDWORD lpNumberOfMouseButtons
);
BOOL SetConsoleMode(
HANDLE hConsoleHandle,
DWORD dwMode
);
BOOL SetConsoleActiveScreenBuffer(
HANDLE hConsoleOutput
);
BOOL FlushConsoleInputBuffer(
HANDLE hConsoleInput
);
BOOL SetConsoleScreenBufferSize(
HANDLE hConsoleOutput,
COORD dwSize
);
BOOL SetConsoleCursorPosition(
HANDLE hConsoleOutput,
COORD dwCursorPosition
);
BOOL SetConsoleCursorInfo(
HANDLE hConsoleOutput,
CONSOLE_CURSOR_INFO *lpConsoleCursorInfo
);
BOOL ScrollConsoleScreenBufferA(
HANDLE hConsoleOutput,
SMALL_RECT *lpScrollRectangle,
SMALL_RECT *lpClipRectangle,
COORD dwDestinationOrigin,
CHAR_INFO *lpFill
);
BOOL ScrollConsoleScreenBufferW(
HANDLE hConsoleOutput,
SMALL_RECT *lpScrollRectangle,
SMALL_RECT *lpClipRectangle,
COORD dwDestinationOrigin,
CHAR_INFO *lpFill
);
version(UNICODE) {
alias ScrollConsoleScreenBufferW ScrollConsoleScreenBuffer;
}
else {
alias ScrollConsoleScreenBufferA ScrollConsoleScreenBuffer;
}
BOOL SetConsoleWindowInfo(
HANDLE hConsoleOutput,
BOOL bAbsolute,
SMALL_RECT *lpConsoleWindow
);
BOOL SetConsoleTextAttribute(
HANDLE hConsoleOutput,
WORD wAttributes
);
BOOL SetConsoleCtrlHandler(
PHANDLER_ROUTINE HandlerRoutine,
BOOL Add);
BOOL GenerateConsoleCtrlEvent(
DWORD dwCtrlEvent,
DWORD dwProcessGroupId
);
BOOL AllocConsole();
BOOL FreeConsole();
BOOL AttachConsole(
DWORD dwProcessId
);
const auto ATTACH_PARENT_PROCESS = (cast(DWORD)-1);
DWORD GetConsoleTitleA(
LPSTR lpConsoleTitle,
DWORD nSize
);
DWORD GetConsoleTitleW(
LPWSTR lpConsoleTitle,
DWORD nSize
);
version(UNICODE) {
alias GetConsoleTitleW GetConsoleTitle;
}
else {
alias GetConsoleTitleA GetConsoleTitle;
}
DWORD GetConsoleOriginalTitleA(
LPSTR lpConsoleTitle,
DWORD nSize);
DWORD GetConsoleOriginalTitleW(
LPWSTR lpConsoleTitle,
DWORD nSize);
version(UNICODE) {
alias GetConsoleOriginalTitleW GetConsoleOriginalTitle;
}
else {
alias GetConsoleOriginalTitleA GetConsoleOriginalTitle;
}
BOOL SetConsoleTitleA(
LPCSTR lpConsoleTitle
);
BOOL SetConsoleTitleW(
LPCWSTR lpConsoleTitle
);
version(UNICODE) {
alias SetConsoleTitleW SetConsoleTitle;
}
else {
alias SetConsoleTitleA SetConsoleTitle;
}
struct CONSOLE_READCONSOLE_CONTROL {
ULONG nLength; // sizeof( CONSOLE_READCONSOLE_CONTROL )
ULONG nInitialChars;
ULONG dwCtrlWakeupMask;
ULONG dwControlKeyState;
}
alias CONSOLE_READCONSOLE_CONTROL* PCONSOLE_READCONSOLE_CONTROL;
BOOL ReadConsoleA(
HANDLE hConsoleInput,
LPVOID lpBuffer,
DWORD nNumberOfCharsToRead,
LPDWORD lpNumberOfCharsRead,
PCONSOLE_READCONSOLE_CONTROL pInputControl
);
BOOL ReadConsoleW(
HANDLE hConsoleInput,
LPVOID lpBuffer,
DWORD nNumberOfCharsToRead,
LPDWORD lpNumberOfCharsRead,
PCONSOLE_READCONSOLE_CONTROL pInputControl
);
version(UNICODE) {
alias ReadConsoleW ReadConsole;
}
else {
alias ReadConsoleA ReadConsole;
}
BOOL WriteConsoleA(
HANDLE hConsoleOutput,
VOID *lpBuffer,
DWORD nNumberOfCharsToWrite,
LPDWORD lpNumberOfCharsWritten,
LPVOID lpReserved
);
BOOL WriteConsoleW(
HANDLE hConsoleOutput,
VOID *lpBuffer,
DWORD nNumberOfCharsToWrite,
LPDWORD lpNumberOfCharsWritten,
LPVOID lpReserved
);
version(UNICODE) {
alias WriteConsoleW WriteConsole;
}
else {
alias WriteConsoleA WriteConsole;
}
const auto CONSOLE_TEXTMODE_BUFFER = 1;
HANDLE CreateConsoleScreenBuffer(
DWORD dwDesiredAccess,
DWORD dwShareMode,
SECURITY_ATTRIBUTES *lpSecurityAttributes,
DWORD dwFlags,
LPVOID lpScreenBufferData
);
UINT GetConsoleCP();
BOOL SetConsoleCP(
UINT wCodePageID
);
UINT GetConsoleOutputCP();
BOOL SetConsoleOutputCP(
UINT wCodePageID
);
const auto CONSOLE_FULLSCREEN = 1; // fullscreen console
const auto CONSOLE_FULLSCREEN_HARDWARE = 2; // console owns the hardware
BOOL GetConsoleDisplayMode(
LPDWORD lpModeFlags);
const auto CONSOLE_FULLSCREEN_MODE = 1;
const auto CONSOLE_WINDOWED_MODE = 2;
BOOL SetConsoleDisplayMode(
HANDLE hConsoleOutput,
DWORD dwFlags,
PCOORD lpNewScreenBufferDimensions);
HWND GetConsoleWindow();
DWORD GetConsoleProcessList(
LPDWORD lpdwProcessList,
DWORD dwProcessCount);
//
// Aliasing apis.
//
BOOL AddConsoleAliasA(
LPSTR Source,
LPSTR Target,
LPSTR ExeName);
BOOL AddConsoleAliasW(
LPWSTR Source,
LPWSTR Target,
LPWSTR ExeName);
version(UNICODE) {
alias AddConsoleAliasW AddConsoleAlias;
}
else {
alias AddConsoleAliasA AddConsoleAlias;
}
DWORD GetConsoleAliasA(
LPSTR Source,
LPSTR TargetBuffer,
DWORD TargetBufferLength,
LPSTR ExeName);
DWORD GetConsoleAliasW(
LPWSTR Source,
LPWSTR TargetBuffer,
DWORD TargetBufferLength,
LPWSTR ExeName);
version(UNICODE) {
alias GetConsoleAliasW GetConsoleAlias;
}
else {
alias GetConsoleAliasA GetConsoleAlias;
}
DWORD GetConsoleAliasesLengthA(
LPSTR ExeName);
DWORD GetConsoleAliasesLengthW(
LPWSTR ExeName);
version(UNICODE) {
alias GetConsoleAliasesLengthW GetConsoleAliasesLength;
}
else {
alias GetConsoleAliasesLengthA GetConsoleAliasesLength;
}
DWORD GetConsoleAliasExesLengthA();
DWORD GetConsoleAliasExesLengthW();
version(UNICODE) {
alias GetConsoleAliasExesLengthW GetConsoleAliasExesLength;
}
else {
alias GetConsoleAliasExesLengthA GetConsoleAliasExesLength;
}
DWORD GetConsoleAliasesA(
LPSTR AliasBuffer,
DWORD AliasBufferLength,
LPSTR ExeName);
DWORD GetConsoleAliasesW(
LPWSTR AliasBuffer,
DWORD AliasBufferLength,
LPWSTR ExeName);
version(UNICODE) {
alias GetConsoleAliasesW GetConsoleAliases;
}
else {
alias GetConsoleAliasesA GetConsoleAliases;
}
DWORD GetConsoleAliasExesA(
LPSTR ExeNameBuffer,
DWORD ExeNameBufferLength);
DWORD GetConsoleAliasExesW(
LPWSTR ExeNameBuffer,
DWORD ExeNameBufferLength);
version(UNICODE) {
alias GetConsoleAliasExesW GetConsoleAliasExes;
}
else {
alias GetConsoleAliasExesA GetConsoleAliasExes;
}
|
D
|
/++
Contains functions that might be useful in making new widgets,
like for formatting text.
+/
module qui.utils;
import utils.baseconv;
import utils.misc;
import std.conv : to;
/// To scroll a line, by an xOffset
///
/// Can be used to scroll to right, or to left (by making xOffset negative).
/// Can also be used to fill an empty line with empty space (`' '`) to make it fill width, if `line.length < width`
///
/// Arguments:
/// * `line` is the full line
/// * `xOffset` is the number of characters scrolled right
/// * `width` is the number of characters that are to be displayed
///
/// Returns: the text that should be displayed
string scrollHorizontal(string line, integer xOffset, uinteger width){
char[] r;
if (xOffset == 0){
// in case it has to do nothing,
r = cast(char[])line[0 .. width > line.length ? line.length : width].dup;
}else if (xOffset > 0){
// only do something if it's not scrolled too far for the line to be even displayed
if (xOffset < line.length){
r = cast(char[])line[xOffset .. line.length].dup;
}
}else if (xOffset < 0){
// only do something if it's not scrolled too far for the line to be even displayed
if (cast(integer)(line.length) + xOffset > 0){
r.length = xOffset * -1;
r[] = ' ';
r = r ~ cast(char[])line.dup;
}
}
if (r.length < width){
uinteger filledLength = r.length;
r.length = width;
r[filledLength .. r.length] = ' ';
}else if (r.length > width){
r.length = width;
}
return cast(string)r;
}
///
unittest{
assert("0123456789".scrollHorizontal(5, 2) == "56");
assert("0123456789".scrollHorizontal(0,10) == "0123456789");
assert("0123456789".scrollHorizontal(10,4) == " ");
assert("0123456789".scrollHorizontal(-5,4) == " ");
assert("0123456789".scrollHorizontal(-5,6) == " 0");
assert("0123456789".scrollHorizontal(-1,11) == " 0123456789");
assert("0123456789".scrollHorizontal(-5,10) == " 01234");
}
/// ditto
char[] scrollHorizontal(char[] line, integer xOffset, uinteger width){
return cast(char[])(cast(string)line).scrollHorizontal(xOffset, width);
}
/// Adjusts offset (aka _scrollX or _scrollY) in scrolling so the selected character is visible TODO: FIX THIS
///
/// Arguemnts:
/// * `selected` is the character on which the cursor is. If it's >lineWidth, `selected=lineWidth`
/// * `size` is the width/height (depending on if it's horizontal or vertical scrolling) of the space where the line is to be displayed
/// * `offset` is the variable storing the offset (_xOffset or _yOffset)
void adjustScrollingOffset(ref uinteger selected, uinteger size, uinteger lineWidth, ref uinteger offset){
// if selected is outside size, it shouldn't be
if (selected > lineWidth){
selected = lineWidth;
}
// range of characters' index that's visible (1 is inclusive, 2 is not)
uinteger visible1, visible2;
visible1 = offset;
visible2 = offset + size;
if (selected < visible1 || selected >= visible2){
if (selected < visible1){
// scroll back
offset = selected;
}else if (selected >= visible2){
// scroll ahead
offset = selected+1 - (size);
}
}
}
/// Center-aligns text
///
/// If `text.length > width`, the exceeding characters are removed
///
/// Returns: the text center aligned in a string
string centerAlignText(string text, uinteger width, char fill = ' '){
char[] r;
if (text.length < width){
r.length = width;
uinteger offset = (width - text.length)/2;
r[0 .. offset] = fill;
r[offset .. offset+text.length][] = text;
r[offset+text.length .. r.length] = fill;
}else{
r = cast(char[])text[0 .. width].dup;
}
return cast(string)r;
}
///
unittest{
assert("qwr".centerAlignText(7) == " qwr ");
}
/// To calculate size of widgets using their sizeRatio
uinteger ratioToRaw(uinteger selectedRatio, uinteger ratioTotal, uinteger total){
uinteger r;
r = cast(uinteger)((cast(float)selectedRatio/cast(float)ratioTotal)*total);
return r;
}
|
D
|
module vibecompat.core.concurrency;
public import vibe.core.concurrency;
import vibe.core.core : Task;
import core.time : Duration;
/// Forwards to `std.concurrency.send`.
void sendCompat(ARGS...)(Task task, ARGS args)
@trusted {
assert (task != Task(), "Invalid task handle");
static assert(args.length > 0, "Need to send at least one value.");
foreach (A; ARGS)
static assert(isWeaklyIsolated!A, "Only objects with no unshared or unisolated aliasing may be sent, not "~A.stringof~".");
send(task.tid, args);
}
/// Forwards to `std.concurrency.prioritySend`.
void prioritySendCompat(ARGS...)(Task task, ARGS args)
@trusted {
assert (task != Task(), "Invalid task handle");
static assert(args.length > 0, "Need to send at least one value.");
foreach (A; ARGS)
static assert(isWeaklyIsolated!A, "Only objects with no unshared or unisolated aliasing may be sent, not "~A.stringof~".");
prioritySend(task.tid, args);
}
/// Forwards to `std.concurrency.receive`.
void receiveCompat(OPS...)(OPS ops)
@trusted {
receive(ops);
}
/// Forwards to `std.concurrency.receiveOnly`.
auto receiveOnlyCompat(ARGS...)()
@trusted {
foreach (A; ARGS)
static assert(isWeaklyIsolated!A, "Only objects with no unshared or unisolated aliasing may be sent, not "~A.stringof~".");
return receiveOnly!ARGS();
}
/// Forwards to `std.concurrency.receiveTimeout`.
bool receiveTimeoutCompat(OPS...)(Duration timeout, OPS ops)
@trusted {
return receiveTimeout(timeout, ops);
}
/// Forwards to `std.concurrency.setMaxMailboxSize`.
void setMaxMailboxSizeCompat(Task task, size_t messages, OnCrowding on_crowding)
@trusted {
setMaxMailboxSize(task.tid, messages, on_crowding);
}
@safe unittest {
import vibe.core.core : exitEventLoop, runEventLoop, runTask, sleep;
import core.time : seconds;
auto t = runTask({
assert(receiveOnlyCompat!int == 42);
receiveCompat((string s) {
assert(s == "foo");
});
receiveTimeoutCompat(10.seconds, (int i) {
assert(i == 43);
});
});
t.setMaxMailboxSizeCompat(10, OnCrowding.block);
t.sendCompat(42);
sleep(1.seconds);
t.sendCompat(43);
t.prioritySendCompat("foo");
t.join();
}
|
D
|
marked by a disposition to oppose and contradict
resistant to guidance or discipline
deviating from what is considered moral or right or proper or good
|
D
|
module elasticsearch.api.namespace.all;
//import elasticsearch.api.namespace.cat;
//import elasticsearch.api.namespace.cluster;
//import elasticsearch.api.namespace.common;
//import elasticsearch.api.namespace.indices;
//import elasticsearch.api.namespace.nodes;
//import elasticsearch.api.namespace.snapshot;
|
D
|
/*
* $Id: barragemanager.d,v 1.3 2004/05/14 14:35:37 kenta Exp $
*
* Copyright 2004 Kenta Cho. All rights reserved.
*/
module abagames.tf.barragemanager;
private import std.string;
private import std.path;
private import std.file;
private import bulletml;
private import abagames.util.logger;
private import abagames.tf.morphbullet;
/**
* Barrage manager(BulletMLs' loader).
*/
public class BarrageManager {
private:
static BulletMLParserTinyXML *parser[char[]];
static const char[] BARRAGE_DIR_NAME = "barrage";
public static void loadBulletMLs() {
char[][] dirs = listdir(BARRAGE_DIR_NAME);
foreach (char[] dirName; dirs) {
char[][] files = listdir(BARRAGE_DIR_NAME ~ "/" ~ dirName);
foreach (char[] fileName; files) {
if (getExt(fileName) != "xml")
continue;
char[] barrageName = dirName ~ "/" ~ fileName;
Logger.info("Load BulletML: " ~ barrageName);
parser[barrageName] =
BulletMLParserTinyXML_new(std.string.toStringz(BARRAGE_DIR_NAME ~ "/" ~ barrageName));
BulletMLParserTinyXML_parse(parser[barrageName]);
}
}
}
public static void unloadBulletMLs() {
foreach (BulletMLParserTinyXML *p; parser) {
BulletMLParserTinyXML_delete(p);
}
}
public static BulletMLParserTinyXML* getInstance(char[] fileName) {
return parser[fileName];
}
}
|
D
|
/*******************************************************************************
copyright: Copyright (c) 2010 Ulrik Mikaelsson. Все права защищены
license: BSD стиль: $(LICENSE)
author: Ulrik Mikaelsson
standards: rfc3548, rfc4648
*******************************************************************************/
/*******************************************************************************
This module is использован в_ раскодируй и кодируй base32 ткст массивы.
Example:
---
ткст blah = "Hello there, my имя is Jeff.";
scope encodebuf = new сим[вычислиРазмерКодир(cast(ббайт[])blah)];
ткст кодирован = кодируй(cast(ббайт[])blah, encodebuf);
scope decodebuf = new ббайт[кодирован.length];
if (cast(ткст)раскодируй(кодирован, decodebuf) == "Hello there, my имя is Jeff.")
Стдвыв("yay").нс;
---
Since v1.0
*******************************************************************************/
module util.encode.Base32;
/*******************************************************************************
calculates и returns the размер needed в_ кодируй the length of the
Массив passed.
Параметры:
данные = An Массив that will be кодирован
*******************************************************************************/
бцел вычислиРазмерКодир(ббайт[] данные)
{
return вычислиРазмерКодир(данные.length);
}
/*******************************************************************************
calculates и returns the размер needed в_ кодируй the length passed.
Параметры:
length = Число of байты в_ be кодирован
*******************************************************************************/
бцел вычислиРазмерКодир(бцел length)
{
auto inputbits = length * 8;
auto inputquantas = (inputbits + 39) / 40; // Round upwards
return inputquantas * 8;
}
/*******************************************************************************
encodes данные и returns as an ASCII base32 ткст.
Параметры:
данные = что is в_ be кодирован
buff = буфер large enough в_ hold кодирован данные
pad = Whether в_ pad аски вывод with '='-симвы
Example:
---
сим[512] encodebuf;
ткст myEncodedString = кодируй(cast(ббайт[])"Hello, как are you today?", encodebuf);
Стдвыв(myEncodedString).нс; // JBSWY3DPFQQGQ33XEBQXEZJAPFXXKIDUN5SGC6J7
---
*******************************************************************************/
ткст кодируй(ббайт[] данные, ткст buff, бул pad=да)
in
{
assert(данные);
assert(buff.length >= вычислиРазмерКодир(данные));
}
body
{
бцел i = 0;
бкрат remainder; // Carries перебор биты в_ следщ сим
байт remainlen; // Tracks биты in remainder
foreach (ббайт j; данные)
{
remainder = (remainder<<8) | j;
remainlen += 8;
do
{
remainlen -= 5;
buff[i++] = _encodeTable[(remainder>>remainlen)&0b11111];
}
while (remainlen > 5)
}
if (remainlen)
buff[i++] = _encodeTable[(remainder<<(5-remainlen))&0b11111];
if (pad)
{
for (ббайт padCount=(-i%8); padCount > 0; padCount--)
buff[i++] = base32_PAD;
}
return buff[0..i];
}
/*******************************************************************************
encodes данные и returns as an ASCII base32 ткст.
Параметры:
данные = что is в_ be кодирован
pad = whether в_ pad вывод with '='-симвы
Example:
---
ткст myEncodedString = кодируй(cast(ббайт[])"Hello, как are you today?");
Стдвыв(myEncodedString).нс; // JBSWY3DPFQQGQ33XEBQXEZJAPFXXKIDUN5SGC6J7
---
*******************************************************************************/
ткст кодируй(ббайт[] данные, бул pad=да)
in
{
assert(данные);
}
body
{
auto rtn = new сим[вычислиРазмерКодир(данные)];
return кодируй(данные, rtn, pad);
}
/*******************************************************************************
decodes an ASCII base32 ткст и returns it as ббайт[] данные. Pre-allocates
the размер of the Массив.
This decoder will ignore non-base32 characters. So:
SGVsbG8sIGhvd
yBhcmUgeW91IH
RvZGF5Pw==
Is действителен.
Параметры:
данные = что is в_ be decoded
Example:
---
ткст myDecodedString = cast(ткст)раскодируй("JBSWY3DPFQQGQ33XEBQXEZJAPFXXKIDUN5SGC6J7");
Стдвыв(myDecodeString).нс; // Hello, как are you today?
---
*******************************************************************************/
ббайт[] раскодируй(ткст данные)
in
{
assert(данные);
}
body
{
auto rtn = new ббайт[данные.length];
return раскодируй(данные, rtn);
}
/*******************************************************************************
decodes an ASCII base32 ткст и returns it as ббайт[] данные.
This decoder will ignore non-base32 characters. So:
SGVsbG8sIGhvd
yBhcmUgeW91IH
RvZGF5Pw==
Is действителен.
Параметры:
данные = что is в_ be decoded
buff = a big enough Массив в_ hold the decoded данные
Example:
---
ббайт[512] decodebuf;
ткст myDecodedString = cast(ткст)раскодируй("JBSWY3DPFQQGQ33XEBQXEZJAPFXXKIDUN5SGC6J7", decodebuf);
Стдвыв(myDecodeString).нс; // Hello, как are you today?
---
*******************************************************************************/
ббайт[] раскодируй(ткст данные, ббайт[] buff)
in
{
assert(данные);
}
body
{
бкрат remainder;
байт remainlen;
т_мера oIndex;
foreach (c; данные)
{
auto dec = _decodeTable[c];
if (dec & 0b1000_0000)
continue;
remainder = (remainder<<5) | dec;
for (remainlen += 5; remainlen >= 8; remainlen -= 8)
buff[oIndex++] = remainder >> (remainlen-8);
}
return buff[0..oIndex];
}
debug (UnitTest)
{
unittest
{
static ткст[] testBytes = [
"",
"foo",
"fСПД",
"fСПДa",
"fСПДar",
"Hello, как are you today?",
];
static ткст[] testChars = [
"",
"MZXW6===",
"MZXW6YQ=",
"MZXW6YTB",
"MZXW6YTBOI======",
"JBSWY3DPFQQGQ33XEBQXEZJAPFXXKIDUN5SGC6J7",
];
for (бцел i; i < testBytes.length; i++)
{
auto resultChars = кодируй(cast(ббайт[])testBytes[i]);
assert(resultChars == testChars[i],
testBytes[i]~": ("~resultChars~") != ("~testChars[i]~")");
auto resultBytes = раскодируй(testChars[i]);
assert(resultBytes == cast(ббайт[])testBytes[i],
testChars[i]~": ("~cast(ткст)resultBytes~") != ("~testBytes[i]~")");
}
}
}
private:
/*
Static immutable tables использован for fast lookups в_
кодируй и раскодируй данные.
*/
static const ббайт base32_PAD = '=';
static const ткст _encodeTable = "ABCDEFGHIJKLMNOPQRSTUVWXYZ234567";
static const ббайт[] _decodeTable = [
0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0x1A,0x1B, 0x1C,0x1D,0x1E,0x1F, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF,
0xFF,0x00,0x01,0x02, 0x03,0x04,0x05,0x06, 0x07,0x08,0x09,0x0A, 0x0B,0x0C,0x0D,0x0E,
0x0F,0x10,0x11,0x12, 0x13,0x14,0x15,0x16, 0x17,0x18,0x19,0xFF, 0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF,
0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF,
];
|
D
|
module skadi.components.validation.all;
public import skadi.components.validation.message;
public import skadi.components.validation.messageinterface;
public import skadi.components.validation.messagelist;
public import skadi.components.validation.validation;
public import skadi.components.validation.validator;
public import skadi.components.validation.validatorInterface;
public import skadi.components.validation.message;
public import skadi.components.validation.validators.alpha;
public import skadi.components.validation.validators.alphanum;
public import skadi.components.validation.validators.digit;
public import skadi.components.validation.validators.email;
public import skadi.components.validation.validators.stringlength;
|
D
|
module jamu.emulator.instruction.blockTransferInstruction;
import std.conv;
import std.bitmanip;
import std.format;
import std.stdio;
import jamu.emulator.machine;
import jamu.emulator.instruction;
import jamu.common.instructionStructs;
class BlockTransferInstruction : Instruction {
uint[] getRegList() {
uint[] r;
foreach (i; 0..16) {
if (castedBytes.regList & (1 << i))
r ~= i;
}
return r;
}
this(uint location, ubyte[4] source) {
super(location, source);
assert(this.castedBytes.opcode == 0b100);
}
LoadStoreBlockInsn* castedBytes() {
return cast(LoadStoreBlockInsn*) source.ptr;
}
override Machine* execute(Machine *m) {
if (!conditionIsTrue(m)) {
return super.execute(m);
}
// Get the target address
auto targetAddress = m.getRegister(castedBytes.baseReg);
auto offset = castedBytes.upBit
? getRegList().length * 4
: -getRegList().length * 4;
if (castedBytes.preBit)
targetAddress += offset;
if (castedBytes.loadBit) {
auto mem = m.getMemory(
targetAddress,
cast(uint) getRegList().length*4);
foreach(i, regNum; getRegList()) {
uint value = * cast(uint*) mem[4*i..4*i+4].ptr;
m.setRegister(regNum, value);
}
} else { // setBit
foreach(i, regNum; getRegList()) {
auto regVal = m.getRegister(regNum);
ubyte[4] val = *cast(ubyte[4]*)®Val;
m.setMemory(targetAddress + 4*cast(uint)i,
val);
}
}
if (!castedBytes.preBit)
targetAddress += offset;
if (castedBytes.writeBackBit)
m.setRegister(castedBytes.baseReg, targetAddress);
return super.execute(m);
}
override string toString() {
auto ins = format!"%s%s R%d {"(
castedBytes.loadBit ? "LDM" : "STM",
castedBytes.writeBackBit ? "!" : "",
castedBytes.baseReg);
foreach(r; getRegList()) {
ins ~= format!"R%d, "(r);
}
if (getRegList().length)
ins = ins[0..$-2];
ins ~= "}";
return ins;
}
}
|
D
|
///Found on http://geco.mines.edu/workshop/class2/examples/mpi/index.html
/*
! This program shows how to use MPI_Alltoall. Each processor
! send/rec a different random number to/from other processors.
*/
import core.stdc.stdio;
import std.algorithm;
import std.array;
import std.string;
import std.random;
import core.memory;
import mpi;
import mpi.util;
/* globals */
int numnodes, myid, mpi_err;
immutable mpi_root = 0;
/* end module */
void init_it(int* argc, char*** argv)
{
mpi_err = MPI_Init(argc, argv);
mpi_err = MPI_Comm_size(MPI_COMM_WORLD, &numnodes );
mpi_err = MPI_Comm_rank(MPI_COMM_WORLD, &myid);
}
int main(string[] args)
{
int argc = cast(int)args.length;
auto argv = args.toArgv();
int* sray, rray;
int* sdisp, scounts, rdisp, rcounts;
int ssize, rsize, i, k, j;
float z;
init_it(&argc, &argv);
scounts= cast(int*)GC.malloc(int.sizeof*numnodes, GC.BlkAttr.NO_SCAN);
rcounts= cast(int*)GC.malloc(int.sizeof*numnodes, GC.BlkAttr.NO_SCAN);
sdisp= cast(int*)GC.malloc(int.sizeof*numnodes, GC.BlkAttr.NO_SCAN);
rdisp= cast(int*)GC.malloc(int.sizeof*numnodes, GC.BlkAttr.NO_SCAN);
/*
! seed the random number generator with a
! different number on each processor
*/
// seed_random(myid); not needed
/* find data to send */
for(i=0; i<numnodes; i++)
{
scounts[i] = uniform(0,100);
}
printf("myid= %d scounts=", myid);
for(i=0; i<numnodes; i++)
printf("%d ",scounts[i]);
printf("\n");
/* send the data */
mpi_err = MPI_Alltoall( scounts,1,MPI_INT,
rcounts,1,MPI_INT,
MPI_COMM_WORLD);
printf("myid= %d rcounts=",myid);
for(i=0; i<numnodes; i++)
printf("%d ",rcounts[i]);
printf("\n");
return MPI_Finalize();
}
|
D
|
; Copyright (C) 2008 The Android Open Source Project
;
; Licensed under the Apache License, Version 2.0 (the "License");
; you may not use this file except in compliance with the License.
; You may obtain a copy of the License at
;
; http://www.apache.org/licenses/LICENSE-2.0
;
; Unless required by applicable law or agreed to in writing, software
; distributed under the License is distributed on an "AS IS" BASIS,
; WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
; See the License for the specific language governing permissions and
; limitations under the License.
.source T_int_to_float_5.java
.class public dot.junit.opcodes.int_to_float.d.T_int_to_float_5
.super java/lang/Object
.method public <init>()V
.limit regs 1
invoke-direct {v0}, java/lang/Object/<init>()V
return-void
.end method
.method public run(F)F
.limit regs 5
int-to-float v0, v4
return v0
.end method
|
D
|
/**
* Dead code elimination. Really simple.
*/
module opt.dce;
import ir;
void eliminateDeadCode(BasicBlock b) {
bool changed;
do {
changed = false;
bool[typeof(Temp.tempNum)] usedSet;
foreach (inst; b.instrs) {
foreach (src; inst.srcs) {
if (!src.isConst) {
usedSet[src.tempNum] = true;
}
}
}
// Use a plain for loop here because we mess with the index
for (ulong i = 0; i < b.instrs.length; ++i) {
auto dest = b.instrs[i].dest;
assert(!dest || !dest.isConst);
auto destIsUnused = (dest && !(dest.tempNum in usedSet));
if (b.instrs[i].opcode == Opcode.Nop || destIsUnused) {
changed = true;
b.instrs.linearRemove(b.instrs[i..i + 1]);
i--; // process this index again
}
}
} while (changed);
}
|
D
|
// { dg-do compile }
import gcc.attributes;
@alloc_size(1)
int ignoredfunc(int size); // { dg-warning ".alloc_size. attribute ignored on a function returning .int." }
@alloc_size(0) int var; // { dg-warning ".alloc_size. attribute only applies to function types" }
@attribute("alloc_size", "1")
void* invalid1(int size); // { dg-warning ".alloc_size. attribute argument is invalid" }
@attribute("alloc_size", 1, "2")
void* invalid2(int count, int size); // { dg-warning ".alloc_size. attribute argument 2 is invalid" }
@attribute("alloc_size", 0.1)
void* wrongtype1(int size); // { dg-warning ".alloc_size. attribute argument has type .double." }
@attribute("alloc_size", 1, 0.2)
void* wrongtype2(int count, int size); // { dg-warning ".alloc_size. attribute argument 2 has type .double." }
@alloc_size(0)
void* malloc0(int size); // { dg-warning ".alloc_size. attribute argument value .0. does not refer to a function parameter" }
@alloc_size(1, 0)
void* malloc0(int count, int size); // { dg-warning ".alloc_size. attribute argument 2 value .0. does not refer to a function parameter" }
@alloc_size(1, 0, true)
void* malloc0pos(int count, int size);
@alloc_size(1, -1, true)
void* mallocminus1(int count, int size); // { dg-warning ".alloc_size. attribute argument 2 value .-1. does not refer to a function parameter" }
@alloc_size(99)
void* malloc99(int size); // { dg-warning ".alloc_size. attribute argument value .99. exceeds the number of function parameters 1" }
@alloc_size(1, 99)
void* malloc99(int count, int size); // { dg-warning ".alloc_size. attribute argument 2 value .99. exceeds the number of function parameters 2" }
@alloc_size(1)
void* mallocdouble(double size); // { dg-warning ".alloc_size. attribute argument value .1. refers to parameter type .double." }
@alloc_size(2, 1)
void* mallocdouble(int count, double size); // { dg-warning ".alloc_size. attribute argument 1 value .2. refers to parameter type .double." }
|
D
|
// PERMUTE_ARGS:
//http://d.puremagic.com/issues/show_bug.cgi?id=5415
@safe
void pointercast()
{
int* a;
void* b;
static assert( __traits(compiles, cast(void*)a));
static assert(!__traits(compiles, cast(int*)b));
static assert(!__traits(compiles, cast(int*)b));
static assert(!__traits(compiles, cast(short*)b));
static assert( __traits(compiles, cast(byte*)b));
static assert( __traits(compiles, cast(short*)a));
static assert( __traits(compiles, cast(byte*)a));
}
@safe
void pointercast2()
{
size_t a;
int b;
Object c;
static assert(!__traits(compiles, cast(void*)a));
static assert(!__traits(compiles, cast(void*)b));
static assert(!__traits(compiles, cast(void*)c));
}
@safe
void pointerarithmetic()
{//http://d.puremagic.com/issues/show_bug.cgi?id=4132
void* a;
int b;
static assert(!__traits(compiles, a + b));
static assert(!__traits(compiles, a - b));
static assert(!__traits(compiles, a += b));
static assert(!__traits(compiles, a -= b));
static assert(!__traits(compiles, a++));
static assert(!__traits(compiles, a--));
static assert(!__traits(compiles, ++a));
static assert(!__traits(compiles, --a));
}
union SafeUnion1
{
int a;
struct
{
int b;
int* c;
}
}
union SafeUnion2
{
int a;
struct
{
int b;
int c;
}
}
union UnsafeUnion1
{
int a;
int* c;
}
union UnsafeUnion2
{
int a;
align(1)
struct
{
byte b;
int* c;
}
}
union UnsafeUnion3
{
int a;
Object c;
}
union UnsafeUnion4
{
int a;
align(1)
struct
{
byte b;
Object c;
}
}
struct pwrapper
{
int* a;
}
union UnsafeUnion5
{
SafeUnion2 x;
pwrapper b;
}
SafeUnion1 su1;
SafeUnion2 su2;
UnsafeUnion1 uu1;
UnsafeUnion2 uu2;
UnsafeUnion3 uu3;
UnsafeUnion4 uu4;
UnsafeUnion5 uu5;
union uA
{
struct
{
int* a;
void* b;
}
}
struct uB
{
uA a;
}
struct uC
{
uB a;
}
struct uD
{
uC a;
}
uD uud;
@safe
void safeunions()
{
//static assert( __traits(compiles, { SafeUnion1 x; x.a = 7; }));
static assert( __traits(compiles, { SafeUnion2 x; x.a = 7; }));
static assert(!__traits(compiles, { UnsafeUnion1 x; x.a = 7; }));
static assert(!__traits(compiles, { UnsafeUnion2 x; x.a = 7; }));
static assert(!__traits(compiles, { UnsafeUnion3 x; x.a = 7; }));
static assert(!__traits(compiles, { UnsafeUnion4 x; x.a = 7; }));
static assert(!__traits(compiles, { UnsafeUnion5 x; }));
typeof(uu1.a) f;
//static assert( __traits(compiles, { su1.a = 7; }));
static assert( __traits(compiles, { su2.a = 7; }));
static assert(!__traits(compiles, { uu1.a = 7; }));
static assert(!__traits(compiles, { uu2.a = 7; }));
static assert(!__traits(compiles, { uu3.a = 7; }));
static assert(!__traits(compiles, { uu4.a = 7; }));
static assert(!__traits(compiles, { uu5.x.a = null; }));
static assert(!__traits(compiles, { uud.a.a.a.a = null; }));
}
void systemfunc() @system {}
void function() @system sysfuncptr;
void delegate() @system sysdelegate;
@safe
void callingsystem()
{
static assert(!__traits(compiles, systemfunc()));
static assert(!__traits(compiles, sysfuncptr()));
static assert(!__traits(compiles, sysdelegate()));
}
@safe
void safeexception()
{
try {}
catch(Exception e) {}
static assert(!__traits(compiles, {
try {}
catch(Error e) {}
}));
static assert(!__traits(compiles, {
try {}
catch(Throwable e) {}
}));
static assert(!__traits(compiles, {
try {}
catch {}
}));
}
@safe
void inlineasm()
{
static assert(!__traits(compiles, { asm { int 3; } }() ));
}
@safe
void multablecast()
{
Object m;
const(Object) c;
immutable(Object) i;
static assert( __traits(compiles, cast(const(Object))m));
static assert( __traits(compiles, cast(const(Object))i));
static assert(!__traits(compiles, cast(immutable(Object))m));
static assert(!__traits(compiles, cast(immutable(Object))c));
static assert(!__traits(compiles, cast(Object)c));
static assert(!__traits(compiles, cast(Object)i));
void* mp;
const(void)* cp;
immutable(void)* ip;
static assert( __traits(compiles, cast(const(void)*)mp));
static assert( __traits(compiles, cast(const(void)*)ip));
static assert(!__traits(compiles, cast(immutable(void)*)mp));
static assert(!__traits(compiles, cast(immutable(void)*)cp));
static assert(!__traits(compiles, cast(void*)cp));
static assert(!__traits(compiles, cast(void*)ip));
}
@safe
void sharedcast()
{
Object local;
shared(Object) xshared;
immutable(Object) ishared;
static assert(!__traits(compiles, cast()xshared));
static assert(!__traits(compiles, cast(shared)local));
static assert(!__traits(compiles, cast(immutable)xshared));
static assert(!__traits(compiles, cast(shared)ishared));
}
int threadlocalvar;
@safe
void takeaddr()
{
static assert(!__traits(compiles, (int x) { auto y = &x; } ));
static assert(!__traits(compiles, { int x; auto y = &x; } ));
static assert( __traits(compiles, { static int x; auto y = &x; } ));
static assert( __traits(compiles, { auto y = &threadlocalvar; } ));
}
__gshared int gsharedvar;
@safe
void use__gshared()
{
static assert(!__traits(compiles, { int x = gsharedvar; } ));
}
@safe
void voidinitializers()
{//http://d.puremagic.com/issues/show_bug.cgi?id=4885
static assert(!__traits(compiles, { uint* ptr = void; } ));
static assert( __traits(compiles, { uint i = void; } ));
static assert( __traits(compiles, { uint[2] a = void; } ));
struct ValueStruct { int a; }
struct NonValueStruct { int* a; }
static assert( __traits(compiles, { ValueStruct a = void; } ));
static assert(!__traits(compiles, { NonValueStruct a = void; } ));
static assert(!__traits(compiles, { uint[] a = void; } ));
static assert(!__traits(compiles, { int** a = void; } ));
static assert(!__traits(compiles, { int[int] a = void; } ));
}
@safe
void basiccast()
{//http://d.puremagic.com/issues/show_bug.cgi?id=5088
auto a = cast(int)cast(const int)1;
auto b = cast(real)cast(const int)1;
auto c = cast(real)cast(const real)2.0;
}
@safe
void arraycast()
{
int[] x;
void[] y = x;
static assert( __traits(compiles, cast(void[])x));
static assert( __traits(compiles, cast(int[])y));
static assert(!__traits(compiles, cast(int*[])y));
static assert(!__traits(compiles, cast(void[][])y));
int[3] a;
int[] b = cast(int[])a;
uint[3] c = cast(uint[3])a;
}
@safe
void structcast()
{
struct A { ptrdiff_t x; }
struct B { size_t x; }
struct C { void* x; }
A a;
B b;
C c;
static assert( __traits(compiles, a = cast(A)b));
static assert( __traits(compiles, a = cast(A)c));
static assert( __traits(compiles, b = cast(B)a));
static assert( __traits(compiles, b = cast(B)c));
static assert(!__traits(compiles, c = cast(C)a));
static assert(!__traits(compiles, c = cast(C)b));
}
@safe void test6497()
{
int n;
(0 ? n : n) = 3;
}
@safe
void varargs()
{
static void fun(string[] val...) {}
fun("a");
}
extern(C++) interface E {}
extern(C++) interface F : E {}
@safe
void classcast()
{
class A {};
class B : A {};
A a;
B b;
static assert( __traits(compiles, cast(A)a));
static assert( __traits(compiles, cast(B)a));
static assert( __traits(compiles, cast(A)b));
static assert( __traits(compiles, cast(B)b));
interface C {};
interface D : C {};
C c;
D d;
static assert( __traits(compiles, cast(C)c));
static assert( __traits(compiles, cast(D)c));
static assert( __traits(compiles, cast(C)d));
static assert( __traits(compiles, cast(D)d));
E e;
F f;
static assert( __traits(compiles, cast(E)e));
static assert(!__traits(compiles, cast(F)e));
static assert( __traits(compiles, cast(E)f));
static assert( __traits(compiles, cast(F)f));
}
@safe
{
class A6278 {
int test()
in { assert(0); }
body { return 1; }
}
class B6278 : A6278 {
override int test()
in { assert(0); }
body { return 1; }
}
}
@safe int f7803() {
scope(success) {/* ... */}
return 3;
}
nothrow int g7803() {
scope(success) {/* ... */}
return 3;
}
void main() { }
|
D
|
// Written in the D programming language.
/**
* Support UTF-8 on Windows 95, 98 and ME systems.
*
* Macros:
* WIKI = Phobos/StdWindowsCharset
*
* Copyright: Copyright Digital Mars 2005 - 2009.
* License: <a href="http://www.boost.org/LICENSE_1_0.txt">Boost License 1.0</a>.
* Authors: $(WEB digitalmars.com, Walter Bright)
*/
/* Copyright Digital Mars 2005 - 2009.
* Distributed under the Boost Software License, Version 1.0.
* (See accompanying file LICENSE_1_0.txt or copy at
* http://www.boost.org/LICENSE_1_0.txt)
*/
module mystd.windows.charset;
version (Windows):
private import mystd.conv;
private import mystd.c.windows.windows;
private import mystd.windows.syserror;
private import mystd.utf;
private import mystd.string;
/******************************************
* Converts the UTF-8 string s into a null-terminated string in a Windows
* 8-bit character set.
*
* Params:
* s = UTF-8 string to convert.
* codePage = is the number of the target codepage, or
* 0 - ANSI,
* 1 - OEM,
* 2 - Mac
*
* Authors:
* yaneurao, Walter Bright, Stewart Gordon
*/
const(char)* toMBSz(in char[] s, uint codePage = 0)
{
// Only need to do this if any chars have the high bit set
foreach (char c; s)
{
if (c >= 0x80)
{
char[] result;
int readLen;
auto ws = mystd.utf.toUTF16z(s);
result.length = WideCharToMultiByte(codePage, 0, ws, -1, null, 0,
null, null);
if (result.length)
{
readLen = WideCharToMultiByte(codePage, 0, ws, -1, result.ptr,
to!int(result.length), null, null);
}
if (!readLen || readLen != result.length)
{
throw new Exception("Couldn't convert string: " ~
sysErrorString(GetLastError()));
}
return result.ptr;
}
}
return mystd.string.toStringz(s);
}
/**********************************************
* Converts the null-terminated string s from a Windows 8-bit character set
* into a UTF-8 char array.
*
* Params:
* s = UTF-8 string to convert.
* codePage = is the number of the source codepage, or
* 0 - ANSI,
* 1 - OEM,
* 2 - Mac
* Authors: Stewart Gordon, Walter Bright
*/
string fromMBSz(immutable(char)* s, int codePage = 0)
{
const(char)* c;
for (c = s; *c != 0; c++)
{
if (*c >= 0x80)
{
wchar[] result;
int readLen;
result.length = MultiByteToWideChar(codePage, 0, s, -1, null, 0);
if (result.length)
{
readLen = MultiByteToWideChar(codePage, 0, s, -1, result.ptr,
to!int(result.length));
}
if (!readLen || readLen != result.length)
{
throw new Exception("Couldn't convert string: " ~
sysErrorString(GetLastError()));
}
return mystd.utf.toUTF8(result[0 .. result.length-1]); // omit trailing null
}
}
return s[0 .. c-s]; // string is ASCII, no conversion necessary
}
|
D
|
instance PC_Psionic_Exit(C_Info)
{
npc = PC_Psionic;
nr = 999;
condition = PC_Psionic_Exit_Condition;
information = PC_Psionic_Exit_Info;
important = 0;
permanent = 1;
description = DIALOG_ENDE;
};
func int PC_Psionic_Exit_Condition()
{
return 1;
};
func void PC_Psionic_Exit_Info()
{
if(self.aivar[AIV_PARTYMEMBER] || (Kapitel > 2))
{
AI_Output(self,hero,"Info_Lester_EXIT_05_01"); //Pojďme!
}
else
{
AI_Output(self,hero,"Info_Lester_EXIT_05_02"); //Kéž tě Spáč ochrání!
};
AI_StopProcessInfos(self);
};
instance DIA_Lester_Sakrileg(C_Info)
{
npc = PC_Psionic;
nr = 1;
condition = DIA_Lester_Sakrileg_Condition;
information = DIA_Lester_Sakrileg_Info;
permanent = 0;
important = 1;
};
func int DIA_Lester_Sakrileg_Condition()
{
if(BaalNamib_Sakrileg == TRUE)
{
return 1;
};
};
func void DIA_Lester_Sakrileg_Info()
{
AI_Output(self,other,"DIA_Lester_Sakrileg_05_00"); //Oslovil jsi Guru! Už to nikdy nedělej! Je to svatokrádež! Když bude s tebou chtít mistr mluvit, ON osloví TEBE.
};
instance DIA_Lester_Hallo(C_Info)
{
npc = PC_Psionic;
nr = 1;
condition = DIA_Lester_Hallo_Condition;
information = DIA_Lester_Hallo_Info;
permanent = 0;
description = "Kdo jsi?";
};
func int DIA_Lester_Hallo_Condition()
{
if(Kapitel < 3)
{
return TRUE;
};
};
func void DIA_Lester_Hallo_Info()
{
AI_Output(other,self,"DIA_Lester_Hallo_15_00"); //Kdo jsi?
AI_Output(self,other,"DIA_Lester_Hallo_05_01"); //Jsem Lester. Starám se o cizince, kteří sem přijdou.
if(BaalNamib_Sakrileg == FALSE)
{
AI_Output(self,other,"DIA_Lester_Hallo_05_02"); //Máš štěstí, že jsi nemluvil s Baalem Namibem. Žádný cizinec nesmí mluvit s Guru.
};
};
instance DIA_Lester_WannaTalkToMaster(C_Info)
{
npc = PC_Psionic;
nr = 2;
condition = DIA_Lester_WannaTalkToMaster_Condition;
information = DIA_Lester_WannaTalkToMaster_Info;
permanent = 0;
description = "Já ale chci mluvit s tvým mistrem.";
};
func int DIA_Lester_WannaTalkToMaster_Condition()
{
if((Npc_KnowsInfo(hero,DIA_Lester_Hallo) || Npc_KnowsInfo(hero,DIA_Lester_Sakrileg)) && (Npc_GetTrueGuild(hero) == GIL_None) && !Npc_KnowsInfo(hero,DIA_Lester_ShowHallo))
{
return 1;
};
};
func void DIA_Lester_WannaTalkToMaster_Info()
{
AI_Output(other,self,"DIA_Lester_WannaTalkToMaster_15_00"); //Já ale chci mluvit s tvým mistrem.
AI_Output(self,other,"DIA_Lester_WannaTalkToMaster_05_01"); //Zapomeň na to! Můžu ti pomoci s jakýmkoliv tvým problémem!
};
instance DIA_Lester_CampInfo(C_Info)
{
npc = PC_Psionic;
nr = 2;
condition = DIA_Lester_CampInfo_Condition;
information = DIA_Lester_CampInfo_Info;
permanent = 1;
description = "Řekni mi něco o táboře.";
};
func int DIA_Lester_CampInfo_Condition()
{
if(Npc_KnowsInfo(hero,DIA_Lester_Hallo) && (Kapitel < 3))
{
return 1;
};
};
func void DIA_Lester_CampInfo_Info()
{
AI_Output(other,self,"DIA_Lester_CampInfo_15_00"); //Řekni mi něco o táboru.
AI_Output(self,other,"DIA_Lester_CampInfo_05_01"); //Co chceš vědět?
Info_ClearChoices(DIA_Lester_CampInfo);
Info_AddChoice(DIA_Lester_CampInfo,DIALOG_BACK,DIA_Lester_CampInfo_BACK);
Info_AddChoice(DIA_Lester_CampInfo,"Řekni mi o společenství.",DIA_Lester_CampInfo_GIL);
Info_AddChoice(DIA_Lester_CampInfo,"Co mi můžeš říci o Spáčovi?",DIA_Lester_CampInfo_SLEEPER);
Info_AddChoice(DIA_Lester_CampInfo,"Co víš o droze z bažin?",DIA_Lester_CampInfo_HERB);
};
func void DIA_Lester_CampInfo_BACK()
{
Info_ClearChoices(DIA_Lester_CampInfo);
};
func void DIA_Lester_CampInfo_GIL()
{
AI_Output(other,self,"DIA_Lester_CampInfo_GIL_15_00"); //Řekni mi o společenství.
AI_Output(self,other,"DIA_Lester_CampInfo_GIL_05_01"); //Guru tvoří nejvyšší společenství. Jsou duchem tábora a jeho velkou silou. Templáři používají svoji duchovní sílu v boji.
AI_Output(self,other,"DIA_Lester_CampInfo_GIL_05_02"); //Mají nezkrotnou divokou sílu. NIKDY by ses s nimi neměl dostat do problému. Já osobně patřím k novicům. Modlíme se ke Spáčovi a pracujeme v táboře.
AI_Output(self,other,"DIA_Lester_CampInfo_GIL_05_03"); //Někteří novici se smějí přidat ke Guru, ale aby jim to bylo povoleno, musejí dlouhá léta studovat.
};
func void DIA_Lester_CampInfo_SLEEPER()
{
AI_Output(other,self,"DIA_Lester_CampInfo_SLEEPER_15_00"); //Co mi můžeš říci o Spáčovi?
AI_Output(self,other,"DIA_Lester_CampInfo_SLEEPER_05_01"); //Spáč je duchovní bytost. Vytváří vize - aspoň pro Guru.
AI_Output(self,other,"DIA_Lester_CampInfo_SLEEPER_05_02"); //Modlíme se k němu, aby nám dal svobodu.
AI_Output(other,self,"DIA_Lester_CampInfo_SLEEPER_15_03"); //A věříte tomu?
AI_Output(self,other,"DIA_Lester_CampInfo_SLEEPER_05_04"); //Hej, jsem v Bariéře už dva roky. Dokážeš si představit, jak dlouhé můžou DVA ROKY být?
AI_Output(self,other,"DIA_Lester_CampInfo_SLEEPER_05_05"); //Nedokážeš si představit, v co jsem ochotný věřit a co udělat, jen abych se odtud dostal pryč!
};
func void DIA_Lester_CampInfo_HERB()
{
AI_Output(other,self,"DIA_Lester_CampInfo_HERB_15_00"); //Co víš o droze z bažin?
AI_Output(self,other,"DIA_Lester_CampInfo_HERB_05_01"); //No, tahle droga roste v bažinách. Před tím, než se může kouřit, se samozřejmě musí zpracovat. To dělají novici.
AI_Output(self,other,"DIA_Lester_CampInfo_HERB_05_02"); //Droga má uklidňující a osvěžující účinek. Pomáhá při koncentraci a umocňuje vědomí.
AI_Output(self,other,"DIA_Lester_CampInfo_HERB_05_03"); //Vyměňujeme ji za zboží ze Starého tábora a také ji používáme pro získávání nových lidí.
AI_Output(self,other,"DIA_Lester_CampInfo_HERB_05_04"); //Někteří lidé se však k nám přidávají jen kvůli té droze. Ale tak nám aspoň pomáhají s prací v táboře.
};
instance DIA_Lester_WannaJoin(C_Info)
{
npc = PC_Psionic;
nr = 2;
condition = DIA_Lester_WannaJoin_Condition;
information = DIA_Lester_WannaJoin_Info;
permanent = 0;
description = "Chci se stát členem Bratrstva!";
};
func int DIA_Lester_WannaJoin_Condition()
{
if(Npc_KnowsInfo(hero,DIA_Lester_Hallo) && (Npc_GetTrueGuild(hero) == GIL_None))
{
return 1;
};
};
func void DIA_Lester_WannaJoin_Info()
{
AI_Output(other,self,"DIA_Lester_WannaJoin_15_00"); //Chci se stát členem Bratrstva!
AI_Output(self,other,"DIA_Lester_WannaJoin_05_01"); //Cor Kalom rozhodne, jestli jsi hoden vstoupit do Bratrstva.
AI_Output(self,other,"DIA_Lester_WannaJoin_05_02"); //Spoléhá se ale na radu Guru. Baal Namib, támhle ten, je jedním z nich.
AI_Output(self,other,"DIA_Lester_WannaJoin_05_03"); //Nejprve musíš dokázat, že jsi toho hoden a pak tě jeden z Guru pošle za Corem Kalomem.
};
instance DIA_Lester_HowProofWorthy(C_Info)
{
npc = PC_Psionic;
nr = 2;
condition = DIA_Lester_HowProofWorthy_Condition;
information = DIA_Lester_HowProofWorthy_Info;
permanent = 0;
description = "Jak to asi proběhne, pokud se za mě ani jeden z Guru nepřimluví?";
};
func int DIA_Lester_HowProofWorthy_Condition()
{
if(Npc_KnowsInfo(hero,DIA_Lester_WannaJoin) && (Npc_GetTrueGuild(hero) == GIL_None))
{
return 1;
};
};
func void DIA_Lester_HowProofWorthy_Info()
{
AI_Output(other,self,"DIA_Lester_HowProofWorthy_15_00"); //Jak to asi proběhne, pokud se za mě ani jeden z Guru nepřimluví?
AI_Output(self,other,"DIA_Lester_HowProofWorthy_05_01"); //To nevím, ale Guru sledují všechno, co tady v táboře děláš.
AI_Output(self,other,"DIA_Lester_HowProofWorthy_05_02"); //Pokud si myslí, že si zasloužíš stát se členem komunity, pak se za tebe přimluví.
AI_Output(self,other,"DIA_Lester_HowProofWorthy_05_03"); //V táboře máš spoustu možností, jak dokázat, že jsi toho hoden.
Log_CreateTopic(CH1_JoinPsi,LOG_MISSION);
Log_SetTopicStatus(CH1_JoinPsi,LOG_RUNNING);
B_LogEntry(CH1_JoinPsi,"Pokud se budu chtít přidat k Bratrstvu v táboře v bažinách, budu muset udělat dojem na guru. Ti však bohužel nemluví s novými příchozími. Novic Lester mi řekl, že mě přesto pozorují, a že budu potřebovat nějak ukázat, jak bych jim mohl být užitečný. Nemám nejmenší představu o tom, jak to udělat! Raději bych se měl dobře porozhlédnout po Táboře v bažinách.");
};
var int Lester_Show;
instance DIA_Lester_WeitWeg(C_Info)
{
npc = PC_Psionic;
nr = 2;
condition = DIA_Lester_WeitWeg_Condition;
information = DIA_Lester_WeitWeg_Info;
permanent = 0;
description = "Co musím udělat, aby se za mě tvůj mistr přimluvil?";
};
func int DIA_Lester_WeitWeg_Condition()
{
var C_Npc namib;
namib = Hlp_GetNpc(GUR_1204_BaalNamib);
if((Npc_GetDistToNpc(other,namib) > 1000) && (BaalNamib_Ansprechbar == FALSE) && (Npc_GetTrueGuild(hero) == GIL_None))
{
return 1;
};
};
func void DIA_Lester_WeitWeg_Info()
{
AI_Output(other,self,"DIA_Lester_WeitWeg_15_00"); //Co musím udělat, aby se za mě tvůj mistr přimluvil?
AI_Output(self,other,"DIA_Lester_WeitWeg_05_01"); //Musíš vědět, co chce slyšet.
AI_Output(other,self,"DIA_Lester_WeitWeg_15_02"); //A to je?
AI_Output(self,other,"DIA_Lester_WeitWeg_05_03"); //Poslouchej: až u něho příště budeme, oslovíš mě a povedeme spolu krátký hovor.
AI_Output(self,other,"DIA_Lester_WeitWeg_05_04"); //Baal Namib má obavy z toho, že se mnozí novici nemodlí jen ke Spáčovi, ale také ke svým dřívějším bohům.
AI_Output(self,other,"DIA_Lester_WeitWeg_05_05"); //Ty mi řekneš, že jsi se starých bohů zřekl a že se už nadále budeš modlit výhradně ke Spáčovi.
AI_Output(self,other,"DIA_Lester_WeitWeg_05_06"); //Pak se tě zeptám, proč jsi se takhle rozhodl a ty řekneš, že jsi měl vizi, ve které tě k tomu Spáč vyzval.
AI_Output(self,other,"DIA_Lester_WeitWeg_05_07"); //Pak projeví zájem. Myslíš, že to zvládneš?
AI_Output(other,self,"DIA_Lester_WeitWeg_15_08"); //Bez problémů.
B_LogEntry(CH1_JoinPsi,"Abych udělal dojem na Baala Namiba, měl bych v blízkosti tohoto guru oslovit Lestera a vyprávět mu o starých bozích a Spáčovi.");
Lester_Show = TRUE;
};
instance DIA_Lester_ShowHallo(C_Info)
{
npc = PC_Psionic;
nr = 1;
condition = DIA_Lester_ShowHallo_Condition;
information = DIA_Lester_ShowHallo_Info;
permanent = 0;
important = 1;
};
func int DIA_Lester_ShowHallo_Condition()
{
var C_Npc namib;
namib = Hlp_GetNpc(GUR_1204_BaalNamib);
if((Npc_GetDistToNpc(other,namib) < 500) && (BaalNamib_Ansprechbar == FALSE) && (Lester_Show == TRUE) && (Npc_GetTrueGuild(hero) == GIL_None))
{
return 1;
};
};
func void DIA_Lester_ShowHallo_Info()
{
AI_Output(self,other,"DIA_Lester_ShowHallo_05_00"); //AAH! RÁD TĚ ZASE VIDÍM. JAK SE TI VEDE?
};
instance DIA_Lester_Show(C_Info)
{
npc = PC_Psionic;
nr = 1;
condition = DIA_Lester_Show_Condition;
information = DIA_Lester_Show_Info;
permanent = 0;
description = "Zřekl jsem se starých bohů.";
};
func int DIA_Lester_Show_Condition()
{
var C_Npc namib;
namib = Hlp_GetNpc(GUR_1204_BaalNamib);
if((Npc_GetDistToNpc(other,namib) < 500) && (BaalNamib_Ansprechbar == FALSE) && (Lester_Show == TRUE))
{
return 1;
};
};
func void DIA_Lester_Show_Info()
{
AI_Output(other,self,"DIA_Lester_Show_15_00"); //ZŘEKL JSEM SE STARÝCH BOHŮ.
AI_Output(self,other,"DIA_Lester_Show_05_01"); //OPRAVDU? CO TĚ K TOMU PŘIMĚLO?
AI_Output(other,self,"DIA_Lester_Show_15_02"); //MĚL JSEM VIZI: PROMLUVIL KE MNĚ SPÁČ.
AI_Output(self,other,"DIA_Lester_Show_05_03"); //CO TI ŘÍKAL?
AI_Output(other,self,"DIA_Lester_Show_15_04"); //ŘEKL: JDI DO TÁBORA V BAŽINÁCH A PŘIDEJ SE K BRATRSTVU.
AI_Output(self,other,"DIA_Lester_Show_05_05"); //JSI VELMI ŠŤASTNÝ MUŽ, CIZINČE: SPÁČ TAKTO NEPROMLOUVÁ K MNOHA LIDEM.
BaalNamib_Ansprechbar = TRUE;
AI_StopProcessInfos(self);
};
instance DIA_Lester_GuideOffer(C_Info)
{
npc = PC_Psionic;
nr = 5;
condition = DIA_Lester_GuideOffer_Condition;
information = DIA_Lester_GuideOffer_Info;
permanent = 0;
description = "Jak se mám tady v táboře vyznat?";
};
func int DIA_Lester_GuideOffer_Condition()
{
if(Npc_KnowsInfo(hero,DIA_Lester_Hallo) && (Kapitel < 3))
{
return 1;
};
};
func void DIA_Lester_GuideOffer_Info()
{
AI_Output(other,self,"DIA_Lester_GuideOffer_15_00"); //Jak se mám tady v táboře vyznat?
AI_Output(self,other,"DIA_Lester_GuideOffer_05_01"); //Můžu ti ukázat nejdůležitější místa.
};
instance PC_Psionic_SOON(C_Info)
{
npc = PC_Psionic;
condition = PC_Psionic_SOON_Condition;
information = PC_Psionic_SOON_Info;
important = 0;
permanent = 1;
description = "Už tam budeme?";
};
func int PC_Psionic_SOON_Condition()
{
if(Npc_KnowsInfo(hero,DIA_Lester_GuideOffer) && (Kapitel < 3) && (LesterGuide >= 1))
{
return TRUE;
};
};
func void PC_Psionic_SOON_Info()
{
AI_Output(other,self,"PC_Psionic_SOON_Info_15_01"); //Už tam budeme?
AI_Output(self,other,"PC_Psionic_SOON_Info_05_02"); //Když se mě přestaneš ptát, budeme moci jít rychleji.
AI_StopProcessInfos(self);
};
instance PC_Psionic_CHANGE(C_Info)
{
npc = PC_Psionic;
condition = PC_Psionic_CHANGE_Condition;
information = PC_Psionic_CHANGE_Info;
important = 0;
permanent = 1;
description = "Rozmyslel jsem se.";
};
func int PC_Psionic_CHANGE_Condition()
{
if(Npc_KnowsInfo(hero,DIA_Lester_GuideOffer) && (Kapitel < 3) && (LesterGuide >= 1))
{
return TRUE;
};
};
func void PC_Psionic_CHANGE_Info()
{
AI_Output(other,self,"PC_Psionic_CHANGE_Info_15_01"); //Rozmyslel jsem se.
AI_Output(self,other,"PC_Psionic_CHANGE_Info_05_02"); //Doufám, že víš, kde mě najdeš.
AI_StopProcessInfos(self);
LesterGuide = 0;
Npc_ExchangeRoutine(self,"START");
};
instance PC_Psionic_GUIDEFIRST(C_Info)
{
npc = PC_Psionic;
nr = 5;
condition = PC_Psionic_GUIDEFIRST_Condition;
information = PC_Psionic_GUIDEFIRST_Info;
important = 0;
permanent = 1;
description = "Ukaž mi cestu...";
};
func int PC_Psionic_GUIDEFIRST_Condition()
{
if(Npc_KnowsInfo(hero,DIA_Lester_GuideOffer) && (Kapitel < 3) && (LesterGuide == 0))
{
return TRUE;
};
};
func void PC_Psionic_GUIDEFIRST_Info()
{
AI_Output(other,self,"PC_Psionic_GUIDEFIRST_Info_15_01"); //Ukaž mi cestu...
Info_ClearChoices(PC_Psionic_GUIDEFIRST);
Info_AddChoice(PC_Psionic_GUIDEFIRST,DIALOG_BACK,PC_Psionic_GUIDEFIRST_BACK);
Info_AddChoice(PC_Psionic_GUIDEFIRST,"zpátky k hlavní bráně.",PC_Psionic_GUIDEFIRST_MAINGATE);
Info_AddChoice(PC_Psionic_GUIDEFIRST,"do kovářství.",PC_Psionic_GUIDEFIRST_SMITH);
Info_AddChoice(PC_Psionic_GUIDEFIRST,"do chrámu.",PC_Psionic_GUIDEFIRST_TEMPEL);
Info_AddChoice(PC_Psionic_GUIDEFIRST,"k učitelům.",PC_Psionic_GUIDEFIRST_TRAIN);
Info_AddChoice(PC_Psionic_GUIDEFIRST,"do alchymistické dílny.",PC_Psionic_GUIDEFIRST_HERB);
Info_AddChoice(PC_Psionic_GUIDEFIRST,"do volné chatrče.",pc_psionic_guidefirst_hut);
};
func void PC_Psionic_GUIDEFIRST_MAINGATE()
{
Npc_ClearAIQueue(self);
Info_ClearChoices(PC_Psionic_GUIDEFIRST);
LesterGuide = 0;
AI_StopProcessInfos(self);
Npc_ExchangeRoutine(self,"START");
};
func void PC_Psionic_GUIDEFIRST_SMITH()
{
AI_Output(other,self,"PC_Psionic_GUIDEFIRST_SMITH_Info_15_01"); //...do kovářského krámu.
AI_Output(self,other,"PC_Psionic_GUIDEFIRST_SMITH_Info_05_02"); //Pojď za mnou!
LesterGuide = 1;
AI_StopProcessInfos(self);
Npc_ExchangeRoutine(self,"GUIDETOSMITH");
};
func void PC_Psionic_GUIDEFIRST_TEMPEL()
{
AI_Output(other,self,"PC_Psionic_GUIDEFIRST_TEMPEL_Info_15_01"); //...do chrámu.
AI_Output(self,other,"PC_Psionic_GUIDEFIRST_TEMPEL_Info_05_02"); //Pojď za mnou!
LesterGuide = 2;
AI_StopProcessInfos(self);
Npc_ExchangeRoutine(self,"GUIDETOTEMPEL");
};
func void PC_Psionic_GUIDEFIRST_TRAIN()
{
AI_Output(other,self,"PC_Psionic_GUIDEFIRST_TRAIN_Info_15_01"); //...k učitelům.
AI_Output(self,other,"PC_Psionic_GUIDEFIRST_TARIN_Info_05_02"); //Pojď za mnou!
LesterGuide = 3;
AI_StopProcessInfos(self);
Npc_ExchangeRoutine(self,"GUIDETOTRAIN");
};
func void PC_Psionic_GUIDEFIRST_HERB()
{
AI_Output(other,self,"PC_Psionic_GUIDEFIRST_HERB_Info_15_01"); //...do alchymistické dílny.
AI_Output(self,other,"PC_Psionic_GUIDEFIRST_HERB_Info_05_02"); //Pojď za mnou!
LesterGuide = 4;
AI_StopProcessInfos(self);
Npc_ExchangeRoutine(self,"GUIDETOHERB");
};
func void pc_psionic_guidefirst_hut()
{
AI_Output(other,self,"PC_Psionic_GUIDEFIRST_HUT_Info_15_01"); //… k nějaké neobsazené chýši.
AI_Output(self,other,"PC_Psionic_GUIDEFIRST_HERB_Info_05_02"); //Pojď za mnou!
LesterGuide = 5;
AI_StopProcessInfos(self);
Npc_ExchangeRoutine(self,"GUIDETOHEROHUT");
};
func void PC_Psionic_GUIDEFIRST_BACK()
{
Info_ClearChoices(PC_Psionic_GUIDEFIRST);
};
instance PC_Psionic_TRAIN(C_Info)
{
npc = PC_Psionic;
condition = PC_Psionic_TRAIN_Condition;
information = PC_Psionic_TRAIN_Info;
important = 1;
permanent = 1;
};
func int PC_Psionic_TRAIN_Condition()
{
if((Npc_GetDistToWP(self,"PSI_PATH_9_4") < 500) && (LesterGuide == 3))
{
return TRUE;
};
};
func void PC_Psionic_TRAIN_Info()
{
AI_Output(self,other,"PC_Psionic_TRAIN_Info_05_01"); //Dole najdeš Baala Cadara. Vyučuje novice.
AI_PointAt(self,"PSI_PATH_9_14");
AI_StopPointAt(self);
AI_Output(self,other,"PC_Psionic_TRAIN_Info_05_02"); //Když vylezeš po tomhle žebříku, dostaneš se na templářské cvičiště. Budu tady na tebe čekat. Kdyby ses zpozdil, budu zase u Baala Namiba u vchodu do tábora.
LesterGuide = 0;
Npc_ExchangeRoutine(self,"START");
AI_StopProcessInfos(self);
TA_BeginOverlay(self);
TA_Stay(0,0,0,55,"PSI_PATH_9_4");
TA_EndOverlay(self);
};
instance PC_Psionic_TEMPEL(C_Info)
{
npc = PC_Psionic;
condition = PC_Psionic_TEMPEL_Condition;
information = PC_Psionic_TEMPEL_Info;
important = 1;
permanent = 0;
};
func int PC_Psionic_TEMPEL_Condition()
{
if((Npc_GetDistToWP(self,"PSI_TEMPLE_NOVIZE_PR") < 600) && (LesterGuide == 2))
{
return TRUE;
};
};
func void PC_Psionic_TEMPEL_Info()
{
AI_Output(self,other,"PC_Psionic_TEMPEL_Info_05_01"); //Tohle je chrám! Počkám na tebe, ale když ti to bude moc dlouho trvat, půjdu zpátky k Baalu Namibovi.
LesterGuide = 0;
Npc_ExchangeRoutine(self,"START");
AI_StopProcessInfos(self);
TA_BeginOverlay(self);
TA_Stay(0,0,1,0,"PSI_TEMPLE_NOVIZE_PR");
TA_EndOverlay(self);
};
instance PC_Psionic_SMITH(C_Info)
{
npc = PC_Psionic;
condition = PC_Psionic_SMITH_Condition;
information = PC_Psionic_SMITH_Info;
important = 1;
permanent = 0;
};
func int PC_Psionic_SMITH_Condition()
{
if((Npc_GetDistToWP(self,"PSI_SMITH_IN") < 900) && (LesterGuide == 1))
{
return 1;
};
};
func void PC_Psionic_SMITH_Info()
{
AI_Output(self,other,"PC_Psionic_SMITH_Info_05_01"); //Tohle je kovárna. Rozhlédni se tu. Počkám na tebe asi hodinu, pak půjdu pryč.
LesterGuide = 0;
Npc_ExchangeRoutine(self,"START");
AI_StopProcessInfos(self);
TA_BeginOverlay(self);
TA_Stay(0,0,1,0,"PSI_SMITH_IN");
TA_EndOverlay(self);
};
instance PC_Psionic_HERB(C_Info)
{
npc = PC_Psionic;
condition = PC_Psionic_HERB_Condition;
information = PC_Psionic_HERB_Info;
important = 1;
permanent = 0;
};
func int PC_Psionic_HERB_Condition()
{
if((Npc_GetDistToWP(self,"PSI_WALK_06") < 800) && (LesterGuide == 4))
{
return TRUE;
};
};
func void PC_Psionic_HERB_Info()
{
AI_Output(self,other,"PC_Psionic_HERB_Info_05_01"); //Když vylezeš po tomhle žebříku, dostaneš se k alchymistovi Corovi Kalomovi. Dole je Fortuno, obchodník s drogou.
AI_Output(self,other,"PC_Psionic_HERB_Info_05_02"); //Počkám tu na tebe. Nebuď tam ale moc dlouho, jinak se vrátím zpátky.
LesterGuide = 0;
Npc_ExchangeRoutine(self,"START");
AI_StopProcessInfos(self);
TA_BeginOverlay(self);
TA_Stay(0,0,1,0,"PSI_32_HUT_EX");
TA_EndOverlay(self);
};
instance PC_PSIONIC_HUT(C_Info)
{
npc = PC_Psionic;
condition = pc_psionic_hut_condition;
information = pc_psionic_hut_info;
important = 1;
permanent = 0;
};
func int pc_psionic_hut_condition()
{
if((Npc_GetDistToWP(self,"PSI_PATH_4_11") < 800) && (LesterGuide == 5))
{
return TRUE;
};
};
func void pc_psionic_hut_info()
{
AI_Output(self,other,"PC_Psionic_HUT_Info_06_10"); //Vylez po tomhle žebříku a dostaneš se k volné chatrči.
AI_Output(self,other,"PC_Psionic_HUT_Info_06_12"); //Normálně necháváme spát v našich chatrčích pouze členy tábora nebo nově příchozí.
AI_Output(self,other,"PC_Psionic_HUT_Info_06_13"); //Takže buď opatrný, aby jsi do naší chatrče nevlezl jako člen jiného tábora.
AI_Output(self,other,"PC_Psionic_HUT_Info_06_14"); //Templáři dokáží reagovat dost nelibě, pokud porušíš naše pravidla.
AI_Output(self,other,"PC_Psionic_HUT_Info_06_11"); //Rozhlédni se kolem, počkám tě tu. Ale ať ti to netrvá dlouho, jinak se vracím zpátky ke vchodu.
LesterGuide = 0;
Npc_ExchangeRoutine(self,"START");
AI_StopProcessInfos(self);
TA_BeginOverlay(self);
TA_Stay(0,0,1,0,"PSI_PATH_4_11");
TA_EndOverlay(self);
};
instance PC_Psionic_SEND(C_Info)
{
npc = PC_Psionic;
condition = PC_Psionic_SEND_Condition;
information = PC_Psionic_SEND_Info;
important = 1;
permanent = 0;
};
func int PC_Psionic_SEND_Condition()
{
if((Npc_GetTrueGuild(hero) != GIL_None) && (YBerion_BringFocus != LOG_RUNNING) && (YBerion_BringFocus != LOG_SUCCESS))
{
return 1;
};
};
func void PC_Psionic_SEND_Info()
{
AI_GotoNpc(self,hero);
if(Npc_KnowsInfo(hero,DIA_Lester_Hallo))
{
AI_Output(self,other,"PC_Psionic_SEND_Info_05_00"); //Jsem rád, že jsi tady. Mám pro tebe noviny.
AI_Output(other,self,"PC_Psionic_SEND_Info_15_01"); //Doufám, že dobré.
};
AI_Output(self,other,"PC_Psionic_SEND_Info_05_02"); //Naše Bratrstvo plánuje nesmírně velkou věc.
AI_Output(other,self,"PC_Psionic_SEND_Info_15_03"); //Co plánuje? Prolomení?
AI_Output(self,other,"PC_Psionic_SEND_Info_05_04"); //Guru se pokoušejí spojit se se Spáčem. Potřebují ale nějak sjednotit své síly.
AI_Output(other,self,"PC_Psionic_SEND_Info_15_05"); //No a?
AI_Output(self,other,"PC_Psionic_SEND_Info_05_06"); //Potřebují magický předmět, ohnisko.
B_Kapitelwechsel(2);
};
instance PC_Psionic_BROTHERHOOD_TODO(C_Info)
{
npc = PC_Psionic;
condition = PC_Psionic_BROTHERHOOD_TODO_Condition;
information = PC_Psionic_BROTHERHOOD_TODO_Info;
important = 0;
permanent = 0;
description = "A co já s tím mám dělat?";
};
func int PC_Psionic_BROTHERHOOD_TODO_Condition()
{
if(Npc_KnowsInfo(hero,PC_Psionic_SEND))
{
return TRUE;
};
};
func void PC_Psionic_BROTHERHOOD_TODO_Info()
{
var C_Npc YBerion;
AI_Output(other,self,"PC_Psionic_BROTHERHOOD_TODO_15_01"); //A co já s tím mám dělat?
AI_Output(self,other,"PC_Psionic_BROTHERHOOD_TODO_05_02"); //Promluv s Y´Berionem. Je tady nejmocnější muž. Je to možnost, jak u něj dosáhnout obliby.
AI_Output(other,self,"PC_Psionic_BROTHERHOOD_TODO_15_03"); //Kde ho najdu?
AI_Output(self,other,"PC_Psionic_BROTHERHOOD_TODO_05_04"); //Jdi do chrámu. Zřídkakdy ho opouští. Zřejmě se v těch chladných zdech cítí být blíž Spáčovi.
if(Npc_GetTrueGuild(hero) == GIL_NOV)
{
AI_Output(self,other,"PC_Psionic_BROTHERHOOD_TODO_05_05"); //Promluv si s Baal Namibem. Aby jsi mohl vstoupit na Chrámovou horu, budeš jako jeden z našich noviců potřebovat povolení od Guru. Poučí stráže, aby tě nechali projít.
};
Log_CreateTopic(CH2_Focus,LOG_MISSION);
Log_SetTopicStatus(CH2_Focus,LOG_RUNNING);
B_LogEntry(CH2_Focus,"Novic Lester mi řekl, že se Y´Berion shání po kouzelném ohniskovém kameni. Guru je v chrámové hoře.");
YBerion = Hlp_GetNpc(GUR_1200_YBerion);
YBerion.aivar[AIV_FINDABLE] = TRUE;
};
instance PC_Psionic_FOLLOWME(C_Info)
{
npc = PC_Psionic;
condition = PC_Psionic_FOLLOWME_Condition;
information = PC_Psionic_FOLLOWME_Info;
important = 1;
permanent = 0;
};
func int PC_Psionic_FOLLOWME_Condition()
{
if((Npc_GetDistToWP(hero,"LOCATION_19_01") < 400) && (Npc_GetDistToNpc(hero,self) < 400))
{
return TRUE;
};
};
func void PC_Psionic_FOLLOWME_Info()
{
AI_GotoNpc(self,hero);
AI_Output(self,other,"PC_Psionic_FOLLOWME_Info_05_01"); //Hej, co tady děláš?
AI_Output(other,self,"PC_Psionic_FOLLOWME_Info_15_02"); //Přišel jsem na rozkaz mágů Vody. Hledám kouzelné artefakty, takzvané ohniskové kameny.
AI_Output(self,other,"PC_Psionic_FOLLOWME_Info_05_03"); //Hledáš ohniskové kameny? Jsi opravdu smělý.
AI_Output(other,self,"PC_Psionic_FOLLOWME_Info_15_04"); //Saturas a ostatní mágové z Nového tábora je chtějí použít k rozboření Bariéry, aby nás osvobodili z našeho uvěznění.
AI_Output(self,other,"PC_Psionic_FOLLOWME_Info_05_05"); //Tomu uvěřím, jedině až to uvidím na vlastní oči.
AI_Output(other,self,"PC_Psionic_FOLLOWME_Info_15_06"); //Taky to tak cítím. Ale řekni mi, proč jsi sem přišel?
AI_Output(self,other,"PC_Psionic_FOLLOWME_Info_05_07"); //Zvažuju, jestli má cenu se vydat na návštěvu horské pevnosti.
AI_Output(self,other,"PC_Psionic_FOLLOWME_Info_05_08"); //Víš... existuje jeden dokument, který bych rád získal. Na druhou stranu je to nebezpečné, tam chodit.
};
instance PC_Psionic_GOLEM(C_Info)
{
npc = PC_Psionic;
condition = PC_Psionic_GOLEM_Condition;
information = PC_Psionic_GOLEM_Info;
important = 0;
permanent = 0;
description = "Jak se ti podařilo přejít přes ty hory?";
};
func int PC_Psionic_GOLEM_Condition()
{
if(Npc_KnowsInfo(hero,PC_Psionic_FOLLOWME) && !Npc_KnowsInfo(hero,PC_Psionic_FINISH))
{
return TRUE;
};
};
func void PC_Psionic_GOLEM_Info()
{
AI_Output(other,self,"PC_Psionic_NORMAL_Info_15_01"); //Jak se ti podařilo přejít přes ty hory?
AI_Output(self,other,"PC_Psionic_NORMAL_Info_05_02"); //Hodně jsem se toho naučil od Guru. Jejich kouzla můžou být opravdu užitečná.
};
instance PC_Psionic_STORY(C_Info)
{
npc = PC_Psionic;
condition = PC_Psionic_STORY_Condition;
information = PC_Psionic_STORY_Info;
important = 0;
permanent = 0;
description = "Ten dokument, co ho chceš... co je to zač?";
};
func int PC_Psionic_STORY_Condition()
{
if(Npc_KnowsInfo(hero,PC_Psionic_FOLLOWME))
{
return TRUE;
};
};
func void PC_Psionic_STORY_Info()
{
AI_Output(other,self,"PC_Psionic_STORY_Info_15_01"); //Ten dokument, co ho chceš... co je to zač?
AI_Output(self,other,"PC_Psionic_STORY_Info_05_02"); //Před mnoha lety žil v té horské pevnosti pán této oblasti. Měl pod kontrolou zem i doly.
AI_Output(self,other,"PC_Psionic_STORY_Info_05_03"); //Tak jako ostatní šlechtici i on samozřejmě měl dokument, který potvrzoval jeho lenní majetek. A právě to je ten dokument.
AI_Output(other,self,"PC_Psionic_STORY_Info_15_04"); //Ale od té doby, co jsme tu drženi Bariérou, už není k ničemu užitečný.
AI_Output(self,other,"PC_Psionic_STORY_Info_05_05"); //To je pravda. Pokud se ale mágům Vody podaří zničit Bariéru, dokument znovu nabude značné hodnoty.
};
instance PC_Psionic_COMEWITHME(C_Info)
{
npc = PC_Psionic;
condition = PC_Psionic_COMEWITHME_Condition;
information = PC_Psionic_COMEWITHME_Info;
important = 0;
permanent = 0;
description = "Mohli bychom se podívat na tu pevnost společně.";
};
func int PC_Psionic_COMEWITHME_Condition()
{
if(Npc_KnowsInfo(hero,PC_Psionic_STORY) && Npc_KnowsInfo(hero,PC_Psionic_GOLEM))
{
return TRUE;
};
};
func void PC_Psionic_COMEWITHME_Info()
{
AI_Output(other,self,"PC_Psionic_COMEWITHME_Info_15_01"); //Mohli bysme se podívat na tu pevnost společně.
AI_Output(self,other,"PC_Psionic_COMEWITHME_Info_05_02"); //To je dobrý nápad. Jdi první, zůstanu blízko tebe.
Log_CreateTopic(CH3_Fortress,LOG_MISSION);
Log_SetTopicStatus(CH3_Fortress,LOG_RUNNING);
B_LogEntry(CH3_Fortress,"Před mohutnou pevností, která byla vybudována v horách, jsem se setkal s novicem Lesterem z Tábora v bažinách. Rozhlížel se v budově po nějaké listině a přidal se ke mně při hledání ohniska.");
self.aivar[AIV_PARTYMEMBER] = TRUE;
Npc_ExchangeRoutine(self,"FORTRESSFOLLOW");
AI_StopProcessInfos(self);
};
instance PC_Psionic_FOKUSPLACE(C_Info)
{
npc = PC_Psionic;
condition = PC_Psionic_FOKUSPLACE_Condition;
information = PC_Psionic_FOKUSPLACE_Info;
important = 1;
permanent = 0;
};
func int PC_Psionic_FOKUSPLACE_Condition()
{
if(Npc_GetDistToWP(hero,"LOCATION_19_03_PATH_RUIN7") < 400)
{
return TRUE;
};
};
func void PC_Psionic_FOKUSPLACE_Info()
{
AI_GotoNpc(self,hero);
AI_Output(self,other,"PC_Psionic_FOKUSPLACE_Info_05_01"); //Podívej, tohle vypadá jako to ohnisko, co hledáš.
AI_Output(other,self,"PC_Psionic_FOKUSPLACE_Info_15_02"); //Ano, vypadá to jako ohnisková rovina, hmm... Není snadné se k tomu dostat...
AI_StopProcessInfos(self);
B_LogEntry(CH3_Fortress,"Ohnisko, které hledám, stojí na podstavci. Je však příliš vysoko, než abych pro něj mohl vylézt. Musím najít nějaký způsob, jak tento artefakt získat.");
Wld_InsertNpc(Harpie,"LOCATION_19_03_ENTRANCE_HARPYE");
Wld_InsertNpc(Harpie,"LOCATION_19_03_ENTRANCE_HARPYE2");
Wld_InsertNpc(Harpie,"LOCATION_19_03_ENTRANCE_HARPYE3");
};
instance PC_Psionic_COMEBACK(C_Info)
{
npc = PC_Psionic;
condition = PC_Psionic_COMEBACK_Condition;
information = PC_Psionic_COMEBACK_Info;
important = 1;
permanent = 0;
};
func int PC_Psionic_COMEBACK_Condition()
{
if((Npc_GetDistToWP(hero,"PATH_TO_PLATEAU04_BRIDGE2") < 600) && Npc_KnowsInfo(hero,PC_Psionic_FOLLOWME) && !Npc_HasItems(hero,Focus_3))
{
return TRUE;
};
};
func void PC_Psionic_COMEBACK_Info()
{
AI_GotoNpc(self,hero);
AI_Output(self,other,"PC_Psionic_COMEBACK_Info_05_01"); //Kam jdeš? Ještě jsme tady neskončili!
self.aivar[AIV_PARTYMEMBER] = FALSE;
Npc_ExchangeRoutine(self,"FORTRESSWAIT");
AI_StopProcessInfos(self);
};
instance PC_Psionic_IAMHURT(C_Info)
{
npc = PC_Psionic;
condition = PC_Psionic_IAMHURT_Condition;
information = PC_Psionic_IAMHURT_Info;
important = 0;
permanent = 0;
description = "Jsem raněný. Můžeš mi pomoci?";
};
func int PC_Psionic_IAMHURT_Condition()
{
if((hero.attribute[ATR_HITPOINTS] < (hero.attribute[ATR_HITPOINTS_MAX] / 2)) && Npc_KnowsInfo(hero,PC_Psionic_FOLLOWME))
{
return TRUE;
};
};
func void PC_Psionic_IAMHURT_Info()
{
AI_Output(other,self,"PC_Psionic_IAMHURT_Info_15_01"); //Jsem raněný. Můžeš mi pomoci?
AI_Output(self,other,"PC_Psionic_IAMHURT_Info_05_02"); //Vezmi si tenhle hojivý lektvar.
CreateInvItem(self,ItFo_Potion_Health_02);
B_GiveInvItems(self,hero,ItFo_Potion_Health_02,1);
};
instance PC_Psionic_URKUNDE(C_Info)
{
npc = PC_Psionic;
condition = PC_Psionic_URKUNDE_Condition;
information = PC_Psionic_URKUNDE_Info;
important = 0;
permanent = 0;
description = "Našel jsem ten dokument.";
};
func int PC_Psionic_URKUNDE_Condition()
{
if(Npc_HasItems(hero,ItWr_Urkunde_01) && Npc_KnowsInfo(hero,PC_Psionic_STORY))
{
return TRUE;
};
};
func void PC_Psionic_URKUNDE_Info()
{
AI_Output(other,self,"PC_Psionic_URKUNDE_Info_15_01"); //Našel jsem ten dokument.
AI_Output(self,other,"PC_Psionic_URKUNDE_Info_05_02"); //Hej, dobrá práce. Vezmi si za odměnu tyto kouzelné svitky. S nimi se dostaneš k tomu ohnisku.
AI_Output(self,other,"PC_Psionic_URKUNDE_Info_05_03"); //Počkám na tebe dole u té ohniskové roviny.
B_LogEntry(CH3_Fortress,"Listina, po které se sháněl Lester, byla v jedné truhlici. Výměnou mi dal čtyři kouzelné svitky telekineze, pomocí kterých dostanu to ohnisko.");
CreateInvItems(self,ItArScrollTelekinesis,4);
B_GiveInvItems(self,hero,ItArScrollTelekinesis,4);
B_GiveInvItems(hero,self,ItWr_Urkunde_01,1);
Npc_ExchangeRoutine(self,"WaitAtFocus");
AI_StopProcessInfos(self);
};
instance PC_Psionic_TIP(C_Info)
{
npc = PC_Psionic;
condition = PC_Psionic_TIP_Condition;
information = PC_Psionic_TIP_Info;
important = 0;
permanent = 0;
description = "Jak se dostanu k tomu ohnisku?";
};
func int PC_Psionic_TIP_Condition()
{
if(Npc_KnowsInfo(hero,PC_Psionic_URKUNDE) && !Npc_HasItems(hero,Focus_3))
{
return TRUE;
};
};
func void PC_Psionic_TIP_Info()
{
AI_Output(other,self,"PC_Psionic_TIP_Info_15_01"); //Jak se dostanu k tomu ohnisku?
AI_Output(self,other,"PC_Psionic_TIP_Info_05_02"); //Mistr Y´Berion obvykle říká: žák zkouší věcmi pohybovat pomocí rukou a nohou, mistr jimi pohybuje duchovní silou.
};
instance PC_Psionic_LEAVE(C_Info)
{
npc = PC_Psionic;
condition = PC_Psionic_LEAVE_Condition;
information = PC_Psionic_LEAVE_Info;
important = 1;
permanent = 0;
};
func int PC_Psionic_LEAVE_Condition()
{
if(!Npc_HasItems(hero,Focus_3) && !Npc_HasItems(self,ItWr_Urkunde_01) && (Npc_GetDistToWP(hero,"PATH_TO_PLATEAU04_BRIDGE2") < 900))
{
return TRUE;
};
};
func void PC_Psionic_LEAVE_Info()
{
AI_GotoNpc(self,hero);
AI_Output(self,other,"PC_Psionic_LEAVE_Info_05_01"); //Zůstanu tady, abych našel ten dokument.
self.aivar[AIV_PARTYMEMBER] = FALSE;
Npc_ExchangeRoutine(self,"BOOK");
AI_StopProcessInfos(self);
};
instance PC_Psionic_BALKON(C_Info)
{
npc = PC_Psionic;
condition = PC_Psionic_BALKON_Condition;
information = PC_Psionic_BALKON_Info;
important = 1;
permanent = 0;
};
func int PC_Psionic_BALKON_Condition()
{
if(!Npc_HasItems(self,ItWr_Urkunde_01) && (Npc_GetDistToWP(hero,"LOCATION_19_03_PEMTAGRAM2") < 1000))
{
return TRUE;
};
};
func void PC_Psionic_BALKON_Info()
{
AI_GotoNpc(self,hero);
AI_Output(self,other,"PC_Psionic_BALKON_Info_05_01"); //Půjdu a porozhlédnu se tady.
AI_StopProcessInfos(self);
Npc_ExchangeRoutine(self,"BALKON");
};
instance PC_Psionic_FINISH(C_Info)
{
npc = PC_Psionic;
condition = PC_Psionic_FINISH_Condition;
information = PC_Psionic_FINISH_Info;
important = 1;
permanent = 0;
};
func int PC_Psionic_FINISH_Condition()
{
if(Npc_HasItems(hero,Focus_3) && Npc_KnowsInfo(hero,PC_Psionic_URKUNDE))
{
return TRUE;
};
};
func void PC_Psionic_FINISH_Info()
{
AI_Output(self,other,"PC_Psionic_FINISH_Info_05_01"); //Ještě nemáme oba to, co jsme chtěli. Já zůstanu tady, abych si přečetl ty staré knihy.
AI_Output(other,self,"PC_Psionic_FINISH_Info_15_02"); //Dobře, ještě se sejdeme.
B_LogEntry(CH3_Fortress,"Získal jsem ohnisko. Lester se chce ještě porozhlédnout po knihovně v pevnosti. Doufám, že se s ním ještě uvidím.");
self.aivar[AIV_PARTYMEMBER] = FALSE;
Npc_ExchangeRoutine(self,"BOOK");
AI_StopProcessInfos(self);
};
instance PC_Psionic_CHESTCLOSED(C_Info)
{
npc = PC_Psionic;
condition = PC_Psionic_CHESTCLOSED_Condition;
information = PC_Psionic_CHESTCLOSED_Info;
important = 0;
permanent = 0;
description = "Našel jsi něco?";
};
func int PC_Psionic_CHESTCLOSED_Condition()
{
if(!Npc_HasItems(hero,Focus_3) && !Npc_HasItems(self,ItWr_Urkunde_01) && (Npc_GetDistToWP(hero,"LOCATION_19_03_SECOND_ETAGE_BALCON") < 500))
{
return TRUE;
};
};
func void PC_Psionic_CHESTCLOSED_Info()
{
AI_Output(other,self,"PC_Psionic_CHESTCLOSED_Info_15_01"); //Našel jsi něco?
AI_Output(self,other,"PC_Psionic_CHESTCLOSED_Info_05_02"); //Ta truhla je zamčená. Možná k ní najdeme klíč někde v pevnosti.
AI_Output(self,other,"PC_Psionic_CHESTCLOSED_Info_05_03"); //Už jsi našel ten dokument?
AI_Output(other,self,"PC_Psionic_CHESTCLOSED_Info_15_04"); //Ještě ne.
AI_Output(self,other,"PC_Psionic_CHESTCLOSED_Info_05_05"); //Hledal jsi v knihovně?
AI_StopProcessInfos(self);
};
instance PC_Psionic_COMEAGAIN(C_Info)
{
npc = PC_Psionic;
condition = PC_Psionic_COMEAGAIN_Condition;
information = PC_Psionic_COMEAGAIN_Info;
important = 0;
permanent = 0;
description = "Prozkoumáme pevnost společně.";
};
func int PC_Psionic_COMEAGAIN_Condition()
{
if(Npc_KnowsInfo(hero,PC_Psionic_LEAVE) && !Npc_HasItems(hero,Focus_3))
{
return TRUE;
};
};
func void PC_Psionic_COMEAGAIN_Info()
{
AI_Output(other,self,"PC_Psionic_COMEAGAIN_Info_15_01"); //Prozkoumáme pevnost společně.
AI_Output(self,other,"PC_Psionic_COMEAGAIN_Info_05_02"); //Dobře, jdi první!
self.aivar[AIV_PARTYMEMBER] = TRUE;
Npc_ExchangeRoutine(self,"FORTRESSFOLLOW");
AI_StopProcessInfos(self);
};
instance Info_Lester_DIEGOMILTEN(C_Info)
{
npc = PC_Psionic;
condition = Info_Lester_DIEGOMILTEN_Condition;
information = Info_Lester_DIEGOMILTEN_Info;
important = 0;
permanent = 0;
description = "Potkal jsem přes Starým táborem Diega a Miltena!";
};
func int Info_Lester_DIEGOMILTEN_Condition()
{
if(Npc_KnowsInfo(hero,Info_Diego_OCFAVOR))
{
return TRUE;
};
};
func void Info_Lester_DIEGOMILTEN_Info()
{
AI_Output(hero,self,"Info_SFB_1_DieLage_15_00"); //Jak se máš?
AI_Output(self,hero,"PC_Psionic_FOLLOWME_Info_05_01"); //Hej, co tady děláš?
AI_Output(hero,self,"Info_Saturas_COLLAPSE_15_01"); //Starý důl se zhroutil potom, co ho zatopila voda!
AI_Output(self,hero,"DIA_Fingers_BecomeShadow_05_01"); //No a?
AI_Output(hero,self,"Info_Xardas_KDW_15_01"); //Všichni mágové Ohně jsou mrtví!
AI_Output(hero,self,"Info_Xardas_KDW_15_02"); //Gomez je povraždil.
AI_Output(self,hero,"SVM_5_GetThingsRight"); //To nebude snadné napravit!
AI_Output(hero,self,"Info_Gorn_DIEGOMILTEN_15_01"); //Potkal jsem přes Starým táborem Diega a Miltena!
AI_Output(hero,self,"Info_lester_DIEGOMILTEN_15_01"); //Chtěli se s tebou setkat. Na obvyklém místě.
AI_Output(self,hero,"SVM_5_YeahWellDone"); //Už bylo na čase!
AI_Output(other,self,"Info_Gorn_RUINWALLWHAT_15_01"); //Co se děje?
AI_Output(self,hero,"Info_lester_DIEGOMILTEN_05_02"); //Zůstanu tady, abych si přečetl ty staré knihy.
AI_Output(hero,self,"KDW_600_Saturas_OATH_Info_15_06"); //Uch... Nerozumím...
AI_Output(self,hero,"PC_Psionic_TIP_Info_05_02"); //Mistr Y´Berion obvykle říká: žák zkouší věcmi pohybovat pomocí rukou a nohou, mistr jimi pohybuje duchovní silou.
AI_Output(hero,self,"Info_Grd_6_DasLager_WasIstAerger_15_04"); //Dobře, dobře. Dám si pozor.
AI_Output(self,hero,"DIA_Fingers_Lehrer_Pickpocket2_05_03"); //Opatruj se.
AI_Output(hero,self,"Info_FreemineOrc_EXIT_15_03"); //Děkuju. Půjdu si svou cestou.
AI_Output(self,hero,"Info_Lester_EXIT_05_01"); //Pojďme!
B_GiveXP(XP_MessageForGorn);
Npc_ExchangeRoutine(PC_Psionic,"MEETING");
if(warned_gorn_or_lester == FALSE)
{
warned_gorn_or_lester = TRUE;
}
else
{
B_LogEntry(CH4_4Friends,"Řekl jsem Lesterovi a Gornovi o setkání s jejich přáteli. Teď už to není moje věc. Dál si poradí sami...");
Log_SetTopicStatus(CH4_4Friends,LOG_SUCCESS);
};
AI_StopProcessInfos(self);
};
instance DIA_LESTER_MYOWNHUT(C_Info)
{
npc = PC_Psionic;
nr = 10;
condition = dia_lester_ownhut_condition;
information = dia_lester_ownhut_info;
permanent = 1;
description = "Můžu se tu někde vyspat?";
};
func int dia_lester_ownhut_condition()
{
if((Npc_KnowsInfo(hero,DIA_Lester_Hallo) || Npc_KnowsInfo(hero,DIA_Lester_Sakrileg)) && (Kapitel < 3))
{
return 1;
};
};
func void dia_lester_ownhut_info()
{
AI_Output(other,self,"DIA_Lester_Hut_12_10"); //Můžu se tu někde vyspat?
AI_Output(self,other,"DIA_Lester_Hut_12_20"); //Ano, jedna z chatrčí kousek od středu tábora se nedávno uvolnila.
AI_Output(self,other,"DIA_Lester_Hut_12_30"); //Pokud chceš, můžu tě tam vzít a ukázat ti kde to je.
};
|
D
|
/root/Documents/daily/3_6_20/target/debug/yahtzee: /root/Documents/daily/3_6_20/src/main.rs
|
D
|
module http.protocol.FileEntity;
import http.protocol.Entity;
import http.protocol.Date;
import http.poller.FilePoller;
import http.server.Connection;
import dlog.Logger;
class FileEntity : Entity
{
FilePoller * m_poller;
this(string a_path)
{
m_poller = fileCache.get(a_path, { return new FilePoller(a_path); } );
}
this(FilePoller * a_poller)
{
m_poller = a_poller;
}
bool send(char[] header, Connection connection)
{
if(m_poller.stream())
{
log.trace("Response is too BIG to be sent in oneshot, writing header");
return connection.writeAll(header) && connection.writeFile(m_poller);
}
else
{
log.trace("Response is small enough to be sent in oneshot");
return connection.writeAll(header ~ m_poller.content);
}
}
bool updated()
{
return m_poller.reload();
}
size_t length()
{
return m_poller.file.size();
}
string lastModified()
{
return convertToRFC1123(m_poller.lastModified());
}
}
|
D
|
module ut.concurrency.slist;
import concurrency.slist;
import concurrency.sender;
import concurrency.operations.whenall;
import concurrency.operations.then;
import concurrency.operations.via;
import concurrency.thread : ThreadSender;
import concurrency : sync_wait;
import std.range : walkLength;
import unit_threaded;
@("pushFront.race")
@safe unittest {
auto list = new shared SList!int;
auto filler = just(&list).then((shared SList!int* list) @safe shared {
foreach(i; 0..100) {
list.pushFront(i);
}
}).via(ThreadSender());
whenAll(filler, filler).sync_wait();
list[].walkLength.should == 200;
}
@("pushBack.race")
@safe unittest {
auto list = new shared SList!int;
auto filler = just(&list).then((shared SList!int* list) @safe shared {
foreach(i; 0..100) {
list.pushBack(i);
}
}).via(ThreadSender());
whenAll(filler, filler).sync_wait();
list[].walkLength.should == 200;
}
@("pushFront.adversary")
@safe unittest {
auto list = new shared SList!int;
foreach(i; 0..50)
list.pushFront(1);
auto filler = just(&list).then((shared SList!int* list) @safe shared {
foreach(i; 0..50) {
list.pushFront(1);
}
}).via(ThreadSender());
auto remover = just(&list).then((shared SList!int* list) @safe shared {
foreach(i; 0..50) {
list.remove(1);
}
}).via(ThreadSender());
whenAll(filler, remover).sync_wait();
list[].walkLength.should == 50;
}
@("pushBack.adversary")
@safe unittest {
auto list = new shared SList!int;
auto filler = just(&list).then((shared SList!int* list) @safe shared {
foreach(i; 0..100) {
list.pushBack(1);
}
}).via(ThreadSender());
auto remover = just(&list).then((shared SList!int* list) @safe shared {
int n = 0;
while(n < 99)
if (list.remove(1))
n++;
}).via(ThreadSender());
whenAll(filler, remover).sync_wait();
list[].walkLength.should == 1;
}
@("remove.race")
@safe unittest {
auto list = new shared SList!int;
foreach(i; 0..100)
list.pushFront(i);
auto remover = just(&list).then((shared SList!int* list) @safe shared {
foreach(i; 0..100) {
if (i % 10 > 4)
list.remove(i);
}
}).via(ThreadSender());
whenAll(remover, remover).sync_wait();
list[].walkLength.should == 50;
}
@("remove.adjacent")
@safe unittest {
auto list = new shared SList!int;
foreach(_; 0..2)
foreach(i; 0..100)
list.pushFront(i);
auto remover1 = just(&list).then((shared SList!int* list) @safe shared {
foreach(i; 0..100) {
if (i % 2 == 0)
list.remove(i);
}
}).via(ThreadSender());
auto remover2 = just(&list).then((shared SList!int* list) @safe shared {
foreach(i; 0..100) {
if (i % 2 == 1)
list.remove(i);
}
}).via(ThreadSender());
whenAll(remover1, remover2, remover1, remover2).sync_wait();
list[].walkLength.should == 0;
}
|
D
|
module util.Stack;
import std.stdio;
class StackException:Exception{
this(string msg){
super(msg);
}
}
class Stack(T)
{
T[] buf;
sizediff_t stackPtr;
this(T[] buf){
this.buf = buf;
}
this(){
this.buf = new T[4096];
}
this(size_t stackSize){
this.buf = new T[stackSize];
}
void push(T data){
if( stackPtr < buf.length ){
buf[stackPtr++] = data;
}else{
throw new StackException("Stack is full.");
}
}
T pop(){
T data;
if( stackPtr > 0 ){
data = buf[--stackPtr];
}else{
throw new StackException("Stack is empty.");
}
return data;
}
}
|
D
|
/+
The MIT License (MIT)
Copyright (c) <2013> <Oleg Butko (deviator), Anton Akzhigitov (Akzwar)>
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
+/
module desgl.ready.factory;
import std.string;
import std.exception;
import derelict.opengl3.gl3;
public import desmath.linear;
public import desgl.base;
import desgl.util.ext;
// Shader Permited Data Type
enum SPDType { NONE, FLOAT, VEC2, VEC3, VEC4, MAT2, MAT3, MAT4,
MAT3x2, MAT4x2, MAT2x3, MAT2x4, MAT3x4, MAT4x3, INT, IVEC2, IVEC3, IVEC4 }
struct ShaderVar
{
alias ShaderVar self;
enum Type { NONE, FLOAT, INT }
Type type = Type.NONE;
enum Form { SINGLE, VEC, MAT }
Form form;
enum Size { s1=1u, s2, s3, s4 }
Size h, w;
@property static self as(T)()
{
self ret;
enum unsupstr = "unsupported shader data type: '" ~ T.stringof ~ "'";
static if( isVector!T )
{
static if( is( T.datatype == float ) ) ret.type = Type.FLOAT;
else static if( is( T.datatype == int ) ) ret.type = Type.INT;
else static assert(0, unsupstr);
ret.form = Form.VEC;
static if( T.length > 1 && T.length < 5 )
mixin( format( "ret.h = Size.s%d;", T.length ) );
else static assert(0, unsupstr);
ret.w = Size.s1;
}
else static if( isMatrix!T )
{
static if( is( T.datatype == float ) ) ret.type = Type.FLOAT;
else static assert(0, unsupstr);
ret.form = Form.MAT;
static if( T.h > 1 && T.h < 5 ) mixin( format( "ret.h = Size.s%d;", T.h ) );
else static assert(0, unsupstr);
static if( T.w > 1 && T.w < 5 ) mixin( format( "ret.w = Size.s%d;", T.w ) );
else static assert(0, unsupstr);
}
else static if( is( T == float ) || is( T == int ) )
{
mixin( format( "ret.type = Type.%s;", T.stringof.toUpper ) );
ret.form = Form.SINGLE;
ret.w = ret.h = Size.s1;
}
else static assert(0, unsupstr);
return ret;
}
@property string glUniformSuffix() const
{
string ret;
if( form == Form.MAT )
{
ret ~= "Matrix";
if( h != w )
ret ~= format( "%dx%d", cast(int)h, cast(int)w );
else ret ~= format( "%d", cast(int)h );
}
else ret ~= format( "%d", cast(int)h );
final switch( type )
{
case Type.NONE: throw new ShaderException( "bad variable type" );
case Type.FLOAT: ret ~= "f"; break;
case Type.INT: ret ~= "i"; break;
}
return ret;
}
@property bool isMat() const { return form == Form.MAT; }
@property string strType() const
{
final switch( type )
{
case Type.NONE: throw new ShaderException( "bad variable type" );
case Type.FLOAT: return "float";
case Type.INT: return "int";
}
}
@property GLenum glType() const
{
final switch( type )
{
case Type.NONE: throw new ShaderException( "bad variable type" );
case Type.FLOAT: return GL_FLOAT;
case Type.INT: return GL_INT;
}
}
@property string glslType() const
{
final switch( form )
{
case Form.SINGLE: return type != Type.FLOAT ? "int" : "float";
case Form.VEC: return format( "%svec%d", type != Type.FLOAT ? "i" : "", cast(int)h );
case Form.MAT: return format( "mat%s", ( h==w ? format( "%d", cast(int)h ) :
format( "%dx%d", cast(int)h, cast(int)w ) ) );
}
}
@property int fullSize() const { return cast(int)h * cast(int)w; }
}
struct AttribSpec
{
string name;
ShaderVar vt;
}
struct AttribSpecInner
{
int loc;
ShaderVar vt;
}
struct UniformSpec
{
string name;
size_t count;
ShaderVar vt;
}
alias UniformSpec VaryingSpec;
struct UniformSpecInner
{
int loc;
size_t count;
ShaderVar vt;
}
class SpecShaderProgram: BaseShaderProgram
{
protected:
AttribSpecInner[string] attribs;
UniformSpecInner[string] uniforms;
this( in ShaderSource src, in AttribSpec[] attrs, in UniformSpec[] uforms )
{
super(src);
foreach( a; attrs )
{
enforce( a.vt.type != ShaderVar.Type.NONE,
new ShaderException( "attribute data type 'NONE' must " ~
"not be used in ctor for shader" ) );
auto loc = glGetAttribLocation( program, a.name.toStringz );
checkLocation( loc );
attribs[a.name] = AttribSpecInner( loc, a.vt );
}
foreach( u; uforms )
{
enforce( u.vt.type != ShaderVar.Type.NONE,
new ShaderException( "uniform data type 'NONE' must " ~
"not be used in ctor for shader" ) );
enforce( u.count > 0, new ShaderException( "shader data count " ~
"must be > 0" ) );
auto loc = glGetUniformLocation( program, u.name.toStringz );
checkLocation( loc );
uniforms[u.name] = UniformSpecInner( loc, u.count, u.vt );
}
}
public:
@property const(AttribSpecInner[string]) attr() const { return attribs; }
@property const(UniformSpecInner[string]) uniform() const { return uniforms; }
void setUniform(Arg)( string name, in Arg[] args )
if( is( typeof( ShaderVar.as!Arg ) == ShaderVar ) )
{
auto uniform = uniforms.get( name, UniformSpecInner(-1) );
enforce( uniform.loc != -1,
new ShaderException( format( "no uniform '%s' found", name ) ) );
enforce( args.length == uniform.count,
new ShaderException( format( "bad data array size (%d) for uniform '%s', must be %d",
args.length, name, uniform.count ) ) );
enum sv = ShaderVar.as!Arg;
mixin( "glUniform" ~ sv.glUniformSuffix ~ "v( uniform.loc, cast(int)args.length, "
~ ( sv.isMat ? "1," : "" ) ~ " cast(" ~ sv.strType ~ "*)args.ptr );" );
}
void setUniform(Arg)( string name, in Arg arg ) { setUniform( name, [arg] ); }
@property auto opDispatch(string name, Arg)( in Arg[] args )
if( is( typeof( ShaderVar.as!Arg ) == ShaderVar ) )
{
setUniform( name, args );
return args;
}
@property auto opDispatch(string name, Arg)( in Arg arg )
if( is( typeof( ShaderVar.as!Arg ) == ShaderVar ) )
{
setUniform( name, arg );
return arg;
}
}
class GLSpecObj : GLObj
{
protected:
final void setAttribSpec( GLVBO buffer, in AttribSpecInner spec )
{ setAttribPointer( buffer, spec.loc, spec.vt.fullSize, spec.vt.glType ); }
}
class ShaderFactory
{
protected:
this() { }
public:
SpecShaderProgram getCustom( in AttribSpec[] attrs, in UniformSpec[] uforms,
in VaryingSpec[] vars, string vert, string frag="", string geom="" )
{
string attribStrList( in AttribSpec[] attrs )
{
string ret;
foreach( attr; attrs )
ret ~= format( "attribute %s %s;\n", attr.vt.glslType, attr.name );
return ret;
}
string uniformStrList( in UniformSpec[] uforms )
{
string ret;
foreach( uf; uforms )
ret ~= format( "uniform %s%s %s;\n", uf.vt.glslType,
( uf.count > 1 ? format("[%d]", uf.count) : "" ), uf.name );
return ret;
}
string varyingStrList( in VaryingSpec[] vars )
{
string ret;
foreach( v; vars )
ret ~= format( "varying %s%s %s;\n", v.vt.glslType,
( v.count > 1 ? format("[%d]", v.count) : "" ), v.name );
return ret;
}
ShaderSource src;
auto ufsl = uniformStrList(uforms);
auto vrsl = varyingStrList(vars);
src.vert = format(
`#version 120
%s
%s
%s
void main(void)
{
%s
}`, attribStrList(attrs), ufsl, vrsl, vert );
src.frag = format(
`#version 120
%s
%s
void main(void)
{
%s
}`, ufsl, vrsl, frag );
return new SpecShaderProgram( src, attrs, uforms );
}
//SpecShaderProgram getSimple()
//{
//}
}
private static ShaderFactory sf;
@property ShaderFactory shaderFactory()
{
if( sf is null )
sf = new ShaderFactory();
return sf;
}
|
D
|
<?xml version="1.0" encoding="ASCII"?>
<di:SashWindowsMngr xmi:version="2.0" xmlns:xmi="http://www.omg.org/XMI" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:di="http://www.eclipse.org/papyrus/0.7.0/sashdi">
<pageList>
<availablePage>
<emfPageIdentifier href="_7od6EFwXEemawpDNrkj6egc0d6b166-26a6-4a2b-afca-cd608d91a09a-Activity.notation#_FU7IUlzIEemXstz2ddlLtA"/>
</availablePage>
</pageList>
<sashModel currentSelection="//@sashModel/@windows.0/@children.0">
<windows>
<children xsi:type="di:TabFolder">
<children>
<emfPageIdentifier href="_7od6EFwXEemawpDNrkj6egc0d6b166-26a6-4a2b-afca-cd608d91a09a-Activity.notation#_FU7IUlzIEemXstz2ddlLtA"/>
</children>
</children>
</windows>
</sashModel>
</di:SashWindowsMngr>
|
D
|
<?xml version="1.0" encoding="ASCII" standalone="no"?>
<di:SashWindowsMngr xmlns:di="http://www.eclipse.org/papyrus/0.7.0/sashdi" xmlns:xmi="http://www.omg.org/XMI" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmi:version="2.0">
<pageList>
<availablePage>
<emfPageIdentifier href="VAR_9_BeT-6684851184.notation#_copSALmGEeKQQp7P9cQvNQ"/>
</availablePage>
</pageList>
<sashModel currentSelection="//@sashModel/@windows.0/@children.0">
<windows>
<children xsi:type="di:TabFolder">
<children>
<emfPageIdentifier href="VAR_9_BeT-6684851184.notation#_copSALmGEeKQQp7P9cQvNQ"/>
</children>
</children>
</windows>
</sashModel>
</di:SashWindowsMngr>
|
D
|
/home/zbf/workspace/git/RTAP/target/debug/deps/md5-bde53d22eae8805e.rmeta: /home/zbf/.cargo/registry/src/mirrors.ustc.edu.cn-61ef6e0cd06fb9b8/md5-0.3.8/src/lib.rs
/home/zbf/workspace/git/RTAP/target/debug/deps/libmd5-bde53d22eae8805e.rlib: /home/zbf/.cargo/registry/src/mirrors.ustc.edu.cn-61ef6e0cd06fb9b8/md5-0.3.8/src/lib.rs
/home/zbf/workspace/git/RTAP/target/debug/deps/md5-bde53d22eae8805e.d: /home/zbf/.cargo/registry/src/mirrors.ustc.edu.cn-61ef6e0cd06fb9b8/md5-0.3.8/src/lib.rs
/home/zbf/.cargo/registry/src/mirrors.ustc.edu.cn-61ef6e0cd06fb9b8/md5-0.3.8/src/lib.rs:
|
D
|
/****************************************************************************
**
** Copyright (C) 2014 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the QtWidgets module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL21$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and Digia. For licensing terms and
** conditions see http://qt.digia.com/licensing. For further information
** use the contact form at http://qt.digia.com/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 or version 3 as published by the Free
** Software Foundation and appearing in the file LICENSE.LGPLv21 and
** LICENSE.LGPLv3 included in the packaging of this file. Please review the
** following information to ensure the GNU Lesser General Public License
** requirements will be met: https://www.gnu.org/licenses/lgpl.html and
** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Digia gives you certain additional
** rights. These rights are described in the Digia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef QGROUPBOX_H
#define QGROUPBOX_H
public import qt.QtWidgets.qframe;
QT_BEGIN_NAMESPACE
#ifndef QT_NO_GROUPBOX
class QGroupBoxPrivate;
class QStyleOptionGroupBox;
class Q_WIDGETS_EXPORT QGroupBox : public QWidget
{
mixin Q_OBJECT;
mixin Q_PROPERTY!(QString, "title", "READ", "title", "WRITE", "setTitle");
mixin Q_PROPERTY!(Qt.Alignment, "alignment", "READ", "alignment", "WRITE", "setAlignment");
mixin Q_PROPERTY!(bool, "flat", "READ", "isFlat", "WRITE", "setFlat");
mixin Q_PROPERTY!(bool, "checkable", "READ", "isCheckable", "WRITE", "setCheckable");
mixin Q_PROPERTY!(bool, "checked", "READ", "isChecked", "WRITE", "setChecked", "DESIGNABLE", "isCheckable", "NOTIFY", "toggled", "USER", "true");
public:
explicit QGroupBox(QWidget* parent=0);
explicit QGroupBox(ref const(QString) title, QWidget* parent=0);
~QGroupBox();
QString title() const;
void setTitle(ref const(QString) title);
Qt.Alignment alignment() const;
void setAlignment(int alignment);
QSize minimumSizeHint() const;
bool isFlat() const;
void setFlat(bool flat);
bool isCheckable() const;
void setCheckable(bool checkable);
bool isChecked() const;
public Q_SLOTS:
void setChecked(bool checked);
Q_SIGNALS:
void clicked(bool checked = false);
void toggled(bool);
protected:
bool event(QEvent *event);
void childEvent(QChildEvent *event);
void resizeEvent(QResizeEvent *event);
void paintEvent(QPaintEvent *event);
void focusInEvent(QFocusEvent *event);
void changeEvent(QEvent *event);
void mousePressEvent(QMouseEvent *event);
void mouseMoveEvent(QMouseEvent *event);
void mouseReleaseEvent(QMouseEvent *event);
void initStyleOption(QStyleOptionGroupBox *option) const;
private:
mixin Q_DISABLE_COPY;
mixin Q_DECLARE_PRIVATE;
Q_PRIVATE_SLOT(d_func(), void _q_setChildrenEnabled(bool b))
};
#endif // QT_NO_GROUPBOX
QT_END_NAMESPACE
#endif // QGROUPBOX_H
|
D
|
# FIXED
driverlib/f28004x/driverlib/cputimer.obj: C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/cputimer.c
driverlib/f28004x/driverlib/cputimer.obj: C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/cputimer.h
driverlib/f28004x/driverlib/cputimer.obj: C:/ti/ccs1000/ccs/tools/compiler/ti-cgt-c2000_20.2.2.LTS/include/stdbool.h
driverlib/f28004x/driverlib/cputimer.obj: C:/ti/ccs1000/ccs/tools/compiler/ti-cgt-c2000_20.2.2.LTS/include/_ti_config.h
driverlib/f28004x/driverlib/cputimer.obj: C:/ti/ccs1000/ccs/tools/compiler/ti-cgt-c2000_20.2.2.LTS/include/linkage.h
driverlib/f28004x/driverlib/cputimer.obj: C:/ti/ccs1000/ccs/tools/compiler/ti-cgt-c2000_20.2.2.LTS/include/stdint.h
driverlib/f28004x/driverlib/cputimer.obj: C:/ti/ccs1000/ccs/tools/compiler/ti-cgt-c2000_20.2.2.LTS/include/_stdint40.h
driverlib/f28004x/driverlib/cputimer.obj: C:/ti/ccs1000/ccs/tools/compiler/ti-cgt-c2000_20.2.2.LTS/include/sys/stdint.h
driverlib/f28004x/driverlib/cputimer.obj: C:/ti/ccs1000/ccs/tools/compiler/ti-cgt-c2000_20.2.2.LTS/include/sys/cdefs.h
driverlib/f28004x/driverlib/cputimer.obj: C:/ti/ccs1000/ccs/tools/compiler/ti-cgt-c2000_20.2.2.LTS/include/sys/_types.h
driverlib/f28004x/driverlib/cputimer.obj: C:/ti/ccs1000/ccs/tools/compiler/ti-cgt-c2000_20.2.2.LTS/include/machine/_types.h
driverlib/f28004x/driverlib/cputimer.obj: C:/ti/ccs1000/ccs/tools/compiler/ti-cgt-c2000_20.2.2.LTS/include/machine/_stdint.h
driverlib/f28004x/driverlib/cputimer.obj: C:/ti/ccs1000/ccs/tools/compiler/ti-cgt-c2000_20.2.2.LTS/include/sys/_stdint.h
driverlib/f28004x/driverlib/cputimer.obj: C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/inc/hw_memmap.h
driverlib/f28004x/driverlib/cputimer.obj: C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/inc/hw_types.h
driverlib/f28004x/driverlib/cputimer.obj: C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/inc/hw_cputimer.h
driverlib/f28004x/driverlib/cputimer.obj: C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/debug.h
driverlib/f28004x/driverlib/cputimer.obj: C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/sysctl.h
driverlib/f28004x/driverlib/cputimer.obj: C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/inc/hw_nmi.h
driverlib/f28004x/driverlib/cputimer.obj: C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/inc/hw_sysctl.h
driverlib/f28004x/driverlib/cputimer.obj: C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/cpu.h
driverlib/f28004x/driverlib/cputimer.obj: C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/interrupt.h
driverlib/f28004x/driverlib/cputimer.obj: C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/inc/hw_ints.h
driverlib/f28004x/driverlib/cputimer.obj: C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/inc/hw_pie.h
C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/cputimer.c:
C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/cputimer.h:
C:/ti/ccs1000/ccs/tools/compiler/ti-cgt-c2000_20.2.2.LTS/include/stdbool.h:
C:/ti/ccs1000/ccs/tools/compiler/ti-cgt-c2000_20.2.2.LTS/include/_ti_config.h:
C:/ti/ccs1000/ccs/tools/compiler/ti-cgt-c2000_20.2.2.LTS/include/linkage.h:
C:/ti/ccs1000/ccs/tools/compiler/ti-cgt-c2000_20.2.2.LTS/include/stdint.h:
C:/ti/ccs1000/ccs/tools/compiler/ti-cgt-c2000_20.2.2.LTS/include/_stdint40.h:
C:/ti/ccs1000/ccs/tools/compiler/ti-cgt-c2000_20.2.2.LTS/include/sys/stdint.h:
C:/ti/ccs1000/ccs/tools/compiler/ti-cgt-c2000_20.2.2.LTS/include/sys/cdefs.h:
C:/ti/ccs1000/ccs/tools/compiler/ti-cgt-c2000_20.2.2.LTS/include/sys/_types.h:
C:/ti/ccs1000/ccs/tools/compiler/ti-cgt-c2000_20.2.2.LTS/include/machine/_types.h:
C:/ti/ccs1000/ccs/tools/compiler/ti-cgt-c2000_20.2.2.LTS/include/machine/_stdint.h:
C:/ti/ccs1000/ccs/tools/compiler/ti-cgt-c2000_20.2.2.LTS/include/sys/_stdint.h:
C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/inc/hw_memmap.h:
C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/inc/hw_types.h:
C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/inc/hw_cputimer.h:
C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/debug.h:
C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/sysctl.h:
C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/inc/hw_nmi.h:
C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/inc/hw_sysctl.h:
C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/cpu.h:
C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/interrupt.h:
C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/inc/hw_ints.h:
C:/Users/STarikUser/Documents/F280049_Projects/F280049_Projects_GIT/DSP_280049_Common/driverlib/f28004x/driverlib/inc/hw_pie.h:
|
D
|
/Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Vapor.build/Server/RunningServer.swift.o : /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Utilities/FileIO.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/FormDataCoder+HTTP.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/SessionData.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Utilities/Thread.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/URLEncoded.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Deprecated.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Commands/ServeCommand.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Commands/RoutesCommand.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Commands/BootCommand.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/Router+Method.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/SessionCache.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Response/ResponseCodable.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Request/RequestCodable.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/Router+Middleware.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Middleware/Middleware.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Middleware/CORSMiddleware.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Middleware/FileMiddleware.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Middleware/DateMiddleware.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Middleware/ErrorMiddleware.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/SessionsMiddleware.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/Router+LazyMiddleware.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Response/Response.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Utilities/AnyResponse.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Middleware/MiddlewareConfig.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Server/NIOServerConfig.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/SessionsConfig.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/ContentConfig.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Request/HTTPMethod+String.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/Router+Path.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/JSONCoder+Custom.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/Request+Session.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/Session.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Application.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/RouteCollection.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/Router+Function.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Services/VaporProvider.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Response/Responder.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Response/BasicResponder.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Response/ApplicationResponder.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/WebSocket/WebSocketResponder.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/PlaintextEncoder.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/HTTPMessageContainer.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/ParametersContainer.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/ContentContainer.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/QueryContainer.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/Router.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/EngineRouter.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Server/Server.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Server/NIOServer.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Server/RunningServer.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/WebSocket/WebSocketServer.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/WebSocket/NIOWebSocketServer.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Error/Error.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Logging/Logger+LogError.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Error/AbortError.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/Sessions.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/KeyedCacheSessions.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/MemorySessions.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/ContentCoders.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Utilities/Exports.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Response/HTTPStatus.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Response/Redirect.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/SingleValueGet.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Services/Config+Default.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Commands/CommandConfig+Default.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Services/Services+Default.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Client/Client.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Client/FoundationClient.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/WebSocket/WebSocketClient.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/WebSocket/NIOWebSocketClient.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/Router+Content.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/Content.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Error/Abort.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Request/Request.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/View/Vapor+View.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Dispatch.apinotesc /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/NIOHTTP1.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/ObjectiveC.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/NIOOpenSSL.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/NIO.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/HTTP.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/NIOTLS.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Async.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Command.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Service.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Console.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Core.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Logging.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Debugging.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Routing.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Dispatch.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/COperatingSystem.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Random.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/URLEncodedForm.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Darwin.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Validation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/CoreFoundation.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Crypto.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/CoreGraphics.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/NIOConcurrencyHelpers.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Bits.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/NIOFoundationCompat.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/WebSocket.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/NIOWebSocket.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/IOKit.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/DatabaseKit.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/TemplateKit.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Multipart.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/SwiftOnoneSupport.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIOSHA1/include/CNIOSHA1.h /usr/local/Cellar/libressl/2.8.3/include/openssl/asn1.h /usr/local/Cellar/libressl/2.8.3/include/openssl/tls1.h /usr/local/Cellar/libressl/2.8.3/include/openssl/dtls1.h /usr/local/Cellar/libressl/2.8.3/include/openssl/pkcs12.h /usr/local/Cellar/libressl/2.8.3/include/openssl/ssl2.h /usr/local/Cellar/libressl/2.8.3/include/openssl/pem2.h /usr/local/Cellar/libressl/2.8.3/include/openssl/ssl23.h /usr/local/Cellar/libressl/2.8.3/include/openssl/ssl3.h /usr/local/Cellar/libressl/2.8.3/include/openssl/x509v3.h /usr/local/Cellar/libressl/2.8.3/include/openssl/md5.h /usr/local/Cellar/libressl/2.8.3/include/openssl/pkcs7.h /usr/local/Cellar/libressl/2.8.3/include/openssl/x509.h /usr/local/Cellar/libressl/2.8.3/include/openssl/sha.h /usr/local/Cellar/libressl/2.8.3/include/openssl/dsa.h /usr/local/Cellar/libressl/2.8.3/include/openssl/ecdsa.h /usr/local/Cellar/libressl/2.8.3/include/openssl/rsa.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIOZlib/include/CNIOZlib.h /usr/local/Cellar/libressl/2.8.3/include/openssl/obj_mac.h /usr/local/Cellar/libressl/2.8.3/include/openssl/hmac.h /usr/local/Cellar/libressl/2.8.3/include/openssl/ec.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIOAtomics/include/cpp_magic.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIOLinux/include/ifaddrs-android.h /usr/local/Cellar/libressl/2.8.3/include/openssl/rand.h /usr/local/Cellar/libressl/2.8.3/include/openssl/conf.h /usr/local/Cellar/libressl/2.8.3/include/openssl/opensslconf.h /usr/local/Cellar/libressl/2.8.3/include/openssl/dh.h /usr/local/Cellar/libressl/2.8.3/include/openssl/ecdh.h /usr/local/Cellar/libressl/2.8.3/include/openssl/lhash.h /usr/local/Cellar/libressl/2.8.3/include/openssl/stack.h /usr/local/Cellar/libressl/2.8.3/include/openssl/safestack.h /usr/local/Cellar/libressl/2.8.3/include/openssl/ssl.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio-ssl.git-1370587408992578247/Sources/CNIOOpenSSL/include/c_nio_openssl.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/crypto.git-7980259129511365902/Sources/CCryptoOpenSSL/include/c_crypto_openssl.h /usr/local/Cellar/libressl/2.8.3/include/openssl/pem.h /usr/local/Cellar/libressl/2.8.3/include/openssl/bn.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIODarwin/include/CNIODarwin.h /usr/local/Cellar/libressl/2.8.3/include/openssl/bio.h /usr/local/Cellar/libressl/2.8.3/include/openssl/crypto.h /usr/local/Cellar/libressl/2.8.3/include/openssl/srtp.h /usr/local/Cellar/libressl/2.8.3/include/openssl/evp.h /usr/local/Cellar/libressl/2.8.3/include/openssl/ossl_typ.h /usr/local/Cellar/libressl/2.8.3/include/openssl/buffer.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIOHTTPParser/include/CNIOHTTPParser.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIOHTTPParser/include/c_nio_http_parser.h /usr/local/Cellar/libressl/2.8.3/include/openssl/err.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIOAtomics/include/CNIOAtomics.h /usr/local/Cellar/libressl/2.8.3/include/openssl/opensslfeatures.h /usr/local/Cellar/libressl/2.8.3/include/openssl/objects.h /usr/local/Cellar/libressl/2.8.3/include/openssl/opensslv.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIOLinux/include/CNIOLinux.h /usr/local/Cellar/libressl/2.8.3/include/openssl/x509_vfy.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio-ssl-support.git--2359138821295600615/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio-zlib-support.git--1071467962839356487/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/CNIOSHA1.build/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/CNIOOpenSSL.build/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/CCryptoOpenSSL.build/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/CNIOZlib.build/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/CNIODarwin.build/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/CNIOHTTPParser.build/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/CNIOAtomics.build/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/CNIOLinux.build/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/checkouts/crypto.git-7980259129511365902/Sources/CBase32/include/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/checkouts/crypto.git-7980259129511365902/Sources/CBcrypt/include/module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.13.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.13.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.13.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.13.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.13.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes
/Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Vapor.build/RunningServer~partial.swiftmodule : /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Utilities/FileIO.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/FormDataCoder+HTTP.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/SessionData.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Utilities/Thread.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/URLEncoded.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Deprecated.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Commands/ServeCommand.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Commands/RoutesCommand.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Commands/BootCommand.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/Router+Method.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/SessionCache.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Response/ResponseCodable.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Request/RequestCodable.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/Router+Middleware.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Middleware/Middleware.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Middleware/CORSMiddleware.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Middleware/FileMiddleware.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Middleware/DateMiddleware.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Middleware/ErrorMiddleware.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/SessionsMiddleware.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/Router+LazyMiddleware.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Response/Response.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Utilities/AnyResponse.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Middleware/MiddlewareConfig.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Server/NIOServerConfig.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/SessionsConfig.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/ContentConfig.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Request/HTTPMethod+String.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/Router+Path.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/JSONCoder+Custom.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/Request+Session.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/Session.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Application.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/RouteCollection.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/Router+Function.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Services/VaporProvider.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Response/Responder.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Response/BasicResponder.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Response/ApplicationResponder.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/WebSocket/WebSocketResponder.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/PlaintextEncoder.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/HTTPMessageContainer.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/ParametersContainer.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/ContentContainer.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/QueryContainer.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/Router.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/EngineRouter.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Server/Server.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Server/NIOServer.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Server/RunningServer.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/WebSocket/WebSocketServer.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/WebSocket/NIOWebSocketServer.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Error/Error.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Logging/Logger+LogError.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Error/AbortError.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/Sessions.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/KeyedCacheSessions.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/MemorySessions.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/ContentCoders.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Utilities/Exports.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Response/HTTPStatus.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Response/Redirect.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/SingleValueGet.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Services/Config+Default.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Commands/CommandConfig+Default.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Services/Services+Default.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Client/Client.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Client/FoundationClient.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/WebSocket/WebSocketClient.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/WebSocket/NIOWebSocketClient.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/Router+Content.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/Content.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Error/Abort.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Request/Request.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/View/Vapor+View.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Dispatch.apinotesc /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/NIOHTTP1.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/ObjectiveC.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/NIOOpenSSL.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/NIO.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/HTTP.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/NIOTLS.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Async.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Command.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Service.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Console.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Core.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Logging.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Debugging.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Routing.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Dispatch.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/COperatingSystem.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Random.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/URLEncodedForm.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Darwin.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Validation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/CoreFoundation.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Crypto.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/CoreGraphics.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/NIOConcurrencyHelpers.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Bits.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/NIOFoundationCompat.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/WebSocket.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/NIOWebSocket.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/IOKit.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/DatabaseKit.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/TemplateKit.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Multipart.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/SwiftOnoneSupport.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIOSHA1/include/CNIOSHA1.h /usr/local/Cellar/libressl/2.8.3/include/openssl/asn1.h /usr/local/Cellar/libressl/2.8.3/include/openssl/tls1.h /usr/local/Cellar/libressl/2.8.3/include/openssl/dtls1.h /usr/local/Cellar/libressl/2.8.3/include/openssl/pkcs12.h /usr/local/Cellar/libressl/2.8.3/include/openssl/ssl2.h /usr/local/Cellar/libressl/2.8.3/include/openssl/pem2.h /usr/local/Cellar/libressl/2.8.3/include/openssl/ssl23.h /usr/local/Cellar/libressl/2.8.3/include/openssl/ssl3.h /usr/local/Cellar/libressl/2.8.3/include/openssl/x509v3.h /usr/local/Cellar/libressl/2.8.3/include/openssl/md5.h /usr/local/Cellar/libressl/2.8.3/include/openssl/pkcs7.h /usr/local/Cellar/libressl/2.8.3/include/openssl/x509.h /usr/local/Cellar/libressl/2.8.3/include/openssl/sha.h /usr/local/Cellar/libressl/2.8.3/include/openssl/dsa.h /usr/local/Cellar/libressl/2.8.3/include/openssl/ecdsa.h /usr/local/Cellar/libressl/2.8.3/include/openssl/rsa.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIOZlib/include/CNIOZlib.h /usr/local/Cellar/libressl/2.8.3/include/openssl/obj_mac.h /usr/local/Cellar/libressl/2.8.3/include/openssl/hmac.h /usr/local/Cellar/libressl/2.8.3/include/openssl/ec.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIOAtomics/include/cpp_magic.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIOLinux/include/ifaddrs-android.h /usr/local/Cellar/libressl/2.8.3/include/openssl/rand.h /usr/local/Cellar/libressl/2.8.3/include/openssl/conf.h /usr/local/Cellar/libressl/2.8.3/include/openssl/opensslconf.h /usr/local/Cellar/libressl/2.8.3/include/openssl/dh.h /usr/local/Cellar/libressl/2.8.3/include/openssl/ecdh.h /usr/local/Cellar/libressl/2.8.3/include/openssl/lhash.h /usr/local/Cellar/libressl/2.8.3/include/openssl/stack.h /usr/local/Cellar/libressl/2.8.3/include/openssl/safestack.h /usr/local/Cellar/libressl/2.8.3/include/openssl/ssl.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio-ssl.git-1370587408992578247/Sources/CNIOOpenSSL/include/c_nio_openssl.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/crypto.git-7980259129511365902/Sources/CCryptoOpenSSL/include/c_crypto_openssl.h /usr/local/Cellar/libressl/2.8.3/include/openssl/pem.h /usr/local/Cellar/libressl/2.8.3/include/openssl/bn.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIODarwin/include/CNIODarwin.h /usr/local/Cellar/libressl/2.8.3/include/openssl/bio.h /usr/local/Cellar/libressl/2.8.3/include/openssl/crypto.h /usr/local/Cellar/libressl/2.8.3/include/openssl/srtp.h /usr/local/Cellar/libressl/2.8.3/include/openssl/evp.h /usr/local/Cellar/libressl/2.8.3/include/openssl/ossl_typ.h /usr/local/Cellar/libressl/2.8.3/include/openssl/buffer.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIOHTTPParser/include/CNIOHTTPParser.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIOHTTPParser/include/c_nio_http_parser.h /usr/local/Cellar/libressl/2.8.3/include/openssl/err.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIOAtomics/include/CNIOAtomics.h /usr/local/Cellar/libressl/2.8.3/include/openssl/opensslfeatures.h /usr/local/Cellar/libressl/2.8.3/include/openssl/objects.h /usr/local/Cellar/libressl/2.8.3/include/openssl/opensslv.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIOLinux/include/CNIOLinux.h /usr/local/Cellar/libressl/2.8.3/include/openssl/x509_vfy.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio-ssl-support.git--2359138821295600615/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio-zlib-support.git--1071467962839356487/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/CNIOSHA1.build/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/CNIOOpenSSL.build/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/CCryptoOpenSSL.build/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/CNIOZlib.build/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/CNIODarwin.build/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/CNIOHTTPParser.build/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/CNIOAtomics.build/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/CNIOLinux.build/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/checkouts/crypto.git-7980259129511365902/Sources/CBase32/include/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/checkouts/crypto.git-7980259129511365902/Sources/CBcrypt/include/module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.13.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.13.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.13.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.13.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.13.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes
/Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Vapor.build/RunningServer~partial.swiftdoc : /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Utilities/FileIO.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/FormDataCoder+HTTP.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/SessionData.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Utilities/Thread.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/URLEncoded.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Deprecated.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Commands/ServeCommand.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Commands/RoutesCommand.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Commands/BootCommand.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/Router+Method.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/SessionCache.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Response/ResponseCodable.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Request/RequestCodable.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/Router+Middleware.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Middleware/Middleware.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Middleware/CORSMiddleware.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Middleware/FileMiddleware.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Middleware/DateMiddleware.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Middleware/ErrorMiddleware.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/SessionsMiddleware.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/Router+LazyMiddleware.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Response/Response.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Utilities/AnyResponse.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Middleware/MiddlewareConfig.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Server/NIOServerConfig.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/SessionsConfig.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/ContentConfig.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Request/HTTPMethod+String.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/Router+Path.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/JSONCoder+Custom.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/Request+Session.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/Session.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Application.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/RouteCollection.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/Router+Function.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Services/VaporProvider.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Response/Responder.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Response/BasicResponder.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Response/ApplicationResponder.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/WebSocket/WebSocketResponder.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/PlaintextEncoder.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/HTTPMessageContainer.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/ParametersContainer.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/ContentContainer.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/QueryContainer.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/Router.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/EngineRouter.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Server/Server.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Server/NIOServer.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Server/RunningServer.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/WebSocket/WebSocketServer.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/WebSocket/NIOWebSocketServer.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Error/Error.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Logging/Logger+LogError.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Error/AbortError.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/Sessions.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/KeyedCacheSessions.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Sessions/MemorySessions.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/ContentCoders.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Utilities/Exports.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Response/HTTPStatus.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Response/Redirect.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/SingleValueGet.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Services/Config+Default.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Commands/CommandConfig+Default.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Services/Services+Default.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Client/Client.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Client/FoundationClient.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/WebSocket/WebSocketClient.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/WebSocket/NIOWebSocketClient.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Routing/Router+Content.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Content/Content.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Error/Abort.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/Request/Request.swift /Users/godemodegame/Desktop/ATMApp/.build/checkouts/vapor.git-5492988889259800272/Sources/Vapor/View/Vapor+View.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Dispatch.apinotesc /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/NIOHTTP1.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/ObjectiveC.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/NIOOpenSSL.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/NIO.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/HTTP.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/NIOTLS.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Async.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Command.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Service.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Console.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Core.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Logging.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Debugging.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Routing.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Dispatch.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/COperatingSystem.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Random.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/URLEncodedForm.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Darwin.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Validation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/CoreFoundation.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Crypto.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/CoreGraphics.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/NIOConcurrencyHelpers.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Bits.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/NIOFoundationCompat.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/WebSocket.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/NIOWebSocket.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/IOKit.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/DatabaseKit.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/TemplateKit.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/Multipart.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/x86_64/SwiftOnoneSupport.swiftmodule /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIOSHA1/include/CNIOSHA1.h /usr/local/Cellar/libressl/2.8.3/include/openssl/asn1.h /usr/local/Cellar/libressl/2.8.3/include/openssl/tls1.h /usr/local/Cellar/libressl/2.8.3/include/openssl/dtls1.h /usr/local/Cellar/libressl/2.8.3/include/openssl/pkcs12.h /usr/local/Cellar/libressl/2.8.3/include/openssl/ssl2.h /usr/local/Cellar/libressl/2.8.3/include/openssl/pem2.h /usr/local/Cellar/libressl/2.8.3/include/openssl/ssl23.h /usr/local/Cellar/libressl/2.8.3/include/openssl/ssl3.h /usr/local/Cellar/libressl/2.8.3/include/openssl/x509v3.h /usr/local/Cellar/libressl/2.8.3/include/openssl/md5.h /usr/local/Cellar/libressl/2.8.3/include/openssl/pkcs7.h /usr/local/Cellar/libressl/2.8.3/include/openssl/x509.h /usr/local/Cellar/libressl/2.8.3/include/openssl/sha.h /usr/local/Cellar/libressl/2.8.3/include/openssl/dsa.h /usr/local/Cellar/libressl/2.8.3/include/openssl/ecdsa.h /usr/local/Cellar/libressl/2.8.3/include/openssl/rsa.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIOZlib/include/CNIOZlib.h /usr/local/Cellar/libressl/2.8.3/include/openssl/obj_mac.h /usr/local/Cellar/libressl/2.8.3/include/openssl/hmac.h /usr/local/Cellar/libressl/2.8.3/include/openssl/ec.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIOAtomics/include/cpp_magic.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIOLinux/include/ifaddrs-android.h /usr/local/Cellar/libressl/2.8.3/include/openssl/rand.h /usr/local/Cellar/libressl/2.8.3/include/openssl/conf.h /usr/local/Cellar/libressl/2.8.3/include/openssl/opensslconf.h /usr/local/Cellar/libressl/2.8.3/include/openssl/dh.h /usr/local/Cellar/libressl/2.8.3/include/openssl/ecdh.h /usr/local/Cellar/libressl/2.8.3/include/openssl/lhash.h /usr/local/Cellar/libressl/2.8.3/include/openssl/stack.h /usr/local/Cellar/libressl/2.8.3/include/openssl/safestack.h /usr/local/Cellar/libressl/2.8.3/include/openssl/ssl.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio-ssl.git-1370587408992578247/Sources/CNIOOpenSSL/include/c_nio_openssl.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/crypto.git-7980259129511365902/Sources/CCryptoOpenSSL/include/c_crypto_openssl.h /usr/local/Cellar/libressl/2.8.3/include/openssl/pem.h /usr/local/Cellar/libressl/2.8.3/include/openssl/bn.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIODarwin/include/CNIODarwin.h /usr/local/Cellar/libressl/2.8.3/include/openssl/bio.h /usr/local/Cellar/libressl/2.8.3/include/openssl/crypto.h /usr/local/Cellar/libressl/2.8.3/include/openssl/srtp.h /usr/local/Cellar/libressl/2.8.3/include/openssl/evp.h /usr/local/Cellar/libressl/2.8.3/include/openssl/ossl_typ.h /usr/local/Cellar/libressl/2.8.3/include/openssl/buffer.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIOHTTPParser/include/CNIOHTTPParser.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIOHTTPParser/include/c_nio_http_parser.h /usr/local/Cellar/libressl/2.8.3/include/openssl/err.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIOAtomics/include/CNIOAtomics.h /usr/local/Cellar/libressl/2.8.3/include/openssl/opensslfeatures.h /usr/local/Cellar/libressl/2.8.3/include/openssl/objects.h /usr/local/Cellar/libressl/2.8.3/include/openssl/opensslv.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio.git-3108475404973543938/Sources/CNIOLinux/include/CNIOLinux.h /usr/local/Cellar/libressl/2.8.3/include/openssl/x509_vfy.h /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio-ssl-support.git--2359138821295600615/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/checkouts/swift-nio-zlib-support.git--1071467962839356487/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/CNIOSHA1.build/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/CNIOOpenSSL.build/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/CCryptoOpenSSL.build/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/CNIOZlib.build/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/CNIODarwin.build/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/CNIOHTTPParser.build/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/CNIOAtomics.build/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/x86_64-apple-macosx10.10/debug/CNIOLinux.build/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/checkouts/crypto.git-7980259129511365902/Sources/CBase32/include/module.modulemap /Users/godemodegame/Desktop/ATMApp/.build/checkouts/crypto.git-7980259129511365902/Sources/CBcrypt/include/module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.13.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.13.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.13.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.13.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.13.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes
|
D
|
INSTANCE Info_Mod_Morgahard_Hi (C_INFO)
{
npc = Mod_790_BDT_Morgahard_MT;
nr = 1;
condition = Info_Mod_Morgahard_Hi_Condition;
information = Info_Mod_Morgahard_Hi_Info;
permanent = 0;
important = 0;
description = "Hallo, wer bist du und was ist deine Aufgabe im Lager?";
};
FUNC INT Info_Mod_Morgahard_Hi_Condition()
{
if (Banditen_Dabei == TRUE)
{
return 1;
};
};
FUNC VOID Info_Mod_Morgahard_Hi_Info()
{
AI_Output(hero, self, "Info_Mod_Morgahard_Hi_15_00"); //Hallo, wer bist du und was ist deine Aufgabe im Lager?
AI_Output(self, hero, "Info_Mod_Morgahard_Hi_07_01"); //Ich bin Morgahard. Ich mache dieses und jenes. Manchmal organisiere ich einen Überfall, und manchmal organisiere ich heiße Ware.
AI_Output(self, hero, "Info_Mod_Morgahard_Hi_07_02"); //Außerdem kann ich dir manchen Banditentrick zeigen, der bei Überfällen goldwert ist.
Npc_SetRefuseTalk (self, 60);
Log_CreateTopic (TOPIC_MOD_LEHRER_BANDITEN, LOG_NOTE);
B_LogEntry (TOPIC_MOD_LEHRER_BANDITEN, "Von Morgahard kann ich gewissen Banditentricks lernen.");
};
INSTANCE Info_Mod_Morgahard_OrkQuest (C_INFO)
{
npc = Mod_790_BDT_Morgahard_MT;
nr = 1;
condition = Info_Mod_Morgahard_OrkQuest_Condition;
information = Info_Mod_Morgahard_OrkQuest_Info;
permanent = 0;
important = 1;
};
FUNC INT Info_Mod_Morgahard_OrkQuest_Condition()
{
if (Npc_KnowsInfo(hero, Info_Mod_Morgahard_Hi))
&& (Npc_RefuseTalk(self) == FALSE)
{
return 1;
};
};
FUNC VOID Info_Mod_Morgahard_OrkQuest_Info()
{
AI_Output(self, hero, "Info_Mod_Morgahard_OrkQuest_07_00"); //Hey, ich Habe da vielleicht etwas für dich, womit du dich im Lager bewähren kannst.
AI_Output(self, hero, "Info_Mod_Morgahard_OrkQuest_07_01"); //Etwas anspruchsvoller, als nur paar mickrige Händler zu überfallen. Wobei es für uns mittlerweile auch schon fast zur Gewohnheit geworden ist.
AI_Output(self, hero, "Info_Mod_Morgahard_OrkQuest_07_02"); //Es treiben sich nämlich immer wieder Patrouillen des feindlichen Orklagers in der Nähe des Lagers herum.
AI_Output(self, hero, "Info_Mod_Morgahard_OrkQuest_07_03"); //Vielleicht bist du während deiner Gefangenschaft in der Barriere auch schon mal Orks begegnet?
Log_CreateTopic (TOPIC_MOD_BDT_MORGAHARD, LOG_MISSION);
B_SetTopicStatus (TOPIC_MOD_BDT_MORGAHARD, LOG_RUNNING);
Info_ClearChoices (Info_Mod_Morgahard_OrkQuest);
Info_AddChoice (Info_Mod_Morgahard_OrkQuest, "Ich habe damals im Alleingang die Orkstadt niedergemacht ...", Info_Mod_Morgahard_OrkQuest_C);
Info_AddChoice (Info_Mod_Morgahard_OrkQuest, "Echte, große, böse Orks?!", Info_Mod_Morgahard_OrkQuest_B);
Info_AddChoice (Info_Mod_Morgahard_OrkQuest, "Ja, bin tatsächlich Orks paar mal über den Weg gelaufen ...", Info_Mod_Morgahard_OrkQuest_A);
};
FUNC VOID Info_Mod_Morgahard_OrkQuest_D()
{
AI_Output(self, hero, "Info_Mod_Morgahard_OrkQuest_D_07_00"); //Jedenfalls haben unsere Späher beobachtet, wie sich jeden Abend eine Gruppe Orks in der kleinen Höhle direkt unterhalb unseres Lagers niederlässt.
AI_Output(self, hero, "Info_Mod_Morgahard_OrkQuest_D_07_01"); //Und deine Aufgabe ist es nun, mit einer Gruppe Banditen nachts hinzuschleichen und sie zu überraschen, wenn sie arglos auf ihren Schlaffelle am Boden sitzen und ihre Waffen neben sich abgelegt haben.
AI_Output(self, hero, "Info_Mod_Morgahard_OrkQuest_D_07_02"); //Was sagst du? Das würde dir einiges Ansehen im Lager einbringen.
Info_ClearChoices (Info_Mod_Morgahard_OrkQuest);
Info_AddChoice (Info_Mod_Morgahard_OrkQuest, "Das ist mir zu gefährlich.", Info_Mod_Morgahard_OrkQuest_F);
Info_AddChoice (Info_Mod_Morgahard_OrkQuest, "Eine kleine Gruppe schlafender Orks?", Info_Mod_Morgahard_OrkQuest_E);
};
FUNC VOID Info_Mod_Morgahard_OrkQuest_C()
{
AI_Output(hero, self, "Info_Mod_Morgahard_OrkQuest_C_15_00"); //Ich habe damals im Alleingang die Orkstadt niedergemacht ...
AI_Output(self, hero, "Info_Mod_Morgahard_OrkQuest_C_07_01"); //Aber klar, und ich habe gestern alleine einen schwarzen Troll getötet. (lacht) Aber mit dieser Einstellung schaffst du ganz bestimmt die paar Orks.
Info_Mod_Morgahard_OrkQuest_D();
};
FUNC VOID Info_Mod_Morgahard_OrkQuest_B()
{
AI_Output(hero, self, "Info_Mod_Morgahard_OrkQuest_B_15_00"); //Echte, große, böse Orks?!
AI_Output(self, hero, "Info_Mod_Morgahard_OrkQuest_B_07_01"); //Ach, stell dich nicht so an. Die meisten von uns haben zumindest schon mal einen Orkspäher erschlagen und du hast bewiesen, dass du Kämpfen kannst.
Info_Mod_Morgahard_OrkQuest_D();
};
FUNC VOID Info_Mod_Morgahard_OrkQuest_A()
{
AI_Output(hero, self, "Info_Mod_Morgahard_OrkQuest_A_15_00"); //Ja, bin tatsächlich Orks paar mal über den Weg gelaufen ...
AI_Output(self, hero, "Info_Mod_Morgahard_OrkQuest_A_07_01"); //Und du lebst noch. Das sind schon mal gute Voraussetzungen für die Aufgabe.
Info_Mod_Morgahard_OrkQuest_D();
};
FUNC VOID Info_Mod_Morgahard_OrkQuest_F()
{
AI_Output(hero, self, "Info_Mod_Morgahard_OrkQuest_F_15_00"); //Das ist mir zu gefährlich.
AI_Output(self, hero, "Info_Mod_Morgahard_OrkQuest_F_07_01"); //Was?! Ich bin wirklich enttäuscht von dir.
Mod_MorgahardBeleidigt = 1;
B_SetTopicStatus (TOPIC_MOD_BDT_MORGAHARD, LOG_FAILED);
Info_ClearChoices (Info_Mod_Morgahard_OrkQuest);
AI_StopProcessInfos (self);
};
FUNC VOID Info_Mod_Morgahard_OrkQuest_E()
{
AI_Output(hero, self, "Info_Mod_Morgahard_OrkQuest_E_15_00"); //Eine kleine Gruppe schlafender Orks? Du kannst mir schon mal einen Käufer für ihre Ausrüstung ausfindig machen.
AI_Output(self, hero, "Info_Mod_Morgahard_OrkQuest_E_07_01"); //Sehr gut, ich habe auch nichts anderes von dir erwartet. Finde drei bis fünf anderen Banditen aus dem Lager, die um Mitternacht vom Lagerausgang aus mit dir aufbrechen.
AI_Output(self, hero, "Info_Mod_Morgahard_OrkQuest_E_07_02"); //Und nimm auch Skinner mit. Der Faulpelz sollte auch mal wieder an die frische Luft gehen.
Mod_Orks_Morgahard = 1;
Wld_InsertNpc (OrkWarrior_BDTPatroullie, "OW_PATH_184");
Wld_InsertNpc (OrkScout_BDTPatroullie_01, "OW_PATH_184");
Wld_InsertNpc (OrkScout_BDTPatroullie_02, "OW_PATH_184");
Wld_InsertNpc (OrkScout_BDTPatroullie_03, "OW_PATH_184");
Info_ClearChoices (Info_Mod_Morgahard_OrkQuest);
B_LogEntry (TOPIC_MOD_BDT_MORGAHARD, "Morgahard hat mich damit betraut eine kleine Orkpatrouille Auszuschalten, die sich jede Nacht in der Höhle unterhalb des Lagers niederlässt. Mit Skinner und drei bis fünf anderen Banditen soll ich mich um Mitternacht vor dem Lager versammeln um loszuschlagen.");
};
INSTANCE Info_Mod_Morgahard_OrkPatroullie (C_INFO)
{
npc = Mod_790_BDT_Morgahard_MT;
nr = 1;
condition = Info_Mod_Morgahard_OrkPatroullie_Condition;
information = Info_Mod_Morgahard_OrkPatroullie_Info;
permanent = 0;
important = 0;
description = "Die Orks werden die Höhle nicht mehr verlassen.";
};
FUNC INT Info_Mod_Morgahard_OrkPatroullie_Condition()
{
if (Mod_Orks_Morgahard == 4)
{
return 1;
};
};
FUNC VOID Info_Mod_Morgahard_OrkPatroullie_Info()
{
AI_Output(hero, self, "Info_Mod_Morgahard_OrkPatroullie_15_00"); //Die Orks werden die Höhle nicht mehr verlassen.
AI_Output(self, hero, "Info_Mod_Morgahard_OrkPatroullie_07_01"); //Sehr gut, ich habe nichts anderes erwartet. Hier ist deine Belohnung.
B_GiveInvItems (self, hero, ItMi_Gold, 200);
B_SetTopicStatus (TOPIC_MOD_BDT_MORGAHARD, LOG_SUCCESS);
B_GivePlayerXP (500);
B_Göttergefallen(3, 1);
};
INSTANCE Info_Mod_Morgahard_AlterWaldMann (C_INFO)
{
npc = Mod_790_BDT_Morgahard_MT;
nr = 1;
condition = Info_Mod_Morgahard_AlterWaldMann_Condition;
information = Info_Mod_Morgahard_AlterWaldMann_Info;
permanent = 0;
important = 1;
};
FUNC INT Info_Mod_Morgahard_AlterWaldMann_Condition()
{
if (Npc_KnowsInfo(hero, Info_Mod_Dexter_AngriffVorbei))
&& ((Mod_AlbertTransforms == 8)
|| (Mod_AlbertTransforms == 9)
|| (Mod_AlbertTransforms == 10))
&& (Mod_OC_Miguel == 0)
&& (Mod_OC_Morgahard == 0)
&& (Kapitel >= 4)
{
return 1;
};
};
FUNC VOID Info_Mod_Morgahard_AlterWaldMann_Info()
{
AI_Output(self, hero, "Info_Mod_Morgahard_AlterWaldMann_07_00"); //Hey, nach den ganzen überstandenen Abenteuern gibt es da eine Sache, für die du mir am besten geeignet erscheinst. Du bist ja viel herumgekommen ...
AI_Output(hero, self, "Info_Mod_Morgahard_AlterWaldMann_15_01"); //Ja, worum geht es?
AI_Output(self, hero, "Info_Mod_Morgahard_AlterWaldMann_07_02"); //Nun, Logan war zufällig ein Schriftstück der Verwandlungsmagier in die Hände gefallen.
AI_Output(hero, self, "Info_Mod_Morgahard_AlterWaldMann_15_03"); //Zufällig?
AI_Output(self, hero, "Info_Mod_Morgahard_AlterWaldMann_07_04"); //Tja, er war bei ihnen, um sich für die Unterstützung bei der Sache mit den Orks zu bedanken und um mal wieder einige Geschäfte abzuschließen.
AI_Output(self, hero, "Info_Mod_Morgahard_AlterWaldMann_07_05"); //Und in einem Stapel Blätter, nunja, las er etwas von einem Schatz und nahm das Blatt an sich.
AI_Output(hero, self, "Info_Mod_Morgahard_AlterWaldMann_15_06"); //Soso, an sich genommen ...
AI_Output(self, hero, "Info_Mod_Morgahard_AlterWaldMann_07_07"); //Jedenfalls ging es darin um einen Hüter der Tiere und des Waldes, der uralt sein soll, blind, die Wälder von Khorata bewohnt und so weiter und sich im Besitz ...
AI_Output(hero, self, "Info_Mod_Morgahard_AlterWaldMann_15_08"); //... im Besitz von großen Schätzen befinden soll, vermute ich mal.
AI_Output(self, hero, "Info_Mod_Morgahard_AlterWaldMann_07_09"); //Ähh, ja, genau.
AI_Output(hero, self, "Info_Mod_Morgahard_AlterWaldMann_15_10"); //Und ich soll jetzt an die Schätze kommen? Einen uralter, blinden Greis beklauen?
AI_Output(hero, self, "Info_Mod_Morgahard_AlterWaldMann_15_11"); //Also wirklich, dass solltet ihr ja gerade noch selbst hinbekommen ...
AI_Output(self, hero, "Info_Mod_Morgahard_AlterWaldMann_07_12"); //Jaja, das haben wir ja auch versucht. Das Problem ist nur, dass er auch ein wenig magisch begabt scheint ...
AI_Output(hero, self, "Info_Mod_Morgahard_AlterWaldMann_15_13"); //Magisch begabt?
AI_Output(self, hero, "Info_Mod_Morgahard_AlterWaldMann_07_14"); //Ja, als wir ihn versuchten zu stellen hat er uns mit allerlei Zauberkünsten, Verwandlung und Täuschung ein Schnippchen geschlagen und uns die lange Nase gedreht.
AI_Output(self, hero, "Info_Mod_Morgahard_AlterWaldMann_07_15"); //Wir haben es immer wieder versucht ihn zu erwischen, mussten aber zuletzt unverrichteter Dinge unter seinem höhnischen Gelächter wieder abziehen.
AI_Output(self, hero, "Info_Mod_Morgahard_AlterWaldMann_07_16"); //Auf normalem Wege kommen wir also nicht an den Schatz.
AI_Output(hero, self, "Info_Mod_Morgahard_AlterWaldMann_15_17"); //Hmm, "normalem Wege". Und was soll ich da jetzt machen?
AI_Output(self, hero, "Info_Mod_Morgahard_AlterWaldMann_07_18"); //Nun, versuch irgendwie mehr über ihn zu erfahren, lass deine Kontakte spielen.
AI_Output(self, hero, "Info_Mod_Morgahard_AlterWaldMann_07_19"); //Die Verwandlungsmagier können wir schlecht fragen, da es nach dem Verschwinden des Schriftstückes, nunja, ihr Misstrauen erwecken könnte. Du verstehst?
AI_Output(self, hero, "Info_Mod_Morgahard_AlterWaldMann_07_20"); //Du musst also einen anderen Weg finden an weitere Informationen zu kommen.
AI_Output(self, hero, "Info_Mod_Morgahard_AlterWaldMann_07_21"); //Vielleicht kannst du ja etwas von diesen Waldspinnern erfahren, die überall auf Khorinis ihre Zelte unter den Bäumen aufgeschlagen haben ...
AI_Output(self, hero, "Info_Mod_Morgahard_AlterWaldMann_07_22"); //Naja, du machst das schon. Sag bescheid, wenn du den Schatz gefunden hast.
Log_CreateTopic (TOPIC_MOD_BDT_ALTERMANN, LOG_MISSION);
B_SetTopicStatus (TOPIC_MOD_BDT_ALTERMANN, LOG_RUNNING);
B_LogEntry (TOPIC_MOD_BDT_ALTERMANN, "Morgahard will, dass ich mehr über einen Hüter der Tiere und des Waldes in Erfahrung bringe, der sich in Khorata befindet und im Besitz eines großen Schatzes sein soll. Er meinte, dass womöglich die Waldläufer mir mehr zu ihm sagen könnten. Sobald ich den Schatz gefunden habe, soll ich Morgahard wieder Bescheid geben.");
};
INSTANCE Info_Mod_Morgahard_AlterWaldMann2 (C_INFO)
{
npc = Mod_790_BDT_Morgahard_MT;
nr = 1;
condition = Info_Mod_Morgahard_AlterWaldMann2_Condition;
information = Info_Mod_Morgahard_AlterWaldMann2_Info;
permanent = 0;
important = 1;
};
FUNC INT Info_Mod_Morgahard_AlterWaldMann2_Condition()
{
if (Mod_BDT_AlterWaldMann == 11)
{
return 1;
};
};
FUNC VOID Info_Mod_Morgahard_AlterWaldMann2_Info()
{
AI_Output(self, hero, "Info_Mod_Morgahard_AlterWaldMann2_07_00"); //Und, konntest mittlerweile mehr über den Hüter des Waldes erfahren?
AI_Output(hero, self, "Info_Mod_Morgahard_AlterWaldMann2_15_01"); //Ähhm, ja ... sogar seinen Schatz konnte ich finden.
AI_Output(self, hero, "Info_Mod_Morgahard_AlterWaldMann2_07_02"); //(in heller Erregung) Seinen Schatz? Wo ist er? Gold, Silber, Edelsteine und Dublonen irgendwo in der Erde vergraben, darauf wartend, dass wir sie bergen?
AI_Output(hero, self, "Info_Mod_Morgahard_AlterWaldMann2_15_03"); //Nun, unter der Erde ist schon richtig. Nur ist es kein Gold und Silber, womit der alte Mann des Waldes nicht so viel anzufangen weiß.
AI_Output(hero, self, "Info_Mod_Morgahard_AlterWaldMann2_15_04"); //Es ist der Schatz des Waldes des Wissens, Kräuter, Tränke und Pflanzen.
AI_Output(self, hero, "Info_Mod_Morgahard_AlterWaldMann2_07_05"); //Jedenfalls ging es darin um einen Hüter der Tiere und des Waldes, der uralt sein soll, blind, die Wälder von Khorata bewohnt und so weiter und sich im Besitz ...
AI_Output(hero, self, "Info_Mod_Morgahard_AlterWaldMann2_15_06"); //Was, und dafür die ganze Mühe? Verdammt.
B_SetTopicStatus (TOPIC_MOD_BDT_ALTERMANN, LOG_SUCCESS);
};
INSTANCE Info_Mod_Morgahard_Lernen_Schleichen (C_INFO)
{
npc = Mod_790_BDT_Morgahard_MT;
nr = 1;
condition = Info_Mod_Morgahard_Lernen_Schleichen_Condition;
information = Info_Mod_Morgahard_Lernen_Schleichen_Info;
permanent = 1;
important = 0;
description = B_BuildLearnString("Schleichen", B_GetLearnCostTalent(other, NPC_TALENT_SNEAK, 1));
};
FUNC INT Info_Mod_Morgahard_Lernen_Schleichen_Condition()
{
if (Npc_KnowsInfo(hero, Info_Mod_Morgahard_Hi))
&& (Npc_GetTalentSkill (hero, NPC_TALENT_SNEAK) == FALSE)
{
return 1;
};
};
FUNC VOID Info_Mod_Morgahard_Lernen_Schleichen_Info()
{
AI_Output(hero, self, "Info_Mod_Morgahard_Lernen_Schleichen_15_00"); //Bring mir das Schleichen bei.
if (B_TeachThiefTalent (self, other, NPC_TALENT_SNEAK))
{
AI_Output(self, other, "Info_Mod_Morgahard_Lernen_Schleichen_07_01"); //Mit weichen Sohlen hast du eine größere Chance, dich deinen Gegnern zu nähern, ohne dass sie es merken.
};
};
INSTANCE Info_Mod_Morgahard_Lernen_Knockout (C_INFO)
{
npc = Mod_790_BDT_Morgahard_MT;
nr = 1;
condition = Info_Mod_Morgahard_Lernen_Knockout_Condition;
information = Info_Mod_Morgahard_Lernen_Knockout_Info;
permanent = 1;
important = 0;
description = "Niederschlagen (10 Lernpunkte)";
};
FUNC INT Info_Mod_Morgahard_Lernen_Knockout_Condition()
{
if (Npc_KnowsInfo(hero, Info_Mod_Morgahard_Hi))
&& (Knockout_Perk == FALSE)
{
return 1;
};
};
FUNC VOID Info_Mod_Morgahard_Lernen_Knockout_Info()
{
AI_Output(hero, self, "Info_Mod_Morgahard_Lernen_Knockout_15_00"); //Zeig mir, wie ich jemanden Niederschlagen kann.
if (hero.lp >= 10)
{
AI_Output(self, other, "Info_Mod_Morgahard_Lernen_Knockout_08_01"); //Okey, du willst also wissen, wie du jemanden mit einem Überraschungsangriff K.O. schlagen kannst.
AI_Output(self, other, "Info_Mod_Morgahard_Lernen_Knockout_08_02"); //Schleiche dich zunächst leise von hinten an den Betreffenden heran, ohne bemerkt zu werden.
AI_Output(self, other, "Info_Mod_Morgahard_Lernen_Knockout_08_03"); //Wenn du dann nah genug bist, verpasst du ihm mit deiner Waffe einen ordentlichen Schlag auf den Hinterkopf.
AI_Output(self, other, "Info_Mod_Morgahard_Lernen_Knockout_08_04"); //Da dein Opfer nicht darauf eingestellt ist, wird es besonders großen Schaden nehmen und mit etwas Glück gleich zu Boden gehen, ohne dass du noch weiter nachhelfen musst.
AI_Output(self, other, "Info_Mod_Morgahard_Lernen_Knockout_08_05"); //Das wirkt übrigens auch bei Schlafenden, bei Tieren, Orks und was sonst noch so kräucht und fläucht.
Knockout_Perk = TRUE;
}
else
{
AI_Output(self, other, "Info_Mod_Morgahard_Lernen_Knockout_08_06"); //Komm wieder, wenn du mehr Erfahrung hast.
};
};
INSTANCE Info_Mod_Morgahard_Pickpocket (C_INFO)
{
npc = Mod_790_BDT_Morgahard_MT;
nr = 1;
condition = Info_Mod_Morgahard_Pickpocket_Condition;
information = Info_Mod_Morgahard_Pickpocket_Info;
permanent = 1;
important = 0;
description = Pickpocket_90;
};
FUNC INT Info_Mod_Morgahard_Pickpocket_Condition()
{
C_Beklauen (78, ItMi_Gold, 310);
};
FUNC VOID Info_Mod_Morgahard_Pickpocket_Info()
{
Info_ClearChoices (Info_Mod_Morgahard_Pickpocket);
Info_AddChoice (Info_Mod_Morgahard_Pickpocket, DIALOG_BACK, Info_Mod_Morgahard_Pickpocket_BACK);
Info_AddChoice (Info_Mod_Morgahard_Pickpocket, DIALOG_PICKPOCKET, Info_Mod_Morgahard_Pickpocket_DoIt);
};
FUNC VOID Info_Mod_Morgahard_Pickpocket_BACK()
{
Info_ClearChoices (Info_Mod_Morgahard_Pickpocket);
};
FUNC VOID Info_Mod_Morgahard_Pickpocket_DoIt()
{
if (B_Beklauen() == TRUE)
{
Info_ClearChoices (Info_Mod_Morgahard_Pickpocket);
}
else
{
Info_ClearChoices (Info_Mod_Morgahard_Pickpocket);
Info_AddChoice (Info_Mod_Morgahard_Pickpocket, DIALOG_PP_BESCHIMPFEN, Info_Mod_Morgahard_Pickpocket_Beschimpfen);
Info_AddChoice (Info_Mod_Morgahard_Pickpocket, DIALOG_PP_BESTECHUNG, Info_Mod_Morgahard_Pickpocket_Bestechung);
Info_AddChoice (Info_Mod_Morgahard_Pickpocket, DIALOG_PP_HERAUSREDEN, Info_Mod_Morgahard_Pickpocket_Herausreden);
};
};
FUNC VOID Info_Mod_Morgahard_Pickpocket_Beschimpfen()
{
B_Say (hero, self, "$PICKPOCKET_BESCHIMPFEN");
B_Say (self, hero, "$DIRTYTHIEF");
Info_ClearChoices (Info_Mod_Morgahard_Pickpocket);
AI_StopProcessInfos (self);
B_Attack (self, hero, AR_Theft, 1);
};
FUNC VOID Info_Mod_Morgahard_Pickpocket_Bestechung()
{
B_Say (hero, self, "$PICKPOCKET_BESTECHUNG");
var int rnd; rnd = r_max(99);
if (rnd < 25)
|| ((rnd >= 25) && (rnd < 50) && (Npc_HasItems(hero, ItMi_Gold) < 50))
|| ((rnd >= 50) && (rnd < 75) && (Npc_HasItems(hero, ItMi_Gold) < 100))
|| ((rnd >= 75) && (rnd < 100) && (Npc_HasItems(hero, ItMi_Gold) < 200))
{
B_Say (self, hero, "$DIRTYTHIEF");
Info_ClearChoices (Info_Mod_Morgahard_Pickpocket);
AI_StopProcessInfos (self);
B_Attack (self, hero, AR_Theft, 1);
}
else
{
if (rnd >= 75)
{
B_GiveInvItems (hero, self, ItMi_Gold, 200);
}
else if (rnd >= 50)
{
B_GiveInvItems (hero, self, ItMi_Gold, 100);
}
else if (rnd >= 25)
{
B_GiveInvItems (hero, self, ItMi_Gold, 50);
};
B_Say (self, hero, "$PICKPOCKET_BESTECHUNG_01");
Info_ClearChoices (Info_Mod_Morgahard_Pickpocket);
AI_StopProcessInfos (self);
};
};
FUNC VOID Info_Mod_Morgahard_Pickpocket_Herausreden()
{
B_Say (hero, self, "$PICKPOCKET_HERAUSREDEN");
if (r_max(99) < Mod_Verhandlungsgeschick)
{
B_Say (self, hero, "$PICKPOCKET_HERAUSREDEN_01");
Info_ClearChoices (Info_Mod_Morgahard_Pickpocket);
}
else
{
B_Say (self, hero, "$PICKPOCKET_HERAUSREDEN_02");
};
};
INSTANCE Info_Mod_Morgahard_EXIT (C_INFO)
{
npc = Mod_790_BDT_Morgahard_MT;
nr = 1;
condition = Info_Mod_Morgahard_EXIT_Condition;
information = Info_Mod_Morgahard_EXIT_Info;
permanent = 1;
important = 0;
description = DIALOG_ENDE;
};
FUNC INT Info_Mod_Morgahard_EXIT_Condition()
{
return 1;
};
FUNC VOID Info_Mod_Morgahard_EXIT_Info()
{
AI_StopProcessInfos (self);
};
|
D
|
module android.java.android.provider.CalendarContract_Reminders_d_interface;
import arsd.jni : IJavaObjectImplementation, JavaPackageId, JavaName, IJavaObject, ImportExportImpl, JavaInterfaceMembers;
static import arsd.jni;
import import2 = android.java.java.lang.Class_d_interface;
import import0 = android.java.android.database.Cursor_d_interface;
import import1 = android.java.android.content.ContentResolver_d_interface;
@JavaName("CalendarContract$Reminders")
final class CalendarContract_Reminders : IJavaObject {
static immutable string[] _d_canCastTo = [
"android/provider/BaseColumns",
"android/provider/CalendarContract$RemindersColumns",
"android/provider/CalendarContract$EventsColumns",
];
@Import static import0.Cursor query(import1.ContentResolver, long, string[]);
@Import import2.Class getClass();
@Import int hashCode();
@Import bool equals(IJavaObject);
@Import @JavaName("toString") string toString_();
override string toString() { return arsd.jni.javaObjectToString(this); }
@Import void notify();
@Import void notifyAll();
@Import void wait(long);
@Import void wait(long, int);
@Import void wait();
mixin IJavaObjectImplementation!(false);
public static immutable string _javaParameterString = "Landroid/provider/CalendarContract$Reminders;";
}
|
D
|
/Users/river/Desktop/2019_ios_final/build/Pods.build/Debug-iphonesimulator/Socket.IO-Client-Swift.build/Objects-normal/x86_64/SocketAckEmitter.o : /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Engine/SocketEngineSpec.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Manager/SocketManagerSpec.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Client/SocketIOClientSpec.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Engine/SocketEnginePollable.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Parse/SocketParsable.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Engine/SocketEngine.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Engine/SocketEnginePacketType.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Client/SocketIOClientConfiguration.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Client/SocketIOClientOption.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Util/SocketStringReader.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Ack/SocketAckManager.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Manager/SocketManager.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Util/SocketLogger.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Client/SocketEventHandler.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Ack/SocketAckEmitter.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Util/SocketTypes.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Util/SocketExtensions.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Client/SocketIOStatus.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Parse/SocketPacket.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Engine/SocketEngineWebsocket.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Client/SocketIOClient.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Engine/SocketEngineClient.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Client/SocketAnyEvent.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Client/SocketRawView.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Util/SSLSecurity.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Users/river/Desktop/2019_ios_final/build/Debug-iphonesimulator/Starscream/Starscream.framework/Modules/Starscream.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Metal.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreFoundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Users/river/Desktop/2019_ios_final/Pods/Target\ Support\ Files/Starscream/Starscream-umbrella.h /Users/river/Desktop/2019_ios_final/Pods/Target\ Support\ Files/Socket.IO-Client-Swift/Socket.IO-Client-Swift-umbrella.h /Users/river/Desktop/2019_ios_final/build/Debug-iphonesimulator/Starscream/Starscream.framework/Headers/Starscream-Swift.h /Users/river/Desktop/2019_ios_final/build/Pods.build/Debug-iphonesimulator/Socket.IO-Client-Swift.build/unextended-module.modulemap /Users/river/Desktop/2019_ios_final/build/Pods.build/Debug-iphonesimulator/Starscream.build/module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/OpenGLES.framework/Headers/OpenGLES.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/UIKit.framework/Headers/UIKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
/Users/river/Desktop/2019_ios_final/build/Pods.build/Debug-iphonesimulator/Socket.IO-Client-Swift.build/Objects-normal/x86_64/SocketAckEmitter~partial.swiftmodule : /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Engine/SocketEngineSpec.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Manager/SocketManagerSpec.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Client/SocketIOClientSpec.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Engine/SocketEnginePollable.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Parse/SocketParsable.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Engine/SocketEngine.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Engine/SocketEnginePacketType.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Client/SocketIOClientConfiguration.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Client/SocketIOClientOption.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Util/SocketStringReader.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Ack/SocketAckManager.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Manager/SocketManager.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Util/SocketLogger.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Client/SocketEventHandler.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Ack/SocketAckEmitter.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Util/SocketTypes.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Util/SocketExtensions.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Client/SocketIOStatus.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Parse/SocketPacket.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Engine/SocketEngineWebsocket.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Client/SocketIOClient.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Engine/SocketEngineClient.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Client/SocketAnyEvent.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Client/SocketRawView.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Util/SSLSecurity.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Users/river/Desktop/2019_ios_final/build/Debug-iphonesimulator/Starscream/Starscream.framework/Modules/Starscream.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Metal.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreFoundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Users/river/Desktop/2019_ios_final/Pods/Target\ Support\ Files/Starscream/Starscream-umbrella.h /Users/river/Desktop/2019_ios_final/Pods/Target\ Support\ Files/Socket.IO-Client-Swift/Socket.IO-Client-Swift-umbrella.h /Users/river/Desktop/2019_ios_final/build/Debug-iphonesimulator/Starscream/Starscream.framework/Headers/Starscream-Swift.h /Users/river/Desktop/2019_ios_final/build/Pods.build/Debug-iphonesimulator/Socket.IO-Client-Swift.build/unextended-module.modulemap /Users/river/Desktop/2019_ios_final/build/Pods.build/Debug-iphonesimulator/Starscream.build/module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/OpenGLES.framework/Headers/OpenGLES.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/UIKit.framework/Headers/UIKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
/Users/river/Desktop/2019_ios_final/build/Pods.build/Debug-iphonesimulator/Socket.IO-Client-Swift.build/Objects-normal/x86_64/SocketAckEmitter~partial.swiftdoc : /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Engine/SocketEngineSpec.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Manager/SocketManagerSpec.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Client/SocketIOClientSpec.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Engine/SocketEnginePollable.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Parse/SocketParsable.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Engine/SocketEngine.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Engine/SocketEnginePacketType.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Client/SocketIOClientConfiguration.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Client/SocketIOClientOption.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Util/SocketStringReader.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Ack/SocketAckManager.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Manager/SocketManager.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Util/SocketLogger.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Client/SocketEventHandler.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Ack/SocketAckEmitter.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Util/SocketTypes.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Util/SocketExtensions.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Client/SocketIOStatus.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Parse/SocketPacket.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Engine/SocketEngineWebsocket.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Client/SocketIOClient.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Engine/SocketEngineClient.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Client/SocketAnyEvent.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Client/SocketRawView.swift /Users/river/Desktop/2019_ios_final/Pods/Socket.IO-Client-Swift/Source/SocketIO/Util/SSLSecurity.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Users/river/Desktop/2019_ios_final/build/Debug-iphonesimulator/Starscream/Starscream.framework/Modules/Starscream.swiftmodule/x86_64.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Metal.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreFoundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Users/river/Desktop/2019_ios_final/Pods/Target\ Support\ Files/Starscream/Starscream-umbrella.h /Users/river/Desktop/2019_ios_final/Pods/Target\ Support\ Files/Socket.IO-Client-Swift/Socket.IO-Client-Swift-umbrella.h /Users/river/Desktop/2019_ios_final/build/Debug-iphonesimulator/Starscream/Starscream.framework/Headers/Starscream-Swift.h /Users/river/Desktop/2019_ios_final/build/Pods.build/Debug-iphonesimulator/Socket.IO-Client-Swift.build/unextended-module.modulemap /Users/river/Desktop/2019_ios_final/build/Pods.build/Debug-iphonesimulator/Starscream.build/module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/OpenGLES.framework/Headers/OpenGLES.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/CoreImage.framework/Headers/CoreImage.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/QuartzCore.framework/Headers/QuartzCore.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/Metal.framework/Headers/Metal.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/UIKit.framework/Headers/UIKit.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneSimulator.platform/Developer/SDKs/iPhoneSimulator12.1.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
|
D
|
/Users/Bijibaba/Documents/Programs/CoinPush-iOS/Build/Intermediates/Pods.build/Debug-iphonesimulator/Alamofire.build/Objects-normal/x86_64/SessionManager.o : /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/MultipartFormData.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/Timeline.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/DispatchQueue+Alamofire.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/Alamofire.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/Response.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/TaskDelegate.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/SessionDelegate.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/ParameterEncoding.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/Validation.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/ResponseSerialization.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/SessionManager.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/NetworkReachabilityManager.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/AFError.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/Notifications.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/Result.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/Request.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/ServerTrustPolicy.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreText.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Target\ Support\ Files/Alamofire/Alamofire-umbrella.h /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Build/Intermediates/Pods.build/Debug-iphonesimulator/Alamofire.build/unextended-module.modulemap
/Users/Bijibaba/Documents/Programs/CoinPush-iOS/Build/Intermediates/Pods.build/Debug-iphonesimulator/Alamofire.build/Objects-normal/x86_64/SessionManager~partial.swiftmodule : /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/MultipartFormData.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/Timeline.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/DispatchQueue+Alamofire.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/Alamofire.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/Response.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/TaskDelegate.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/SessionDelegate.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/ParameterEncoding.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/Validation.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/ResponseSerialization.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/SessionManager.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/NetworkReachabilityManager.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/AFError.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/Notifications.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/Result.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/Request.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/ServerTrustPolicy.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreText.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Target\ Support\ Files/Alamofire/Alamofire-umbrella.h /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Build/Intermediates/Pods.build/Debug-iphonesimulator/Alamofire.build/unextended-module.modulemap
/Users/Bijibaba/Documents/Programs/CoinPush-iOS/Build/Intermediates/Pods.build/Debug-iphonesimulator/Alamofire.build/Objects-normal/x86_64/SessionManager~partial.swiftdoc : /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/MultipartFormData.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/Timeline.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/DispatchQueue+Alamofire.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/Alamofire.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/Response.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/TaskDelegate.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/SessionDelegate.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/ParameterEncoding.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/Validation.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/ResponseSerialization.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/SessionManager.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/NetworkReachabilityManager.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/AFError.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/Notifications.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/Result.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/Request.swift /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Alamofire/Source/ServerTrustPolicy.swift /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreText.apinotesc /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/ObjectiveC.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreImage.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/QuartzCore.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Dispatch.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Darwin.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Foundation.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/CoreGraphics.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/Swift.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/UIKit.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/iphonesimulator/x86_64/SwiftOnoneSupport.swiftmodule /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Pods/Target\ Support\ Files/Alamofire/Alamofire-umbrella.h /Users/Bijibaba/Documents/Programs/CoinPush-iOS/Build/Intermediates/Pods.build/Debug-iphonesimulator/Alamofire.build/unextended-module.modulemap
|
D
|
// Written in the D programming language.
/**
This module defines the notion of a range. Ranges generalize the concept of
arrays, lists, or anything that involves sequential access. This abstraction
enables the same set of algorithms (see $(LINK2 std_algorithm.html,
std.algorithm)) to be used with a vast variety of different concrete types. For
example, a linear search algorithm such as $(LINK2 std_algorithm.html#find,
std.algorithm.find) works not just for arrays, but for linked-lists, input
files, incoming network data, etc. See also Ali Çehreli's
$(WEB ddili.org/ders/d.en/ranges.html, tutorial on ranges) for the basics
of working with and creating range-based code.
For more detailed information about the conceptual aspect of ranges and the
motivation behind them, see Andrei Alexandrescu's article
$(LINK2 http://www.informit.com/articles/printerfriendly.aspx?p=1407357$(AMP)rll=1,
$(I On Iteration)).
Submodules:
This module has two submodules:
The $(MREF std, _range, primitives) submodule
provides basic _range functionality. It defines several templates for testing
whether a given object is a _range, what kind of _range it is, and provides
some common _range operations.
The $(MREF std, _range, interfaces) submodule
provides object-based interfaces for working with ranges via runtime
polymorphism.
The remainder of this module provides a rich set of _range creation and
composition templates that let you construct new ranges out of existing ranges:
$(BOOKTABLE ,
$(TR $(TD $(D $(LREF chain)))
$(TD Concatenates several ranges into a single _range.
))
$(TR $(TD $(D $(LREF choose)))
$(TD Chooses one of two ranges at runtime based on a boolean condition.
))
$(TR $(TD $(D $(LREF chooseAmong)))
$(TD Chooses one of several ranges at runtime based on an index.
))
$(TR $(TD $(D $(LREF chunks)))
$(TD Creates a _range that returns fixed-size chunks of the original
_range.
))
$(TR $(TD $(D $(LREF cycle)))
$(TD Creates an infinite _range that repeats the given forward _range
indefinitely. Good for implementing circular buffers.
))
$(TR $(TD $(D $(LREF drop)))
$(TD Creates the _range that results from discarding the first $(I n)
elements from the given _range.
))
$(TR $(TD $(D $(LREF dropExactly)))
$(TD Creates the _range that results from discarding exactly $(I n)
of the first elements from the given _range.
))
$(TR $(TD $(D $(LREF dropOne)))
$(TD Creates the _range that results from discarding
the first elements from the given _range.
))
$(TR $(TD $(D $(LREF enumerate)))
$(TD Iterates a _range with an attached index variable.
))
$(TR $(TD $(D $(LREF evenChunks)))
$(TD Creates a _range that returns a number of chunks of
approximately equal length from the original _range.
))
$(TR $(TD $(D $(LREF frontTransversal)))
$(TD Creates a _range that iterates over the first elements of the
given ranges.
))
$(TR $(TD $(D $(LREF indexed)))
$(TD Creates a _range that offers a view of a given _range as though
its elements were reordered according to a given _range of indices.
))
$(TR $(TD $(D $(LREF iota)))
$(TD Creates a _range consisting of numbers between a starting point
and ending point, spaced apart by a given interval.
))
$(TR $(TD $(D $(LREF lockstep)))
$(TD Iterates $(I n) _ranges in lockstep, for use in a $(D foreach)
loop. Similar to $(D zip), except that $(D lockstep) is designed
especially for $(D foreach) loops.
))
$(TR $(TD $(D $(LREF NullSink)))
$(TD An output _range that discards the data it receives.
))
$(TR $(TD $(D $(LREF only)))
$(TD Creates a _range that iterates over the given arguments.
))
$(TR $(TD $(D $(LREF padLeft)))
$(TD Pads a _range to a specified length by adding a given element to
the front of the _range. Is lazy if the range has a known length.
))
$(TR $(TD $(D $(LREF padRight)))
$(TD Lazily pads a _range to a specified length by adding a given element to
the back of the _range.
))
$(TR $(TD $(D $(LREF radial)))
$(TD Given a random-access _range and a starting point, creates a
_range that alternately returns the next left and next right element to
the starting point.
))
$(TR $(TD $(D $(LREF recurrence)))
$(TD Creates a forward _range whose values are defined by a
mathematical recurrence relation.
))
$(TR $(TD $(D $(LREF repeat)))
$(TD Creates a _range that consists of a single element repeated $(I n)
times, or an infinite _range repeating that element indefinitely.
))
$(TR $(TD $(D $(LREF retro)))
$(TD Iterates a bidirectional _range backwards.
))
$(TR $(TD $(D $(LREF roundRobin)))
$(TD Given $(I n) ranges, creates a new _range that return the $(I n)
first elements of each _range, in turn, then the second element of each
_range, and so on, in a round-robin fashion.
))
$(TR $(TD $(D $(LREF sequence)))
$(TD Similar to $(D recurrence), except that a random-access _range is
created.
))
$(TR $(TD $(D $(LREF stride)))
$(TD Iterates a _range with stride $(I n).
))
$(TR $(TD $(D $(LREF tail)))
$(TD Return a _range advanced to within $(D n) elements of the end of
the given _range.
))
$(TR $(TD $(D $(LREF take)))
$(TD Creates a sub-_range consisting of only up to the first $(I n)
elements of the given _range.
))
$(TR $(TD $(D $(LREF takeExactly)))
$(TD Like $(D take), but assumes the given _range actually has $(I n)
elements, and therefore also defines the $(D length) property.
))
$(TR $(TD $(D $(LREF takeNone)))
$(TD Creates a random-access _range consisting of zero elements of the
given _range.
))
$(TR $(TD $(D $(LREF takeOne)))
$(TD Creates a random-access _range consisting of exactly the first
element of the given _range.
))
$(TR $(TD $(D $(LREF tee)))
$(TD Creates a _range that wraps a given _range, forwarding along
its elements while also calling a provided function with each element.
))
$(TR $(TD $(D $(LREF transposed)))
$(TD Transposes a _range of ranges.
))
$(TR $(TD $(D $(LREF transversal)))
$(TD Creates a _range that iterates over the $(I n)'th elements of the
given random-access ranges.
))
$(TR $(TD $(D $(LREF zip)))
$(TD Given $(I n) _ranges, creates a _range that successively returns a
tuple of all the first elements, a tuple of all the second elements,
etc.
))
)
Ranges whose elements are sorted afford better efficiency with certain
operations. For this, the $(D $(LREF assumeSorted)) function can be used to
construct a $(D $(LREF SortedRange)) from a pre-sorted _range. The $(REF
sort, std, algorithm, sorting) function also conveniently
returns a $(D SortedRange). $(D SortedRange) objects provide some additional
_range operations that take advantage of the fact that the _range is sorted.
Source: $(PHOBOSSRC std/_range/_package.d)
Macros:
WIKI = Phobos/StdRange
Copyright: Copyright by authors 2008-.
License: $(WEB boost.org/LICENSE_1_0.txt, Boost License 1.0).
Authors: $(WEB erdani.com, Andrei Alexandrescu), David Simcha, Jonathan M Davis,
and Jack Stouffer. Credit for some of the ideas in building this module goes
to $(WEB fantascienza.net/leonardo/so/, Leonardo Maffi).
*/
module std.range;
public import std.range.primitives;
public import std.range.interfaces;
public import std.array;
public import std.typecons : Flag, Yes, No;
import std.meta;
import std.traits;
/**
Iterates a bidirectional range backwards. The original range can be
accessed by using the $(D source) property. Applying retro twice to
the same range yields the original range.
*/
auto retro(Range)(Range r)
if (isBidirectionalRange!(Unqual!Range))
{
// Check for retro(retro(r)) and just return r in that case
static if (is(typeof(retro(r.source)) == Range))
{
return r.source;
}
else
{
static struct Result()
{
private alias R = Unqual!Range;
// User code can get and set source, too
R source;
static if (hasLength!R)
{
size_t retroIndex(size_t n)
{
return source.length - n - 1;
}
}
public:
alias Source = R;
@property bool empty() { return source.empty; }
@property auto save()
{
return Result(source.save);
}
@property auto ref front() { return source.back; }
void popFront() { source.popBack(); }
@property auto ref back() { return source.front; }
void popBack() { source.popFront(); }
static if (is(typeof(source.moveBack())))
{
ElementType!R moveFront()
{
return source.moveBack();
}
}
static if (is(typeof(source.moveFront())))
{
ElementType!R moveBack()
{
return source.moveFront();
}
}
static if (hasAssignableElements!R)
{
@property auto front(ElementType!R val)
{
source.back = val;
}
@property auto back(ElementType!R val)
{
source.front = val;
}
}
static if (isRandomAccessRange!(R) && hasLength!(R))
{
auto ref opIndex(size_t n) { return source[retroIndex(n)]; }
static if (hasAssignableElements!R)
{
void opIndexAssign(ElementType!R val, size_t n)
{
source[retroIndex(n)] = val;
}
}
static if (is(typeof(source.moveAt(0))))
{
ElementType!R moveAt(size_t index)
{
return source.moveAt(retroIndex(index));
}
}
static if (hasSlicing!R)
typeof(this) opSlice(size_t a, size_t b)
{
return typeof(this)(source[source.length - b .. source.length - a]);
}
}
static if (hasLength!R)
{
@property auto length()
{
return source.length;
}
alias opDollar = length;
}
}
return Result!()(r);
}
}
///
@safe unittest
{
import std.algorithm : equal;
int[] a = [ 1, 2, 3, 4, 5 ];
assert(equal(retro(a), [ 5, 4, 3, 2, 1 ][]));
assert(retro(a).source is a);
assert(retro(retro(a)) is a);
}
@safe unittest
{
import std.algorithm : equal;
static assert(isBidirectionalRange!(typeof(retro("hello"))));
int[] a;
static assert(is(typeof(a) == typeof(retro(retro(a)))));
assert(retro(retro(a)) is a);
static assert(isRandomAccessRange!(typeof(retro([1, 2, 3]))));
void test(int[] input, int[] witness)
{
auto r = retro(input);
assert(r.front == witness.front);
assert(r.back == witness.back);
assert(equal(r, witness));
}
test([ 1 ], [ 1 ]);
test([ 1, 2 ], [ 2, 1 ]);
test([ 1, 2, 3 ], [ 3, 2, 1 ]);
test([ 1, 2, 3, 4 ], [ 4, 3, 2, 1 ]);
test([ 1, 2, 3, 4, 5 ], [ 5, 4, 3, 2, 1 ]);
test([ 1, 2, 3, 4, 5, 6 ], [ 6, 5, 4, 3, 2, 1 ]);
immutable foo = [1,2,3].idup;
auto r = retro(foo);
}
@safe unittest
{
import std.internal.test.dummyrange;
foreach (DummyType; AllDummyRanges) {
static if (!isBidirectionalRange!DummyType) {
static assert(!__traits(compiles, Retro!DummyType));
} else {
DummyType dummyRange;
dummyRange.reinit();
auto myRetro = retro(dummyRange);
static assert(propagatesRangeType!(typeof(myRetro), DummyType));
assert(myRetro.front == 10);
assert(myRetro.back == 1);
assert(myRetro.moveFront() == 10);
assert(myRetro.moveBack() == 1);
static if (isRandomAccessRange!DummyType && hasLength!DummyType) {
assert(myRetro[0] == myRetro.front);
assert(myRetro.moveAt(2) == 8);
static if (DummyType.r == ReturnBy.Reference) {
{
myRetro[9]++;
scope(exit) myRetro[9]--;
assert(dummyRange[0] == 2);
myRetro.front++;
scope(exit) myRetro.front--;
assert(myRetro.front == 11);
myRetro.back++;
scope(exit) myRetro.back--;
assert(myRetro.back == 3);
}
{
myRetro.front = 0xFF;
scope(exit) myRetro.front = 10;
assert(dummyRange.back == 0xFF);
myRetro.back = 0xBB;
scope(exit) myRetro.back = 1;
assert(dummyRange.front == 0xBB);
myRetro[1] = 11;
scope(exit) myRetro[1] = 8;
assert(dummyRange[8] == 11);
}
}
}
}
}
}
@safe unittest
{
import std.algorithm : equal;
auto LL = iota(1L, 4L);
auto r = retro(LL);
assert(equal(r, [3L, 2L, 1L]));
}
// Issue 12662
@safe @nogc unittest
{
int[3] src = [1,2,3];
int[] data = src[];
foreach_reverse (x; data) {}
foreach (x; data.retro) {}
}
/**
Iterates range $(D r) with stride $(D n). If the range is a
random-access range, moves by indexing into the range; otherwise,
moves by successive calls to $(D popFront). Applying stride twice to
the same range results in a stride with a step that is the
product of the two applications. It is an error for $(D n) to be 0.
*/
auto stride(Range)(Range r, size_t n)
if (isInputRange!(Unqual!Range))
in
{
assert(n != 0, "stride cannot have step zero.");
}
body
{
import std.algorithm : min;
static if (is(typeof(stride(r.source, n)) == Range))
{
// stride(stride(r, n1), n2) is stride(r, n1 * n2)
return stride(r.source, r._n * n);
}
else
{
static struct Result
{
private alias R = Unqual!Range;
public R source;
private size_t _n;
// Chop off the slack elements at the end
static if (hasLength!R &&
(isRandomAccessRange!R && hasSlicing!R
|| isBidirectionalRange!R))
private void eliminateSlackElements()
{
auto slack = source.length % _n;
if (slack)
{
slack--;
}
else if (!source.empty)
{
slack = min(_n, source.length) - 1;
}
else
{
slack = 0;
}
if (!slack) return;
static if (isRandomAccessRange!R && hasSlicing!R)
{
source = source[0 .. source.length - slack];
}
else static if (isBidirectionalRange!R)
{
foreach (i; 0 .. slack)
{
source.popBack();
}
}
}
static if (isForwardRange!R)
{
@property auto save()
{
return Result(source.save, _n);
}
}
static if (isInfinite!R)
{
enum bool empty = false;
}
else
{
@property bool empty()
{
return source.empty;
}
}
@property auto ref front()
{
return source.front;
}
static if (is(typeof(.moveFront(source))))
{
ElementType!R moveFront()
{
return source.moveFront();
}
}
static if (hasAssignableElements!R)
{
@property auto front(ElementType!R val)
{
source.front = val;
}
}
void popFront()
{
source.popFrontN(_n);
}
static if (isBidirectionalRange!R && hasLength!R)
{
void popBack()
{
popBackN(source, _n);
}
@property auto ref back()
{
eliminateSlackElements();
return source.back;
}
static if (is(typeof(.moveBack(source))))
{
ElementType!R moveBack()
{
eliminateSlackElements();
return source.moveBack();
}
}
static if (hasAssignableElements!R)
{
@property auto back(ElementType!R val)
{
eliminateSlackElements();
source.back = val;
}
}
}
static if (isRandomAccessRange!R && hasLength!R)
{
auto ref opIndex(size_t n)
{
return source[_n * n];
}
/**
Forwards to $(D moveAt(source, n)).
*/
static if (is(typeof(source.moveAt(0))))
{
ElementType!R moveAt(size_t n)
{
return source.moveAt(_n * n);
}
}
static if (hasAssignableElements!R)
{
void opIndexAssign(ElementType!R val, size_t n)
{
source[_n * n] = val;
}
}
}
static if (hasSlicing!R && hasLength!R)
typeof(this) opSlice(size_t lower, size_t upper)
{
assert(upper >= lower && upper <= length);
immutable translatedUpper = (upper == 0) ? 0 :
(upper * _n - (_n - 1));
immutable translatedLower = min(lower * _n, translatedUpper);
assert(translatedLower <= translatedUpper);
return typeof(this)(source[translatedLower..translatedUpper], _n);
}
static if (hasLength!R)
{
@property auto length()
{
return (source.length + _n - 1) / _n;
}
alias opDollar = length;
}
}
return Result(r, n);
}
}
///
unittest
{
import std.algorithm : equal;
int[] a = [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 ];
assert(equal(stride(a, 3), [ 1, 4, 7, 10 ][]));
assert(stride(stride(a, 2), 3) == stride(a, 6));
}
nothrow @nogc unittest
{
int[4] testArr = [1,2,3,4];
//just checking it compiles
auto s = testArr[].stride(2);
}
debug unittest
{//check the contract
int[4] testArr = [1,2,3,4];
import std.exception : assertThrown;
import core.exception : AssertError;
assertThrown!AssertError(testArr[].stride(0));
}
@safe unittest
{
import std.internal.test.dummyrange;
import std.algorithm : equal;
static assert(isRandomAccessRange!(typeof(stride([1, 2, 3], 2))));
void test(size_t n, int[] input, int[] witness)
{
assert(equal(stride(input, n), witness));
}
test(1, [], []);
int[] arr = [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 ];
assert(stride(stride(arr, 2), 3) is stride(arr, 6));
test(1, arr, arr);
test(2, arr, [1, 3, 5, 7, 9]);
test(3, arr, [1, 4, 7, 10]);
test(4, arr, [1, 5, 9]);
// Test slicing.
auto s1 = stride(arr, 1);
assert(equal(s1[1..4], [2, 3, 4]));
assert(s1[1..4].length == 3);
assert(equal(s1[1..5], [2, 3, 4, 5]));
assert(s1[1..5].length == 4);
assert(s1[0..0].empty);
assert(s1[3..3].empty);
// assert(s1[$ .. $].empty);
assert(s1[s1.opDollar .. s1.opDollar].empty);
auto s2 = stride(arr, 2);
assert(equal(s2[0..2], [1,3]));
assert(s2[0..2].length == 2);
assert(equal(s2[1..5], [3, 5, 7, 9]));
assert(s2[1..5].length == 4);
assert(s2[0..0].empty);
assert(s2[3..3].empty);
// assert(s2[$ .. $].empty);
assert(s2[s2.opDollar .. s2.opDollar].empty);
// Test fix for Bug 5035
auto m = [1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4]; // 3 rows, 4 columns
auto col = stride(m, 4);
assert(equal(col, [1, 1, 1]));
assert(equal(retro(col), [1, 1, 1]));
immutable int[] immi = [ 1, 2, 3 ];
static assert(isRandomAccessRange!(typeof(stride(immi, 1))));
// Check for infiniteness propagation.
static assert(isInfinite!(typeof(stride(repeat(1), 3))));
foreach (DummyType; AllDummyRanges) {
DummyType dummyRange;
dummyRange.reinit();
auto myStride = stride(dummyRange, 4);
// Should fail if no length and bidirectional b/c there's no way
// to know how much slack we have.
static if (hasLength!DummyType || !isBidirectionalRange!DummyType) {
static assert(propagatesRangeType!(typeof(myStride), DummyType));
}
assert(myStride.front == 1);
assert(myStride.moveFront() == 1);
assert(equal(myStride, [1, 5, 9]));
static if (hasLength!DummyType) {
assert(myStride.length == 3);
}
static if (isBidirectionalRange!DummyType && hasLength!DummyType) {
assert(myStride.back == 9);
assert(myStride.moveBack() == 9);
}
static if (isRandomAccessRange!DummyType && hasLength!DummyType) {
assert(myStride[0] == 1);
assert(myStride[1] == 5);
assert(myStride.moveAt(1) == 5);
assert(myStride[2] == 9);
static assert(hasSlicing!(typeof(myStride)));
}
static if (DummyType.r == ReturnBy.Reference) {
// Make sure reference is propagated.
{
myStride.front++;
scope(exit) myStride.front--;
assert(dummyRange.front == 2);
}
{
myStride.front = 4;
scope(exit) myStride.front = 1;
assert(dummyRange.front == 4);
}
static if (isBidirectionalRange!DummyType && hasLength!DummyType) {
{
myStride.back++;
scope(exit) myStride.back--;
assert(myStride.back == 10);
}
{
myStride.back = 111;
scope(exit) myStride.back = 9;
assert(myStride.back == 111);
}
static if (isRandomAccessRange!DummyType) {
{
myStride[1]++;
scope(exit) myStride[1]--;
assert(dummyRange[4] == 6);
}
{
myStride[1] = 55;
scope(exit) myStride[1] = 5;
assert(dummyRange[4] == 55);
}
}
}
}
}
}
@safe unittest
{
import std.algorithm : equal;
auto LL = iota(1L, 10L);
auto s = stride(LL, 3);
assert(equal(s, [1L, 4L, 7L]));
}
/**
Spans multiple ranges in sequence. The function $(D chain) takes any
number of ranges and returns a $(D Chain!(R1, R2,...)) object. The
ranges may be different, but they must have the same element type. The
result is a range that offers the $(D front), $(D popFront), and $(D
empty) primitives. If all input ranges offer random access and $(D
length), $(D Chain) offers them as well.
If only one range is offered to $(D Chain) or $(D chain), the $(D
Chain) type exits the picture by aliasing itself directly to that
range's type.
*/
auto chain(Ranges...)(Ranges rs)
if (Ranges.length > 0 &&
allSatisfy!(isInputRange, staticMap!(Unqual, Ranges)) &&
!is(CommonType!(staticMap!(ElementType, staticMap!(Unqual, Ranges))) == void))
{
static if (Ranges.length == 1)
{
return rs[0];
}
else
{
static struct Result
{
private:
alias R = staticMap!(Unqual, Ranges);
alias RvalueElementType = CommonType!(staticMap!(.ElementType, R));
private template sameET(A)
{
enum sameET = is(.ElementType!A == RvalueElementType);
}
enum bool allSameType = allSatisfy!(sameET, R);
// This doesn't work yet
static if (allSameType)
{
alias ElementType = ref RvalueElementType;
}
else
{
alias ElementType = RvalueElementType;
}
static if (allSameType && allSatisfy!(hasLvalueElements, R))
{
static ref RvalueElementType fixRef(ref RvalueElementType val)
{
return val;
}
}
else
{
static RvalueElementType fixRef(RvalueElementType val)
{
return val;
}
}
// This is the entire state
R source;
// TODO: use a vtable (or more) instead of linear iteration
public:
this(R input)
{
foreach (i, v; input)
{
source[i] = v;
}
}
import std.meta : anySatisfy;
static if (anySatisfy!(isInfinite, R))
{
// Propagate infiniteness.
enum bool empty = false;
}
else
{
@property bool empty()
{
foreach (i, Unused; R)
{
if (!source[i].empty) return false;
}
return true;
}
}
static if (allSatisfy!(isForwardRange, R))
@property auto save()
{
typeof(this) result = this;
foreach (i, Unused; R)
{
result.source[i] = result.source[i].save;
}
return result;
}
void popFront()
{
foreach (i, Unused; R)
{
if (source[i].empty) continue;
source[i].popFront();
return;
}
}
@property auto ref front()
{
foreach (i, Unused; R)
{
if (source[i].empty) continue;
return fixRef(source[i].front);
}
assert(false);
}
static if (allSameType && allSatisfy!(hasAssignableElements, R))
{
// @@@BUG@@@
//@property void front(T)(T v) if (is(T : RvalueElementType))
@property void front(RvalueElementType v)
{
foreach (i, Unused; R)
{
if (source[i].empty) continue;
source[i].front = v;
return;
}
assert(false);
}
}
static if (allSatisfy!(hasMobileElements, R))
{
RvalueElementType moveFront()
{
foreach (i, Unused; R)
{
if (source[i].empty) continue;
return source[i].moveFront();
}
assert(false);
}
}
static if (allSatisfy!(isBidirectionalRange, R))
{
@property auto ref back()
{
foreach_reverse (i, Unused; R)
{
if (source[i].empty) continue;
return fixRef(source[i].back);
}
assert(false);
}
void popBack()
{
foreach_reverse (i, Unused; R)
{
if (source[i].empty) continue;
source[i].popBack();
return;
}
}
static if (allSatisfy!(hasMobileElements, R))
{
RvalueElementType moveBack()
{
foreach_reverse (i, Unused; R)
{
if (source[i].empty) continue;
return source[i].moveBack();
}
assert(false);
}
}
static if (allSameType && allSatisfy!(hasAssignableElements, R))
{
@property void back(RvalueElementType v)
{
foreach_reverse (i, Unused; R)
{
if (source[i].empty) continue;
source[i].back = v;
return;
}
assert(false);
}
}
}
static if (allSatisfy!(hasLength, R))
{
@property size_t length()
{
size_t result;
foreach (i, Unused; R)
{
result += source[i].length;
}
return result;
}
alias opDollar = length;
}
static if (allSatisfy!(isRandomAccessRange, R))
{
auto ref opIndex(size_t index)
{
foreach (i, Range; R)
{
static if (isInfinite!(Range))
{
return source[i][index];
}
else
{
immutable length = source[i].length;
if (index < length) return fixRef(source[i][index]);
index -= length;
}
}
assert(false);
}
static if (allSatisfy!(hasMobileElements, R))
{
RvalueElementType moveAt(size_t index)
{
foreach (i, Range; R)
{
static if (isInfinite!(Range))
{
return source[i].moveAt(index);
}
else
{
immutable length = source[i].length;
if (index < length) return source[i].moveAt(index);
index -= length;
}
}
assert(false);
}
}
static if (allSameType && allSatisfy!(hasAssignableElements, R))
void opIndexAssign(ElementType v, size_t index)
{
foreach (i, Range; R)
{
static if (isInfinite!(Range))
{
source[i][index] = v;
}
else
{
immutable length = source[i].length;
if (index < length)
{
source[i][index] = v;
return;
}
index -= length;
}
}
assert(false);
}
}
static if (allSatisfy!(hasLength, R) && allSatisfy!(hasSlicing, R))
auto opSlice(size_t begin, size_t end)
{
auto result = this;
foreach (i, Unused; R)
{
immutable len = result.source[i].length;
if (len < begin)
{
result.source[i] = result.source[i]
[len .. len];
begin -= len;
}
else
{
result.source[i] = result.source[i]
[begin .. len];
break;
}
}
auto cut = length;
cut = cut <= end ? 0 : cut - end;
foreach_reverse (i, Unused; R)
{
immutable len = result.source[i].length;
if (cut > len)
{
result.source[i] = result.source[i]
[0 .. 0];
cut -= len;
}
else
{
result.source[i] = result.source[i]
[0 .. len - cut];
break;
}
}
return result;
}
}
return Result(rs);
}
}
///
unittest
{
import std.algorithm : equal;
int[] arr1 = [ 1, 2, 3, 4 ];
int[] arr2 = [ 5, 6 ];
int[] arr3 = [ 7 ];
auto s = chain(arr1, arr2, arr3);
assert(s.length == 7);
assert(s[5] == 6);
assert(equal(s, [1, 2, 3, 4, 5, 6, 7][]));
}
@safe unittest
{
import std.internal.test.dummyrange;
import std.algorithm : equal;
{
int[] arr1 = [ 1, 2, 3, 4 ];
int[] arr2 = [ 5, 6 ];
int[] arr3 = [ 7 ];
int[] witness = [ 1, 2, 3, 4, 5, 6, 7 ];
auto s1 = chain(arr1);
static assert(isRandomAccessRange!(typeof(s1)));
auto s2 = chain(arr1, arr2);
static assert(isBidirectionalRange!(typeof(s2)));
static assert(isRandomAccessRange!(typeof(s2)));
s2.front = 1;
auto s = chain(arr1, arr2, arr3);
assert(s[5] == 6);
assert(equal(s, witness));
assert(s[5] == 6);
}
{
int[] arr1 = [ 1, 2, 3, 4 ];
int[] witness = [ 1, 2, 3, 4 ];
assert(equal(chain(arr1), witness));
}
{
uint[] foo = [1,2,3,4,5];
uint[] bar = [1,2,3,4,5];
auto c = chain(foo, bar);
c[3] = 42;
assert(c[3] == 42);
assert(c.moveFront() == 1);
assert(c.moveBack() == 5);
assert(c.moveAt(4) == 5);
assert(c.moveAt(5) == 1);
}
// Make sure bug 3311 is fixed. ChainImpl should compile even if not all
// elements are mutable.
auto c = chain( iota(0, 10), iota(0, 10) );
// Test the case where infinite ranges are present.
auto inf = chain([0,1,2][], cycle([4,5,6][]), [7,8,9][]); // infinite range
assert(inf[0] == 0);
assert(inf[3] == 4);
assert(inf[6] == 4);
assert(inf[7] == 5);
static assert(isInfinite!(typeof(inf)));
immutable int[] immi = [ 1, 2, 3 ];
immutable float[] immf = [ 1, 2, 3 ];
static assert(is(typeof(chain(immi, immf))));
// Check that chain at least instantiates and compiles with every possible
// pair of DummyRange types, in either order.
foreach (DummyType1; AllDummyRanges) {
DummyType1 dummy1;
foreach (DummyType2; AllDummyRanges) {
DummyType2 dummy2;
auto myChain = chain(dummy1, dummy2);
static assert(
propagatesRangeType!(typeof(myChain), DummyType1, DummyType2)
);
assert(myChain.front == 1);
foreach (i; 0..dummyLength) {
myChain.popFront();
}
assert(myChain.front == 1);
static if (isBidirectionalRange!DummyType1 &&
isBidirectionalRange!DummyType2) {
assert(myChain.back == 10);
}
static if (isRandomAccessRange!DummyType1 &&
isRandomAccessRange!DummyType2) {
assert(myChain[0] == 1);
}
static if (hasLvalueElements!DummyType1 && hasLvalueElements!DummyType2)
{
static assert(hasLvalueElements!(typeof(myChain)));
}
else
{
static assert(!hasLvalueElements!(typeof(myChain)));
}
}
}
}
@safe unittest
{
class Foo{}
immutable(Foo)[] a;
immutable(Foo)[] b;
auto c = chain(a, b);
}
/**
Choose one of two ranges at runtime depending on a Boolean condition.
The ranges may be different, but they must have compatible element types (i.e.
$(D CommonType) must exist for the two element types). The result is a range
that offers the weakest capabilities of the two (e.g. $(D ForwardRange) if $(D
R1) is a random-access range and $(D R2) is a forward range).
Params:
condition = which range to choose: $(D r1) if $(D true), $(D r2) otherwise
r1 = the "true" range
r2 = the "false" range
Returns:
A range type dependent on $(D R1) and $(D R2).
Bugs:
$(BUGZILLA 14660)
*/
auto choose(R1, R2)(bool condition, R1 r1, R2 r2)
if (isInputRange!(Unqual!R1) && isInputRange!(Unqual!R2) &&
!is(CommonType!(ElementType!(Unqual!R1), ElementType!(Unqual!R2)) == void))
{
static struct Result
{
import std.algorithm : max;
import std.algorithm.internal : addressOf;
private union
{
void[max(R1.sizeof, R2.sizeof)] buffer = void;
void* forAlignmentOnly = void;
}
private bool condition;
private @property ref R1 r1()
{
assert(condition);
return *cast(R1*) buffer.ptr;
}
private @property ref R2 r2()
{
assert(!condition);
return *cast(R2*) buffer.ptr;
}
this(bool condition, R1 r1, R2 r2)
{
this.condition = condition;
import std.conv : emplace;
if (condition) emplace(addressOf(this.r1), r1);
else emplace(addressOf(this.r2), r2);
}
// Carefully defined postblit to postblit the appropriate range
static if (hasElaborateCopyConstructor!R1
|| hasElaborateCopyConstructor!R2)
this(this)
{
if (condition)
{
static if (hasElaborateCopyConstructor!R1) r1.__postblit();
}
else
{
static if (hasElaborateCopyConstructor!R2) r2.__postblit();
}
}
static if (hasElaborateDestructor!R1 || hasElaborateDestructor!R2)
~this()
{
if (condition) destroy(r1);
else destroy(r2);
}
static if (isInfinite!R1 && isInfinite!R2)
// Propagate infiniteness.
enum bool empty = false;
else
@property bool empty()
{
return condition ? r1.empty : r2.empty;
}
@property auto ref front()
{
return condition ? r1.front : r2.front;
}
void popFront()
{
return condition ? r1.popFront : r2.popFront;
}
static if (isForwardRange!R1 && isForwardRange!R2)
@property auto save()
{
auto result = this;
if (condition) r1 = r1.save;
else r2 = r2.save;
return result;
}
@property void front(T)(T v)
if (is(typeof({ r1.front = v; r2.front = v; })))
{
if (condition) r1.front = v; else r2.front = v;
}
static if (hasMobileElements!R1 && hasMobileElements!R2)
auto moveFront()
{
return condition ? r1.moveFront : r2.moveFront;
}
static if (isBidirectionalRange!R1 && isBidirectionalRange!R2)
{
@property auto ref back()
{
return condition ? r1.back : r2.back;
}
void popBack()
{
return condition ? r1.popBack : r2.popBack;
}
static if (hasMobileElements!R1 && hasMobileElements!R2)
auto moveBack()
{
return condition ? r1.moveBack : r2.moveBack;
}
@property void back(T)(T v)
if (is(typeof({ r1.back = v; r2.back = v; })))
{
if (condition) r1.back = v; else r2.back = v;
}
}
static if (hasLength!R1 && hasLength!R2)
{
@property size_t length()
{
return condition ? r1.length : r2.length;
}
alias opDollar = length;
}
static if (isRandomAccessRange!R1 && isRandomAccessRange!R2)
{
auto ref opIndex(size_t index)
{
return condition ? r1[index] : r2[index];
}
static if (hasMobileElements!R1 && hasMobileElements!R2)
auto moveAt(size_t index)
{
return condition ? r1.moveAt(index) : r2.moveAt(index);
}
void opIndexAssign(T)(T v, size_t index)
if (is(typeof({ r1[1] = v; r2[1] = v; })))
{
if (condition) r1[index] = v; else r2[index] = v;
}
}
// BUG: this should work for infinite ranges, too
static if (hasSlicing!R1 && hasSlicing!R2 &&
!isInfinite!R2 && !isInfinite!R2)
auto opSlice(size_t begin, size_t end)
{
auto result = this;
if (condition) result.r1 = result.r1[begin .. end];
else result.r2 = result.r2[begin .. end];
return result;
}
}
return Result(condition, r1, r2);
}
///
unittest
{
import std.algorithm.iteration : filter, map;
import std.algorithm.comparison : equal;
auto data1 = [ 1, 2, 3, 4 ].filter!(a => a != 3);
auto data2 = [ 5, 6, 7, 8 ].map!(a => a + 1);
// choose() is primarily useful when you need to select one of two ranges
// with different types at runtime.
static assert(!is(typeof(data1) == typeof(data2)));
auto chooseRange(bool pickFirst)
{
// The returned range is a common wrapper type that can be used for
// returning or storing either range without running into a type error.
return choose(pickFirst, data1, data2);
// Simply returning the chosen range without using choose() does not
// work, because map() and filter() return different types.
//return pickFirst ? data1 : data2; // does not compile
}
auto result = chooseRange(true);
assert(result.equal([ 1, 2, 4 ]));
result = chooseRange(false);
assert(result.equal([ 6, 7, 8, 9 ]));
}
/**
Choose one of multiple ranges at runtime.
The ranges may be different, but they must have compatible element types. The
result is a range that offers the weakest capabilities of all $(D Ranges).
Params:
index = which range to choose, must be less than the number of ranges
rs = two or more ranges
Returns:
The indexed range. If rs consists of only one range, the return type is an
alias of that range's type.
*/
auto chooseAmong(Ranges...)(size_t index, Ranges rs)
if (Ranges.length > 2
&& is(typeof(choose(true, rs[0], rs[1])))
&& is(typeof(chooseAmong(0, rs[1 .. $]))))
{
return choose(index == 0, rs[0], chooseAmong(index - 1, rs[1 .. $]));
}
/// ditto
auto chooseAmong(Ranges...)(size_t index, Ranges rs)
if (Ranges.length == 2 && is(typeof(choose(true, rs[0], rs[1]))))
{
return choose(index == 0, rs[0], rs[1]);
}
///
unittest
{
import std.algorithm : equal;
int[] arr1 = [ 1, 2, 3, 4 ];
int[] arr2 = [ 5, 6 ];
int[] arr3 = [ 7 ];
{
auto s = chooseAmong(0, arr1, arr2, arr3);
auto t = s.save;
assert(s.length == 4);
assert(s[2] == 3);
s.popFront();
assert(equal(t, [1, 2, 3, 4][]));
}
{
auto s = chooseAmong(1, arr1, arr2, arr3);
assert(s.length == 2);
s.front = 8;
assert(equal(s, [8, 6][]));
}
{
auto s = chooseAmong(1, arr1, arr2, arr3);
assert(s.length == 2);
s[1] = 9;
assert(equal(s, [8, 9][]));
}
{
auto s = chooseAmong(1, arr2, arr1, arr3)[1..3];
assert(s.length == 2);
assert(equal(s, [2, 3][]));
}
{
auto s = chooseAmong(0, arr1, arr2, arr3);
assert(s.length == 4);
assert(s.back == 4);
s.popBack();
s.back = 5;
assert(equal(s, [1, 2, 5][]));
s.back = 3;
assert(equal(s, [1, 2, 3][]));
}
{
uint[] foo = [1,2,3,4,5];
uint[] bar = [6,7,8,9,10];
auto c = chooseAmong(1,foo, bar);
assert(c[3] == 9);
c[3] = 42;
assert(c[3] == 42);
assert(c.moveFront() == 6);
assert(c.moveBack() == 10);
assert(c.moveAt(4) == 10);
}
{
import std.range : cycle;
auto s = chooseAmong(1, cycle(arr2), cycle(arr3));
assert(isInfinite!(typeof(s)));
assert(!s.empty);
assert(s[100] == 7);
}
}
unittest
{
int[] a = [1, 2, 3];
long[] b = [4, 5, 6];
auto c = chooseAmong(0, a, b);
c[0] = 42;
assert(c[0] == 42);
}
/**
$(D roundRobin(r1, r2, r3)) yields $(D r1.front), then $(D r2.front),
then $(D r3.front), after which it pops off one element from each and
continues again from $(D r1). For example, if two ranges are involved,
it alternately yields elements off the two ranges. $(D roundRobin)
stops after it has consumed all ranges (skipping over the ones that
finish early).
*/
auto roundRobin(Rs...)(Rs rs)
if (Rs.length > 1 && allSatisfy!(isInputRange, staticMap!(Unqual, Rs)))
{
struct Result
{
import std.conv : to;
public Rs source;
private size_t _current = size_t.max;
@property bool empty()
{
foreach (i, Unused; Rs)
{
if (!source[i].empty) return false;
}
return true;
}
@property auto ref front()
{
final switch (_current)
{
foreach (i, R; Rs)
{
case i:
assert(!source[i].empty);
return source[i].front;
}
}
assert(0);
}
void popFront()
{
final switch (_current)
{
foreach (i, R; Rs)
{
case i:
source[i].popFront();
break;
}
}
auto next = _current == (Rs.length - 1) ? 0 : (_current + 1);
final switch (next)
{
foreach (i, R; Rs)
{
case i:
if (!source[i].empty)
{
_current = i;
return;
}
if (i == _current)
{
_current = _current.max;
return;
}
goto case (i + 1) % Rs.length;
}
}
}
static if (allSatisfy!(isForwardRange, staticMap!(Unqual, Rs)))
@property auto save()
{
Result result = this;
foreach (i, Unused; Rs)
{
result.source[i] = result.source[i].save;
}
return result;
}
static if (allSatisfy!(hasLength, Rs))
{
@property size_t length()
{
size_t result;
foreach (i, R; Rs)
{
result += source[i].length;
}
return result;
}
alias opDollar = length;
}
}
return Result(rs, 0);
}
///
@safe unittest
{
import std.algorithm : equal;
int[] a = [ 1, 2, 3 ];
int[] b = [ 10, 20, 30, 40 ];
auto r = roundRobin(a, b);
assert(equal(r, [ 1, 10, 2, 20, 3, 30, 40 ]));
}
/**
* roundRobin can be used to create "interleave" functionality which inserts
* an element between each element in a range.
*/
unittest
{
import std.algorithm.comparison : equal;
auto interleave(R, E)(R range, E element) if (isInputRange!R)
{
static if (hasLength!R)
{
immutable len = range.length;
}
else
{
immutable len = range.walkLength;
}
return roundRobin(
range,
element.repeat(len - 1)
);
}
assert(interleave([1, 2, 3], 0).equal([1, 0, 2, 0, 3]));
}
/**
Iterates a random-access range starting from a given point and
progressively extending left and right from that point. If no initial
point is given, iteration starts from the middle of the
range. Iteration spans the entire range.
*/
auto radial(Range, I)(Range r, I startingIndex)
if (isRandomAccessRange!(Unqual!Range) && hasLength!(Unqual!Range) && isIntegral!I)
{
if (!r.empty) ++startingIndex;
return roundRobin(retro(r[0 .. startingIndex]), r[startingIndex .. r.length]);
}
/// Ditto
auto radial(R)(R r)
if (isRandomAccessRange!(Unqual!R) && hasLength!(Unqual!R))
{
return .radial(r, (r.length - !r.empty) / 2);
}
///
@safe unittest
{
import std.algorithm : equal;
int[] a = [ 1, 2, 3, 4, 5 ];
assert(equal(radial(a), [ 3, 4, 2, 5, 1 ]));
a = [ 1, 2, 3, 4 ];
assert(equal(radial(a), [ 2, 3, 1, 4 ]));
// If the left end is reached first, the remaining elements on the right
// are concatenated in order:
a = [ 0, 1, 2, 3, 4, 5 ];
assert(equal(radial(a, 1), [ 1, 2, 0, 3, 4, 5 ]));
// If the right end is reached first, the remaining elements on the left
// are concatenated in reverse order:
assert(equal(radial(a, 4), [ 4, 5, 3, 2, 1, 0 ]));
}
@safe unittest
{
import std.conv : text;
import std.exception : enforce;
import std.algorithm : equal;
import std.internal.test.dummyrange;
void test(int[] input, int[] witness)
{
enforce(equal(radial(input), witness),
text(radial(input), " vs. ", witness));
}
test([], []);
test([ 1 ], [ 1 ]);
test([ 1, 2 ], [ 1, 2 ]);
test([ 1, 2, 3 ], [ 2, 3, 1 ]);
test([ 1, 2, 3, 4 ], [ 2, 3, 1, 4 ]);
test([ 1, 2, 3, 4, 5 ], [ 3, 4, 2, 5, 1 ]);
test([ 1, 2, 3, 4, 5, 6 ], [ 3, 4, 2, 5, 1, 6 ]);
int[] a = [ 1, 2, 3, 4, 5 ];
assert(equal(radial(a, 1), [ 2, 3, 1, 4, 5 ][]));
static assert(isForwardRange!(typeof(radial(a, 1))));
auto r = radial([1,2,3,4,5]);
for (auto rr = r.save; !rr.empty; rr.popFront())
{
assert(rr.front == moveFront(rr));
}
r.front = 5;
assert(r.front == 5);
// Test instantiation without lvalue elements.
DummyRange!(ReturnBy.Value, Length.Yes, RangeType.Random) dummy;
assert(equal(radial(dummy, 4), [5, 6, 4, 7, 3, 8, 2, 9, 1, 10]));
// immutable int[] immi = [ 1, 2 ];
// static assert(is(typeof(radial(immi))));
}
@safe unittest
{
import std.algorithm : equal;
auto LL = iota(1L, 6L);
auto r = radial(LL);
assert(equal(r, [3L, 4L, 2L, 5L, 1L]));
}
/**
Lazily takes only up to $(D n) elements of a range. This is
particularly useful when using with infinite ranges. If the range
offers random access and $(D length), $(D Take) offers them as well.
*/
struct Take(Range)
if (isInputRange!(Unqual!Range) &&
//take _cannot_ test hasSlicing on infinite ranges, because hasSlicing uses
//take for slicing infinite ranges.
!((!isInfinite!(Unqual!Range) && hasSlicing!(Unqual!Range)) || is(Range T == Take!T)))
{
private alias R = Unqual!Range;
// User accessible in read and write
public R source;
private size_t _maxAvailable;
alias Source = R;
@property bool empty()
{
return _maxAvailable == 0 || source.empty;
}
@property auto ref front()
{
assert(!empty,
"Attempting to fetch the front of an empty "
~ Take.stringof);
return source.front;
}
void popFront()
{
assert(!empty,
"Attempting to popFront() past the end of a "
~ Take.stringof);
source.popFront();
--_maxAvailable;
}
static if (isForwardRange!R)
@property Take save()
{
return Take(source.save, _maxAvailable);
}
static if (hasAssignableElements!R)
@property auto front(ElementType!R v)
{
assert(!empty,
"Attempting to assign to the front of an empty "
~ Take.stringof);
// This has to return auto instead of void because of Bug 4706.
source.front = v;
}
static if (hasMobileElements!R)
{
auto moveFront()
{
assert(!empty,
"Attempting to move the front of an empty "
~ Take.stringof);
return source.moveFront();
}
}
static if (isInfinite!R)
{
@property size_t length() const
{
return _maxAvailable;
}
alias opDollar = length;
//Note: Due to Take/hasSlicing circular dependency,
//This needs to be a restrained template.
auto opSlice()(size_t i, size_t j)
if (hasSlicing!R)
{
assert(i <= j, "Invalid slice bounds");
assert(j <= length, "Attempting to slice past the end of a "
~ Take.stringof);
return source[i .. j];
}
}
else static if (hasLength!R)
{
@property size_t length()
{
import std.algorithm : min;
return min(_maxAvailable, source.length);
}
alias opDollar = length;
}
static if (isRandomAccessRange!R)
{
void popBack()
{
assert(!empty,
"Attempting to popBack() past the beginning of a "
~ Take.stringof);
--_maxAvailable;
}
@property auto ref back()
{
assert(!empty,
"Attempting to fetch the back of an empty "
~ Take.stringof);
return source[this.length - 1];
}
auto ref opIndex(size_t index)
{
assert(index < length,
"Attempting to index out of the bounds of a "
~ Take.stringof);
return source[index];
}
static if (hasAssignableElements!R)
{
@property auto back(ElementType!R v)
{
// This has to return auto instead of void because of Bug 4706.
assert(!empty,
"Attempting to assign to the back of an empty "
~ Take.stringof);
source[this.length - 1] = v;
}
void opIndexAssign(ElementType!R v, size_t index)
{
assert(index < length,
"Attempting to index out of the bounds of a "
~ Take.stringof);
source[index] = v;
}
}
static if (hasMobileElements!R)
{
auto moveBack()
{
assert(!empty,
"Attempting to move the back of an empty "
~ Take.stringof);
return source.moveAt(this.length - 1);
}
auto moveAt(size_t index)
{
assert(index < length,
"Attempting to index out of the bounds of a "
~ Take.stringof);
return source.moveAt(index);
}
}
}
// Nonstandard
@property size_t maxLength() const
{
return _maxAvailable;
}
}
// This template simply aliases itself to R and is useful for consistency in
// generic code.
template Take(R)
if (isInputRange!(Unqual!R) &&
((!isInfinite!(Unqual!R) && hasSlicing!(Unqual!R)) || is(R T == Take!T)))
{
alias Take = R;
}
// take for finite ranges with slicing
/// ditto
Take!R take(R)(R input, size_t n)
if (isInputRange!(Unqual!R) && !isInfinite!(Unqual!R) && hasSlicing!(Unqual!R) &&
!is(R T == Take!T))
{
// @@@BUG@@@
//return input[0 .. min(n, $)];
import std.algorithm : min;
return input[0 .. min(n, input.length)];
}
///
@safe unittest
{
import std.algorithm : equal;
int[] arr1 = [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 ];
auto s = take(arr1, 5);
assert(s.length == 5);
assert(s[4] == 5);
assert(equal(s, [ 1, 2, 3, 4, 5 ][]));
}
/**
* If the range runs out before `n` elements, `take` simply returns the entire
* range (unlike $(LREF takeExactly), which will cause an assertion failure if
* the range ends prematurely):
*/
@safe unittest
{
import std.algorithm : equal;
int[] arr2 = [ 1, 2, 3 ];
auto t = take(arr2, 5);
assert(t.length == 3);
assert(equal(t, [ 1, 2, 3 ]));
}
// take(take(r, n1), n2)
Take!R take(R)(R input, size_t n)
if (is(R T == Take!T))
{
import std.algorithm : min;
return R(input.source, min(n, input._maxAvailable));
}
// Regular take for input ranges
Take!(R) take(R)(R input, size_t n)
if (isInputRange!(Unqual!R) && (isInfinite!(Unqual!R) || !hasSlicing!(Unqual!R) && !is(R T == Take!T)))
{
return Take!R(input, n);
}
@safe unittest
{
import std.internal.test.dummyrange;
import std.algorithm : equal;
int[] arr1 = [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 ];
auto s = take(arr1, 5);
assert(s.length == 5);
assert(s[4] == 5);
assert(equal(s, [ 1, 2, 3, 4, 5 ][]));
assert(equal(retro(s), [ 5, 4, 3, 2, 1 ][]));
// Test fix for bug 4464.
static assert(is(typeof(s) == Take!(int[])));
static assert(is(typeof(s) == int[]));
// Test using narrow strings.
auto myStr = "This is a string.";
auto takeMyStr = take(myStr, 7);
assert(equal(takeMyStr, "This is"));
// Test fix for bug 5052.
auto takeMyStrAgain = take(takeMyStr, 4);
assert(equal(takeMyStrAgain, "This"));
static assert (is (typeof(takeMyStrAgain) == typeof(takeMyStr)));
takeMyStrAgain = take(takeMyStr, 10);
assert(equal(takeMyStrAgain, "This is"));
foreach (DummyType; AllDummyRanges) {
DummyType dummy;
auto t = take(dummy, 5);
alias T = typeof(t);
static if (isRandomAccessRange!DummyType) {
static assert(isRandomAccessRange!T);
assert(t[4] == 5);
assert(moveAt(t, 1) == t[1]);
assert(t.back == moveBack(t));
} else static if (isForwardRange!DummyType) {
static assert(isForwardRange!T);
}
for (auto tt = t; !tt.empty; tt.popFront())
{
assert(tt.front == moveFront(tt));
}
// Bidirectional ranges can't be propagated properly if they don't
// also have random access.
assert(equal(t, [1,2,3,4,5]));
//Test that take doesn't wrap the result of take.
assert(take(t, 4) == take(dummy, 4));
}
immutable myRepeat = repeat(1);
static assert(is(Take!(typeof(myRepeat))));
}
@safe nothrow @nogc unittest
{
//check for correct slicing of Take on an infinite range
import std.algorithm : equal;
foreach (start; 0 .. 4)
foreach (stop; start .. 4)
assert(iota(4).cycle.take(4)[start .. stop]
.equal(iota(start, stop)));
}
@safe unittest
{
// Check that one can declare variables of all Take types,
// and that they match the return type of the corresponding
// take(). (See issue 4464.)
int[] r1;
Take!(int[]) t1;
t1 = take(r1, 1);
string r2;
Take!string t2;
t2 = take(r2, 1);
Take!(Take!string) t3;
t3 = take(t2, 1);
}
@safe unittest
{
alias R1 = typeof(repeat(1));
alias R2 = typeof(cycle([1]));
alias TR1 = Take!R1;
alias TR2 = Take!R2;
static assert(isBidirectionalRange!TR1);
static assert(isBidirectionalRange!TR2);
}
@safe unittest //12731
{
auto a = repeat(1);
auto s = a[1 .. 5];
s = s[1 .. 3];
}
@safe unittest //13151
{
import std.algorithm : equal;
auto r = take(repeat(1, 4), 3);
assert(r.take(2).equal(repeat(1, 2)));
}
/**
Similar to $(LREF take), but assumes that $(D range) has at least $(D
n) elements. Consequently, the result of $(D takeExactly(range, n))
always defines the $(D length) property (and initializes it to $(D n))
even when $(D range) itself does not define $(D length).
The result of $(D takeExactly) is identical to that of $(LREF take) in
cases where the original range defines $(D length) or is infinite.
Unlike $(LREF take), however, it is illegal to pass a range with less than
$(D n) elements to $(D takeExactly); this will cause an assertion failure.
*/
auto takeExactly(R)(R range, size_t n)
if (isInputRange!R)
{
static if (is(typeof(takeExactly(range._input, n)) == R))
{
assert(n <= range._n,
"Attempted to take more than the length of the range with takeExactly.");
// takeExactly(takeExactly(r, n1), n2) has the same type as
// takeExactly(r, n1) and simply returns takeExactly(r, n2)
range._n = n;
return range;
}
//Also covers hasSlicing!R for finite ranges.
else static if (hasLength!R)
{
assert(n <= range.length,
"Attempted to take more than the length of the range with takeExactly.");
return take(range, n);
}
else static if (isInfinite!R)
return Take!R(range, n);
else
{
static struct Result
{
R _input;
private size_t _n;
@property bool empty() const { return !_n; }
@property auto ref front()
{
assert(_n > 0, "front() on an empty " ~ Result.stringof);
return _input.front;
}
void popFront() { _input.popFront(); --_n; }
@property size_t length() const { return _n; }
alias opDollar = length;
@property Take!R _takeExactly_Result_asTake()
{
return typeof(return)(_input, _n);
}
alias _takeExactly_Result_asTake this;
static if (isForwardRange!R)
@property auto save()
{
return Result(_input.save, _n);
}
static if (hasMobileElements!R)
{
auto moveFront()
{
assert(!empty,
"Attempting to move the front of an empty "
~ typeof(this).stringof);
return _input.moveFront();
}
}
static if (hasAssignableElements!R)
{
@property auto ref front(ElementType!R v)
{
assert(!empty,
"Attempting to assign to the front of an empty "
~ typeof(this).stringof);
return _input.front = v;
}
}
}
return Result(range, n);
}
}
///
@safe unittest
{
import std.algorithm : equal;
auto a = [ 1, 2, 3, 4, 5 ];
auto b = takeExactly(a, 3);
assert(equal(b, [1, 2, 3]));
static assert(is(typeof(b.length) == size_t));
assert(b.length == 3);
assert(b.front == 1);
assert(b.back == 3);
}
@safe unittest
{
import std.algorithm : equal, filter;
auto a = [ 1, 2, 3, 4, 5 ];
auto b = takeExactly(a, 3);
auto c = takeExactly(b, 2);
auto d = filter!"a > 0"(a);
auto e = takeExactly(d, 3);
assert(equal(e, [1, 2, 3]));
static assert(is(typeof(e.length) == size_t));
assert(e.length == 3);
assert(e.front == 1);
assert(equal(takeExactly(e, 3), [1, 2, 3]));
}
@safe unittest
{
import std.algorithm : equal;
import std.internal.test.dummyrange;
auto a = [ 1, 2, 3, 4, 5 ];
//Test that take and takeExactly are the same for ranges which define length
//but aren't sliceable.
struct L
{
@property auto front() { return _arr[0]; }
@property bool empty() { return _arr.empty; }
void popFront() { _arr.popFront(); }
@property size_t length() { return _arr.length; }
int[] _arr;
}
static assert(is(typeof(take(L(a), 3)) == typeof(takeExactly(L(a), 3))));
assert(take(L(a), 3) == takeExactly(L(a), 3));
//Test that take and takeExactly are the same for ranges which are sliceable.
static assert(is(typeof(take(a, 3)) == typeof(takeExactly(a, 3))));
assert(take(a, 3) == takeExactly(a, 3));
//Test that take and takeExactly are the same for infinite ranges.
auto inf = repeat(1);
static assert(is(typeof(take(inf, 5)) == Take!(typeof(inf))));
assert(take(inf, 5) == takeExactly(inf, 5));
//Test that take and takeExactly are _not_ the same for ranges which don't
//define length.
static assert(!is(typeof(take(filter!"true"(a), 3)) == typeof(takeExactly(filter!"true"(a), 3))));
foreach (DummyType; AllDummyRanges)
{
{
DummyType dummy;
auto t = takeExactly(dummy, 5);
//Test that takeExactly doesn't wrap the result of takeExactly.
assert(takeExactly(t, 4) == takeExactly(dummy, 4));
}
static if (hasMobileElements!DummyType)
{
{
auto t = takeExactly(DummyType.init, 4);
assert(t.moveFront() == 1);
assert(equal(t, [1, 2, 3, 4]));
}
}
static if (hasAssignableElements!DummyType)
{
{
auto t = takeExactly(DummyType.init, 4);
t.front = 9;
assert(equal(t, [9, 2, 3, 4]));
}
}
}
}
@safe unittest
{
import std.algorithm : equal;
import std.internal.test.dummyrange;
alias DummyType = DummyRange!(ReturnBy.Value, Length.No, RangeType.Forward);
auto te = takeExactly(DummyType(), 5);
Take!DummyType t = te;
assert(equal(t, [1, 2, 3, 4, 5]));
assert(equal(t, te));
}
/**
Returns a range with at most one element; for example, $(D
takeOne([42, 43, 44])) returns a range consisting of the integer $(D
42). Calling $(D popFront()) off that range renders it empty.
In effect $(D takeOne(r)) is somewhat equivalent to $(D take(r, 1)) but in
certain interfaces it is important to know statically that the range may only
have at most one element.
The type returned by $(D takeOne) is a random-access range with length
regardless of $(D R)'s capabilities (another feature that distinguishes
$(D takeOne) from $(D take)).
*/
auto takeOne(R)(R source) if (isInputRange!R)
{
static if (hasSlicing!R)
{
return source[0 .. !source.empty];
}
else
{
static struct Result
{
private R _source;
private bool _empty = true;
@property bool empty() const { return _empty; }
@property auto ref front() { assert(!empty); return _source.front; }
void popFront() { assert(!empty); _empty = true; }
void popBack() { assert(!empty); _empty = true; }
static if (isForwardRange!(Unqual!R))
{
@property auto save() { return Result(_source.save, empty); }
}
@property auto ref back() { assert(!empty); return _source.front; }
@property size_t length() const { return !empty; }
alias opDollar = length;
auto ref opIndex(size_t n) { assert(n < length); return _source.front; }
auto opSlice(size_t m, size_t n)
{
assert(m <= n && n < length);
return n > m ? this : Result(_source, false);
}
// Non-standard property
@property R source() { return _source; }
}
return Result(source, source.empty);
}
}
///
@safe unittest
{
auto s = takeOne([42, 43, 44]);
static assert(isRandomAccessRange!(typeof(s)));
assert(s.length == 1);
assert(!s.empty);
assert(s.front == 42);
s.front = 43;
assert(s.front == 43);
assert(s.back == 43);
assert(s[0] == 43);
s.popFront();
assert(s.length == 0);
assert(s.empty);
}
unittest
{
struct NonForwardRange
{
enum empty = false;
int front() { return 42; }
void popFront() {}
}
static assert(!isForwardRange!NonForwardRange);
auto s = takeOne(NonForwardRange());
assert(s.front == 42);
}
/++
Returns an empty range which is statically known to be empty and is
guaranteed to have $(D length) and be random access regardless of $(D R)'s
capabilities.
+/
auto takeNone(R)()
if (isInputRange!R)
{
return typeof(takeOne(R.init)).init;
}
///
@safe unittest
{
auto range = takeNone!(int[])();
assert(range.length == 0);
assert(range.empty);
}
@safe unittest
{
enum ctfe = takeNone!(int[])();
static assert(ctfe.length == 0);
static assert(ctfe.empty);
}
/++
Creates an empty range from the given range in $(BIGOH 1). If it can, it
will return the same range type. If not, it will return
$(D takeExactly(range, 0)).
+/
auto takeNone(R)(R range)
if (isInputRange!R)
{
//Makes it so that calls to takeNone which don't use UFCS still work with a
//member version if it's defined.
static if (is(typeof(R.takeNone)))
auto retval = range.takeNone();
//@@@BUG@@@ 8339
else static if (isDynamicArray!R)/+ ||
(is(R == struct) && __traits(compiles, {auto r = R.init;}) && R.init.empty))+/
{
auto retval = R.init;
}
//An infinite range sliced at [0 .. 0] would likely still not be empty...
else static if (hasSlicing!R && !isInfinite!R)
auto retval = range[0 .. 0];
else
auto retval = takeExactly(range, 0);
//@@@BUG@@@ 7892 prevents this from being done in an out block.
assert(retval.empty);
return retval;
}
///
@safe unittest
{
import std.algorithm : filter;
assert(takeNone([42, 27, 19]).empty);
assert(takeNone("dlang.org").empty);
assert(takeNone(filter!"true"([42, 27, 19])).empty);
}
@safe unittest
{
import std.algorithm : filter;
struct Dummy
{
mixin template genInput()
{
@property bool empty() { return _arr.empty; }
@property auto front() { return _arr.front; }
void popFront() { _arr.popFront(); }
static assert(isInputRange!(typeof(this)));
}
}
alias genInput = Dummy.genInput;
static struct NormalStruct
{
//Disabled to make sure that the takeExactly version is used.
@disable this();
this(int[] arr) { _arr = arr; }
mixin genInput;
int[] _arr;
}
static struct SliceStruct
{
@disable this();
this(int[] arr) { _arr = arr; }
mixin genInput;
@property auto save() { return this; }
auto opSlice(size_t i, size_t j) { return typeof(this)(_arr[i .. j]); }
@property size_t length() { return _arr.length; }
int[] _arr;
}
static struct InitStruct
{
mixin genInput;
int[] _arr;
}
static struct TakeNoneStruct
{
this(int[] arr) { _arr = arr; }
@disable this();
mixin genInput;
auto takeNone() { return typeof(this)(null); }
int[] _arr;
}
static class NormalClass
{
this(int[] arr) {_arr = arr;}
mixin genInput;
int[] _arr;
}
static class SliceClass
{
this(int[] arr) { _arr = arr; }
mixin genInput;
@property auto save() { return new typeof(this)(_arr); }
auto opSlice(size_t i, size_t j) { return new typeof(this)(_arr[i .. j]); }
@property size_t length() { return _arr.length; }
int[] _arr;
}
static class TakeNoneClass
{
this(int[] arr) { _arr = arr; }
mixin genInput;
auto takeNone() { return new typeof(this)(null); }
int[] _arr;
}
import std.format : format;
foreach (range; AliasSeq!([1, 2, 3, 4, 5],
"hello world",
"hello world"w,
"hello world"d,
SliceStruct([1, 2, 3]),
//@@@BUG@@@ 8339 forces this to be takeExactly
//`InitStruct([1, 2, 3]),
TakeNoneStruct([1, 2, 3])))
{
static assert(takeNone(range).empty, typeof(range).stringof);
assert(takeNone(range).empty);
static assert(is(typeof(range) == typeof(takeNone(range))), typeof(range).stringof);
}
foreach (range; AliasSeq!(NormalStruct([1, 2, 3]),
InitStruct([1, 2, 3])))
{
static assert(takeNone(range).empty, typeof(range).stringof);
assert(takeNone(range).empty);
static assert(is(typeof(takeExactly(range, 0)) == typeof(takeNone(range))), typeof(range).stringof);
}
//Don't work in CTFE.
auto normal = new NormalClass([1, 2, 3]);
assert(takeNone(normal).empty);
static assert(is(typeof(takeExactly(normal, 0)) == typeof(takeNone(normal))), typeof(normal).stringof);
auto slice = new SliceClass([1, 2, 3]);
assert(takeNone(slice).empty);
static assert(is(SliceClass == typeof(takeNone(slice))), typeof(slice).stringof);
auto taken = new TakeNoneClass([1, 2, 3]);
assert(takeNone(taken).empty);
static assert(is(TakeNoneClass == typeof(takeNone(taken))), typeof(taken).stringof);
auto filtered = filter!"true"([1, 2, 3, 4, 5]);
assert(takeNone(filtered).empty);
//@@@BUG@@@ 8339 and 5941 force this to be takeExactly
//static assert(is(typeof(filtered) == typeof(takeNone(filtered))), typeof(filtered).stringof);
}
/++
+ Return a _range advanced to within $(D _n) elements of the end of
+ $(D _range).
+
+ Intended as the _range equivalent of the Unix
+ $(WEB en.wikipedia.org/wiki/Tail_%28Unix%29, _tail) utility. When the length
+ of $(D _range) is less than or equal to $(D _n), $(D _range) is returned
+ as-is.
+
+ Completes in $(BIGOH 1) steps for ranges that support slicing and have
+ length. Completes in $(BIGOH _range.length) time for all other ranges.
+
+ Params:
+ range = _range to get _tail of
+ n = maximum number of elements to include in _tail
+
+ Returns:
+ Returns the _tail of $(D _range) augmented with length information
+/
auto tail(Range)(Range range, size_t n)
if (isInputRange!Range && !isInfinite!Range &&
(hasLength!Range || isForwardRange!Range))
{
static if (hasLength!Range)
{
immutable length = range.length;
if (n >= length)
return range.takeExactly(length);
else
return range.drop(length - n).takeExactly(n);
}
else
{
Range scout = range.save;
foreach (immutable i; 0 .. n)
{
if (scout.empty)
return range.takeExactly(i);
scout.popFront();
}
auto tail = range.save;
while (!scout.empty)
{
assert(!tail.empty);
scout.popFront();
tail.popFront();
}
return tail.takeExactly(n);
}
}
///
pure @safe unittest
{
// tail -c n
assert([1, 2, 3].tail(1) == [3]);
assert([1, 2, 3].tail(2) == [2, 3]);
assert([1, 2, 3].tail(3) == [1, 2, 3]);
assert([1, 2, 3].tail(4) == [1, 2, 3]);
assert([1, 2, 3].tail(0).length == 0);
// tail --lines=n
import std.algorithm.comparison : equal;
import std.algorithm.iteration : joiner;
import std.string : lineSplitter;
assert("one\ntwo\nthree"
.lineSplitter
.tail(2)
.joiner("\n")
.equal("two\nthree"));
}
// @nogc prevented by @@@BUG@@@ 15408
pure nothrow @safe /+@nogc+/ unittest
{
import std.algorithm.comparison : equal;
import std.internal.test.dummyrange;
static immutable cheatsheet = [6, 7, 8, 9, 10];
foreach (R; AllDummyRanges)
{
static if (isInputRange!R && !isInfinite!R &&
(hasLength!R || isForwardRange!R))
{
assert(R.init.tail(5).equal(cheatsheet));
static assert(R.init.tail(5).equal(cheatsheet));
assert(R.init.tail(0).length == 0);
assert(R.init.tail(10).equal(R.init));
assert(R.init.tail(11).equal(R.init));
}
}
// Infinite ranges are not supported
static assert(!__traits(compiles, repeat(0).tail(0)));
// Neither are non-forward ranges without length
static assert(!__traits(compiles, DummyRange!(ReturnBy.Value, Length.No,
RangeType.Input).init.tail(5)));
}
@nogc unittest
{
static immutable input = [1, 2, 3];
static immutable expectedOutput = [2, 3];
assert(input.tail(2) == expectedOutput);
}
/++
Convenience function which calls
$(D range.$(LREF popFrontN)(n)) and returns $(D range). $(D drop)
makes it easier to pop elements from a range
and then pass it to another function within a single expression,
whereas $(D popFrontN) would require multiple statements.
$(D dropBack) provides the same functionality but instead calls
$(D range.popBackN(n)).
Note: $(D drop) and $(D dropBack) will only pop $(I up to)
$(D n) elements but will stop if the range is empty first.
+/
R drop(R)(R range, size_t n)
if (isInputRange!R)
{
range.popFrontN(n);
return range;
}
/// ditto
R dropBack(R)(R range, size_t n)
if (isBidirectionalRange!R)
{
range.popBackN(n);
return range;
}
///
@safe unittest
{
import std.algorithm : equal;
assert([0, 2, 1, 5, 0, 3].drop(3) == [5, 0, 3]);
assert("hello world".drop(6) == "world");
assert("hello world".drop(50).empty);
assert("hello world".take(6).drop(3).equal("lo "));
}
@safe unittest
{
import std.algorithm : equal;
assert([0, 2, 1, 5, 0, 3].dropBack(3) == [0, 2, 1]);
assert("hello world".dropBack(6) == "hello");
assert("hello world".dropBack(50).empty);
assert("hello world".drop(4).dropBack(4).equal("o w"));
}
@safe unittest
{
import std.algorithm : equal;
import std.container.dlist;
//Remove all but the first two elements
auto a = DList!int(0, 1, 9, 9, 9, 9);
a.remove(a[].drop(2));
assert(a[].equal(a[].take(2)));
}
@safe unittest
{
import std.algorithm : equal, filter;
assert(drop("", 5).empty);
assert(equal(drop(filter!"true"([0, 2, 1, 5, 0, 3]), 3), [5, 0, 3]));
}
@safe unittest
{
import std.algorithm : equal;
import std.container.dlist;
//insert before the last two elements
auto a = DList!int(0, 1, 2, 5, 6);
a.insertAfter(a[].dropBack(2), [3, 4]);
assert(a[].equal(iota(0, 7)));
}
/++
Similar to $(LREF drop) and $(D dropBack) but they call
$(D range.$(LREF popFrontExactly)(n)) and $(D range.popBackExactly(n))
instead.
Note: Unlike $(D drop), $(D dropExactly) will assume that the
range holds at least $(D n) elements. This makes $(D dropExactly)
faster than $(D drop), but it also means that if $(D range) does
not contain at least $(D n) elements, it will attempt to call $(D popFront)
on an empty range, which is undefined behavior. So, only use
$(D popFrontExactly) when it is guaranteed that $(D range) holds at least
$(D n) elements.
+/
R dropExactly(R)(R range, size_t n)
if (isInputRange!R)
{
popFrontExactly(range, n);
return range;
}
/// ditto
R dropBackExactly(R)(R range, size_t n)
if (isBidirectionalRange!R)
{
popBackExactly(range, n);
return range;
}
///
@safe unittest
{
import std.algorithm : equal, filterBidirectional;
auto a = [1, 2, 3];
assert(a.dropExactly(2) == [3]);
assert(a.dropBackExactly(2) == [1]);
string s = "日本語";
assert(s.dropExactly(2) == "語");
assert(s.dropBackExactly(2) == "日");
auto bd = filterBidirectional!"true"([1, 2, 3]);
assert(bd.dropExactly(2).equal([3]));
assert(bd.dropBackExactly(2).equal([1]));
}
/++
Convenience function which calls
$(D range.popFront()) and returns $(D range). $(D dropOne)
makes it easier to pop an element from a range
and then pass it to another function within a single expression,
whereas $(D popFront) would require multiple statements.
$(D dropBackOne) provides the same functionality but instead calls
$(D range.popBack()).
+/
R dropOne(R)(R range)
if (isInputRange!R)
{
range.popFront();
return range;
}
/// ditto
R dropBackOne(R)(R range)
if (isBidirectionalRange!R)
{
range.popBack();
return range;
}
///
@safe unittest
{
import std.algorithm : equal, filterBidirectional;
import std.container.dlist;
auto dl = DList!int(9, 1, 2, 3, 9);
assert(dl[].dropOne().dropBackOne().equal([1, 2, 3]));
auto a = [1, 2, 3];
assert(a.dropOne() == [2, 3]);
assert(a.dropBackOne() == [1, 2]);
string s = "日本語";
assert(s.dropOne() == "本語");
assert(s.dropBackOne() == "日本");
auto bd = filterBidirectional!"true"([1, 2, 3]);
assert(bd.dropOne().equal([2, 3]));
assert(bd.dropBackOne().equal([1, 2]));
}
/**
Repeats one value forever.
Models an infinite bidirectional and random access range, with slicing.
*/
struct Repeat(T)
{
private:
//Store a non-qualified T when possible: This is to make Repeat assignable
static if ((is(T == class) || is(T == interface)) && (is(T == const) || is(T == immutable)))
{
import std.typecons;
alias UT = Rebindable!T;
}
else static if (is(T : Unqual!T) && is(Unqual!T : T))
alias UT = Unqual!T;
else
alias UT = T;
UT _value;
public:
@property inout(T) front() inout { return _value; }
@property inout(T) back() inout { return _value; }
enum bool empty = false;
void popFront() {}
void popBack() {}
@property auto save() inout { return this; }
inout(T) opIndex(size_t) inout { return _value; }
auto opSlice(size_t i, size_t j)
in
{
assert(i <= j);
}
body
{
return this.takeExactly(j - i);
}
private static struct DollarToken {}
enum opDollar = DollarToken.init;
auto opSlice(size_t, DollarToken) inout { return this; }
}
/// Ditto
Repeat!T repeat(T)(T value) { return Repeat!T(value); }
///
@safe unittest
{
import std.algorithm : equal;
assert(equal(5.repeat().take(4), [ 5, 5, 5, 5 ]));
}
@safe unittest
{
import std.algorithm : equal;
auto r = repeat(5);
alias R = typeof(r);
static assert(isBidirectionalRange!R);
static assert(isForwardRange!R);
static assert(isInfinite!R);
static assert(hasSlicing!R);
assert(r.back == 5);
assert(r.front == 5);
assert(r.take(4).equal([ 5, 5, 5, 5 ]));
assert(r[0 .. 4].equal([ 5, 5, 5, 5 ]));
R r2 = r[5 .. $];
}
/**
Repeats $(D value) exactly $(D n) times. Equivalent to $(D
take(repeat(value), n)).
*/
Take!(Repeat!T) repeat(T)(T value, size_t n)
{
return take(repeat(value), n);
}
///
@safe unittest
{
import std.algorithm : equal;
assert(equal(5.repeat(4), 5.repeat().take(4)));
}
@safe unittest //12007
{
static class C{}
Repeat!(immutable int) ri;
ri = ri.save;
Repeat!(immutable C) rc;
rc = rc.save;
import std.algorithm;
immutable int[] A = [1,2,3];
immutable int[] B = [4,5,6];
auto AB = cartesianProduct(A,B);
}
/**
Given callable ($(XREF traits, isCallable)) $(D fun), create as a range
whose front is defined by successive calls to $(D fun()).
This is especially useful to call function with global side effects (random
functions), or to create ranges expressed as a single delegate, rather than
an entire $(D front)/$(D popFront)/$(D empty) structure.
$(D fun) maybe be passed either a template alias parameter (existing
function, delegate, struct type defining static $(D opCall)... ) or
a run-time value argument (delegate, function object... ).
The result range models an InputRange
($(XREF_PACK range,primitives,isInputRange)).
The resulting range will call $(D fun()) on every call to $(D front),
and only when $(D front) is called, regardless of how the range is
iterated.
It is advised to compose generate with either
$(XREF_PACK algorithm,iteration,cache) or $(XREF array,array), or to use it in a
foreach loop.
A by-value foreach loop means that the loop value is not $(D ref).
Params:
fun = is the $(D isCallable) that gets called on every call to front.
Returns: an $(D inputRange) that returns a new value generated by $(D Fun) on
any call to $(D front).
*/
auto generate(Fun)(Fun fun)
if (isCallable!fun)
{
return Generator!(Fun)(fun);
}
/// ditto
auto generate(alias fun)()
if (isCallable!fun)
{
return Generator!(fun)();
}
///
@safe pure unittest
{
import std.algorithm : equal, map;
int i = 1;
auto powersOfTwo = generate!(() => i *= 2)().take(10);
assert(equal(powersOfTwo, iota(1, 11).map!"2^^a"()));
}
///
@safe pure unittest
{
import std.algorithm : equal;
//Returns a run-time delegate
auto infiniteIota(T)(T low, T high)
{
T i = high;
return (){if (i == high) i = low; return i++;};
}
//adapted as a range.
assert(equal(generate(infiniteIota(1, 4)).take(10), [1, 2, 3, 1, 2, 3, 1, 2, 3, 1]));
}
///
unittest
{
import std.format, std.random;
auto r = generate!(() => uniform(0, 6)).take(10);
format("%(%s %)", r);
}
//private struct Generator(bool onPopFront, bool runtime, Fun...)
private struct Generator(Fun...)
{
static assert(Fun.length == 1);
static assert(isInputRange!Generator);
private:
static if (is(Fun[0]))
Fun[0] fun;
else
alias fun = Fun[0];
public:
enum empty = false;
auto ref front() @property
{
return fun();
}
void popFront() { }
}
@safe unittest
{
import std.algorithm : equal;
struct StaticOpCall
{
static ubyte opCall() { return 5 ; }
}
assert(equal(generate!StaticOpCall().take(10), repeat(5).take(10)));
}
@safe pure unittest
{
import std.algorithm : equal;
struct OpCall
{
ubyte opCall() @safe pure { return 5 ; }
}
OpCall op;
assert(equal(generate(op).take(10), repeat(5).take(10)));
}
/**
Repeats the given forward range ad infinitum. If the original range is
infinite (fact that would make $(D Cycle) the identity application),
$(D Cycle) detects that and aliases itself to the range type
itself. If the original range has random access, $(D Cycle) offers
random access and also offers a constructor taking an initial position
$(D index). $(D Cycle) works with static arrays in addition to ranges,
mostly for performance reasons.
Note: The input range must not be empty.
Tip: This is a great way to implement simple circular buffers.
*/
struct Cycle(R)
if (isForwardRange!R && !isInfinite!R)
{
static if (isRandomAccessRange!R && hasLength!R)
{
private R _original;
private size_t _index;
this(R input, size_t index = 0)
{
_original = input;
_index = index % _original.length;
}
@property auto ref front()
{
return _original[_index];
}
static if (is(typeof((cast(const R)_original)[_index])))
{
@property auto ref front() const
{
return _original[_index];
}
}
static if (hasAssignableElements!R)
{
@property auto front(ElementType!R val)
{
_original[_index] = val;
}
}
enum bool empty = false;
void popFront()
{
++_index;
if (_index >= _original.length)
_index = 0;
}
auto ref opIndex(size_t n)
{
return _original[(n + _index) % _original.length];
}
static if (is(typeof((cast(const R)_original)[_index])) &&
is(typeof((cast(const R)_original).length)))
{
auto ref opIndex(size_t n) const
{
return _original[(n + _index) % _original.length];
}
}
static if (hasAssignableElements!R)
{
auto opIndexAssign(ElementType!R val, size_t n)
{
_original[(n + _index) % _original.length] = val;
}
}
@property Cycle save()
{
//No need to call _original.save, because Cycle never actually modifies _original
return Cycle(_original, _index);
}
private static struct DollarToken {}
enum opDollar = DollarToken.init;
auto opSlice(size_t i, size_t j)
in
{
assert(i <= j);
}
body
{
return this[i .. $].takeExactly(j - i);
}
auto opSlice(size_t i, DollarToken)
{
return typeof(this)(_original, _index + i);
}
}
else
{
private R _original;
private R _current;
this(R input)
{
_original = input;
_current = input.save;
}
@property auto ref front()
{
return _current.front;
}
static if (is(typeof((cast(const R)_current).front)))
{
@property auto ref front() const
{
return _current.front;
}
}
static if (hasAssignableElements!R)
{
@property auto front(ElementType!R val)
{
return _current.front = val;
}
}
enum bool empty = false;
void popFront()
{
_current.popFront();
if (_current.empty)
_current = _original.save;
}
@property Cycle save()
{
//No need to call _original.save, because Cycle never actually modifies _original
Cycle ret = this;
ret._original = _original;
ret._current = _current.save;
return ret;
}
}
}
template Cycle(R)
if (isInfinite!R)
{
alias Cycle = R;
}
struct Cycle(R)
if (isStaticArray!R)
{
private alias ElementType = typeof(R.init[0]);
private ElementType* _ptr;
private size_t _index;
nothrow:
this(ref R input, size_t index = 0) @system
{
_ptr = input.ptr;
_index = index % R.length;
}
@property ref inout(ElementType) front() inout @safe
{
static ref auto trustedPtrIdx(typeof(_ptr) p, size_t idx) @trusted
{
return p[idx];
}
return trustedPtrIdx(_ptr, _index);
}
enum bool empty = false;
void popFront() @safe
{
++_index;
if (_index >= R.length)
_index = 0;
}
ref inout(ElementType) opIndex(size_t n) inout @safe
{
static ref auto trustedPtrIdx(typeof(_ptr) p, size_t idx) @trusted
{
return p[idx % R.length];
}
return trustedPtrIdx(_ptr, n + _index);
}
@property inout(Cycle) save() inout @safe
{
return this;
}
private static struct DollarToken {}
enum opDollar = DollarToken.init;
auto opSlice(size_t i, size_t j) @safe
in
{
assert(i <= j);
}
body
{
return this[i .. $].takeExactly(j - i);
}
inout(typeof(this)) opSlice(size_t i, DollarToken) inout @safe
{
static auto trustedCtor(typeof(_ptr) p, size_t idx) @trusted
{
return cast(inout)Cycle(*cast(R*)(p), idx);
}
return trustedCtor(_ptr, _index + i);
}
}
/// Ditto
Cycle!R cycle(R)(R input)
if (isForwardRange!R && !isInfinite!R)
{
assert(!input.empty);
return Cycle!R(input);
}
///
@safe unittest
{
import std.algorithm : equal;
import std.range : cycle, take;
// Here we create an infinitive cyclic sequence from [1, 2]
// (i.e. get here [1, 2, 1, 2, 1, 2 and so on]) then
// take 5 elements of this sequence (so we have [1, 2, 1, 2, 1])
// and compare them with the expected values for equality.
assert(cycle([1, 2]).take(5).equal([ 1, 2, 1, 2, 1 ]));
}
/// Ditto
Cycle!R cycle(R)(R input, size_t index = 0)
if (isRandomAccessRange!R && !isInfinite!R)
{
assert(!input.empty);
return Cycle!R(input, index);
}
Cycle!R cycle(R)(R input)
if (isInfinite!R)
{
return input;
}
Cycle!R cycle(R)(ref R input, size_t index = 0) @system
if (isStaticArray!R)
{
return Cycle!R(input, index);
}
@safe unittest
{
import std.internal.test.dummyrange;
import std.algorithm : equal;
static assert(isForwardRange!(Cycle!(uint[])));
// Make sure ref is getting propagated properly.
int[] nums = [1,2,3];
auto c2 = cycle(nums);
c2[3]++;
assert(nums[0] == 2);
immutable int[] immarr = [1, 2, 3];
auto cycleimm = cycle(immarr);
foreach (DummyType; AllDummyRanges)
{
static if (isForwardRange!DummyType)
{
DummyType dummy;
auto cy = cycle(dummy);
static assert(isForwardRange!(typeof(cy)));
auto t = take(cy, 20);
assert(equal(t, [1,2,3,4,5,6,7,8,9,10,1,2,3,4,5,6,7,8,9,10]));
const cRange = cy;
assert(cRange.front == 1);
static if (hasAssignableElements!DummyType)
{
{
cy.front = 66;
scope(exit) cy.front = 1;
assert(dummy.front == 66);
}
static if (isRandomAccessRange!DummyType)
{
{
cy[10] = 66;
scope(exit) cy[10] = 1;
assert(dummy.front == 66);
}
assert(cRange[10] == 1);
}
}
static if (hasSlicing!DummyType)
{
auto slice = cy[5 .. 15];
assert(equal(slice, [6, 7, 8, 9, 10, 1, 2, 3, 4, 5]));
static assert(is(typeof(slice) == typeof(takeExactly(cy, 5))));
auto infSlice = cy[7 .. $];
assert(equal(take(infSlice, 5), [8, 9, 10, 1, 2]));
static assert(isInfinite!(typeof(infSlice)));
}
}
}
}
@system unittest // For static arrays.
{
import std.algorithm : equal;
int[3] a = [ 1, 2, 3 ];
static assert(isStaticArray!(typeof(a)));
auto c = cycle(a);
assert(a.ptr == c._ptr);
assert(equal(take(cycle(a), 5), [ 1, 2, 3, 1, 2 ][]));
static assert(isForwardRange!(typeof(c)));
// Test qualifiers on slicing.
alias C = typeof(c);
static assert(is(typeof(c[1 .. $]) == C));
const cConst = c;
static assert(is(typeof(cConst[1 .. $]) == const(C)));
}
@safe unittest // For infinite ranges
{
struct InfRange
{
void popFront() { }
@property int front() { return 0; }
enum empty = false;
}
InfRange i;
auto c = cycle(i);
assert (c == i);
}
@safe unittest
{
import std.algorithm : equal;
int[5] arr = [0, 1, 2, 3, 4];
auto cleD = cycle(arr[]); //Dynamic
assert(equal(cleD[5 .. 10], arr[]));
//n is a multiple of 5 worth about 3/4 of size_t.max
auto n = size_t.max/4 + size_t.max/2;
n -= n % 5;
//Test index overflow
foreach (_ ; 0 .. 10)
{
cleD = cleD[n .. $];
assert(equal(cleD[5 .. 10], arr[]));
}
}
@system unittest
{
import std.algorithm : equal;
int[5] arr = [0, 1, 2, 3, 4];
auto cleS = cycle(arr); //Static
assert(equal(cleS[5 .. 10], arr[]));
//n is a multiple of 5 worth about 3/4 of size_t.max
auto n = size_t.max/4 + size_t.max/2;
n -= n % 5;
//Test index overflow
foreach (_ ; 0 .. 10)
{
cleS = cleS[n .. $];
assert(equal(cleS[5 .. 10], arr[]));
}
}
@system unittest
{
import std.algorithm : equal;
int[1] arr = [0];
auto cleS = cycle(arr);
cleS = cleS[10 .. $];
assert(equal(cleS[5 .. 10], 0.repeat(5)));
assert(cleS.front == 0);
}
unittest //10845
{
import std.algorithm : equal, filter;
auto a = inputRangeObject(iota(3).filter!"true");
assert(equal(cycle(a).take(10), [0, 1, 2, 0, 1, 2, 0, 1, 2, 0]));
}
@safe unittest // 12177
{
auto a = recurrence!q{a[n - 1] ~ a[n - 2]}("1", "0");
}
// Issue 13390
unittest
{
import std.exception;
import core.exception : AssertError;
assertThrown!AssertError(cycle([0, 1, 2][0..0]));
}
private alias lengthType(R) = typeof(R.init.length.init);
/**
Iterate several ranges in lockstep. The element type is a proxy tuple
that allows accessing the current element in the $(D n)th range by
using $(D e[n]).
`zip` is similar to $(LREF lockstep), but `lockstep` doesn't
bundle its elements and uses the `opApply` protocol.
`lockstep` allows reference access to the elements in
`foreach` iterations.
$(D Zip) offers the lowest range facilities of all components, e.g. it
offers random access iff all ranges offer random access, and also
offers mutation and swapping if all ranges offer it. Due to this, $(D
Zip) is extremely powerful because it allows manipulating several
ranges in lockstep.
*/
struct Zip(Ranges...)
if (Ranges.length && allSatisfy!(isInputRange, Ranges))
{
import std.format : format; //for generic mixins
import std.typecons : Tuple;
alias R = Ranges;
R ranges;
alias ElementType = Tuple!(staticMap!(.ElementType, R));
StoppingPolicy stoppingPolicy = StoppingPolicy.shortest;
/**
Builds an object. Usually this is invoked indirectly by using the
$(LREF zip) function.
*/
this(R rs, StoppingPolicy s = StoppingPolicy.shortest)
{
ranges[] = rs[];
stoppingPolicy = s;
}
/**
Returns $(D true) if the range is at end. The test depends on the
stopping policy.
*/
static if (allSatisfy!(isInfinite, R))
{
// BUG: Doesn't propagate infiniteness if only some ranges are infinite
// and s == StoppingPolicy.longest. This isn't fixable in the
// current design since StoppingPolicy is known only at runtime.
enum bool empty = false;
}
else
{
@property bool empty()
{
import std.exception : enforce;
final switch (stoppingPolicy)
{
case StoppingPolicy.shortest:
foreach (i, Unused; R)
{
if (ranges[i].empty) return true;
}
return false;
case StoppingPolicy.longest:
static if (anySatisfy!(isInfinite, R))
{
return false;
}
else
{
foreach (i, Unused; R)
{
if (!ranges[i].empty) return false;
}
return true;
}
case StoppingPolicy.requireSameLength:
foreach (i, Unused; R[1 .. $])
{
enforce(ranges[0].empty ==
ranges[i + 1].empty,
"Inequal-length ranges passed to Zip");
}
return ranges[0].empty;
}
assert(false);
}
}
static if (allSatisfy!(isForwardRange, R))
{
@property Zip save()
{
//Zip(ranges[0].save, ranges[1].save, ..., stoppingPolicy)
return mixin (q{Zip(%(ranges[%s]%|, %), stoppingPolicy)}.format(iota(0, R.length)));
}
}
private .ElementType!(R[i]) tryGetInit(size_t i)()
{
alias E = .ElementType!(R[i]);
static if (!is(typeof({static E i;})))
throw new Exception("Range with non-default constructable elements exhausted.");
else
return E.init;
}
/**
Returns the current iterated element.
*/
@property ElementType front()
{
@property tryGetFront(size_t i)(){return ranges[i].empty ? tryGetInit!i() : ranges[i].front;}
//ElementType(tryGetFront!0, tryGetFront!1, ...)
return mixin(q{ElementType(%(tryGetFront!%s, %))}.format(iota(0, R.length)));
}
/**
Sets the front of all iterated ranges.
*/
static if (allSatisfy!(hasAssignableElements, R))
{
@property void front(ElementType v)
{
foreach (i, Unused; R)
{
if (!ranges[i].empty)
{
ranges[i].front = v[i];
}
}
}
}
/**
Moves out the front.
*/
static if (allSatisfy!(hasMobileElements, R))
{
ElementType moveFront()
{
@property tryMoveFront(size_t i)(){return ranges[i].empty ? tryGetInit!i() : ranges[i].moveFront();}
//ElementType(tryMoveFront!0, tryMoveFront!1, ...)
return mixin(q{ElementType(%(tryMoveFront!%s, %))}.format(iota(0, R.length)));
}
}
/**
Returns the rightmost element.
*/
static if (allSatisfy!(isBidirectionalRange, R))
{
@property ElementType back()
{
//TODO: Fixme! BackElement != back of all ranges in case of jagged-ness
@property tryGetBack(size_t i)(){return ranges[i].empty ? tryGetInit!i() : ranges[i].back;}
//ElementType(tryGetBack!0, tryGetBack!1, ...)
return mixin(q{ElementType(%(tryGetBack!%s, %))}.format(iota(0, R.length)));
}
/**
Moves out the back.
*/
static if (allSatisfy!(hasMobileElements, R))
{
ElementType moveBack()
{
//TODO: Fixme! BackElement != back of all ranges in case of jagged-ness
@property tryMoveBack(size_t i)(){return ranges[i].empty ? tryGetInit!i() : ranges[i].moveFront();}
//ElementType(tryMoveBack!0, tryMoveBack!1, ...)
return mixin(q{ElementType(%(tryMoveBack!%s, %))}.format(iota(0, R.length)));
}
}
/**
Returns the current iterated element.
*/
static if (allSatisfy!(hasAssignableElements, R))
{
@property void back(ElementType v)
{
//TODO: Fixme! BackElement != back of all ranges in case of jagged-ness.
//Not sure the call is even legal for StoppingPolicy.longest
foreach (i, Unused; R)
{
if (!ranges[i].empty)
{
ranges[i].back = v[i];
}
}
}
}
}
/**
Advances to the next element in all controlled ranges.
*/
void popFront()
{
import std.exception : enforce;
final switch (stoppingPolicy)
{
case StoppingPolicy.shortest:
foreach (i, Unused; R)
{
assert(!ranges[i].empty);
ranges[i].popFront();
}
break;
case StoppingPolicy.longest:
foreach (i, Unused; R)
{
if (!ranges[i].empty) ranges[i].popFront();
}
break;
case StoppingPolicy.requireSameLength:
foreach (i, Unused; R)
{
enforce(!ranges[i].empty, "Invalid Zip object");
ranges[i].popFront();
}
break;
}
}
/**
Calls $(D popBack) for all controlled ranges.
*/
static if (allSatisfy!(isBidirectionalRange, R))
{
void popBack()
{
//TODO: Fixme! In case of jaggedness, this is wrong.
import std.exception : enforce;
final switch (stoppingPolicy)
{
case StoppingPolicy.shortest:
foreach (i, Unused; R)
{
assert(!ranges[i].empty);
ranges[i].popBack();
}
break;
case StoppingPolicy.longest:
foreach (i, Unused; R)
{
if (!ranges[i].empty) ranges[i].popBack();
}
break;
case StoppingPolicy.requireSameLength:
foreach (i, Unused; R)
{
enforce(!ranges[i].empty, "Invalid Zip object");
ranges[i].popBack();
}
break;
}
}
}
/**
Returns the length of this range. Defined only if all ranges define
$(D length).
*/
static if (allSatisfy!(hasLength, R))
{
@property auto length()
{
static if (Ranges.length == 1)
return ranges[0].length;
else
{
if (stoppingPolicy == StoppingPolicy.requireSameLength)
return ranges[0].length;
//[min|max](ranges[0].length, ranges[1].length, ...)
import std.algorithm : min, max;
if (stoppingPolicy == StoppingPolicy.shortest)
return mixin(q{min(%(ranges[%s].length%|, %))}.format(iota(0, R.length)));
else
return mixin(q{max(%(ranges[%s].length%|, %))}.format(iota(0, R.length)));
}
}
alias opDollar = length;
}
/**
Returns a slice of the range. Defined only if all range define
slicing.
*/
static if (allSatisfy!(hasSlicing, R))
{
auto opSlice(size_t from, size_t to)
{
//Slicing an infinite range yields the type Take!R
//For finite ranges, the type Take!R aliases to R
alias ZipResult = Zip!(staticMap!(Take, R));
//ZipResult(ranges[0][from .. to], ranges[1][from .. to], ..., stoppingPolicy)
return mixin (q{ZipResult(%(ranges[%s][from .. to]%|, %), stoppingPolicy)}.format(iota(0, R.length)));
}
}
/**
Returns the $(D n)th element in the composite range. Defined if all
ranges offer random access.
*/
static if (allSatisfy!(isRandomAccessRange, R))
{
ElementType opIndex(size_t n)
{
//TODO: Fixme! This may create an out of bounds access
//for StoppingPolicy.longest
//ElementType(ranges[0][n], ranges[1][n], ...)
return mixin (q{ElementType(%(ranges[%s][n]%|, %))}.format(iota(0, R.length)));
}
/**
Assigns to the $(D n)th element in the composite range. Defined if
all ranges offer random access.
*/
static if (allSatisfy!(hasAssignableElements, R))
{
void opIndexAssign(ElementType v, size_t n)
{
//TODO: Fixme! Not sure the call is even legal for StoppingPolicy.longest
foreach (i, Range; R)
{
ranges[i][n] = v[i];
}
}
}
/**
Destructively reads the $(D n)th element in the composite
range. Defined if all ranges offer random access.
*/
static if (allSatisfy!(hasMobileElements, R))
{
ElementType moveAt(size_t n)
{
//TODO: Fixme! This may create an out of bounds access
//for StoppingPolicy.longest
//ElementType(ranges[0].moveAt(n), ranges[1].moveAt(n), ..., )
return mixin (q{ElementType(%(ranges[%s].moveAt(n)%|, %))}.format(iota(0, R.length)));
}
}
}
}
/// Ditto
auto zip(Ranges...)(Ranges ranges)
if (Ranges.length && allSatisfy!(isInputRange, Ranges))
{
return Zip!Ranges(ranges);
}
///
pure unittest
{
import std.algorithm : equal, map;
// pairwise sum
auto arr = [0, 1, 2];
assert(zip(arr, arr.dropOne).map!"a[0] + a[1]".equal([1, 3]));
}
///
pure unittest
{
import std.conv: to;
int[] a = [ 1, 2, 3 ];
string[] b = [ "a", "b", "c" ];
string[] result;
foreach (tup; zip(a, b))
{
result ~= tup[0].to!string ~ tup[1];
}
assert(result == [ "1a", "2b", "3c" ]);
size_t idx = 0;
// unpacking tuple elements with foreach
foreach (e1, e2; zip(a, b))
{
assert(e1 == a[idx]);
assert(e2 == b[idx]);
++idx;
}
}
/// $(D zip) is powerful - the following code sorts two arrays in parallel:
pure unittest
{
import std.algorithm : sort;
int[] a = [ 1, 2, 3 ];
string[] b = [ "a", "c", "b" ];
zip(a, b).sort!((t1, t2) => t1[0] > t2[0]);
assert(a == [ 3, 2, 1 ]);
// b is sorted according to a's sorting
assert(b == [ "b", "c", "a" ]);
}
/// Ditto
auto zip(Ranges...)(StoppingPolicy sp, Ranges ranges)
if (Ranges.length && allSatisfy!(isInputRange, Ranges))
{
return Zip!Ranges(ranges, sp);
}
/**
Dictates how iteration in a $(D Zip) should stop. By default stop at
the end of the shortest of all ranges.
*/
enum StoppingPolicy
{
/// Stop when the shortest range is exhausted
shortest,
/// Stop when the longest range is exhausted
longest,
/// Require that all ranges are equal
requireSameLength,
}
unittest
{
import std.internal.test.dummyrange;
import std.algorithm : swap, sort, filter, equal, map;
import std.exception : assertThrown, assertNotThrown;
import std.typecons : tuple;
int[] a = [ 1, 2, 3 ];
float[] b = [ 1.0, 2.0, 3.0 ];
foreach (e; zip(a, b))
{
assert(e[0] == e[1]);
}
swap(a[0], a[1]);
auto z = zip(a, b);
//swap(z.front(), z.back());
sort!("a[0] < b[0]")(zip(a, b));
assert(a == [1, 2, 3]);
assert(b == [2.0, 1.0, 3.0]);
z = zip(StoppingPolicy.requireSameLength, a, b);
assertNotThrown(z.popBack());
assertNotThrown(z.popBack());
assertNotThrown(z.popBack());
assert(z.empty);
assertThrown(z.popBack());
a = [ 1, 2, 3 ];
b = [ 1.0, 2.0, 3.0 ];
sort!("a[0] > b[0]")(zip(StoppingPolicy.requireSameLength, a, b));
assert(a == [3, 2, 1]);
assert(b == [3.0, 2.0, 1.0]);
a = [];
b = [];
assert(zip(StoppingPolicy.requireSameLength, a, b).empty);
// Test infiniteness propagation.
static assert(isInfinite!(typeof(zip(repeat(1), repeat(1)))));
// Test stopping policies with both value and reference.
auto a1 = [1, 2];
auto a2 = [1, 2, 3];
auto stuff = tuple(tuple(a1, a2),
tuple(filter!"a"(a1), filter!"a"(a2)));
alias FOO = Zip!(immutable(int)[], immutable(float)[]);
foreach (t; stuff.expand) {
auto arr1 = t[0];
auto arr2 = t[1];
auto zShortest = zip(arr1, arr2);
assert(equal(map!"a[0]"(zShortest), [1, 2]));
assert(equal(map!"a[1]"(zShortest), [1, 2]));
try {
auto zSame = zip(StoppingPolicy.requireSameLength, arr1, arr2);
foreach (elem; zSame) {}
assert(0);
} catch (Throwable) { /* It's supposed to throw.*/ }
auto zLongest = zip(StoppingPolicy.longest, arr1, arr2);
assert(!zLongest.ranges[0].empty);
assert(!zLongest.ranges[1].empty);
zLongest.popFront();
zLongest.popFront();
assert(!zLongest.empty);
assert(zLongest.ranges[0].empty);
assert(!zLongest.ranges[1].empty);
zLongest.popFront();
assert(zLongest.empty);
}
// BUG 8900
assert(zip([1, 2], repeat('a')).array == [tuple(1, 'a'), tuple(2, 'a')]);
assert(zip(repeat('a'), [1, 2]).array == [tuple('a', 1), tuple('a', 2)]);
// Doesn't work yet. Issues w/ emplace.
// static assert(is(Zip!(immutable int[], immutable float[])));
// These unittests pass, but make the compiler consume an absurd amount
// of RAM and time. Therefore, they should only be run if explicitly
// uncommented when making changes to Zip. Also, running them using
// make -fwin32.mak unittest makes the compiler completely run out of RAM.
// You need to test just this module.
/+
foreach (DummyType1; AllDummyRanges) {
DummyType1 d1;
foreach (DummyType2; AllDummyRanges) {
DummyType2 d2;
auto r = zip(d1, d2);
assert(equal(map!"a[0]"(r), [1,2,3,4,5,6,7,8,9,10]));
assert(equal(map!"a[1]"(r), [1,2,3,4,5,6,7,8,9,10]));
static if (isForwardRange!DummyType1 && isForwardRange!DummyType2) {
static assert(isForwardRange!(typeof(r)));
}
static if (isBidirectionalRange!DummyType1 &&
isBidirectionalRange!DummyType2) {
static assert(isBidirectionalRange!(typeof(r)));
}
static if (isRandomAccessRange!DummyType1 &&
isRandomAccessRange!DummyType2) {
static assert(isRandomAccessRange!(typeof(r)));
}
}
}
+/
}
pure unittest
{
import std.algorithm : sort;
auto a = [5,4,3,2,1];
auto b = [3,1,2,5,6];
auto z = zip(a, b);
sort!"a[0] < b[0]"(z);
assert(a == [1, 2, 3, 4, 5]);
assert(b == [6, 5, 2, 1, 3]);
}
@safe pure unittest
{
import std.typecons : tuple;
import std.algorithm : equal;
auto LL = iota(1L, 1000L);
auto z = zip(LL, [4]);
assert(equal(z, [tuple(1L,4)]));
auto LL2 = iota(0L, 500L);
auto z2 = zip([7], LL2);
assert(equal(z2, [tuple(7, 0L)]));
}
// Text for Issue 11196
@safe pure unittest
{
import std.exception : assertThrown;
static struct S { @disable this(); }
assert(zip((S[5]).init[]).length == 5);
assert(zip(StoppingPolicy.longest, cast(S[]) null, new int[1]).length == 1);
assertThrown(zip(StoppingPolicy.longest, cast(S[]) null, new int[1]).front);
}
@safe pure unittest //12007
{
static struct R
{
enum empty = false;
void popFront(){}
int front(){return 1;} @property
R save(){return this;} @property
void opAssign(R) @disable;
}
R r;
auto z = zip(r, r);
auto zz = z.save;
}
/*
Generate lockstep's opApply function as a mixin string.
If withIndex is true prepend a size_t index to the delegate.
*/
private string lockstepMixin(Ranges...)(bool withIndex, bool reverse)
{
import std.format : format;
string[] params;
string[] emptyChecks;
string[] dgArgs;
string[] popFronts;
string indexDef;
string indexInc;
if (withIndex)
{
params ~= "size_t";
dgArgs ~= "index";
if (reverse)
{
indexDef = q{
size_t index = ranges[0].length-1;
enforce(_stoppingPolicy == StoppingPolicy.requireSameLength, "lockstep can only be used with foreach_reverse when stoppingPolicy == requireSameLength");
foreach (range; ranges[1..$])
enforce(range.length == ranges[0].length);
};
indexInc = "--index;";
}
else
{
indexDef = "size_t index = 0;";
indexInc = "++index;";
}
}
foreach (idx, Range; Ranges)
{
params ~= format("%sElementType!(Ranges[%s])", hasLvalueElements!Range ? "ref " : "", idx);
emptyChecks ~= format("!ranges[%s].empty", idx);
if (reverse)
{
dgArgs ~= format("ranges[%s].back", idx);
popFronts ~= format("ranges[%s].popBack();", idx);
}
else
{
dgArgs ~= format("ranges[%s].front", idx);
popFronts ~= format("ranges[%s].popFront();", idx);
}
}
string name = reverse ? "opApplyReverse" : "opApply";
return format(
q{
int %s(scope int delegate(%s) dg)
{
import std.exception : enforce;
auto ranges = _ranges;
int res;
%s
while (%s)
{
res = dg(%s);
if (res) break;
%s
%s
}
if (_stoppingPolicy == StoppingPolicy.requireSameLength)
{
foreach (range; ranges)
enforce(range.empty);
}
return res;
}
}, name, params.join(", "), indexDef,
emptyChecks.join(" && "), dgArgs.join(", "),
popFronts.join("\n "),
indexInc);
}
/**
Iterate multiple ranges in lockstep using a $(D foreach) loop. In contrast to
$(LREF zip) it allows reference access to its elements. If only a single
range is passed in, the $(D Lockstep) aliases itself away. If the
ranges are of different lengths and $(D s) == $(D StoppingPolicy.shortest)
stop after the shortest range is empty. If the ranges are of different
lengths and $(D s) == $(D StoppingPolicy.requireSameLength), throw an
exception. $(D s) may not be $(D StoppingPolicy.longest), and passing this
will throw an exception.
Iterating over $(D Lockstep) in reverse and with an index is only possible
when $(D s) == $(D StoppingPolicy.requireSameLength), in order to preserve
indexes. If an attempt is made at iterating in reverse when $(D s) ==
$(D StoppingPolicy.shortest), an exception will be thrown.
By default $(D StoppingPolicy) is set to $(D StoppingPolicy.shortest).
See_Also: $(LREF zip)
`lockstep` is similar to $(LREF zip), but `zip` bundles its
elements and returns a range.
`lockstep` also supports reference access.
Use `zip` if you want to pass the result to a range function.
*/
struct Lockstep(Ranges...)
if (Ranges.length > 1 && allSatisfy!(isInputRange, Ranges))
{
this(R ranges, StoppingPolicy sp = StoppingPolicy.shortest)
{
import std.exception : enforce;
_ranges = ranges;
enforce(sp != StoppingPolicy.longest,
"Can't use StoppingPolicy.Longest on Lockstep.");
_stoppingPolicy = sp;
}
mixin(lockstepMixin!Ranges(false, false));
mixin(lockstepMixin!Ranges(true, false));
static if (allSatisfy!(isBidirectionalRange, Ranges))
{
mixin(lockstepMixin!Ranges(false, true));
static if (allSatisfy!(hasLength, Ranges))
{
mixin(lockstepMixin!Ranges(true, true));
}
else
{
mixin(lockstepReverseFailMixin!Ranges(true));
}
}
else
{
mixin(lockstepReverseFailMixin!Ranges(false));
mixin(lockstepReverseFailMixin!Ranges(true));
}
private:
alias R = Ranges;
R _ranges;
StoppingPolicy _stoppingPolicy;
}
string lockstepReverseFailMixin(Ranges...)(bool withIndex)
{
import std.format : format;
string[] params;
string message;
if (withIndex)
{
message = "Indexed reverse iteration with lockstep is only supported"
~"if all ranges are bidirectional and have a length.\n";
}
else
{
message = "Reverse iteration with lockstep is only supported if all ranges are bidirectional.\n";
}
if (withIndex)
{
params ~= "size_t";
}
foreach (idx, Range; Ranges)
{
params ~= format("%sElementType!(Ranges[%s])", hasLvalueElements!Range ? "ref " : "", idx);
}
return format(
q{
int opApplyReverse()(scope int delegate(%s) dg)
{
static assert(false, "%s");
}
}, params.join(", "), message);
}
// For generic programming, make sure Lockstep!(Range) is well defined for a
// single range.
template Lockstep(Range)
{
alias Lockstep = Range;
}
/// Ditto
Lockstep!(Ranges) lockstep(Ranges...)(Ranges ranges)
if (allSatisfy!(isInputRange, Ranges))
{
return Lockstep!(Ranges)(ranges);
}
/// Ditto
Lockstep!(Ranges) lockstep(Ranges...)(Ranges ranges, StoppingPolicy s)
if (allSatisfy!(isInputRange, Ranges))
{
static if (Ranges.length > 1)
return Lockstep!Ranges(ranges, s);
else
return ranges[0];
}
///
unittest
{
auto arr1 = [1,2,3,4,5,100];
auto arr2 = [6,7,8,9,10];
foreach (ref a, b; lockstep(arr1, arr2))
{
a += b;
}
assert(arr1 == [7,9,11,13,15,100]);
/// Lockstep also supports iterating with an index variable:
foreach (index, a, b; lockstep(arr1, arr2))
{
assert(arr1[index] == a);
assert(arr2[index] == b);
}
}
unittest // Bugzilla 15860: foreach_reverse on lockstep
{
auto arr1 = [0, 1, 2, 3];
auto arr2 = [4, 5, 6, 7];
size_t n = arr1.length -1;
foreach_reverse (index, a, b; lockstep(arr1, arr2, StoppingPolicy.requireSameLength))
{
assert(n == index);
assert(index == a);
assert(arr1[index] == a);
assert(arr2[index] == b);
n--;
}
auto arr3 = [4, 5];
n = 1;
foreach_reverse (a, b; lockstep(arr1, arr3))
{
assert(a == arr1[$-n] && b == arr3[$-n]);
n++;
}
}
unittest
{
import std.conv : to;
import std.algorithm : filter;
// The filters are to make these the lowest common forward denominator ranges,
// i.e. w/o ref return, random access, length, etc.
auto foo = filter!"a"([1,2,3,4,5]);
immutable bar = [6f,7f,8f,9f,10f].idup;
auto l = lockstep(foo, bar);
// Should work twice. These are forward ranges with implicit save.
foreach (i; 0..2)
{
uint[] res1;
float[] res2;
foreach (a, ref b; l) {
res1 ~= a;
res2 ~= b;
}
assert(res1 == [1,2,3,4,5]);
assert(res2 == [6,7,8,9,10]);
assert(bar == [6f,7f,8f,9f,10f]);
}
// Doc example.
auto arr1 = [1,2,3,4,5];
auto arr2 = [6,7,8,9,10];
foreach (ref a, ref b; lockstep(arr1, arr2))
{
a += b;
}
assert(arr1 == [7,9,11,13,15]);
// Make sure StoppingPolicy.requireSameLength doesn't throw.
auto ls = lockstep(arr1, arr2, StoppingPolicy.requireSameLength);
foreach (a, b; ls) {}
// Make sure StoppingPolicy.requireSameLength throws.
arr2.popBack();
ls = lockstep(arr1, arr2, StoppingPolicy.requireSameLength);
try {
foreach (a, b; ls) {}
assert(0);
} catch (Exception) {}
// Just make sure 1-range case instantiates. This hangs the compiler
// when no explicit stopping policy is specified due to Bug 4652.
auto stuff = lockstep([1,2,3,4,5], StoppingPolicy.shortest);
// Test with indexing.
uint[] res1;
float[] res2;
size_t[] indices;
foreach (i, a, b; lockstep(foo, bar))
{
indices ~= i;
res1 ~= a;
res2 ~= b;
}
assert(indices == to!(size_t[])([0, 1, 2, 3, 4]));
assert(res1 == [1,2,3,4,5]);
assert(res2 == [6f,7f,8f,9f,10f]);
// Make sure we've worked around the relevant compiler bugs and this at least
// compiles w/ >2 ranges.
lockstep(foo, foo, foo);
// Make sure it works with const.
const(int[])[] foo2 = [[1, 2, 3]];
const(int[])[] bar2 = [[4, 5, 6]];
auto c = chain(foo2, bar2);
foreach (f, b; lockstep(c, c)) {}
// Regression 10468
foreach (x, y; lockstep(iota(0, 10), iota(0, 10))) { }
}
unittest
{
struct RvalueRange
{
int[] impl;
@property bool empty() { return impl.empty; }
@property int front() { return impl[0]; } // N.B. non-ref
void popFront() { impl.popFront(); }
}
auto data1 = [ 1, 2, 3, 4 ];
auto data2 = [ 5, 6, 7, 8 ];
auto r1 = RvalueRange(data1);
auto r2 = data2;
foreach (a, ref b; lockstep(r1, r2))
{
a++;
b++;
}
assert(data1 == [ 1, 2, 3, 4 ]); // changes to a do not propagate to data
assert(data2 == [ 6, 7, 8, 9 ]); // but changes to b do.
// Since r1 is by-value only, the compiler should reject attempts to
// foreach over it with ref.
static assert(!__traits(compiles, {
foreach (ref a, ref b; lockstep(r1, r2)) { a++; }
}));
}
/**
Creates a mathematical sequence given the initial values and a
recurrence function that computes the next value from the existing
values. The sequence comes in the form of an infinite forward
range. The type $(D Recurrence) itself is seldom used directly; most
often, recurrences are obtained by calling the function $(D
recurrence).
When calling $(D recurrence), the function that computes the next
value is specified as a template argument, and the initial values in
the recurrence are passed as regular arguments. For example, in a
Fibonacci sequence, there are two initial values (and therefore a
state size of 2) because computing the next Fibonacci value needs the
past two values.
The signature of this function should be:
----
auto fun(R)(R state, size_t n)
----
where $(D n) will be the index of the current value, and $(D state) will be an
opaque state vector that can be indexed with array-indexing notation
$(D state[i]), where valid values of $(D i) range from $(D (n - 1)) to
$(D (n - State.length)).
If the function is passed in string form, the state has name $(D "a")
and the zero-based index in the recurrence has name $(D "n"). The
given string must return the desired value for $(D a[n]) given $(D a[n
- 1]), $(D a[n - 2]), $(D a[n - 3]),..., $(D a[n - stateSize]). The
state size is dictated by the number of arguments passed to the call
to $(D recurrence). The $(D Recurrence) struct itself takes care of
managing the recurrence's state and shifting it appropriately.
*/
struct Recurrence(alias fun, StateType, size_t stateSize)
{
private import std.functional : binaryFun;
StateType[stateSize] _state;
size_t _n;
this(StateType[stateSize] initial) { _state = initial; }
void popFront()
{
static auto trustedCycle(ref typeof(_state) s) @trusted
{
return cycle(s);
}
// The cast here is reasonable because fun may cause integer
// promotion, but needs to return a StateType to make its operation
// closed. Therefore, we have no other choice.
_state[_n % stateSize] = cast(StateType) binaryFun!(fun, "a", "n")(
trustedCycle(_state), _n + stateSize);
++_n;
}
@property StateType front()
{
return _state[_n % stateSize];
}
@property typeof(this) save()
{
return this;
}
enum bool empty = false;
}
///
@safe unittest
{
import std.algorithm : equal;
// The Fibonacci numbers, using function in string form:
// a[0] = 1, a[1] = 1, and compute a[n+1] = a[n-1] + a[n]
auto fib = recurrence!("a[n-1] + a[n-2]")(1, 1);
assert(fib.take(10).equal([1, 1, 2, 3, 5, 8, 13, 21, 34, 55]));
// The factorials, using function in lambda form:
auto fac = recurrence!((a,n) => a[n-1] * n)(1);
assert(take(fac, 10).equal([
1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362880
]));
// The triangular numbers, using function in explicit form:
static size_t genTriangular(R)(R state, size_t n)
{
return state[n-1] + n;
}
auto tri = recurrence!genTriangular(0);
assert(take(tri, 10).equal([0, 1, 3, 6, 10, 15, 21, 28, 36, 45]));
}
/// Ditto
Recurrence!(fun, CommonType!(State), State.length)
recurrence(alias fun, State...)(State initial)
{
CommonType!(State)[State.length] state;
foreach (i, Unused; State)
{
state[i] = initial[i];
}
return typeof(return)(state);
}
@safe unittest
{
import std.algorithm : equal;
auto fib = recurrence!("a[n-1] + a[n-2]")(1, 1);
static assert(isForwardRange!(typeof(fib)));
int[] witness = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55 ];
assert(equal(take(fib, 10), witness));
foreach (e; take(fib, 10)) {}
auto fact = recurrence!("n * a[n-1]")(1);
assert( equal(take(fact, 10), [1, 1, 2, 2*3, 2*3*4, 2*3*4*5, 2*3*4*5*6,
2*3*4*5*6*7, 2*3*4*5*6*7*8, 2*3*4*5*6*7*8*9][]) );
auto piapprox = recurrence!("a[n] + (n & 1 ? 4.0 : -4.0) / (2 * n + 3)")(4.0);
foreach (e; take(piapprox, 20)) {}
// Thanks to yebblies for this test and the associated fix
auto r = recurrence!"a[n-2]"(1, 2);
witness = [1, 2, 1, 2, 1];
assert(equal(take(r, 5), witness));
}
/**
$(D Sequence) is similar to $(D Recurrence) except that iteration is
presented in the so-called $(WEB en.wikipedia.org/wiki/Closed_form,
closed form). This means that the $(D n)th element in the series is
computable directly from the initial values and $(D n) itself. This
implies that the interface offered by $(D Sequence) is a random-access
range, as opposed to the regular $(D Recurrence), which only offers
forward iteration.
The state of the sequence is stored as a $(D Tuple) so it can be
heterogeneous.
*/
struct Sequence(alias fun, State)
{
private:
import std.functional : binaryFun;
alias compute = binaryFun!(fun, "a", "n");
alias ElementType = typeof(compute(State.init, cast(size_t) 1));
State _state;
size_t _n;
static struct DollarToken{}
public:
this(State initial, size_t n = 0)
{
_state = initial;
_n = n;
}
@property ElementType front()
{
return compute(_state, _n);
}
void popFront()
{
++_n;
}
enum opDollar = DollarToken();
auto opSlice(size_t lower, size_t upper)
in
{
assert(upper >= lower);
}
body
{
return typeof(this)(_state, _n + lower).take(upper - lower);
}
auto opSlice(size_t lower, DollarToken)
{
return typeof(this)(_state, _n + lower);
}
ElementType opIndex(size_t n)
{
return compute(_state, n + _n);
}
enum bool empty = false;
@property Sequence save() { return this; }
}
/// Ditto
auto sequence(alias fun, State...)(State args)
{
import std.typecons : Tuple, tuple;
alias Return = Sequence!(fun, Tuple!State);
return Return(tuple(args));
}
/// Odd numbers, using function in string form:
@safe unittest
{
auto odds = sequence!("a[0] + n * a[1]")(1, 2);
assert(odds.front == 1);
odds.popFront();
assert(odds.front == 3);
odds.popFront();
assert(odds.front == 5);
}
/// Triangular numbers, using function in lambda form:
@safe unittest
{
auto tri = sequence!((a,n) => n*(n+1)/2)();
// Note random access
assert(tri[0] == 0);
assert(tri[3] == 6);
assert(tri[1] == 1);
assert(tri[4] == 10);
assert(tri[2] == 3);
}
/// Fibonacci numbers, using function in explicit form:
@safe unittest
{
import std.math : pow, round, sqrt;
static ulong computeFib(S)(S state, size_t n)
{
// Binet's formula
return cast(ulong)(round((pow(state[0], n+1) - pow(state[1], n+1)) /
state[2]));
}
auto fib = sequence!computeFib(
(1.0 + sqrt(5.0)) / 2.0, // Golden Ratio
(1.0 - sqrt(5.0)) / 2.0, // Conjugate of Golden Ratio
sqrt(5.0));
// Note random access with [] operator
assert(fib[1] == 1);
assert(fib[4] == 5);
assert(fib[3] == 3);
assert(fib[2] == 2);
assert(fib[9] == 55);
}
@safe unittest
{
import std.typecons : Tuple, tuple;
auto y = Sequence!("a[0] + n * a[1]", Tuple!(int, int))(tuple(0, 4));
static assert(isForwardRange!(typeof(y)));
//@@BUG
//auto y = sequence!("a[0] + n * a[1]")(0, 4);
//foreach (e; take(y, 15))
{} //writeln(e);
auto odds = Sequence!("a[0] + n * a[1]", Tuple!(int, int))(
tuple(1, 2));
for (int currentOdd = 1; currentOdd <= 21; currentOdd += 2) {
assert(odds.front == odds[0]);
assert(odds[0] == currentOdd);
odds.popFront();
}
}
@safe unittest
{
import std.algorithm : equal;
auto odds = sequence!("a[0] + n * a[1]")(1, 2);
static assert(hasSlicing!(typeof(odds)));
//Note: don't use drop or take as the target of an equal,
//since they'll both just forward to opSlice, making the tests irrelevant
// static slicing tests
assert(equal(odds[0 .. 5], [1, 3, 5, 7, 9]));
assert(equal(odds[3 .. 7], [7, 9, 11, 13]));
// relative slicing test, testing slicing is NOT agnostic of state
auto odds_less5 = odds.drop(5); //this should actually call odds[5 .. $]
assert(equal(odds_less5[0 .. 3], [11, 13, 15]));
assert(equal(odds_less5[0 .. 10], odds[5 .. 15]));
//Infinite slicing tests
odds = odds[10 .. $];
assert(equal(odds.take(3), [21, 23, 25]));
}
// Issue 5036
unittest
{
auto s = sequence!((a, n) => new int)(0);
assert(s.front != s.front); // no caching
}
/**
Construct a range of values that span the given starting and stopping
values.
Params:
begin = The starting value.
end = The value that serves as the stopping criterion. This value is not
included in the range.
step = The value to add to the current value at each iteration.
Returns:
A range that goes through the numbers $(D begin), $(D begin + step),
$(D begin + 2 * step), $(D ...), up to and excluding $(D end).
The two-argument overloads have $(D step = 1). If $(D begin < end && step <
0) or $(D begin > end && step > 0) or $(D begin == end), then an empty range
is returned. If $(D step == 0) then $(D begin == end) is an error.
For built-in types, the range returned is a random access range. For
user-defined types that support $(D ++), the range is an input
range.
Example:
---
void main()
{
import std.stdio;
// The following groups all produce the same output of:
// 0 1 2 3 4
foreach (i; 0..5)
writef("%s ", i);
writeln();
import std.range : iota;
foreach (i; iota(0, 5))
writef("%s ", i);
writeln();
writefln("%(%s %|%)", iota(0, 5));
import std.algorithm : map, copy;
import std.format;
iota(0, 5).map!(i => format("%s ", i)).copy(stdout.lockingTextWriter());
writeln();
}
---
*/
auto iota(B, E, S)(B begin, E end, S step)
if ((isIntegral!(CommonType!(B, E)) || isPointer!(CommonType!(B, E)))
&& isIntegral!S)
{
import std.conv : unsigned;
alias Value = CommonType!(Unqual!B, Unqual!E);
alias StepType = Unqual!S;
assert(step != 0 || begin == end);
static struct Result
{
private Value current, pastLast;
private StepType step;
this(Value current, Value pastLast, StepType step)
{
if ((current < pastLast && step >= 0) ||
(current > pastLast && step <= 0))
{
this.step = step;
this.current = current;
if (step > 0)
{
assert(unsigned((pastLast - current) / step) <= size_t.max);
this.pastLast = pastLast - 1;
this.pastLast -= (this.pastLast - current) % step;
}
else
{
if (step < 0)
assert(unsigned((current - pastLast) / -step) <= size_t.max);
this.pastLast = pastLast + 1;
this.pastLast += (current - this.pastLast) % -step;
}
this.pastLast += step;
}
else
{
// Initialize an empty range
this.current = this.pastLast = current;
this.step = 1;
}
}
@property bool empty() const { return current == pastLast; }
@property inout(Value) front() inout { assert(!empty); return current; }
void popFront() { assert(!empty); current += step; }
@property inout(Value) back() inout { assert(!empty); return pastLast - step; }
void popBack() { assert(!empty); pastLast -= step; }
@property auto save() { return this; }
inout(Value) opIndex(ulong n) inout
{
assert(n < this.length);
// Just cast to Value here because doing so gives overflow behavior
// consistent with calling popFront() n times.
return cast(inout Value) (current + step * n);
}
inout(Result) opSlice() inout { return this; }
inout(Result) opSlice(ulong lower, ulong upper) inout
{
assert(upper >= lower && upper <= this.length);
return cast(inout Result)Result(cast(Value)(current + lower * step),
cast(Value)(pastLast - (length - upper) * step),
step);
}
@property size_t length() const
{
if (step > 0)
{
return cast(size_t)((pastLast - current) / step);
}
else
{
return cast(size_t)((current - pastLast) / -step);
}
}
alias opDollar = length;
}
return Result(begin, end, step);
}
/// Ditto
auto iota(B, E)(B begin, E end)
if (isFloatingPoint!(CommonType!(B, E)))
{
return iota(begin, end, CommonType!(B, E)(1));
}
/// Ditto
auto iota(B, E)(B begin, E end)
if (isIntegral!(CommonType!(B, E)) || isPointer!(CommonType!(B, E)))
{
import std.conv : unsigned;
alias Value = CommonType!(Unqual!B, Unqual!E);
static struct Result
{
private Value current, pastLast;
this(Value current, Value pastLast)
{
if (current < pastLast)
{
assert(unsigned(pastLast - current) <= size_t.max);
this.current = current;
this.pastLast = pastLast;
}
else
{
// Initialize an empty range
this.current = this.pastLast = current;
}
}
@property bool empty() const { return current == pastLast; }
@property inout(Value) front() inout { assert(!empty); return current; }
void popFront() { assert(!empty); ++current; }
@property inout(Value) back() inout { assert(!empty); return cast(inout(Value))(pastLast - 1); }
void popBack() { assert(!empty); --pastLast; }
@property auto save() { return this; }
inout(Value) opIndex(size_t n) inout
{
assert(n < this.length);
// Just cast to Value here because doing so gives overflow behavior
// consistent with calling popFront() n times.
return cast(inout Value) (current + n);
}
inout(Result) opSlice() inout { return this; }
inout(Result) opSlice(ulong lower, ulong upper) inout
{
assert(upper >= lower && upper <= this.length);
return cast(inout Result)Result(cast(Value)(current + lower),
cast(Value)(pastLast - (length - upper)));
}
@property size_t length() const
{
return cast(size_t)(pastLast - current);
}
alias opDollar = length;
}
return Result(begin, end);
}
/// Ditto
auto iota(E)(E end)
{
E begin = 0;
return iota(begin, end);
}
/// Ditto
// Specialization for floating-point types
auto iota(B, E, S)(B begin, E end, S step)
if (isFloatingPoint!(CommonType!(B, E, S)))
in
{
assert(step != 0, "iota: step must not be 0");
assert((end - begin) / step >= 0, "iota: incorrect startup parameters");
}
body
{
alias Value = Unqual!(CommonType!(B, E, S));
static struct Result
{
private Value start, step;
private size_t index, count;
this(Value start, Value end, Value step)
{
import std.conv : to;
this.start = start;
this.step = step;
immutable fcount = (end - start) / step;
count = to!size_t(fcount);
auto pastEnd = start + count * step;
if (step > 0)
{
if (pastEnd < end) ++count;
assert(start + count * step >= end);
}
else
{
if (pastEnd > end) ++count;
assert(start + count * step <= end);
}
}
@property bool empty() const { return index == count; }
@property Value front() const { assert(!empty); return start + step * index; }
void popFront()
{
assert(!empty);
++index;
}
@property Value back() const
{
assert(!empty);
return start + step * (count - 1);
}
void popBack()
{
assert(!empty);
--count;
}
@property auto save() { return this; }
Value opIndex(size_t n) const
{
assert(n < count);
return start + step * (n + index);
}
inout(Result) opSlice() inout
{
return this;
}
inout(Result) opSlice(size_t lower, size_t upper) inout
{
assert(upper >= lower && upper <= count);
Result ret = this;
ret.index += lower;
ret.count = upper - lower + ret.index;
return cast(inout Result)ret;
}
@property size_t length() const
{
return count - index;
}
alias opDollar = length;
}
return Result(begin, end, step);
}
///
@safe unittest
{
import std.algorithm : equal;
import std.math : approxEqual;
auto r = iota(0, 10, 1);
assert(equal(r, [0, 1, 2, 3, 4, 5, 6, 7, 8, 9][]));
r = iota(0, 11, 3);
assert(equal(r, [0, 3, 6, 9][]));
assert(r[2] == 6);
auto rf = iota(0.0, 0.5, 0.1);
assert(approxEqual(rf, [0.0, 0.1, 0.2, 0.3, 0.4]));
}
nothrow @nogc unittest
{
auto t0 = iota(0, 10);
auto t1 = iota(0, 10, 2);
auto t2 = iota(1, 1, 0);
//float overloads use std.conv.to so can't be @nogc or nothrow
}
debug unittest
{//check the contracts
import std.exception : assertThrown;
import core.exception : AssertError;
assertThrown!AssertError(iota(1,2,0));
assertThrown!AssertError(iota(0f,1f,0f));
assertThrown!AssertError(iota(1f,0f,0.1f));
assertThrown!AssertError(iota(0f,1f,-0.1f));
}
unittest
{
int[] a = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9];
auto r1 = iota(a.ptr, a.ptr + a.length, 1);
assert(r1.front == a.ptr);
assert(r1.back == a.ptr + a.length - 1);
}
unittest
{
import std.parallelism;
assert(__traits(compiles, { foreach (i; iota(0, 100UL).parallel) {} }));
assert(iota(1UL, 0UL).length == 0);
assert(iota(1UL, 0UL, 1).length == 0);
assert(iota(0, 1, 1).length == 1);
assert(iota(1, 0, -1).length == 1);
assert(iota(0, 1, -1).length == 0);
assert(iota(ulong.max, 0).length == 0);
}
@safe unittest
{
import std.math : approxEqual, nextUp, nextDown;
import std.algorithm : count, equal;
static assert(is(ElementType!(typeof(iota(0f))) == float));
static assert(hasLength!(typeof(iota(0, 2))));
auto r = iota(0, 10, 1);
assert(r[$ - 1] == 9);
assert(equal(r, [0, 1, 2, 3, 4, 5, 6, 7, 8, 9][]));
auto rSlice = r[2..8];
assert(equal(rSlice, [2, 3, 4, 5, 6, 7]));
rSlice.popFront();
assert(rSlice[0] == rSlice.front);
assert(rSlice.front == 3);
rSlice.popBack();
assert(rSlice[rSlice.length - 1] == rSlice.back);
assert(rSlice.back == 6);
rSlice = r[0..4];
assert(equal(rSlice, [0, 1, 2, 3]));
auto rr = iota(10);
assert(equal(rr, [0, 1, 2, 3, 4, 5, 6, 7, 8, 9][]));
r = iota(0, -10, -1);
assert(equal(r, [0, -1, -2, -3, -4, -5, -6, -7, -8, -9][]));
rSlice = r[3..9];
assert(equal(rSlice, [-3, -4, -5, -6, -7, -8]));
r = iota(0, -6, -3);
assert(equal(r, [0, -3][]));
rSlice = r[1..2];
assert(equal(rSlice, [-3]));
r = iota(0, -7, -3);
assert(equal(r, [0, -3, -6][]));
rSlice = r[1..3];
assert(equal(rSlice, [-3, -6]));
r = iota(0, 11, 3);
assert(equal(r, [0, 3, 6, 9][]));
assert(r[2] == 6);
rSlice = r[1..3];
assert(equal(rSlice, [3, 6]));
auto rf = iota(0.0, 0.5, 0.1);
assert(approxEqual(rf, [0.0, 0.1, 0.2, 0.3, 0.4][]));
assert(rf.length == 5);
rf.popFront();
assert(rf.length == 4);
auto rfSlice = rf[1..4];
assert(rfSlice.length == 3);
assert(approxEqual(rfSlice, [0.2, 0.3, 0.4]));
rfSlice.popFront();
assert(approxEqual(rfSlice[0], 0.3));
rf.popFront();
assert(rf.length == 3);
rfSlice = rf[1..3];
assert(rfSlice.length == 2);
assert(approxEqual(rfSlice, [0.3, 0.4]));
assert(approxEqual(rfSlice[0], 0.3));
// With something just above 0.5
rf = iota(0.0, nextUp(0.5), 0.1);
assert(approxEqual(rf, [0.0, 0.1, 0.2, 0.3, 0.4, 0.5][]));
rf.popBack();
assert(rf[rf.length - 1] == rf.back);
assert(approxEqual(rf.back, 0.4));
assert(rf.length == 5);
// going down
rf = iota(0.0, -0.5, -0.1);
assert(approxEqual(rf, [0.0, -0.1, -0.2, -0.3, -0.4][]));
rfSlice = rf[2..5];
assert(approxEqual(rfSlice, [-0.2, -0.3, -0.4]));
rf = iota(0.0, nextDown(-0.5), -0.1);
assert(approxEqual(rf, [0.0, -0.1, -0.2, -0.3, -0.4, -0.5][]));
// iota of longs
auto rl = iota(5_000_000L);
assert(rl.length == 5_000_000L);
// iota of longs with steps
auto iota_of_longs_with_steps = iota(50L, 101L, 10);
assert(iota_of_longs_with_steps.length == 6);
assert(equal(iota_of_longs_with_steps, [50L, 60L, 70L, 80L, 90L, 100L]));
// iota of unsigned zero length (issue 6222, actually trying to consume it
// is the only way to find something is wrong because the public
// properties are all correct)
auto iota_zero_unsigned = iota(0, 0u, 3);
assert(count(iota_zero_unsigned) == 0);
// unsigned reverse iota can be buggy if .length doesn't take them into
// account (issue 7982).
assert(iota(10u, 0u, -1).length == 10);
assert(iota(10u, 0u, -2).length == 5);
assert(iota(uint.max, uint.max-10, -1).length == 10);
assert(iota(uint.max, uint.max-10, -2).length == 5);
assert(iota(uint.max, 0u, -1).length == uint.max);
// Issue 8920
foreach (Type; AliasSeq!(byte, ubyte, short, ushort,
int, uint, long, ulong))
{
Type val;
foreach (i; iota(cast(Type)0, cast(Type)10)) { val++; }
assert(val == 10);
}
}
@safe unittest
{
import std.algorithm : copy;
auto idx = new size_t[100];
copy(iota(0, idx.length), idx);
}
@safe unittest
{
foreach (range; AliasSeq!(iota(2, 27, 4),
iota(3, 9),
iota(2.7, 12.3, .1),
iota(3.2, 9.7)))
{
const cRange = range;
const e = cRange.empty;
const f = cRange.front;
const b = cRange.back;
const i = cRange[2];
const s1 = cRange[];
const s2 = cRange[0 .. 3];
const l = cRange.length;
}
}
unittest
{
//The ptr stuff can't be done at compile time, so we unfortunately end
//up with some code duplication here.
auto arr = [0, 5, 3, 5, 5, 7, 9, 2, 0, 42, 7, 6];
{
const cRange = iota(arr.ptr, arr.ptr + arr.length, 3);
const e = cRange.empty;
const f = cRange.front;
const b = cRange.back;
const i = cRange[2];
const s1 = cRange[];
const s2 = cRange[0 .. 3];
const l = cRange.length;
}
{
const cRange = iota(arr.ptr, arr.ptr + arr.length);
const e = cRange.empty;
const f = cRange.front;
const b = cRange.back;
const i = cRange[2];
const s1 = cRange[];
const s2 = cRange[0 .. 3];
const l = cRange.length;
}
}
/* Generic overload that handles arbitrary types that support arithmetic
* operations.
*/
/// ditto
auto iota(B, E)(B begin, E end)
if (!isIntegral!(CommonType!(B, E)) &&
!isFloatingPoint!(CommonType!(B, E)) &&
!isPointer!(CommonType!(B, E)) &&
is(typeof((ref B b) { ++b; })) &&
(is(typeof(B.init < E.init)) || is(typeof(B.init == E.init))) )
{
static struct Result
{
B current;
E end;
@property bool empty()
{
static if (is(typeof(B.init < E.init)))
return !(current < end);
else static if (is(typeof(B.init != E.init)))
return current == end;
else
static assert(0);
}
@property auto front() { return current; }
void popFront()
{
assert(!empty);
++current;
}
}
return Result(begin, end);
}
/**
User-defined types such as $(XREF bigint, BigInt) are also supported, as long
as they can be incremented with $(D ++) and compared with $(D <) or $(D ==).
*/
// Issue 6447
unittest
{
import std.algorithm.comparison : equal;
import std.bigint;
auto s = BigInt(1_000_000_000_000);
auto e = BigInt(1_000_000_000_003);
auto r = iota(s, e);
assert(r.equal([
BigInt(1_000_000_000_000),
BigInt(1_000_000_000_001),
BigInt(1_000_000_000_002)
]));
}
unittest
{
import std.algorithm.comparison : equal;
// Test iota() for a type that only supports ++ and != but does not have
// '<'-ordering.
struct Cyclic(int wrapAround)
{
int current;
this(int start) { current = start % wrapAround; }
bool opEquals(Cyclic c) { return current == c.current; }
bool opEquals(int i) { return current == i; }
void opUnary(string op)() if (op == "++")
{
current = (current + 1) % wrapAround;
}
}
alias Cycle5 = Cyclic!5;
// Easy case
auto i1 = iota(Cycle5(1), Cycle5(4));
assert(i1.equal([1, 2, 3]));
// Wraparound case
auto i2 = iota(Cycle5(3), Cycle5(2));
assert(i2.equal([3, 4, 0, 1 ]));
}
/**
Options for the $(LREF FrontTransversal) and $(LREF Transversal) ranges
(below).
*/
enum TransverseOptions
{
/**
When transversed, the elements of a range of ranges are assumed to
have different lengths (e.g. a jagged array).
*/
assumeJagged, //default
/**
The transversal enforces that the elements of a range of ranges have
all the same length (e.g. an array of arrays, all having the same
length). Checking is done once upon construction of the transversal
range.
*/
enforceNotJagged,
/**
The transversal assumes, without verifying, that the elements of a
range of ranges have all the same length. This option is useful if
checking was already done from the outside of the range.
*/
assumeNotJagged,
}
/**
Given a range of ranges, iterate transversally through the first
elements of each of the enclosed ranges.
*/
struct FrontTransversal(Ror,
TransverseOptions opt = TransverseOptions.assumeJagged)
{
alias RangeOfRanges = Unqual!(Ror);
alias RangeType = .ElementType!RangeOfRanges;
alias ElementType = .ElementType!RangeType;
private void prime()
{
static if (opt == TransverseOptions.assumeJagged)
{
while (!_input.empty && _input.front.empty)
{
_input.popFront();
}
static if (isBidirectionalRange!RangeOfRanges)
{
while (!_input.empty && _input.back.empty)
{
_input.popBack();
}
}
}
}
/**
Construction from an input.
*/
this(RangeOfRanges input)
{
_input = input;
prime();
static if (opt == TransverseOptions.enforceNotJagged)
// (isRandomAccessRange!RangeOfRanges
// && hasLength!RangeType)
{
import std.exception : enforce;
if (empty) return;
immutable commonLength = _input.front.length;
foreach (e; _input)
{
enforce(e.length == commonLength);
}
}
}
/**
Forward range primitives.
*/
static if (isInfinite!RangeOfRanges)
{
enum bool empty = false;
}
else
{
@property bool empty()
{
return _input.empty;
}
}
/// Ditto
@property auto ref front()
{
assert(!empty);
return _input.front.front;
}
/// Ditto
static if (hasMobileElements!RangeType)
{
ElementType moveFront()
{
return _input.front.moveFront();
}
}
static if (hasAssignableElements!RangeType)
{
@property auto front(ElementType val)
{
_input.front.front = val;
}
}
/// Ditto
void popFront()
{
assert(!empty);
_input.popFront();
prime();
}
/**
Duplicates this $(D frontTransversal). Note that only the encapsulating
range of range will be duplicated. Underlying ranges will not be
duplicated.
*/
static if (isForwardRange!RangeOfRanges)
{
@property FrontTransversal save()
{
return FrontTransversal(_input.save);
}
}
static if (isBidirectionalRange!RangeOfRanges)
{
/**
Bidirectional primitives. They are offered if $(D
isBidirectionalRange!RangeOfRanges).
*/
@property auto ref back()
{
assert(!empty);
return _input.back.front;
}
/// Ditto
void popBack()
{
assert(!empty);
_input.popBack();
prime();
}
/// Ditto
static if (hasMobileElements!RangeType)
{
ElementType moveBack()
{
return _input.back.moveFront();
}
}
static if (hasAssignableElements!RangeType)
{
@property auto back(ElementType val)
{
_input.back.front = val;
}
}
}
static if (isRandomAccessRange!RangeOfRanges &&
(opt == TransverseOptions.assumeNotJagged ||
opt == TransverseOptions.enforceNotJagged))
{
/**
Random-access primitive. It is offered if $(D
isRandomAccessRange!RangeOfRanges && (opt ==
TransverseOptions.assumeNotJagged || opt ==
TransverseOptions.enforceNotJagged)).
*/
auto ref opIndex(size_t n)
{
return _input[n].front;
}
/// Ditto
static if (hasMobileElements!RangeType)
{
ElementType moveAt(size_t n)
{
return _input[n].moveFront();
}
}
/// Ditto
static if (hasAssignableElements!RangeType)
{
void opIndexAssign(ElementType val, size_t n)
{
_input[n].front = val;
}
}
/**
Slicing if offered if $(D RangeOfRanges) supports slicing and all the
conditions for supporting indexing are met.
*/
static if (hasSlicing!RangeOfRanges)
{
typeof(this) opSlice(size_t lower, size_t upper)
{
return typeof(this)(_input[lower..upper]);
}
}
}
auto opSlice() { return this; }
private:
RangeOfRanges _input;
}
/// Ditto
FrontTransversal!(RangeOfRanges, opt) frontTransversal(
TransverseOptions opt = TransverseOptions.assumeJagged,
RangeOfRanges)
(RangeOfRanges rr)
{
return typeof(return)(rr);
}
///
@safe unittest
{
import std.algorithm : equal;
int[][] x = new int[][2];
x[0] = [1, 2];
x[1] = [3, 4];
auto ror = frontTransversal(x);
assert(equal(ror, [ 1, 3 ][]));
}
@safe unittest
{
import std.internal.test.dummyrange;
import std.algorithm : equal;
static assert(is(FrontTransversal!(immutable int[][])));
foreach (DummyType; AllDummyRanges) {
auto dummies =
[DummyType.init, DummyType.init, DummyType.init, DummyType.init];
foreach (i, ref elem; dummies) {
// Just violate the DummyRange abstraction to get what I want.
elem.arr = elem.arr[i..$ - (3 - i)];
}
auto ft = frontTransversal!(TransverseOptions.assumeNotJagged)(dummies);
static if (isForwardRange!DummyType) {
static assert(isForwardRange!(typeof(ft)));
}
assert(equal(ft, [1, 2, 3, 4]));
// Test slicing.
assert(equal(ft[0..2], [1, 2]));
assert(equal(ft[1..3], [2, 3]));
assert(ft.front == ft.moveFront());
assert(ft.back == ft.moveBack());
assert(ft.moveAt(1) == ft[1]);
// Test infiniteness propagation.
static assert(isInfinite!(typeof(frontTransversal(repeat("foo")))));
static if (DummyType.r == ReturnBy.Reference) {
{
ft.front++;
scope(exit) ft.front--;
assert(dummies.front.front == 2);
}
{
ft.front = 5;
scope(exit) ft.front = 1;
assert(dummies[0].front == 5);
}
{
ft.back = 88;
scope(exit) ft.back = 4;
assert(dummies.back.front == 88);
}
{
ft[1] = 99;
scope(exit) ft[1] = 2;
assert(dummies[1].front == 99);
}
}
}
}
/**
Given a range of ranges, iterate transversally through the the $(D
n)th element of each of the enclosed ranges. All elements of the
enclosing range must offer random access.
*/
struct Transversal(Ror,
TransverseOptions opt = TransverseOptions.assumeJagged)
{
private alias RangeOfRanges = Unqual!Ror;
private alias InnerRange = ElementType!RangeOfRanges;
private alias E = ElementType!InnerRange;
private void prime()
{
static if (opt == TransverseOptions.assumeJagged)
{
while (!_input.empty && _input.front.length <= _n)
{
_input.popFront();
}
static if (isBidirectionalRange!RangeOfRanges)
{
while (!_input.empty && _input.back.length <= _n)
{
_input.popBack();
}
}
}
}
/**
Construction from an input and an index.
*/
this(RangeOfRanges input, size_t n)
{
_input = input;
_n = n;
prime();
static if (opt == TransverseOptions.enforceNotJagged)
{
import std.exception : enforce;
if (empty) return;
immutable commonLength = _input.front.length;
foreach (e; _input)
{
enforce(e.length == commonLength);
}
}
}
/**
Forward range primitives.
*/
static if (isInfinite!(RangeOfRanges))
{
enum bool empty = false;
}
else
{
@property bool empty()
{
return _input.empty;
}
}
/// Ditto
@property auto ref front()
{
assert(!empty);
return _input.front[_n];
}
/// Ditto
static if (hasMobileElements!InnerRange)
{
E moveFront()
{
return _input.front.moveAt(_n);
}
}
/// Ditto
static if (hasAssignableElements!InnerRange)
{
@property auto front(E val)
{
_input.front[_n] = val;
}
}
/// Ditto
void popFront()
{
assert(!empty);
_input.popFront();
prime();
}
/// Ditto
static if (isForwardRange!RangeOfRanges)
{
@property typeof(this) save()
{
auto ret = this;
ret._input = _input.save;
return ret;
}
}
static if (isBidirectionalRange!RangeOfRanges)
{
/**
Bidirectional primitives. They are offered if $(D
isBidirectionalRange!RangeOfRanges).
*/
@property auto ref back()
{
return _input.back[_n];
}
/// Ditto
void popBack()
{
assert(!empty);
_input.popBack();
prime();
}
/// Ditto
static if (hasMobileElements!InnerRange)
{
E moveBack()
{
return _input.back.moveAt(_n);
}
}
/// Ditto
static if (hasAssignableElements!InnerRange)
{
@property auto back(E val)
{
_input.back[_n] = val;
}
}
}
static if (isRandomAccessRange!RangeOfRanges &&
(opt == TransverseOptions.assumeNotJagged ||
opt == TransverseOptions.enforceNotJagged))
{
/**
Random-access primitive. It is offered if $(D
isRandomAccessRange!RangeOfRanges && (opt ==
TransverseOptions.assumeNotJagged || opt ==
TransverseOptions.enforceNotJagged)).
*/
auto ref opIndex(size_t n)
{
return _input[n][_n];
}
/// Ditto
static if (hasMobileElements!InnerRange)
{
E moveAt(size_t n)
{
return _input[n].moveAt(_n);
}
}
/// Ditto
static if (hasAssignableElements!InnerRange)
{
void opIndexAssign(E val, size_t n)
{
_input[n][_n] = val;
}
}
/// Ditto
static if (hasLength!RangeOfRanges)
{
@property size_t length()
{
return _input.length;
}
alias opDollar = length;
}
/**
Slicing if offered if $(D RangeOfRanges) supports slicing and all the
conditions for supporting indexing are met.
*/
static if (hasSlicing!RangeOfRanges)
{
typeof(this) opSlice(size_t lower, size_t upper)
{
return typeof(this)(_input[lower..upper], _n);
}
}
}
auto opSlice() { return this; }
private:
RangeOfRanges _input;
size_t _n;
}
/// Ditto
Transversal!(RangeOfRanges, opt) transversal
(TransverseOptions opt = TransverseOptions.assumeJagged, RangeOfRanges)
(RangeOfRanges rr, size_t n)
{
return typeof(return)(rr, n);
}
///
@safe unittest
{
import std.algorithm : equal;
int[][] x = new int[][2];
x[0] = [1, 2];
x[1] = [3, 4];
auto ror = transversal(x, 1);
assert(equal(ror, [ 2, 4 ][]));
}
@safe unittest
{
import std.internal.test.dummyrange;
int[][] x = new int[][2];
x[0] = [ 1, 2 ];
x[1] = [3, 4];
auto ror = transversal!(TransverseOptions.assumeNotJagged)(x, 1);
auto witness = [ 2, 4 ];
uint i;
foreach (e; ror) assert(e == witness[i++]);
assert(i == 2);
assert(ror.length == 2);
static assert(is(Transversal!(immutable int[][])));
// Make sure ref, assign is being propagated.
{
ror.front++;
scope(exit) ror.front--;
assert(x[0][1] == 3);
}
{
ror.front = 5;
scope(exit) ror.front = 2;
assert(x[0][1] == 5);
assert(ror.moveFront() == 5);
}
{
ror.back = 999;
scope(exit) ror.back = 4;
assert(x[1][1] == 999);
assert(ror.moveBack() == 999);
}
{
ror[0] = 999;
scope(exit) ror[0] = 2;
assert(x[0][1] == 999);
assert(ror.moveAt(0) == 999);
}
// Test w/o ref return.
alias D = DummyRange!(ReturnBy.Value, Length.Yes, RangeType.Random);
auto drs = [D.init, D.init];
foreach (num; 0..10) {
auto t = transversal!(TransverseOptions.enforceNotJagged)(drs, num);
assert(t[0] == t[1]);
assert(t[1] == num + 1);
}
static assert(isInfinite!(typeof(transversal(repeat([1,2,3]), 1))));
// Test slicing.
auto mat = [[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]];
auto mat1 = transversal!(TransverseOptions.assumeNotJagged)(mat, 1)[1..3];
assert(mat1[0] == 6);
assert(mat1[1] == 10);
}
struct Transposed(RangeOfRanges)
if (isForwardRange!RangeOfRanges &&
isInputRange!(ElementType!RangeOfRanges) &&
hasAssignableElements!RangeOfRanges)
{
//alias ElementType = typeof(map!"a.front"(RangeOfRanges.init));
this(RangeOfRanges input)
{
this._input = input;
}
@property auto front()
{
import std.algorithm : filter, map;
return _input.save
.filter!(a => !a.empty)
.map!(a => a.front);
}
void popFront()
{
// Advance the position of each subrange.
auto r = _input.save;
while (!r.empty)
{
auto e = r.front;
if (!e.empty)
{
e.popFront();
r.front = e;
}
r.popFront();
}
}
// ElementType opIndex(size_t n)
// {
// return _input[n].front;
// }
@property bool empty()
{
if (_input.empty) return true;
foreach (e; _input.save)
{
if (!e.empty) return false;
}
return true;
}
@property Transposed save()
{
return Transposed(_input.save);
}
auto opSlice() { return this; }
private:
RangeOfRanges _input;
}
@safe unittest
{
// Boundary case: transpose of empty range should be empty
int[][] ror = [];
assert(transposed(ror).empty);
}
// Issue 9507
unittest
{
import std.algorithm : equal;
auto r = [[1,2], [3], [4,5], [], [6]];
assert(r.transposed.equal!equal([
[1, 3, 4, 6],
[2, 5]
]));
}
/**
Given a range of ranges, returns a range of ranges where the $(I i)'th subrange
contains the $(I i)'th elements of the original subranges.
*/
Transposed!RangeOfRanges transposed(RangeOfRanges)(RangeOfRanges rr)
if (isForwardRange!RangeOfRanges &&
isInputRange!(ElementType!RangeOfRanges) &&
hasAssignableElements!RangeOfRanges)
{
return Transposed!RangeOfRanges(rr);
}
///
@safe unittest
{
import std.algorithm : equal;
int[][] ror = [
[1, 2, 3],
[4, 5, 6]
];
auto xp = transposed(ror);
assert(equal!"a.equal(b)"(xp, [
[1, 4],
[2, 5],
[3, 6]
]));
}
///
@safe unittest
{
int[][] x = new int[][2];
x[0] = [1, 2];
x[1] = [3, 4];
auto tr = transposed(x);
int[][] witness = [ [ 1, 3 ], [ 2, 4 ] ];
uint i;
foreach (e; tr)
{
assert(array(e) == witness[i++]);
}
}
// Issue 8764
@safe unittest
{
import std.algorithm : equal;
ulong[1] t0 = [ 123 ];
assert(!hasAssignableElements!(typeof(t0[].chunks(1))));
assert(!is(typeof(transposed(t0[].chunks(1)))));
assert(is(typeof(transposed(t0[].chunks(1).array()))));
auto t1 = transposed(t0[].chunks(1).array());
assert(equal!"a.equal(b)"(t1, [[123]]));
}
/**
This struct takes two ranges, $(D source) and $(D indices), and creates a view
of $(D source) as if its elements were reordered according to $(D indices).
$(D indices) may include only a subset of the elements of $(D source) and
may also repeat elements.
$(D Source) must be a random access range. The returned range will be
bidirectional or random-access if $(D Indices) is bidirectional or
random-access, respectively.
*/
struct Indexed(Source, Indices)
if (isRandomAccessRange!Source && isInputRange!Indices &&
is(typeof(Source.init[ElementType!(Indices).init])))
{
this(Source source, Indices indices)
{
this._source = source;
this._indices = indices;
}
/// Range primitives
@property auto ref front()
{
assert(!empty);
return _source[_indices.front];
}
/// Ditto
void popFront()
{
assert(!empty);
_indices.popFront();
}
static if (isInfinite!Indices)
{
enum bool empty = false;
}
else
{
/// Ditto
@property bool empty()
{
return _indices.empty;
}
}
static if (isForwardRange!Indices)
{
/// Ditto
@property typeof(this) save()
{
// Don't need to save _source because it's never consumed.
return typeof(this)(_source, _indices.save);
}
}
/// Ditto
static if (hasAssignableElements!Source)
{
@property auto ref front(ElementType!Source newVal)
{
assert(!empty);
return _source[_indices.front] = newVal;
}
}
static if (hasMobileElements!Source)
{
/// Ditto
auto moveFront()
{
assert(!empty);
return _source.moveAt(_indices.front);
}
}
static if (isBidirectionalRange!Indices)
{
/// Ditto
@property auto ref back()
{
assert(!empty);
return _source[_indices.back];
}
/// Ditto
void popBack()
{
assert(!empty);
_indices.popBack();
}
/// Ditto
static if (hasAssignableElements!Source)
{
@property auto ref back(ElementType!Source newVal)
{
assert(!empty);
return _source[_indices.back] = newVal;
}
}
static if (hasMobileElements!Source)
{
/// Ditto
auto moveBack()
{
assert(!empty);
return _source.moveAt(_indices.back);
}
}
}
static if (hasLength!Indices)
{
/// Ditto
@property size_t length()
{
return _indices.length;
}
alias opDollar = length;
}
static if (isRandomAccessRange!Indices)
{
/// Ditto
auto ref opIndex(size_t index)
{
return _source[_indices[index]];
}
/// Ditto
typeof(this) opSlice(size_t a, size_t b)
{
return typeof(this)(_source, _indices[a..b]);
}
static if (hasAssignableElements!Source)
{
/// Ditto
auto opIndexAssign(ElementType!Source newVal, size_t index)
{
return _source[_indices[index]] = newVal;
}
}
static if (hasMobileElements!Source)
{
/// Ditto
auto moveAt(size_t index)
{
return _source.moveAt(_indices[index]);
}
}
}
// All this stuff is useful if someone wants to index an Indexed
// without adding a layer of indirection.
/**
Returns the source range.
*/
@property Source source()
{
return _source;
}
/**
Returns the indices range.
*/
@property Indices indices()
{
return _indices;
}
static if (isRandomAccessRange!Indices)
{
/**
Returns the physical index into the source range corresponding to a
given logical index. This is useful, for example, when indexing
an $(D Indexed) without adding another layer of indirection.
*/
size_t physicalIndex(size_t logicalIndex)
{
return _indices[logicalIndex];
}
///
unittest
{
auto ind = indexed([1, 2, 3, 4, 5], [1, 3, 4]);
assert(ind.physicalIndex(0) == 1);
}
}
private:
Source _source;
Indices _indices;
}
/// Ditto
Indexed!(Source, Indices) indexed(Source, Indices)(Source source, Indices indices)
{
return typeof(return)(source, indices);
}
///
@safe unittest
{
import std.algorithm : equal;
auto source = [1, 2, 3, 4, 5];
auto indices = [4, 3, 1, 2, 0, 4];
auto ind = indexed(source, indices);
assert(equal(ind, [5, 4, 2, 3, 1, 5]));
assert(equal(retro(ind), [5, 1, 3, 2, 4, 5]));
}
@safe unittest
{
{
auto ind = indexed([1, 2, 3, 4, 5], [1, 3, 4]);
assert(ind.physicalIndex(0) == 1);
}
auto source = [1, 2, 3, 4, 5];
auto indices = [4, 3, 1, 2, 0, 4];
auto ind = indexed(source, indices);
// When elements of indices are duplicated and Source has lvalue elements,
// these are aliased in ind.
ind[0]++;
assert(ind[0] == 6);
assert(ind[5] == 6);
}
@safe unittest
{
import std.internal.test.dummyrange;
foreach (DummyType; AllDummyRanges)
{
auto d = DummyType.init;
auto r = indexed([1, 2, 3, 4, 5], d);
static assert(propagatesRangeType!(DummyType, typeof(r)));
static assert(propagatesLength!(DummyType, typeof(r)));
}
}
/**
This range iterates over fixed-sized chunks of size $(D chunkSize) of a
$(D source) range. $(D Source) must be a forward range. $(D chunkSize) must be
greater than zero.
If $(D !isInfinite!Source) and $(D source.walkLength) is not evenly
divisible by $(D chunkSize), the back element of this range will contain
fewer than $(D chunkSize) elements.
*/
struct Chunks(Source)
if (isForwardRange!Source)
{
/// Standard constructor
this(Source source, size_t chunkSize)
{
assert(chunkSize != 0, "Cannot create a Chunk with an empty chunkSize");
_source = source;
_chunkSize = chunkSize;
}
/// Forward range primitives. Always present.
@property auto front()
{
assert(!empty);
return _source.save.take(_chunkSize);
}
/// Ditto
void popFront()
{
assert(!empty);
_source.popFrontN(_chunkSize);
}
static if (!isInfinite!Source)
/// Ditto
@property bool empty()
{
return _source.empty;
}
else
// undocumented
enum empty = false;
/// Ditto
@property typeof(this) save()
{
return typeof(this)(_source.save, _chunkSize);
}
static if (hasLength!Source)
{
/// Length. Only if $(D hasLength!Source) is $(D true)
@property size_t length()
{
// Note: _source.length + _chunkSize may actually overflow.
// We cast to ulong to mitigate the problem on x86 machines.
// For x64 machines, we just suppose we'll never overflow.
// The "safe" code would require either an extra branch, or a
// modulo operation, which is too expensive for such a rare case
return cast(size_t)((cast(ulong)(_source.length) + _chunkSize - 1) / _chunkSize);
}
//Note: No point in defining opDollar here without slicing.
//opDollar is defined below in the hasSlicing!Source section
}
static if (hasSlicing!Source)
{
//Used for various purposes
private enum hasSliceToEnd = is(typeof(Source.init[_chunkSize .. $]) == Source);
/**
Indexing and slicing operations. Provided only if
$(D hasSlicing!Source) is $(D true).
*/
auto opIndex(size_t index)
{
immutable start = index * _chunkSize;
immutable end = start + _chunkSize;
static if (isInfinite!Source)
return _source[start .. end];
else
{
import std.algorithm : min;
immutable len = _source.length;
assert(start < len, "chunks index out of bounds");
return _source[start .. min(end, len)];
}
}
/// Ditto
static if (hasLength!Source)
typeof(this) opSlice(size_t lower, size_t upper)
{
import std.algorithm : min;
assert(lower <= upper && upper <= length, "chunks slicing index out of bounds");
immutable len = _source.length;
return chunks(_source[min(lower * _chunkSize, len) .. min(upper * _chunkSize, len)], _chunkSize);
}
else static if (hasSliceToEnd)
//For slicing an infinite chunk, we need to slice the source to the end.
typeof(takeExactly(this, 0)) opSlice(size_t lower, size_t upper)
{
assert(lower <= upper, "chunks slicing index out of bounds");
return chunks(_source[lower * _chunkSize .. $], _chunkSize).takeExactly(upper - lower);
}
static if (isInfinite!Source)
{
static if (hasSliceToEnd)
{
private static struct DollarToken{}
DollarToken opDollar()
{
return DollarToken();
}
//Slice to dollar
typeof(this) opSlice(size_t lower, DollarToken)
{
return typeof(this)(_source[lower * _chunkSize .. $], _chunkSize);
}
}
}
else
{
//Dollar token carries a static type, with no extra information.
//It can lazily transform into _source.length on algorithmic
//operations such as : chunks[$/2, $-1];
private static struct DollarToken
{
Chunks!Source* mom;
@property size_t momLength()
{
return mom.length;
}
alias momLength this;
}
DollarToken opDollar()
{
return DollarToken(&this);
}
//Slice overloads optimized for using dollar. Without this, to slice to end, we would...
//1. Evaluate chunks.length
//2. Multiply by _chunksSize
//3. To finally just compare it (with min) to the original length of source (!)
//These overloads avoid that.
typeof(this) opSlice(DollarToken, DollarToken)
{
static if (hasSliceToEnd)
return chunks(_source[$ .. $], _chunkSize);
else
{
immutable len = _source.length;
return chunks(_source[len .. len], _chunkSize);
}
}
typeof(this) opSlice(size_t lower, DollarToken)
{
import std.algorithm : min;
assert(lower <= length, "chunks slicing index out of bounds");
static if (hasSliceToEnd)
return chunks(_source[min(lower * _chunkSize, _source.length) .. $], _chunkSize);
else
{
immutable len = _source.length;
return chunks(_source[min(lower * _chunkSize, len) .. len], _chunkSize);
}
}
typeof(this) opSlice(DollarToken, size_t upper)
{
assert(upper == length, "chunks slicing index out of bounds");
return this[$ .. $];
}
}
}
//Bidirectional range primitives
static if (hasSlicing!Source && hasLength!Source)
{
/**
Bidirectional range primitives. Provided only if both
$(D hasSlicing!Source) and $(D hasLength!Source) are $(D true).
*/
@property auto back()
{
assert(!empty, "back called on empty chunks");
immutable len = _source.length;
immutable start = (len - 1) / _chunkSize * _chunkSize;
return _source[start .. len];
}
/// Ditto
void popBack()
{
assert(!empty, "popBack() called on empty chunks");
immutable end = (_source.length - 1) / _chunkSize * _chunkSize;
_source = _source[0 .. end];
}
}
private:
Source _source;
size_t _chunkSize;
}
/// Ditto
Chunks!Source chunks(Source)(Source source, size_t chunkSize)
if (isForwardRange!Source)
{
return typeof(return)(source, chunkSize);
}
///
@safe unittest
{
import std.algorithm : equal;
auto source = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
auto chunks = chunks(source, 4);
assert(chunks[0] == [1, 2, 3, 4]);
assert(chunks[1] == [5, 6, 7, 8]);
assert(chunks[2] == [9, 10]);
assert(chunks.back == chunks[2]);
assert(chunks.front == chunks[0]);
assert(chunks.length == 3);
assert(equal(retro(array(chunks)), array(retro(chunks))));
}
@safe unittest
{
auto source = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
auto chunks = chunks(source, 4);
auto chunks2 = chunks.save;
chunks.popFront();
assert(chunks[0] == [5, 6, 7, 8]);
assert(chunks[1] == [9, 10]);
chunks2.popBack();
assert(chunks2[1] == [5, 6, 7, 8]);
assert(chunks2.length == 2);
static assert(isRandomAccessRange!(typeof(chunks)));
}
@safe unittest
{
import std.algorithm : equal;
//Extra toying with slicing and indexing.
auto chunks1 = [0, 0, 1, 1, 2, 2, 3, 3, 4].chunks(2);
auto chunks2 = [0, 0, 1, 1, 2, 2, 3, 3, 4, 4].chunks(2);
assert (chunks1.length == 5);
assert (chunks2.length == 5);
assert (chunks1[4] == [4]);
assert (chunks2[4] == [4, 4]);
assert (chunks1.back == [4]);
assert (chunks2.back == [4, 4]);
assert (chunks1[0 .. 1].equal([[0, 0]]));
assert (chunks1[0 .. 2].equal([[0, 0], [1, 1]]));
assert (chunks1[4 .. 5].equal([[4]]));
assert (chunks2[4 .. 5].equal([[4, 4]]));
assert (chunks1[0 .. 0].equal((int[][]).init));
assert (chunks1[5 .. 5].equal((int[][]).init));
assert (chunks2[5 .. 5].equal((int[][]).init));
//Fun with opDollar
assert (chunks1[$ .. $].equal((int[][]).init)); //Quick
assert (chunks2[$ .. $].equal((int[][]).init)); //Quick
assert (chunks1[$ - 1 .. $].equal([[4]])); //Semiquick
assert (chunks2[$ - 1 .. $].equal([[4, 4]])); //Semiquick
assert (chunks1[$ .. 5].equal((int[][]).init)); //Semiquick
assert (chunks2[$ .. 5].equal((int[][]).init)); //Semiquick
assert (chunks1[$ / 2 .. $ - 1].equal([[2, 2], [3, 3]])); //Slow
}
unittest
{
import std.algorithm : equal, filter;
//ForwardRange
auto r = filter!"true"([1, 2, 3, 4, 5]).chunks(2);
assert(equal!"equal(a, b)"(r, [[1, 2], [3, 4], [5]]));
//InfiniteRange w/o RA
auto fibsByPairs = recurrence!"a[n-1] + a[n-2]"(1, 1).chunks(2);
assert(equal!`equal(a, b)`(fibsByPairs.take(2), [[ 1, 1], [ 2, 3]]));
//InfiniteRange w/ RA and slicing
auto odds = sequence!("a[0] + n * a[1]")(1, 2);
auto oddsByPairs = odds.chunks(2);
assert(equal!`equal(a, b)`(oddsByPairs.take(2), [[ 1, 3], [ 5, 7]]));
//Requires phobos#991 for Sequence to have slice to end
static assert(hasSlicing!(typeof(odds)));
assert(equal!`equal(a, b)`(oddsByPairs[3 .. 5], [[13, 15], [17, 19]]));
assert(equal!`equal(a, b)`(oddsByPairs[3 .. $].take(2), [[13, 15], [17, 19]]));
}
/**
This range splits a $(D source) range into $(D chunkCount) chunks of
approximately equal length. $(D Source) must be a forward range with
known length.
Unlike $(LREF chunks), $(D evenChunks) takes a chunk count (not size).
The returned range will contain zero or more $(D source.length /
chunkCount + 1) elements followed by $(D source.length / chunkCount)
elements. If $(D source.length < chunkCount), some chunks will be empty.
$(D chunkCount) must not be zero, unless $(D source) is also empty.
*/
struct EvenChunks(Source)
if (isForwardRange!Source && hasLength!Source)
{
/// Standard constructor
this(Source source, size_t chunkCount)
{
assert(chunkCount != 0 || source.empty, "Cannot create EvenChunks with a zero chunkCount");
_source = source;
_chunkCount = chunkCount;
}
/// Forward range primitives. Always present.
@property auto front()
{
assert(!empty);
return _source.save.take(_chunkPos(1));
}
/// Ditto
void popFront()
{
assert(!empty);
_source.popFrontN(_chunkPos(1));
_chunkCount--;
}
/// Ditto
@property bool empty()
{
return _source.empty;
}
/// Ditto
@property typeof(this) save()
{
return typeof(this)(_source.save, _chunkCount);
}
/// Length
@property size_t length() const
{
return _chunkCount;
}
//Note: No point in defining opDollar here without slicing.
//opDollar is defined below in the hasSlicing!Source section
static if (hasSlicing!Source)
{
/**
Indexing, slicing and bidirectional operations and range primitives.
Provided only if $(D hasSlicing!Source) is $(D true).
*/
auto opIndex(size_t index)
{
assert(index < _chunkCount, "evenChunks index out of bounds");
return _source[_chunkPos(index) .. _chunkPos(index+1)];
}
/// Ditto
typeof(this) opSlice(size_t lower, size_t upper)
{
assert(lower <= upper && upper <= length, "evenChunks slicing index out of bounds");
return evenChunks(_source[_chunkPos(lower) .. _chunkPos(upper)], upper - lower);
}
/// Ditto
@property auto back()
{
assert(!empty, "back called on empty evenChunks");
return _source[_chunkPos(_chunkCount - 1) .. $];
}
/// Ditto
void popBack()
{
assert(!empty, "popBack() called on empty evenChunks");
_source = _source[0 .. _chunkPos(_chunkCount - 1)];
_chunkCount--;
}
}
private:
Source _source;
size_t _chunkCount;
size_t _chunkPos(size_t i)
{
/*
_chunkCount = 5, _source.length = 13:
chunk0
| chunk3
| |
v v
+-+-+-+-+-+ ^
|0|3|.| | | |
+-+-+-+-+-+ | div
|1|4|.| | | |
+-+-+-+-+-+ v
|2|5|.|
+-+-+-+
<----->
mod
<--------->
_chunkCount
One column is one chunk.
popFront and popBack pop the left-most
and right-most column, respectively.
*/
auto div = _source.length / _chunkCount;
auto mod = _source.length % _chunkCount;
auto pos = i <= mod
? i * (div+1)
: mod * (div+1) + (i-mod) * div
;
//auto len = i < mod
// ? div+1
// : div
//;
return pos;
}
}
/// Ditto
EvenChunks!Source evenChunks(Source)(Source source, size_t chunkCount)
if (isForwardRange!Source && hasLength!Source)
{
return typeof(return)(source, chunkCount);
}
///
@safe unittest
{
import std.algorithm : equal;
auto source = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
auto chunks = evenChunks(source, 3);
assert(chunks[0] == [1, 2, 3, 4]);
assert(chunks[1] == [5, 6, 7]);
assert(chunks[2] == [8, 9, 10]);
}
@safe unittest
{
import std.algorithm : equal;
auto source = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
auto chunks = evenChunks(source, 3);
assert(chunks.back == chunks[2]);
assert(chunks.front == chunks[0]);
assert(chunks.length == 3);
assert(equal(retro(array(chunks)), array(retro(chunks))));
auto chunks2 = chunks.save;
chunks.popFront();
assert(chunks[0] == [5, 6, 7]);
assert(chunks[1] == [8, 9, 10]);
chunks2.popBack();
assert(chunks2[1] == [5, 6, 7]);
assert(chunks2.length == 2);
static assert(isRandomAccessRange!(typeof(chunks)));
}
@safe unittest
{
import std.algorithm : equal;
int[] source = [];
auto chunks = source.evenChunks(0);
assert(chunks.length == 0);
chunks = source.evenChunks(3);
assert(equal(chunks, [[], [], []]));
chunks = [1, 2, 3].evenChunks(5);
assert(equal(chunks, [[1], [2], [3], [], []]));
}
private struct OnlyResult(T, size_t arity)
{
private this(Values...)(auto ref Values values)
{
this.data = [values];
this.backIndex = arity;
}
bool empty() @property
{
return frontIndex >= backIndex;
}
T front() @property
{
assert(!empty);
return data[frontIndex];
}
void popFront()
{
assert(!empty);
++frontIndex;
}
T back() @property
{
assert(!empty);
return data[backIndex - 1];
}
void popBack()
{
assert(!empty);
--backIndex;
}
OnlyResult save() @property
{
return this;
}
size_t length() const @property
{
return backIndex - frontIndex;
}
alias opDollar = length;
T opIndex(size_t idx)
{
// when i + idx points to elements popped
// with popBack
assert(idx < length);
return data[frontIndex + idx];
}
OnlyResult opSlice()
{
return this;
}
OnlyResult opSlice(size_t from, size_t to)
{
OnlyResult result = this;
result.frontIndex += from;
result.backIndex = this.frontIndex + to;
assert(from <= to && to <= length);
return result;
}
private size_t frontIndex = 0;
private size_t backIndex = 0;
// @@@BUG@@@ 10643
version(none)
{
static if (hasElaborateAssign!T)
private T[arity] data;
else
private T[arity] data = void;
}
else
private T[arity] data;
}
// Specialize for single-element results
private struct OnlyResult(T, size_t arity : 1)
{
@property T front() { assert(!_empty); return _value; }
@property T back() { assert(!_empty); return _value; }
@property bool empty() const { return _empty; }
@property size_t length() const { return !_empty; }
@property auto save() { return this; }
void popFront() { assert(!_empty); _empty = true; }
void popBack() { assert(!_empty); _empty = true; }
alias opDollar = length;
private this()(auto ref T value)
{
this._value = value;
this._empty = false;
}
T opIndex(size_t i)
{
assert(!_empty && i == 0);
return _value;
}
OnlyResult opSlice()
{
return this;
}
OnlyResult opSlice(size_t from, size_t to)
{
assert(from <= to && to <= length);
OnlyResult copy = this;
copy._empty = _empty || from == to;
return copy;
}
private Unqual!T _value;
private bool _empty = true;
}
// Specialize for the empty range
private struct OnlyResult(T, size_t arity : 0)
{
private static struct EmptyElementType {}
bool empty() @property { return true; }
size_t length() const @property { return 0; }
alias opDollar = length;
EmptyElementType front() @property { assert(false); }
void popFront() { assert(false); }
EmptyElementType back() @property { assert(false); }
void popBack() { assert(false); }
OnlyResult save() @property { return this; }
EmptyElementType opIndex(size_t i)
{
assert(false);
}
OnlyResult opSlice() { return this; }
OnlyResult opSlice(size_t from, size_t to)
{
assert(from == 0 && to == 0);
return this;
}
}
/**
Assemble $(D values) into a range that carries all its
elements in-situ.
Useful when a single value or multiple disconnected values
must be passed to an algorithm expecting a range, without
having to perform dynamic memory allocation.
As copying the range means copying all elements, it can be
safely returned from functions. For the same reason, copying
the returned range may be expensive for a large number of arguments.
*/
auto only(Values...)(auto ref Values values)
if (!is(CommonType!Values == void) || Values.length == 0)
{
return OnlyResult!(CommonType!Values, Values.length)(values);
}
///
@safe unittest
{
import std.algorithm;
import std.uni;
assert(equal(only('♡'), "♡"));
assert([1, 2, 3, 4].findSplitBefore(only(3))[0] == [1, 2]);
assert(only("one", "two", "three").joiner(" ").equal("one two three"));
string title = "The D Programming Language";
assert(filter!isUpper(title).map!only().join(".") == "T.D.P.L");
}
unittest
{
// Verify that the same common type and same arity
// results in the same template instantiation
static assert(is(typeof(only(byte.init, int.init)) ==
typeof(only(int.init, byte.init))));
static assert(is(typeof(only((const(char)[]).init, string.init)) ==
typeof(only((const(char)[]).init, (const(char)[]).init))));
}
// Tests the zero-element result
@safe unittest
{
import std.algorithm : equal;
auto emptyRange = only();
alias EmptyRange = typeof(emptyRange);
static assert(isInputRange!EmptyRange);
static assert(isForwardRange!EmptyRange);
static assert(isBidirectionalRange!EmptyRange);
static assert(isRandomAccessRange!EmptyRange);
static assert(hasLength!EmptyRange);
static assert(hasSlicing!EmptyRange);
assert(emptyRange.empty);
assert(emptyRange.length == 0);
assert(emptyRange.equal(emptyRange[]));
assert(emptyRange.equal(emptyRange.save));
assert(emptyRange[0 .. 0].equal(emptyRange));
}
// Tests the single-element result
@safe unittest
{
import std.algorithm : equal;
import std.typecons : tuple;
foreach (x; tuple(1, '1', 1.0, "1", [1]))
{
auto a = only(x);
typeof(x)[] e = [];
assert(a.front == x);
assert(a.back == x);
assert(!a.empty);
assert(a.length == 1);
assert(equal(a, a[]));
assert(equal(a, a[0..1]));
assert(equal(a[0..0], e));
assert(equal(a[1..1], e));
assert(a[0] == x);
auto b = a.save;
assert(equal(a, b));
a.popFront();
assert(a.empty && a.length == 0 && a[].empty);
b.popBack();
assert(b.empty && b.length == 0 && b[].empty);
alias A = typeof(a);
static assert(isInputRange!A);
static assert(isForwardRange!A);
static assert(isBidirectionalRange!A);
static assert(isRandomAccessRange!A);
static assert(hasLength!A);
static assert(hasSlicing!A);
}
auto imm = only!(immutable int)(1);
immutable int[] imme = [];
assert(imm.front == 1);
assert(imm.back == 1);
assert(!imm.empty);
assert(imm.init.empty); // Issue 13441
assert(imm.length == 1);
assert(equal(imm, imm[]));
assert(equal(imm, imm[0..1]));
assert(equal(imm[0..0], imme));
assert(equal(imm[1..1], imme));
assert(imm[0] == 1);
}
// Tests multiple-element results
@safe unittest
{
import std.algorithm : equal, joiner;
static assert(!__traits(compiles, only(1, "1")));
auto nums = only!(byte, uint, long)(1, 2, 3);
static assert(is(ElementType!(typeof(nums)) == long));
assert(nums.length == 3);
foreach (i; 0 .. 3)
assert(nums[i] == i + 1);
auto saved = nums.save;
foreach (i; 1 .. 4)
{
assert(nums.front == nums[0]);
assert(nums.front == i);
nums.popFront();
assert(nums.length == 3 - i);
}
assert(nums.empty);
assert(saved.equal(only(1, 2, 3)));
assert(saved.equal(saved[]));
assert(saved[0 .. 1].equal(only(1)));
assert(saved[0 .. 2].equal(only(1, 2)));
assert(saved[0 .. 3].equal(saved));
assert(saved[1 .. 3].equal(only(2, 3)));
assert(saved[2 .. 3].equal(only(3)));
assert(saved[0 .. 0].empty);
assert(saved[3 .. 3].empty);
alias data = AliasSeq!("one", "two", "three", "four");
static joined =
["one two", "one two three", "one two three four"];
string[] joinedRange = joined;
foreach (argCount; AliasSeq!(2, 3, 4))
{
auto values = only(data[0 .. argCount]);
alias Values = typeof(values);
static assert(is(ElementType!Values == string));
static assert(isInputRange!Values);
static assert(isForwardRange!Values);
static assert(isBidirectionalRange!Values);
static assert(isRandomAccessRange!Values);
static assert(hasSlicing!Values);
static assert(hasLength!Values);
assert(values.length == argCount);
assert(values[0 .. $].equal(values[0 .. values.length]));
assert(values.joiner(" ").equal(joinedRange.front));
joinedRange.popFront();
}
assert(saved.retro.equal(only(3, 2, 1)));
assert(saved.length == 3);
assert(saved.back == 3);
saved.popBack();
assert(saved.length == 2);
assert(saved.back == 2);
assert(saved.front == 1);
saved.popFront();
assert(saved.length == 1);
assert(saved.front == 2);
saved.popBack();
assert(saved.empty);
auto imm = only!(immutable int, immutable int)(42, 24);
alias Imm = typeof(imm);
static assert(is(ElementType!Imm == immutable(int)));
assert(!imm.empty);
assert(imm.init.empty); // Issue 13441
assert(imm.front == 42);
imm.popFront();
assert(imm.front == 24);
imm.popFront();
assert(imm.empty);
static struct Test { int* a; }
immutable(Test) test;
cast(void)only(test, test); // Works with mutable indirection
}
/**
Iterate over $(D range) with an attached index variable.
Each element is a $(XREF typecons, Tuple) containing the index
and the element, in that order, where the index member is named $(D index)
and the element member is named $(D value).
The index starts at $(D start) and is incremented by one on every iteration.
Bidirectionality is propagated only if $(D range) has length.
Overflow:
If $(D range) has length, then it is an error to pass a value for $(D start)
so that $(D start + range.length) is bigger than $(D Enumerator.max), thus it is
ensured that overflow cannot happen.
If $(D range) does not have length, and $(D popFront) is called when
$(D front.index == Enumerator.max), the index will overflow and
continue from $(D Enumerator.min).
Example:
Useful for using $(D foreach) with an index loop variable:
----
import std.stdio : stdin, stdout;
import std.range : enumerate;
foreach (lineNum, line; stdin.byLine().enumerate(1))
stdout.writefln("line #%s: %s", lineNum, line);
----
*/
auto enumerate(Enumerator = size_t, Range)(Range range, Enumerator start = 0)
if (isIntegral!Enumerator && isInputRange!Range)
in
{
static if (hasLength!Range)
{
// TODO: core.checkedint supports mixed signedness yet?
import core.checkedint : adds, addu;
import std.conv : ConvException, to;
alias LengthType = typeof(range.length);
bool overflow;
static if (isSigned!Enumerator && isSigned!LengthType)
auto result = adds(start, range.length, overflow);
else static if (isSigned!Enumerator)
{
Largest!(Enumerator, Signed!LengthType) signedLength;
try signedLength = to!(typeof(signedLength))(range.length);
catch (ConvException)
overflow = true;
catch (Exception)
assert(false);
auto result = adds(start, signedLength, overflow);
}
else
{
static if (isSigned!LengthType)
assert(range.length >= 0);
auto result = addu(start, range.length, overflow);
}
assert(!overflow && result <= Enumerator.max);
}
}
body
{
// TODO: Relax isIntegral!Enumerator to allow user-defined integral types
static struct Result
{
import std.typecons : Tuple;
private:
alias ElemType = Tuple!(Enumerator, "index", ElementType!Range, "value");
Range range;
Enumerator index;
public:
ElemType front() @property
{
assert(!range.empty);
return typeof(return)(index, range.front);
}
static if (isInfinite!Range)
enum bool empty = false;
else
{
bool empty() @property
{
return range.empty;
}
}
void popFront()
{
assert(!range.empty);
range.popFront();
++index; // When !hasLength!Range, overflow is expected
}
static if (isForwardRange!Range)
{
Result save() @property
{
return typeof(return)(range.save, index);
}
}
static if (hasLength!Range)
{
size_t length() @property
{
return range.length;
}
alias opDollar = length;
static if (isBidirectionalRange!Range)
{
ElemType back() @property
{
assert(!range.empty);
return typeof(return)(cast(Enumerator)(index + range.length - 1), range.back);
}
void popBack()
{
assert(!range.empty);
range.popBack();
}
}
}
static if (isRandomAccessRange!Range)
{
ElemType opIndex(size_t i)
{
return typeof(return)(cast(Enumerator)(index + i), range[i]);
}
}
static if (hasSlicing!Range)
{
static if (hasLength!Range)
{
Result opSlice(size_t i, size_t j)
{
return typeof(return)(range[i .. j], cast(Enumerator)(index + i));
}
}
else
{
static struct DollarToken {}
enum opDollar = DollarToken.init;
Result opSlice(size_t i, DollarToken)
{
return typeof(return)(range[i .. $], cast(Enumerator)(index + i));
}
auto opSlice(size_t i, size_t j)
{
return this[i .. $].takeExactly(j - 1);
}
}
}
}
return Result(range, start);
}
/// Can start enumeration from a negative position:
pure @safe nothrow unittest
{
import std.array : assocArray;
import std.range : enumerate;
bool[int] aa = true.repeat(3).enumerate(-1).assocArray();
assert(aa[-1]);
assert(aa[0]);
assert(aa[1]);
}
pure @safe nothrow unittest
{
import std.internal.test.dummyrange;
import std.typecons : tuple;
static struct HasSlicing
{
typeof(this) front() @property { return typeof(this).init; }
bool empty() @property { return true; }
void popFront() {}
typeof(this) opSlice(size_t, size_t)
{
return typeof(this)();
}
}
foreach (DummyType; AliasSeq!(AllDummyRanges, HasSlicing))
{
alias R = typeof(enumerate(DummyType.init));
static assert(isInputRange!R);
static assert(isForwardRange!R == isForwardRange!DummyType);
static assert(isRandomAccessRange!R == isRandomAccessRange!DummyType);
static assert(!hasAssignableElements!R);
static if (hasLength!DummyType)
{
static assert(hasLength!R);
static assert(isBidirectionalRange!R ==
isBidirectionalRange!DummyType);
}
static assert(hasSlicing!R == hasSlicing!DummyType);
}
static immutable values = ["zero", "one", "two", "three"];
auto enumerated = values[].enumerate();
assert(!enumerated.empty);
assert(enumerated.front == tuple(0, "zero"));
assert(enumerated.back == tuple(3, "three"));
typeof(enumerated) saved = enumerated.save;
saved.popFront();
assert(enumerated.front == tuple(0, "zero"));
assert(saved.front == tuple(1, "one"));
assert(saved.length == enumerated.length - 1);
saved.popBack();
assert(enumerated.back == tuple(3, "three"));
assert(saved.back == tuple(2, "two"));
saved.popFront();
assert(saved.front == tuple(2, "two"));
assert(saved.back == tuple(2, "two"));
saved.popFront();
assert(saved.empty);
size_t control = 0;
foreach (i, v; enumerated)
{
static assert(is(typeof(i) == size_t));
static assert(is(typeof(v) == typeof(values[0])));
assert(i == control);
assert(v == values[i]);
assert(tuple(i, v) == enumerated[i]);
++control;
}
assert(enumerated[0 .. $].front == tuple(0, "zero"));
assert(enumerated[$ - 1 .. $].front == tuple(3, "three"));
foreach (i; 0 .. 10)
{
auto shifted = values[0 .. 2].enumerate(i);
assert(shifted.front == tuple(i, "zero"));
assert(shifted[0] == shifted.front);
auto next = tuple(i + 1, "one");
assert(shifted[1] == next);
shifted.popFront();
assert(shifted.front == next);
shifted.popFront();
assert(shifted.empty);
}
foreach (T; AliasSeq!(ubyte, byte, uint, int))
{
auto inf = 42.repeat().enumerate(T.max);
alias Inf = typeof(inf);
static assert(isInfinite!Inf);
static assert(hasSlicing!Inf);
// test overflow
assert(inf.front == tuple(T.max, 42));
inf.popFront();
assert(inf.front == tuple(T.min, 42));
// test slicing
inf = inf[42 .. $];
assert(inf.front == tuple(T.min + 42, 42));
auto window = inf[0 .. 2];
assert(window.length == 1);
assert(window.front == inf.front);
window.popFront();
assert(window.empty);
}
}
pure @safe unittest
{
import std.algorithm : equal;
static immutable int[] values = [0, 1, 2, 3, 4];
foreach (T; AliasSeq!(ubyte, ushort, uint, ulong))
{
auto enumerated = values.enumerate!T();
static assert(is(typeof(enumerated.front.index) == T));
assert(enumerated.equal(values[].zip(values)));
foreach (T i; 0 .. 5)
{
auto subset = values[cast(size_t)i .. $];
auto offsetEnumerated = subset.enumerate(i);
static assert(is(typeof(enumerated.front.index) == T));
assert(offsetEnumerated.equal(subset.zip(subset)));
}
}
}
version(none) // @@@BUG@@@ 10939
{
// Re-enable (or remove) if 10939 is resolved.
/+pure+/ unittest // Impure because of std.conv.to
{
import std.exception : assertNotThrown, assertThrown;
import core.exception : RangeError;
static immutable values = [42];
static struct SignedLengthRange
{
immutable(int)[] _values = values;
int front() @property { assert(false); }
bool empty() @property { assert(false); }
void popFront() { assert(false); }
int length() @property
{
return cast(int)_values.length;
}
}
SignedLengthRange svalues;
foreach (Enumerator; AliasSeq!(ubyte, byte, ushort, short, uint, int, ulong, long))
{
assertThrown!RangeError(values[].enumerate!Enumerator(Enumerator.max));
assertNotThrown!RangeError(values[].enumerate!Enumerator(Enumerator.max - values.length));
assertThrown!RangeError(values[].enumerate!Enumerator(Enumerator.max - values.length + 1));
assertThrown!RangeError(svalues.enumerate!Enumerator(Enumerator.max));
assertNotThrown!RangeError(svalues.enumerate!Enumerator(Enumerator.max - values.length));
assertThrown!RangeError(svalues.enumerate!Enumerator(Enumerator.max - values.length + 1));
}
foreach (Enumerator; AliasSeq!(byte, short, int))
{
assertThrown!RangeError(repeat(0, uint.max).enumerate!Enumerator());
}
assertNotThrown!RangeError(repeat(0, uint.max).enumerate!long());
}
}
/**
Returns true if $(D fn) accepts variables of type T1 and T2 in any order.
The following code should compile:
---
T1 foo();
T2 bar();
fn(foo(), bar());
fn(bar(), foo());
---
*/
template isTwoWayCompatible(alias fn, T1, T2)
{
enum isTwoWayCompatible = is(typeof( (){
T1 foo();
T2 bar();
fn(foo(), bar());
fn(bar(), foo());
}
));
}
/**
Policy used with the searching primitives $(D lowerBound), $(D
upperBound), and $(D equalRange) of $(LREF SortedRange) below.
*/
enum SearchPolicy
{
/**
Searches in a linear fashion.
*/
linear,
/**
Searches with a step that is grows linearly (1, 2, 3,...)
leading to a quadratic search schedule (indexes tried are 0, 1,
3, 6, 10, 15, 21, 28,...) Once the search overshoots its target,
the remaining interval is searched using binary search. The
search is completed in $(BIGOH sqrt(n)) time. Use it when you
are reasonably confident that the value is around the beginning
of the range.
*/
trot,
/**
Performs a $(LUCKY galloping search algorithm), i.e. searches
with a step that doubles every time, (1, 2, 4, 8, ...) leading
to an exponential search schedule (indexes tried are 0, 1, 3,
7, 15, 31, 63,...) Once the search overshoots its target, the
remaining interval is searched using binary search. A value is
found in $(BIGOH log(n)) time.
*/
gallop,
/**
Searches using a classic interval halving policy. The search
starts in the middle of the range, and each search step cuts
the range in half. This policy finds a value in $(BIGOH log(n))
time but is less cache friendly than $(D gallop) for large
ranges. The $(D binarySearch) policy is used as the last step
of $(D trot), $(D gallop), $(D trotBackwards), and $(D
gallopBackwards) strategies.
*/
binarySearch,
/**
Similar to $(D trot) but starts backwards. Use it when
confident that the value is around the end of the range.
*/
trotBackwards,
/**
Similar to $(D gallop) but starts backwards. Use it when
confident that the value is around the end of the range.
*/
gallopBackwards
}
/**
Represents a sorted range. In addition to the regular range
primitives, supports additional operations that take advantage of the
ordering, such as merge and binary search. To obtain a $(D
SortedRange) from an unsorted range $(D r), use
$(XREF_PACK algorithm,sorting,sort) which sorts $(D r) in place and returns the
corresponding $(D SortedRange). To construct a $(D SortedRange) from a range
$(D r) that is known to be already sorted, use $(LREF assumeSorted) described
below.
*/
struct SortedRange(Range, alias pred = "a < b")
if (isInputRange!Range)
{
private import std.functional : binaryFun;
private alias predFun = binaryFun!pred;
private bool geq(L, R)(L lhs, R rhs)
{
return !predFun(lhs, rhs);
}
private bool gt(L, R)(L lhs, R rhs)
{
return predFun(rhs, lhs);
}
private Range _input;
// Undocummented because a clearer way to invoke is by calling
// assumeSorted.
this(Range input)
out
{
// moved out of the body as a workaround for Issue 12661
dbgVerifySorted();
}
body
{
this._input = input;
}
// Assertion only.
private void dbgVerifySorted()
{
if (!__ctfe)
debug
{
static if (isRandomAccessRange!Range)
{
import core.bitop : bsr;
import std.algorithm : isSorted;
// Check the sortedness of the input
if (this._input.length < 2) return;
immutable size_t msb = bsr(this._input.length) + 1;
assert(msb > 0 && msb <= this._input.length);
immutable step = this._input.length / msb;
auto st = stride(this._input, step);
assert(isSorted!pred(st), "Range is not sorted");
}
}
}
/// Range primitives.
@property bool empty() //const
{
return this._input.empty;
}
/// Ditto
static if (isForwardRange!Range)
@property auto save()
{
// Avoid the constructor
typeof(this) result = this;
result._input = _input.save;
return result;
}
/// Ditto
@property auto ref front()
{
return _input.front;
}
/// Ditto
void popFront()
{
_input.popFront();
}
/// Ditto
static if (isBidirectionalRange!Range)
{
@property auto ref back()
{
return _input.back;
}
/// Ditto
void popBack()
{
_input.popBack();
}
}
/// Ditto
static if (isRandomAccessRange!Range)
auto ref opIndex(size_t i)
{
return _input[i];
}
/// Ditto
static if (hasSlicing!Range)
auto opSlice(size_t a, size_t b)
{
assert(a <= b);
typeof(this) result = this;
result._input = _input[a .. b];// skip checking
return result;
}
/// Ditto
static if (hasLength!Range)
{
@property size_t length() //const
{
return _input.length;
}
alias opDollar = length;
}
/**
Releases the controlled range and returns it.
*/
auto release()
{
import std.algorithm : move;
return move(_input);
}
// Assuming a predicate "test" that returns 0 for a left portion
// of the range and then 1 for the rest, returns the index at
// which the first 1 appears. Used internally by the search routines.
private size_t getTransitionIndex(SearchPolicy sp, alias test, V)(V v)
if (sp == SearchPolicy.binarySearch && isRandomAccessRange!Range)
{
size_t first = 0, count = _input.length;
while (count > 0)
{
immutable step = count / 2, it = first + step;
if (!test(_input[it], v))
{
first = it + 1;
count -= step + 1;
}
else
{
count = step;
}
}
return first;
}
// Specialization for trot and gallop
private size_t getTransitionIndex(SearchPolicy sp, alias test, V)(V v)
if ((sp == SearchPolicy.trot || sp == SearchPolicy.gallop)
&& isRandomAccessRange!Range)
{
if (empty || test(front, v)) return 0;
immutable count = length;
if (count == 1) return 1;
size_t below = 0, above = 1, step = 2;
while (!test(_input[above], v))
{
// Still too small, update below and increase gait
below = above;
immutable next = above + step;
if (next >= count)
{
// Overshot - the next step took us beyond the end. So
// now adjust next and simply exit the loop to do the
// binary search thingie.
above = count;
break;
}
// Still in business, increase step and continue
above = next;
static if (sp == SearchPolicy.trot)
++step;
else
step <<= 1;
}
return below + this[below .. above].getTransitionIndex!(
SearchPolicy.binarySearch, test, V)(v);
}
// Specialization for trotBackwards and gallopBackwards
private size_t getTransitionIndex(SearchPolicy sp, alias test, V)(V v)
if ((sp == SearchPolicy.trotBackwards || sp == SearchPolicy.gallopBackwards)
&& isRandomAccessRange!Range)
{
immutable count = length;
if (empty || !test(back, v)) return count;
if (count == 1) return 0;
size_t below = count - 2, above = count - 1, step = 2;
while (test(_input[below], v))
{
// Still too large, update above and increase gait
above = below;
if (below < step)
{
// Overshot - the next step took us beyond the end. So
// now adjust next and simply fall through to do the
// binary search thingie.
below = 0;
break;
}
// Still in business, increase step and continue
below -= step;
static if (sp == SearchPolicy.trot)
++step;
else
step <<= 1;
}
return below + this[below .. above].getTransitionIndex!(
SearchPolicy.binarySearch, test, V)(v);
}
// lowerBound
/**
This function uses a search with policy $(D sp) to find the
largest left subrange on which $(D pred(x, value)) is $(D true) for
all $(D x) (e.g., if $(D pred) is "less than", returns the portion of
the range with elements strictly smaller than $(D value)). The search
schedule and its complexity are documented in
$(LREF SearchPolicy). See also STL's
$(WEB sgi.com/tech/stl/lower_bound.html, lower_bound).
*/
auto lowerBound(SearchPolicy sp = SearchPolicy.binarySearch, V)(V value)
if (isTwoWayCompatible!(predFun, ElementType!Range, V)
&& hasSlicing!Range)
{
return this[0 .. getTransitionIndex!(sp, geq)(value)];
}
///
unittest
{
import std.algorithm: equal;
auto a = assumeSorted([ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 ]);
auto p = a.lowerBound(4);
assert(equal(p, [ 0, 1, 2, 3 ]));
}
// upperBound
/**
This function searches with policy $(D sp) to find the largest right
subrange on which $(D pred(value, x)) is $(D true) for all $(D x)
(e.g., if $(D pred) is "less than", returns the portion of the range
with elements strictly greater than $(D value)). The search schedule
and its complexity are documented in $(LREF SearchPolicy).
For ranges that do not offer random access, $(D SearchPolicy.linear)
is the only policy allowed (and it must be specified explicitly lest it exposes
user code to unexpected inefficiencies). For random-access searches, all
policies are allowed, and $(D SearchPolicy.binarySearch) is the default.
See_Also: STL's $(WEB sgi.com/tech/stl/lower_bound.html,upper_bound).
*/
auto upperBound(SearchPolicy sp = SearchPolicy.binarySearch, V)(V value)
if (isTwoWayCompatible!(predFun, ElementType!Range, V))
{
static assert(hasSlicing!Range || sp == SearchPolicy.linear,
"Specify SearchPolicy.linear explicitly for "
~ typeof(this).stringof);
static if (sp == SearchPolicy.linear)
{
for (; !_input.empty && !predFun(value, _input.front);
_input.popFront())
{
}
return this;
}
else
{
return this[getTransitionIndex!(sp, gt)(value) .. length];
}
}
///
unittest
{
import std.algorithm: equal;
auto a = assumeSorted([ 1, 2, 3, 3, 3, 4, 4, 5, 6 ]);
auto p = a.upperBound(3);
assert(equal(p, [4, 4, 5, 6]));
}
// equalRange
/**
Returns the subrange containing all elements $(D e) for which both $(D
pred(e, value)) and $(D pred(value, e)) evaluate to $(D false) (e.g.,
if $(D pred) is "less than", returns the portion of the range with
elements equal to $(D value)). Uses a classic binary search with
interval halving until it finds a value that satisfies the condition,
then uses $(D SearchPolicy.gallopBackwards) to find the left boundary
and $(D SearchPolicy.gallop) to find the right boundary. These
policies are justified by the fact that the two boundaries are likely
to be near the first found value (i.e., equal ranges are relatively
small). Completes the entire search in $(BIGOH log(n)) time. See also
STL's $(WEB sgi.com/tech/stl/equal_range.html, equal_range).
*/
auto equalRange(V)(V value)
if (isTwoWayCompatible!(predFun, ElementType!Range, V)
&& isRandomAccessRange!Range)
{
size_t first = 0, count = _input.length;
while (count > 0)
{
immutable step = count / 2;
auto it = first + step;
if (predFun(_input[it], value))
{
// Less than value, bump left bound up
first = it + 1;
count -= step + 1;
}
else if (predFun(value, _input[it]))
{
// Greater than value, chop count
count = step;
}
else
{
// Equal to value, do binary searches in the
// leftover portions
// Gallop towards the left end as it's likely nearby
immutable left = first
+ this[first .. it]
.lowerBound!(SearchPolicy.gallopBackwards)(value).length;
first += count;
// Gallop towards the right end as it's likely nearby
immutable right = first
- this[it + 1 .. first]
.upperBound!(SearchPolicy.gallop)(value).length;
return this[left .. right];
}
}
return this.init;
}
///
unittest
{
import std.algorithm: equal;
auto a = [ 1, 2, 3, 3, 3, 4, 4, 5, 6 ];
auto r = a.assumeSorted.equalRange(3);
assert(equal(r, [ 3, 3, 3 ]));
}
// trisect
/**
Returns a tuple $(D r) such that $(D r[0]) is the same as the result
of $(D lowerBound(value)), $(D r[1]) is the same as the result of $(D
equalRange(value)), and $(D r[2]) is the same as the result of $(D
upperBound(value)). The call is faster than computing all three
separately. Uses a search schedule similar to $(D
equalRange). Completes the entire search in $(BIGOH log(n)) time.
*/
auto trisect(V)(V value)
if (isTwoWayCompatible!(predFun, ElementType!Range, V)
&& isRandomAccessRange!Range)
{
import std.typecons : tuple;
size_t first = 0, count = _input.length;
while (count > 0)
{
immutable step = count / 2;
auto it = first + step;
if (predFun(_input[it], value))
{
// Less than value, bump left bound up
first = it + 1;
count -= step + 1;
}
else if (predFun(value, _input[it]))
{
// Greater than value, chop count
count = step;
}
else
{
// Equal to value, do binary searches in the
// leftover portions
// Gallop towards the left end as it's likely nearby
immutable left = first
+ this[first .. it]
.lowerBound!(SearchPolicy.gallopBackwards)(value).length;
first += count;
// Gallop towards the right end as it's likely nearby
immutable right = first
- this[it + 1 .. first]
.upperBound!(SearchPolicy.gallop)(value).length;
return tuple(this[0 .. left], this[left .. right],
this[right .. length]);
}
}
// No equal element was found
return tuple(this[0 .. first], this.init, this[first .. length]);
}
///
unittest
{
import std.algorithm: equal;
auto a = [ 1, 2, 3, 3, 3, 4, 4, 5, 6 ];
auto r = assumeSorted(a).trisect(3);
assert(equal(r[0], [ 1, 2 ]));
assert(equal(r[1], [ 3, 3, 3 ]));
assert(equal(r[2], [ 4, 4, 5, 6 ]));
}
// contains
/**
Returns $(D true) if and only if $(D value) can be found in $(D
range), which is assumed to be sorted. Performs $(BIGOH log(r.length))
evaluations of $(D pred). See also STL's $(WEB
sgi.com/tech/stl/binary_search.html, binary_search).
*/
bool contains(V)(V value)
if (isRandomAccessRange!Range)
{
if (empty) return false;
immutable i = getTransitionIndex!(SearchPolicy.binarySearch, geq)(value);
if (i >= length) return false;
return !predFun(value, _input[i]);
}
// groupBy
/**
Returns a range of subranges of elements that are equivalent according to the
sorting relation.
*/
auto groupBy()()
{
import std.algorithm.iteration : chunkBy;
return _input.chunkBy!((a, b) => !predFun(a, b) && !predFun(b, a));
}
}
///
unittest
{
import std.algorithm : sort;
auto a = [ 1, 2, 3, 42, 52, 64 ];
auto r = assumeSorted(a);
assert(r.contains(3));
assert(!r.contains(32));
auto r1 = sort!"a > b"(a);
assert(r1.contains(3));
assert(!r1.contains(32));
assert(r1.release() == [ 64, 52, 42, 3, 2, 1 ]);
}
/**
$(D SortedRange) could accept ranges weaker than random-access, but it
is unable to provide interesting functionality for them. Therefore,
$(D SortedRange) is currently restricted to random-access ranges.
No copy of the original range is ever made. If the underlying range is
changed concurrently with its corresponding $(D SortedRange) in ways
that break its sortedness, $(D SortedRange) will work erratically.
*/
@safe unittest
{
import std.algorithm : swap;
auto a = [ 1, 2, 3, 42, 52, 64 ];
auto r = assumeSorted(a);
assert(r.contains(42));
swap(a[3], a[5]); // illegal to break sortedness of original range
assert(!r.contains(42)); // passes although it shouldn't
}
@safe unittest
{
import std.algorithm : equal;
auto a = [ 10, 20, 30, 30, 30, 40, 40, 50, 60 ];
auto r = assumeSorted(a).trisect(30);
assert(equal(r[0], [ 10, 20 ]));
assert(equal(r[1], [ 30, 30, 30 ]));
assert(equal(r[2], [ 40, 40, 50, 60 ]));
r = assumeSorted(a).trisect(35);
assert(equal(r[0], [ 10, 20, 30, 30, 30 ]));
assert(r[1].empty);
assert(equal(r[2], [ 40, 40, 50, 60 ]));
}
@safe unittest
{
import std.algorithm : equal;
auto a = [ "A", "AG", "B", "E", "F" ];
auto r = assumeSorted!"cmp(a,b) < 0"(a).trisect("B"w);
assert(equal(r[0], [ "A", "AG" ]));
assert(equal(r[1], [ "B" ]));
assert(equal(r[2], [ "E", "F" ]));
r = assumeSorted!"cmp(a,b) < 0"(a).trisect("A"d);
assert(r[0].empty);
assert(equal(r[1], [ "A" ]));
assert(equal(r[2], [ "AG", "B", "E", "F" ]));
}
@safe unittest
{
import std.algorithm : equal;
static void test(SearchPolicy pol)()
{
auto a = [ 1, 2, 3, 42, 52, 64 ];
auto r = assumeSorted(a);
assert(equal(r.lowerBound(42), [1, 2, 3]));
assert(equal(r.lowerBound!(pol)(42), [1, 2, 3]));
assert(equal(r.lowerBound!(pol)(41), [1, 2, 3]));
assert(equal(r.lowerBound!(pol)(43), [1, 2, 3, 42]));
assert(equal(r.lowerBound!(pol)(51), [1, 2, 3, 42]));
assert(equal(r.lowerBound!(pol)(3), [1, 2]));
assert(equal(r.lowerBound!(pol)(55), [1, 2, 3, 42, 52]));
assert(equal(r.lowerBound!(pol)(420), a));
assert(equal(r.lowerBound!(pol)(0), a[0 .. 0]));
assert(equal(r.upperBound!(pol)(42), [52, 64]));
assert(equal(r.upperBound!(pol)(41), [42, 52, 64]));
assert(equal(r.upperBound!(pol)(43), [52, 64]));
assert(equal(r.upperBound!(pol)(51), [52, 64]));
assert(equal(r.upperBound!(pol)(53), [64]));
assert(equal(r.upperBound!(pol)(55), [64]));
assert(equal(r.upperBound!(pol)(420), a[0 .. 0]));
assert(equal(r.upperBound!(pol)(0), a));
}
test!(SearchPolicy.trot)();
test!(SearchPolicy.gallop)();
test!(SearchPolicy.trotBackwards)();
test!(SearchPolicy.gallopBackwards)();
test!(SearchPolicy.binarySearch)();
}
@safe unittest
{
// Check for small arrays
int[] a;
auto r = assumeSorted(a);
a = [ 1 ];
r = assumeSorted(a);
a = [ 1, 2 ];
r = assumeSorted(a);
a = [ 1, 2, 3 ];
r = assumeSorted(a);
}
@safe unittest
{
import std.algorithm : swap;
auto a = [ 1, 2, 3, 42, 52, 64 ];
auto r = assumeSorted(a);
assert(r.contains(42));
swap(a[3], a[5]); // illegal to break sortedness of original range
assert(!r.contains(42)); // passes although it shouldn't
}
@safe unittest
{
immutable(int)[] arr = [ 1, 2, 3 ];
auto s = assumeSorted(arr);
}
unittest
{
import std.algorithm.comparison : equal;
int[] arr = [100, 101, 102, 200, 201, 300];
auto s = assumeSorted!((a, b) => a / 100 < b / 100)(arr);
assert(s.groupBy.equal!equal([[100, 101, 102], [200, 201], [300]]));
}
// Test on an input range
unittest
{
import std.stdio, std.file, std.path, std.conv, std.uuid;
auto name = buildPath(tempDir(), "test.std.range.line-" ~ text(__LINE__) ~
"." ~ randomUUID().toString());
auto f = File(name, "w");
scope(exit) if (exists(name)) remove(name);
// write a sorted range of lines to the file
f.write("abc\ndef\nghi\njkl");
f.close();
f.open(name, "r");
auto r = assumeSorted(f.byLine());
auto r1 = r.upperBound!(SearchPolicy.linear)("def");
assert(r1.front == "ghi", r1.front);
f.close();
}
/**
Assumes $(D r) is sorted by predicate $(D pred) and returns the
corresponding $(D SortedRange!(pred, R)) having $(D r) as support. To
keep the checking costs low, the cost is $(BIGOH 1) in release mode
(no checks for sortedness are performed). In debug mode, a few random
elements of $(D r) are checked for sortedness. The size of the sample
is proportional $(BIGOH log(r.length)). That way, checking has no
effect on the complexity of subsequent operations specific to sorted
ranges (such as binary search). The probability of an arbitrary
unsorted range failing the test is very high (however, an
almost-sorted range is likely to pass it). To check for sortedness at
cost $(BIGOH n), use $(XREF_PACK algorithm,sorting,isSorted).
*/
auto assumeSorted(alias pred = "a < b", R)(R r)
if (isInputRange!(Unqual!R))
{
return SortedRange!(Unqual!R, pred)(r);
}
@safe unittest
{
import std.algorithm : equal;
static assert(isRandomAccessRange!(SortedRange!(int[])));
int[] a = [ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 ];
auto p = assumeSorted(a).lowerBound(4);
assert(equal(p, [0, 1, 2, 3]));
p = assumeSorted(a).lowerBound(5);
assert(equal(p, [0, 1, 2, 3, 4]));
p = assumeSorted(a).lowerBound(6);
assert(equal(p, [ 0, 1, 2, 3, 4, 5]));
p = assumeSorted(a).lowerBound(6.9);
assert(equal(p, [ 0, 1, 2, 3, 4, 5, 6]));
}
@safe unittest
{
import std.algorithm : equal;
int[] a = [ 1, 2, 3, 3, 3, 4, 4, 5, 6 ];
auto p = assumeSorted(a).upperBound(3);
assert(equal(p, [4, 4, 5, 6 ]));
p = assumeSorted(a).upperBound(4.2);
assert(equal(p, [ 5, 6 ]));
}
@safe unittest
{
import std.conv : text;
import std.algorithm : equal;
int[] a = [ 1, 2, 3, 3, 3, 4, 4, 5, 6 ];
auto p = assumeSorted(a).equalRange(3);
assert(equal(p, [ 3, 3, 3 ]), text(p));
p = assumeSorted(a).equalRange(4);
assert(equal(p, [ 4, 4 ]), text(p));
p = assumeSorted(a).equalRange(2);
assert(equal(p, [ 2 ]));
p = assumeSorted(a).equalRange(0);
assert(p.empty);
p = assumeSorted(a).equalRange(7);
assert(p.empty);
p = assumeSorted(a).equalRange(3.0);
assert(equal(p, [ 3, 3, 3]));
}
@safe unittest
{
int[] a = [ 1, 2, 3, 3, 3, 4, 4, 5, 6 ];
if (a.length)
{
auto b = a[a.length / 2];
//auto r = sort(a);
//assert(r.contains(b));
}
}
@safe unittest
{
auto a = [ 5, 7, 34, 345, 677 ];
auto r = assumeSorted(a);
a = null;
r = assumeSorted(a);
a = [ 1 ];
r = assumeSorted(a);
}
unittest
{
bool ok = true;
try
{
auto r2 = assumeSorted([ 677, 345, 34, 7, 5 ]);
debug ok = false;
}
catch (Throwable)
{
}
assert(ok);
}
// issue 15003
@nogc unittest
{
static immutable a = [1, 2, 3, 4];
auto r = a.assumeSorted;
}
/++
Wrapper which effectively makes it possible to pass a range by reference.
Both the original range and the RefRange will always have the exact same
elements. Any operation done on one will affect the other. So, for instance,
if it's passed to a function which would implicitly copy the original range
if it were passed to it, the original range is $(I not) copied but is
consumed as if it were a reference type.
Note that $(D save) works as normal and operates on a new range, so if
$(D save) is ever called on the RefRange, then no operations on the saved
range will affect the original.
+/
struct RefRange(R)
if (isInputRange!R)
{
public:
/++ +/
this(R* range) @safe pure nothrow
{
_range = range;
}
/++
This does not assign the pointer of $(D rhs) to this $(D RefRange).
Rather it assigns the range pointed to by $(D rhs) to the range pointed
to by this $(D RefRange). This is because $(I any) operation on a
$(D RefRange) is the same is if it occurred to the original range. The
one exception is when a $(D RefRange) is assigned $(D null) either
directly or because $(D rhs) is $(D null). In that case, $(D RefRange)
no longer refers to the original range but is $(D null).
+/
auto opAssign(RefRange rhs)
{
if (_range && rhs._range)
*_range = *rhs._range;
else
_range = rhs._range;
return this;
}
/++ +/
auto opAssign(typeof(null) rhs)
{
_range = null;
}
/++
A pointer to the wrapped range.
+/
@property inout(R*) ptr() @safe inout pure nothrow
{
return _range;
}
version(StdDdoc)
{
/++ +/
@property auto front() {assert(0);}
/++ Ditto +/
@property auto front() const {assert(0);}
/++ Ditto +/
@property auto front(ElementType!R value) {assert(0);}
}
else
{
@property auto front()
{
return (*_range).front;
}
static if (is(typeof((*(cast(const R*)_range)).front))) @property auto front() const
{
return (*_range).front;
}
static if (is(typeof((*_range).front = (*_range).front))) @property auto front(ElementType!R value)
{
return (*_range).front = value;
}
}
version(StdDdoc)
{
@property bool empty(); ///
@property bool empty() const; ///Ditto
}
else static if (isInfinite!R)
enum empty = false;
else
{
@property bool empty()
{
return (*_range).empty;
}
static if (is(typeof((*cast(const R*)_range).empty))) @property bool empty() const
{
return (*_range).empty;
}
}
/++ +/
void popFront()
{
return (*_range).popFront();
}
version(StdDdoc)
{
/++
Only defined if $(D isForwardRange!R) is $(D true).
+/
@property auto save() {assert(0);}
/++ Ditto +/
@property auto save() const {assert(0);}
/++ Ditto +/
auto opSlice() {assert(0);}
/++ Ditto +/
auto opSlice() const {assert(0);}
}
else static if (isForwardRange!R)
{
static if (isSafe!((R* r) => (*r).save))
{
@property auto save() @trusted
{
mixin(_genSave());
}
static if (is(typeof((*cast(const R*)_range).save))) @property auto save() @trusted const
{
mixin(_genSave());
}
}
else
{
@property auto save()
{
mixin(_genSave());
}
static if (is(typeof((*cast(const R*)_range).save))) @property auto save() const
{
mixin(_genSave());
}
}
auto opSlice()()
{
return save;
}
auto opSlice()() const
{
return save;
}
private static string _genSave() @safe pure nothrow
{
return `import std.conv;` ~
`alias S = typeof((*_range).save);` ~
`static assert(isForwardRange!S, S.stringof ~ " is not a forward range.");` ~
`auto mem = new void[S.sizeof];` ~
`emplace!S(mem, cast(S)(*_range).save);` ~
`return RefRange!S(cast(S*)mem.ptr);`;
}
static assert(isForwardRange!RefRange);
}
version(StdDdoc)
{
/++
Only defined if $(D isBidirectionalRange!R) is $(D true).
+/
@property auto back() {assert(0);}
/++ Ditto +/
@property auto back() const {assert(0);}
/++ Ditto +/
@property auto back(ElementType!R value) {assert(0);}
}
else static if (isBidirectionalRange!R)
{
@property auto back()
{
return (*_range).back;
}
static if (is(typeof((*(cast(const R*)_range)).back))) @property auto back() const
{
return (*_range).back;
}
static if (is(typeof((*_range).back = (*_range).back))) @property auto back(ElementType!R value)
{
return (*_range).back = value;
}
}
/++ Ditto +/
static if (isBidirectionalRange!R) void popBack()
{
return (*_range).popBack();
}
version(StdDdoc)
{
/++
Only defined if $(D isRandomAccesRange!R) is $(D true).
+/
auto ref opIndex(IndexType)(IndexType index) {assert(0);}
/++ Ditto +/
auto ref opIndex(IndexType)(IndexType index) const {assert(0);}
}
else static if (isRandomAccessRange!R)
{
auto ref opIndex(IndexType)(IndexType index)
if (is(typeof((*_range)[index])))
{
return (*_range)[index];
}
auto ref opIndex(IndexType)(IndexType index) const
if (is(typeof((*cast(const R*)_range)[index])))
{
return (*_range)[index];
}
}
/++
Only defined if $(D hasMobileElements!R) and $(D isForwardRange!R) are
$(D true).
+/
static if (hasMobileElements!R && isForwardRange!R) auto moveFront()
{
return (*_range).moveFront();
}
/++
Only defined if $(D hasMobileElements!R) and $(D isBidirectionalRange!R)
are $(D true).
+/
static if (hasMobileElements!R && isBidirectionalRange!R) auto moveBack()
{
return (*_range).moveBack();
}
/++
Only defined if $(D hasMobileElements!R) and $(D isRandomAccessRange!R)
are $(D true).
+/
static if (hasMobileElements!R && isRandomAccessRange!R) auto moveAt(size_t index)
{
return (*_range).moveAt(index);
}
version(StdDdoc)
{
/++
Only defined if $(D hasLength!R) is $(D true).
+/
@property auto length() {assert(0);}
/++ Ditto +/
@property auto length() const {assert(0);}
}
else static if (hasLength!R)
{
@property auto length()
{
return (*_range).length;
}
static if (is(typeof((*cast(const R*)_range).length))) @property auto length() const
{
return (*_range).length;
}
}
version(StdDdoc)
{
/++
Only defined if $(D hasSlicing!R) is $(D true).
+/
auto opSlice(IndexType1, IndexType2)
(IndexType1 begin, IndexType2 end) {assert(0);}
/++ Ditto +/
auto opSlice(IndexType1, IndexType2)
(IndexType1 begin, IndexType2 end) const {assert(0);}
}
else static if (hasSlicing!R)
{
auto opSlice(IndexType1, IndexType2)
(IndexType1 begin, IndexType2 end)
if (is(typeof((*_range)[begin .. end])))
{
mixin(_genOpSlice());
}
auto opSlice(IndexType1, IndexType2)
(IndexType1 begin, IndexType2 end) const
if (is(typeof((*cast(const R*)_range)[begin .. end])))
{
mixin(_genOpSlice());
}
private static string _genOpSlice() @safe pure nothrow
{
return `import std.conv;` ~
`alias S = typeof((*_range)[begin .. end]);` ~
`static assert(hasSlicing!S, S.stringof ~ " is not sliceable.");` ~
`auto mem = new void[S.sizeof];` ~
`emplace!S(mem, cast(S)(*_range)[begin .. end]);` ~
`return RefRange!S(cast(S*)mem.ptr);`;
}
}
private:
R* _range;
}
/// Basic Example
unittest
{
import std.algorithm;
ubyte[] buffer = [1, 9, 45, 12, 22];
auto found1 = find(buffer, 45);
assert(found1 == [45, 12, 22]);
assert(buffer == [1, 9, 45, 12, 22]);
auto wrapped1 = refRange(&buffer);
auto found2 = find(wrapped1, 45);
assert(*found2.ptr == [45, 12, 22]);
assert(buffer == [45, 12, 22]);
auto found3 = find(wrapped1.save, 22);
assert(*found3.ptr == [22]);
assert(buffer == [45, 12, 22]);
string str = "hello world";
auto wrappedStr = refRange(&str);
assert(str.front == 'h');
str.popFrontN(5);
assert(str == " world");
assert(wrappedStr.front == ' ');
assert(*wrappedStr.ptr == " world");
}
/// opAssign Example.
unittest
{
ubyte[] buffer1 = [1, 2, 3, 4, 5];
ubyte[] buffer2 = [6, 7, 8, 9, 10];
auto wrapped1 = refRange(&buffer1);
auto wrapped2 = refRange(&buffer2);
assert(wrapped1.ptr is &buffer1);
assert(wrapped2.ptr is &buffer2);
assert(wrapped1.ptr !is wrapped2.ptr);
assert(buffer1 != buffer2);
wrapped1 = wrapped2;
//Everything points to the same stuff as before.
assert(wrapped1.ptr is &buffer1);
assert(wrapped2.ptr is &buffer2);
assert(wrapped1.ptr !is wrapped2.ptr);
//But buffer1 has changed due to the assignment.
assert(buffer1 == [6, 7, 8, 9, 10]);
assert(buffer2 == [6, 7, 8, 9, 10]);
buffer2 = [11, 12, 13, 14, 15];
//Everything points to the same stuff as before.
assert(wrapped1.ptr is &buffer1);
assert(wrapped2.ptr is &buffer2);
assert(wrapped1.ptr !is wrapped2.ptr);
//But buffer2 has changed due to the assignment.
assert(buffer1 == [6, 7, 8, 9, 10]);
assert(buffer2 == [11, 12, 13, 14, 15]);
wrapped2 = null;
//The pointer changed for wrapped2 but not wrapped1.
assert(wrapped1.ptr is &buffer1);
assert(wrapped2.ptr is null);
assert(wrapped1.ptr !is wrapped2.ptr);
//buffer2 is not affected by the assignment.
assert(buffer1 == [6, 7, 8, 9, 10]);
assert(buffer2 == [11, 12, 13, 14, 15]);
}
unittest
{
import std.algorithm;
{
ubyte[] buffer = [1, 2, 3, 4, 5];
auto wrapper = refRange(&buffer);
auto p = wrapper.ptr;
auto f = wrapper.front;
wrapper.front = f;
auto e = wrapper.empty;
wrapper.popFront();
auto s = wrapper.save;
auto b = wrapper.back;
wrapper.back = b;
wrapper.popBack();
auto i = wrapper[0];
wrapper.moveFront();
wrapper.moveBack();
wrapper.moveAt(0);
auto l = wrapper.length;
auto sl = wrapper[0 .. 1];
}
{
ubyte[] buffer = [1, 2, 3, 4, 5];
const wrapper = refRange(&buffer);
const p = wrapper.ptr;
const f = wrapper.front;
const e = wrapper.empty;
const s = wrapper.save;
const b = wrapper.back;
const i = wrapper[0];
const l = wrapper.length;
const sl = wrapper[0 .. 1];
}
{
ubyte[] buffer = [1, 2, 3, 4, 5];
auto filtered = filter!"true"(buffer);
auto wrapper = refRange(&filtered);
auto p = wrapper.ptr;
auto f = wrapper.front;
wrapper.front = f;
auto e = wrapper.empty;
wrapper.popFront();
auto s = wrapper.save;
wrapper.moveFront();
}
{
ubyte[] buffer = [1, 2, 3, 4, 5];
auto filtered = filter!"true"(buffer);
const wrapper = refRange(&filtered);
const p = wrapper.ptr;
//Cannot currently be const. filter needs to be updated to handle const.
/+
const f = wrapper.front;
const e = wrapper.empty;
const s = wrapper.save;
+/
}
{
string str = "hello world";
auto wrapper = refRange(&str);
auto p = wrapper.ptr;
auto f = wrapper.front;
auto e = wrapper.empty;
wrapper.popFront();
auto s = wrapper.save;
auto b = wrapper.back;
wrapper.popBack();
}
}
//Test assignment.
unittest
{
ubyte[] buffer1 = [1, 2, 3, 4, 5];
ubyte[] buffer2 = [6, 7, 8, 9, 10];
RefRange!(ubyte[]) wrapper1;
RefRange!(ubyte[]) wrapper2 = refRange(&buffer2);
assert(wrapper1.ptr is null);
assert(wrapper2.ptr is &buffer2);
wrapper1 = refRange(&buffer1);
assert(wrapper1.ptr is &buffer1);
wrapper1 = wrapper2;
assert(wrapper1.ptr is &buffer1);
assert(buffer1 == buffer2);
wrapper1 = RefRange!(ubyte[]).init;
assert(wrapper1.ptr is null);
assert(wrapper2.ptr is &buffer2);
assert(buffer1 == buffer2);
assert(buffer1 == [6, 7, 8, 9, 10]);
wrapper2 = null;
assert(wrapper2.ptr is null);
assert(buffer2 == [6, 7, 8, 9, 10]);
}
unittest
{
import std.algorithm;
//Test that ranges are properly consumed.
{
int[] arr = [1, 42, 2, 41, 3, 40, 4, 42, 9];
auto wrapper = refRange(&arr);
assert(*find(wrapper, 41).ptr == [41, 3, 40, 4, 42, 9]);
assert(arr == [41, 3, 40, 4, 42, 9]);
assert(*drop(wrapper, 2).ptr == [40, 4, 42, 9]);
assert(arr == [40, 4, 42, 9]);
assert(equal(until(wrapper, 42), [40, 4]));
assert(arr == [42, 9]);
assert(find(wrapper, 12).empty);
assert(arr.empty);
}
{
string str = "Hello, world-like object.";
auto wrapper = refRange(&str);
assert(*find(wrapper, "l").ptr == "llo, world-like object.");
assert(str == "llo, world-like object.");
assert(equal(take(wrapper, 5), "llo, "));
assert(str == "world-like object.");
}
//Test that operating on saved ranges does not consume the original.
{
int[] arr = [1, 42, 2, 41, 3, 40, 4, 42, 9];
auto wrapper = refRange(&arr);
auto saved = wrapper.save;
saved.popFrontN(3);
assert(*saved.ptr == [41, 3, 40, 4, 42, 9]);
assert(arr == [1, 42, 2, 41, 3, 40, 4, 42, 9]);
}
{
string str = "Hello, world-like object.";
auto wrapper = refRange(&str);
auto saved = wrapper.save;
saved.popFrontN(13);
assert(*saved.ptr == "like object.");
assert(str == "Hello, world-like object.");
}
//Test that functions which use save work properly.
{
int[] arr = [1, 42];
auto wrapper = refRange(&arr);
assert(equal(commonPrefix(wrapper, [1, 27]), [1]));
}
{
int[] arr = [4, 5, 6, 7, 1, 2, 3];
auto wrapper = refRange(&arr);
assert(bringToFront(wrapper[0 .. 4], wrapper[4 .. arr.length]) == 3);
assert(arr == [1, 2, 3, 4, 5, 6, 7]);
}
//Test bidirectional functions.
{
int[] arr = [1, 42, 2, 41, 3, 40, 4, 42, 9];
auto wrapper = refRange(&arr);
assert(wrapper.back == 9);
assert(arr == [1, 42, 2, 41, 3, 40, 4, 42, 9]);
wrapper.popBack();
assert(arr == [1, 42, 2, 41, 3, 40, 4, 42]);
}
{
string str = "Hello, world-like object.";
auto wrapper = refRange(&str);
assert(wrapper.back == '.');
assert(str == "Hello, world-like object.");
wrapper.popBack();
assert(str == "Hello, world-like object");
}
//Test random access functions.
{
int[] arr = [1, 42, 2, 41, 3, 40, 4, 42, 9];
auto wrapper = refRange(&arr);
assert(wrapper[2] == 2);
assert(arr == [1, 42, 2, 41, 3, 40, 4, 42, 9]);
assert(*wrapper[3 .. 6].ptr != null, [41, 3, 40]);
assert(arr == [1, 42, 2, 41, 3, 40, 4, 42, 9]);
}
//Test move functions.
{
int[] arr = [1, 42, 2, 41, 3, 40, 4, 42, 9];
auto wrapper = refRange(&arr);
auto t1 = wrapper.moveFront();
auto t2 = wrapper.moveBack();
wrapper.front = t2;
wrapper.back = t1;
assert(arr == [9, 42, 2, 41, 3, 40, 4, 42, 1]);
sort(wrapper.save);
assert(arr == [1, 2, 3, 4, 9, 40, 41, 42, 42]);
}
}
unittest
{
struct S
{
@property int front() @safe const pure nothrow { return 0; }
enum bool empty = false;
void popFront() @safe pure nothrow { }
@property auto save() @safe pure nothrow { return this; }
}
S s;
auto wrapper = refRange(&s);
static assert(isInfinite!(typeof(wrapper)));
}
unittest
{
class C
{
@property int front() @safe const pure nothrow { return 0; }
@property bool empty() @safe const pure nothrow { return false; }
void popFront() @safe pure nothrow { }
@property auto save() @safe pure nothrow { return this; }
}
static assert(isForwardRange!C);
auto c = new C;
auto cWrapper = refRange(&c);
static assert(is(typeof(cWrapper) == C));
assert(cWrapper is c);
}
unittest // issue 14373
{
static struct R
{
@property int front() {return 0;}
void popFront() {empty = true;}
bool empty = false;
}
R r;
refRange(&r).popFront();
assert(r.empty);
}
unittest // issue 14575
{
struct R
{
Object front;
alias back = front;
bool empty = false;
void popFront() {empty = true;}
alias popBack = popFront;
@property R save() {return this;}
}
static assert(isBidirectionalRange!R);
R r;
auto rr = refRange(&r);
struct R2
{
@property Object front() {return null;}
@property const(Object) front() const {return null;}
alias back = front;
bool empty = false;
void popFront() {empty = true;}
alias popBack = popFront;
@property R2 save() {return this;}
}
static assert(isBidirectionalRange!R2);
R2 r2;
auto rr2 = refRange(&r2);
}
/++
Helper function for constructing a $(LREF RefRange).
If the given range is a class type (and thus is already a reference type),
then the original range is returned rather than a $(LREF RefRange).
+/
auto refRange(R)(R* range)
if (isInputRange!R && !is(R == class))
{
return RefRange!R(range);
}
/// ditto
auto refRange(R)(R* range)
if (isInputRange!R && is(R == class))
{
return *range;
}
/*****************************************************************************/
@safe unittest // bug 9060
{
import std.algorithm : map, joiner, group, until;
// fix for std.algorithm
auto r = map!(x => 0)([1]);
chain(r, r);
zip(r, r);
roundRobin(r, r);
struct NRAR {
typeof(r) input;
@property empty() { return input.empty; }
@property front() { return input.front; }
void popFront() { input.popFront(); }
@property save() { return NRAR(input.save); }
}
auto n1 = NRAR(r);
cycle(n1); // non random access range version
assumeSorted(r);
// fix for std.range
joiner([r], [9]);
struct NRAR2 {
NRAR input;
@property empty() { return true; }
@property front() { return input; }
void popFront() { }
@property save() { return NRAR2(input.save); }
}
auto n2 = NRAR2(n1);
joiner(n2);
group(r);
until(r, 7);
static void foo(R)(R r) { until!(x => x > 7)(r); }
foo(r);
}
/*********************************
* An OutputRange that discards the data it receives.
*/
struct NullSink
{
void put(E)(E){}
}
///
@safe unittest
{
import std.algorithm : map, copy;
[4, 5, 6].map!(x => x * 2).copy(NullSink()); // data is discarded
}
/++
Implements a "tee" style pipe, wrapping an input range so that elements of the
range can be passed to a provided function or $(LREF OutputRange) as they are
iterated over. This is useful for printing out intermediate values in a long
chain of range code, performing some operation with side-effects on each call
to $(D front) or $(D popFront), or diverting the elements of a range into an
auxiliary $(LREF OutputRange).
It is important to note that as the resultant range is evaluated lazily,
in the case of the version of $(D tee) that takes a function, the function
will not actually be executed until the range is "walked" using functions
that evaluate ranges, such as $(XREF array,array) or
$(XREF_PACK algorithm,iteration,fold).
Params:
pipeOnPop = If `Yes.pipeOnPop`, simply iterating the range without ever
calling `front` is enough to have `tee` mirror elements to `outputRange` (or,
respectively, `fun`). If `No.pipeOnPop`, only elements for which `front` does
get called will be also sent to `outputRange`/`fun`.
inputRange = The input range beeing passed through.
outputRange = This range will receive elements of `inputRange` progressively
as iteration proceeds.
fun = This function will be called with elements of `inputRange`
progressively as iteration proceeds.
Returns:
An input range that offers the elements of `inputRange`. Regardless of
whether `inputRange` is a more powerful range (forward, bidirectional etc),
the result is always an input range. Reading this causes `inputRange` to be
iterated and returns its elements in turn. In addition, the same elements
will be passed to `outputRange` or `fun` as well.
See_Also: $(XREF_PACK algorithm,iteration,each)
+/
auto tee(Flag!"pipeOnPop" pipeOnPop = Yes.pipeOnPop, R1, R2)(R1 inputRange, R2 outputRange)
if (isInputRange!R1 && isOutputRange!(R2, ElementType!R1))
{
static struct Result
{
private R1 _input;
private R2 _output;
static if (!pipeOnPop)
{
private bool _frontAccessed;
}
static if (hasLength!R1)
{
@property auto length()
{
return _input.length;
}
}
static if (isInfinite!R1)
{
enum bool empty = false;
}
else
{
@property bool empty() { return _input.empty; }
}
void popFront()
{
assert(!_input.empty);
static if (pipeOnPop)
{
put(_output, _input.front);
}
else
{
_frontAccessed = false;
}
_input.popFront();
}
@property auto ref front()
{
static if (!pipeOnPop)
{
if (!_frontAccessed)
{
_frontAccessed = true;
put(_output, _input.front);
}
}
return _input.front;
}
}
return Result(inputRange, outputRange);
}
/// Ditto
auto tee(alias fun, Flag!"pipeOnPop" pipeOnPop = Yes.pipeOnPop, R1)(R1 inputRange)
if (is(typeof(fun) == void) || isSomeFunction!fun)
{
/*
Distinguish between function literals and template lambdas
when using either as an $(LREF OutputRange). Since a template
has no type, typeof(template) will always return void.
If it's a template lambda, it's first necessary to instantiate
it with $(D ElementType!R1).
*/
static if (is(typeof(fun) == void))
alias _fun = fun!(ElementType!R1);
else
alias _fun = fun;
static if (isFunctionPointer!_fun || isDelegate!_fun)
{
return tee!pipeOnPop(inputRange, _fun);
}
else
{
return tee!pipeOnPop(inputRange, &_fun);
}
}
///
@safe unittest
{
import std.algorithm : equal, filter, map;
// Sum values while copying
int[] values = [1, 4, 9, 16, 25];
int sum = 0;
auto newValues = values.tee!(a => sum += a).array;
assert(equal(newValues, values));
assert(sum == 1 + 4 + 9 + 16 + 25);
// Count values that pass the first filter
int count = 0;
auto newValues4 = values.filter!(a => a < 10)
.tee!(a => count++)
.map!(a => a + 1)
.filter!(a => a < 10);
//Fine, equal also evaluates any lazy ranges passed to it.
//count is not 3 until equal evaluates newValues4
assert(equal(newValues4, [2, 5]));
assert(count == 3);
}
//
@safe unittest
{
import std.algorithm : equal, filter, map;
int[] values = [1, 4, 9, 16, 25];
int count = 0;
auto newValues = values.filter!(a => a < 10)
.tee!(a => count++, No.pipeOnPop)
.map!(a => a + 1)
.filter!(a => a < 10);
auto val = newValues.front;
assert(count == 1);
//front is only evaluated once per element
val = newValues.front;
assert(count == 1);
//popFront() called, fun will be called
//again on the next access to front
newValues.popFront();
newValues.front;
assert(count == 2);
int[] preMap = new int[](3), postMap = [];
auto mappedValues = values.filter!(a => a < 10)
//Note the two different ways of using tee
.tee(preMap)
.map!(a => a + 1)
.tee!(a => postMap ~= a)
.filter!(a => a < 10);
assert(equal(mappedValues, [2, 5]));
assert(equal(preMap, [1, 4, 9]));
assert(equal(postMap, [2, 5, 10]));
}
//
@safe unittest
{
import std.algorithm : filter, equal, map;
char[] txt = "Line one, Line 2".dup;
bool isVowel(dchar c)
{
import std.string : indexOf;
return "AaEeIiOoUu".indexOf(c) != -1;
}
int vowelCount = 0;
int shiftedCount = 0;
auto removeVowels = txt.tee!(c => isVowel(c) ? vowelCount++ : 0)
.filter!(c => !isVowel(c))
.map!(c => (c == ' ') ? c : c + 1)
.tee!(c => isVowel(c) ? shiftedCount++ : 0);
assert(equal(removeVowels, "Mo o- Mo 3"));
assert(vowelCount == 6);
assert(shiftedCount == 3);
}
@safe unittest
{
// Manually stride to test different pipe behavior.
void testRange(Range)(Range r)
{
const int strideLen = 3;
int i = 0;
ElementType!Range elem1;
ElementType!Range elem2;
while (!r.empty)
{
if (i % strideLen == 0)
{
//Make sure front is only
//evaluated once per item
elem1 = r.front;
elem2 = r.front;
assert(elem1 == elem2);
}
r.popFront();
i++;
}
}
string txt = "abcdefghijklmnopqrstuvwxyz";
int popCount = 0;
auto pipeOnPop = txt.tee!(a => popCount++);
testRange(pipeOnPop);
assert(popCount == 26);
int frontCount = 0;
auto pipeOnFront = txt.tee!(a => frontCount++, No.pipeOnPop);
testRange(pipeOnFront);
assert(frontCount == 9);
}
@safe unittest
{
import std.algorithm : equal;
//Test diverting elements to an OutputRange
string txt = "abcdefghijklmnopqrstuvwxyz";
dchar[] asink1 = [];
auto fsink = (dchar c) { asink1 ~= c; };
auto result1 = txt.tee(fsink).array;
assert(equal(txt, result1) && (equal(result1, asink1)));
dchar[] _asink1 = [];
auto _result1 = txt.tee!((dchar c) { _asink1 ~= c; })().array;
assert(equal(txt, _result1) && (equal(_result1, _asink1)));
dchar[] asink2 = new dchar[](txt.length);
void fsink2(dchar c) { static int i = 0; asink2[i] = c; i++; }
auto result2 = txt.tee(&fsink2).array;
assert(equal(txt, result2) && equal(result2, asink2));
dchar[] asink3 = new dchar[](txt.length);
auto result3 = txt.tee(asink3).array;
assert(equal(txt, result3) && equal(result3, asink3));
foreach (CharType; AliasSeq!(char, wchar, dchar))
{
auto appSink = appender!(CharType[])();
auto appResult = txt.tee(appSink).array;
assert(equal(txt, appResult) && equal(appResult, appSink.data));
}
foreach (StringType; AliasSeq!(string, wstring, dstring))
{
auto appSink = appender!StringType();
auto appResult = txt.tee(appSink).array;
assert(equal(txt, appResult) && equal(appResult, appSink.data));
}
}
@safe unittest
{
// Issue 13483
static void func1(T)(T x) {}
void func2(int x) {}
auto r = [1, 2, 3, 4].tee!func1.tee!func2;
}
/**
Extends the length of the input range `r` by padding out the start of the
range with the element `e`. The element `e` must be of a common type with
the element type of the range `r` as defined by $(REF CommonType, std, traits).
If `n` is less than the length of of `r`, then `r` is returned unmodified.
If `r` is a string with Unicode characters in it, `padLeft` follows D's rules
about length for strings, which is not the number of characters, or
graphemes, but instead the number of encoding units. If you want to treat each
grapheme as only one encoding unit long, then call
$(REF byGrapheme, std, uni) before calling this function.
If `r` has a length, then this is $(BIGOH 1). Otherwise, it's $(BIGOH r.length).
Params:
r = an input range with a length, or a forward range
e = element to pad the range with
n = the length to pad to
Returns:
A range containing the elements of the original range with the extra padding
See Also:
$(REF leftJustifier, std, string)
*/
auto padLeft(R, E)(R r, E e, size_t n)
if (
((isInputRange!R && hasLength!R) || isForwardRange!R) &&
!is(CommonType!(ElementType!R, E) == void)
)
{
static if (hasLength!R)
auto dataLength = r.length;
else
auto dataLength = r.save.walkLength(n);
return e.repeat(n > dataLength ? n - dataLength : 0).chain(r);
}
///
@safe pure unittest
{
import std.algorithm.comparison : equal;
assert([1, 2, 3, 4].padLeft(0, 6).equal([0, 0, 1, 2, 3, 4]));
assert([1, 2, 3, 4].padLeft(0, 3).equal([1, 2, 3, 4]));
assert("abc".padLeft('_', 6).equal("___abc"));
}
@safe pure nothrow unittest
{
import std.internal.test.dummyrange;
import std.algorithm.comparison : equal;
import std.meta : AliasSeq;
alias DummyRanges = AliasSeq!(
DummyRange!(ReturnBy.Reference, Length.Yes, RangeType.Input),
DummyRange!(ReturnBy.Reference, Length.Yes, RangeType.Forward),
DummyRange!(ReturnBy.Reference, Length.Yes, RangeType.Bidirectional),
DummyRange!(ReturnBy.Reference, Length.Yes, RangeType.Random),
DummyRange!(ReturnBy.Reference, Length.No, RangeType.Forward),
DummyRange!(ReturnBy.Value, Length.Yes, RangeType.Input),
DummyRange!(ReturnBy.Value, Length.Yes, RangeType.Forward),
DummyRange!(ReturnBy.Value, Length.Yes, RangeType.Bidirectional),
DummyRange!(ReturnBy.Value, Length.Yes, RangeType.Random),
DummyRange!(ReturnBy.Value, Length.No, RangeType.Forward)
);
foreach (Range; DummyRanges)
{
Range r;
assert(r
.padLeft(0, 12)
.equal([0, 0, 1U, 2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 10U])
);
}
}
// Test nogc inference
@safe @nogc pure unittest
{
import std.algorithm.comparison : equal;
static immutable r1 = [1, 2, 3, 4];
static immutable r2 = [0, 0, 1, 2, 3, 4];
assert(r1.padLeft(0, 6).equal(r2));
}
/**
Extend the length of the input range `r` by padding out the end of the range
with the element `e`. The element `e` must be of a common type with the
element type of the range `r` as defined by $(REF CommonType, std, traits).
If `n` is less than the length of of `r`, then the contents of `r` are
returned.
The range primitives that the resulting range provides depends whether or not `r`
provides them. Except the functions `back` and `popBack`, which also require
the range to have a length as well as `back` and `popBack`
Params:
r = an input range with a length
e = element to pad the range with
n = the length to pad to
Returns:
A range containing the elements of the original range with the extra padding
See Also:
$(REF rightJustifier, std, string)
*/
auto padRight(R, E)(R r, E e, size_t n) if (
isInputRange!R &&
!isInfinite!R &&
!is(CommonType!(ElementType!R, E) == void))
{
static struct Result
{
private:
R data;
E element;
size_t counter;
static if (isBidirectionalRange!R && hasLength!R) size_t backPosition;
size_t maxSize;
public:
bool empty() @property
{
return data.empty && counter >= maxSize;
}
auto front() @property
{
return data.empty ? element : data.front;
}
void popFront()
{
++counter;
if (!data.empty)
{
data.popFront;
}
}
static if (hasLength!R)
{
size_t length() @property
{
import std.algorithm.comparison : max;
return max(data.length, maxSize);
}
}
static if (isForwardRange!R)
{
auto save() @property
{
typeof(this) result = this;
data = data.save;
return result;
}
}
static if (isBidirectionalRange!R && hasLength!R)
{
auto back() @property
{
return backPosition > data.length ? element : data.back;
}
void popBack()
{
if (backPosition > data.length)
{
--backPosition;
--maxSize;
}
else
{
data.popBack;
}
}
}
static if (isRandomAccessRange!R)
{
E opIndex(size_t index)
{
assert(index <= this.length, "Index out of bounds");
return (index > data.length && index <= maxSize) ? element :
data[index];
}
}
static if (hasSlicing!R)
{
auto opSlice(size_t a, size_t b)
{
return Result((b <= data.length) ? data[a .. b] : data[a .. $],
element, b - a);
}
alias opDollar = length;
}
this(R r, E e, size_t max)
{
data = r;
element = e;
maxSize = max;
static if (isBidirectionalRange!R && hasLength!R)
backPosition = max;
}
@disable this();
}
return Result(r, e, n);
}
///
@safe pure unittest
{
import std.algorithm.comparison : equal;
assert([1, 2, 3, 4].padRight(0, 6).equal([1, 2, 3, 4, 0, 0]));
assert([1, 2, 3, 4].padRight(0, 4).equal([1, 2, 3, 4]));
assert("abc".padRight('_', 6).equal("abc___"));
}
pure unittest
{
import std.internal.test.dummyrange;
import std.algorithm.comparison : equal;
import std.meta : AliasSeq;
auto string_input_range = new ReferenceInputRange!dchar(['a', 'b', 'c']);
dchar padding = '_';
assert(string_input_range.padRight(padding, 6).equal("abc___"));
foreach (RangeType; AllDummyRanges)
{
RangeType r1;
assert(r1
.padRight(0, 12)
.equal([1U, 2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 0, 0])
);
// test if Result properly uses random access ranges
static if (isRandomAccessRange!RangeType)
{
RangeType r3;
assert(r3.padRight(0, 12)[0] == 1);
assert(r3.padRight(0, 12)[2] == 3);
assert(r3.padRight(0, 12)[11] == 0);
}
// test if Result properly uses slicing and opDollar
static if (hasSlicing!RangeType)
{
RangeType r4;
assert(r4
.padRight(0, 12)[0 .. 3]
.equal([1, 2, 3])
);
assert(r4
.padRight(0, 12)[2 .. $]
.equal([3U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 0, 0])
);
assert(r4
.padRight(0, 12)[0 .. $]
.equal([1U, 2U, 3U, 4U, 5U, 6U, 7U, 8U, 9U, 10U, 0, 0])
);
}
}
}
// Test nogc inference
@safe @nogc pure unittest
{
import std.algorithm.comparison : equal;
static immutable r1 = [1, 2, 3, 4];
static immutable r2 = [1, 2, 3, 4, 0, 0];
assert(r1.padRight(0, 6).equal(r2));
}
|
D
|
/**
* Copyright © DiamondMVC 2018
* License: MIT (https://github.com/DiamondMVC/Diamond/blob/master/LICENSE)
* Author: Jacob Jensen (bausshf)
*/
module diamond.unittesting.initialization;
import diamond.core.apptype;
static if (isWeb && isTesting)
{
/// Boolean determinng whether all tests has passed or not.
package(diamond) __gshared bool testsPassed;
/// Wrapper around a test's failure result.
private class TestFailResult
{
/// The name of the test.
string name;
/// The error.
string error;
}
/// Initializes the tests.
package(diamond) void initializeTests()
{
TestFailResult[] failedTests;
mixin HandleTests;
handleTests();
import diamond.core.io;
if (failedTests && failedTests.length)
{
import vibe.core.core : exitEventLoop;
exitEventLoop();
print("The following tests has failed:");
foreach (test; failedTests)
{
print("-------------------");
print("Test: %s", test.name);
print("Error:");
print(test.error);
print("-------------------");
}
}
else
{
testsPassed = true;
print("All tests has passed.");
}
}
/// Mixin template to handle the tests.
private mixin template HandleTests()
{
static string[] getModules()
{
import std.string : strip;
import std.array : replace, split;
string[] modules = [];
import diamond.core.io : handleCTFEFile;
mixin handleCTFEFile!("unittests.config", q{
auto lines = __fileResult.replace("\r", "").split("\n");
foreach (line; lines)
{
if (!line || !line.strip().length)
{
continue;
}
modules ~= line.strip();
}
});
handle();
return modules;
}
enum moduleNames = getModules();
static string generateTests()
{
string s = "";
foreach (moduleName; moduleNames)
{
s ~= "{ import " ~ moduleName ~ ";\r\n";
s ~= "foreach (member; __traits(allMembers, " ~ moduleName ~ "))\r\n";
s ~= q{
{
mixin(q{
static if (mixin("hasUDA!(%1$s, HttpTest)"))
{
static test_%1$s = getUDAs!(%1$s, HttpTest)[0];
auto testName =
test_%1$s.name && test_%1$s.name.length ? test_%1$s.name : "%1$s";
try
{
static if (is(ReturnType!%1$s == bool))
{
if (!%1$s())
{
auto testFailResult = new TestFailResult;
testFailResult.name = testName;
testFailResult.error = "Returned false.";
failedTests ~= testFailResult;
}
}
else
{
%1$s();
}
}
catch (Throwable t)
{
auto testFailResult = new TestFailResult;
testFailResult.name = testName;
testFailResult.error = t.toString();
failedTests ~= testFailResult;
}
}
}.format(member));
}
};
s ~= "}\r\n";
}
return s;
}
void handleTests()
{
import std.string : format;
import std.traits : hasUDA, getUDAs, ReturnType;
import diamond.core.collections;
import diamond.unittesting.attributes;
mixin(generateTests());
}
}
}
|
D
|
/**
* Abstract drawing functions.
*
* License:
* This Source Code Form is subject to the terms of
* the Mozilla Public License, v. 2.0. If a copy of
* the MPL was not distributed with this file, You
* can obtain one at http://mozilla.org/MPL/2.0/.
*
* Authors:
* Vladimir Panteleev <vladimir@thecybershadow.net>
*/
module ae.utils.graphics.canvas;
import std.string;
import std.math;
import std.traits;
import ae.utils.meta;
public import ae.utils.math;
// TODO: rewrite everything to use stride in bytes, not pixels
struct Coord { int x, y; string toString() { return format([this.tupleof]); } }
template IsCanvas(T)
{
enum IsCanvas =
is(typeof(T.init.w )) && // width
is(typeof(T.init.h )) && // height
is(typeof(T.init.stride)) && // stride in pixels (not bytes), can be "w" alias
is(typeof(T.init.pixels)); // array or pointer
}
mixin template Canvas()
{
import ae.utils.geometry;
import std.math : atan2, sqrt;
import std.random: uniform;
import std.string : format;
static assert(IsCanvas!(typeof(this)));
alias typeof(pixels[0]) COLOR;
ref COLOR opIndex(int x, int y)
{
assert(x>=0 && y>=0 && x<w && y<h);
return pixels[y*stride+x];
}
void opIndexAssign(COLOR value, int x, int y)
{
assert(x>=0 && y>=0 && x<w && y<h);
pixels[y*stride+x] = value;
}
COLOR safeGet(int x, int y, COLOR def)
{
if (x>=0 && y>=0 && x<w && y<h)
return pixels[y*stride+x];
else
return def;
}
void safePut(int x, int y, COLOR value)
{
if (x>=0 && y>=0 && x<w && y<h)
pixels[y*stride+x] = value;
}
// For easy passing of CHECKED parameter
void putPixel(bool CHECKED)(int x, int y, COLOR value)
{
static if (CHECKED)
safePut(x, y, value);
else
this[x, y] = value;
}
COLOR* scanline(int y)
{
assert(y>=0 && y<h);
return &pixels[stride*y];
}
COLOR* pixelPtr(int x, int y)
{
assert(x>=0 && y>=0 && x<w && y<h);
return &pixels[stride*y + x];
}
void clear(COLOR c)
{
static if (is(typeof(pixels[]))) // pixels is an array
pixels[] = c;
else
pixels[0..h*stride] = c;
}
void draw(bool CHECKED=true, SRCCANVAS)(int x, int y, SRCCANVAS src)
if (IsCanvas!SRCCANVAS && is(COLOR == SRCCANVAS.COLOR))
{
static if (CHECKED)
{
if (src.w == 0 || src.h == 0 ||
x+src.w <= 0 || y+src.h <= 0 || x >= w || y >= h)
return;
auto r = src.window(0, 0, src.w, src.h);
if (x < 0)
r = r.window(-x, 0, r.w, r.h),
x = 0;
if (y < 0)
r = r.window(0, -y, r.w, r.h),
y = 0;
if (x+r.w > w)
r = r.window(0, 0, w-x, r.h);
if (y+r.h > h)
r = r.window(0, 0, r.w, h-y);
draw!false(x, y, r);
}
else
{
assert(src.w > 0 && src.h > 0);
assert(x >= 0 && x+src.w <= w && y >= 0 && y+src.h <= h);
// TODO: alpha blending
size_t dstStart = y*stride+x, srcStart = 0;
foreach (j; 0..src.h)
pixels[dstStart..dstStart+src.w] = src.pixels[srcStart..srcStart+src.w],
dstStart += stride,
srcStart += src.stride;
}
}
/// Copy another canvas while applying a pixel transformation.
/// Context of pred:
/// c = source color
/// src = source canvas
/// extraArgs[n] = any extra arguments passed to transformDraw
void transformDraw(string pred, SRCCANVAS, T...)(int x, int y, ref SRCCANVAS src, T extraArgs)
if (IsCanvas!SRCCANVAS)
{
assert(x+src.w <= w && y+src.h <= h);
size_t dstSlack = stride-src.w, srcSlack = src.stride-src.w;
auto dstPtr = &pixels[0] + (y*stride+x);
auto srcPtr = &src.pixels[0];
auto endPtr = srcPtr + src.h*src.stride;
while (srcPtr < endPtr)
{
foreach (i; 0..src.w)
{
auto c = *srcPtr++;
*dstPtr++ = mixin(pred);
}
srcPtr += srcSlack;
dstPtr += dstSlack;
}
}
void warp(string pred, SRCCANVAS, T...)(ref SRCCANVAS src, T extraArgs)
if (IsCanvas!SRCCANVAS)
{
assert(src.w == w && src.h == h);
foreach (y; 0..h)
foreach (x, ref c; pixels[y*stride..y*stride+w])
{
mixin(pred);
}
}
/// Nearest-neighbor upscale
void upscaleDraw(int HRX, int HRY, SRCCANVAS)(ref SRCCANVAS src)
{
alias src lr;
alias this hr;
assert(hr.w == lr.w*HRX && hr.h == lr.h*HRY, format("Size mismatch: (%d x %d) * (%d x %d) => (%d x %d)", lr.w, lr.h, HRX, HRY, hr.w, hr.h));
foreach (y; 0..lr.h)
foreach (x, c; lr.pixels[y*lr.w..(y+1)*lr.w])
hr.fillRect(x*HRX, y*HRY, x*HRX+HRX, y*HRY+HRY, c);
}
/// Linear downscale
void downscaleDraw(int HRX, int HRY, SRCCANVAS)(ref SRCCANVAS src)
{
alias this lr;
alias src hr;
assert(hr.w == lr.w*HRX && hr.h == lr.h*HRY, format("Size mismatch: (%d x %d) * (%d x %d) <= (%d x %d)", lr.w, lr.h, HRX, HRY, hr.w, hr.h));
foreach (y; 0..lr.h)
foreach (x; 0..lr.w)
{
static if (HRX*HRY <= 0x100)
enum EXPAND_BYTES = 1;
else
static if (HRX*HRY <= 0x10000)
enum EXPAND_BYTES = 2;
else
static assert(0);
static if (is(typeof(COLOR.init.a))) // downscale with alpha
{
ExpandType!(COLOR, EXPAND_BYTES+COLOR.init.a.sizeof) sum;
ExpandType!(typeof(COLOR.init.a), EXPAND_BYTES) alphaSum;
auto start = y*HRY*hr.stride + x*HRX;
foreach (j; 0..HRY)
{
foreach (p; hr.pixels[start..start+HRX])
{
foreach (i, f; p.tupleof)
static if (p.tupleof[i].stringof != "p.a")
{
enum FIELD = p.tupleof[i].stringof[2..$];
mixin("sum."~FIELD~" += cast(typeof(sum."~FIELD~"))p."~FIELD~" * p.a;");
}
alphaSum += p.a;
}
start += hr.stride;
}
if (alphaSum)
{
auto result = cast(COLOR)(sum / alphaSum);
result.a = cast(typeof(result.a))(alphaSum / (HRX*HRY));
lr[x, y] = result;
}
else
{
static assert(COLOR.init.a == 0);
lr[x, y] = COLOR.init;
}
}
else
{
ExpandType!(COLOR, EXPAND_BYTES) sum;
auto start = y*HRY*hr.stride + x*HRX;
foreach (j; 0..HRY)
{
foreach (p; hr.pixels[start..start+HRX])
sum += p;
start += hr.stride;
}
lr[x, y] = cast(COLOR)(sum / (HRX*HRY));
}
}
}
/// Does not make a copy - only returns a "view" onto this canvas.
auto window()(int x1, int y1, int x2, int y2)
{
assert(x1 >= 0 && y1 >= 0 && x2 <= w && y2 <= h && x1 <= x2 && y1 <= y2);
return RefCanvas!COLOR(x2-x1, y2-y1, stride, pixelPtr(x1, y1));
}
/// Construct a reference type pointing to the same data
R getRef(R)()
{
R r;
r.w = w;
r.h = h;
r.stride = stride;
r.pixels = pixelPtr(0, 0);
return r;
}
enum CheckHLine =
q{
static if (CHECKED)
{
if (x1 >= w || x2 <= 0 || y < 0 || y >= h || x1 >= x2) return;
if (x1 < 0) x1 = 0;
if (x2 >= w) x2 = w;
}
assert(x1 <= x2);
};
enum CheckVLine =
q{
static if (CHECKED)
{
if (x < 0 || x >= w || y1 >= h || y2 <= 0 || y1 >= y2) return;
if (y1 < 0) y1 = 0;
if (y2 >= h) y2 = h;
}
assert(y1 <= y2);
};
void hline(bool CHECKED=true)(int x1, int x2, int y, COLOR c)
{
mixin(CheckHLine);
auto rowOffset = y*stride;
pixels[rowOffset+x1..rowOffset+x2] = c;
}
void vline(bool CHECKED=true)(int x, int y1, int y2, COLOR c)
{
mixin(CheckVLine);
foreach (y; y1..y2) // TODO: optimize
pixels[y*stride+x] = c;
}
void line(bool CHECKED=true)(int x1, int y1, int x2, int y2, COLOR c)
{
enum DrawLine = q{
// Axis-independent part. Mixin context:
// a0 .. a1 - longer side
// b0 .. b1 - shorter side
// DrawPixel - mixin to draw a pixel at coordinates (a, b)
if (a0 == a1)
return;
if (a0 > a1)
{
swap(a0, a1);
swap(b0, b1);
}
// Use fixed-point for b position and offset per 1 pixel along "a" axis
assert(b0 < (1L<<CoordinateBits) && b1 < (1L<<CoordinateBits));
SignedBitsType!(CoordinateBits*2) bPos = b0 << CoordinateBits;
SignedBitsType!(CoordinateBits*2) bOff = ((b1-b0) << CoordinateBits) / (a1-a0);
foreach (a; a0..a1+1)
{
int b = (bPos += bOff) >> CoordinateBits;
mixin(DrawPixel);
}
};
if (abs(x2-x1) > abs(y2-y1))
{
alias x1 a0;
alias x2 a1;
alias y1 b0;
alias y2 b1;
enum DrawPixel = q{ putPixel!CHECKED(a, b, c); };
mixin(DrawLine);
}
else
{
alias y1 a0;
alias y2 a1;
alias x1 b0;
alias x2 b1;
enum DrawPixel = q{ putPixel!CHECKED(b, a, c); };
mixin(DrawLine);
}
}
void rect(bool CHECKED=true)(int x1, int y1, int x2, int y2, COLOR c) // [)
{
sort2(x1, x2);
sort2(y1, y2);
hline!CHECKED(x1, x2-1, y1, c);
hline!CHECKED(x1, x2-1, y2, c);
vline!CHECKED(x1, y1, y2-1, c);
vline!CHECKED(x2, y1, y2-1, c);
}
void fillRect(bool CHECKED=true)(int x1, int y1, int x2, int y2, COLOR b) // [)
{
sort2(x1, x2);
sort2(y1, y2);
static if (CHECKED)
{
if (x1 >= w || y1 >= h || x2 <= 0 || y2 <= 0 || x1==x2 || y1==y2) return;
if (x1 < 0) x1 = 0;
if (y1 < 0) y1 = 0;
if (x2 >= w) x2 = w;
if (y2 >= h) y2 = h;
}
foreach (y; y1..y2)
pixels[y*stride+x1..y*stride+x2] = b;
}
void fillRect(bool CHECKED=true)(int x1, int y1, int x2, int y2, COLOR c, COLOR b) // [)
{
rect!CHECKED(x1, y1, x2, y2, c);
if (x2-x1>2 && y2-y1>2)
fillRect!CHECKED(x1+1, y1+1, x2-1, y2-1, b);
}
/// Unchecked! Make sure area is bounded.
void uncheckedFloodFill(int x, int y, COLOR c)
{
floodFillPtr(&this[x, y], c, this[x, y]);
}
private void floodFillPtr(COLOR* pp, COLOR c, COLOR f)
{
COLOR* p0 = pp; while (*p0==f) p0--; p0++;
COLOR* p1 = pp; while (*p1==f) p1++; p1--;
for (auto p=p0; p<=p1; p++)
*p = c;
p0 -= stride; p1 -= stride;
for (auto p=p0; p<=p1; p++)
if (*p == f)
floodFillPtr(p, c, f);
p0 += stride*2; p1 += stride*2;
for (auto p=p0; p<=p1; p++)
if (*p == f)
floodFillPtr(p, c, f);
}
void fillCircle(int x, int y, int r, COLOR c)
{
int x0 = x>r?x-r:0;
int y0 = y>r?y-r:0;
int x1 = min(x+r, w-1);
int y1 = min(y+r, h-1);
int rs = sqr(r);
// TODO: optimize
foreach (py; y0..y1+1)
foreach (px; x0..x1+1)
if (sqr(x-px) + sqr(y-py) < rs)
this[px, py] = c;
}
void fillSector(int x, int y, int r0, int r1, real a0, real a1, COLOR c)
{
int x0 = x>r1?x-r1:0;
int y0 = y>r1?y-r1:0;
int x1 = min(x+r1, w-1);
int y1 = min(y+r1, h-1);
int r0s = sqr(r0);
int r1s = sqr(r1);
if (a0 > a1)
a1 += TAU;
foreach (py; y0..y1+1)
foreach (px; x0..x1+1)
{
int dx = px-x;
int dy = py-y;
int rs = sqr(dx) + sqr(dy);
if (r0s <= rs && rs < r1s)
{
real a = atan2(cast(real)dy, cast(real)dx);
if ((a0 <= a && a <= a1) ||
(a += TAU,
(a0 <= a && a <= a1)))
this[px, py] = c;
}
}
}
void fillPoly(Coord[] coords, COLOR f)
{
int minY, maxY;
minY = maxY = coords[0].y;
foreach (c; coords[1..$])
minY = min(minY, c.y),
maxY = max(maxY, c.y);
foreach (y; minY..maxY+1)
{
int[] intersections;
for (uint i=0; i<coords.length; i++)
{
auto c0=coords[i], c1=coords[i==$-1?0:i+1];
if (y==c0.y)
{
assert(y == coords[i%$].y);
int pi = i-1; int py;
while ((py=coords[(pi+$)%$].y)==y)
pi--;
int ni = i+1; int ny;
while ((ny=coords[ni%$].y)==y)
ni++;
if (ni > coords.length)
continue;
if ((py>y) == (y>ny))
intersections ~= coords[i%$].x;
i = ni-1;
}
else
if (c0.y<y && y<c1.y)
intersections ~= itpl(c0.x, c1.x, y, c0.y, c1.y);
else
if (c1.y<y && y<c0.y)
intersections ~= itpl(c1.x, c0.x, y, c1.y, c0.y);
}
assert(intersections.length % 2==0);
intersections.sort;
for (uint i=0; i<intersections.length; i+=2)
hline!true(intersections[i], intersections[i+1], y, f);
}
}
// No caps
void thickLine(int x1, int y1, int x2, int y2, int r, COLOR c)
{
int dx = x2-x1;
int dy = y2-y1;
int d = cast(int)sqrt(cast(float)(sqr(dx)+sqr(dy)));
if (d==0) return;
int nx = dx*r/d;
int ny = dy*r/d;
fillPoly([
Coord(x1-ny, y1+nx),
Coord(x1+ny, y1-nx),
Coord(x2+ny, y2-nx),
Coord(x2-ny, y2+nx),
], c);
}
// No caps
void thickLinePoly(Coord[] coords, int r, COLOR c)
{
foreach (i; 0..coords.length)
thickLine(coords[i].tupleof, coords[(i+1)%$].tupleof, r, c);
}
// ************************************************************************************************************************************
/// Maximum number of bits used in a coordinate (assumption)
enum CoordinateBits = 16;
static assert(COLOR.SameType, "Asymmetric color types not supported, fix me!");
/// Fixed-point type, big enough to hold a coordinate, with fractionary precision corresponding to channel precision.
alias SignedBitsType!(COLOR.BaseTypeBits + CoordinateBits) fix;
/// Type to hold temporary values for multiplication and division
alias SignedBitsType!(COLOR.BaseTypeBits*2 + CoordinateBits) fix2;
static assert(COLOR.BaseTypeBits < 32, "Shift operators are broken for shifts over 32 bits, fix me!");
fix tofix(T:int )(T x) { return cast(fix) (x<<COLOR.BaseTypeBits); }
fix tofix(T:float)(T x) { return cast(fix) (x*(1<<COLOR.BaseTypeBits)); }
T fixto(T:int)(fix x) { return cast(T)(x>>COLOR.BaseTypeBits); }
fix fixsqr(fix x) { return cast(fix)((cast(fix2)x*x) >> COLOR.BaseTypeBits); }
fix fixmul(fix x, fix y) { return cast(fix)((cast(fix2)x*y) >> COLOR.BaseTypeBits); }
fix fixdiv(fix x, fix y) { return cast(fix)((cast(fix2)x << COLOR.BaseTypeBits)/y); }
static assert(COLOR.BaseType.sizeof*8 == COLOR.BaseTypeBits, "COLORs with BaseType not corresponding to native type not currently supported, fix me!");
/// Type only large enough to hold a fractionary part of a "fix" (i.e. color channel precision). Used for alpha values, etc.
alias COLOR.BaseType frac;
/// Type to hold temporary values for multiplication and division
alias UnsignedBitsType!(COLOR.BaseTypeBits*2) frac2;
frac tofrac(T:float)(T x) { return cast(frac) (x*(1<<COLOR.BaseTypeBits)); }
frac fixfpart(fix x) { return cast(frac)x; }
frac fracsqr(frac x ) { return cast(frac)((cast(frac2)x*x) >> COLOR.BaseTypeBits); }
frac fracmul(frac x, frac y) { return cast(frac)((cast(frac2)x*y) >> COLOR.BaseTypeBits); }
frac tofracBounded(T:float)(T x) { return cast(frac) bound(tofix(x), 0, frac.max); }
// ************************************************************************************************************************************
void whiteNoise()
{
for (int y=0;y<h/2;y++)
for (int x=0;x<w/2;x++)
pixels[y*2 *stride + x*2 ] = COLOR.monochrome(uniform!(COLOR.BaseType)());
// interpolate
enum AVERAGE = q{(a+b)/2};
for (int y=0;y<h/2;y++)
for (int x=0;x<w/2-1;x++)
pixels[y*2 *stride + x*2+1] = COLOR.op!AVERAGE(pixels[y*2*stride + x*2], pixels[y*2*stride + x*2+2]);
for (int y=0;y<h/2-1;y++)
for (int x=0;x<w/2;x++)
pixels[(y*2+1)*stride + x*2 ] = COLOR.op!AVERAGE(pixels[y*2*stride + x*2], pixels[(y*2+2)*stride + x*2]);
for (int y=0;y<h/2-1;y++)
for (int x=0;x<w/2-1;x++)
pixels[(y*2+1)*stride + x*2+1] = COLOR.op!AVERAGE(pixels[y*2*stride + x*2+1], pixels[(y*2+2)*stride + x*2+2]);
}
private void softRoundShape(bool RING, T)(T x, T y, T r0, T r1, T r2, COLOR color)
if (is(T : int) || is(T : float))
{
assert(r0 <= r1);
assert(r1 <= r2);
assert(r2 < 256); // precision constraint - see SqrType
//int ix = cast(int)x;
//int iy = cast(int)y;
//int ir1 = cast(int)sqr(r1-1);
//int ir2 = cast(int)sqr(r2+1);
int x1 = cast(int)(x-r2-1); if (x1<0) x1=0;
int y1 = cast(int)(y-r2-1); if (y1<0) y1=0;
int x2 = cast(int)(x+r2+1); if (x2>w ) x2 = w;
int y2 = cast(int)(y+r2+1); if (y2>h) y2 = h;
static if (RING)
auto r0s = r0*r0;
auto r1s = r1*r1;
auto r2s = r2*r2;
//float rds = r2s - r1s;
fix fx = tofix(x);
fix fy = tofix(y);
static if (RING)
fix fr0s = tofix(r0s);
fix fr1s = tofix(r1s);
fix fr2s = tofix(r2s);
static if (RING)
fix fr10 = fr1s - fr0s;
fix fr21 = fr2s - fr1s;
for (int cy=y1;cy<y2;cy++)
{
auto row = scanline(cy);
for (int cx=x1;cx<x2;cx++)
{
alias SignedBitsType!(2*(8 + COLOR.BaseTypeBits)) SqrType; // fit the square of radius expressed as fixed-point
fix frs = cast(fix)((sqr(cast(SqrType)fx-tofix(cx)) + sqr(cast(SqrType)fy-tofix(cy))) >> COLOR.BaseTypeBits); // shift-right only once instead of once-per-sqr
//static frac alphafunc(frac x) { return fracsqr(x); }
static frac alphafunc(frac x) { return x; }
static if (RING)
{
if (frs<fr0s)
{}
else
if (frs<fr2s)
{
frac alpha;
if (frs<fr1s)
alpha = alphafunc(cast(frac)fixdiv(frs-fr0s, fr10));
else
alpha = ~alphafunc(cast(frac)fixdiv(frs-fr1s, fr21));
row[cx] = COLOR.op!q{blend(a, b, c)}(color, row[cx], alpha);
}
}
else
{
if (frs<fr1s)
row[cx] = color;
else
if (frs<fr2s)
{
frac alpha = ~alphafunc(cast(frac)fixdiv(frs-fr1s, fr21));
row[cx] = COLOR.op!q{blend(a, b, c)}(color, row[cx], alpha);
}
}
}
}
}
void softRing(T)(T x, T y, T r0, T r1, T r2, COLOR color)
if (is(T : int) || is(T : float))
{
softRoundShape!(true, T)(x, y, r0, r1, r2, color);
}
void softCircle(T)(T x, T y, T r1, T r2, COLOR color)
if (is(T : int) || is(T : float))
{
softRoundShape!(false, T)(x, y, 0, r1, r2, color);
}
void aaPutPixel(bool CHECKED=true, bool USE_ALPHA=true, F:float)(F x, F y, COLOR color, frac alpha)
{
void plot(bool CHECKED2)(int x, int y, frac f)
{
static if (CHECKED2)
if (x<0 || x>=w || y<0 || y>=h)
return;
COLOR* p = pixelPtr(x, y);
static if (USE_ALPHA) f = fracmul(f, alpha);
*p = COLOR.op!q{blend(a, b, c)}(color, *p, f);
}
fix fx = tofix(x);
fix fy = tofix(y);
int ix = fixto!int(fx);
int iy = fixto!int(fy);
static if (CHECKED)
if (ix>=0 && iy>=0 && ix+1<w && iy+1<h)
{
plot!false(ix , iy , fracmul(~fixfpart(fx), ~fixfpart(fy)));
plot!false(ix , iy+1, fracmul(~fixfpart(fx), fixfpart(fy)));
plot!false(ix+1, iy , fracmul( fixfpart(fx), ~fixfpart(fy)));
plot!false(ix+1, iy+1, fracmul( fixfpart(fx), fixfpart(fy)));
return;
}
plot!CHECKED(ix , iy , fracmul(~fixfpart(fx), ~fixfpart(fy)));
plot!CHECKED(ix , iy+1, fracmul(~fixfpart(fx), fixfpart(fy)));
plot!CHECKED(ix+1, iy , fracmul( fixfpart(fx), ~fixfpart(fy)));
plot!CHECKED(ix+1, iy+1, fracmul( fixfpart(fx), fixfpart(fy)));
}
void aaPutPixel(bool CHECKED=true, F:float)(F x, F y, COLOR color)
{
//aaPutPixel!(false, F)(x, y, color, 0); // doesn't work, wtf
alias aaPutPixel!(CHECKED, false, F) f;
f(x, y, color, 0);
}
void hline(bool CHECKED=true)(int x1, int x2, int y, COLOR color, frac alpha)
{
mixin(CheckHLine);
if (alpha==0)
return;
else
if (alpha==frac.max)
pixels[y*stride + x1 .. (y)*stride + x2] = color;
else
foreach (ref p; pixels[y*stride + x1 .. y*stride + x2])
p = COLOR.op!q{blend(a, b, c)}(color, p, alpha);
}
void vline(bool CHECKED=true)(int x, int y1, int y2, COLOR color, frac alpha)
{
mixin(CheckVLine);
if (alpha==0)
return;
else
if (alpha==frac.max)
foreach (y; y1..y2)
this[x, y] = color;
else
foreach (y; y1..y2)
{
auto p = pixelPtr(x, y);
*p = COLOR.op!q{blend(a, b, c)}(color, *p, alpha);
}
}
void aaFillRect(bool CHECKED=true, F:float)(F x1, F y1, F x2, F y2, COLOR color)
{
sort2(x1, x2);
sort2(y1, y2);
fix x1f = tofix(x1); int x1i = fixto!int(x1f);
fix y1f = tofix(y1); int y1i = fixto!int(y1f);
fix x2f = tofix(x2); int x2i = fixto!int(x2f);
fix y2f = tofix(y2); int y2i = fixto!int(y2f);
vline!CHECKED(x1i, y1i+1, y2i, color, ~fixfpart(x1f));
vline!CHECKED(x2i, y1i+1, y2i, color, fixfpart(x2f));
hline!CHECKED(x1i+1, x2i, y1i, color, ~fixfpart(y1f));
hline!CHECKED(x1i+1, x2i, y2i, color, fixfpart(y2f));
aaPutPixel!CHECKED(x1i, y1i, color, fracmul(~fixfpart(x1f), ~fixfpart(y1f)));
aaPutPixel!CHECKED(x1i, y2i, color, fracmul(~fixfpart(x1f), fixfpart(y2f)));
aaPutPixel!CHECKED(x2i, y1i, color, fracmul( fixfpart(x2f), ~fixfpart(y1f)));
aaPutPixel!CHECKED(x2i, y2i, color, fracmul( fixfpart(x2f), fixfpart(y2f)));
fillRect!CHECKED(x1i+1, y1i+1, x2i, y2i, color);
}
void aaLine(bool CHECKED=true)(float x1, float y1, float x2, float y2, COLOR color)
{
// Simplistic straight-forward implementation. TODO: optimize
if (abs(x1-x2) > abs(y1-y2))
for (auto x=x1; sign(x1-x2)!=sign(x2-x); x += sign(x2-x1))
aaPutPixel!CHECKED(x, itpl(y1, y2, x, x1, x2), color);
else
for (auto y=y1; sign(y1-y2)!=sign(y2-y); y += sign(y2-y1))
aaPutPixel!CHECKED(itpl(x1, x2, y, y1, y2), y, color);
}
void aaLine(bool CHECKED=true)(float x1, float y1, float x2, float y2, COLOR color, frac alpha)
{
// ditto
if (abs(x1-x2) > abs(y1-y2))
for (auto x=x1; sign(x1-x2)!=sign(x2-x); x += sign(x2-x1))
aaPutPixel!CHECKED(x, itpl(y1, y2, x, x1, x2), color, alpha);
else
for (auto y=y1; sign(y1-y2)!=sign(y2-y); y += sign(y2-y1))
aaPutPixel!CHECKED(itpl(x1, x2, y, y1, y2), y, color, alpha);
}
}
private bool isSameType(T)()
{
foreach (i, f; T.init.tupleof)
if (!is(typeof(T.init.tupleof[i]) == typeof(T.init.tupleof[0])))
return false;
return true;
}
struct Color(FieldTuple...)
{
struct Fields { mixin FieldList!FieldTuple; } // for iteration
// alias this bugs out with operator overloading, so just paste the fields here
mixin FieldList!FieldTuple;
/// Whether or not all channel fields have the same base type.
// Only "true" supported for now, may change in the future (e.g. for 5:6:5)
enum SameType = isSameType!Fields();
enum Components = Fields.init.tupleof.length;
static if (SameType)
{
alias typeof(Fields.init.tupleof[0]) BaseType;
enum BaseTypeBits = BaseType.sizeof*8;
}
/// Return a Color instance with all fields set to "value".
static typeof(this) monochrome(BaseType value)
{
typeof(this) r;
foreach (i, f; r.tupleof)
r.tupleof[i] = value;
return r;
}
/// Warning: overloaded operators preserve types and may cause overflows
typeof(this) opUnary(string op)()
if (op=="~" || op=="-")
{
typeof(this) r;
foreach (i, f; r.tupleof)
static if(r.tupleof[i].stringof != "r.x") // skip padding
r.tupleof[i] = cast(typeof(r.tupleof[i])) mixin(op ~ `this.tupleof[i]`);
return r;
}
/// ditto
typeof(this) opBinary(string op, T)(T o)
if (is(T == typeof(this)))
{
typeof(this) r;
foreach (i, f; r.tupleof)
static if(r.tupleof[i].stringof != "r.x") // skip padding
r.tupleof[i] = cast(typeof(r.tupleof[i])) mixin(`this.tupleof[i]` ~ op ~ `o.tupleof[i]`);
return r;
}
/// ditto
typeof(this) opBinary(string op)(int o)
{
typeof(this) r;
foreach (i, f; r.tupleof)
static if(r.tupleof[i].stringof != "r.x") // skip padding
r.tupleof[i] = cast(typeof(r.tupleof[i])) mixin(`this.tupleof[i]` ~ op ~ `o`);
return r;
}
/// Apply a custom operation for each channel. Example:
/// COLOR.op!q{(a + b) / 2}(colorA, colorB);
static typeof(this) op(string expr, T...)(T values)
{
static assert(values.length <= 10);
string genVars(string channel)
{
string result;
foreach (j, Tj; T)
{
static if (is(Tj == struct)) // TODO: tighter constraint (same color channels)?
result ~= "auto " ~ cast(char)('a' + j) ~ " = values[" ~ cast(char)('0' + j) ~ "]." ~ channel ~ ";\n";
else
result ~= "auto " ~ cast(char)('a' + j) ~ " = values[" ~ cast(char)('0' + j) ~ "];\n";
}
return result;
}
typeof(this) r;
foreach (i, f; r.tupleof)
static if(r.tupleof[i].stringof != "r.x") // skip padding
{
mixin(genVars(r.tupleof[i].stringof[2..$]));
r.tupleof[i] = mixin(expr);
}
return r;
}
}
// The "x" has the special meaning of "padding" and is ignored in some circumstances
alias Color!(ubyte , "r", "g", "b" ) RGB ;
alias Color!(ushort , "r", "g", "b" ) RGB16 ;
alias Color!(ubyte , "r", "g", "b", "x") RGBX ;
alias Color!(ushort , "r", "g", "b", "x") RGBX16 ;
alias Color!(ubyte , "r", "g", "b", "a") RGBA ;
alias Color!(ushort , "r", "g", "b", "a") RGBA16 ;
alias Color!(ubyte , "b", "g", "r" ) BGR ;
alias Color!(ubyte , "b", "g", "r", "x") BGRX ;
alias Color!(ubyte , "b", "g", "r", "a") BGRA ;
alias Color!(ubyte , "g" ) G8 ;
alias Color!(ushort , "g" ) G16 ;
alias Color!(ubyte , "g", "a" ) GA ;
alias Color!(ushort , "g", "a" ) GA16 ;
alias Color!(byte , "g" ) S8 ;
alias Color!(short , "g" ) S16 ;
private
{
static assert(RGB.sizeof == 3);
RGB[2] test;
static assert(test.sizeof == 6);
}
// *****************************************************************************
/// Unsigned integer type big enough to fit N bits of precision.
template UnsignedBitsType(uint BITS)
{
static if (BITS <= 8)
alias ubyte UnsignedBitsType;
else
static if (BITS <= 16)
alias ushort UnsignedBitsType;
else
static if (BITS <= 32)
alias uint UnsignedBitsType;
else
static if (BITS <= 64)
alias ulong UnsignedBitsType;
else
static assert(0, "No integer type big enough to fit " ~ BITS.stringof ~ " bits");
}
template SignedBitsType(uint BITS)
{
alias Signed!(UnsignedBitsType!BITS) SignedBitsType;
}
/// Create a type where each integer member of T is expanded by BYTES bytes.
template ExpandType(T, uint BYTES)
{
static if (is(T : ulong))
alias UnsignedBitsType!((T.sizeof + BYTES) * 8) ExpandType;
else
static if (is(T==struct))
struct ExpandType
{
static string mixFields()
{
string s;
string[] fields = structFields!T;
foreach (field; fields)
s ~= "ExpandType!(typeof(T.init." ~ field ~ "), "~BYTES.stringof~") " ~ field ~ ";\n";
s ~= "\n";
s ~= "void opOpAssign(string OP)(" ~ T.stringof ~ " color) if (OP==`+`)\n";
s ~= "{\n";
foreach (field; fields)
s ~= " "~field~" += color."~field~";\n";
s ~= "}\n\n";
s ~= T.stringof ~ " opBinary(string OP, T)(T divisor) if (OP==`/`)\n";
s ~= "{\n";
s ~= " "~T.stringof~" color;\n";
foreach (field; fields)
s ~= " color."~field~" = cast(typeof(color."~field~")) ("~field~" / divisor);\n";
s ~= " return color;\n";
s ~= "}\n\n";
return s;
}
//pragma(msg, mixFields());
mixin(mixFields());
}
else
static assert(0);
}
/// Recursively replace each type in T from FROM to TO.
template ReplaceType(T, FROM, TO)
{
static if (is(T == FROM))
alias TO ReplaceType;
else
static if (is(T==struct))
struct ReplaceType
{
static string mixFields()
{
string s;
foreach (field; structFields!T)
s ~= "ReplaceType!(typeof(T.init." ~ field ~ "), FROM, TO) " ~ field ~ ";\n";
return s;
}
//pragma(msg, mixFields());
mixin(mixFields());
}
else
static assert(0, "Can't replace " ~ T.stringof);
}
// *****************************************************************************
// TODO: type expansion?
T blend(T)(T f, T b, T a) { return cast(T) ( ((f*a) + (b*~a)) / T.max ); }
string[] structFields(T)()
{
string[] fields;
foreach (i, f; T.init.tupleof)
{
string field = T.tupleof[i].stringof;
while (field[0] != '.')
field = field[1..$];
field = field[1..$];
if (field != "x") // HACK
fields ~= field;
}
return fields;
}
// *****************************************************************************
struct RefCanvas(COLOR)
{
int w, h, stride;
COLOR* pixels;
mixin Canvas;
}
// *****************************************************************************
private
{
// test instantiation
RefCanvas!RGB testRGB;
RefCanvas!RGBX testRGBX;
RefCanvas!RGBA testRGBA;
//RefCanvas!RGBX16 testRGBX16;
//RefCanvas!RGBA16 testRGBA16;
RefCanvas!GA testGA;
RefCanvas!GA16 testGA16;
static assert(IsCanvas!(RefCanvas!RGB));
}
|
D
|
module neton.network.NetServer;
// import hunt.net;
// import neton.network.ServerHandler;
// import hunt.logging;
// import neton.network.Interface;
// class NetServer(T, A...)
// {
// this(ulong ID, A args)
// {
// this.ID = ID;
// this.args = args;
// server = NetUtil.createNetServer!(ServerThreadMode.Single)();
// }
// void listen(string host, int port)
// {
// alias Server = hunt.net.Server.Server;
// server.listen(host, port, (Result!Server result) {
// if (result.failed())
// throw result.cause();
// });
// server.connectionHandler((NetSocket sock) {
// auto context = new T(sock, args);
// auto tcp = cast(AsynchronousTcpSession) sock;
// tcp.attachObject(context);
// logInfo(ID, " have a connection");
// });
// }
// A args;
// ulong ID;
// AbstractServer server;
// }
|
D
|
/Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Multipart.build/MultipartParser.swift.o : /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/MultipartPartConvertible.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/FormDataDecoder.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/FormDataEncoder.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/MultipartParser.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/MultipartSerializer.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/MultipartError.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/Exports.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/MultipartPart.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIO.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Async.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Core.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Debugging.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/COperatingSystem.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/XPC.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/ObjectiveC.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Combine.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Dispatch.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Darwin.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Foundation.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreFoundation.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreGraphics.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Swift.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/IOKit.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/SwiftOnoneSupport.swiftmodule/x86_64-apple-macos.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOConcurrencyHelpers.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Bits.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOFoundationCompat.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/swift-nio/Sources/CNIOAtomics/include/cpp_magic.h /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/swift-nio/Sources/CNIOLinux/include/ifaddrs-android.h /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/swift-nio/Sources/CNIODarwin/include/CNIODarwin.h /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/swift-nio/Sources/CNIOAtomics/include/CNIOAtomics.h /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/swift-nio/Sources/CNIOLinux/include/CNIOLinux.h /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIOSHA1.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOHTTP1.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/SQL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/PostgreSQL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/FluentPostgreSQL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/FluentSQL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOOpenSSL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIOOpenSSL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CCryptoOpenSSL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIO.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/HTTP.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOTLS.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIOZlib.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Async.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Command.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Service.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Console.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Core.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/SQLite.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/FluentSQLite.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOPriorityQueue.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Logging.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Debugging.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Routing.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/SQLBenchmark.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/FluentBenchmark.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/COperatingSystem.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Random.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/URLEncodedForm.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIODarwin.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Authentication.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Validation.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Crypto.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/App.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIOHTTPParser.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Vapor.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIOAtomics.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Redis.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOConcurrencyHelpers.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Bits.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOFoundationCompat.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/WebSocket.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOWebSocket.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/DatabaseKit.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/TemplateKit.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Fluent.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Multipart.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIOLinux.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/swift-nio-zlib-support/module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/usr/include/xpc/XPC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/apinotes/Dispatch.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/System/Library/Frameworks/ApplicationServices.framework/Headers/ApplicationServices.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
/Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Multipart.build/MultipartParser~partial.swiftmodule : /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/MultipartPartConvertible.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/FormDataDecoder.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/FormDataEncoder.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/MultipartParser.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/MultipartSerializer.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/MultipartError.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/Exports.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/MultipartPart.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIO.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Async.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Core.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Debugging.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/COperatingSystem.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/XPC.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/ObjectiveC.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Combine.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Dispatch.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Darwin.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Foundation.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreFoundation.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreGraphics.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Swift.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/IOKit.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/SwiftOnoneSupport.swiftmodule/x86_64-apple-macos.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOConcurrencyHelpers.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Bits.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOFoundationCompat.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/swift-nio/Sources/CNIOAtomics/include/cpp_magic.h /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/swift-nio/Sources/CNIOLinux/include/ifaddrs-android.h /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/swift-nio/Sources/CNIODarwin/include/CNIODarwin.h /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/swift-nio/Sources/CNIOAtomics/include/CNIOAtomics.h /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/swift-nio/Sources/CNIOLinux/include/CNIOLinux.h /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIOSHA1.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOHTTP1.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/SQL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/PostgreSQL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/FluentPostgreSQL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/FluentSQL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOOpenSSL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIOOpenSSL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CCryptoOpenSSL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIO.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/HTTP.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOTLS.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIOZlib.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Async.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Command.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Service.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Console.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Core.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/SQLite.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/FluentSQLite.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOPriorityQueue.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Logging.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Debugging.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Routing.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/SQLBenchmark.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/FluentBenchmark.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/COperatingSystem.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Random.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/URLEncodedForm.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIODarwin.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Authentication.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Validation.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Crypto.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/App.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIOHTTPParser.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Vapor.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIOAtomics.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Redis.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOConcurrencyHelpers.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Bits.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOFoundationCompat.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/WebSocket.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOWebSocket.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/DatabaseKit.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/TemplateKit.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Fluent.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Multipart.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIOLinux.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/swift-nio-zlib-support/module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/usr/include/xpc/XPC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/apinotes/Dispatch.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/System/Library/Frameworks/ApplicationServices.framework/Headers/ApplicationServices.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
/Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Multipart.build/MultipartParser~partial.swiftdoc : /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/MultipartPartConvertible.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/FormDataDecoder.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/FormDataEncoder.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/MultipartParser.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/MultipartSerializer.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/MultipartError.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/Exports.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/MultipartPart.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIO.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Async.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Core.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Debugging.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/COperatingSystem.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/XPC.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/ObjectiveC.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Combine.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Dispatch.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Darwin.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Foundation.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreFoundation.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreGraphics.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Swift.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/IOKit.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/SwiftOnoneSupport.swiftmodule/x86_64-apple-macos.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOConcurrencyHelpers.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Bits.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOFoundationCompat.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/swift-nio/Sources/CNIOAtomics/include/cpp_magic.h /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/swift-nio/Sources/CNIOLinux/include/ifaddrs-android.h /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/swift-nio/Sources/CNIODarwin/include/CNIODarwin.h /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/swift-nio/Sources/CNIOAtomics/include/CNIOAtomics.h /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/swift-nio/Sources/CNIOLinux/include/CNIOLinux.h /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIOSHA1.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOHTTP1.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/SQL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/PostgreSQL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/FluentPostgreSQL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/FluentSQL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOOpenSSL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIOOpenSSL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CCryptoOpenSSL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIO.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/HTTP.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOTLS.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIOZlib.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Async.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Command.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Service.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Console.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Core.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/SQLite.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/FluentSQLite.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOPriorityQueue.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Logging.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Debugging.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Routing.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/SQLBenchmark.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/FluentBenchmark.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/COperatingSystem.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Random.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/URLEncodedForm.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIODarwin.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Authentication.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Validation.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Crypto.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/App.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIOHTTPParser.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Vapor.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIOAtomics.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Redis.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOConcurrencyHelpers.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Bits.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOFoundationCompat.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/WebSocket.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOWebSocket.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/DatabaseKit.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/TemplateKit.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Fluent.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Multipart.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIOLinux.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/swift-nio-zlib-support/module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/usr/include/xpc/XPC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/apinotes/Dispatch.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/System/Library/Frameworks/ApplicationServices.framework/Headers/ApplicationServices.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
/Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Multipart.build/MultipartParser~partial.swiftsourceinfo : /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/MultipartPartConvertible.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/FormDataDecoder.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/FormDataEncoder.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/MultipartParser.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/MultipartSerializer.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/MultipartError.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/Exports.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/multipart/Sources/Multipart/MultipartPart.swift /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIO.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Async.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Core.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Debugging.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/COperatingSystem.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/XPC.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/ObjectiveC.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Combine.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Dispatch.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Darwin.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Foundation.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreFoundation.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/CoreGraphics.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/Swift.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/IOKit.swiftmodule/x86_64-apple-macos.swiftmodule /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/macosx/prebuilt-modules/SwiftOnoneSupport.swiftmodule/x86_64-apple-macos.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOConcurrencyHelpers.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Bits.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOFoundationCompat.swiftmodule /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/swift-nio/Sources/CNIOAtomics/include/cpp_magic.h /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/swift-nio/Sources/CNIOLinux/include/ifaddrs-android.h /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/swift-nio/Sources/CNIODarwin/include/CNIODarwin.h /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/swift-nio/Sources/CNIOAtomics/include/CNIOAtomics.h /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/swift-nio/Sources/CNIOLinux/include/CNIOLinux.h /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIOSHA1.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOHTTP1.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/SQL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/PostgreSQL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/FluentPostgreSQL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/FluentSQL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOOpenSSL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIOOpenSSL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CCryptoOpenSSL.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIO.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/HTTP.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOTLS.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIOZlib.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Async.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Command.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Service.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Console.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Core.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/SQLite.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/FluentSQLite.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOPriorityQueue.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Logging.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Debugging.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Routing.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/SQLBenchmark.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/FluentBenchmark.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/COperatingSystem.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Random.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/URLEncodedForm.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIODarwin.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Authentication.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Validation.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Crypto.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/App.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIOHTTPParser.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Vapor.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIOAtomics.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Redis.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOConcurrencyHelpers.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Bits.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOFoundationCompat.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/WebSocket.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/NIOWebSocket.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/DatabaseKit.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/TemplateKit.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Fluent.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/Multipart.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/x86_64-apple-macosx/debug/CNIOLinux.build/module.modulemap /Users/panartem/Developer/Study/Microservices-vapor/TILAppUsers/.build/checkouts/swift-nio-zlib-support/module.modulemap /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/usr/include/xpc/XPC.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/usr/include/objc/ObjectiveC.apinotes /Applications/Xcode.app/Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/lib/swift/apinotes/Dispatch.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/usr/include/Darwin.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/System/Library/Frameworks/Foundation.framework/Headers/Foundation.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/System/Library/Frameworks/CoreGraphics.framework/Headers/CoreGraphics.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/System/Library/Frameworks/ApplicationServices.framework/Headers/ApplicationServices.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/System/Library/Frameworks/CoreText.framework/Headers/CoreText.apinotes /Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX10.15.sdk/System/Library/Frameworks/Security.framework/Headers/Security.apinotes
|
D
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.