# -*- coding: utf-8; mode: tcl; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- vim:fenc=utf-8:ft=tcl:et:sw=4:ts=4:sts=4
description C++ implementation of efficiently-updatable double-array library
long_description Cedar implements a double-array trie. It offers fast \
update/lookup for skewed (or ordered) queries\; it is meant \
for skewed update/lookup with real-world data, e.g., words \
in natural language text or mining conjunctive features in \
a linear classifier. Even if keys are uniformly, randomly \
queried, its update/lookup is still faster than std::map \
and comparable to std::unordered_map.
homepage http://www.tkl.iis.u-tokyo.ac.jp/~ynaga/cedar/
license {GPL-2 LGPL-2.1 BSD}
checksums rmd160 28b16f4ebf3e6d79a82896a36450b0191bae5c26 \
sha256 200a31b0a82ac0e6756a09959e8e380afd35d3d175c88fb54c966099995f933a
# install additional documents.
set dest_doc ${destroot}${prefix}/share/doc/${name}
xinstall -m 644 -W ${worksrcpath} \
AUTHORS BSD GPL LGPL THANKS \
livecheck.regex ${name}-(\\d+-\\d+-\\d+)${extract.suffix}