Nim - This repository contains the Nim compiler, Nim's stdlib, tools, and documentation. (mirror)

diff options

Diffstat (limited to 'nim/nhashes.pas')

0 files changed, 0 insertions, 0 deletions

n import sigmatch for type matching' href='/ahoang/Nim/commit/tests/accept/run/tgenerics1.nim?h=devel&id=fdde4d3a9266e8a393f0303b1982a2dc9ca7ca6e'>fdde4d3a9 ^

e424e13bd ^

fdde4d3a9 ^

e424e13bd ^

fdde4d3a9 ^

e424e13bd ^

6ff8752be ^

fdde4d3a9 ^

e424e13bd ^

fdde4d3a9 ^

14
15

45
46

discard """
  output: "100 0"
"""

# A min-heap.
type
  TNode[T] = tuple[priority: int, data: T]

  TBinHeap[T] = object
    heap: seq[TNode[T]]
    last: int
  
  PBinHeap[T] = ref TBinHeap[T]

proc newBinHeap*[T](heap: var PBinHeap[T], size: int) =
  new(heap)
  heap.last = 0
  newSeq(heap.heap, size)
  #newSeq(heap.seq, size)
 
proc parent(elem: int): int {.inline.} =
  return (elem-1) div 2

proc siftUp[T](heap: PBinHeap[T], elem: int) =
  var idx = elem
  while idx != 0:
    var p = parent(idx)
    if heap.heap[idx].priority < heap.heap[p].priority:
      swap(heap.heap[idx], heap.heap[p])
      idx = p
    else:
      break

proc add*[T](heap: PBinHeap[T], priority: int, data: T) =
  var node: TNode[T]
  node.priority = priority
  node.data = data
  heap.heap[heap.last] = node
  siftUp(heap, heap.last)
  inc(heap.last)

proc print*[T](heap: PBinHeap[T]) =
  for i in countup(0, heap.last):
    stdout.write($heap.heap[i].data, " ")

var
  heap: PBinHeap[int]

newBinHeap(heap, 256)
add(heap, 1, 100)
print(heap)


context:
space:
mode: