added some new convenience functions - suckless/dwm - Unnamed repository; edit this file 'description' to name the repository.

about summary refs log tree commit diff stats

diff options

author	Anselm R. Garbe <arg@suckless.org>	2007-02-19 13:42:39 +0100
committer	Anselm R. Garbe <arg@suckless.org>	2007-02-19 13:42:39 +0100
commit	30af19d4426ca32dc38318bbe87534cc44484998 (patch)
tree	c3d862223531f5b02e3cb6e31b7e9ee5d38193a6 /dwm.png
parent	5d9146ff372ae0c5196e290fb2c1f828d4137e20 (diff)
download	dwm-30af19d4426ca32dc38318bbe87534cc44484998.tar.gz

added some new convenience functions

Diffstat (limited to 'dwm.png')

0 files changed, 0 insertions, 0 deletions

-04 23:03:22 +0200 compiler: Trim .nim files trailing whitespace' href='/ahoang/Nim/commit/compiler/bitsets.nim?h=devel&id=d68181246571de5799059cf6402f1c578cd9421c'>d68181246 ^

e25474154 ^

d68181246 ^

e25474154 ^

2df9b442c ^

e25474154 ^

d68181246 ^

e25474154 ^

d68181246 ^

e25474154 ^

d68181246 ^

e25474154 ^

d68181246 ^

e25474154 ^

d68181246 ^

e25474154 ^

d68181246 ^

e25474154 ^

d68181246 ^

e25474154 ^

d68181246 ^

e25474154 ^

d68181246 ^

e25474154 ^

d68181246 ^

e25474154 ^

1
2

10
11

19
20

31
32

34
35
36

43
44
45

47
48

51
52

54
55

57
58

64
65
66

67
68
69

70
71

#
#
#           The Nim Compiler
#        (c) Copyright 2012 Andreas Rumpf
#
#    See the file "copying.txt", included in this
#    distribution, for details about the copyright.
#

# this unit handles Nim sets; it implements bit sets
# the code here should be reused in the Nim standard library

type
  TBitSet* = seq[int8]        # we use byte here to avoid issues with
                              # cross-compiling; uint would be more efficient
                              # however

const
  ElemSize* = sizeof(int8) * 8

proc bitSetInit*(b: var TBitSet, length: int)
proc bitSetUnion*(x: var TBitSet, y: TBitSet)
proc bitSetDiff*(x: var TBitSet, y: TBitSet)
proc bitSetSymDiff*(x: var TBitSet, y: TBitSet)
proc bitSetIntersect*(x: var TBitSet, y: TBitSet)
proc bitSetIncl*(x: var TBitSet, elem: BiggestInt)
proc bitSetExcl*(x: var TBitSet, elem: BiggestInt)
proc bitSetIn*(x: TBitSet, e: BiggestInt): bool
proc bitSetEquals*(x, y: TBitSet): bool
proc bitSetContains*(x, y: TBitSet): bool
# implementation

proc bitSetIn(x: TBitSet, e: BiggestInt): bool =
  result = (x[int(e div ElemSize)] and toU8(int(1 shl (e mod ElemSize)))) !=
      toU8(0)

proc bitSetIncl(x: var TBitSet, elem: BiggestInt) =
  assert(elem >= 0)
  x[int(elem div ElemSize)] = x[int(elem div ElemSize)] or
      toU8(int(1 shl (elem mod ElemSize)))

proc bitSetExcl(x: var TBitSet, elem: BiggestInt) =
  x[int(elem div ElemSize)] = x[int(elem div ElemSize)] and
      not toU8(int(1 shl (elem mod ElemSize)))

proc bitSetInit(b: var TBitSet, length: int) =
  newSeq(b, length)

proc bitSetUnion(x: var TBitSet, y: TBitSet) =
  for i in countup(0, high(x)): x[i] = x[i] or y[i]

proc bitSetDiff(x: var TBitSet, y: TBitSet) =
  for i in countup(0, high(x)): x[i] = x[i] and not y[i]

proc bitSetSymDiff(x: var TBitSet, y: TBitSet) =
  for i in countup(0, high(x)): x[i] = x[i] xor y[i]

proc bitSetIntersect(x: var TBitSet, y: TBitSet) =
  for i in countup(0, high(x)): x[i] = x[i] and y[i]

proc bitSetEquals(x, y: TBitSet): bool =
  for i in countup(0, high(x)):
    if x[i] != y[i]:
      return false
  result = true

proc bitSetContains(x, y: TBitSet): bool =
  for i in countup(0, high(x)):
    if (x[i] and not y[i]) != int8(0):
      return false
  result = true


context:
space:
mode: