API tools faq
paste
Advertisement
Guest User

Untitled

a guest
Nov 15th, 2019
118
0
Never
Add comment
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 10.82 KB | None | 0 0
raw download clone embed print report
  1. // expansion at aosoa.d(32)
  2. int[10] x;
  3.  
  4. // expansion at aosoa.d(32)
  5. int[10] y;
  6.  
  7. // expansion at aosoa.d(36)
  8. point(x[index],y[index])
  9.  
  10. // expansion at /usr/include/dlang/dmd/std/bitmanip.d(740)
  11. private uint _fraction_exponent_sign;@property uint fraction() @safe pure nothrow @nogc const { auto result = (_fraction_exponent_sign & 8388607U) >>0U; return cast(uint) result;}
  12. @property void fraction(uint v) @safe pure nothrow @nogc { assert(v >= fraction_min, "Value is smaller than the minimum value of bitfield 'fraction'"); assert(v <= fraction_max, "Value is greater than the maximum value of bitfield 'fraction'"); _fraction_exponent_sign = cast(typeof(_fraction_exponent_sign)) ((_fraction_exponent_sign & (-1-cast(typeof(_fraction_exponent_sign))8388607U)) | ((cast(typeof(_fraction_exponent_sign)) v << 0U) & 8388607U));}
  13. enum uint fraction_min = cast(uint)0U; enum uint fraction_max = cast(uint)8388607U; @property ubyte exponent() @safe pure nothrow @nogc const { auto result = (_fraction_exponent_sign & 2139095040U) >>23U; return cast(ubyte) result;}
  14. @property void exponent(ubyte v) @safe pure nothrow @nogc { assert(v >= exponent_min, "Value is smaller than the minimum value of bitfield 'exponent'"); assert(v <= exponent_max, "Value is greater than the maximum value of bitfield 'exponent'"); _fraction_exponent_sign = cast(typeof(_fraction_exponent_sign)) ((_fraction_exponent_sign & (-1-cast(typeof(_fraction_exponent_sign))2139095040U)) | ((cast(typeof(_fraction_exponent_sign)) v << 23U) & 2139095040U));}
  15. enum ubyte exponent_min = cast(ubyte)0U; enum ubyte exponent_max = cast(ubyte)255U; @property bool sign() @safe pure nothrow @nogc const { return (_fraction_exponent_sign & 2147483648U) != 0;}
  16. @property void sign(bool v) @safe pure nothrow @nogc { if (v) _fraction_exponent_sign |= 2147483648U;else _fraction_exponent_sign &= cast(typeof(_fraction_exponent_sign))(-1-cast(typeof(_fraction_exponent_sign))2147483648U);}
  17.  
  18. // expansion at /usr/include/dlang/dmd/std/bitmanip.d(821)
  19. private ulong _fraction_exponent_sign;@property ulong fraction() @safe pure nothrow @nogc const { auto result = (_fraction_exponent_sign & 4503599627370495UL) >>0U; return cast(ulong) result;}
  20. @property void fraction(ulong v) @safe pure nothrow @nogc { assert(v >= fraction_min, "Value is smaller than the minimum value of bitfield 'fraction'"); assert(v <= fraction_max, "Value is greater than the maximum value of bitfield 'fraction'"); _fraction_exponent_sign = cast(typeof(_fraction_exponent_sign)) ((_fraction_exponent_sign & (-1-cast(typeof(_fraction_exponent_sign))4503599627370495UL)) | ((cast(typeof(_fraction_exponent_sign)) v << 0U) & 4503599627370495UL));}
  21. enum ulong fraction_min = cast(ulong)0U; enum ulong fraction_max = cast(ulong)4503599627370495UL; @property ushort exponent() @safe pure nothrow @nogc const { auto result = (_fraction_exponent_sign & 9218868437227405312UL) >>52U; return cast(ushort) result;}
  22. @property void exponent(ushort v) @safe pure nothrow @nogc { assert(v >= exponent_min, "Value is smaller than the minimum value of bitfield 'exponent'"); assert(v <= exponent_max, "Value is greater than the maximum value of bitfield 'exponent'"); _fraction_exponent_sign = cast(typeof(_fraction_exponent_sign)) ((_fraction_exponent_sign & (-1-cast(typeof(_fraction_exponent_sign))9218868437227405312UL)) | ((cast(typeof(_fraction_exponent_sign)) v << 52U) & 9218868437227405312UL));}
  23. enum ushort exponent_min = cast(ushort)0U; enum ushort exponent_max = cast(ushort)2047U; @property bool sign() @safe pure nothrow @nogc const { return (_fraction_exponent_sign & 9223372036854775808UL) != 0;}
  24. @property void sign(bool v) @safe pure nothrow @nogc { if (v) _fraction_exponent_sign |= 9223372036854775808UL;else _fraction_exponent_sign &= cast(typeof(_fraction_exponent_sign))(-1-cast(typeof(_fraction_exponent_sign))9223372036854775808UL);}
  25.  
  26. // expansion at /usr/include/dlang/dmd/std/format.d(1128)
  27. private ubyte _flDash_flZero_flSpace_flPlus_flHash_flSeparator_;@property bool flDash() @safe pure nothrow @nogc const { return (_flDash_flZero_flSpace_flPlus_flHash_flSeparator_ & 1U) != 0;}
  28. @property void flDash(bool v) @safe pure nothrow @nogc { if (v) _flDash_flZero_flSpace_flPlus_flHash_flSeparator_ |= 1U;else _flDash_flZero_flSpace_flPlus_flHash_flSeparator_ &= cast(typeof(_flDash_flZero_flSpace_flPlus_flHash_flSeparator_))(-1-cast(typeof(_flDash_flZero_flSpace_flPlus_flHash_flSeparator_))1U);}
  29. @property bool flZero() @safe pure nothrow @nogc const { return (_flDash_flZero_flSpace_flPlus_flHash_flSeparator_ & 2U) != 0;}
  30. @property void flZero(bool v) @safe pure nothrow @nogc { if (v) _flDash_flZero_flSpace_flPlus_flHash_flSeparator_ |= 2U;else _flDash_flZero_flSpace_flPlus_flHash_flSeparator_ &= cast(typeof(_flDash_flZero_flSpace_flPlus_flHash_flSeparator_))(-1-cast(typeof(_flDash_flZero_flSpace_flPlus_flHash_flSeparator_))2U);}
  31. @property bool flSpace() @safe pure nothrow @nogc const { return (_flDash_flZero_flSpace_flPlus_flHash_flSeparator_ & 4U) != 0;}
  32. @property void flSpace(bool v) @safe pure nothrow @nogc { if (v) _flDash_flZero_flSpace_flPlus_flHash_flSeparator_ |= 4U;else _flDash_flZero_flSpace_flPlus_flHash_flSeparator_ &= cast(typeof(_flDash_flZero_flSpace_flPlus_flHash_flSeparator_))(-1-cast(typeof(_flDash_flZero_flSpace_flPlus_flHash_flSeparator_))4U);}
  33. @property bool flPlus() @safe pure nothrow @nogc const { return (_flDash_flZero_flSpace_flPlus_flHash_flSeparator_ & 8U) != 0;}
  34. @property void flPlus(bool v) @safe pure nothrow @nogc { if (v) _flDash_flZero_flSpace_flPlus_flHash_flSeparator_ |= 8U;else _flDash_flZero_flSpace_flPlus_flHash_flSeparator_ &= cast(typeof(_flDash_flZero_flSpace_flPlus_flHash_flSeparator_))(-1-cast(typeof(_flDash_flZero_flSpace_flPlus_flHash_flSeparator_))8U);}
  35. @property bool flHash() @safe pure nothrow @nogc const { return (_flDash_flZero_flSpace_flPlus_flHash_flSeparator_ & 16U) != 0;}
  36. @property void flHash(bool v) @safe pure nothrow @nogc { if (v) _flDash_flZero_flSpace_flPlus_flHash_flSeparator_ |= 16U;else _flDash_flZero_flSpace_flPlus_flHash_flSeparator_ &= cast(typeof(_flDash_flZero_flSpace_flPlus_flHash_flSeparator_))(-1-cast(typeof(_flDash_flZero_flSpace_flPlus_flHash_flSeparator_))16U);}
  37. @property bool flSeparator() @safe pure nothrow @nogc const { return (_flDash_flZero_flSpace_flPlus_flHash_flSeparator_ & 32U) != 0;}
  38. @property void flSeparator(bool v) @safe pure nothrow @nogc { if (v) _flDash_flZero_flSpace_flPlus_flHash_flSeparator_ |= 32U;else _flDash_flZero_flSpace_flPlus_flHash_flSeparator_ &= cast(typeof(_flDash_flZero_flSpace_flPlus_flHash_flSeparator_))(-1-cast(typeof(_flDash_flZero_flSpace_flPlus_flHash_flSeparator_))32U);}
  39.  
  40. // expansion at /usr/include/dlang/dmd/std/functional.d(469)
  41. a < b
  42.  
  43. // expansion at /usr/include/dlang/dmd/std/functional.d(472)
  44. a < b
  45.  
  46. // expansion at /usr/include/dlang/dmd/std/functional.d(443)
  47. cast(T)a < cast(T) b
  48.  
  49. // expansion at /usr/include/dlang/dmd/std/functional.d(469)
  50. a < b
  51.  
  52. // expansion at /usr/include/dlang/dmd/std/functional.d(472)
  53. a < b
  54.  
  55. // expansion at /usr/include/dlang/dmd/std/functional.d(213)
  56. alias a = __a ;
  57.  
  58. // expansion at /usr/include/dlang/dmd/std/functional.d(214)
  59. alias b = __b ;
  60.  
  61. // expansion at /usr/include/dlang/dmd/std/functional.d(215)
  62. a == b
  63.  
  64. // expansion at /usr/include/dlang/dmd/std/functional.d(443)
  65. cast(T)a < cast(T) b
  66.  
  67. // expansion at /usr/include/dlang/dmd/std/uni.d(7021)
  68.  
  69. static if (getValue)
  70. grapheme ~= ch;
  71. range.popFront();
  72.  
  73.  
  74. // expansion at
  75. size_t h = 0;foreach (i, T; typeof(p.tupleof)) static if(is(T* : const(.object.Object)*)) h = h * 33 + typeid(const(.object.Object)).getHash(cast(const void*)&p.tupleof[i]); else h = h * 33 + typeid(T).getHash(cast(const void*)&p.tupleof[i]);return h;
  76.  
  77. // expansion at
  78. size_t h = 0;foreach (i, T; typeof(p.tupleof)) static if(is(T* : const(.object.Object)*)) h = h * 33 + typeid(const(.object.Object)).getHash(cast(const void*)&p.tupleof[i]); else h = h * 33 + typeid(T).getHash(cast(const void*)&p.tupleof[i]);return h;
  79.  
  80. // expansion at
  81. size_t h = 0;foreach (i, T; typeof(p.tupleof)) static if(is(T* : const(.object.Object)*)) h = h * 33 + typeid(const(.object.Object)).getHash(cast(const void*)&p.tupleof[i]); else h = h * 33 + typeid(T).getHash(cast(const void*)&p.tupleof[i]);return h;
  82.  
  83. // expansion at /usr/include/dlang/dmd/std/uni.d(7038)
  84.  
  85. case '\u0000':..case '\u0008':case '\u000E':..case '\u001F':case '\u007F':..
  86. case '\u0084':case '\u0086':..case '\u009F': case '\u0009':..case '\u000C': case '\u0085':
  87.  
  88. // expansion at /usr/include/dlang/dmd/std/uni.d(7047)
  89.  
  90. static if (getValue)
  91. grapheme ~= ch;
  92. range.popFront();
  93.  
  94.  
  95. // expansion at /usr/include/dlang/dmd/std/uni.d(7051)
  96.  
  97. static if (getValue)
  98. grapheme ~= ch;
  99. range.popFront();
  100.  
  101.  
  102. // expansion at /usr/include/dlang/dmd/std/uni.d(7057)
  103.  
  104. static if (getValue)
  105. grapheme ~= ch;
  106. range.popFront();
  107.  
  108.  
  109. // expansion at /usr/include/dlang/dmd/std/uni.d(7061)
  110.  
  111. static if (getValue)
  112. grapheme ~= ch;
  113. range.popFront();
  114.  
  115.  
  116. // expansion at /usr/include/dlang/dmd/std/uni.d(7066)
  117.  
  118. static if (getValue)
  119. grapheme ~= ch;
  120. range.popFront();
  121.  
  122.  
  123. // expansion at /usr/include/dlang/dmd/std/uni.d(7073)
  124.  
  125. static if (getValue)
  126. grapheme ~= ch;
  127. range.popFront();
  128.  
  129.  
  130. // expansion at /usr/include/dlang/dmd/std/uni.d(7077)
  131.  
  132. static if (getValue)
  133. grapheme ~= ch;
  134. range.popFront();
  135.  
  136.  
  137. // expansion at /usr/include/dlang/dmd/std/uni.d(7085)
  138.  
  139. static if (getValue)
  140. grapheme ~= ch;
  141. range.popFront();
  142.  
  143.  
  144. // expansion at /usr/include/dlang/dmd/std/uni.d(7099)
  145.  
  146. static if (getValue)
  147. grapheme ~= ch;
  148. range.popFront();
  149.  
  150.  
  151. // expansion at
  152. size_t h = 0;foreach (i, T; typeof(p.tupleof)) static if(is(T* : const(.object.Object)*)) h = h * 33 + typeid(const(.object.Object)).getHash(cast(const void*)&p.tupleof[i]); else h = h * 33 + typeid(T).getHash(cast(const void*)&p.tupleof[i]);return h;
  153.  
  154. // expansion at
  155. size_t h = 0;foreach (i, T; typeof(p.tupleof)) static if(is(T* : const(.object.Object)*)) h = h * 33 + typeid(const(.object.Object)).getHash(cast(const void*)&p.tupleof[i]); else h = h * 33 + typeid(T).getHash(cast(const void*)&p.tupleof[i]);return h;
  156.  
  157. // expansion at
  158. size_t h = 0;foreach (i, T; typeof(p.tupleof)) static if(is(T* : const(.object.Object)*)) h = h * 33 + typeid(const(.object.Object)).getHash(cast(const void*)&p.tupleof[i]); else h = h * 33 + typeid(T).getHash(cast(const void*)&p.tupleof[i]);return h;
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
Public Pastes
Advertisement
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy.  OK, I Understand
Not a member of Pastebin yet?
Sign Up, it unlocks many cool features!