mirror of
https://github.com/nim-lang/Nim.git
synced 2025-12-30 18:02:05 +00:00
6c1c8f51b3
* IC: renamed to_packed_ast module to ic module * IC: don't store the --forceBuild flag, makes it easier to test * IC: enable hello world test * Codegen: refactorings for IC; changed the name mangling algorithm * fixed the HCR regressions * life is too short for HCR * tconvexhull is now allowed to use deepCopy * IC exposed a stdlib bug, required a refactoring * codegen: code cleanups * IC: even if a module is outdated, its dependencies might come from disk * IC: progress * IC: better name mangling, module IDs are not stable * IC: another refactoring helping with --ic:on --gc:arc * disable arraymancer on Windows for the time being * disable arraymancer altogether * IC: make basic test work with 'nim cpp' * IC: progress on --ic:on --gc:arc * wip; name mangling for type info
60 lines
1.5 KiB
Nim
60 lines
1.5 KiB
Nim
discard """
|
|
output: '''
|
|
'''
|
|
"""
|
|
|
|
# parallel convex hull for Nim bigbreak
|
|
# nim c --threads:on -d:release pconvex_hull.nim
|
|
import algorithm, sequtils, threadpool
|
|
|
|
type Point = tuple[x, y: float]
|
|
|
|
proc cmpPoint(a, b: Point): int =
|
|
result = cmp(a.x, b.x)
|
|
if result == 0:
|
|
result = cmp(a.y, b.y)
|
|
|
|
template cross[T](o, a, b: T): untyped =
|
|
(a.x - o.x) * (b.y - o.y) - (a.y - o.y) * (b.x - o.x)
|
|
|
|
template pro(): untyped =
|
|
while lr1 > 0 and cross(result[lr1 - 1], result[lr1], p[i]) <= 0:
|
|
discard result.pop
|
|
lr1 -= 1
|
|
result.add(p[i])
|
|
lr1 += 1
|
|
|
|
proc half[T](p: seq[T]; upper: bool): seq[T] =
|
|
var i, lr1: int
|
|
result = @[]
|
|
lr1 = -1
|
|
if upper:
|
|
i = 0
|
|
while i <= high(p):
|
|
pro()
|
|
i += 1
|
|
else:
|
|
i = high(p)
|
|
while i >= low(p):
|
|
pro()
|
|
i -= 1
|
|
discard result.pop
|
|
|
|
proc convex_hull[T](points: var seq[T], cmp: proc(x, y: T): int {.closure.}) : seq[T] =
|
|
if len(points) < 2: return points
|
|
points.sort(cmp)
|
|
var ul: array[2, FlowVar[seq[T]]]
|
|
parallel:
|
|
for k in 0..ul.high:
|
|
ul[k] = spawn half[T](points, k == 0)
|
|
result = concat(^ul[0], ^ul[1])
|
|
|
|
var s = map(toSeq(0..9999), proc(x: int): Point = (float(x div 100), float(x mod 100)))
|
|
# On some runs, this pool size reduction will set the "shutdown" attribute on the
|
|
# worker thread that executes our spawned task, before we can read the flowvars.
|
|
setMaxPoolSize 2
|
|
|
|
for i in 0..2:
|
|
doAssert convex_hull[Point](s, cmpPoint) ==
|
|
@[(0.0, 0.0), (99.0, 0.0), (99.0, 99.0), (0.0, 99.0)]
|