Bitbucket is a code hosting site with unlimited public and private repositories. We're also free for small teams!

Close
DUST - GAP package for additional generic data structures. 

Dust is everywhere, but will be wiped off (eventually,
i.e. incorporated into some other package or GAP itself).

1. associative list: index arrays by anything that can be sorted
(as the underlying data structures are sorted lists)

2. general storage structures: queues and stacks,
so you can write your graph search algorithm on a general level,
then feed a stack or a queue getting depth-first of breadth-first search

3. multilevel indexed storage based on supplied list of indexer functions
in order to do load balancing on lists/hashtables
(instead of putting huge amount of elements into one storage)
  

Recent activity

dersu

dersu pushed 1 commit to dersu/dust

4caddc5 - adding Collect (non-destructive assign) to AssociativeList
dersu

dersu pushed 1 commit to dersu/dust

b7ea262 - bugfix in MultiIndexedHashSet, double accounting was too eager
dersu

dersu pushed 1 commit to dersu/dust

5aed5c3 - adding dynamic indexed hashset, removing old implementation
Tip: Filter by directory path e.g. /media app.js to search for public/media/app.js.
Tip: Use camelCasing e.g. ProjME to search for ProjectModifiedEvent.java.
Tip: Filter by extension type e.g. /repo .js to search for all .js files in the /repo directory.
Tip: Separate your search with spaces e.g. /ssh pom.xml to search for src/ssh/pom.xml.
Tip: Use ↑ and ↓ arrow keys to navigate and return to view the file.
Tip: You can also navigate files with Ctrl+j (next) and Ctrl+k (previous) and view the file with Ctrl+o.
Tip: You can also navigate files with Alt+j (next) and Alt+k (previous) and view the file with Alt+o.