1*93da997eSAli Mashtizadeh /*-
2*93da997eSAli Mashtizadeh * SPDX-License-Identifier: BSD-2-Clause
3*93da997eSAli Mashtizadeh *
4*93da997eSAli Mashtizadeh * Copyright (c) 2026, Netflix, Inc.
5*93da997eSAli Mashtizadeh *
6*93da997eSAli Mashtizadeh * This software was developed by Ali Mashtizadeh under the sponsorship from
7*93da997eSAli Mashtizadeh * Netflix, Inc.
8*93da997eSAli Mashtizadeh *
9*93da997eSAli Mashtizadeh * Redistribution and use in source and binary forms, with or without
10*93da997eSAli Mashtizadeh * modification, are permitted provided that the following conditions
11*93da997eSAli Mashtizadeh * are met:
12*93da997eSAli Mashtizadeh * 1. Redistributions of source code must retain the above copyright
13*93da997eSAli Mashtizadeh * notice, this list of conditions and the following disclaimer.
14*93da997eSAli Mashtizadeh * 2. Redistributions in binary form must reproduce the above copyright
15*93da997eSAli Mashtizadeh * notice, this list of conditions and the following disclaimer in the
16*93da997eSAli Mashtizadeh * documentation and/or other materials provided with the distribution.
17*93da997eSAli Mashtizadeh *
18*93da997eSAli Mashtizadeh * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
19*93da997eSAli Mashtizadeh * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20*93da997eSAli Mashtizadeh * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21*93da997eSAli Mashtizadeh * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
22*93da997eSAli Mashtizadeh * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23*93da997eSAli Mashtizadeh * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24*93da997eSAli Mashtizadeh * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25*93da997eSAli Mashtizadeh * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26*93da997eSAli Mashtizadeh * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27*93da997eSAli Mashtizadeh * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28*93da997eSAli Mashtizadeh * SUCH DAMAGE.
29*93da997eSAli Mashtizadeh *
30*93da997eSAli Mashtizadeh */
31*93da997eSAli Mashtizadeh
32*93da997eSAli Mashtizadeh #include <string>
33*93da997eSAli Mashtizadeh #include <unordered_set>
34*93da997eSAli Mashtizadeh
35*93da997eSAli Mashtizadeh #include "util.hh"
36*93da997eSAli Mashtizadeh
37*93da997eSAli Mashtizadeh std::string
basename(const std::string & path)38*93da997eSAli Mashtizadeh basename(const std::string &path)
39*93da997eSAli Mashtizadeh {
40*93da997eSAli Mashtizadeh size_t s;
41*93da997eSAli Mashtizadeh
42*93da997eSAli Mashtizadeh s = path.rfind("/");
43*93da997eSAli Mashtizadeh if (s == std::string::npos)
44*93da997eSAli Mashtizadeh return (path);
45*93da997eSAli Mashtizadeh else
46*93da997eSAli Mashtizadeh return (path.substr(s + 1));
47*93da997eSAli Mashtizadeh }
48*93da997eSAli Mashtizadeh
49*93da997eSAli Mashtizadeh void
split_and_insert(std::unordered_set<int> * set,const std::string & str)50*93da997eSAli Mashtizadeh split_and_insert(std::unordered_set<int> *set, const std::string &str)
51*93da997eSAli Mashtizadeh {
52*93da997eSAli Mashtizadeh size_t pos = 0;
53*93da997eSAli Mashtizadeh
54*93da997eSAli Mashtizadeh while (pos < str.length()) {
55*93da997eSAli Mashtizadeh size_t end = str.find(",", pos);
56*93da997eSAli Mashtizadeh if (end == str.npos) {
57*93da997eSAli Mashtizadeh set->insert(std::stoi(str.substr(pos)));
58*93da997eSAli Mashtizadeh break;
59*93da997eSAli Mashtizadeh }
60*93da997eSAli Mashtizadeh
61*93da997eSAli Mashtizadeh set->insert(std::stoi(str.substr(pos, end - pos)));
62*93da997eSAli Mashtizadeh pos = end + 1;
63*93da997eSAli Mashtizadeh }
64*93da997eSAli Mashtizadeh }
65*93da997eSAli Mashtizadeh
66*93da997eSAli Mashtizadeh void
split_and_insert(std::unordered_set<std::string> * set,const std::string & str)67*93da997eSAli Mashtizadeh split_and_insert(std::unordered_set<std::string> *set, const std::string &str)
68*93da997eSAli Mashtizadeh {
69*93da997eSAli Mashtizadeh size_t pos = 0;
70*93da997eSAli Mashtizadeh
71*93da997eSAli Mashtizadeh while (pos < str.length()) {
72*93da997eSAli Mashtizadeh size_t end = str.find(",", pos);
73*93da997eSAli Mashtizadeh if (end == str.npos) {
74*93da997eSAli Mashtizadeh set->insert(str.substr(pos));
75*93da997eSAli Mashtizadeh break;
76*93da997eSAli Mashtizadeh }
77*93da997eSAli Mashtizadeh
78*93da997eSAli Mashtizadeh set->insert(str.substr(pos, end - pos));
79*93da997eSAli Mashtizadeh pos = end + 1;
80*93da997eSAli Mashtizadeh }
81*93da997eSAli Mashtizadeh }
82*93da997eSAli Mashtizadeh
83