taskrambler / libtrdata · Commits

You can move around the graph by using the arrow keys.
Created with Raphaël 2.1.212Apr1Nov29Oct2722212026256428Sep2422211330Aug292826115331Jul7524Jun2221181716remove test code copied from trbase.1.0.0 master v1…1.0.0 master v1.0.0Add missing build time header to EXTRA_DISTfix copy pasted Makefile.am under testsfix project nameversion bumpAdd CI control fileUse iterator if possibleAdd set datatypestart find and delete action on listInline simple accessor functionsAdd iterable interface and make TR_List and derivated classed iterableChange queue to list and make a new queue class based on it.Use newly allocated queue backing store...Created new queue implementation based on dynamically growing arraysremove useless whitespaceRemove -DREENTRANT because it's not needed right nowCheck existence of required tr headersRemove and ignore generated trdata.h.inChange SWAP to something worgingFix useless whitespaceadd heap codeseparate find last index into its own functionNew dynamic array implementation.cleanup empties the hash but does not remove the tree root, as this is removed in the destructor.use threadsave libc. Prepare code for locks. Separate tree and tree elements. Use c99 standard.Revert "try to make data structures thread save by using a mutex"Revert "try to make code more thread save"try to make code more thread savetry to make data structures thread save by using a mutexloc actionnow its possible to say a hash that it should not free its members on cleanup... useful if several structures hold the memberssmall fix in queuePutFirstadd queueDestroy and hashEmptysmall fix in deleteadd more list like functions to the queue .. they are not used now and not testes, so they probably have bugs.small fix in queuePutFirstadd m4 shipped with this projectadd put_firstadd possibility to inject extra data into treeWalk and hashEach and change queue detructor to only conditionally free data within the nodes.Use new class interface and update copyright information