tests.inc 110 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581
  1. /*
  2. Legal:
  3. Version: MPL 1.1
  4. The contents of this file are subject to the Mozilla Public License Version
  5. 1.1 the "License"; you may not use this file except in compliance with
  6. the License. You may obtain a copy of the License at
  7. http://www.mozilla.org/MPL/
  8. Software distributed under the License is distributed on an "AS IS" basis,
  9. WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
  10. for the specific language governing rights and limitations under the
  11. License.
  12. The Original Code is the YSI framework.
  13. The Initial Developer of the Original Code is Alex "Y_Less" Cole.
  14. Portions created by the Initial Developer are Copyright C 2011
  15. the Initial Developer. All Rights Reserved.
  16. Contributors:
  17. Y_Less
  18. koolk
  19. JoeBullet/Google63
  20. g_aSlice/Slice
  21. Misiur
  22. samphunter
  23. tianmeta
  24. maddinat0r
  25. spacemud
  26. Crayder
  27. Dayvison
  28. Ahmad45123
  29. Zeex
  30. irinel1996
  31. Yiin-
  32. Chaprnks
  33. Konstantinos
  34. Masterchen09
  35. Southclaws
  36. PatchwerkQWER
  37. m0k1
  38. paulommu
  39. udan111
  40. Thanks:
  41. JoeBullet/Google63 - Handy arbitrary ASM jump code using SCTRL.
  42. ZeeX - Very productive conversations.
  43. koolk - IsPlayerinAreaEx code.
  44. TheAlpha - Danish translation.
  45. breadfish - German translation.
  46. Fireburn - Dutch translation.
  47. yom - French translation.
  48. 50p - Polish translation.
  49. Zamaroht - Spanish translation.
  50. Los - Portuguese translation.
  51. Dracoblue, sintax, mabako, Xtreme, other coders - Producing other modes for
  52. me to strive to better.
  53. Pixels^ - Running XScripters where the idea was born.
  54. Matite - Pestering me to release it and using it.
  55. Very special thanks to:
  56. Thiadmer - PAWN, whose limits continue to amaze me!
  57. Kye/Kalcor - SA:MP.
  58. SA:MP Team past, present and future - SA:MP.
  59. Optional plugins:
  60. Gamer_Z - GPS.
  61. Incognito - Streamer.
  62. Me - sscanf2, fixes2, Whirlpool.
  63. */
  64. iterfunc Test2a_y_iter(start)
  65. {
  66. switch (start)
  67. {
  68. case -1: return 0;
  69. case 0: return 2;
  70. case 2: return 3;
  71. case 3: return 100;
  72. case 100: return 999;
  73. case 999: return 1000;
  74. case 1000: return 10000;
  75. }
  76. return -1;
  77. }
  78. #define Iterator@Test2a_y_iter iterstart(-1)
  79. iterfunc static stock Test2b_y_iter(start )
  80. {
  81. switch (start)
  82. {
  83. case -1: return 0;
  84. case 0: return 1;
  85. case 1: return 2;
  86. case 2: return 3;
  87. case 3: return 4;
  88. case 4: return 5;
  89. case 5: return 6;
  90. }
  91. return -1;
  92. }
  93. #define Iterator@Test2b_y_iter iterstart(-1)
  94. iterfunc static Test2c_y_iter (start)//__declspec(stock)
  95. {
  96. switch (start)
  97. {
  98. case -1: return 0;
  99. case 0: return 2;
  100. case 2: return 3;
  101. case 3: return 100;
  102. case 100: return 999;
  103. case 999: return 1000;
  104. case 1000: return 10000;
  105. }
  106. return -1;
  107. }
  108. #define Iterator@Test2c_y_iter iterstart(-1)
  109. iterfunc stock Test2d_y_iter (start )
  110. {
  111. switch (start)
  112. {
  113. case -1: return 0;
  114. case 0: return 1;
  115. case 1: return 2;
  116. case 2: return 3;
  117. case 3: return 4;
  118. case 4: return 5;
  119. case 5: return 6;
  120. }
  121. return -1;
  122. }
  123. #define Iterator@Test2d_y_iter iterstart(-1)
  124. iterfunc stock TestState1_y_iter(&iterstate, cur)
  125. {
  126. new
  127. ret = iterstate;
  128. iterstate = cur;
  129. return ret;
  130. }
  131. #define Iterator@TestState1_y_iter iterstate(-1, 800)
  132. Test:TestState1_y_iter()
  133. {
  134. new
  135. count = 0;
  136. foreach (new i : TestState1_y_iter())
  137. {
  138. ASSERT(i == 800);
  139. ++count;
  140. }
  141. ASSERT(count == 1);
  142. }
  143. iterfunc stock TestState2_y_iter(iterstate[2], cur)
  144. {
  145. new
  146. ret = iterstate[0];
  147. iterstate[0] = iterstate[1];
  148. iterstate[1] = cur;
  149. return ret;
  150. }
  151. #define Iterator@TestState2_y_iter iterstate(-1, 500, 600)
  152. Test:TestState2_y_iter()
  153. {
  154. new
  155. count = 0;
  156. foreach (new i : TestState2_y_iter())
  157. {
  158. if (count)
  159. ASSERT(i == 600);
  160. else
  161. ASSERT(i == 500);
  162. ++count;
  163. }
  164. ASSERT(count == 2);
  165. }
  166. Test:y_iter_Range()
  167. {
  168. new
  169. count;
  170. count = 0;
  171. foreach (new i : Range(0, 10))
  172. {
  173. ASSERT(0 <= i < 10);
  174. ++count;
  175. }
  176. ASSERT(count == 10);
  177. count = 0;
  178. foreach (new i : Range(0, 10, 2))
  179. {
  180. ASSERT(0 <= i < 10);
  181. ++count;
  182. }
  183. ASSERT(count == 5);
  184. count = 0;
  185. foreach (new i : Range(0, 9, 2))
  186. {
  187. ASSERT(0 <= i < 10);
  188. ++count;
  189. }
  190. ASSERT(count == 5);
  191. count = 0;
  192. foreach (new i : Range(-10, 10))
  193. {
  194. ASSERT(-10 <= i < 10);
  195. ++count;
  196. }
  197. ASSERT(count == 20);
  198. count = 0;
  199. foreach (new i : Range(10, 10))
  200. {
  201. ++count;
  202. }
  203. ASSERT(count == 0);
  204. count = 0;
  205. foreach (new i : Range(10, 5, -1))
  206. {
  207. ++count;
  208. }
  209. ASSERT(count == 5);
  210. count = 0;
  211. foreach (new i : Range(10, 5, -5))
  212. {
  213. ++count;
  214. }
  215. ASSERT(count == 1);
  216. }
  217. Test:y_iter_Add1()
  218. {
  219. // Check we can only add a number once, and that we don't mess up the order.
  220. new
  221. Iterator:iter<20>,
  222. count,
  223. i;
  224. Iter_Add(iter, 5);
  225. ASSERT(Iter_Count(iter) == 1);
  226. for (i = 0; i != 20; ++i)
  227. {
  228. if (i == 5) ASSERT(Iter_Contains(iter, i));
  229. else ASSERT(!Iter_Contains(iter, i));
  230. }
  231. count = 0;
  232. foreach (i : iter)
  233. {
  234. ASSERT(i == 5);
  235. ++count;
  236. }
  237. ASSERT(count == 1);
  238. Iter_Add(iter, 5);
  239. ASSERT(Iter_Count(iter) == 1);
  240. for (i = 0; i != 20; ++i)
  241. {
  242. if (i == 5) ASSERT(Iter_Contains(iter, i));
  243. else ASSERT(!Iter_Contains(iter, i));
  244. }
  245. count = 0;
  246. foreach (i : iter)
  247. {
  248. ASSERT(i == 5);
  249. ++count;
  250. }
  251. ASSERT(count == 1);
  252. }
  253. Test:y_iter_Add2()
  254. {
  255. // Check we can only add a number once, and that we don't mess up the order.
  256. new
  257. Iterator:iter<20>,
  258. count,
  259. i;
  260. Iter_Add(iter, 3);
  261. Iter_Add(iter, 15);
  262. ASSERT(Iter_Count(iter) == 2);
  263. for (i = 0; i != 20; ++i)
  264. {
  265. if (i == 3 || i == 15) ASSERT(Iter_Contains(iter, i));
  266. else ASSERT(!Iter_Contains(iter, i));
  267. }
  268. count = 0;
  269. foreach (i : iter)
  270. {
  271. ASSERT(i == 3 || i == 15);
  272. ++count;
  273. }
  274. ASSERT(count == 2);
  275. Iter_Add(iter, 3);
  276. ASSERT(Iter_Count(iter) == 2);
  277. for (i = 0; i != 20; ++i)
  278. {
  279. if (i == 3 || i == 15) ASSERT(Iter_Contains(iter, i));
  280. else ASSERT(!Iter_Contains(iter, i));
  281. }
  282. count = 0;
  283. foreach (i : iter)
  284. {
  285. ASSERT(i == 3 || i == 15);
  286. ++count;
  287. }
  288. ASSERT(count == 2);
  289. Iter_Add(iter, 15);
  290. ASSERT(Iter_Count(iter) == 2);
  291. for (i = 0; i != 20; ++i)
  292. {
  293. if (i == 3 || i == 15) ASSERT(Iter_Contains(iter, i));
  294. else ASSERT(!Iter_Contains(iter, i));
  295. }
  296. count = 0;
  297. foreach (i : iter)
  298. {
  299. ASSERT(i == 3 || i == 15);
  300. ++count;
  301. }
  302. ASSERT(count == 2);
  303. }
  304. Test:y_iter_Prev()
  305. {
  306. // Check we can only add a number once, and that we don't mess up the order.
  307. new
  308. Iterator:iter<20>,
  309. count,
  310. i;
  311. Iter_Add(iter, 3);
  312. Iter_Add(iter, 4);
  313. ASSERT(Iter_Count(iter) == 2);
  314. for (i = 0; i != 20; ++i)
  315. {
  316. if (i == 3 || i == 4) ASSERT(Iter_Contains(iter, i));
  317. else ASSERT(!Iter_Contains(iter, i));
  318. }
  319. count = 0;
  320. foreach (i : iter)
  321. {
  322. ASSERT(i == 3 || i == 4);
  323. ++count;
  324. }
  325. ASSERT(count == 2);
  326. ASSERT(Iter_Next(iter, 3) == 4);
  327. ASSERT(Iter_Prev(iter, 4) == 3);
  328. ASSERT(Iter_First(iter) == 3);
  329. ASSERT(Iter_Last(iter) == 4);
  330. Iter_Add(iter, 18);
  331. ASSERT(Iter_Last(iter) == 18);
  332. Iter_Add(iter, 19);
  333. ASSERT(Iter_Last(iter) == 19);
  334. Iter_Add(iter, 19);
  335. ASSERT(Iter_Last(iter) == 19);
  336. ASSERT(Iter_Prev(iter, 20) == 19);
  337. ASSERT(Iter_Prev(iter, 19) == 18);
  338. ASSERT(Iter_Prev(iter, 18) == 4);
  339. ASSERT(Iter_Next(iter, 19) == 20);
  340. ASSERT(Iter_Next(iter, 18) == 19);
  341. ASSERT(Iter_Next(iter, 4) == 18);
  342. Iter_Add(iter, 0);
  343. ASSERT(Iter_Prev(iter, 0) == 20);
  344. ASSERT(Iter_Next(iter, 20) == 0);
  345. }
  346. Test:y_iter_Add3()
  347. {
  348. // Check OOB numbers.
  349. new
  350. Iterator:iter<20>,
  351. count,
  352. i;
  353. Iter_Add(iter, 4);
  354. Iter_Add(iter, 20);
  355. ASSERT(Iter_Count(iter) == 1);
  356. for (i = 0; i != 20; ++i)
  357. {
  358. if (i == 4) ASSERT(Iter_Contains(iter, i));
  359. else ASSERT(!Iter_Contains(iter, i));
  360. }
  361. count = 0;
  362. foreach (i : iter)
  363. {
  364. ASSERT(i == 4);
  365. ++count;
  366. }
  367. ASSERT(count == 1);
  368. }
  369. Test:y_iter_Add4()
  370. {
  371. // Check OOB numbers.
  372. new
  373. Iterator:iter<20>,
  374. count,
  375. i;
  376. Iter_Add(iter, 0);
  377. Iter_Add(iter, 50);
  378. ASSERT(Iter_Count(iter) == 1);
  379. for (i = 0; i != 20; ++i)
  380. {
  381. if (i == 0) ASSERT(Iter_Contains(iter, i));
  382. else ASSERT(!Iter_Contains(iter, i));
  383. }
  384. count = 0;
  385. foreach (i : iter)
  386. {
  387. ASSERT(i == 0);
  388. ++count;
  389. }
  390. ASSERT(count == 1);
  391. }
  392. Test:y_iter_Add5()
  393. {
  394. // Add all numbers.
  395. new
  396. Iterator:iter<20>,
  397. count,
  398. i;
  399. ASSERT(Iter_Count(iter) == 0);
  400. for (i = 0; i != 20; ++i)
  401. {
  402. ASSERT(Iter_Add(iter, i) == i);
  403. }
  404. for (i = 20; i != 40; ++i)
  405. {
  406. ASSERT(Iter_Add(iter, i) != i);
  407. }
  408. ASSERT(Iter_Count(iter) == 20);
  409. count = 0;
  410. foreach (i : iter)
  411. {
  412. ASSERT(0 <= i < 20);
  413. ++count;
  414. }
  415. ASSERT(count == 20);
  416. }
  417. Test:y_iter_MultiAdd1()
  418. {
  419. // Add all numbers.
  420. new
  421. Iterator:iter<5, 15>,
  422. count,
  423. i = 6;
  424. ASSERT(Iter_Add(iter<0>, 0) == 0);
  425. ASSERT(Iter_Add(iter<0>, 0) != 0);
  426. ASSERT(Iter_Add(iter<0>, 1) == 1);
  427. // ASSERT(Iter_Add(iter<i>, 2) != 2);
  428. ASSERT(Iter_Add(iter<2>, 2) == 2);
  429. ASSERT(Iter_Add(iter<2>, 16) != 16);
  430. ASSERT(Iter_Count(iter<0>) == 2);
  431. ASSERT(Iter_Count(iter<1>) == 0);
  432. ASSERT(Iter_Count(iter<2>) == 1);
  433. ASSERT(Iter_Count(iter<3>) == 0);
  434. ASSERT(Iter_Count(iter<4>) == 0);
  435. count = 0;
  436. foreach (i : iter<0>)
  437. {
  438. ASSERT(i == 0 || i == 1);
  439. ++count;
  440. }
  441. ASSERT(count == 2);
  442. count = 0;
  443. foreach (i : iter<2>)
  444. {
  445. ASSERT(i == 2);
  446. ++count;
  447. }
  448. ASSERT(count == 1);
  449. }
  450. Test:y_iter_Remove1()
  451. {
  452. new
  453. Iterator:iter<50>,
  454. count;
  455. for (new i = 0; i != 20; ++i)
  456. {
  457. Iter_Add(iter, i * 2 + 1);
  458. }
  459. ASSERT(Iter_Count(iter) == 20);
  460. foreach (new i : iter)
  461. {
  462. ASSERT((i & 1) == 1);
  463. ++count;
  464. }
  465. ASSERT(count == 20);
  466. Iter_Remove(iter, 1);
  467. ASSERT(Iter_Count(iter) == 19);
  468. Iter_Remove(iter, 1);
  469. ASSERT(Iter_Count(iter) == 19);
  470. ASSERT(Iter_Count(iter) == 19);
  471. ASSERT(Iter_First(iter) == 3);
  472. ASSERT(Iter_Prev(iter, 3) == 50);
  473. ASSERT(Iter_Next(iter, 3) == 5);
  474. ASSERT(Iter_Prev(iter, 5) == 3);
  475. ASSERT(Iter_Next(iter, 5) == 7);
  476. ASSERT(Iter_Prev(iter, 7) == 5);
  477. Iter_Remove(iter, 5);
  478. ASSERT(Iter_First(iter) == 3);
  479. ASSERT(Iter_Prev(iter, 3) == 50);
  480. ASSERT(Iter_Next(iter, 3) == 7);
  481. ASSERT(Iter_Prev(iter, 7) == 3);
  482. ASSERT(Iter_Count(iter) == 18);
  483. count = 0;
  484. foreach (new i : iter)
  485. {
  486. ASSERT(i == 3 || i > 5);
  487. ++count;
  488. }
  489. ASSERT(count == 18);
  490. Iter_Remove(iter, 1);
  491. count = 0;
  492. foreach (new i : iter)
  493. {
  494. ASSERT(i == 3 || i > 5);
  495. ++count;
  496. }
  497. ASSERT(count == 18);
  498. }
  499. Test:y_iter_Reverse1()
  500. {
  501. new
  502. count,
  503. Iterator:iter<10>;
  504. Iter_Add(iter, 2);
  505. Iter_Add(iter, 4);
  506. Iter_Add(iter, 6);
  507. Iter_Add(iter, 3);
  508. Iter_Add(iter, 6);
  509. Iter_Add(iter, 9);
  510. count = 0;
  511. foreach (new i : Reverse(iter))
  512. {
  513. ++count;
  514. }
  515. ASSERT(count == 5);
  516. }
  517. Test:y_iter_RandomRemove1()
  518. {
  519. new
  520. Iterator:iter<10>;
  521. Iter_Add(iter, 2);
  522. ASSERT(Iter_RandomRemove(iter) != cellmin);
  523. ASSERT(Iter_RandomRemove(iter) == cellmin);
  524. ASSERT(Iter_RandomRemove(iter) == cellmin);
  525. ASSERT(Iter_RandomRemove(iter) == cellmin);
  526. ASSERT(Iter_Count(iter) == 0);
  527. }
  528. Test:y_iter_RandomRemove2()
  529. {
  530. new
  531. Iterator:iter[3]<10>;
  532. Iter_Init(iter);
  533. Iter_Add(iter[0], 2);
  534. Iter_Add(iter[0], 3);
  535. Iter_Add(iter[0], 4);
  536. Iter_Add(iter[0], 5);
  537. Iter_Add(iter[0], 6);
  538. Iter_Add(iter[0], 9);
  539. ASSERT(Iter_RandomRemove(iter[0]) != cellmin);
  540. ASSERT(Iter_RandomRemove(iter[0]) != cellmin);
  541. ASSERT(Iter_RandomRemove(iter[0]) != cellmin);
  542. ASSERT(Iter_RandomRemove(iter[0]) != cellmin);
  543. ASSERT(Iter_RandomRemove(iter[0]) != cellmin);
  544. ASSERT(Iter_RandomRemove(iter[0]) != cellmin);
  545. ASSERT(Iter_RandomRemove(iter[0]) == cellmin);
  546. ASSERT(Iter_RandomRemove(iter[0]) == cellmin);
  547. ASSERT(Iter_RandomRemove(iter[0]) == cellmin);
  548. ASSERT(Iter_RandomRemove(iter[0]) == cellmin);
  549. ASSERT(Iter_Count(iter[0]) == 0);
  550. ASSERT(Iter_Count(iter[1]) == 0);
  551. }
  552. Test:y_iter_RandomRemove3()
  553. {
  554. new
  555. Iterator:iter<2, 10>;
  556. Iter_Add(iter<0>, 2);
  557. ASSERT(Iter_RandomRemove(iter<0>) != cellmin);
  558. ASSERT(Iter_RandomRemove(iter<1>) == cellmin);
  559. ASSERT(Iter_RandomRemove(iter<0>) == cellmin);
  560. ASSERT(Iter_Count(iter<0>) == 0);
  561. ASSERT(Iter_Count(iter<1>) == 0);
  562. }
  563. Test:y_iter_RandomAdd1()
  564. {
  565. new
  566. Iterator:iter<10>;
  567. Iter_Add(iter, 2);
  568. ASSERT(Iter_RandomAdd(iter) != cellmin);
  569. ASSERT(Iter_RandomAdd(iter) != cellmin);
  570. ASSERT(Iter_RandomAdd(iter) != cellmin);
  571. ASSERT(Iter_RandomAdd(iter) != cellmin);
  572. ASSERT(Iter_RandomAdd(iter) != cellmin);
  573. ASSERT(Iter_RandomAdd(iter) != cellmin);
  574. ASSERT(Iter_RandomAdd(iter) != cellmin);
  575. ASSERT(Iter_RandomAdd(iter) != cellmin);
  576. ASSERT(Iter_RandomAdd(iter) != cellmin);
  577. ASSERT(Iter_RandomAdd(iter) == cellmin);
  578. ASSERT(Iter_RandomAdd(iter) == cellmin);
  579. ASSERT(Iter_RandomAdd(iter) == cellmin);
  580. ASSERT(Iter_Count(iter) == 10);
  581. }
  582. Test:y_iter_RandomAdd2()
  583. {
  584. new
  585. Iterator:iter[3]<10>;
  586. Iter_Init(iter);
  587. Iter_Add(iter[0], 2);
  588. ASSERT(Iter_RandomAdd(iter[0]) != cellmin);
  589. ASSERT(Iter_RandomAdd(iter[0]) != cellmin);
  590. ASSERT(Iter_RandomAdd(iter[0]) != cellmin);
  591. ASSERT(Iter_RandomAdd(iter[0]) != cellmin);
  592. ASSERT(Iter_RandomAdd(iter[0]) != cellmin);
  593. ASSERT(Iter_RandomAdd(iter[0]) != cellmin);
  594. ASSERT(Iter_RandomAdd(iter[0]) != cellmin);
  595. ASSERT(Iter_RandomAdd(iter[0]) != cellmin);
  596. ASSERT(Iter_RandomAdd(iter[0]) != cellmin);
  597. ASSERT(Iter_RandomAdd(iter[0]) == cellmin);
  598. ASSERT(Iter_RandomAdd(iter[0]) == cellmin);
  599. ASSERT(Iter_RandomAdd(iter[0]) == cellmin);
  600. ASSERT(Iter_RandomAdd(iter[1]) != cellmin);
  601. ASSERT(Iter_RandomAdd(iter[1]) != cellmin);
  602. ASSERT(Iter_RandomAdd(iter[1]) != cellmin);
  603. ASSERT(Iter_RandomAdd(iter[1]) != cellmin);
  604. ASSERT(Iter_RandomAdd(iter[1]) != cellmin);
  605. ASSERT(Iter_RandomAdd(iter[1]) != cellmin);
  606. ASSERT(Iter_RandomAdd(iter[1]) != cellmin);
  607. ASSERT(Iter_RandomAdd(iter[1]) != cellmin);
  608. ASSERT(Iter_RandomAdd(iter[1]) != cellmin);
  609. ASSERT(Iter_RandomAdd(iter[1]) != cellmin);
  610. ASSERT(Iter_RandomAdd(iter[0]) == cellmin);
  611. ASSERT(Iter_RandomAdd(iter[0]) == cellmin);
  612. ASSERT(Iter_RandomAdd(iter[0]) == cellmin);
  613. ASSERT(Iter_Count(iter[0]) == 10);
  614. ASSERT(Iter_Count(iter[1]) == 10);
  615. }
  616. Test:y_iter_RandomAdd3()
  617. {
  618. new
  619. Iterator:iter<2, 10>;
  620. Iter_Add(iter<0>, 2);
  621. ASSERT(Iter_RandomAdd(iter<0>) != cellmin);
  622. ASSERT(Iter_RandomAdd(iter<0>) != cellmin);
  623. ASSERT(Iter_RandomAdd(iter<0>) != cellmin);
  624. ASSERT(Iter_RandomAdd(iter<1>) != cellmin);
  625. ASSERT(Iter_RandomAdd(iter<1>) != cellmin);
  626. ASSERT(Iter_RandomAdd(iter<1>) != cellmin);
  627. ASSERT(Iter_RandomAdd(iter<1>) != cellmin);
  628. ASSERT(Iter_RandomAdd(iter<1>) != cellmin);
  629. ASSERT(Iter_RandomAdd(iter<1>) != cellmin);
  630. ASSERT(Iter_RandomAdd(iter<0>) == cellmin);
  631. ASSERT(Iter_RandomAdd(iter<1>) == cellmin);
  632. ASSERT(Iter_RandomAdd(iter<0>) == cellmin);
  633. ASSERT(Iter_Count(iter<0>) == 4);
  634. ASSERT(Iter_Count(iter<1>) == 6);
  635. }
  636. Test:y_iter_RandomFree1()
  637. {
  638. new
  639. Iterator:iter<10>,
  640. vals[10];
  641. Iter_Add(iter, 2);
  642. Iter_Add(iter, 4);
  643. Iter_Add(iter, 6);
  644. Iter_Add(iter, 3);
  645. Iter_Add(iter, 6);
  646. Iter_Add(iter, 9);
  647. for (new i = 0; i != 10000; ++i)
  648. {
  649. new v = Iter_RandomFree(iter);
  650. ASSERT(v != 2);
  651. ASSERT(v != 4);
  652. ASSERT(v != 6);
  653. ASSERT(v != 3);
  654. ASSERT(v != 9);
  655. ++vals[v];
  656. }
  657. ASSERT(vals[0] != 0);
  658. ASSERT(vals[1] != 0);
  659. ASSERT(vals[5] != 0);
  660. ASSERT(vals[7] != 0);
  661. ASSERT(vals[8] != 0);
  662. Iter_Add(iter, 0);
  663. Iter_Add(iter, 1);
  664. Iter_Add(iter, 5);
  665. Iter_Add(iter, 7);
  666. Iter_Add(iter, 8);
  667. ASSERT(Iter_RandomFree(iter) == cellmin);
  668. }
  669. Test:y_iter_RandomFree2()
  670. {
  671. new
  672. Iterator:iter<2, 10>,
  673. vals[10];
  674. Iter_Add(iter<0>, 2);
  675. Iter_Add(iter<0>, 4);
  676. Iter_Add(iter<0>, 6);
  677. Iter_Add(iter<1>, 3);
  678. Iter_Add(iter<1>, 6);
  679. Iter_Add(iter<1>, 9);
  680. for (new i = 0; i != 10000; ++i)
  681. {
  682. new v = Iter_RandomFree(iter<>);
  683. ASSERT(v != 2);
  684. ASSERT(v != 4);
  685. ASSERT(v != 6);
  686. ASSERT(v != 3);
  687. ASSERT(v != 9);
  688. ++vals[v];
  689. }
  690. ASSERT(vals[0] != 0);
  691. ASSERT(vals[1] != 0);
  692. ASSERT(vals[5] != 0);
  693. ASSERT(vals[7] != 0);
  694. ASSERT(vals[8] != 0);
  695. Iter_Add(iter<0>, 0);
  696. Iter_Add(iter<0>, 1);
  697. Iter_Add(iter<0>, 5);
  698. Iter_Add(iter<0>, 7);
  699. Iter_Add(iter<0>, 8);
  700. ASSERT(Iter_RandomFree(iter<0>) == cellmin);
  701. ASSERT(Iter_RandomFree(iter<1>) == cellmin);
  702. }
  703. Test:y_iter_RandomFree3()
  704. {
  705. new
  706. Iterator:iter[2]<10>,
  707. vals[2][10];
  708. Iter_Init(iter);
  709. Iter_Add(iter[0], 2);
  710. Iter_Add(iter[0], 4);
  711. Iter_Add(iter[0], 6);
  712. Iter_Add(iter[1], 3);
  713. Iter_Add(iter[1], 6);
  714. Iter_Add(iter[1], 9);
  715. for (new v, i = 0; i != 10000; ++i)
  716. {
  717. v = Iter_RandomFree(iter[0]);
  718. ASSERT(v != 2);
  719. ASSERT(v != 4);
  720. ASSERT(v != 6);
  721. ++vals[0][v];
  722. v = Iter_RandomFree(iter[1]);
  723. ASSERT(v != 6);
  724. ASSERT(v != 3);
  725. ASSERT(v != 9);
  726. ++vals[1][v];
  727. }
  728. ASSERT(vals[0][0] != 0);
  729. ASSERT(vals[0][1] != 0);
  730. ASSERT(vals[0][3] != 0);
  731. ASSERT(vals[0][5] != 0);
  732. ASSERT(vals[0][7] != 0);
  733. ASSERT(vals[0][8] != 0);
  734. ASSERT(vals[0][9] != 0);
  735. ASSERT(vals[1][0] != 0);
  736. ASSERT(vals[1][1] != 0);
  737. ASSERT(vals[1][2] != 0);
  738. ASSERT(vals[1][4] != 0);
  739. ASSERT(vals[1][5] != 0);
  740. ASSERT(vals[1][7] != 0);
  741. ASSERT(vals[1][8] != 0);
  742. Iter_Add(iter[0], 0);
  743. Iter_Add(iter[0], 1);
  744. Iter_Add(iter[0], 3);
  745. Iter_Add(iter[0], 5);
  746. Iter_Add(iter[0], 7);
  747. Iter_Add(iter[0], 8);
  748. Iter_Add(iter[0], 9);
  749. ASSERT(Iter_RandomFree(iter[0]) == cellmin);
  750. ASSERT(Iter_RandomFree(iter[1]) != cellmin);
  751. Iter_Remove(iter[0], 0);
  752. Iter_Remove(iter[0], 1);
  753. Iter_Remove(iter[0], 2);
  754. Iter_Remove(iter[0], 3);
  755. Iter_Add(iter[1], 0);
  756. Iter_Add(iter[1], 1);
  757. Iter_Add(iter[1], 2);
  758. Iter_Add(iter[1], 4);
  759. Iter_Add(iter[1], 5);
  760. Iter_Add(iter[1], 7);
  761. Iter_Add(iter[1], 8);
  762. ASSERT(Iter_RandomFree(iter[0]) != cellmin);
  763. ASSERT(Iter_RandomFree(iter[1]) == cellmin);
  764. }
  765. Test:y_iter_Reverse2()
  766. {
  767. new
  768. count,
  769. Iterator:iter<5, 10>;
  770. Iter_Add(iter<1>, 2);
  771. Iter_Add(iter<1>, 4);
  772. Iter_Add(iter<1>, 6);
  773. Iter_Add(iter<2>, 0);
  774. Iter_Add(iter<2>, 3);
  775. Iter_Add(iter<2>, 6);
  776. Iter_Add(iter<2>, 9);
  777. count = 0;
  778. foreach (new i : Reverse(iter<1>))
  779. {
  780. ++count;
  781. }
  782. ASSERT(count == 3);
  783. count = 0;
  784. foreach (new i : Reverse(iter<2>))
  785. {
  786. ++count;
  787. }
  788. ASSERT(count == 3);
  789. }
  790. Test:y_iter_Remove2()
  791. {
  792. new
  793. Iterator:iter<5, 10>;
  794. Iter_Add(iter<1>, 2);
  795. Iter_Add(iter<1>, 4);
  796. Iter_Add(iter<1>, 6);
  797. Iter_Add(iter<2>, 0);
  798. Iter_Add(iter<2>, 3);
  799. Iter_Add(iter<2>, 6);
  800. Iter_Add(iter<2>, 9);
  801. ASSERT(Iter_First(iter<1>) == 2);
  802. ASSERT(Iter_First(iter<2>) == 0);
  803. ASSERT(Iter_Next(iter<1>, 2) == 4);
  804. ASSERT(Iter_Next(iter<2>, 0) == 3);
  805. ASSERT(Iter_Next(iter<2>, 3) == 9);
  806. ASSERT(Iter_Prev(iter<1>, 4) == 2);
  807. ASSERT(Iter_Prev(iter<2>, 3) == 0);
  808. ASSERT(Iter_Prev(iter<2>, 9) == 3);
  809. ASSERT(Iter_Count(iter<1>) == 3);
  810. ASSERT(Iter_Count(iter<2>) == 3);
  811. Iter_Remove(iter<1>, 0);
  812. ASSERT(Iter_First(iter<1>) == 2);
  813. ASSERT(Iter_First(iter<2>) == 0);
  814. ASSERT(Iter_Next(iter<1>, 2) == 4);
  815. ASSERT(Iter_Next(iter<2>, 0) == 3);
  816. ASSERT(Iter_Next(iter<2>, 3) == 9);
  817. ASSERT(Iter_Prev(iter<1>, 4) == 2);
  818. ASSERT(Iter_Prev(iter<2>, 3) == 0);
  819. ASSERT(Iter_Prev(iter<2>, 9) == 3);
  820. ASSERT(Iter_Count(iter<1>) == 3);
  821. ASSERT(Iter_Count(iter<2>) == 3);
  822. Iter_Remove(iter<2>, 0);
  823. ASSERT(Iter_First(iter<1>) == 2);
  824. ASSERT(Iter_First(iter<2>) == 3);
  825. ASSERT(Iter_Next(iter<1>, 2) == 4);
  826. ASSERT(Iter_Next(iter<2>, 3) == 9);
  827. ASSERT(Iter_Prev(iter<1>, 4) == 2);
  828. ASSERT(Iter_Prev(iter<2>, 3) >= 10);
  829. ASSERT(Iter_Prev(iter<2>, 9) == 3);
  830. ASSERT(Iter_Prev(iter<3>, Iter_Begin(iter<3>)) >= 10);
  831. ASSERT(Iter_Count(iter<1>) == 3);
  832. ASSERT(Iter_Count(iter<2>) == 2);
  833. }
  834. Test:y_iter_Tags()
  835. {
  836. new
  837. Iterator:iter[5]<4>,
  838. GG:gg = GG:4;
  839. Iter_Init(iter);
  840. Iter_Add(iter[_:gg], 2);
  841. Iter_Add(iter[_:gg], 1);
  842. Iter_Clear(iter[_:gg]);
  843. }
  844. Test:y_iter_Iter_Init1()
  845. {
  846. new
  847. Iterator:iter[10]<20>;
  848. #pragma unused Iter_Single@iter
  849. Iter_Init(iter);
  850. ASSERT(Iter_TrueArray(iter)[0][20] == 20);
  851. ASSERT(Iter_TrueArray(iter)[0][19] <= 19);
  852. ASSERT(Iter_TrueArray(iter)[1][20] == 20);
  853. ASSERT(Iter_TrueArray(iter)[1][19] <= 19);
  854. ASSERT(Iter_TrueArray(iter)[9][20] == 20);
  855. ASSERT(Iter_TrueArray(iter)[9][19] <= 19);
  856. }
  857. Test:y_iter_Iter_Init2()
  858. {
  859. new
  860. Iterator:iter[10]<5, 20>;
  861. #pragma unused Iter_Multi@iter
  862. Iter_Init(iter);
  863. ASSERT(Iter_TrueArray(iter)[0][21] >= 20);
  864. ASSERT(Iter_TrueArray(iter)[0][20] == 20);
  865. ASSERT(Iter_TrueArray(iter)[0][19] <= 19);
  866. ASSERT(Iter_TrueArray(iter)[2][24] >= 20);
  867. ASSERT(Iter_TrueArray(iter)[2][20] == 20);
  868. ASSERT(Iter_TrueArray(iter)[2][19] <= 19);
  869. ASSERT(Iter_TrueArray(iter)[8][24] >= 20);
  870. ASSERT(Iter_TrueArray(iter)[8][20] == 20);
  871. ASSERT(Iter_TrueArray(iter)[8][19] <= 19);
  872. }
  873. Test:y_iter_Starting()
  874. {
  875. new
  876. Iterator:Test1_y_iter<100>,
  877. i,
  878. j;
  879. Iter_Add(Test1_y_iter, 4);
  880. Iter_Add(Test1_y_iter, 8);
  881. Iter_Add(Test1_y_iter, 2);
  882. Iter_Add(Test1_y_iter, 60);
  883. ASSERT(Iter_Begin(Test1_y_iter) >= 100);
  884. ASSERT(Iter_First(Test1_y_iter) == 2);
  885. ASSERT(Iter_Next(Test1_y_iter, Iter_First(Test1_y_iter)) == 4);
  886. ASSERT(Iter_Next(Test1_y_iter, Iter_Begin(Test1_y_iter)) == 2);
  887. i = Iter_Begin(Test1_y_iter);
  888. ASSERT(!Iter_Contains(Test1_y_iter, i));
  889. i = Iter_First(Test1_y_iter);
  890. ASSERT(Iter_Contains(Test1_y_iter, i));
  891. i = Iter_Begin(Test1_y_iter);
  892. ASSERT((i = Iter_Next(Test1_y_iter, i)) == 2);
  893. ASSERT((i = Iter_Next(Test1_y_iter, i)) == 4);
  894. ASSERT((i = Iter_Next(Test1_y_iter, i)) == 8);
  895. ASSERT((i = Iter_Next(Test1_y_iter, i)) == 60);
  896. j = Iter_End(Test1_y_iter);
  897. ASSERT((i = Iter_Next(Test1_y_iter, i)) == j);
  898. j = Iter_Free(Test1_y_iter);
  899. ASSERT(!Iter_Contains(Test1_y_iter, j));
  900. j = Iter_Alloc(Test1_y_iter);
  901. ASSERT(Iter_Contains(Test1_y_iter, j));
  902. }
  903. Test:y_iter_Iter_Contains1()
  904. {
  905. new
  906. Iterator:iter1<60>;
  907. ASSERT(!Iter_Contains(iter1, 7));
  908. Iter_Add(iter1, 7);
  909. ASSERT(Iter_Contains(iter1, 7));
  910. new
  911. Iterator:iter2<5, 60>;
  912. ASSERT(!Iter_Contains(iter2<>, 5));
  913. ASSERT(!Iter_Contains(iter2<0>, 5));
  914. ASSERT(!Iter_Contains(iter2<4>, 5));
  915. Iter_Add(iter2<4>, 5);
  916. ASSERT(Iter_Contains(iter2<>, 5));
  917. ASSERT(Iter_Contains(iter2< >, 5));
  918. ASSERT(!Iter_Contains(iter2<0>, 5));
  919. ASSERT(Iter_Contains(iter2<4>, 5));
  920. }
  921. Test:y_iter_Iter_Contains2()
  922. {
  923. new
  924. Iterator:iter1[4]<60>;
  925. Iter_Init(iter1);
  926. ASSERT(!Iter_Contains(iter1[0], 7));
  927. ASSERT(!Iter_Contains(iter1[1], 7));
  928. Iter_Add(iter1[0], 7);
  929. ASSERT(Iter_Contains(iter1[0], 7));
  930. ASSERT(!Iter_Contains(iter1[1], 7));
  931. new
  932. Iterator:iter2[7]<5, 60>;
  933. Iter_Init(iter2);
  934. ASSERT(!Iter_Contains(iter2[3]<>, 5));
  935. ASSERT(!Iter_Contains(iter2[3]<0>, 5));
  936. ASSERT(!Iter_Contains(iter2[3]<4>, 5));
  937. Iter_Add(iter2[3]<4>, 5);
  938. ASSERT(Iter_Contains(iter2[3]<>, 5));
  939. ASSERT(Iter_Contains(iter2[3]< >, 5));
  940. ASSERT(!Iter_Contains(iter2[3]<0>, 5));
  941. ASSERT(Iter_Contains(iter2[3]<4>, 5));
  942. ASSERT(!Iter_Contains(iter2[5]<>, 5));
  943. ASSERT(!Iter_Contains(iter2[5]< >, 5));
  944. ASSERT(!Iter_Contains(iter2[5]<0>, 5));
  945. ASSERT(!Iter_Contains(iter2[5]<4>, 5));
  946. }
  947. Test:y_iter_Iter_Free()
  948. {
  949. new
  950. Iterator:iter1<60>;
  951. ASSERT(Iter_Free(iter1) == 0);
  952. Iter_Add(iter1, 0);
  953. ASSERT(Iter_Free(iter1) != 0);
  954. new
  955. Iterator:iter2<5, 60>;
  956. ASSERT(Iter_Free(iter2<>) == 0);
  957. ASSERT(Iter_Free(iter2<1>) == 0);
  958. ASSERT(Iter_Free(iter2<3>) == 0);
  959. Iter_Add(iter2<3>, 0);
  960. ASSERT(Iter_Free(iter2<>) != 0);
  961. ASSERT(Iter_Free(iter2<1>) != 0);
  962. ASSERT(Iter_Free(iter2<3>) != 0);
  963. }
  964. Test:y_iter_Tag()
  965. {
  966. new
  967. Iterator:Group:iter1<60>;
  968. Iter_Add(iter1, Group:33);
  969. #pragma tabsize 4
  970. /* ====================================================================== */
  971. /* | THERE IS MEANT TO BE A WARNING ON THIS LINE | */
  972. /* | | */
  973. /* | */ Iter_Add(iter1, 44); /* | */
  974. /* | | */
  975. /* | It tests that iterators use tags correctly and warn otherwise. | */
  976. /* ====================================================================== */
  977. #pragma tabsize 4
  978. Iter_Add(iter1, Group:55);
  979. Iter_Add(iter1, Group:22);
  980. Iter_Add(iter1, Group:11);
  981. #pragma tabsize 4
  982. /* ====================================================================== */
  983. /* | THERE IS MEANT TO BE A WARNING ON THIS LINE | */
  984. /* | | */
  985. /* | */ Iter_Remove(iter1, 11); /* | */
  986. /* | | */
  987. /* | It tests that iterators use tags correctly and warn otherwise. | */
  988. /* ====================================================================== */
  989. #pragma tabsize 4
  990. Iter_Alloc(iter1);
  991. foreach (new Group:i : iter1)
  992. {
  993. ASSERT(i / Group:11 * Group:11 == i);
  994. }
  995. }
  996. Test:y_iter_Iter_Alloc()
  997. {
  998. new
  999. Iterator:iter1<60>;
  1000. ASSERT(Iter_Alloc(iter1) == 0);
  1001. ASSERT(Iter_Alloc(iter1) == 1);
  1002. ASSERT(Iter_Alloc(iter1) == 2);
  1003. ASSERT(Iter_Alloc(iter1) == 3);
  1004. ASSERT(Iter_Alloc(iter1) == 4);
  1005. ASSERT(Iter_Alloc(iter1) == 5);
  1006. Iter_Remove(iter1, 5);
  1007. ASSERT(Iter_Alloc(iter1) == 5);
  1008. ASSERT(Iter_Alloc(iter1) == 6);
  1009. ASSERT(Iter_Alloc(iter1) == 7);
  1010. ASSERT(Iter_Alloc(iter1) == 8);
  1011. ASSERT(Iter_Alloc(iter1) == 9);
  1012. Iter_Remove(iter1, 5);
  1013. Iter_Remove(iter1, 6);
  1014. Iter_Remove(iter1, 7);
  1015. ASSERT(Iter_Alloc(iter1) == 5);
  1016. ASSERT(Iter_Alloc(iter1) == 6);
  1017. ASSERT(Iter_Alloc(iter1) == 7);
  1018. ASSERT(Iter_Alloc(iter1) == 10);
  1019. }
  1020. Test:y_iter_Normal()
  1021. {
  1022. new
  1023. Iterator: Test1_y_iter<100>;
  1024. Iter_Add(Test1_y_iter, 70);
  1025. Iter_Add(Test1_y_iter, 51);
  1026. Iter_Add(Test1_y_iter, 11);
  1027. Iter_Add(Test1_y_iter, 88);
  1028. Iter_Add(Test1_y_iter, 202);
  1029. Iter_Add(Test1_y_iter, -7);
  1030. new
  1031. Test2_y_iter[100];
  1032. foreach (new i : Test1_y_iter)
  1033. {
  1034. Test2_y_iter[i] = 1;
  1035. }
  1036. for (new i = 0; i != sizeof (Test2_y_iter); ++i)
  1037. {
  1038. if (i == 11 || i == 51 || i == 70 || i == 88)
  1039. {
  1040. ASSERT(Test2_y_iter[i] != 0);
  1041. }
  1042. else
  1043. {
  1044. ASSERT(Test2_y_iter[i] == 0);
  1045. }
  1046. }
  1047. ASSERT(Iter_Count(Test1_y_iter) == 4);
  1048. for (new i = 0; i != 50; ++i)
  1049. {
  1050. ASSERT(Test2_y_iter[Iter_Random(Test1_y_iter)] != 0);
  1051. new
  1052. j = Iter_Random(Test1_y_iter);
  1053. ASSERT(Iter_Contains(Test1_y_iter, j));
  1054. }
  1055. }
  1056. Test:y_iter_InfiniteLoop()
  1057. {
  1058. new Iterator:iter<20>;
  1059. Iter_Add(iter, 1);
  1060. Iter_Add(iter, 2);
  1061. Iter_Remove(iter, 1);
  1062. Iter_Remove(iter, 2);
  1063. foreach (new i : iter)
  1064. {
  1065. ASSERT(false);
  1066. return;
  1067. }
  1068. ASSERT(true);
  1069. }
  1070. Test:y_iter_Syntax1()
  1071. {
  1072. new
  1073. Iterator:Test1_y_iter <100>;
  1074. Iter_Add(Test1_y_iter, 11);
  1075. Iter_Add(Test1_y_iter, 12);
  1076. Iter_Add(Test1_y_iter, 13);
  1077. Iter_Add(Test1_y_iter, 16);
  1078. Iter_Add(Test1_y_iter, 19);
  1079. Iter_Add(Test1_y_iter, 22);
  1080. Iter_Add(Test1_y_iter, 23);
  1081. new
  1082. count = 0;
  1083. foreach(new i:Test1_y_iter) { ++count; }
  1084. foreach(new i:Test1_y_iter ) { ++count; }
  1085. foreach(new i: Test1_y_iter) { ++count; }
  1086. foreach(new i: Test1_y_iter ) { ++count; }
  1087. foreach(new i :Test1_y_iter) { ++count; }
  1088. foreach(new i :Test1_y_iter ) { ++count; }
  1089. foreach(new i : Test1_y_iter) { ++count; }
  1090. foreach(new i : Test1_y_iter ) { ++count; }
  1091. foreach( new i:Test1_y_iter) { ++count; }
  1092. foreach( new i:Test1_y_iter ) { ++count; }
  1093. foreach( new i: Test1_y_iter) { ++count; }
  1094. foreach( new i: Test1_y_iter ) { ++count; }
  1095. foreach( new i :Test1_y_iter) { ++count; }
  1096. foreach( new i :Test1_y_iter ) { ++count; }
  1097. foreach( new i : Test1_y_iter) { ++count; }
  1098. foreach( new i : Test1_y_iter ) { ++count; }
  1099. foreach (new i:Test1_y_iter) { ++count; }
  1100. foreach (new i:Test1_y_iter ) { ++count; }
  1101. foreach (new i: Test1_y_iter) { ++count; }
  1102. foreach (new i: Test1_y_iter ) { ++count; }
  1103. foreach (new i :Test1_y_iter) { ++count; }
  1104. foreach (new i :Test1_y_iter ) { ++count; }
  1105. foreach (new i : Test1_y_iter) { ++count; }
  1106. foreach (new i : Test1_y_iter ) { ++count; }
  1107. foreach ( new i:Test1_y_iter) { ++count; }
  1108. foreach ( new i:Test1_y_iter ) { ++count; }
  1109. foreach ( new i: Test1_y_iter) { ++count; }
  1110. foreach ( new i: Test1_y_iter ) { ++count; }
  1111. foreach ( new i :Test1_y_iter) { ++count; }
  1112. foreach ( new i :Test1_y_iter ) { ++count; }
  1113. foreach ( new i : Test1_y_iter) { ++count; }
  1114. foreach ( new i : Test1_y_iter ) { ++count; }
  1115. new
  1116. j;
  1117. foreach(j:Test1_y_iter) { ++count; }
  1118. foreach(j:Test1_y_iter ) { ++count; }
  1119. foreach(j: Test1_y_iter) { ++count; }
  1120. foreach(j: Test1_y_iter ) { ++count; }
  1121. foreach(j :Test1_y_iter) { ++count; }
  1122. foreach(j :Test1_y_iter ) { ++count; }
  1123. foreach(j : Test1_y_iter) { ++count; }
  1124. foreach(j : Test1_y_iter ) { ++count; }
  1125. foreach( j:Test1_y_iter) { ++count; }
  1126. foreach( j:Test1_y_iter ) { ++count; }
  1127. foreach( j: Test1_y_iter) { ++count; }
  1128. foreach( j: Test1_y_iter ) { ++count; }
  1129. foreach( j :Test1_y_iter) { ++count; }
  1130. foreach( j :Test1_y_iter ) { ++count; }
  1131. foreach( j : Test1_y_iter) { ++count; }
  1132. foreach( j : Test1_y_iter ) { ++count; }
  1133. foreach (j:Test1_y_iter) { ++count; }
  1134. foreach (j:Test1_y_iter ) { ++count; }
  1135. foreach (j: Test1_y_iter) { ++count; }
  1136. foreach (j: Test1_y_iter ) { ++count; }
  1137. foreach (j :Test1_y_iter) { ++count; }
  1138. foreach (j :Test1_y_iter ) { ++count; }
  1139. foreach (j : Test1_y_iter) { ++count; }
  1140. foreach (j : Test1_y_iter ) { ++count; }
  1141. foreach ( j:Test1_y_iter) { ++count; }
  1142. foreach ( j:Test1_y_iter ) { ++count; }
  1143. foreach ( j: Test1_y_iter) { ++count; }
  1144. foreach ( j: Test1_y_iter ) { ++count; }
  1145. foreach ( j :Test1_y_iter) { ++count; }
  1146. foreach ( j :Test1_y_iter ) { ++count; }
  1147. foreach ( j : Test1_y_iter) { ++count; }
  1148. foreach ( j : Test1_y_iter ) { ++count; }
  1149. ASSERT(count == 7 * 2 * 32);
  1150. }
  1151. Test:y_iter_Syntax5a()
  1152. {
  1153. new
  1154. Iterator:Test5a_y_iter[4]< 20, 100>;
  1155. Iter_Init(Test5a_y_iter);
  1156. Iter_Add(Test5a_y_iter[2]<11>, 11);
  1157. Iter_Add(Test5a_y_iter[2]<11>, 12);
  1158. Iter_Add(Test5a_y_iter[2]<11>, 13);
  1159. Iter_Add(Test5a_y_iter[2]<11>, 16);
  1160. Iter_Add(Test5a_y_iter[2]<11>, 19);
  1161. Iter_Add(Test5a_y_iter[2]<11>, 22);
  1162. Iter_Add(Test5a_y_iter[2]<11>, 23);
  1163. new
  1164. count = 0;
  1165. foreach(new i:Test5a_y_iter[2] <11>) { ++count; }
  1166. foreach(new i:Test5a_y_iter[2] <11> ) { ++count; }
  1167. foreach(new i: Test5a_y_iter[2] <11>) { ++count; }
  1168. foreach(new i: Test5a_y_iter[2] <11> ) { ++count; }
  1169. foreach(new i :Test5a_y_iter[2] <11>) { ++count; }
  1170. foreach(new i :Test5a_y_iter[2] <11> ) { ++count; }
  1171. foreach(new i : Test5a_y_iter[2] <11>) { ++count; }
  1172. foreach(new i : Test5a_y_iter[2] <11> ) { ++count; }
  1173. foreach( new i:Test5a_y_iter[2] <11>) { ++count; }
  1174. foreach( new i:Test5a_y_iter[2] <11> ) { ++count; }
  1175. foreach( new i: Test5a_y_iter[2] <11>) { ++count; }
  1176. foreach( new i: Test5a_y_iter[2] <11> ) { ++count; }
  1177. foreach( new i :Test5a_y_iter[2] <11>) { ++count; }
  1178. foreach( new i :Test5a_y_iter[2] <11> ) { ++count; }
  1179. foreach( new i : Test5a_y_iter[2] <11>) { ++count; }
  1180. foreach( new i : Test5a_y_iter[2] <11> ) { ++count; }
  1181. foreach (new i:Test5a_y_iter[2] <11>) { ++count; }
  1182. foreach (new i:Test5a_y_iter[2] <11> ) { ++count; }
  1183. foreach (new i: Test5a_y_iter[2] <11>) { ++count; }
  1184. foreach (new i: Test5a_y_iter[2] <11> ) { ++count; }
  1185. foreach (new i :Test5a_y_iter[2] <11>) { ++count; }
  1186. foreach (new i :Test5a_y_iter[2] <11> ) { ++count; }
  1187. foreach (new i : Test5a_y_iter[2] <11>) { ++count; }
  1188. foreach (new i : Test5a_y_iter[2] <11> ) { ++count; }
  1189. foreach ( new i:Test5a_y_iter[2] <11>) { ++count; }
  1190. foreach ( new i:Test5a_y_iter[2] <11> ) { ++count; }
  1191. foreach ( new i: Test5a_y_iter[2] <11>) { ++count; }
  1192. foreach ( new i: Test5a_y_iter[2] <11> ) { ++count; }
  1193. foreach ( new i :Test5a_y_iter[2] <11>) { ++count; }
  1194. foreach ( new i :Test5a_y_iter[2] <11> ) { ++count; }
  1195. foreach ( new i : Test5a_y_iter[2] <11>) { ++count; }
  1196. foreach ( new i : Test5a_y_iter[2] <11> ) { ++count; }
  1197. new
  1198. j;
  1199. foreach(j:Test5a_y_iter[ 2]< 11>) { ++count; }
  1200. foreach(j:Test5a_y_iter[ 2]< 11> ) { ++count; }
  1201. foreach(j: Test5a_y_iter[ 2]< 11>) { ++count; }
  1202. foreach(j: Test5a_y_iter[ 2]< 11> ) { ++count; }
  1203. foreach(j :Test5a_y_iter[ 2]< 11>) { ++count; }
  1204. foreach(j :Test5a_y_iter[ 2]< 11> ) { ++count; }
  1205. foreach(j : Test5a_y_iter[ 2]< 11>) { ++count; }
  1206. foreach(j : Test5a_y_iter[ 2]< 11> ) { ++count; }
  1207. foreach( j:Test5a_y_iter[ 2]< 11>) { ++count; }
  1208. foreach( j:Test5a_y_iter[ 2]< 11> ) { ++count; }
  1209. foreach( j: Test5a_y_iter[ 2]< 11>) { ++count; }
  1210. foreach( j: Test5a_y_iter[ 2]< 11> ) { ++count; }
  1211. foreach( j :Test5a_y_iter[ 2]< 11>) { ++count; }
  1212. foreach( j :Test5a_y_iter[ 2]< 11> ) { ++count; }
  1213. foreach( j : Test5a_y_iter[ 2]< 11>) { ++count; }
  1214. foreach( j : Test5a_y_iter[ 2]< 11> ) { ++count; }
  1215. foreach (j:Test5a_y_iter[ 2]< 11>) { ++count; }
  1216. foreach (j:Test5a_y_iter[ 2]< 11> ) { ++count; }
  1217. foreach (j: Test5a_y_iter[ 2]< 11>) { ++count; }
  1218. foreach (j: Test5a_y_iter[ 2]< 11> ) { ++count; }
  1219. foreach (j :Test5a_y_iter[ 2]< 11>) { ++count; }
  1220. foreach (j :Test5a_y_iter[ 2]< 11> ) { ++count; }
  1221. foreach (j : Test5a_y_iter[ 2]< 11>) { ++count; }
  1222. foreach (j : Test5a_y_iter[ 2]< 11> ) { ++count; }
  1223. foreach ( j:Test5a_y_iter[ 2]< 11>) { ++count; }
  1224. foreach ( j:Test5a_y_iter[ 2]< 11> ) { ++count; }
  1225. foreach ( j: Test5a_y_iter[ 2]< 11>) { ++count; }
  1226. foreach ( j: Test5a_y_iter[ 2]< 11> ) { ++count; }
  1227. foreach ( j :Test5a_y_iter[ 2]< 11>) { ++count; }
  1228. foreach ( j :Test5a_y_iter[ 2]< 11> ) { ++count; }
  1229. foreach ( j : Test5a_y_iter[ 2]< 11>) { ++count; }
  1230. foreach ( j : Test5a_y_iter[ 2]< 11> ) { ++count; }
  1231. ASSERT(count == 7 * 2 * 32);
  1232. }
  1233. Test:y_iter_Syntax5b()
  1234. {
  1235. new
  1236. Iterator:Test5b_y_iter[4]<20, 100 >;
  1237. Iter_Init(Test5b_y_iter);
  1238. Iter_Add(Test5b_y_iter[2]<11>, 11);
  1239. Iter_Add(Test5b_y_iter[2]<11>, 12);
  1240. Iter_Add(Test5b_y_iter[2]<11>, 13);
  1241. Iter_Add(Test5b_y_iter[2]<11>, 16);
  1242. Iter_Add(Test5b_y_iter[2]<11>, 19);
  1243. Iter_Add(Test5b_y_iter[2]<11>, 22);
  1244. Iter_Add(Test5b_y_iter[2]<11>, 23);
  1245. new
  1246. count = 0;
  1247. foreach(new i:Test5b_y_iter[ 2 ] < 11>) { ++count; }
  1248. foreach(new i:Test5b_y_iter[ 2 ] < 11> ) { ++count; }
  1249. foreach(new i: Test5b_y_iter[ 2 ] < 11>) { ++count; }
  1250. foreach(new i: Test5b_y_iter[ 2 ] < 11> ) { ++count; }
  1251. foreach(new i :Test5b_y_iter[ 2 ] < 11>) { ++count; }
  1252. foreach(new i :Test5b_y_iter[ 2 ] < 11> ) { ++count; }
  1253. foreach(new i : Test5b_y_iter[ 2 ] < 11>) { ++count; }
  1254. foreach(new i : Test5b_y_iter[ 2 ] < 11> ) { ++count; }
  1255. foreach( new i:Test5b_y_iter[ 2 ] < 11>) { ++count; }
  1256. foreach( new i:Test5b_y_iter[ 2 ] < 11> ) { ++count; }
  1257. foreach( new i: Test5b_y_iter[ 2 ] < 11>) { ++count; }
  1258. foreach( new i: Test5b_y_iter[ 2 ] < 11> ) { ++count; }
  1259. foreach( new i :Test5b_y_iter[ 2 ] < 11>) { ++count; }
  1260. foreach( new i :Test5b_y_iter[ 2 ] < 11> ) { ++count; }
  1261. foreach( new i : Test5b_y_iter[ 2 ] < 11>) { ++count; }
  1262. foreach( new i : Test5b_y_iter[ 2 ] < 11> ) { ++count; }
  1263. foreach (new i:Test5b_y_iter[ 2 ] < 11>) { ++count; }
  1264. foreach (new i:Test5b_y_iter[ 2 ] < 11> ) { ++count; }
  1265. foreach (new i: Test5b_y_iter[ 2 ] < 11>) { ++count; }
  1266. foreach (new i: Test5b_y_iter[ 2 ] < 11> ) { ++count; }
  1267. foreach (new i :Test5b_y_iter[ 2 ] < 11>) { ++count; }
  1268. foreach (new i :Test5b_y_iter[ 2 ] < 11> ) { ++count; }
  1269. foreach (new i : Test5b_y_iter[ 2 ] < 11>) { ++count; }
  1270. foreach (new i : Test5b_y_iter[ 2 ] < 11> ) { ++count; }
  1271. foreach ( new i:Test5b_y_iter[ 2 ] < 11>) { ++count; }
  1272. foreach ( new i:Test5b_y_iter[ 2 ] < 11> ) { ++count; }
  1273. foreach ( new i: Test5b_y_iter[ 2 ] < 11>) { ++count; }
  1274. foreach ( new i: Test5b_y_iter[ 2 ] < 11> ) { ++count; }
  1275. foreach ( new i :Test5b_y_iter[ 2 ] < 11>) { ++count; }
  1276. foreach ( new i :Test5b_y_iter[ 2 ] < 11> ) { ++count; }
  1277. foreach ( new i : Test5b_y_iter[ 2 ] < 11>) { ++count; }
  1278. foreach ( new i : Test5b_y_iter[ 2 ] < 11> ) { ++count; }
  1279. new
  1280. j;
  1281. foreach(j:Test5b_y_iter[2 ]<11 >) { ++count; }
  1282. foreach(j:Test5b_y_iter[2 ]<11 > ) { ++count; }
  1283. foreach(j: Test5b_y_iter[2 ]<11 >) { ++count; }
  1284. foreach(j: Test5b_y_iter[2 ]<11 > ) { ++count; }
  1285. foreach(j :Test5b_y_iter[2 ]<11 >) { ++count; }
  1286. foreach(j :Test5b_y_iter[2 ]<11 > ) { ++count; }
  1287. foreach(j : Test5b_y_iter[2 ]<11 >) { ++count; }
  1288. foreach(j : Test5b_y_iter[2 ]<11 > ) { ++count; }
  1289. foreach( j:Test5b_y_iter[2 ]<11 >) { ++count; }
  1290. foreach( j:Test5b_y_iter[2 ]<11 > ) { ++count; }
  1291. foreach( j: Test5b_y_iter[2 ]<11 >) { ++count; }
  1292. foreach( j: Test5b_y_iter[2 ]<11 > ) { ++count; }
  1293. foreach( j :Test5b_y_iter[2 ]<11 >) { ++count; }
  1294. foreach( j :Test5b_y_iter[2 ]<11 > ) { ++count; }
  1295. foreach( j : Test5b_y_iter[2 ]<11 >) { ++count; }
  1296. foreach( j : Test5b_y_iter[2 ]<11 > ) { ++count; }
  1297. foreach (j:Test5b_y_iter[2 ]<11 >) { ++count; }
  1298. foreach (j:Test5b_y_iter[2 ]<11 > ) { ++count; }
  1299. foreach (j: Test5b_y_iter[2 ]<11 >) { ++count; }
  1300. foreach (j: Test5b_y_iter[2 ]<11 > ) { ++count; }
  1301. foreach (j :Test5b_y_iter[2 ]<11 >) { ++count; }
  1302. foreach (j :Test5b_y_iter[2 ]<11 > ) { ++count; }
  1303. foreach (j : Test5b_y_iter[2 ]<11 >) { ++count; }
  1304. foreach (j : Test5b_y_iter[2 ]<11 > ) { ++count; }
  1305. foreach ( j:Test5b_y_iter[2 ]<11 >) { ++count; }
  1306. foreach ( j:Test5b_y_iter[2 ]<11 > ) { ++count; }
  1307. foreach ( j: Test5b_y_iter[2 ]<11 >) { ++count; }
  1308. foreach ( j: Test5b_y_iter[2 ]<11 > ) { ++count; }
  1309. foreach ( j :Test5b_y_iter[2 ]<11 >) { ++count; }
  1310. foreach ( j :Test5b_y_iter[2 ]<11 > ) { ++count; }
  1311. foreach ( j : Test5b_y_iter[2 ]<11 >) { ++count; }
  1312. foreach ( j : Test5b_y_iter[2 ]<11 > ) { ++count; }
  1313. ASSERT(count == 7 * 2 * 32);
  1314. }
  1315. Test:y_iter_Syntax5c()
  1316. {
  1317. new
  1318. Iterator: Test5c_y_iter[4]< 20, 100>;
  1319. Iter_Init(Test5c_y_iter);
  1320. Iter_Add(Test5c_y_iter[2]<11>, 11);
  1321. Iter_Add(Test5c_y_iter[2]<11>, 12);
  1322. Iter_Add(Test5c_y_iter[2]<11>, 13);
  1323. Iter_Add(Test5c_y_iter[2]<11>, 16);
  1324. Iter_Add(Test5c_y_iter[2]<11>, 19);
  1325. Iter_Add(Test5c_y_iter[2]<11>, 22);
  1326. Iter_Add(Test5c_y_iter[2]<11>, 23);
  1327. new
  1328. count = 0;
  1329. foreach(new i:Test5c_y_iter [2] <11 >) { ++count; }
  1330. foreach(new i:Test5c_y_iter [2] <11 > ) { ++count; }
  1331. foreach(new i: Test5c_y_iter [2] <11 >) { ++count; }
  1332. foreach(new i: Test5c_y_iter [2] <11 > ) { ++count; }
  1333. foreach(new i :Test5c_y_iter [2] <11 >) { ++count; }
  1334. foreach(new i :Test5c_y_iter [2] <11 > ) { ++count; }
  1335. foreach(new i : Test5c_y_iter [2] <11 >) { ++count; }
  1336. foreach(new i : Test5c_y_iter [2] <11 > ) { ++count; }
  1337. foreach( new i:Test5c_y_iter [2] <11 >) { ++count; }
  1338. foreach( new i:Test5c_y_iter [2] <11 > ) { ++count; }
  1339. foreach( new i: Test5c_y_iter [2] <11 >) { ++count; }
  1340. foreach( new i: Test5c_y_iter [2] <11 > ) { ++count; }
  1341. foreach( new i :Test5c_y_iter [2] <11 >) { ++count; }
  1342. foreach( new i :Test5c_y_iter [2] <11 > ) { ++count; }
  1343. foreach( new i : Test5c_y_iter [2] <11 >) { ++count; }
  1344. foreach( new i : Test5c_y_iter [2] <11 > ) { ++count; }
  1345. foreach (new i:Test5c_y_iter [2] <11 >) { ++count; }
  1346. foreach (new i:Test5c_y_iter [2] <11 > ) { ++count; }
  1347. foreach (new i: Test5c_y_iter [2] <11 >) { ++count; }
  1348. foreach (new i: Test5c_y_iter [2] <11 > ) { ++count; }
  1349. foreach (new i :Test5c_y_iter [2] <11 >) { ++count; }
  1350. foreach (new i :Test5c_y_iter [2] <11 > ) { ++count; }
  1351. foreach (new i : Test5c_y_iter [2] <11 >) { ++count; }
  1352. foreach (new i : Test5c_y_iter [2] <11 > ) { ++count; }
  1353. foreach ( new i:Test5c_y_iter [2] <11 >) { ++count; }
  1354. foreach ( new i:Test5c_y_iter [2] <11 > ) { ++count; }
  1355. foreach ( new i: Test5c_y_iter [2] <11 >) { ++count; }
  1356. foreach ( new i: Test5c_y_iter [2] <11 > ) { ++count; }
  1357. foreach ( new i :Test5c_y_iter [2] <11 >) { ++count; }
  1358. foreach ( new i :Test5c_y_iter [2] <11 > ) { ++count; }
  1359. foreach ( new i : Test5c_y_iter [2] <11 >) { ++count; }
  1360. foreach ( new i : Test5c_y_iter [2] <11 > ) { ++count; }
  1361. new
  1362. j;
  1363. foreach(j:Test5c_y_iter [ 2]< 11 >) { ++count; }
  1364. foreach(j:Test5c_y_iter [ 2]< 11 > ) { ++count; }
  1365. foreach(j: Test5c_y_iter [ 2]< 11 >) { ++count; }
  1366. foreach(j: Test5c_y_iter [ 2]< 11 > ) { ++count; }
  1367. foreach(j :Test5c_y_iter [ 2]< 11 >) { ++count; }
  1368. foreach(j :Test5c_y_iter [ 2]< 11 > ) { ++count; }
  1369. foreach(j : Test5c_y_iter [ 2]< 11 >) { ++count; }
  1370. foreach(j : Test5c_y_iter [ 2]< 11 > ) { ++count; }
  1371. foreach( j:Test5c_y_iter [ 2]< 11 >) { ++count; }
  1372. foreach( j:Test5c_y_iter [ 2]< 11 > ) { ++count; }
  1373. foreach( j: Test5c_y_iter [ 2]< 11 >) { ++count; }
  1374. foreach( j: Test5c_y_iter [ 2]< 11 > ) { ++count; }
  1375. foreach( j :Test5c_y_iter [ 2]< 11 >) { ++count; }
  1376. foreach( j :Test5c_y_iter [ 2]< 11 > ) { ++count; }
  1377. foreach( j : Test5c_y_iter [ 2]< 11 >) { ++count; }
  1378. foreach( j : Test5c_y_iter [ 2]< 11 > ) { ++count; }
  1379. foreach (j:Test5c_y_iter [ 2]< 11 >) { ++count; }
  1380. foreach (j:Test5c_y_iter [ 2]< 11 > ) { ++count; }
  1381. foreach (j: Test5c_y_iter [ 2]< 11 >) { ++count; }
  1382. foreach (j: Test5c_y_iter [ 2]< 11 > ) { ++count; }
  1383. foreach (j :Test5c_y_iter [ 2]< 11 >) { ++count; }
  1384. foreach (j :Test5c_y_iter [ 2]< 11 > ) { ++count; }
  1385. foreach (j : Test5c_y_iter [ 2]< 11 >) { ++count; }
  1386. foreach (j : Test5c_y_iter [ 2]< 11 > ) { ++count; }
  1387. foreach ( j:Test5c_y_iter [ 2]< 11 >) { ++count; }
  1388. foreach ( j:Test5c_y_iter [ 2]< 11 > ) { ++count; }
  1389. foreach ( j: Test5c_y_iter [ 2]< 11 >) { ++count; }
  1390. foreach ( j: Test5c_y_iter [ 2]< 11 > ) { ++count; }
  1391. foreach ( j :Test5c_y_iter [ 2]< 11 >) { ++count; }
  1392. foreach ( j :Test5c_y_iter [ 2]< 11 > ) { ++count; }
  1393. foreach ( j : Test5c_y_iter [ 2]< 11 >) { ++count; }
  1394. foreach ( j : Test5c_y_iter [ 2]< 11 > ) { ++count; }
  1395. ASSERT(count == 7 * 2 * 32);
  1396. }
  1397. Test:y_iter_Syntax5d()
  1398. {
  1399. new
  1400. Iterator: Test5d_y_iter [ 4 ] < 20, 100 >;
  1401. Iter_Init(Test5d_y_iter);
  1402. Iter_Add(Test5d_y_iter[2]<11>, 11);
  1403. Iter_Add(Test5d_y_iter[2]<11>, 12);
  1404. Iter_Add(Test5d_y_iter[2]<11>, 13);
  1405. Iter_Add(Test5d_y_iter[2]<11>, 16);
  1406. Iter_Add(Test5d_y_iter[2]<11>, 19);
  1407. Iter_Add(Test5d_y_iter[2]<11>, 22);
  1408. Iter_Add(Test5d_y_iter[2]<11>, 23);
  1409. new
  1410. count = 0;
  1411. foreach(new i:Test5d_y_iter [ 2 ] < 11 >) { ++count; }
  1412. foreach(new i:Test5d_y_iter [ 2 ] < 11 > ) { ++count; }
  1413. foreach(new i: Test5d_y_iter [ 2 ] < 11 >) { ++count; }
  1414. foreach(new i: Test5d_y_iter [ 2 ] < 11 > ) { ++count; }
  1415. foreach(new i :Test5d_y_iter [ 2 ] < 11 >) { ++count; }
  1416. foreach(new i :Test5d_y_iter [ 2 ] < 11 > ) { ++count; }
  1417. foreach(new i : Test5d_y_iter [ 2 ] < 11 >) { ++count; }
  1418. foreach(new i : Test5d_y_iter [ 2 ] < 11 > ) { ++count; }
  1419. foreach( new i:Test5d_y_iter [ 2 ] < 11 >) { ++count; }
  1420. foreach( new i:Test5d_y_iter [ 2 ] < 11 > ) { ++count; }
  1421. foreach( new i: Test5d_y_iter [ 2 ] < 11 >) { ++count; }
  1422. foreach( new i: Test5d_y_iter [ 2 ] < 11 > ) { ++count; }
  1423. foreach( new i :Test5d_y_iter [ 2 ] < 11 >) { ++count; }
  1424. foreach( new i :Test5d_y_iter [ 2 ] < 11 > ) { ++count; }
  1425. foreach( new i : Test5d_y_iter [ 2 ] < 11 >) { ++count; }
  1426. foreach( new i : Test5d_y_iter [ 2 ] < 11 > ) { ++count; }
  1427. foreach (new i:Test5d_y_iter [ 2 ] < 11 >) { ++count; }
  1428. foreach (new i:Test5d_y_iter [ 2 ] < 11 > ) { ++count; }
  1429. foreach (new i: Test5d_y_iter [ 2 ] < 11 >) { ++count; }
  1430. foreach (new i: Test5d_y_iter [ 2 ] < 11 > ) { ++count; }
  1431. foreach (new i :Test5d_y_iter [ 2 ] < 11 >) { ++count; }
  1432. foreach (new i :Test5d_y_iter [ 2 ] < 11 > ) { ++count; }
  1433. foreach (new i : Test5d_y_iter [ 2 ] < 11 >) { ++count; }
  1434. foreach (new i : Test5d_y_iter [ 2 ] < 11 > ) { ++count; }
  1435. foreach ( new i:Test5d_y_iter [ 2 ] < 11 >) { ++count; }
  1436. foreach ( new i:Test5d_y_iter [ 2 ] < 11 > ) { ++count; }
  1437. foreach ( new i: Test5d_y_iter [ 2 ] < 11 >) { ++count; }
  1438. foreach ( new i: Test5d_y_iter [ 2 ] < 11 > ) { ++count; }
  1439. foreach ( new i :Test5d_y_iter [ 2 ] < 11 >) { ++count; }
  1440. foreach ( new i :Test5d_y_iter [ 2 ] < 11 > ) { ++count; }
  1441. foreach ( new i : Test5d_y_iter [ 2 ] < 11 >) { ++count; }
  1442. foreach ( new i : Test5d_y_iter [ 2 ] < 11 > ) { ++count; }
  1443. new
  1444. j;
  1445. foreach(j:Test5d_y_iter [2 ]<11>) { ++count; }
  1446. foreach(j:Test5d_y_iter [2 ]<11> ) { ++count; }
  1447. foreach(j: Test5d_y_iter [2 ]<11>) { ++count; }
  1448. foreach(j: Test5d_y_iter [2 ]<11> ) { ++count; }
  1449. foreach(j :Test5d_y_iter [2 ]<11>) { ++count; }
  1450. foreach(j :Test5d_y_iter [2 ]<11> ) { ++count; }
  1451. foreach(j : Test5d_y_iter [2 ]<11>) { ++count; }
  1452. foreach(j : Test5d_y_iter [2 ]<11> ) { ++count; }
  1453. foreach( j:Test5d_y_iter [2 ]<11>) { ++count; }
  1454. foreach( j:Test5d_y_iter [2 ]<11> ) { ++count; }
  1455. foreach( j: Test5d_y_iter [2 ]<11>) { ++count; }
  1456. foreach( j: Test5d_y_iter [2 ]<11> ) { ++count; }
  1457. foreach( j :Test5d_y_iter [2 ]<11>) { ++count; }
  1458. foreach( j :Test5d_y_iter [2 ]<11> ) { ++count; }
  1459. foreach( j : Test5d_y_iter [2 ]<11>) { ++count; }
  1460. foreach( j : Test5d_y_iter [2 ]<11> ) { ++count; }
  1461. foreach (j:Test5d_y_iter [2 ]<11>) { ++count; }
  1462. foreach (j:Test5d_y_iter [2 ]<11> ) { ++count; }
  1463. foreach (j: Test5d_y_iter [2 ]<11>) { ++count; }
  1464. foreach (j: Test5d_y_iter [2 ]<11> ) { ++count; }
  1465. foreach (j :Test5d_y_iter [2 ]<11>) { ++count; }
  1466. foreach (j :Test5d_y_iter [2 ]<11> ) { ++count; }
  1467. foreach (j : Test5d_y_iter [2 ]<11>) { ++count; }
  1468. foreach (j : Test5d_y_iter [2 ]<11> ) { ++count; }
  1469. foreach ( j:Test5d_y_iter [2 ]<11>) { ++count; }
  1470. foreach ( j:Test5d_y_iter [2 ]<11> ) { ++count; }
  1471. foreach ( j: Test5d_y_iter [2 ]<11>) { ++count; }
  1472. foreach ( j: Test5d_y_iter [2 ]<11> ) { ++count; }
  1473. foreach ( j :Test5d_y_iter [2 ]<11>) { ++count; }
  1474. foreach ( j :Test5d_y_iter [2 ]<11> ) { ++count; }
  1475. foreach ( j : Test5d_y_iter [2 ]<11>) { ++count; }
  1476. foreach ( j : Test5d_y_iter [2 ]<11> ) { ++count; }
  1477. ASSERT(count == 7 * 2 * 32);
  1478. }
  1479. Test:y_iter_Syntax4a()
  1480. {
  1481. new
  1482. Iterator:Test4a_y_iter[ 4 ] < 100 >;
  1483. Iter_Init(Test4a_y_iter);
  1484. Iter_Add(Test4a_y_iter[3], 11);
  1485. Iter_Add(Test4a_y_iter[3], 12);
  1486. Iter_Add(Test4a_y_iter[3], 13);
  1487. Iter_Add(Test4a_y_iter[3], 16);
  1488. Iter_Add(Test4a_y_iter[3], 19);
  1489. Iter_Add(Test4a_y_iter[3], 22);
  1490. Iter_Add(Test4a_y_iter[3], 23);
  1491. new
  1492. count = 0;
  1493. foreach(new i:Test4a_y_iter[3]) { ++count; }
  1494. foreach(new i:Test4a_y_iter[3] ) { ++count; }
  1495. foreach(new i: Test4a_y_iter[3]) { ++count; }
  1496. foreach(new i: Test4a_y_iter[3] ) { ++count; }
  1497. foreach(new i :Test4a_y_iter[3]) { ++count; }
  1498. foreach(new i :Test4a_y_iter[3] ) { ++count; }
  1499. foreach(new i : Test4a_y_iter[3]) { ++count; }
  1500. foreach(new i : Test4a_y_iter[3] ) { ++count; }
  1501. foreach( new i:Test4a_y_iter[3]) { ++count; }
  1502. foreach( new i:Test4a_y_iter[3] ) { ++count; }
  1503. foreach( new i: Test4a_y_iter[3]) { ++count; }
  1504. foreach( new i: Test4a_y_iter[3] ) { ++count; }
  1505. foreach( new i :Test4a_y_iter[3]) { ++count; }
  1506. foreach( new i :Test4a_y_iter[3] ) { ++count; }
  1507. foreach( new i : Test4a_y_iter[3]) { ++count; }
  1508. foreach( new i : Test4a_y_iter[3] ) { ++count; }
  1509. foreach (new i:Test4a_y_iter[3]) { ++count; }
  1510. foreach (new i:Test4a_y_iter[3] ) { ++count; }
  1511. foreach (new i: Test4a_y_iter[3]) { ++count; }
  1512. foreach (new i: Test4a_y_iter[3] ) { ++count; }
  1513. foreach (new i :Test4a_y_iter[3]) { ++count; }
  1514. foreach (new i :Test4a_y_iter[3] ) { ++count; }
  1515. foreach (new i : Test4a_y_iter[3]) { ++count; }
  1516. foreach (new i : Test4a_y_iter[3] ) { ++count; }
  1517. foreach ( new i:Test4a_y_iter[3]) { ++count; }
  1518. foreach ( new i:Test4a_y_iter[3] ) { ++count; }
  1519. foreach ( new i: Test4a_y_iter[3]) { ++count; }
  1520. foreach ( new i: Test4a_y_iter[3] ) { ++count; }
  1521. foreach ( new i :Test4a_y_iter[3]) { ++count; }
  1522. foreach ( new i :Test4a_y_iter[3] ) { ++count; }
  1523. foreach ( new i : Test4a_y_iter[3]) { ++count; }
  1524. foreach ( new i : Test4a_y_iter[3] ) { ++count; }
  1525. new
  1526. j;
  1527. foreach(j:Test4a_y_iter[ 3]) { ++count; }
  1528. foreach(j:Test4a_y_iter[ 3] ) { ++count; }
  1529. foreach(j: Test4a_y_iter[ 3]) { ++count; }
  1530. foreach(j: Test4a_y_iter[ 3] ) { ++count; }
  1531. foreach(j :Test4a_y_iter[ 3]) { ++count; }
  1532. foreach(j :Test4a_y_iter[ 3] ) { ++count; }
  1533. foreach(j : Test4a_y_iter[ 3]) { ++count; }
  1534. foreach(j : Test4a_y_iter[ 3] ) { ++count; }
  1535. foreach( j:Test4a_y_iter[ 3]) { ++count; }
  1536. foreach( j:Test4a_y_iter[ 3] ) { ++count; }
  1537. foreach( j: Test4a_y_iter[ 3]) { ++count; }
  1538. foreach( j: Test4a_y_iter[ 3] ) { ++count; }
  1539. foreach( j :Test4a_y_iter[ 3]) { ++count; }
  1540. foreach( j :Test4a_y_iter[ 3] ) { ++count; }
  1541. foreach( j : Test4a_y_iter[ 3]) { ++count; }
  1542. foreach( j : Test4a_y_iter[ 3] ) { ++count; }
  1543. foreach (j:Test4a_y_iter[ 3]) { ++count; }
  1544. foreach (j:Test4a_y_iter[ 3] ) { ++count; }
  1545. foreach (j: Test4a_y_iter[ 3]) { ++count; }
  1546. foreach (j: Test4a_y_iter[ 3] ) { ++count; }
  1547. foreach (j :Test4a_y_iter[ 3]) { ++count; }
  1548. foreach (j :Test4a_y_iter[ 3] ) { ++count; }
  1549. foreach (j : Test4a_y_iter[ 3]) { ++count; }
  1550. foreach (j : Test4a_y_iter[ 3] ) { ++count; }
  1551. foreach ( j:Test4a_y_iter[ 3]) { ++count; }
  1552. foreach ( j:Test4a_y_iter[ 3] ) { ++count; }
  1553. foreach ( j: Test4a_y_iter[ 3]) { ++count; }
  1554. foreach ( j: Test4a_y_iter[ 3] ) { ++count; }
  1555. foreach ( j :Test4a_y_iter[ 3]) { ++count; }
  1556. foreach ( j :Test4a_y_iter[ 3] ) { ++count; }
  1557. foreach ( j : Test4a_y_iter[ 3]) { ++count; }
  1558. foreach ( j : Test4a_y_iter[ 3] ) { ++count; }
  1559. ASSERT(count == 7 * 2 * 32);
  1560. }
  1561. Test:y_iter_Syntax4b()
  1562. {
  1563. new
  1564. Iterator: Test4b_y_iter [4]<100>;
  1565. Iter_Init(Test4b_y_iter);
  1566. Iter_Add(Test4b_y_iter[0], 11);
  1567. Iter_Add(Test4b_y_iter[0], 12);
  1568. Iter_Add(Test4b_y_iter[0], 13);
  1569. Iter_Add(Test4b_y_iter[0], 16);
  1570. Iter_Add(Test4b_y_iter[0], 19);
  1571. Iter_Add(Test4b_y_iter[0], 22);
  1572. Iter_Add(Test4b_y_iter[0], 23);
  1573. new
  1574. count = 0;
  1575. foreach(new i:Test4b_y_iter[ 0 ]) { ++count; }
  1576. foreach(new i:Test4b_y_iter[ 0 ] ) { ++count; }
  1577. foreach(new i: Test4b_y_iter[ 0 ]) { ++count; }
  1578. foreach(new i: Test4b_y_iter[ 0 ] ) { ++count; }
  1579. foreach(new i :Test4b_y_iter[ 0 ]) { ++count; }
  1580. foreach(new i :Test4b_y_iter[ 0 ] ) { ++count; }
  1581. foreach(new i : Test4b_y_iter[ 0 ]) { ++count; }
  1582. foreach(new i : Test4b_y_iter[ 0 ] ) { ++count; }
  1583. foreach( new i:Test4b_y_iter[ 0 ]) { ++count; }
  1584. foreach( new i:Test4b_y_iter[ 0 ] ) { ++count; }
  1585. foreach( new i: Test4b_y_iter[ 0 ]) { ++count; }
  1586. foreach( new i: Test4b_y_iter[ 0 ] ) { ++count; }
  1587. foreach( new i :Test4b_y_iter[ 0 ]) { ++count; }
  1588. foreach( new i :Test4b_y_iter[ 0 ] ) { ++count; }
  1589. foreach( new i : Test4b_y_iter[ 0 ]) { ++count; }
  1590. foreach( new i : Test4b_y_iter[ 0 ] ) { ++count; }
  1591. foreach (new i:Test4b_y_iter[ 0 ]) { ++count; }
  1592. foreach (new i:Test4b_y_iter[ 0 ] ) { ++count; }
  1593. foreach (new i: Test4b_y_iter[ 0 ]) { ++count; }
  1594. foreach (new i: Test4b_y_iter[ 0 ] ) { ++count; }
  1595. foreach (new i :Test4b_y_iter[ 0 ]) { ++count; }
  1596. foreach (new i :Test4b_y_iter[ 0 ] ) { ++count; }
  1597. foreach (new i : Test4b_y_iter[ 0 ]) { ++count; }
  1598. foreach (new i : Test4b_y_iter[ 0 ] ) { ++count; }
  1599. foreach ( new i:Test4b_y_iter[ 0 ]) { ++count; }
  1600. foreach ( new i:Test4b_y_iter[ 0 ] ) { ++count; }
  1601. foreach ( new i: Test4b_y_iter[ 0 ]) { ++count; }
  1602. foreach ( new i: Test4b_y_iter[ 0 ] ) { ++count; }
  1603. foreach ( new i :Test4b_y_iter[ 0 ]) { ++count; }
  1604. foreach ( new i :Test4b_y_iter[ 0 ] ) { ++count; }
  1605. foreach ( new i : Test4b_y_iter[ 0 ]) { ++count; }
  1606. foreach ( new i : Test4b_y_iter[ 0 ] ) { ++count; }
  1607. new
  1608. j;
  1609. foreach(j:Test4b_y_iter[0 ]) { ++count; }
  1610. foreach(j:Test4b_y_iter[0 ] ) { ++count; }
  1611. foreach(j: Test4b_y_iter[0 ]) { ++count; }
  1612. foreach(j: Test4b_y_iter[0 ] ) { ++count; }
  1613. foreach(j :Test4b_y_iter[0 ]) { ++count; }
  1614. foreach(j :Test4b_y_iter[0 ] ) { ++count; }
  1615. foreach(j : Test4b_y_iter[0 ]) { ++count; }
  1616. foreach(j : Test4b_y_iter[0 ] ) { ++count; }
  1617. foreach( j:Test4b_y_iter[0 ]) { ++count; }
  1618. foreach( j:Test4b_y_iter[0 ] ) { ++count; }
  1619. foreach( j: Test4b_y_iter[0 ]) { ++count; }
  1620. foreach( j: Test4b_y_iter[0 ] ) { ++count; }
  1621. foreach( j :Test4b_y_iter[0 ]) { ++count; }
  1622. foreach( j :Test4b_y_iter[0 ] ) { ++count; }
  1623. foreach( j : Test4b_y_iter[0 ]) { ++count; }
  1624. foreach( j : Test4b_y_iter[0 ] ) { ++count; }
  1625. foreach (j:Test4b_y_iter[0 ]) { ++count; }
  1626. foreach (j:Test4b_y_iter[0 ] ) { ++count; }
  1627. foreach (j: Test4b_y_iter[0 ]) { ++count; }
  1628. foreach (j: Test4b_y_iter[0 ] ) { ++count; }
  1629. foreach (j :Test4b_y_iter[0 ]) { ++count; }
  1630. foreach (j :Test4b_y_iter[0 ] ) { ++count; }
  1631. foreach (j : Test4b_y_iter[0 ]) { ++count; }
  1632. foreach (j : Test4b_y_iter[0 ] ) { ++count; }
  1633. foreach ( j:Test4b_y_iter[0 ]) { ++count; }
  1634. foreach ( j:Test4b_y_iter[0 ] ) { ++count; }
  1635. foreach ( j: Test4b_y_iter[0 ]) { ++count; }
  1636. foreach ( j: Test4b_y_iter[0 ] ) { ++count; }
  1637. foreach ( j :Test4b_y_iter[0 ]) { ++count; }
  1638. foreach ( j :Test4b_y_iter[0 ] ) { ++count; }
  1639. foreach ( j : Test4b_y_iter[0 ]) { ++count; }
  1640. foreach ( j : Test4b_y_iter[0 ] ) { ++count; }
  1641. ASSERT(count == 7 * 2 * 32);
  1642. }
  1643. Test:y_iter_Syntax4c()
  1644. {
  1645. new
  1646. Iterator: Test4c_y_iter[4 ]<100 >;
  1647. Iter_Init(Test4c_y_iter);
  1648. Iter_Add(Test4c_y_iter[3], 11);
  1649. Iter_Add(Test4c_y_iter[3], 12);
  1650. Iter_Add(Test4c_y_iter[3], 13);
  1651. Iter_Add(Test4c_y_iter[3], 16);
  1652. Iter_Add(Test4c_y_iter[3], 19);
  1653. Iter_Add(Test4c_y_iter[3], 22);
  1654. Iter_Add(Test4c_y_iter[3], 23);
  1655. new
  1656. count = 0;
  1657. foreach(new i:Test4c_y_iter [3]) { ++count; }
  1658. foreach(new i:Test4c_y_iter [3] ) { ++count; }
  1659. foreach(new i: Test4c_y_iter [3]) { ++count; }
  1660. foreach(new i: Test4c_y_iter [3] ) { ++count; }
  1661. foreach(new i :Test4c_y_iter [3]) { ++count; }
  1662. foreach(new i :Test4c_y_iter [3] ) { ++count; }
  1663. foreach(new i : Test4c_y_iter [3]) { ++count; }
  1664. foreach(new i : Test4c_y_iter [3] ) { ++count; }
  1665. foreach( new i:Test4c_y_iter [3]) { ++count; }
  1666. foreach( new i:Test4c_y_iter [3] ) { ++count; }
  1667. foreach( new i: Test4c_y_iter [3]) { ++count; }
  1668. foreach( new i: Test4c_y_iter [3] ) { ++count; }
  1669. foreach( new i :Test4c_y_iter [3]) { ++count; }
  1670. foreach( new i :Test4c_y_iter [3] ) { ++count; }
  1671. foreach( new i : Test4c_y_iter [3]) { ++count; }
  1672. foreach( new i : Test4c_y_iter [3] ) { ++count; }
  1673. foreach (new i:Test4c_y_iter [3]) { ++count; }
  1674. foreach (new i:Test4c_y_iter [3] ) { ++count; }
  1675. foreach (new i: Test4c_y_iter [3]) { ++count; }
  1676. foreach (new i: Test4c_y_iter [3] ) { ++count; }
  1677. foreach (new i :Test4c_y_iter [3]) { ++count; }
  1678. foreach (new i :Test4c_y_iter [3] ) { ++count; }
  1679. foreach (new i : Test4c_y_iter [3]) { ++count; }
  1680. foreach (new i : Test4c_y_iter [3] ) { ++count; }
  1681. foreach ( new i:Test4c_y_iter [3]) { ++count; }
  1682. foreach ( new i:Test4c_y_iter [3] ) { ++count; }
  1683. foreach ( new i: Test4c_y_iter [3]) { ++count; }
  1684. foreach ( new i: Test4c_y_iter [3] ) { ++count; }
  1685. foreach ( new i :Test4c_y_iter [3]) { ++count; }
  1686. foreach ( new i :Test4c_y_iter [3] ) { ++count; }
  1687. foreach ( new i : Test4c_y_iter [3]) { ++count; }
  1688. foreach ( new i : Test4c_y_iter [3] ) { ++count; }
  1689. new
  1690. j;
  1691. foreach(j:Test4c_y_iter [ 3]) { ++count; }
  1692. foreach(j:Test4c_y_iter [ 3] ) { ++count; }
  1693. foreach(j: Test4c_y_iter [ 3]) { ++count; }
  1694. foreach(j: Test4c_y_iter [ 3] ) { ++count; }
  1695. foreach(j :Test4c_y_iter [ 3]) { ++count; }
  1696. foreach(j :Test4c_y_iter [ 3] ) { ++count; }
  1697. foreach(j : Test4c_y_iter [ 3]) { ++count; }
  1698. foreach(j : Test4c_y_iter [ 3] ) { ++count; }
  1699. foreach( j:Test4c_y_iter [ 3]) { ++count; }
  1700. foreach( j:Test4c_y_iter [ 3] ) { ++count; }
  1701. foreach( j: Test4c_y_iter [ 3]) { ++count; }
  1702. foreach( j: Test4c_y_iter [ 3] ) { ++count; }
  1703. foreach( j :Test4c_y_iter [ 3]) { ++count; }
  1704. foreach( j :Test4c_y_iter [ 3] ) { ++count; }
  1705. foreach( j : Test4c_y_iter [ 3]) { ++count; }
  1706. foreach( j : Test4c_y_iter [ 3] ) { ++count; }
  1707. foreach (j:Test4c_y_iter [ 3]) { ++count; }
  1708. foreach (j:Test4c_y_iter [ 3] ) { ++count; }
  1709. foreach (j: Test4c_y_iter [ 3]) { ++count; }
  1710. foreach (j: Test4c_y_iter [ 3] ) { ++count; }
  1711. foreach (j :Test4c_y_iter [ 3]) { ++count; }
  1712. foreach (j :Test4c_y_iter [ 3] ) { ++count; }
  1713. foreach (j : Test4c_y_iter [ 3]) { ++count; }
  1714. foreach (j : Test4c_y_iter [ 3] ) { ++count; }
  1715. foreach ( j:Test4c_y_iter [ 3]) { ++count; }
  1716. foreach ( j:Test4c_y_iter [ 3] ) { ++count; }
  1717. foreach ( j: Test4c_y_iter [ 3]) { ++count; }
  1718. foreach ( j: Test4c_y_iter [ 3] ) { ++count; }
  1719. foreach ( j :Test4c_y_iter [ 3]) { ++count; }
  1720. foreach ( j :Test4c_y_iter [ 3] ) { ++count; }
  1721. foreach ( j : Test4c_y_iter [ 3]) { ++count; }
  1722. foreach ( j : Test4c_y_iter [ 3] ) { ++count; }
  1723. ASSERT(count == 7 * 2 * 32);
  1724. }
  1725. Test:y_iter_Syntax4d()
  1726. {
  1727. new
  1728. Iterator: Test4d_y_iter[ 4]< 100>;
  1729. Iter_Init(Test4d_y_iter);
  1730. Iter_Add(Test4d_y_iter[0], 11);
  1731. Iter_Add(Test4d_y_iter[0], 12);
  1732. Iter_Add(Test4d_y_iter[0], 13);
  1733. Iter_Add(Test4d_y_iter[0], 16);
  1734. Iter_Add(Test4d_y_iter[0], 19);
  1735. Iter_Add(Test4d_y_iter[0], 22);
  1736. Iter_Add(Test4d_y_iter[0], 23);
  1737. new
  1738. count = 0;
  1739. foreach(new i:Test4d_y_iter [ 0 ]) { ++count; }
  1740. foreach(new i:Test4d_y_iter [ 0 ] ) { ++count; }
  1741. foreach(new i: Test4d_y_iter [ 0 ]) { ++count; }
  1742. foreach(new i: Test4d_y_iter [ 0 ] ) { ++count; }
  1743. foreach(new i :Test4d_y_iter [ 0 ]) { ++count; }
  1744. foreach(new i :Test4d_y_iter [ 0 ] ) { ++count; }
  1745. foreach(new i : Test4d_y_iter [ 0 ]) { ++count; }
  1746. foreach(new i : Test4d_y_iter [ 0 ] ) { ++count; }
  1747. foreach( new i:Test4d_y_iter [ 0 ]) { ++count; }
  1748. foreach( new i:Test4d_y_iter [ 0 ] ) { ++count; }
  1749. foreach( new i: Test4d_y_iter [ 0 ]) { ++count; }
  1750. foreach( new i: Test4d_y_iter [ 0 ] ) { ++count; }
  1751. foreach( new i :Test4d_y_iter [ 0 ]) { ++count; }
  1752. foreach( new i :Test4d_y_iter [ 0 ] ) { ++count; }
  1753. foreach( new i : Test4d_y_iter [ 0 ]) { ++count; }
  1754. foreach( new i : Test4d_y_iter [ 0 ] ) { ++count; }
  1755. foreach (new i:Test4d_y_iter [ 0 ]) { ++count; }
  1756. foreach (new i:Test4d_y_iter [ 0 ] ) { ++count; }
  1757. foreach (new i: Test4d_y_iter [ 0 ]) { ++count; }
  1758. foreach (new i: Test4d_y_iter [ 0 ] ) { ++count; }
  1759. foreach (new i :Test4d_y_iter [ 0 ]) { ++count; }
  1760. foreach (new i :Test4d_y_iter [ 0 ] ) { ++count; }
  1761. foreach (new i : Test4d_y_iter [ 0 ]) { ++count; }
  1762. foreach (new i : Test4d_y_iter [ 0 ] ) { ++count; }
  1763. foreach ( new i:Test4d_y_iter [ 0 ]) { ++count; }
  1764. foreach ( new i:Test4d_y_iter [ 0 ] ) { ++count; }
  1765. foreach ( new i: Test4d_y_iter [ 0 ]) { ++count; }
  1766. foreach ( new i: Test4d_y_iter [ 0 ] ) { ++count; }
  1767. foreach ( new i :Test4d_y_iter [ 0 ]) { ++count; }
  1768. foreach ( new i :Test4d_y_iter [ 0 ] ) { ++count; }
  1769. foreach ( new i : Test4d_y_iter [ 0 ]) { ++count; }
  1770. foreach ( new i : Test4d_y_iter [ 0 ] ) { ++count; }
  1771. new
  1772. j;
  1773. foreach(j:Test4d_y_iter [0 ]) { ++count; }
  1774. foreach(j:Test4d_y_iter [0 ] ) { ++count; }
  1775. foreach(j: Test4d_y_iter [0 ]) { ++count; }
  1776. foreach(j: Test4d_y_iter [0 ] ) { ++count; }
  1777. foreach(j :Test4d_y_iter [0 ]) { ++count; }
  1778. foreach(j :Test4d_y_iter [0 ] ) { ++count; }
  1779. foreach(j : Test4d_y_iter [0 ]) { ++count; }
  1780. foreach(j : Test4d_y_iter [0 ] ) { ++count; }
  1781. foreach( j:Test4d_y_iter [0 ]) { ++count; }
  1782. foreach( j:Test4d_y_iter [0 ] ) { ++count; }
  1783. foreach( j: Test4d_y_iter [0 ]) { ++count; }
  1784. foreach( j: Test4d_y_iter [0 ] ) { ++count; }
  1785. foreach( j :Test4d_y_iter [0 ]) { ++count; }
  1786. foreach( j :Test4d_y_iter [0 ] ) { ++count; }
  1787. foreach( j : Test4d_y_iter [0 ]) { ++count; }
  1788. foreach( j : Test4d_y_iter [0 ] ) { ++count; }
  1789. foreach (j:Test4d_y_iter [0 ]) { ++count; }
  1790. foreach (j:Test4d_y_iter [0 ] ) { ++count; }
  1791. foreach (j: Test4d_y_iter [0 ]) { ++count; }
  1792. foreach (j: Test4d_y_iter [0 ] ) { ++count; }
  1793. foreach (j :Test4d_y_iter [0 ]) { ++count; }
  1794. foreach (j :Test4d_y_iter [0 ] ) { ++count; }
  1795. foreach (j : Test4d_y_iter [0 ]) { ++count; }
  1796. foreach (j : Test4d_y_iter [0 ] ) { ++count; }
  1797. foreach ( j:Test4d_y_iter [0 ]) { ++count; }
  1798. foreach ( j:Test4d_y_iter [0 ] ) { ++count; }
  1799. foreach ( j: Test4d_y_iter [0 ]) { ++count; }
  1800. foreach ( j: Test4d_y_iter [0 ] ) { ++count; }
  1801. foreach ( j :Test4d_y_iter [0 ]) { ++count; }
  1802. foreach ( j :Test4d_y_iter [0 ] ) { ++count; }
  1803. foreach ( j : Test4d_y_iter [0 ]) { ++count; }
  1804. foreach ( j : Test4d_y_iter [0 ] ) { ++count; }
  1805. ASSERT(count == 7 * 2 * 32);
  1806. }
  1807. Test:y_iter_Syntax3a()
  1808. {
  1809. new
  1810. Iterator: Test3a_y_iter <10, 100>;
  1811. Iter_Add(Test3a_y_iter<4>, 11);
  1812. Iter_Add(Test3a_y_iter<4>, 12);
  1813. Iter_Add(Test3a_y_iter<4>, 13);
  1814. Iter_Add(Test3a_y_iter<4>, 16);
  1815. Iter_Add(Test3a_y_iter<4>, 19);
  1816. Iter_Add(Test3a_y_iter<4>, 22);
  1817. Iter_Add(Test3a_y_iter<4>, 23);
  1818. new
  1819. count = 0;
  1820. foreach(new i:Test3a_y_iter<4>) { ++count; }
  1821. foreach(new i:Test3a_y_iter<4> ) { ++count; }
  1822. foreach(new i: Test3a_y_iter<4>) { ++count; }
  1823. foreach(new i: Test3a_y_iter<4> ) { ++count; }
  1824. foreach(new i :Test3a_y_iter<4>) { ++count; }
  1825. foreach(new i :Test3a_y_iter<4> ) { ++count; }
  1826. foreach(new i : Test3a_y_iter<4>) { ++count; }
  1827. foreach(new i : Test3a_y_iter<4> ) { ++count; }
  1828. foreach( new i:Test3a_y_iter<4>) { ++count; }
  1829. foreach( new i:Test3a_y_iter<4> ) { ++count; }
  1830. foreach( new i: Test3a_y_iter<4>) { ++count; }
  1831. foreach( new i: Test3a_y_iter<4> ) { ++count; }
  1832. foreach( new i :Test3a_y_iter<4>) { ++count; }
  1833. foreach( new i :Test3a_y_iter<4> ) { ++count; }
  1834. foreach( new i : Test3a_y_iter<4>) { ++count; }
  1835. foreach( new i : Test3a_y_iter<4> ) { ++count; }
  1836. foreach (new i:Test3a_y_iter<4>) { ++count; }
  1837. foreach (new i:Test3a_y_iter<4> ) { ++count; }
  1838. foreach (new i: Test3a_y_iter<4>) { ++count; }
  1839. foreach (new i: Test3a_y_iter<4> ) { ++count; }
  1840. foreach (new i :Test3a_y_iter<4>) { ++count; }
  1841. foreach (new i :Test3a_y_iter<4> ) { ++count; }
  1842. foreach (new i : Test3a_y_iter<4>) { ++count; }
  1843. foreach (new i : Test3a_y_iter<4> ) { ++count; }
  1844. foreach ( new i:Test3a_y_iter<4>) { ++count; }
  1845. foreach ( new i:Test3a_y_iter<4> ) { ++count; }
  1846. foreach ( new i: Test3a_y_iter<4>) { ++count; }
  1847. foreach ( new i: Test3a_y_iter<4> ) { ++count; }
  1848. foreach ( new i :Test3a_y_iter<4>) { ++count; }
  1849. foreach ( new i :Test3a_y_iter<4> ) { ++count; }
  1850. foreach ( new i : Test3a_y_iter<4>) { ++count; }
  1851. foreach ( new i : Test3a_y_iter<4> ) { ++count; }
  1852. new
  1853. j;
  1854. foreach(j:Test3a_y_iter< 4>) { ++count; }
  1855. foreach(j:Test3a_y_iter< 4> ) { ++count; }
  1856. foreach(j: Test3a_y_iter< 4>) { ++count; }
  1857. foreach(j: Test3a_y_iter< 4> ) { ++count; }
  1858. foreach(j :Test3a_y_iter< 4>) { ++count; }
  1859. foreach(j :Test3a_y_iter< 4> ) { ++count; }
  1860. foreach(j : Test3a_y_iter< 4>) { ++count; }
  1861. foreach(j : Test3a_y_iter< 4> ) { ++count; }
  1862. foreach( j:Test3a_y_iter< 4>) { ++count; }
  1863. foreach( j:Test3a_y_iter< 4> ) { ++count; }
  1864. foreach( j: Test3a_y_iter< 4>) { ++count; }
  1865. foreach( j: Test3a_y_iter< 4> ) { ++count; }
  1866. foreach( j :Test3a_y_iter< 4>) { ++count; }
  1867. foreach( j :Test3a_y_iter< 4> ) { ++count; }
  1868. foreach( j : Test3a_y_iter< 4>) { ++count; }
  1869. foreach( j : Test3a_y_iter< 4> ) { ++count; }
  1870. foreach (j:Test3a_y_iter< 4>) { ++count; }
  1871. foreach (j:Test3a_y_iter< 4> ) { ++count; }
  1872. foreach (j: Test3a_y_iter< 4>) { ++count; }
  1873. foreach (j: Test3a_y_iter< 4> ) { ++count; }
  1874. foreach (j :Test3a_y_iter< 4>) { ++count; }
  1875. foreach (j :Test3a_y_iter< 4> ) { ++count; }
  1876. foreach (j : Test3a_y_iter< 4>) { ++count; }
  1877. foreach (j : Test3a_y_iter< 4> ) { ++count; }
  1878. foreach ( j:Test3a_y_iter< 4>) { ++count; }
  1879. foreach ( j:Test3a_y_iter< 4> ) { ++count; }
  1880. foreach ( j: Test3a_y_iter< 4>) { ++count; }
  1881. foreach ( j: Test3a_y_iter< 4> ) { ++count; }
  1882. foreach ( j :Test3a_y_iter< 4>) { ++count; }
  1883. foreach ( j :Test3a_y_iter< 4> ) { ++count; }
  1884. foreach ( j : Test3a_y_iter< 4>) { ++count; }
  1885. foreach ( j : Test3a_y_iter< 4> ) { ++count; }
  1886. ASSERT(count == 7 * 2 * 32);
  1887. }
  1888. Test:y_iter_Syntax3b()
  1889. {
  1890. new
  1891. Iterator:Test3b_y_iter< 10, 100 >;
  1892. Iter_Add(Test3b_y_iter<6>, 11);
  1893. Iter_Add(Test3b_y_iter<6>, 12);
  1894. Iter_Add(Test3b_y_iter<6>, 13);
  1895. Iter_Add(Test3b_y_iter<6>, 16);
  1896. Iter_Add(Test3b_y_iter<6>, 19);
  1897. Iter_Add(Test3b_y_iter<6>, 22);
  1898. Iter_Add(Test3b_y_iter<6>, 23);
  1899. new
  1900. count = 0;
  1901. foreach(new i:Test3b_y_iter< 6 >) { ++count; }
  1902. foreach(new i:Test3b_y_iter< 6 > ) { ++count; }
  1903. foreach(new i: Test3b_y_iter< 6 >) { ++count; }
  1904. foreach(new i: Test3b_y_iter< 6 > ) { ++count; }
  1905. foreach(new i :Test3b_y_iter< 6 >) { ++count; }
  1906. foreach(new i :Test3b_y_iter< 6 > ) { ++count; }
  1907. foreach(new i : Test3b_y_iter< 6 >) { ++count; }
  1908. foreach(new i : Test3b_y_iter< 6 > ) { ++count; }
  1909. foreach( new i:Test3b_y_iter< 6 >) { ++count; }
  1910. foreach( new i:Test3b_y_iter< 6 > ) { ++count; }
  1911. foreach( new i: Test3b_y_iter< 6 >) { ++count; }
  1912. foreach( new i: Test3b_y_iter< 6 > ) { ++count; }
  1913. foreach( new i :Test3b_y_iter< 6 >) { ++count; }
  1914. foreach( new i :Test3b_y_iter< 6 > ) { ++count; }
  1915. foreach( new i : Test3b_y_iter< 6 >) { ++count; }
  1916. foreach( new i : Test3b_y_iter< 6 > ) { ++count; }
  1917. foreach (new i:Test3b_y_iter< 6 >) { ++count; }
  1918. foreach (new i:Test3b_y_iter< 6 > ) { ++count; }
  1919. foreach (new i: Test3b_y_iter< 6 >) { ++count; }
  1920. foreach (new i: Test3b_y_iter< 6 > ) { ++count; }
  1921. foreach (new i :Test3b_y_iter< 6 >) { ++count; }
  1922. foreach (new i :Test3b_y_iter< 6 > ) { ++count; }
  1923. foreach (new i : Test3b_y_iter< 6 >) { ++count; }
  1924. foreach (new i : Test3b_y_iter< 6 > ) { ++count; }
  1925. foreach ( new i:Test3b_y_iter< 6 >) { ++count; }
  1926. foreach ( new i:Test3b_y_iter< 6 > ) { ++count; }
  1927. foreach ( new i: Test3b_y_iter< 6 >) { ++count; }
  1928. foreach ( new i: Test3b_y_iter< 6 > ) { ++count; }
  1929. foreach ( new i :Test3b_y_iter< 6 >) { ++count; }
  1930. foreach ( new i :Test3b_y_iter< 6 > ) { ++count; }
  1931. foreach ( new i : Test3b_y_iter< 6 >) { ++count; }
  1932. foreach ( new i : Test3b_y_iter< 6 > ) { ++count; }
  1933. new
  1934. j;
  1935. foreach(j:Test3b_y_iter<6 >) { ++count; }
  1936. foreach(j:Test3b_y_iter<6 > ) { ++count; }
  1937. foreach(j: Test3b_y_iter<6 >) { ++count; }
  1938. foreach(j: Test3b_y_iter<6 > ) { ++count; }
  1939. foreach(j :Test3b_y_iter<6 >) { ++count; }
  1940. foreach(j :Test3b_y_iter<6 > ) { ++count; }
  1941. foreach(j : Test3b_y_iter<6 >) { ++count; }
  1942. foreach(j : Test3b_y_iter<6 > ) { ++count; }
  1943. foreach( j:Test3b_y_iter<6 >) { ++count; }
  1944. foreach( j:Test3b_y_iter<6 > ) { ++count; }
  1945. foreach( j: Test3b_y_iter<6 >) { ++count; }
  1946. foreach( j: Test3b_y_iter<6 > ) { ++count; }
  1947. foreach( j :Test3b_y_iter<6 >) { ++count; }
  1948. foreach( j :Test3b_y_iter<6 > ) { ++count; }
  1949. foreach( j : Test3b_y_iter<6 >) { ++count; }
  1950. foreach( j : Test3b_y_iter<6 > ) { ++count; }
  1951. foreach (j:Test3b_y_iter<6 >) { ++count; }
  1952. foreach (j:Test3b_y_iter<6 > ) { ++count; }
  1953. foreach (j: Test3b_y_iter<6 >) { ++count; }
  1954. foreach (j: Test3b_y_iter<6 > ) { ++count; }
  1955. foreach (j :Test3b_y_iter<6 >) { ++count; }
  1956. foreach (j :Test3b_y_iter<6 > ) { ++count; }
  1957. foreach (j : Test3b_y_iter<6 >) { ++count; }
  1958. foreach (j : Test3b_y_iter<6 > ) { ++count; }
  1959. foreach ( j:Test3b_y_iter<6 >) { ++count; }
  1960. foreach ( j:Test3b_y_iter<6 > ) { ++count; }
  1961. foreach ( j: Test3b_y_iter<6 >) { ++count; }
  1962. foreach ( j: Test3b_y_iter<6 > ) { ++count; }
  1963. foreach ( j :Test3b_y_iter<6 >) { ++count; }
  1964. foreach ( j :Test3b_y_iter<6 > ) { ++count; }
  1965. foreach ( j : Test3b_y_iter<6 >) { ++count; }
  1966. foreach ( j : Test3b_y_iter<6 > ) { ++count; }
  1967. ASSERT(count == 7 * 2 * 32);
  1968. }
  1969. Test:y_iter_Syntax3c()
  1970. {
  1971. new
  1972. Iterator: Test3c_y_iter <10, 100>;
  1973. Iter_Add(Test3c_y_iter<4>, 11);
  1974. Iter_Add(Test3c_y_iter<4>, 12);
  1975. Iter_Add(Test3c_y_iter<4>, 13);
  1976. Iter_Add(Test3c_y_iter<4>, 16);
  1977. Iter_Add(Test3c_y_iter<4>, 19);
  1978. Iter_Add(Test3c_y_iter<4>, 22);
  1979. Iter_Add(Test3c_y_iter<4>, 23);
  1980. new
  1981. count = 0;
  1982. foreach(new i:Test3c_y_iter <4>) { ++count; }
  1983. foreach(new i:Test3c_y_iter <4> ) { ++count; }
  1984. foreach(new i: Test3c_y_iter <4>) { ++count; }
  1985. foreach(new i: Test3c_y_iter <4> ) { ++count; }
  1986. foreach(new i :Test3c_y_iter <4>) { ++count; }
  1987. foreach(new i :Test3c_y_iter <4> ) { ++count; }
  1988. foreach(new i : Test3c_y_iter <4>) { ++count; }
  1989. foreach(new i : Test3c_y_iter <4> ) { ++count; }
  1990. foreach( new i:Test3c_y_iter <4>) { ++count; }
  1991. foreach( new i:Test3c_y_iter <4> ) { ++count; }
  1992. foreach( new i: Test3c_y_iter <4>) { ++count; }
  1993. foreach( new i: Test3c_y_iter <4> ) { ++count; }
  1994. foreach( new i :Test3c_y_iter <4>) { ++count; }
  1995. foreach( new i :Test3c_y_iter <4> ) { ++count; }
  1996. foreach( new i : Test3c_y_iter <4>) { ++count; }
  1997. foreach( new i : Test3c_y_iter <4> ) { ++count; }
  1998. foreach (new i:Test3c_y_iter <4>) { ++count; }
  1999. foreach (new i:Test3c_y_iter <4> ) { ++count; }
  2000. foreach (new i: Test3c_y_iter <4>) { ++count; }
  2001. foreach (new i: Test3c_y_iter <4> ) { ++count; }
  2002. foreach (new i :Test3c_y_iter <4>) { ++count; }
  2003. foreach (new i :Test3c_y_iter <4> ) { ++count; }
  2004. foreach (new i : Test3c_y_iter <4>) { ++count; }
  2005. foreach (new i : Test3c_y_iter <4> ) { ++count; }
  2006. foreach ( new i:Test3c_y_iter <4>) { ++count; }
  2007. foreach ( new i:Test3c_y_iter <4> ) { ++count; }
  2008. foreach ( new i: Test3c_y_iter <4>) { ++count; }
  2009. foreach ( new i: Test3c_y_iter <4> ) { ++count; }
  2010. foreach ( new i :Test3c_y_iter <4>) { ++count; }
  2011. foreach ( new i :Test3c_y_iter <4> ) { ++count; }
  2012. foreach ( new i : Test3c_y_iter <4>) { ++count; }
  2013. foreach ( new i : Test3c_y_iter <4> ) { ++count; }
  2014. new
  2015. j;
  2016. foreach(j:Test3c_y_iter < 4>) { ++count; }
  2017. foreach(j:Test3c_y_iter < 4> ) { ++count; }
  2018. foreach(j: Test3c_y_iter < 4>) { ++count; }
  2019. foreach(j: Test3c_y_iter < 4> ) { ++count; }
  2020. foreach(j :Test3c_y_iter < 4>) { ++count; }
  2021. foreach(j :Test3c_y_iter < 4> ) { ++count; }
  2022. foreach(j : Test3c_y_iter < 4>) { ++count; }
  2023. foreach(j : Test3c_y_iter < 4> ) { ++count; }
  2024. foreach( j:Test3c_y_iter < 4>) { ++count; }
  2025. foreach( j:Test3c_y_iter < 4> ) { ++count; }
  2026. foreach( j: Test3c_y_iter < 4>) { ++count; }
  2027. foreach( j: Test3c_y_iter < 4> ) { ++count; }
  2028. foreach( j :Test3c_y_iter < 4>) { ++count; }
  2029. foreach( j :Test3c_y_iter < 4> ) { ++count; }
  2030. foreach( j : Test3c_y_iter < 4>) { ++count; }
  2031. foreach( j : Test3c_y_iter < 4> ) { ++count; }
  2032. foreach (j:Test3c_y_iter < 4>) { ++count; }
  2033. foreach (j:Test3c_y_iter < 4> ) { ++count; }
  2034. foreach (j: Test3c_y_iter < 4>) { ++count; }
  2035. foreach (j: Test3c_y_iter < 4> ) { ++count; }
  2036. foreach (j :Test3c_y_iter < 4>) { ++count; }
  2037. foreach (j :Test3c_y_iter < 4> ) { ++count; }
  2038. foreach (j : Test3c_y_iter < 4>) { ++count; }
  2039. foreach (j : Test3c_y_iter < 4> ) { ++count; }
  2040. foreach ( j:Test3c_y_iter < 4>) { ++count; }
  2041. foreach ( j:Test3c_y_iter < 4> ) { ++count; }
  2042. foreach ( j: Test3c_y_iter < 4>) { ++count; }
  2043. foreach ( j: Test3c_y_iter < 4> ) { ++count; }
  2044. foreach ( j :Test3c_y_iter < 4>) { ++count; }
  2045. foreach ( j :Test3c_y_iter < 4> ) { ++count; }
  2046. foreach ( j : Test3c_y_iter < 4>) { ++count; }
  2047. foreach ( j : Test3c_y_iter < 4> ) { ++count; }
  2048. ASSERT(count == 7 * 2 * 32);
  2049. }
  2050. Test:y_iter_Syntax3d()
  2051. {
  2052. new
  2053. Iterator:Test3d_y_iter < 10, 100 >;
  2054. Iter_Add(Test3d_y_iter<6>, 11);
  2055. Iter_Add(Test3d_y_iter<6>, 12);
  2056. Iter_Add(Test3d_y_iter<6>, 13);
  2057. Iter_Add(Test3d_y_iter<6>, 16);
  2058. Iter_Add(Test3d_y_iter<6>, 19);
  2059. Iter_Add(Test3d_y_iter<6>, 22);
  2060. Iter_Add(Test3d_y_iter<6>, 23);
  2061. new
  2062. count = 0;
  2063. foreach(new i:Test3d_y_iter < 6 >) { ++count; }
  2064. foreach(new i:Test3d_y_iter < 6 > ) { ++count; }
  2065. foreach(new i: Test3d_y_iter < 6 >) { ++count; }
  2066. foreach(new i: Test3d_y_iter < 6 > ) { ++count; }
  2067. foreach(new i :Test3d_y_iter < 6 >) { ++count; }
  2068. foreach(new i :Test3d_y_iter < 6 > ) { ++count; }
  2069. foreach(new i : Test3d_y_iter < 6 >) { ++count; }
  2070. foreach(new i : Test3d_y_iter < 6 > ) { ++count; }
  2071. foreach( new i:Test3d_y_iter < 6 >) { ++count; }
  2072. foreach( new i:Test3d_y_iter < 6 > ) { ++count; }
  2073. foreach( new i: Test3d_y_iter < 6 >) { ++count; }
  2074. foreach( new i: Test3d_y_iter < 6 > ) { ++count; }
  2075. foreach( new i :Test3d_y_iter < 6 >) { ++count; }
  2076. foreach( new i :Test3d_y_iter < 6 > ) { ++count; }
  2077. foreach( new i : Test3d_y_iter < 6 >) { ++count; }
  2078. foreach( new i : Test3d_y_iter < 6 > ) { ++count; }
  2079. foreach (new i:Test3d_y_iter < 6 >) { ++count; }
  2080. foreach (new i:Test3d_y_iter < 6 > ) { ++count; }
  2081. foreach (new i: Test3d_y_iter < 6 >) { ++count; }
  2082. foreach (new i: Test3d_y_iter < 6 > ) { ++count; }
  2083. foreach (new i :Test3d_y_iter < 6 >) { ++count; }
  2084. foreach (new i :Test3d_y_iter < 6 > ) { ++count; }
  2085. foreach (new i : Test3d_y_iter < 6 >) { ++count; }
  2086. foreach (new i : Test3d_y_iter < 6 > ) { ++count; }
  2087. foreach ( new i:Test3d_y_iter < 6 >) { ++count; }
  2088. foreach ( new i:Test3d_y_iter < 6 > ) { ++count; }
  2089. foreach ( new i: Test3d_y_iter < 6 >) { ++count; }
  2090. foreach ( new i: Test3d_y_iter < 6 > ) { ++count; }
  2091. foreach ( new i :Test3d_y_iter < 6 >) { ++count; }
  2092. foreach ( new i :Test3d_y_iter < 6 > ) { ++count; }
  2093. foreach ( new i : Test3d_y_iter < 6 >) { ++count; }
  2094. foreach ( new i : Test3d_y_iter < 6 > ) { ++count; }
  2095. new
  2096. j;
  2097. foreach(j:Test3d_y_iter <6 >) { ++count; }
  2098. foreach(j:Test3d_y_iter <6 > ) { ++count; }
  2099. foreach(j: Test3d_y_iter <6 >) { ++count; }
  2100. foreach(j: Test3d_y_iter <6 > ) { ++count; }
  2101. foreach(j :Test3d_y_iter <6 >) { ++count; }
  2102. foreach(j :Test3d_y_iter <6 > ) { ++count; }
  2103. foreach(j : Test3d_y_iter <6 >) { ++count; }
  2104. foreach(j : Test3d_y_iter <6 > ) { ++count; }
  2105. foreach( j:Test3d_y_iter <6 >) { ++count; }
  2106. foreach( j:Test3d_y_iter <6 > ) { ++count; }
  2107. foreach( j: Test3d_y_iter <6 >) { ++count; }
  2108. foreach( j: Test3d_y_iter <6 > ) { ++count; }
  2109. foreach( j :Test3d_y_iter <6 >) { ++count; }
  2110. foreach( j :Test3d_y_iter <6 > ) { ++count; }
  2111. foreach( j : Test3d_y_iter <6 >) { ++count; }
  2112. foreach( j : Test3d_y_iter <6 > ) { ++count; }
  2113. foreach (j:Test3d_y_iter <6 >) { ++count; }
  2114. foreach (j:Test3d_y_iter <6 > ) { ++count; }
  2115. foreach (j: Test3d_y_iter <6 >) { ++count; }
  2116. foreach (j: Test3d_y_iter <6 > ) { ++count; }
  2117. foreach (j :Test3d_y_iter <6 >) { ++count; }
  2118. foreach (j :Test3d_y_iter <6 > ) { ++count; }
  2119. foreach (j : Test3d_y_iter <6 >) { ++count; }
  2120. foreach (j : Test3d_y_iter <6 > ) { ++count; }
  2121. foreach ( j:Test3d_y_iter <6 >) { ++count; }
  2122. foreach ( j:Test3d_y_iter <6 > ) { ++count; }
  2123. foreach ( j: Test3d_y_iter <6 >) { ++count; }
  2124. foreach ( j: Test3d_y_iter <6 > ) { ++count; }
  2125. foreach ( j :Test3d_y_iter <6 >) { ++count; }
  2126. foreach ( j :Test3d_y_iter <6 > ) { ++count; }
  2127. foreach ( j : Test3d_y_iter <6 >) { ++count; }
  2128. foreach ( j : Test3d_y_iter <6 > ) { ++count; }
  2129. ASSERT(count == 7 * 2 * 32);
  2130. }
  2131. stock iterfunc y_iter_Syntax6(&iterstate, cur, inc)
  2132. {
  2133. cur += (inc * iterstate);
  2134. return cur;
  2135. }
  2136. #define Iterator@y_iter_Syntax6 iterstate(0, 1024)
  2137. Test:y_iter_Syntax6a()
  2138. {
  2139. new
  2140. count = 0;
  2141. foreach (new i : y_iter_Syntax6(1024))
  2142. {
  2143. ASSERT(i % 1048576 == 0);
  2144. ++count;
  2145. }
  2146. ASSERT(count == 4095);
  2147. }
  2148. Test:y_iter_Syntax6b()
  2149. {
  2150. new
  2151. count = 0;
  2152. foreach(new i:y_iter_Syntax6(1024)) { ++count; }
  2153. foreach(new i:y_iter_Syntax6(1024) ) { ++count; }
  2154. foreach(new i: y_iter_Syntax6(1024)) { ++count; }
  2155. foreach(new i: y_iter_Syntax6(1024) ) { ++count; }
  2156. foreach(new i :y_iter_Syntax6(1024)) { ++count; }
  2157. foreach(new i :y_iter_Syntax6(1024) ) { ++count; }
  2158. foreach(new i : y_iter_Syntax6(1024)) { ++count; }
  2159. foreach(new i : y_iter_Syntax6(1024) ) { ++count; }
  2160. foreach( new i:y_iter_Syntax6(1024)) { ++count; }
  2161. foreach( new i:y_iter_Syntax6(1024) ) { ++count; }
  2162. foreach( new i: y_iter_Syntax6(1024)) { ++count; }
  2163. foreach( new i: y_iter_Syntax6(1024) ) { ++count; }
  2164. foreach( new i :y_iter_Syntax6(1024)) { ++count; }
  2165. foreach( new i :y_iter_Syntax6(1024) ) { ++count; }
  2166. foreach( new i : y_iter_Syntax6(1024)) { ++count; }
  2167. foreach( new i : y_iter_Syntax6(1024) ) { ++count; }
  2168. foreach (new i:y_iter_Syntax6(1024)) { ++count; }
  2169. foreach (new i:y_iter_Syntax6(1024) ) { ++count; }
  2170. foreach (new i: y_iter_Syntax6(1024)) { ++count; }
  2171. foreach (new i: y_iter_Syntax6(1024) ) { ++count; }
  2172. foreach (new i :y_iter_Syntax6(1024)) { ++count; }
  2173. foreach (new i :y_iter_Syntax6(1024) ) { ++count; }
  2174. foreach (new i : y_iter_Syntax6(1024)) { ++count; }
  2175. foreach (new i : y_iter_Syntax6(1024) ) { ++count; }
  2176. foreach ( new i:y_iter_Syntax6(1024)) { ++count; }
  2177. foreach ( new i:y_iter_Syntax6(1024) ) { ++count; }
  2178. foreach ( new i: y_iter_Syntax6(1024)) { ++count; }
  2179. foreach ( new i: y_iter_Syntax6(1024) ) { ++count; }
  2180. foreach ( new i :y_iter_Syntax6(1024)) { ++count; }
  2181. foreach ( new i :y_iter_Syntax6(1024) ) { ++count; }
  2182. foreach ( new i : y_iter_Syntax6(1024)) { ++count; }
  2183. foreach ( new i : y_iter_Syntax6(1024) ) { ++count; }
  2184. ASSERT(count == 4095 * 1 * 32);
  2185. #if _DEBUG
  2186. new TODO@issue_217;
  2187. #endif
  2188. // new
  2189. // j;
  2190. // foreach(j:y_iter_Syntax6(1024)) { ++count; }
  2191. // foreach(j:y_iter_Syntax6(1024) ) { ++count; }
  2192. // foreach(j: y_iter_Syntax6(1024)) { ++count; }
  2193. // foreach(j: y_iter_Syntax6(1024) ) { ++count; }
  2194. // foreach(j :y_iter_Syntax6(1024)) { ++count; }
  2195. // foreach(j :y_iter_Syntax6(1024) ) { ++count; }
  2196. // foreach(j : y_iter_Syntax6(1024)) { ++count; }
  2197. // foreach(j : y_iter_Syntax6(1024) ) { ++count; }
  2198. // foreach( j:y_iter_Syntax6(1024)) { ++count; }
  2199. // foreach( j:y_iter_Syntax6(1024) ) { ++count; }
  2200. // foreach( j: y_iter_Syntax6(1024)) { ++count; }
  2201. // foreach( j: y_iter_Syntax6(1024) ) { ++count; }
  2202. // foreach( j :y_iter_Syntax6(1024)) { ++count; }
  2203. // foreach( j :y_iter_Syntax6(1024) ) { ++count; }
  2204. // foreach( j : y_iter_Syntax6(1024)) { ++count; }
  2205. // foreach( j : y_iter_Syntax6(1024) ) { ++count; }
  2206. // foreach (j:y_iter_Syntax6(1024)) { ++count; }
  2207. // foreach (j:y_iter_Syntax6(1024) ) { ++count; }
  2208. // foreach (j: y_iter_Syntax6(1024)) { ++count; }
  2209. // foreach (j: y_iter_Syntax6(1024) ) { ++count; }
  2210. // foreach (j :y_iter_Syntax6(1024)) { ++count; }
  2211. // foreach (j :y_iter_Syntax6(1024) ) { ++count; }
  2212. // foreach (j : y_iter_Syntax6(1024)) { ++count; }
  2213. // foreach (j : y_iter_Syntax6(1024) ) { ++count; }
  2214. // foreach ( j:y_iter_Syntax6(1024)) { ++count; }
  2215. // foreach ( j:y_iter_Syntax6(1024) ) { ++count; }
  2216. // foreach ( j: y_iter_Syntax6(1024)) { ++count; }
  2217. // foreach ( j: y_iter_Syntax6(1024) ) { ++count; }
  2218. // foreach ( j :y_iter_Syntax6(1024)) { ++count; }
  2219. // foreach ( j :y_iter_Syntax6(1024) ) { ++count; }
  2220. // foreach ( j : y_iter_Syntax6(1024)) { ++count; }
  2221. // foreach ( j : y_iter_Syntax6(1024) ) { ++count; }
  2222. // ASSERT(count == 4095 * 2 * 32);
  2223. }
  2224. Test:y_iter_Syntax6c()
  2225. {
  2226. new
  2227. count = 0;
  2228. foreach(new i:y_iter_Syntax6[1024]) { ++count; }
  2229. foreach(new i:y_iter_Syntax6[1024] ) { ++count; }
  2230. foreach(new i: y_iter_Syntax6[1024]) { ++count; }
  2231. foreach(new i: y_iter_Syntax6[1024] ) { ++count; }
  2232. foreach(new i :y_iter_Syntax6[1024]) { ++count; }
  2233. foreach(new i :y_iter_Syntax6[1024] ) { ++count; }
  2234. foreach(new i : y_iter_Syntax6[1024]) { ++count; }
  2235. foreach(new i : y_iter_Syntax6[1024] ) { ++count; }
  2236. foreach( new i:y_iter_Syntax6[1024]) { ++count; }
  2237. foreach( new i:y_iter_Syntax6[1024] ) { ++count; }
  2238. foreach( new i: y_iter_Syntax6[1024]) { ++count; }
  2239. foreach( new i: y_iter_Syntax6[1024] ) { ++count; }
  2240. foreach( new i :y_iter_Syntax6[1024]) { ++count; }
  2241. foreach( new i :y_iter_Syntax6[1024] ) { ++count; }
  2242. foreach( new i : y_iter_Syntax6[1024]) { ++count; }
  2243. foreach( new i : y_iter_Syntax6[1024] ) { ++count; }
  2244. foreach (new i:y_iter_Syntax6[1024]) { ++count; }
  2245. foreach (new i:y_iter_Syntax6[1024] ) { ++count; }
  2246. foreach (new i: y_iter_Syntax6[1024]) { ++count; }
  2247. foreach (new i: y_iter_Syntax6[1024] ) { ++count; }
  2248. foreach (new i :y_iter_Syntax6[1024]) { ++count; }
  2249. foreach (new i :y_iter_Syntax6[1024] ) { ++count; }
  2250. foreach (new i : y_iter_Syntax6[1024]) { ++count; }
  2251. foreach (new i : y_iter_Syntax6[1024] ) { ++count; }
  2252. foreach ( new i:y_iter_Syntax6[1024]) { ++count; }
  2253. foreach ( new i:y_iter_Syntax6[1024] ) { ++count; }
  2254. foreach ( new i: y_iter_Syntax6[1024]) { ++count; }
  2255. foreach ( new i: y_iter_Syntax6[1024] ) { ++count; }
  2256. foreach ( new i :y_iter_Syntax6[1024]) { ++count; }
  2257. foreach ( new i :y_iter_Syntax6[1024] ) { ++count; }
  2258. foreach ( new i : y_iter_Syntax6[1024]) { ++count; }
  2259. foreach ( new i : y_iter_Syntax6[1024] ) { ++count; }
  2260. ASSERT(count == 4095 * 1 * 32);
  2261. #if _DEBUG
  2262. new TODO@issue_217;
  2263. #endif
  2264. // new
  2265. // j;
  2266. // foreach(j:y_iter_Syntax6[1024]) { ++count; }
  2267. // foreach(j:y_iter_Syntax6[1024] ) { ++count; }
  2268. // foreach(j: y_iter_Syntax6[1024]) { ++count; }
  2269. // foreach(j: y_iter_Syntax6[1024] ) { ++count; }
  2270. // foreach(j :y_iter_Syntax6[1024]) { ++count; }
  2271. // foreach(j :y_iter_Syntax6[1024] ) { ++count; }
  2272. // foreach(j : y_iter_Syntax6[1024]) { ++count; }
  2273. // foreach(j : y_iter_Syntax6[1024] ) { ++count; }
  2274. // foreach( j:y_iter_Syntax6[1024]) { ++count; }
  2275. // foreach( j:y_iter_Syntax6[1024] ) { ++count; }
  2276. // foreach( j: y_iter_Syntax6[1024]) { ++count; }
  2277. // foreach( j: y_iter_Syntax6[1024] ) { ++count; }
  2278. // foreach( j :y_iter_Syntax6[1024]) { ++count; }
  2279. // foreach( j :y_iter_Syntax6[1024] ) { ++count; }
  2280. // foreach( j : y_iter_Syntax6[1024]) { ++count; }
  2281. // foreach( j : y_iter_Syntax6[1024] ) { ++count; }
  2282. // foreach (j:y_iter_Syntax6[1024]) { ++count; }
  2283. // foreach (j:y_iter_Syntax6[1024] ) { ++count; }
  2284. // foreach (j: y_iter_Syntax6[1024]) { ++count; }
  2285. // foreach (j: y_iter_Syntax6[1024] ) { ++count; }
  2286. // foreach (j :y_iter_Syntax6[1024]) { ++count; }
  2287. // foreach (j :y_iter_Syntax6[1024] ) { ++count; }
  2288. // foreach (j : y_iter_Syntax6[1024]) { ++count; }
  2289. // foreach (j : y_iter_Syntax6[1024] ) { ++count; }
  2290. // foreach ( j:y_iter_Syntax6[1024]) { ++count; }
  2291. // foreach ( j:y_iter_Syntax6[1024] ) { ++count; }
  2292. // foreach ( j: y_iter_Syntax6[1024]) { ++count; }
  2293. // foreach ( j: y_iter_Syntax6[1024] ) { ++count; }
  2294. // foreach ( j :y_iter_Syntax6[1024]) { ++count; }
  2295. // foreach ( j :y_iter_Syntax6[1024] ) { ++count; }
  2296. // foreach ( j : y_iter_Syntax6[1024]) { ++count; }
  2297. // foreach ( j : y_iter_Syntax6[1024] ) { ++count; }
  2298. // ASSERT(count == 4095 * 2 * 32);
  2299. }
  2300. Test:y_iter_Syntax2a()
  2301. {
  2302. new
  2303. count = 0;
  2304. foreach(new i:Test2a_y_iter()) { ++count; }
  2305. foreach(new i:Test2a_y_iter() ) { ++count; }
  2306. foreach(new i: Test2a_y_iter()) { ++count; }
  2307. foreach(new i: Test2a_y_iter() ) { ++count; }
  2308. foreach(new i :Test2a_y_iter()) { ++count; }
  2309. foreach(new i :Test2a_y_iter() ) { ++count; }
  2310. foreach(new i : Test2a_y_iter()) { ++count; }
  2311. foreach(new i : Test2a_y_iter() ) { ++count; }
  2312. foreach( new i:Test2a_y_iter()) { ++count; }
  2313. foreach( new i:Test2a_y_iter() ) { ++count; }
  2314. foreach( new i: Test2a_y_iter()) { ++count; }
  2315. foreach( new i: Test2a_y_iter() ) { ++count; }
  2316. foreach( new i :Test2a_y_iter()) { ++count; }
  2317. foreach( new i :Test2a_y_iter() ) { ++count; }
  2318. foreach( new i : Test2a_y_iter()) { ++count; }
  2319. foreach( new i : Test2a_y_iter() ) { ++count; }
  2320. foreach (new i:Test2a_y_iter()) { ++count; }
  2321. foreach (new i:Test2a_y_iter() ) { ++count; }
  2322. foreach (new i: Test2a_y_iter()) { ++count; }
  2323. foreach (new i: Test2a_y_iter() ) { ++count; }
  2324. foreach (new i :Test2a_y_iter()) { ++count; }
  2325. foreach (new i :Test2a_y_iter() ) { ++count; }
  2326. foreach (new i : Test2a_y_iter()) { ++count; }
  2327. foreach (new i : Test2a_y_iter() ) { ++count; }
  2328. foreach ( new i:Test2a_y_iter()) { ++count; }
  2329. foreach ( new i:Test2a_y_iter() ) { ++count; }
  2330. foreach ( new i: Test2a_y_iter()) { ++count; }
  2331. foreach ( new i: Test2a_y_iter() ) { ++count; }
  2332. foreach ( new i :Test2a_y_iter()) { ++count; }
  2333. foreach ( new i :Test2a_y_iter() ) { ++count; }
  2334. foreach ( new i : Test2a_y_iter()) { ++count; }
  2335. foreach ( new i : Test2a_y_iter() ) { ++count; }
  2336. new
  2337. j;
  2338. foreach(j:Test2a_y_iter()) { ++count; }
  2339. foreach(j:Test2a_y_iter() ) { ++count; }
  2340. foreach(j: Test2a_y_iter()) { ++count; }
  2341. foreach(j: Test2a_y_iter() ) { ++count; }
  2342. foreach(j :Test2a_y_iter()) { ++count; }
  2343. foreach(j :Test2a_y_iter() ) { ++count; }
  2344. foreach(j : Test2a_y_iter()) { ++count; }
  2345. foreach(j : Test2a_y_iter() ) { ++count; }
  2346. foreach( j:Test2a_y_iter()) { ++count; }
  2347. foreach( j:Test2a_y_iter() ) { ++count; }
  2348. foreach( j: Test2a_y_iter()) { ++count; }
  2349. foreach( j: Test2a_y_iter() ) { ++count; }
  2350. foreach( j :Test2a_y_iter()) { ++count; }
  2351. foreach( j :Test2a_y_iter() ) { ++count; }
  2352. foreach( j : Test2a_y_iter()) { ++count; }
  2353. foreach( j : Test2a_y_iter() ) { ++count; }
  2354. foreach (j:Test2a_y_iter()) { ++count; }
  2355. foreach (j:Test2a_y_iter() ) { ++count; }
  2356. foreach (j: Test2a_y_iter()) { ++count; }
  2357. foreach (j: Test2a_y_iter() ) { ++count; }
  2358. foreach (j :Test2a_y_iter()) { ++count; }
  2359. foreach (j :Test2a_y_iter() ) { ++count; }
  2360. foreach (j : Test2a_y_iter()) { ++count; }
  2361. foreach (j : Test2a_y_iter() ) { ++count; }
  2362. foreach ( j:Test2a_y_iter()) { ++count; }
  2363. foreach ( j:Test2a_y_iter() ) { ++count; }
  2364. foreach ( j: Test2a_y_iter()) { ++count; }
  2365. foreach ( j: Test2a_y_iter() ) { ++count; }
  2366. foreach ( j :Test2a_y_iter()) { ++count; }
  2367. foreach ( j :Test2a_y_iter() ) { ++count; }
  2368. foreach ( j : Test2a_y_iter()) { ++count; }
  2369. foreach ( j : Test2a_y_iter() ) { ++count; }
  2370. ASSERT(count == 7 * 2 * 32);
  2371. }
  2372. Test:y_iter_Syntax2e()
  2373. {
  2374. new
  2375. count = 0;
  2376. foreach(new i:Test2a_y_iter) { ++count; }
  2377. foreach(new i:Test2a_y_iter ) { ++count; }
  2378. foreach(new i: Test2a_y_iter) { ++count; }
  2379. foreach(new i: Test2a_y_iter ) { ++count; }
  2380. foreach(new i :Test2a_y_iter) { ++count; }
  2381. foreach(new i :Test2a_y_iter ) { ++count; }
  2382. foreach(new i : Test2a_y_iter) { ++count; }
  2383. foreach(new i : Test2a_y_iter ) { ++count; }
  2384. foreach( new i:Test2a_y_iter) { ++count; }
  2385. foreach( new i:Test2a_y_iter ) { ++count; }
  2386. foreach( new i: Test2a_y_iter) { ++count; }
  2387. foreach( new i: Test2a_y_iter ) { ++count; }
  2388. foreach( new i :Test2a_y_iter) { ++count; }
  2389. foreach( new i :Test2a_y_iter ) { ++count; }
  2390. foreach( new i : Test2a_y_iter) { ++count; }
  2391. foreach( new i : Test2a_y_iter ) { ++count; }
  2392. foreach (new i:Test2a_y_iter) { ++count; }
  2393. foreach (new i:Test2a_y_iter ) { ++count; }
  2394. foreach (new i: Test2a_y_iter) { ++count; }
  2395. foreach (new i: Test2a_y_iter ) { ++count; }
  2396. foreach (new i :Test2a_y_iter) { ++count; }
  2397. foreach (new i :Test2a_y_iter ) { ++count; }
  2398. foreach (new i : Test2a_y_iter) { ++count; }
  2399. foreach (new i : Test2a_y_iter ) { ++count; }
  2400. foreach ( new i:Test2a_y_iter) { ++count; }
  2401. foreach ( new i:Test2a_y_iter ) { ++count; }
  2402. foreach ( new i: Test2a_y_iter) { ++count; }
  2403. foreach ( new i: Test2a_y_iter ) { ++count; }
  2404. foreach ( new i :Test2a_y_iter) { ++count; }
  2405. foreach ( new i :Test2a_y_iter ) { ++count; }
  2406. foreach ( new i : Test2a_y_iter) { ++count; }
  2407. foreach ( new i : Test2a_y_iter ) { ++count; }
  2408. new
  2409. j;
  2410. foreach(j:Test2a_y_iter) { ++count; }
  2411. foreach(j:Test2a_y_iter ) { ++count; }
  2412. foreach(j: Test2a_y_iter) { ++count; }
  2413. foreach(j: Test2a_y_iter ) { ++count; }
  2414. foreach(j :Test2a_y_iter) { ++count; }
  2415. foreach(j :Test2a_y_iter ) { ++count; }
  2416. foreach(j : Test2a_y_iter) { ++count; }
  2417. foreach(j : Test2a_y_iter ) { ++count; }
  2418. foreach( j:Test2a_y_iter) { ++count; }
  2419. foreach( j:Test2a_y_iter ) { ++count; }
  2420. foreach( j: Test2a_y_iter) { ++count; }
  2421. foreach( j: Test2a_y_iter ) { ++count; }
  2422. foreach( j :Test2a_y_iter) { ++count; }
  2423. foreach( j :Test2a_y_iter ) { ++count; }
  2424. foreach( j : Test2a_y_iter) { ++count; }
  2425. foreach( j : Test2a_y_iter ) { ++count; }
  2426. foreach (j:Test2a_y_iter) { ++count; }
  2427. foreach (j:Test2a_y_iter ) { ++count; }
  2428. foreach (j: Test2a_y_iter) { ++count; }
  2429. foreach (j: Test2a_y_iter ) { ++count; }
  2430. foreach (j :Test2a_y_iter) { ++count; }
  2431. foreach (j :Test2a_y_iter ) { ++count; }
  2432. foreach (j : Test2a_y_iter) { ++count; }
  2433. foreach (j : Test2a_y_iter ) { ++count; }
  2434. foreach ( j:Test2a_y_iter) { ++count; }
  2435. foreach ( j:Test2a_y_iter ) { ++count; }
  2436. foreach ( j: Test2a_y_iter) { ++count; }
  2437. foreach ( j: Test2a_y_iter ) { ++count; }
  2438. foreach ( j :Test2a_y_iter) { ++count; }
  2439. foreach ( j :Test2a_y_iter ) { ++count; }
  2440. foreach ( j : Test2a_y_iter) { ++count; }
  2441. foreach ( j : Test2a_y_iter ) { ++count; }
  2442. ASSERT(count == 7 * 2 * 32);
  2443. }
  2444. Test:y_iter_Syntax2b()
  2445. {
  2446. new
  2447. count = 0;
  2448. foreach(new i:Test2b_y_iter( )) { ++count; }
  2449. foreach(new i:Test2b_y_iter( ) ) { ++count; }
  2450. foreach(new i: Test2b_y_iter( )) { ++count; }
  2451. foreach(new i: Test2b_y_iter( ) ) { ++count; }
  2452. foreach(new i :Test2b_y_iter( )) { ++count; }
  2453. foreach(new i :Test2b_y_iter( ) ) { ++count; }
  2454. foreach(new i : Test2b_y_iter( )) { ++count; }
  2455. foreach(new i : Test2b_y_iter( ) ) { ++count; }
  2456. foreach( new i:Test2b_y_iter( )) { ++count; }
  2457. foreach( new i:Test2b_y_iter( ) ) { ++count; }
  2458. foreach( new i: Test2b_y_iter( )) { ++count; }
  2459. foreach( new i: Test2b_y_iter( ) ) { ++count; }
  2460. foreach( new i :Test2b_y_iter( )) { ++count; }
  2461. foreach( new i :Test2b_y_iter( ) ) { ++count; }
  2462. foreach( new i : Test2b_y_iter( )) { ++count; }
  2463. foreach( new i : Test2b_y_iter( ) ) { ++count; }
  2464. foreach (new i:Test2b_y_iter( )) { ++count; }
  2465. foreach (new i:Test2b_y_iter( ) ) { ++count; }
  2466. foreach (new i: Test2b_y_iter( )) { ++count; }
  2467. foreach (new i: Test2b_y_iter( ) ) { ++count; }
  2468. foreach (new i :Test2b_y_iter( )) { ++count; }
  2469. foreach (new i :Test2b_y_iter( ) ) { ++count; }
  2470. foreach (new i : Test2b_y_iter( )) { ++count; }
  2471. foreach (new i : Test2b_y_iter( ) ) { ++count; }
  2472. foreach ( new i:Test2b_y_iter( )) { ++count; }
  2473. foreach ( new i:Test2b_y_iter( ) ) { ++count; }
  2474. foreach ( new i: Test2b_y_iter( )) { ++count; }
  2475. foreach ( new i: Test2b_y_iter( ) ) { ++count; }
  2476. foreach ( new i :Test2b_y_iter( )) { ++count; }
  2477. foreach ( new i :Test2b_y_iter( ) ) { ++count; }
  2478. foreach ( new i : Test2b_y_iter( )) { ++count; }
  2479. foreach ( new i : Test2b_y_iter( ) ) { ++count; }
  2480. new
  2481. j;
  2482. foreach(j:Test2b_y_iter( )) { ++count; }
  2483. foreach(j:Test2b_y_iter( ) ) { ++count; }
  2484. foreach(j: Test2b_y_iter( )) { ++count; }
  2485. foreach(j: Test2b_y_iter( ) ) { ++count; }
  2486. foreach(j :Test2b_y_iter( )) { ++count; }
  2487. foreach(j :Test2b_y_iter( ) ) { ++count; }
  2488. foreach(j : Test2b_y_iter( )) { ++count; }
  2489. foreach(j : Test2b_y_iter( ) ) { ++count; }
  2490. foreach( j:Test2b_y_iter( )) { ++count; }
  2491. foreach( j:Test2b_y_iter( ) ) { ++count; }
  2492. foreach( j: Test2b_y_iter( )) { ++count; }
  2493. foreach( j: Test2b_y_iter( ) ) { ++count; }
  2494. foreach( j :Test2b_y_iter( )) { ++count; }
  2495. foreach( j :Test2b_y_iter( ) ) { ++count; }
  2496. foreach( j : Test2b_y_iter( )) { ++count; }
  2497. foreach( j : Test2b_y_iter( ) ) { ++count; }
  2498. foreach (j:Test2b_y_iter( )) { ++count; }
  2499. foreach (j:Test2b_y_iter( ) ) { ++count; }
  2500. foreach (j: Test2b_y_iter( )) { ++count; }
  2501. foreach (j: Test2b_y_iter( ) ) { ++count; }
  2502. foreach (j :Test2b_y_iter( )) { ++count; }
  2503. foreach (j :Test2b_y_iter( ) ) { ++count; }
  2504. foreach (j : Test2b_y_iter( )) { ++count; }
  2505. foreach (j : Test2b_y_iter( ) ) { ++count; }
  2506. foreach ( j:Test2b_y_iter( )) { ++count; }
  2507. foreach ( j:Test2b_y_iter( ) ) { ++count; }
  2508. foreach ( j: Test2b_y_iter( )) { ++count; }
  2509. foreach ( j: Test2b_y_iter( ) ) { ++count; }
  2510. foreach ( j :Test2b_y_iter( )) { ++count; }
  2511. foreach ( j :Test2b_y_iter( ) ) { ++count; }
  2512. foreach ( j : Test2b_y_iter( )) { ++count; }
  2513. foreach ( j : Test2b_y_iter( ) ) { ++count; }
  2514. ASSERT(count == 7 * 2 * 32);
  2515. }
  2516. Test:y_iter_Syntax2c()
  2517. {
  2518. new
  2519. count = 0;
  2520. foreach(new i:Test2c_y_iter ()) { ++count; }
  2521. foreach(new i:Test2c_y_iter () ) { ++count; }
  2522. foreach(new i: Test2c_y_iter ()) { ++count; }
  2523. foreach(new i: Test2c_y_iter () ) { ++count; }
  2524. foreach(new i :Test2c_y_iter ()) { ++count; }
  2525. foreach(new i :Test2c_y_iter () ) { ++count; }
  2526. foreach(new i : Test2c_y_iter ()) { ++count; }
  2527. foreach(new i : Test2c_y_iter () ) { ++count; }
  2528. foreach( new i:Test2c_y_iter ()) { ++count; }
  2529. foreach( new i:Test2c_y_iter () ) { ++count; }
  2530. foreach( new i: Test2c_y_iter ()) { ++count; }
  2531. foreach( new i: Test2c_y_iter () ) { ++count; }
  2532. foreach( new i :Test2c_y_iter ()) { ++count; }
  2533. foreach( new i :Test2c_y_iter () ) { ++count; }
  2534. foreach( new i : Test2c_y_iter ()) { ++count; }
  2535. foreach( new i : Test2c_y_iter () ) { ++count; }
  2536. foreach (new i:Test2c_y_iter ()) { ++count; }
  2537. foreach (new i:Test2c_y_iter () ) { ++count; }
  2538. foreach (new i: Test2c_y_iter ()) { ++count; }
  2539. foreach (new i: Test2c_y_iter () ) { ++count; }
  2540. foreach (new i :Test2c_y_iter ()) { ++count; }
  2541. foreach (new i :Test2c_y_iter () ) { ++count; }
  2542. foreach (new i : Test2c_y_iter ()) { ++count; }
  2543. foreach (new i : Test2c_y_iter () ) { ++count; }
  2544. foreach ( new i:Test2c_y_iter ()) { ++count; }
  2545. foreach ( new i:Test2c_y_iter () ) { ++count; }
  2546. foreach ( new i: Test2c_y_iter ()) { ++count; }
  2547. foreach ( new i: Test2c_y_iter () ) { ++count; }
  2548. foreach ( new i :Test2c_y_iter ()) { ++count; }
  2549. foreach ( new i :Test2c_y_iter () ) { ++count; }
  2550. foreach ( new i : Test2c_y_iter ()) { ++count; }
  2551. foreach ( new i : Test2c_y_iter () ) { ++count; }
  2552. new
  2553. j;
  2554. foreach(j:Test2c_y_iter ()) { ++count; }
  2555. foreach(j:Test2c_y_iter () ) { ++count; }
  2556. foreach(j: Test2c_y_iter ()) { ++count; }
  2557. foreach(j: Test2c_y_iter () ) { ++count; }
  2558. foreach(j :Test2c_y_iter ()) { ++count; }
  2559. foreach(j :Test2c_y_iter () ) { ++count; }
  2560. foreach(j : Test2c_y_iter ()) { ++count; }
  2561. foreach(j : Test2c_y_iter () ) { ++count; }
  2562. foreach( j:Test2c_y_iter ()) { ++count; }
  2563. foreach( j:Test2c_y_iter () ) { ++count; }
  2564. foreach( j: Test2c_y_iter ()) { ++count; }
  2565. foreach( j: Test2c_y_iter () ) { ++count; }
  2566. foreach( j :Test2c_y_iter ()) { ++count; }
  2567. foreach( j :Test2c_y_iter () ) { ++count; }
  2568. foreach( j : Test2c_y_iter ()) { ++count; }
  2569. foreach( j : Test2c_y_iter () ) { ++count; }
  2570. foreach (j:Test2c_y_iter ()) { ++count; }
  2571. foreach (j:Test2c_y_iter () ) { ++count; }
  2572. foreach (j: Test2c_y_iter ()) { ++count; }
  2573. foreach (j: Test2c_y_iter () ) { ++count; }
  2574. foreach (j :Test2c_y_iter ()) { ++count; }
  2575. foreach (j :Test2c_y_iter () ) { ++count; }
  2576. foreach (j : Test2c_y_iter ()) { ++count; }
  2577. foreach (j : Test2c_y_iter () ) { ++count; }
  2578. foreach ( j:Test2c_y_iter ()) { ++count; }
  2579. foreach ( j:Test2c_y_iter () ) { ++count; }
  2580. foreach ( j: Test2c_y_iter ()) { ++count; }
  2581. foreach ( j: Test2c_y_iter () ) { ++count; }
  2582. foreach ( j :Test2c_y_iter ()) { ++count; }
  2583. foreach ( j :Test2c_y_iter () ) { ++count; }
  2584. foreach ( j : Test2c_y_iter ()) { ++count; }
  2585. foreach ( j : Test2c_y_iter () ) { ++count; }
  2586. ASSERT(count == 7 * 2 * 32);
  2587. }
  2588. Test:y_iter_Syntax2d()
  2589. {
  2590. new
  2591. count = 0;
  2592. foreach(new i:Test2d_y_iter ( )) { ++count; }
  2593. foreach(new i:Test2d_y_iter ( ) ) { ++count; }
  2594. foreach(new i: Test2d_y_iter ( )) { ++count; }
  2595. foreach(new i: Test2d_y_iter ( ) ) { ++count; }
  2596. foreach(new i :Test2d_y_iter ( )) { ++count; }
  2597. foreach(new i :Test2d_y_iter ( ) ) { ++count; }
  2598. foreach(new i : Test2d_y_iter ( )) { ++count; }
  2599. foreach(new i : Test2d_y_iter ( ) ) { ++count; }
  2600. foreach( new i:Test2d_y_iter ( )) { ++count; }
  2601. foreach( new i:Test2d_y_iter ( ) ) { ++count; }
  2602. foreach( new i: Test2d_y_iter ( )) { ++count; }
  2603. foreach( new i: Test2d_y_iter ( ) ) { ++count; }
  2604. foreach( new i :Test2d_y_iter ( )) { ++count; }
  2605. foreach( new i :Test2d_y_iter ( ) ) { ++count; }
  2606. foreach( new i : Test2d_y_iter ( )) { ++count; }
  2607. foreach( new i : Test2d_y_iter ( ) ) { ++count; }
  2608. foreach (new i:Test2d_y_iter ( )) { ++count; }
  2609. foreach (new i:Test2d_y_iter ( ) ) { ++count; }
  2610. foreach (new i: Test2d_y_iter ( )) { ++count; }
  2611. foreach (new i: Test2d_y_iter ( ) ) { ++count; }
  2612. foreach (new i :Test2d_y_iter ( )) { ++count; }
  2613. foreach (new i :Test2d_y_iter ( ) ) { ++count; }
  2614. foreach (new i : Test2d_y_iter ( )) { ++count; }
  2615. foreach (new i : Test2d_y_iter ( ) ) { ++count; }
  2616. foreach ( new i:Test2d_y_iter ( )) { ++count; }
  2617. foreach ( new i:Test2d_y_iter ( ) ) { ++count; }
  2618. foreach ( new i: Test2d_y_iter ( )) { ++count; }
  2619. foreach ( new i: Test2d_y_iter ( ) ) { ++count; }
  2620. foreach ( new i :Test2d_y_iter ( )) { ++count; }
  2621. foreach ( new i :Test2d_y_iter ( ) ) { ++count; }
  2622. foreach ( new i : Test2d_y_iter ( )) { ++count; }
  2623. foreach ( new i : Test2d_y_iter ( ) ) { ++count; }
  2624. new
  2625. j;
  2626. foreach(j:Test2d_y_iter ( )) { ++count; }
  2627. foreach(j:Test2d_y_iter ( ) ) { ++count; }
  2628. foreach(j: Test2d_y_iter ( )) { ++count; }
  2629. foreach(j: Test2d_y_iter ( ) ) { ++count; }
  2630. foreach(j :Test2d_y_iter ( )) { ++count; }
  2631. foreach(j :Test2d_y_iter ( ) ) { ++count; }
  2632. foreach(j : Test2d_y_iter ( )) { ++count; }
  2633. foreach(j : Test2d_y_iter ( ) ) { ++count; }
  2634. foreach( j:Test2d_y_iter ( )) { ++count; }
  2635. foreach( j:Test2d_y_iter ( ) ) { ++count; }
  2636. foreach( j: Test2d_y_iter ( )) { ++count; }
  2637. foreach( j: Test2d_y_iter ( ) ) { ++count; }
  2638. foreach( j :Test2d_y_iter ( )) { ++count; }
  2639. foreach( j :Test2d_y_iter ( ) ) { ++count; }
  2640. foreach( j : Test2d_y_iter ( )) { ++count; }
  2641. foreach( j : Test2d_y_iter ( ) ) { ++count; }
  2642. foreach (j:Test2d_y_iter ( )) { ++count; }
  2643. foreach (j:Test2d_y_iter ( ) ) { ++count; }
  2644. foreach (j: Test2d_y_iter ( )) { ++count; }
  2645. foreach (j: Test2d_y_iter ( ) ) { ++count; }
  2646. foreach (j :Test2d_y_iter ( )) { ++count; }
  2647. foreach (j :Test2d_y_iter ( ) ) { ++count; }
  2648. foreach (j : Test2d_y_iter ( )) { ++count; }
  2649. foreach (j : Test2d_y_iter ( ) ) { ++count; }
  2650. foreach ( j:Test2d_y_iter ( )) { ++count; }
  2651. foreach ( j:Test2d_y_iter ( ) ) { ++count; }
  2652. foreach ( j: Test2d_y_iter ( )) { ++count; }
  2653. foreach ( j: Test2d_y_iter ( ) ) { ++count; }
  2654. foreach ( j :Test2d_y_iter ( )) { ++count; }
  2655. foreach ( j :Test2d_y_iter ( ) ) { ++count; }
  2656. foreach ( j : Test2d_y_iter ( )) { ++count; }
  2657. foreach ( j : Test2d_y_iter ( ) ) { ++count; }
  2658. ASSERT(count == 7 * 2 * 32);
  2659. }
  2660. Test:y_iter_Array()
  2661. {
  2662. new
  2663. Iterator:Test3[5]<20>;
  2664. Iter_Init(Test3);
  2665. #pragma unused Iter_Single@Test3
  2666. new
  2667. count = 0;
  2668. foreach (new i : Test3[1])
  2669. {
  2670. ++count;
  2671. }
  2672. ASSERT(count == 0);
  2673. }
  2674. Test:y_iter_Multi()
  2675. {
  2676. new
  2677. Iterator: Test4<7, 11>;
  2678. #pragma unused Iter_Multi@Test4
  2679. new
  2680. count = 0;
  2681. foreach (new i : Test4<2>)
  2682. {
  2683. ++count;
  2684. }
  2685. ASSERT(count == 0);
  2686. }
  2687. Test:y_iter_Clear()
  2688. {
  2689. new
  2690. Iterator:a<30>,
  2691. Iterator:b<5, 30>,
  2692. Iterator:c<5, 30>;
  2693. ASSERT(Iter_Count(a) == 0);
  2694. ASSERT(Iter_Count(b<0>) == 0);
  2695. ASSERT(Iter_Count(b<1>) == 0);
  2696. ASSERT(Iter_Count(b<2>) == 0);
  2697. ASSERT(Iter_Count(b<3>) == 0);
  2698. ASSERT(Iter_Count(b<4>) == 0);
  2699. ASSERT(Iter_Count(c<0>) == 0);
  2700. ASSERT(Iter_Count(c<1>) == 0);
  2701. ASSERT(Iter_Count(c<2>) == 0);
  2702. ASSERT(Iter_Count(c<3>) == 0);
  2703. ASSERT(Iter_Count(c<4>) == 0);
  2704. for (new i = 0; i != 10; ++i)
  2705. {
  2706. Iter_Add(a, i + 6);
  2707. Iter_Add(b<3>, i * 2 + 1);
  2708. Iter_Add(b<0>, i * 2);
  2709. Iter_Add(c<1>, i * 2);
  2710. Iter_Add(c<4>, i * 3);
  2711. }
  2712. ASSERT(Iter_Count(a) == 10);
  2713. ASSERT(Iter_Count(b<0>) == 10);
  2714. ASSERT(Iter_Count(b<1>) == 0);
  2715. ASSERT(Iter_Count(b<2>) == 0);
  2716. ASSERT(Iter_Count(b<3>) == 10);
  2717. ASSERT(Iter_Count(b<4>) == 0);
  2718. ASSERT(Iter_Count(c<0>) == 0);
  2719. ASSERT(Iter_Count(c<1>) == 7);
  2720. ASSERT(Iter_Count(c<2>) == 0);
  2721. ASSERT(Iter_Count(c<3>) == 0);
  2722. ASSERT(Iter_Count(c<4>) == 9);
  2723. Iter_Clear(a);
  2724. ASSERT(Iter_Count(a) == 0);
  2725. Iter_Clear(b<0>);
  2726. ASSERT(Iter_Count(b<0>) == 0);
  2727. ASSERT(Iter_Count(b<1>) == 0);
  2728. ASSERT(Iter_Count(b<2>) == 0);
  2729. ASSERT(Iter_Count(b<3>) == 10);
  2730. ASSERT(Iter_Count(b<4>) == 0);
  2731. Iter_Clear(c<>);
  2732. Iter_Clear(c< >);
  2733. ASSERT(Iter_Count(c<0>) == 0);
  2734. ASSERT(Iter_Count(c<1>) == 0);
  2735. ASSERT(Iter_Count(c<2>) == 0);
  2736. ASSERT(Iter_Count(c<3>) == 0);
  2737. ASSERT(Iter_Count(c<4>) == 0);
  2738. }
  2739. Test:y_iter_ArrayMulti()
  2740. {
  2741. new Iterator : Test5 [ 10 ] < 50, 25 >;
  2742. new
  2743. count = 0;
  2744. Iter_Init(Test5);
  2745. // Check the array is empty.
  2746. foreach (new i : Test5[4]<3>)
  2747. {
  2748. ++count;
  2749. }
  2750. ASSERT(count == 0);
  2751. count = 0;
  2752. // Check they are all added in the right place.
  2753. Iter_Add(Test5[7]<40>, 0);
  2754. Iter_Add(Test5[7]<40>, 4);
  2755. Iter_Add(Test5[7]<40>, 8);
  2756. Iter_Add(Test5[7]<40>, 12);
  2757. Iter_Add(Test5[7]<40>, 16);
  2758. Iter_Add(Test5[7]<40>, 20);
  2759. Iter_Add(Test5[7]<40>, 24);
  2760. foreach (new i : Test5[4]<3>)
  2761. {
  2762. ++count;
  2763. }
  2764. ASSERT(count == 0);
  2765. count = 0;
  2766. foreach (new i : Test5[7]<40>)
  2767. {
  2768. ++count;
  2769. }
  2770. ASSERT(count == 7);
  2771. // Remove some.
  2772. Iter_Remove(Test5[7]<40>, 24);
  2773. Iter_Remove(Test5[7]<40>, 25);
  2774. count = 0;
  2775. foreach (new i : Test5[7]<40>)
  2776. {
  2777. ++count;
  2778. }
  2779. ASSERT(count == 6);
  2780. // Remove ones not in this iterator.
  2781. Iter_Remove(Test5[7]<40>, 4);
  2782. Iter_Remove(Test5[7]<40>, 5);
  2783. ASSERT(Iter_Count(Test5[7]<40>) == 5);
  2784. count = 0;
  2785. foreach (new i : Test5[7]<40>)
  2786. {
  2787. ++count;
  2788. }
  2789. ASSERT(count == 5);
  2790. // Create a interleaved iterator.
  2791. Iter_Add(Test5[7]<42>, 5);
  2792. count = 0;
  2793. ASSERT(Iter_Count(Test5[7]<40>) == 5);
  2794. ASSERT(Iter_Count(Test5[7]<42>) == 1);
  2795. foreach (new i : Test5[7]<42>)
  2796. {
  2797. ++count;
  2798. }
  2799. ASSERT(count == 1);
  2800. // Test that you can't remove something from the wrong interleaving.
  2801. Iter_Remove(Test5[7]<40>, 5);
  2802. count = 0;
  2803. ASSERT(Iter_Count(Test5[7]<40>) == 5);
  2804. ASSERT(Iter_Count(Test5[7]<42>) == 1);
  2805. foreach (new i : Test5[7]<42>)
  2806. {
  2807. ++count;
  2808. }
  2809. ASSERT(count == 1);
  2810. Iter_Remove(Test5[7]<42>, 5);
  2811. count = 0;
  2812. ASSERT(Iter_Count(Test5[7]<40>) == 5);
  2813. ASSERT(Iter_Count(Test5[7]<42>) == 0);
  2814. foreach (new i : Test5[7]<42>)
  2815. {
  2816. ++count;
  2817. }
  2818. ASSERT(count == 0);
  2819. }
  2820. #if _FOREACH_PLAYERS
  2821. Test:y_iter_Deprecate()
  2822. {
  2823. #pragma tabsize 4
  2824. /* ================================================================== */
  2825. /* | THERE IS MEANT TO BE A WARNING ON THIS LINE | */
  2826. /* | | */
  2827. /* | */ foreach (Player, i) /* | */
  2828. /* | | */
  2829. /* | It tests that the old syntax is nicely deprecated. | */
  2830. /* ================================================================== */
  2831. #pragma tabsize 4
  2832. {
  2833. }
  2834. }
  2835. #endif
  2836. Test:y_iter_Random()
  2837. {
  2838. new
  2839. c = 0;
  2840. foreach (new i : Random(10))
  2841. {
  2842. ++c;
  2843. }
  2844. ASSERT(c == 10);
  2845. foreach (new i : Random(1000, -5, 10))
  2846. {
  2847. ++c;
  2848. ASSERT(-5 <= i < 10);
  2849. }
  2850. ASSERT(c == 1010);
  2851. }
  2852. Test:y_iter_RandomNested()
  2853. {
  2854. new
  2855. c = 0;
  2856. foreach (new i : Random(10, 20))
  2857. {
  2858. ASSERT(0 <= i < 20);
  2859. foreach (new j : Random(10, -20, 20))
  2860. {
  2861. ASSERT(-20 <= j < 20);
  2862. ++c;
  2863. }
  2864. }
  2865. ASSERT(c == 100);
  2866. }
  2867. Test:y_iter_Powers()
  2868. {
  2869. new
  2870. c = 1;
  2871. foreach (new i : Powers(2))
  2872. {
  2873. ASSERT(i == c);
  2874. c *= 2;
  2875. }
  2876. ASSERT(c == 0x40000000 * 2);
  2877. }
  2878. Test:y_iter_Fib()
  2879. {
  2880. new
  2881. a = 0,
  2882. b = 1;
  2883. foreach (new i : Fib())
  2884. {
  2885. ASSERT(i == a);
  2886. b = a + b;
  2887. a = b - a;
  2888. }
  2889. }
  2890. Test:y_iter_Null()
  2891. {
  2892. new
  2893. c = 0,
  2894. arr[10] = {1, 2, 0, 3, 4, 0, 5, 0, 0, 7};
  2895. foreach (new i : Null(arr))
  2896. {
  2897. ++c;
  2898. ASSERT(i == 2 || i == 5 || i == 7 || i == 8);
  2899. }
  2900. ASSERT(c == 4);
  2901. }
  2902. Test:y_iter_Filter1()
  2903. {
  2904. new
  2905. c = 0,
  2906. arr[10] = {1, 2, 0, 3, 4, 0, 5, 0, 0, 7};
  2907. foreach (new i : Filter(0, arr))
  2908. {
  2909. ++c;
  2910. ASSERT(i == 2 || i == 5 || i == 7 || i == 8);
  2911. }
  2912. ASSERT(c == 4);
  2913. }
  2914. Test:y_iter_Filter2()
  2915. {
  2916. new
  2917. c = 0,
  2918. arr[10] = {1, 2, 0, 3, 2, 0, 5, 0, 2, 7};
  2919. foreach (new i : Filter(2, arr))
  2920. {
  2921. ++c;
  2922. ASSERT(i == 1 || i == 4 || i == 8);
  2923. }
  2924. ASSERT(c == 3);
  2925. }
  2926. Test:y_iter_NonNull()
  2927. {
  2928. new
  2929. c = 0,
  2930. arr[10] = {1, 2, 0, 3, 4, 0, 5, 0, 0, 7};
  2931. foreach (new i : NonNull(arr))
  2932. {
  2933. ++c;
  2934. ASSERT(i != 2 && i != 5 && i != 7 && i != 8);
  2935. }
  2936. ASSERT(c == 6);
  2937. }
  2938. Test:y_iter_Until()
  2939. {
  2940. new
  2941. c = 0,
  2942. arr[10] = {1, 2, 0, 3, 4, 0, 5, 0, 0, 7};
  2943. foreach (new i : Until(5, arr))
  2944. {
  2945. ++c;
  2946. ASSERT(0 <= i < 6);
  2947. }
  2948. ASSERT(c == 6);
  2949. }
  2950. Test:y_iter_All1()
  2951. {
  2952. new Iterator:a<10>;
  2953. Iter_Add(a, 3);
  2954. Iter_Add(a, 4);
  2955. Iter_Add(a, 7);
  2956. Iter_Add(a, 9);
  2957. new count = 0;
  2958. foreach (new i : All(a))
  2959. {
  2960. ASSERT(i == 3 || i == 4 || i == 7 || i == 9);
  2961. ++count;
  2962. }
  2963. ASSERT(count == 4);
  2964. }
  2965. Test:y_iter_None1()
  2966. {
  2967. new Iterator:a<10>;
  2968. Iter_Add(a, 3);
  2969. Iter_Add(a, 4);
  2970. Iter_Add(a, 7);
  2971. Iter_Add(a, 9);
  2972. new count = 0;
  2973. foreach (new i : None(a))
  2974. {
  2975. ASSERT(i != 3 && i != 4 && i != 7 && i != 9);
  2976. ++count;
  2977. }
  2978. ASSERT(count == 6);
  2979. }
  2980. Test:y_iter_All2()
  2981. {
  2982. new Iterator:a<3, 10>;
  2983. Iter_Add(a<0>, 3);
  2984. Iter_Add(a<2>, 4);
  2985. Iter_Add(a<2>, 7);
  2986. Iter_Add(a<1>, 9);
  2987. new count = 0;
  2988. foreach (new i : All(a<>))
  2989. {
  2990. ASSERT(i == 3 || i == 4 || i == 7 || i == 9);
  2991. ++count;
  2992. }
  2993. ASSERT(count == 4);
  2994. }
  2995. Test:y_iter_None2()
  2996. {
  2997. new Iterator:a<3, 10>;
  2998. Iter_Add(a<2>, 3);
  2999. Iter_Add(a<0>, 4);
  3000. Iter_Add(a<0>, 7);
  3001. Iter_Add(a<0>, 9);
  3002. new count = 0;
  3003. foreach (new i : None(a<>))
  3004. {
  3005. ASSERT(i != 3 && i != 4 && i != 7 && i != 9);
  3006. ++count;
  3007. }
  3008. ASSERT(count == 6);
  3009. }
  3010. Test:y_iter_Index1()
  3011. {
  3012. new Iterator:a<20>;
  3013. Iter_Add(a, 6);
  3014. Iter_Add(a, 8);
  3015. Iter_Add(a, 9);
  3016. Iter_Add(a, 14);
  3017. Iter_Add(a, 17);
  3018. Iter_Add(a, 19);
  3019. ASSERT(Iter_Index(a, -100) == cellmin);
  3020. ASSERT(Iter_Index(a, -100, true) == cellmin);
  3021. ASSERT(Iter_Index(a, -1) == cellmin);
  3022. ASSERT(Iter_Index(a, -1, true) == cellmin);
  3023. ASSERT(Iter_Index(a, 0) == 6);
  3024. ASSERT(Iter_Index(a, 0, true) == 6);
  3025. ASSERT(Iter_Index(a, 1) == 8);
  3026. ASSERT(Iter_Index(a, 1, true) == 8);
  3027. ASSERT(Iter_Index(a, 2) == 9);
  3028. ASSERT(Iter_Index(a, 2, true) == 9);
  3029. ASSERT(Iter_Index(a, 3) == 14);
  3030. ASSERT(Iter_Index(a, 3, true) == 14);
  3031. ASSERT(Iter_Index(a, 4) == 17);
  3032. ASSERT(Iter_Index(a, 4, true) == 17);
  3033. ASSERT(Iter_Index(a, 5) == 19);
  3034. ASSERT(Iter_Index(a, 5, true) == 19);
  3035. ASSERT(Iter_Index(a, 6) == cellmin);
  3036. ASSERT(Iter_Index(a, 6, true) == 6);
  3037. ASSERT(Iter_Index(a, 7) == cellmin);
  3038. ASSERT(Iter_Index(a, 7, true) == 8);
  3039. ASSERT(Iter_Index(a, 8) == cellmin);
  3040. ASSERT(Iter_Index(a, 8, true) == 9);
  3041. ASSERT(Iter_Index(a, 9) == cellmin);
  3042. ASSERT(Iter_Index(a, 9, true) == 14);
  3043. ASSERT(Iter_Index(a, 10) == cellmin);
  3044. ASSERT(Iter_Index(a, 10, true) == 17);
  3045. ASSERT(Iter_Index(a, 11) == cellmin);
  3046. ASSERT(Iter_Index(a, 11, true) == 19);
  3047. ASSERT(Iter_Index(a, 12) == cellmin);
  3048. ASSERT(Iter_Index(a, 12, true) == 6);
  3049. ASSERT(Iter_Index(a, 13) == cellmin);
  3050. ASSERT(Iter_Index(a, 13, true) == 8);
  3051. ASSERT(Iter_Index(a, 130) == cellmin);
  3052. ASSERT(Iter_Index(a, 130, true) == 17);
  3053. }
  3054. Test:y_iter_Index2()
  3055. {
  3056. new Iterator:a<5, 20>;
  3057. Iter_Add(a<3>, 0);
  3058. Iter_Add(a<3>, 1);
  3059. Iter_Add(a<3>, 2);
  3060. Iter_Add(a<3>, 14);
  3061. Iter_Add(a<4>, 10);
  3062. Iter_Add(a<4>, 11);
  3063. Iter_Add(a<4>, 15);
  3064. Iter_Add(a<4>, 18);
  3065. ASSERT(Iter_Index(a<0>, -1) == cellmin);
  3066. ASSERT(Iter_Index(a<0>, -1, true) == cellmin);
  3067. ASSERT(Iter_Index(a<0>, 0) == cellmin);
  3068. ASSERT(Iter_Index(a<0>, 10) == cellmin);
  3069. ASSERT(Iter_Index(a<0>, 0, true) == cellmin);
  3070. ASSERT(Iter_Index(a<0>, 10, true) == cellmin);
  3071. ASSERT(Iter_Index(a<1>, 0) == cellmin);
  3072. ASSERT(Iter_Index(a<1>, 10) == cellmin);
  3073. ASSERT(Iter_Index(a<1>, 0, true) == cellmin);
  3074. ASSERT(Iter_Index(a<1>, 10, true) == cellmin);
  3075. ASSERT(Iter_Index(a<2>, 0) == cellmin);
  3076. ASSERT(Iter_Index(a<2>, 10) == cellmin);
  3077. ASSERT(Iter_Index(a<2>, 0, true) == cellmin);
  3078. ASSERT(Iter_Index(a<2>, 10, true) == cellmin);
  3079. ASSERT(Iter_Index(a<3>, 0) == 0);
  3080. ASSERT(Iter_Index(a<3>, 1) == 1);
  3081. ASSERT(Iter_Index(a<3>, 2) == 2);
  3082. ASSERT(Iter_Index(a<3>, 3) == 14);
  3083. ASSERT(Iter_Index(a<3>, 4) == cellmin);
  3084. ASSERT(Iter_Index(a<3>, 4, true) == 0);
  3085. ASSERT(Iter_Index(a<3>, 5) == cellmin);
  3086. ASSERT(Iter_Index(a<3>, 5, true) == 1);
  3087. ASSERT(Iter_Index(a<3>, 403) == cellmin);
  3088. ASSERT(Iter_Index(a<3>, 403, true) == 14);
  3089. ASSERT(Iter_Index(a<4>, -1) == cellmin);
  3090. ASSERT(Iter_Index(a<4>, -1, true) == cellmin);
  3091. ASSERT(Iter_Index(a<4>, 0) == 10);
  3092. ASSERT(Iter_Index(a<4>, 0, true) == 10);
  3093. ASSERT(Iter_Index(a<4>, 10) == cellmin);
  3094. ASSERT(Iter_Index(a<4>, 10, true) == 15);
  3095. }
  3096. iterfunc y_iterDecl1[cellmin](cur) { return cur == cellmin ? 5 : cellmin; }
  3097. stock iterfunc y_iterDecl2(cur) { return cur == cellmin ? 5 : cellmin; }
  3098. #define iterstart@y_iterDecl2 (cellmin)
  3099. static stock iterfunc y_iterDecl3(cur) { return cur == -1 ? 5 : -1; }
  3100. static iterfunc stock y_iterDecl4(cur) { return cur == 0 ? 5 : 0; }
  3101. #define Iterator@y_iterDecl4 iterstart(0)
  3102. iterfunc static y_iterDecl5[0](cur) { return cur == 0 ? 5 : 0; }
  3103. iterfunc stock static y_iterDecl6(&iterstate, cur) { return cur == -1 ? iterstate : -1; }
  3104. #define iterstart@y_iterDecl6 iterstate(-1, 5)
  3105. /* ========================================================================== */
  3106. /* | THERE IS MEANT TO BE A WARNING ON THIS LINE | */
  3107. /* | | */
  3108. /* | */ iterfunc y_iterDecl1X[cellmin](cur) /* | */
  3109. /* | */ { /* | */
  3110. /* | */ return cur == cellmin ? 5 : cellmin; /* | */
  3111. /* | */ } /* | */
  3112. /* | | */
  3113. /* | It tests the lack of "stock" with "iterfunc". | */
  3114. /* ========================================================================== */
  3115. /* ========================================================================== */
  3116. /* | THERE IS NOT MEANT TO BE A WARNING ON THIS LINE... | */
  3117. /* | === | */
  3118. /* | */ stock iterfunc y_iterDecl2X(cur) /* | */
  3119. /* | */ { /* | */
  3120. /* | */ return cur == cellmin ? 5 : cellmin; /* | */
  3121. /* | */ } /* | */
  3122. /* | | */
  3123. /* | It tests that "stock iterfunc" works. TODO: Fix it. | */
  3124. /* ========================================================================== */
  3125. #define iterstart@y_iterDecl2X (cellmin)
  3126. /* ========================================================================== */
  3127. /* | THERE IS NOT MEANT TO BE A WARNING ON THIS LINE... | */
  3128. /* | === | */
  3129. /* | */ static stock iterfunc y_iterDecl3X(cur) /* | */
  3130. /* | */ { /* | */
  3131. /* | */ return cur == -1 ? 5 : -1; /* | */
  3132. /* | */ } /* | */
  3133. /* | | */
  3134. /* | It tests that "static stock iterfunc" works. TODO: Fix it. | */
  3135. /* ========================================================================== */
  3136. static iterfunc stock y_iterDecl4X(cur) { return cur == 0 ? 5 : 0; }
  3137. #define Iterator@y_iterDecl4X iterstart(0)
  3138. /* ========================================================================== */
  3139. /* | THERE IS MEANT TO BE A WARNING ON THIS LINE | */
  3140. /* | | */
  3141. /* | */ static iterfunc y_iterDecl5X[0](cur) /* | */
  3142. /* | */ { /* | */
  3143. /* | */ return cur == 0 ? 5 : 0; /* | */
  3144. /* | */ } /* | */
  3145. /* | | */
  3146. /* | It tests the lack of "stock" with "static iterfunc". | */
  3147. /* ========================================================================== */
  3148. iterfunc stock static y_iterDecl6X(&iterstate, cur) { return cur == -1 ? iterstate : -1; }
  3149. #define iterstart@y_iterDecl6X iterstate(-1, 5)
  3150. Test:y_iter_MacroLess()
  3151. {
  3152. new i;
  3153. foreach (i : y_iterDecl1()) { ASSERT(i == 5); }
  3154. ASSERT(i == cellmin);
  3155. foreach (i : y_iterDecl5()) { ASSERT(i == 5); }
  3156. ASSERT(i == 0);
  3157. foreach (i : y_iterDecl3()) { ASSERT(i == 5); }
  3158. ASSERT(i == -1);
  3159. foreach (i : y_iterDecl2()) { ASSERT(i == 5); }
  3160. ASSERT(i == cellmin);
  3161. foreach (i : y_iterDecl4()) { ASSERT(i == 5); }
  3162. ASSERT(i == 0);
  3163. foreach (new j : y_iterDecl6()) { ASSERT(j == 5); }
  3164. ASSERT(i == 0);
  3165. }
  3166. iterfunc stock y_iter_yield0()
  3167. {
  3168. }
  3169. #define Iterator@y_iter_yield0 iteryield
  3170. Test:y_iter_yield0a()
  3171. {
  3172. new
  3173. count;
  3174. count = 0;
  3175. foreach (new i : y_iter_yield0())
  3176. {
  3177. #pragma unused i
  3178. ++count;
  3179. }
  3180. ASSERT(count == 0);
  3181. count = 0;
  3182. foreach (new i : y_iter_yield0)
  3183. {
  3184. #pragma unused i
  3185. ++count;
  3186. }
  3187. ASSERT(count == 0);
  3188. count = 0;
  3189. foreach (new i : y_iter_yield0[])
  3190. {
  3191. #pragma unused i
  3192. ++count;
  3193. }
  3194. ASSERT(count == 0);
  3195. }
  3196. iterfunc stock y_iter_yield1()
  3197. {
  3198. for (new i = 0; i != 10; ++i)
  3199. {
  3200. yield return i;
  3201. }
  3202. }
  3203. #define Iterator@y_iter_yield1 iteryield
  3204. Test:y_iter_yield1a()
  3205. {
  3206. new
  3207. count;
  3208. count = 0;
  3209. foreach (new i : y_iter_yield1())
  3210. {
  3211. #pragma unused i
  3212. ++count;
  3213. }
  3214. ASSERT(count == 10);
  3215. count = 0;
  3216. foreach (new i : y_iter_yield1)
  3217. {
  3218. #pragma unused i
  3219. ++count;
  3220. }
  3221. ASSERT(count == 10);
  3222. count = 0;
  3223. foreach (new i : y_iter_yield1[])
  3224. {
  3225. #pragma unused i
  3226. ++count;
  3227. }
  3228. ASSERT(count == 10);
  3229. }
  3230. iterfunc stock y_iter_yield2(step, target = 100)
  3231. {
  3232. new
  3233. total = 0;
  3234. while (total < target)
  3235. {
  3236. yield return total;
  3237. total += step;
  3238. }
  3239. }
  3240. #define Iterator@y_iter_yield2 iteryield
  3241. Test:y_iter_yield2a()
  3242. {
  3243. new
  3244. count;
  3245. count = 0;
  3246. foreach (new i : y_iter_yield2(10))
  3247. {
  3248. ASSERT(i % 10 == 0);
  3249. ++count;
  3250. }
  3251. ASSERT(count == 10);
  3252. count = 0;
  3253. foreach (new i : y_iter_yield2(10, 20))
  3254. {
  3255. ASSERT(i == 0 || i == 10);
  3256. ++count;
  3257. }
  3258. ASSERT(count == 2);
  3259. count = 0;
  3260. foreach (new i : y_iter_yield2[5])
  3261. {
  3262. ASSERT(i % 5 == 0);
  3263. ++count;
  3264. }
  3265. ASSERT(count == 20);
  3266. }
  3267. iterfunc stock y_iter_yield3(step, target = 100)
  3268. {
  3269. new
  3270. total = 0;
  3271. for ( ; ; )
  3272. {
  3273. if (total >= target)
  3274. yield break;
  3275. yield return total;
  3276. total += step;
  3277. }
  3278. }
  3279. #define Iterator@y_iter_yield3 iteryield
  3280. Test:y_iter_yield3a()
  3281. {
  3282. new
  3283. count;
  3284. count = 0;
  3285. foreach (new i : y_iter_yield3(10))
  3286. {
  3287. ASSERT(i % 10 == 0);
  3288. ++count;
  3289. }
  3290. ASSERT(count == 10);
  3291. count = 0;
  3292. foreach (new i : y_iter_yield3(10, 20))
  3293. {
  3294. ASSERT(i == 0 || i == 10);
  3295. ++count;
  3296. }
  3297. ASSERT(count == 2);
  3298. count = 0;
  3299. foreach (new i : y_iter_yield3[5])
  3300. {
  3301. ASSERT(i % 5 == 0);
  3302. ++count;
  3303. }
  3304. ASSERT(count == 20);
  3305. }
  3306. iterfunc stock y_iter_yield4(arr[], size = sizeof (arr))
  3307. {
  3308. for (new i = 0; i != size; ++i)
  3309. {
  3310. yield return arr[i];
  3311. }
  3312. }
  3313. #define Iterator@y_iter_yield4 iteryield
  3314. Test:y_iter_yield4a()
  3315. {
  3316. new
  3317. count = 0,
  3318. arr[] = { 2, 3, 6, 7, 110, 5432 };
  3319. foreach (new i : y_iter_yield4(arr))
  3320. {
  3321. ASSERT(i == 2 || i == 3 || i == 6 || i == 7 || i == 110 || i == 5432);
  3322. ++count;
  3323. }
  3324. }
  3325. #if defined YSI_SLOW_TESTS
  3326. iterfunc stock y_iter_yield5()
  3327. {
  3328. new
  3329. k = 0;
  3330. for (new i = 0; i != 65536; ++i)
  3331. {
  3332. if (i % 655 == 0)
  3333. printf("%d%%...", i / 655);
  3334. for (new j = 0; j != 65536; ++j)
  3335. {
  3336. yield return k;
  3337. ++k;
  3338. }
  3339. }
  3340. }
  3341. #define Iterator@y_iter_yield5 iteryield
  3342. Test:y_iter_yield5a()
  3343. {
  3344. new
  3345. k = 0;
  3346. for (new i = 0; i != 65536; ++i)
  3347. {
  3348. if (i % 655 == 0)
  3349. printf("%d%%...", i / 655);
  3350. for (new j = 0; j != 65536; ++j)
  3351. {
  3352. ++k;
  3353. }
  3354. }
  3355. ASSERT(k == 0); // Overflow.
  3356. new
  3357. count = 0,
  3358. bool:ever = false;
  3359. foreach (new i : y_iter_yield5)
  3360. {
  3361. #pragma unused i
  3362. ++count;
  3363. ever = true;
  3364. }
  3365. ASSERT(count == 0); // Overflow.
  3366. ASSERT(ever);
  3367. }
  3368. #endif
  3369. iterfunc stock y_iter_yield6()
  3370. {
  3371. for (new i = 0; i != 3; ++i)
  3372. {
  3373. yield return i;
  3374. }
  3375. yield return 10;
  3376. yield return 20;
  3377. for (new i = 501; i != 505; ++i)
  3378. {
  3379. yield return i;
  3380. }
  3381. }
  3382. #define Iterator@y_iter_yield6 iteryield
  3383. Test:y_iter_yield6a()
  3384. {
  3385. new
  3386. answers[] = { 0, 1, 2, 10, 20, 501, 502, 503, 504 },
  3387. idx = 0;
  3388. foreach (new i : y_iter_yield6)
  3389. {
  3390. ASSERT(idx < sizeof (answers) && i == answers[idx]);
  3391. ++idx;
  3392. }
  3393. ASSERT(idx == sizeof(answers));
  3394. }
  3395. iterfunc stock y_iter_yield7c(n)
  3396. {
  3397. while (n--)
  3398. {
  3399. yield return 10;
  3400. }
  3401. }
  3402. #define Iterator@y_iter_yield7c iteryield
  3403. iterfunc stock y_iter_yield7b()
  3404. {
  3405. foreach (new i : y_iter_yield7c(4))
  3406. {
  3407. yield return i;
  3408. }
  3409. yield return 20;
  3410. }
  3411. #define Iterator@y_iter_yield7b iteryield
  3412. iterfunc stock y_iter_yield7a(x)
  3413. {
  3414. foreach (new i : y_iter_yield7b)
  3415. {
  3416. yield return i + 5;
  3417. yield return i + 6;
  3418. yield return i + 7;
  3419. yield return i + 9;
  3420. yield return i + 4;
  3421. yield return i + 3;
  3422. }
  3423. yield return x;
  3424. }
  3425. #define Iterator@y_iter_yield7a iteryield
  3426. Test:y_iter_yield7a()
  3427. {
  3428. new
  3429. answers[] = {
  3430. 15, 16, 17, 19, 14, 13,
  3431. 15, 16, 17, 19, 14, 13,
  3432. 15, 16, 17, 19, 14, 13,
  3433. 15, 16, 17, 19, 14, 13,
  3434. 25, 26, 27, 29, 24, 23,
  3435. 2
  3436. },
  3437. idx = 0;
  3438. foreach (new i : y_iter_yield7a[2])
  3439. {
  3440. ASSERT(idx < sizeof (answers) && i == answers[idx]);
  3441. ++idx;
  3442. }
  3443. ASSERT(idx == sizeof(answers));
  3444. }
  3445. static Iterator:y_iter_huge<100000>;
  3446. TEST__ y_iter_huge()
  3447. {
  3448. for (new i = 0; i < 50000; i++)
  3449. {
  3450. Iter_Add(y_iter_huge, i);
  3451. }
  3452. ASSERT_EQ(Iter_Count(y_iter_huge), 50000);
  3453. }