cedar (textproc/cedar) Updated: 2 years, 6 months ago Add to my watchlist 0

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.

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.

+ Show more

GitHub

• Details
• Builds
• Installation Stats
• Trac Tickets
• Report an Issue with this port
• API
• Stats FAQ

Statistics for selected duration

2024-Dec-16 to 2025-Jan-15

Variants table

Monthly Statistics

Can remain cached for up to 24 hours