{"commit":"196d2fd6bc962d2ae9d5201a254322dce1c32a1c","old_file":"test\/records\/ferguson\/whole-array-assign.chpl","new_file":"test\/records\/ferguson\/whole-array-assign.chpl","old_contents":"use myrecord;\n\nproc myfunction() {\n\n  var A:[1..10] R;\n\n  for i in 1..10 {\n    A[i].verify();\n    A[i].init(x=i);\n    A[i].verify();\n    assert(A[i].x == i);\n  }\n}\n\nmyfunction();\n\n","new_contents":"use myrecord;\n\nproc myfunction() {\n\n  var A:[1..10] R;\n\n  for i in 1..10 {\n    A[i].verify();\n    A[i].init(x=i);\n    A[i].verify();\n    assert(A[i].x == i);\n  }\n\n  var B:[1..10] R;\n\n  B = A;\n\n  for i in 1..10 {\n    B[i].verify();\n    assert(B[i].x == i);\n  }\n\n}\n\nmyfunction();\n\n","subject":"Fix whole array assign test","message":"Fix whole array assign test\n","lang":"Chapel","license":"apache-2.0","repos":"hildeth\/chapel,hildeth\/chapel,hildeth\/chapel,hildeth\/chapel,hildeth\/chapel,hildeth\/chapel,hildeth\/chapel"}
{"commit":"9f5280521cb3d5937b18d1a40ea6ba0a80fcd1c2","old_file":"test\/chpldoc\/classes\/methodOutsideClassDef.chpl","new_file":"test\/chpldoc\/classes\/methodOutsideClassDef.chpl","old_contents":"\/* This class will declare a method inside itself, but will have a\n   method declared outside it as well *\/\nclass Foo {\n  proc internalMeth() {\n\n  }\n}\n\n\/\/ We expect these two methods to be printed outside of the class indentation\n\/\/ level\nproc Foo.externalMeth1() {\n\n}\n\n\/* This method has a comment attached to it *\/\nproc Foo.externalMeth2() {\n\n}\n","new_contents":"\/* This class will declare a method inside itself, but will have a\n   method declared outside it as well *\/\nclass Foo {\n  proc internalMeth() {\n\n  }\n}\n\n\/\/ We expect these two methods to be printed outside of the class indentation\n\/\/ level\nproc Foo.externalMeth1() {\n\n}\n\n\/* This method has a comment attached to it *\/\nproc Foo.externalMeth2() {\n\n}\n\n\/* Declares one primary and one secondary method... *\/\nrecord Bar {\n  \/* A primary method declaration. *\/\n  proc internal() {}\n}\n\n\/* A secondary method declaration. *\/\nproc Bar.external() {}\n","subject":"Add record with secondary method to chpldoc\/ tests.","message":"Add record with secondary method to chpldoc\/ tests.\n","lang":"Chapel","license":"apache-2.0","repos":"hildeth\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,hildeth\/chapel,chizarlicious\/chapel,hildeth\/chapel,hildeth\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,hildeth\/chapel,hildeth\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,hildeth\/chapel"}
{"commit":"28a21f3d8c9e63e001750cc0dd6db79e7a9b49d6","old_file":"test\/parallel\/cobegin\/diten\/cobeginRace.chpl","new_file":"test\/parallel\/cobegin\/diten\/cobeginRace.chpl","old_contents":"def foo() { }\n\ndef bar() { }\n\nvar done: single bool;\n\ndef timeout(n: uint) {\n  use Time;\n  begin { sleep(n); exit(1); }\n  begin { done; exit(0); }\n}\n\ntimeout(30); \/\/ exit after 30 seconds or when done is set.\n\nfor i in 1..100000 {\n  cobegin {\n    cobegin { bar(); foo(); }\n    cobegin { bar(); foo(); }\n    cobegin { bar(); foo(); }\n    cobegin { bar(); foo(); }\n  }\n  if i % 10000 == 0 then\n    writeln(\"iteration \", i, \" done.\");\n}\n\ndone = true;\n","new_contents":"def foo() { }\n\ndef bar() { }\n\nvar done: single bool;\n\ndef timeout(n: uint) {\n  use Time;\n  begin { sleep(n); writeln(\"Timeout\"); exit(1); }\n  begin { done; exit(0); }\n}\n\ntimeout(30); \/\/ exit after 30 seconds or when done is set.\n\nfor i in 1..100000 {\n  cobegin {\n    cobegin { bar(); foo(); }\n    cobegin { bar(); foo(); }\n    cobegin { bar(); foo(); }\n    cobegin { bar(); foo(); }\n  }\n  if i % 10000 == 0 then\n    writeln(\"iteration \", i, \" done.\");\n}\n\ndone = true;\n","subject":"Set up svn:ignore on a directory","message":"Set up svn:ignore on a directory\n\nSet the svn:ignore property on this directory like it is on many other test\ndirectories.\n\n\n\ngit-svn-id: 88467cb1fb04b8a755be7e1ee1026be4190196ef@13934 3a8e244f-b0f2-452b-bcba-4c88e055c3ca\n","lang":"Chapel","license":"apache-2.0","repos":"hildeth\/chapel,hildeth\/chapel,sungeunchoi\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,sungeunchoi\/chapel,CoryMcCartan\/chapel,sungeunchoi\/chapel,chizarlicious\/chapel,hildeth\/chapel,hildeth\/chapel,chizarlicious\/chapel,sungeunchoi\/chapel,sungeunchoi\/chapel,sungeunchoi\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,chizarlicious\/chapel,hildeth\/chapel,sungeunchoi\/chapel,hildeth\/chapel,hildeth\/chapel,sungeunchoi\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel"}
{"commit":"97cc052ebe26b9fe9b9cb714652deafaa0ffa196","old_file":"005.chpl","new_file":"005.chpl","old_contents":"\/*\n * Smallest multiple\n *\/\n\nconfig const rangeMax = 20;\n\nconst values: [{1..rangeMax}] int;\nforall i in 1..rangeMax {\n  values[i] = i;\n}\n\nproc isMultiple(value: int, numbers: [] int) {\n  for num in numbers {\n    if value % num != 0 {\n      return false;\n    }\n  }\n  return true;\n}\n\n\/\/ Return least common multiple for list of ints.\nproc lcm(numbers: [] int) {\n  var maxNum = max reduce numbers,\n    value = maxNum;\n\n  while (!isMultiple(value, numbers)) {\n    value += maxNum;\n  }\n\n  return value;\n}\n\nwriteln(lcm(values));\n","new_contents":"\/*\n * Smallest multiple\n *\/\n\nconfig const rangeMax = 20;\n\nconst values: [{1..rangeMax}] int = [i in 1..rangeMax] i;\n\nproc isMultiple(value: int, numbers: [] int) {\n  for num in numbers {\n    if value % num != 0 {\n      return false;\n    }\n  }\n  return true;\n}\n\n\/\/ Return least common multiple for list of ints.\nproc lcm(numbers: [] int) {\n  var maxNum = max reduce numbers,\n    value = maxNum;\n\n  while (!isMultiple(value, numbers)) {\n    value += maxNum;\n  }\n\n  return value;\n}\n\nwriteln(lcm(values));\n","subject":"Update solution 5 to work with new-and-improved constness checking.","message":"Update solution 5 to work with new-and-improved constness checking.\n\nPreviously it was taking advantage of the lack of constness checking on arrays.\n","lang":"Chapel","license":"bsd-3-clause","repos":"thomasvandoren\/project-euler"}
{"commit":"d3a77d0924a090a02996a0e44cf11ae630cfa812","old_file":"test\/types\/string\/sungeun\/stringInOn.chpl","new_file":"test\/types\/string\/sungeun\/stringInOn.chpl","old_contents":"config const n = 11;\nvar s0 = \"kiss kiss\";\n\nvar l0: atomic int;\nvar l1: atomic int;\n\nwriteln(s0);\nbegin ref(s0) {\n  l0.waitFor(1);\n  s0 = \"bang bang\";\n  l1.write(1);\n}\n\non Locales[numLocales-1] {\n  l0.write(1);\n  l1.waitFor(1);\n  writeln(s0);\n}\n\n","new_contents":"config const n = 11;\nvar s0 = \"kiss kiss\";\n\nvar l0: atomic int;\nvar l1: atomic int;\n\nwriteln(s0);\nbegin with (ref s0) {\n  l0.waitFor(1);\n  s0 = \"bang bang\";\n  l1.write(1);\n}\n\non Locales[numLocales-1] {\n  l0.write(1);\n  l1.waitFor(1);\n  writeln(s0);\n}\n\n","subject":"Update one last test to the new task intent syntax","message":"Update one last test to the new task intent syntax\n","lang":"Chapel","license":"apache-2.0","repos":"hildeth\/chapel,chizarlicious\/chapel,hildeth\/chapel,chizarlicious\/chapel,hildeth\/chapel,hildeth\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,hildeth\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,hildeth\/chapel,hildeth\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,chizarlicious\/chapel"}
{"commit":"3693b3a0cd10895c4363f876e03719b3c07c002a","old_file":"012.chpl","new_file":"012.chpl","old_contents":"\/*\n * Highly divisible triangular number\n *\/\n\nconfig const minDivisors = 500,\n  printNumbers = false;\n\nproc main() {\n  for t in triangleNumbers() {\n\n    if printNumbers then\n      writef(\"%di: \", t);\n\n    var count = 0;\n    for f in factors(t) {\n      count += 1;\n\n      if printNumbers then\n        writef(\"%di, \", f);\n    }\n    if printNumbers then\n      writeln();\n\n    if count > minDivisors {\n      writeln(t);\n      break;\n    }\n  }\n}\n\n\/\/ Yield all the factors of n.\niter factors(n) {\n  \/\/ Yield 1 and n first, then all intermediate factors.\n  yield 1;\n  yield n;\n\n  var i = 2;\n  while (i < sqrt(n)) {\n    if n % i == 0 {\n      yield i;\n      yield n \/ i;\n    }\n    i += 1;\n  }\n\n  if i ** 2 == n {\n    yield i;\n  }\n}\n\n\/\/ Yield triangle numbers infinitely. Up to caller to break iteration.\niter triangleNumbers() {\n  var num = 1,\n    triangleNum = num;\n  for i in 1..max(int) {\n    yield triangleNum;\n    num += 1;\n    triangleNum += num;\n  }\n}\n","new_contents":"\/*\n * Highly divisible triangular number\n *\/\n\nconfig const minDivisors = 500,\n  printNumbers = false;\n\nproc main() {\n  for t in triangleNumbers() {\n\n    if printNumbers then\n      writef(\"%n: \", t);\n\n    var count = 0;\n    for f in factors(t) {\n      count += 1;\n\n      if printNumbers then\n        writef(\"%n, \", f);\n    }\n    if printNumbers then\n      writeln();\n\n    if count > minDivisors {\n      writeln(t);\n      break;\n    }\n  }\n}\n\n\/\/ Yield all the factors of n.\niter factors(n) {\n  \/\/ Yield 1 and n first, then all intermediate factors.\n  yield 1;\n  yield n;\n\n  var i = 2;\n  while (i < sqrt(n)) {\n    if n % i == 0 {\n      yield i;\n      yield n \/ i;\n    }\n    i += 1;\n  }\n\n  if i ** 2 == n {\n    yield i;\n  }\n}\n\n\/\/ Yield triangle numbers for all integer values. Up to caller to break\n\/\/ iteration.\niter triangleNumbers() {\n  var triangleNum = 1;\n  for num in 2..max(int)-1 {\n    yield triangleNum;\n    triangleNum += num;\n  }\n}\n","subject":"Update solution 12 to avoid overflow.","message":"Update solution 12 to avoid overflow.\n\nPreviously, it had a loop that went up to max(int). This overflows on the very\nfinal check, since the index will be max(int) and then it will add 1 to it. To\navoid the overflow, iterate to max(int)-1.\n","lang":"Chapel","license":"bsd-3-clause","repos":"thomasvandoren\/project-euler"}
{"commit":"52aadeafaf99d065b92e6fd48f018333590285e8","old_file":"test\/extern\/bradc\/extern_string_test-remote.chpl","new_file":"test\/extern\/bradc\/extern_string_test-remote.chpl","old_contents":"extern proc return_string_test():string;\nextern proc return_string_arg_test(ref string);\n\nwriteln(\"returned string \",return_string_test()); stdout.flush();\nvar s:string;\non Locales(1) do\n  return_string_arg_test(s);\nwriteln(\"returned string arg \",s);\n\n","new_contents":"extern proc return_string_test():c_string;\nextern proc return_string_arg_test(ref c_string);\n\nwriteln(\"returned string \",return_string_test()); stdout.flush();\nvar s:string;\non Locales(1) do\n  return_string_arg_test(s);\nwriteln(\"returned string arg \",s);\n\n","subject":"Change extern prototypes to specify c_string instead of string","message":"Change extern prototypes to specify c_string instead of string\n\n[ok'ed by Brad]\n\n\n\ngit-svn-id: 88467cb1fb04b8a755be7e1ee1026be4190196ef@23791 3a8e244f-b0f2-452b-bcba-4c88e055c3ca\n","lang":"Chapel","license":"apache-2.0","repos":"hildeth\/chapel,hildeth\/chapel,chizarlicious\/chapel,chizarlicious\/chapel,sungeunchoi\/chapel,hildeth\/chapel,hildeth\/chapel,chizarlicious\/chapel,sungeunchoi\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,sungeunchoi\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,hildeth\/chapel,hildeth\/chapel,chizarlicious\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,sungeunchoi\/chapel,sungeunchoi\/chapel,sungeunchoi\/chapel,hildeth\/chapel,sungeunchoi\/chapel,sungeunchoi\/chapel,CoryMcCartan\/chapel"}
{"commit":"ac4633d4289fa64ae372153564d165fa96598673","old_file":"module\/templates\/chapel\/convert.pych.1d.chpl","new_file":"module\/templates\/chapel\/convert.pych.1d.chpl","old_contents":"var %(aname)s__defaultRect = pych_to_chpl1D(%(aname)s_pych);\nvar %(aname)s => _getArray(%(aname)s__defaultRect);\n","new_contents":"var %(aname)s__defaultRect = pych_to_chpl1D(%(aname)s_pych);\nref %(aname)s = _getArray(%(aname)s__defaultRect);\n","subject":"Use a ref instead of an alias operation","message":"Use a ref instead of an alias operation\n\nAliases are now deprecated.  The preferred strategy is to use a ref variable.\n","lang":"Chapel","license":"apache-2.0","repos":"russel\/pychapel,chapel-lang\/pychapel,russel\/pychapel,chapel-lang\/pychapel,russel\/pychapel,chapel-lang\/pychapel"}
{"commit":"989c8db32205514dd735277b7daab46318c466fb","old_file":"test\/functions\/deitz\/iterators\/leader_follower\/test_strided_leader1.chpl","new_file":"test\/functions\/deitz\/iterators\/leader_follower\/test_strided_leader1.chpl","old_contents":"iter foo(n: int) {\n  for i in 1..n do\n    yield i;\n}\n\niter foo(param tag: iterKind, n: int) where tag == iterKind.leader {\n  cobegin {\n    on Locales(0) do yield tuple(0..n-1 by 2);\n    on Locales(1) do yield tuple(1..n-1 by 2);\n  }\n}\n\niter foo(param tag: iterKind, followThis, n: int) where tag == iterKind.follower {\n  for i in followThis(1)+1 do\n    yield i;\n}\n\nconfig var n: int = 8;\n\nvar A: [1..n] int;\n\nforall i in foo(n) do\n  A(i) = here.id * 100 + i;\n\nwriteln(A);\n\nuse Random;\n\n{\n  var B: [1..n] real;\n\n  var rs = new RandomStream(seed=315);\n\n  forall (i, r) in ({1..n}, rs.iterate({1..n})) do\n    B(i) = r;\n\n  writeln(B);\n}\n\n{\n  var B: [1..n] real;\n\n  var rs = new RandomStream(seed=315);\n\n  forall (f, r) in (foo(n), rs.iterate({1..n})) do\n    B(f) = r;\n\n  writeln(B);\n}\n","new_contents":"iter foo(n: int) {\n  for i in 1..n do\n    yield i;\n}\n\niter foo(param tag: iterKind, n: int) where tag == iterKind.leader {\n  cobegin {\n    on Locales(0) do yield tuple(0..n-1 by 2);\n    on Locales(1) do yield tuple(1..n-1 by 2);\n  }\n}\n\niter foo(param tag: iterKind, followThis, n: int) where tag == iterKind.follower {\n  for i in followThis(1)+1 do\n    yield i;\n}\n\nconfig var n: int = 8;\n\nvar A: [1..n] int;\n\nforall i in foo(n) do\n  A(i) = here.id * 100 + i;\n\nwriteln(A);\n\nuse Random;\n\n{\n  var B: [1..n] real;\n\n  var rs = new RandomStream(seed=315);\n\n  forall (i, r) in zip({1..n}, rs.iterate({1..n})) do\n    B(i) = r;\n\n  writeln(B);\n}\n\n{\n  var B: [1..n] real;\n\n  var rs = new RandomStream(seed=315);\n\n  forall (f, r) in zip(foo(n), rs.iterate({1..n})) do\n    B(f) = r;\n\n  writeln(B);\n}\n","subject":"Update to new zip() syntax.","message":"Update to new zip() syntax.\n\nThis one slipped through the cracks, probably because it is only\ntested for gasnet.\n\n\n\ngit-svn-id: 88467cb1fb04b8a755be7e1ee1026be4190196ef@20700 3a8e244f-b0f2-452b-bcba-4c88e055c3ca\n","lang":"Chapel","license":"apache-2.0","repos":"hildeth\/chapel,CoryMcCartan\/chapel,hildeth\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,sungeunchoi\/chapel,hildeth\/chapel,chizarlicious\/chapel,chizarlicious\/chapel,sungeunchoi\/chapel,hildeth\/chapel,CoryMcCartan\/chapel,sungeunchoi\/chapel,chizarlicious\/chapel,sungeunchoi\/chapel,CoryMcCartan\/chapel,hildeth\/chapel,chizarlicious\/chapel,hildeth\/chapel,sungeunchoi\/chapel,CoryMcCartan\/chapel,sungeunchoi\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,sungeunchoi\/chapel,hildeth\/chapel,CoryMcCartan\/chapel,sungeunchoi\/chapel,chizarlicious\/chapel"}
{"commit":"f407a750fbf8e24f374b1267c28eebeb6307c169","old_file":"test\/exits\/bradc\/child_remains_after_parent.chpl","new_file":"test\/exits\/bradc\/child_remains_after_parent.chpl","old_contents":"use Time;\n\nconfig const numIters = 100000;\n\nproc main() {\n   begin doSomeWork();\n   \/\/ while original task exits\n   writeln(\"Original task falling out of main\");\n}\n\nproc doSomeWork() {\n   for i in 1..numIters {\n     write(\"\");\n     stdout.flush();\n   }\n   writeln(\"done working\");\n}\n","new_contents":"use Time;\n\nconfig const numIters = 100000;\nvar s$: sync bool;\n\nproc main() {\n   begin doSomeWork();\n   \/\/ while original task exits\n   writeln(\"Original task falling out of main\");\n   s$ = true;\n}\n\nproc doSomeWork() {\n   s$;\n   for i in 1..numIters {\n     write(\"\");\n     stdout.flush();\n   }\n   writeln(\"done working\");\n}\n","subject":"Fix race condition that was causing valgrind testing non-determinism","message":"Fix race condition that was causing valgrind testing non-determinism\n\nAdd synchronization to make sure output is printed in the right order\nwhile preserving the intent of the test (main thread continues on\nafter a begin).\n\n\n\ngit-svn-id: 88467cb1fb04b8a755be7e1ee1026be4190196ef@20383 3a8e244f-b0f2-452b-bcba-4c88e055c3ca\n","lang":"Chapel","license":"apache-2.0","repos":"sungeunchoi\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,sungeunchoi\/chapel,hildeth\/chapel,sungeunchoi\/chapel,hildeth\/chapel,chizarlicious\/chapel,chizarlicious\/chapel,chizarlicious\/chapel,sungeunchoi\/chapel,hildeth\/chapel,sungeunchoi\/chapel,sungeunchoi\/chapel,sungeunchoi\/chapel,hildeth\/chapel,CoryMcCartan\/chapel,sungeunchoi\/chapel,hildeth\/chapel,chizarlicious\/chapel,hildeth\/chapel,hildeth\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel"}
{"commit":"9327914e24bccdafc6c72d2dd58731c5f4a82eb9","old_file":"test\/studies\/filerator\/testboth.chpl","new_file":"test\/studies\/filerator\/testboth.chpl","old_contents":"use Filerator;\n\nfor dir in walkdirs(\"subdir\") {\n  writeln(\"dir \", dir, \" contains:\");\n  for file in glob(dir+\"\/*\") do\n    writeln(\"  \", file);\n}\n","new_contents":"use Filerator;\n\nfor dir in walkdirs(\"subdir\", sort=true) {\n  writeln(\"dir \", dir, \" contains:\");\n  for file in glob(dir+\"\/*\") do\n    writeln(\"  \", file);\n}\n","subject":"Fix nondeterministic output from walkdir() by requesting sorted output","message":"Fix nondeterministic output from walkdir() by requesting sorted output\n","lang":"Chapel","license":"apache-2.0","repos":"chizarlicious\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,hildeth\/chapel,hildeth\/chapel,hildeth\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,hildeth\/chapel,chizarlicious\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,hildeth\/chapel,hildeth\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,hildeth\/chapel,CoryMcCartan\/chapel"}
{"commit":"735bbb6a907f6651c651090bf0a4d54260124f85","old_file":"test\/trivial\/diten\/pi_monte_carlo.chpl","new_file":"test\/trivial\/diten\/pi_monte_carlo.chpl","old_contents":"\/\/ Calcuate pi using a monte carlo simulation\n\nuse Random, Time;\n\nconfig const n = 10000, seed = 314159;\nconfig const verbose: bool = false;\n\nvar count:int;\nvar pi, startTime, totalTime: real;\nvar rs = RandomStream(seed);\n\nstartTime = getCurrentTime(microseconds);\n\n\/\/ Find random points on the complex plane in (0..1+i)\n\/\/ and count how many are outside the unit circle.\ncount = + reduce [1..n] abs(rs.getNext()**2 + rs.getNext()**2):int;\n\n\/\/ The probability a point is inside the unit circle is pi \/ 4.\npi = 4 * (n-count):real(64) \/ n;\n\n\/\/ Write out the results\nwriteln(pi);\ntotalTime = (getCurrentTime(microseconds) - startTime) \/ 1000000;\nif (verbose) then\n  writeln(\"Calculation took: \", totalTime, \" seconds\");\n\n","new_contents":"\/\/ Calcuate pi using a monte carlo simulation\n\nuse Random, Time;\n\nconfig const n = 10000, seed = 314159;\nconfig const verbose: bool = false;\n\nvar count:int;\nvar pi, startTime, totalTime: real;\nvar rs = RandomStream(seed);\n\nstartTime = getCurrentTime(microseconds);\n\n\/\/ Find random points on the complex plane in (0..1+i)\n\/\/ and count how many are outside the unit circle.\ncount = + reduce for 1..n do abs(rs.getNext()**2 + rs.getNext()**2):int;\n\n\/\/ The probability a point is inside the unit circle is pi \/ 4.\npi = 4 * (n-count):real(64) \/ n;\n\n\/\/ Write out the results\nwriteln(pi);\ntotalTime = (getCurrentTime(microseconds) - startTime) \/ 1000000;\nif (verbose) then\n  writeln(\"Calculation took: \", totalTime, \" seconds\");\n\n","subject":"Change an incorrect bracket syntax forall expression into a for expression for a loop that needs to be serial.","message":"Change an incorrect bracket syntax forall expression into a for expression for a\nloop that needs to be serial.\n\n\ngit-svn-id: 88467cb1fb04b8a755be7e1ee1026be4190196ef@11785 3a8e244f-b0f2-452b-bcba-4c88e055c3ca\n","lang":"Chapel","license":"apache-2.0","repos":"CoryMcCartan\/chapel,CoryMcCartan\/chapel,hildeth\/chapel,hildeth\/chapel,sungeunchoi\/chapel,hildeth\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,sungeunchoi\/chapel,chizarlicious\/chapel,hildeth\/chapel,sungeunchoi\/chapel,chizarlicious\/chapel,sungeunchoi\/chapel,sungeunchoi\/chapel,hildeth\/chapel,sungeunchoi\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,sungeunchoi\/chapel,hildeth\/chapel,hildeth\/chapel,CoryMcCartan\/chapel,sungeunchoi\/chapel,CoryMcCartan\/chapel"}
{"commit":"8587dbf84d319c52bddda3dfa9b7d0cc5e87a970","old_file":"test\/reductions\/waynew\/lreductions.chpl","new_file":"test\/reductions\/waynew\/lreductions.chpl","old_contents":"\/\/ Test logical AND and OR reductions\n\nparam M = 10;\n\nvar D: domain(1) = [1..M];\nvar B: [D] bool;\nforall i in D do {\n  B(i) = true;\n}\nwriteln( \"\\nB[D] = \", B);\nwriteln( \"&& reduce B[D] = \", && reduce B);\nwriteln( \"|| reduce B[D] = \", || reduce B);\n\nforall i in D do {\n  B(i) = false;\n}\nwriteln( \"\\nB[D] = \", B);\nwriteln( \"&& reduce B[D] = \", && reduce B);\nwriteln( \"|| reduce B[D] = \", || reduce B);\n\nvar toggle: sync bool = false;\nforall i in D do {\n  var my_toggle = !toggle;\n  toggle = my_toggle;\n  B(i) = my_toggle;\n}\nwriteln( \"\\nB[D] = \", B);\nwriteln( \"&& reduce B[D] = \", && reduce B);\nwriteln( \"|| reduce B[D] = \", || reduce B);\n","new_contents":"\/\/ Test logical AND and OR reductions\n\nparam M = 10;\n\nvar D: domain(1) = [1..M];\nvar B: [D] bool;\nforall i in D do {\n  B(i) = true;\n}\nwriteln( \"\\nB[D] = \", B);\nwriteln( \"&& reduce B[D] = \", && reduce B);\nwriteln( \"|| reduce B[D] = \", || reduce B);\n\nforall i in D do {\n  B(i) = false;\n}\nwriteln( \"\\nB[D] = \", B);\nwriteln( \"&& reduce B[D] = \", && reduce B);\nwriteln( \"|| reduce B[D] = \", || reduce B);\n\nforall i in D do {\n  var toggle: bool = i % 2 == 1;\n  B(i) = toggle;\n}\nwriteln( \"\\nB[D] = \", B);\nwriteln( \"&& reduce B[D] = \", && reduce B);\nwriteln( \"|| reduce B[D] = \", || reduce B);\n","subject":"Change the last forall loop in this reduction test to make it deterministic.","message":"Change the last forall loop in this reduction test to make it deterministic.\n\nCompute the value of a bool independently at each iteration instead of\ndepending on the value from the previous iteration.\n\n\ngit-svn-id: 88467cb1fb04b8a755be7e1ee1026be4190196ef@16103 3a8e244f-b0f2-452b-bcba-4c88e055c3ca\n","lang":"Chapel","license":"apache-2.0","repos":"chizarlicious\/chapel,sungeunchoi\/chapel,sungeunchoi\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,hildeth\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,hildeth\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,hildeth\/chapel,sungeunchoi\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,sungeunchoi\/chapel,hildeth\/chapel,sungeunchoi\/chapel,sungeunchoi\/chapel,CoryMcCartan\/chapel,sungeunchoi\/chapel,sungeunchoi\/chapel,chizarlicious\/chapel,hildeth\/chapel,hildeth\/chapel,chizarlicious\/chapel,chizarlicious\/chapel,hildeth\/chapel"}
{"commit":"9e6e2013f0a8231697c0b03776038c7a2db6e61d","old_file":"test\/io\/ferguson\/hash_group.chpl","new_file":"test\/io\/ferguson\/hash_group.chpl","old_contents":"writef(\"###\\n\", 1.1);\nwritef(\"###.\\n\", 1.1);\nwritef(\"###..\\n\", 1.1);\nwritef(\"###.##\\n\", 1.1);\nwritef(\"%{###}.##\\n\", 1.1, 2.2);\nwritef(\"%{###.}##\\n\", 1.1, 2.2);\nwritef(\"%{###}%{###}\\n\", 1.1, 2.2);\nwritef(\"%{#.#}#.#%{#.#}\\n\", 1.1, 2.2, 3.3);\nwritef(\"%{#}#%{#}\\n\", 1.1, 2.2, 3.3);\n","new_contents":"writef(\"###\\n\", 1.1);\nwritef(\"###.\\n\", 1.1);\nwritef(\"###..\\n\", 1.1);\nwritef(\"###.##\\n\", 1.1);\nwritef(\"%{###}.##\\n\", 1.1, 2.2);\nwritef(\"%{###.}##\\n\", 1.1, 2.2);\nwritef(\"%{###}%{###}\\n\", 1.1, 2.2);\nwritef(\"%{#.#}#.#%{#.#}\\n\", 1.1, 2.2, 3.3);\nwritef(\"%{#}#%{#}\\n\", 1.1, 2.2, 3.3);\nwritef(\"%{#.#}.%{#.#}\\n\", 1.2, 3.4);\n\n\n","subject":"Add test from commit message","message":"Add test from commit message\n","lang":"Chapel","license":"apache-2.0","repos":"CoryMcCartan\/chapel,hildeth\/chapel,hildeth\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,hildeth\/chapel,chizarlicious\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,chizarlicious\/chapel,hildeth\/chapel,hildeth\/chapel,chizarlicious\/chapel,hildeth\/chapel,CoryMcCartan\/chapel,hildeth\/chapel,chizarlicious\/chapel"}
{"commit":"1e3b18493f52b09b9e71a99ca110f75d5dc91f06","old_file":"test\/modules\/diten\/quickSort.chpl","new_file":"test\/modules\/diten\/quickSort.chpl","old_contents":"\/\/ A test of the QuickSort function in the Sort module\n\nuse Sort;\nuse Random;\n\nconfig const size = 4096;\n\ndef main() {\n  var A: [1..size] int;\n  var rands: [1..size] real;\n  var randomStream = RandomStream();\n\n  \/\/ Fill A with random int values in [0, 99999]\n  randomStream.fillRandom(rands);\n  [i in 1..size] A(i) = (100000 * rands(i)):int;\n\n  QuickSort(A);\n\n  \/\/ Check that A is sorted\n  [i in 1..size-1] {\n    if A(i) > A(i+1) then\n      writeln(A(i), \" \", A(i+1));\n  }\n}\n","new_contents":"\/\/ A test of the QuickSort function in the Sort module\n\nuse Sort;\nuse Random;\n\nconfig const size = 4096;\nconfig const seed = 27;\n\ndef main() {\n  var A: [1..size] int;\n  var rands: [1..size] real;\n  var randomStream = RandomStream(seed);\n\n  \/\/ Fill A with random int values in [0, 99999]\n  randomStream.fillRandom(rands);\n  [i in 1..size] A(i) = (100000 * rands(i)):int;\n\n  QuickSort(A);\n\n  \/\/ Check that A is sorted\n  [i in 1..size-1] {\n    if A(i) > A(i+1) then\n      writeln(A(i), \" \", A(i+1));\n  }\n}\n","subject":"Make the seed to the RandomStream class in my QuickSort test be set to something that causes the \"infinite\" loop failure instead of the current time.","message":"Make the seed to the RandomStream class in my QuickSort test be set to\nsomething that causes the \"infinite\" loop failure instead of the current time.\n\n\ngit-svn-id: 88467cb1fb04b8a755be7e1ee1026be4190196ef@9702 3a8e244f-b0f2-452b-bcba-4c88e055c3ca\n","lang":"Chapel","license":"apache-2.0","repos":"chizarlicious\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,hildeth\/chapel,hildeth\/chapel,sungeunchoi\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,hildeth\/chapel,hildeth\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,sungeunchoi\/chapel,sungeunchoi\/chapel,chizarlicious\/chapel,sungeunchoi\/chapel,sungeunchoi\/chapel,chizarlicious\/chapel,sungeunchoi\/chapel,hildeth\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,chizarlicious\/chapel,sungeunchoi\/chapel,hildeth\/chapel,sungeunchoi\/chapel,hildeth\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel"}
{"commit":"c846fb1c725fd0e7e9fda79cf0f9d679052b6b81","old_file":"test\/performance\/bharshbarg\/arr-forall.chpl","new_file":"test\/performance\/bharshbarg\/arr-forall.chpl","old_contents":"\/\/\n\/\/ Measures both array iteration and array access time\n\/\/\n\nuse Memory, Time, Types;\n\nconfig const zipIter = false;\nconfig const memFraction = 100;\nconfig const printPerf = false;\n\ntype elemType = uint(8);\n\nconst totalMem = here.physicalMemory(unit = MemUnits.Bytes);\nconst n = (totalMem \/ numBytes(elemType)) \/ memFraction;\n\nconst space = 1..n;\nvar data : [space] elemType;\nvar x : elemType = 2;\n\nvar time : Timer;\ntime.start();\nif zipIter {\n  forall (i, j) in zip(data, data) with (ref x) do\n    x *= i;\n} else {\n  forall i in data with (ref x) do\n    x *= i;\n}\ntime.stop();\n\nif printPerf then writeln(\"Time: \", time.elapsed());\n","new_contents":"\/\/\n\/\/ Measures both array iteration and array access time\n\/\/\n\nuse Memory, Time, Types;\n\nconfig const zipIter = false;\nconfig const memFraction = 100;\nconfig const printPerf = false;\n\ntype elemType = uint(8);\n\nconst totalMem = here.physicalMemory(unit = MemUnits.Bytes);\nconst target = (totalMem \/ numBytes(elemType)) \/ memFraction;\n\/\/ set a maximum problem size\nconst n = min(target, 8 * 1e9) : int;\n\nconst space = 1..n;\nvar data : [space] elemType;\nvar x : elemType = 2;\n\nvar time : Timer;\ntime.start();\nif zipIter {\n  forall (i, j) in zip(data, data) with (ref x) do\n    x *= i;\n} else {\n  forall i in data with (ref x) do\n    x *= i;\n}\ntime.stop();\n\nif printPerf then writeln(\"Time: \", time.elapsed());\n","subject":"Set a maximum problem size to avoid timeouts","message":"Set a maximum problem size to avoid timeouts\n","lang":"Chapel","license":"apache-2.0","repos":"chizarlicious\/chapel,chizarlicious\/chapel,hildeth\/chapel,hildeth\/chapel,hildeth\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,hildeth\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,hildeth\/chapel,hildeth\/chapel,hildeth\/chapel"}
{"commit":"891ddae57bf58175b24dd51d3ca0fc01d37a2b0e","old_file":"test\/types\/sync\/sungeun\/basicUpdate.chpl","new_file":"test\/types\/sync\/sungeun\/basicUpdate.chpl","old_contents":"config const n = 100;\nconfig const shift = 2;\nconfig type myType = real;\n\nuse Random;\n\nvar randlist = new RandomStream(314159265);\nvar T: [1..n] real;\nrandlist.fillRandom(T);\n\nproc foo(type myType) {\n  var A = (T*(1<<shift):real):myType;\n  var x: sync myType = 0:myType;\n  forall i in 1..n do\n    x += A[i];\n  var sum = + reduce A;\n  \/\/ This check could run into troubles with floating point types\n  if x.readXX() != sum then\n    writeln(\"ERROR: sums do not match for \", typeToString(myType),\n            \" (should be \", sum, \", result is \", x.readXX(), \")\");\n}\n\nfoo(int(32));\nfoo(int(64));\nfoo(uint(32));\nfoo(uint(64));\nfoo(real(32));\nfoo(real(64));\n","new_contents":"config const n = 100;\nconfig type myType = real;\n\nvar T: [1..n] real;\n[i in 1..n] T[i] = i*1.01;\n\nproc foo(type myType) {\n  var A = T:myType;\n  var x: sync myType = 0:myType;\n  forall i in 1..n do\n    x += A[i];\n  var sum = + reduce A;\n  if x.readXX() != sum then\n    writeln(\"ERROR: sums do not match for \", typeToString(myType),\n            \" (should be \", sum, \", result is \", x.readXX(), \")\");\n}\n\nfoo(int(32));\nfoo(int(64));\nfoo(uint(32));\nfoo(uint(64));\nfoo(real(32));\nfoo(real(64));\n","subject":"Change initialization to avoid numerical instability.","message":"Change initialization to avoid numerical instability.\n\nBrad pointed out that I could avoid the numerical instability by using\nfixed values.  These aren't fixed, but they're multiples of fixed\nvalues, which seems to do the trick.\n\n\n\ngit-svn-id: 88467cb1fb04b8a755be7e1ee1026be4190196ef@19933 3a8e244f-b0f2-452b-bcba-4c88e055c3ca\n","lang":"Chapel","license":"apache-2.0","repos":"chizarlicious\/chapel,hildeth\/chapel,CoryMcCartan\/chapel,hildeth\/chapel,sungeunchoi\/chapel,chizarlicious\/chapel,sungeunchoi\/chapel,sungeunchoi\/chapel,CoryMcCartan\/chapel,sungeunchoi\/chapel,sungeunchoi\/chapel,chizarlicious\/chapel,hildeth\/chapel,chizarlicious\/chapel,hildeth\/chapel,sungeunchoi\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,hildeth\/chapel,hildeth\/chapel,chizarlicious\/chapel,sungeunchoi\/chapel,sungeunchoi\/chapel,hildeth\/chapel,chizarlicious\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel"}
{"commit":"ae9e1323080807340bf932cc15655797842bd731","old_file":"test\/io\/thomasvandoren\/lustre\/simpleOpen.chpl","new_file":"test\/io\/thomasvandoren\/lustre\/simpleOpen.chpl","old_contents":"\/*\n * Open a file and confirm its FS type is lustre.\n *\/\n\nuse IO;\n\nvar fp = open(\"SKIPIF\", iomode.r),\n  fileType = fp.fstype();\n\nif fileType == FTYPE_LUSTRE {\n  writeln(\"SUCCESS\");\n} else {\n  writeln(\"FAILURE\");\n}\n","new_contents":"\/*\n * Open a file and confirm its FS type is lustre.\n *\/\n\nuse IO;\n\nconst fsTypes: [{0..3}] string = [\n  \"none\",\n  \"hdfs\",\n  \"UNKNOWN\", \/\/ lustre is LUSTRE_SUPER_MAGIC (whatever that is)\n  \"curl\"\n];\n\nvar fp = open(\"SKIPIF\", iomode.r),\n  fileType = fp.fstype();\n\nif fileType == FTYPE_LUSTRE {\n  writeln(\"SUCCESS\");\n} else {\n  writef(\"FAILURE: Expected FTYPE_LUSTRE (%n), actual: %s (%n)\\n\",\n         FTYPE_LUSTRE, fsTypes[fileType], fileType);\n}\n","subject":"Update error message to be more helpful.","message":"Update error message to be more helpful.\n","lang":"Chapel","license":"apache-2.0","repos":"chizarlicious\/chapel,hildeth\/chapel,hildeth\/chapel,hildeth\/chapel,CoryMcCartan\/chapel,hildeth\/chapel,chizarlicious\/chapel,chizarlicious\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,hildeth\/chapel,hildeth\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,hildeth\/chapel,CoryMcCartan\/chapel"}
{"commit":"b2ce667a931a11c88e3d37cfdd2c3a6599275087","old_file":"test\/parallel\/cobegin\/waynew\/while.chpl","new_file":"test\/parallel\/cobegin\/waynew\/while.chpl","old_contents":"var a: sync int;\nvar b = 0;\n\ncobegin {\n  {\n    b = 1;\n    while (a < 3) {\n      b = 2;\n    }\n  }\n  a = 1;\n  a += 1;\n  a += 1;\n}\n\nif (b==2) then {\n  writeln (\"b is good\");\n} else {\n  writeln (\"b is bad\");\n}\n","new_contents":"var a: sync int;\nvar b = 0;\n\ncobegin {\n  {\n    b = 1;\n    while (a < 3) {\n      b = 2;\n    }\n  }\n  {\n    a = 1;\n    a = 2;\n    a = 3;\n  }\n}\n\nif (b==2) then {\n  writeln (\"b is good\");\n} else {\n  writeln (\"b is bad: \", b);\n}\n","subject":"Fix my spin wait -> sync var change","message":"Fix my spin wait -> sync var change\n\nI realized that it had the possibility to deadlock the way I changed it because\n+= causes a read and write.\n\n\ngit-svn-id: 88467cb1fb04b8a755be7e1ee1026be4190196ef@13565 3a8e244f-b0f2-452b-bcba-4c88e055c3ca\n","lang":"Chapel","license":"apache-2.0","repos":"sungeunchoi\/chapel,hildeth\/chapel,sungeunchoi\/chapel,sungeunchoi\/chapel,chizarlicious\/chapel,hildeth\/chapel,sungeunchoi\/chapel,hildeth\/chapel,hildeth\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,chizarlicious\/chapel,chizarlicious\/chapel,sungeunchoi\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,sungeunchoi\/chapel,CoryMcCartan\/chapel,hildeth\/chapel,hildeth\/chapel,CoryMcCartan\/chapel,hildeth\/chapel,sungeunchoi\/chapel,sungeunchoi\/chapel"}
{"commit":"947542f4a2cf5e8b5c08a18cf918e3ccca560886","old_file":"test\/performance\/bharshbarg\/arr-forall.chpl","new_file":"test\/performance\/bharshbarg\/arr-forall.chpl","old_contents":"\/\/\n\/\/ Measures both array iteration and array access time\n\/\/\n\nuse Memory, Time, Types;\n\nconfig const zipIter = false;\nconfig const memFraction = 16;\nconfig const printPerf = false;\n\ntype elemType = uint(8);\n\nconst totalMem = here.physicalMemory(unit = MemUnits.Bytes);\nconst n = (totalMem \/ numBytes(elemType)) \/ memFraction;\n\nconst space = 1..n;\nvar data : [space] elemType;\nvar x : elemType = 2;\n\nvar time : Timer;\ntime.start();\nif zipIter {\n  forall (i, j) in zip(data, data) with (ref x) do\n    x *= i;\n} else {\n  forall i in data with (ref x) do\n    x *= i;\n}\ntime.stop();\n\nif printPerf then writeln(\"Time: \", time.elapsed());\n","new_contents":"\/\/\n\/\/ Measures both array iteration and array access time\n\/\/\n\nuse Memory, Time, Types;\n\nconfig const zipIter = false;\nconfig const memFraction = 100;\nconfig const printPerf = false;\n\ntype elemType = uint(8);\n\nconst totalMem = here.physicalMemory(unit = MemUnits.Bytes);\nconst n = (totalMem \/ numBytes(elemType)) \/ memFraction;\n\nconst space = 1..n;\nvar data : [space] elemType;\nvar x : elemType = 2;\n\nvar time : Timer;\ntime.start();\nif zipIter {\n  forall (i, j) in zip(data, data) with (ref x) do\n    x *= i;\n} else {\n  forall i in data with (ref x) do\n    x *= i;\n}\ntime.stop();\n\nif printPerf then writeln(\"Time: \", time.elapsed());\n","subject":"Reduce problem size to avoid timeouts on non-performance configurations","message":"Reduce problem size to avoid timeouts on non-performance configurations\n","lang":"Chapel","license":"apache-2.0","repos":"chizarlicious\/chapel,chizarlicious\/chapel,hildeth\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,hildeth\/chapel,CoryMcCartan\/chapel,CoryMcCartan\/chapel,hildeth\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,chizarlicious\/chapel,hildeth\/chapel,hildeth\/chapel,hildeth\/chapel,CoryMcCartan\/chapel,chizarlicious\/chapel,chizarlicious\/chapel,hildeth\/chapel,chizarlicious\/chapel,CoryMcCartan\/chapel"}