SNode.C
Loading...
Searching...
No Matches
regex_utils.h
Go to the documentation of this file.
1/*
2 * SNode.C - A Slim Toolkit for Network Communication
3 * Copyright (C) Volker Christian <me@vchrist.at>
4 * 2020, 2021, 2022, 2023, 2024, 2025
5 *
6 * This program is free software: you can redistribute it and/or modify
7 * it under the terms of the GNU Lesser General Public License as published
8 * by the Free Software Foundation, either version 3 of the License, or
9 * (at your option) any later version.
10 *
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU Lesser General Public License for more details.
15 *
16 * You should have received a copy of the GNU Lesser General Public License
17 * along with this program. If not, see <http://www.gnu.org/licenses/>.
18 */
19
20/*
21 * MIT License
22 *
23 * Permission is hereby granted, free of charge, to any person obtaining a copy
24 * of this software and associated documentation files (the "Software"), to deal
25 * in the Software without restriction, including without limitation the rights
26 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
27 * copies of the Software, and to permit persons to whom the Software is
28 * furnished to do so, subject to the following conditions:
29 *
30 * The above copyright notice and this permission notice shall be included in
31 * all copies or substantial portions of the Software.
32 *
33 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
34 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
35 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
36 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
37 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
38 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
39 * THE SOFTWARE.
40 */
41
42#ifndef EXPRESS_DISPATCHER_REGEX_UTILS_H
43#define EXPRESS_DISPATCHER_REGEX_UTILS_H
44
45namespace express {
46 class Request;
47} // namespace express
48
49#ifndef DOXYGEN_SHOULD_SKIP_THIS
50
51#include <algorithm>
52#include <cctype>
53#include <cstddef>
54#include <iterator>
55#include <regex>
56#include <string>
57#include <string_view>
58#include <unordered_map>
59#include <utility>
60#include <vector>
61
62#endif /* DOXYGEN_SHOULD_SKIP_THIS */
63
64namespace express::dispatcher {
65
66 std::vector<std::string> explode(const std::string& s, char delim);
67
68 const std::regex& pathRegex();
69
70 std::smatch matchResult(const std::string& cpath);
71
72 bool hasResult(const std::string& cpath);
73
74 void setParams(const std::string& cpath, express::Request& req);
75
76 // ---------- URL split & query parsing ----------
77 void splitPathAndQuery(std::string_view url, std::string_view& path, std::string_view& query);
78
79 std::unordered_map<std::string, std::string> parseQuery(std::string_view qs);
80
81 // ---------- path normalization & comparisons ----------
82 std::string_view trimOneTrailingSlash(std::string_view s);
83
84 inline bool ieq(char a, char b) {
85 return std::tolower(static_cast<unsigned char>(a)) == std::tolower(static_cast<unsigned char>(b));
86 }
87
88 bool equalPath(std::string_view a, std::string_view b, bool caseInsensitive);
89
90 // prefix with **segment boundary** (so "/api" won't match "/apix")
91 bool boundaryPrefix(std::string_view path, std::string_view base, bool caseInsensitive);
92
93 bool querySupersetMatches(const std::unordered_map<std::string, std::string>& rq,
94 const std::unordered_map<std::string, std::string>& need);
95
96 // ---------- param path → regex compiler ----------
97 // Converts "/api/:id(\\d+)/files/:rest(.*)" into:
98 // ^/api/(\d+)/files/(.*)(?:/|$) (prefix mode, router/middleware)
99 // ^/api/(\d+)/files/(.*)/?$ (end-anchored (strict=false), application)
100 // and returns capture group names in order: ["id","rest"]
101 std::pair<std::regex, std::vector<std::string>> compileParamRegex(std::string_view mountPath,
102 bool isPrefix, // router/middleware=true, application=false
103 bool strictRouting,
104 bool caseInsensitive);
105
106 template <typename RequestLike>
107 inline bool
108 matchAndFillParams(const std::regex& rx, const std::vector<std::string>& names, std::string_view reqPath, RequestLike& req) {
109 std::cmatch m;
110 if (!std::regex_search(reqPath.begin(), reqPath.end(), m, rx)) {
111 return false;
112 }
113 const size_t g = (!m.empty()) ? (m.size() - 1) : 0;
114 const size_t n = std::min(names.size(), g);
115 for (size_t i = 0; i < n; ++i) {
116 req.params[names[i]] = m[i + 1].str();
117 }
118 return true;
119 }
120
121} // namespace express::dispatcher
122
123#endif // EXPRESS_DISPATCHER_REGEX_UTILS_H
const std::string & getConnectionName() const
SocketConnection * getSocketConnection() const
const std::shared_ptr< Request > & getRequest()
bool getStrictRouting() const
bool getCaseInsensitiveRouting() const
const std::shared_ptr< Response > & getResponse()
std::shared_ptr< Route > nextRoute
Definition Dispatcher.h:80
std::string originalUrl
Definition Request.h:76
std::string url
Definition Request.h:96
web::http::CiStringMap< std::string > queries
Definition Request.h:101
std::string method
Definition Request.h:95
std::string path
Definition Request.h:77
web::http::server::SocketContext * getSocketContext() const
Definition Response.cpp:68
std::list< std::string > getRoute(const std::string &parentMountPath, bool strictRouting) const
Definition Route.cpp:114
const std::function< void(const std::shared_ptr< Request > &, const std::shared_ptr< Response > &)> lambda
bool dispatch(express::Controller &controller, const std::string &parentMountPath, const express::MountPoint &mountPoint) override
std::list< std::string > getRoutes(const std::string &parentMountPath, const MountPoint &mountPoint, bool strictRouting) const override
ApplicationDispatcher(const std::function< void(const std::shared_ptr< Request > &, const std::shared_ptr< Response > &)> &lambda)
bool matchAndFillParams(const std::regex &rx, const std::vector< std::string > &names, std::string_view reqPath, RequestLike &req)
bool querySupersetMatches(const std::unordered_map< std::string, std::string > &rq, const std::unordered_map< std::string, std::string > &need)
void setParams(const std::string &cpath, Request &req)
std::vector< std::string > explode(const std::string &input, char delim)
void splitPathAndQuery(std::string_view url, std::string_view &path, std::string_view &query)
bool boundaryPrefix(std::string_view path, std::string_view base, bool caseInsensitive)
std::pair< std::regex, std::vector< std::string > > compileParamRegex(std::string_view mountPath, bool isPrefix, bool strictRouting, bool caseInsensitive)
std::smatch matchResult(const std::string &cpath)
bool ieq(char a, char b)
Definition regex_utils.h:84
std::unordered_map< std::string, std::string > parseQuery(std::string_view qs)
bool hasResult(const std::string &cpath)
std::string_view trimOneTrailingSlash(std::string_view s)
bool equalPath(std::string_view a, std::string_view b, bool caseInsensitive)
const std::regex & pathRegex()
std::string method
Definition MountPoint.h:56
std::string relativeMountPath
Definition MountPoint.h:57