improved intro comment in dwm.h, updated config.mk - suckless/dwm - Unnamed repository; edit this file 'description' to name the repository.

diff options

author	arg@mmvi <unknown>	2006-09-20 09:40:35 +0200
committer	arg@mmvi <unknown>	2006-09-20 09:40:35 +0200
commit	886b2088f18ea3cb14421702b154efdd4759cfb2 (patch)
tree	5052b053aefe8fc047123b61ac362c1ef95a3077 /client.c
parent	551d6bb23dd4772a1a53a99d8d823ada5de9c3b6 (diff)
download	dwm-886b2088f18ea3cb14421702b154efdd4759cfb2.tar.gz

improved intro comment in dwm.h, updated config.mk

Diffstat (limited to 'client.c')

0 files changed, 0 insertions, 0 deletions

# # # The Nimrod Compiler # (c) Copyright 2012 Andreas Rumpf # # See the file "copying.txt", included in this # distribution, for details about the copyright. # # this unit handles Nimrod sets; it implements bit sets # the code here should be reused in the Nimrod 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: