Difference between revisions of "Sdsl"
(Created page with "Category:SoftwareCategory:libraryCategory:c++ {|<!--CONFIGURATION: REQUIRED--> |{{#vardefine:app|sdsl}} |{{#vardefine:url|https://github.com/simongog/sdsl-lite}} <...") |
Moskalenko (talk | contribs) m (Text replacement - "#uppercase" to "uc") |
||
Line 24: | Line 24: | ||
Run <code>module spider {{#var:app}}</code> to find out what environment modules are available for this application. | Run <code>module spider {{#var:app}}</code> to find out what environment modules are available for this application. | ||
==System Variables== | ==System Variables== | ||
− | * HPC_{{ | + | * HPC_{{uc:{{#var:app}}}}_DIR - installation directory |
− | * HPC_{{ | + | * HPC_{{uc:{{#var:app}}}}_LIB - library directory |
− | * HPC_{{ | + | * HPC_{{uc:{{#var:app}}}}_INC - include directory |
<!--Configuration--> | <!--Configuration--> | ||
{{#if: {{#var: conf}}|==Configuration== | {{#if: {{#var: conf}}|==Configuration== |
Revision as of 21:24, 6 December 2019
Description
The Succinct Data Structure Library (SDSL) is a powerful and flexible C++11 library implementing succinct data structures. In total, the library contains the highlights of 40 research publications. Succinct data structures can represent an object (such as a bitvector or a tree) in space close to the information-theoretic lower bound of the object while supporting operations of the original object efficiently. The theoretical time complexity of an operation performed on the classical data structure and the equivalent succinct data structure are (most of the time) identical.
Environment Modules
Run module spider sdsl
to find out what environment modules are available for this application.
System Variables
- HPC_SDSL_DIR - installation directory
- HPC_SDSL_LIB - library directory
- HPC_SDSL_INC - include directory
Citation
If you publish research that uses sdsl you have to cite it as follows:
Gog, Simon, et al. "From theory to practice: Plug and play with succinct data structures." International Symposium on Experimental Algorithms. Springer, Cham, 2014.