19 Commits (1.0.0)

Author SHA1 Message Date
Georg Hopp 8b6600be30 Change queue to list and make a new queue class based on it. 10 years ago
Georg Hopp f41259db69 Use newly allocated queue backing store... 10 years ago
Georg Hopp 886d391288 Created new queue implementation based on dynamically growing arrays 10 years ago
Georg Hopp 26d6138c10 remove useless whitespace 10 years ago
Georg Hopp 546694ec1f Remove -DREENTRANT because it's not needed right now 10 years ago
Georg Hopp daaa2133b2 use threadsave libc. Prepare code for locks. Separate tree and tree elements. Use c99 standard. 11 years ago
Georg Hopp 21cf5258cb Revert "try to make data structures thread save by using a mutex" 11 years ago
Georg Hopp af33e8450f Revert "try to make code more thread save" 11 years ago
Georg Hopp 2f3a24d906 try to make code more thread save 11 years ago
Georg Hopp 88d64d65ab try to make data structures thread save by using a mutex 11 years ago
Georg Hopp dba7679800 small fix in queuePutFirst 11 years ago
Georg Hopp b9b5faa37d add queueDestroy and hashEmpty 11 years ago
Georg Hopp d8b2c214e9 small fix in delete 11 years ago
Georg Hopp 96d30bb5f3 add more list like functions to the queue .. they are not used now and not testes, so they probably have bugs. 11 years ago
Georg Hopp 28134883d6 small fix in queuePutFirst 11 years ago
Georg Hopp 35fa742df4 add put_first 11 years ago
Georg Hopp f7108d4bab add possibility to inject extra data into treeWalk and hashEach and change queue detructor to only conditionally free data within the nodes. 12 years ago
Georg Hopp da66d5df84 Use new class interface and update copyright information 12 years ago
Georg Hopp 21fc0713aa initial checkin 12 years ago