Lines Matching defs:const
36 RNode::RNode(const char *s, size_t len, ssize_t index, ssize_t wildcard_index)
44 RNode *find_next_node(const RNode *node, char c) {
46 [](const std::unique_ptr<RNode> &lhs,
47 const char c) { return lhs->s[0] < c; });
60 [](const std::unique_ptr<RNode> &lhs,
61 const char c) { return lhs->s[0] < c; });
66 void Router::add_node(RNode *node, const char *pattern, size_t patlen,
74 size_t Router::add_route(const StringRef &pattern, size_t idx, bool wildcard) {
162 const RNode *match_complete(size_t *offset, const RNode *node,
163 const char *first, const char *last) {
194 const RNode *match_partial(bool *pattern_is_wildcard, const RNode *node,
195 size_t offset, const char *first, const char *last) {
207 const RNode *found_node = nullptr;
314 ssize_t Router::match(const StringRef &host, const StringRef &path) const {
315 const RNode *node;
333 ssize_t Router::match(const StringRef &s) const {
334 const RNode *node;
350 const RNode *match_prefix(size_t *nread, const RNode *node, const char *first,
351 const char *last) {
391 ssize_t Router::match_prefix(size_t *nread, const RNode **last_node,
392 const StringRef &s) const {
409 void dump_node(const RNode *node, int depth) {
418 void Router::dump() const { dump_node(&root_, 0); }