The Perl and Raku Conference 2025: Greenville, South Carolina - June 27-29 Learn more

SYBER / XS-libpanda-1.5.3 / clib / src / panda / string_set.h 

            

              
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163

              
#pragma once
#include "string.h"
#include "string_view.h"
#include <set>
#include <memory>
#include <functional>
/*
 * panda::string_set and panda::string_multiset are wrappers around STL's versions in case if keys are panda::string.
 * The goal is to make it possible to call some STL's methods with string_view
 */
namespace panda {
    template <class Key, class Compare = std::less<Key>, class Allocator = std::allocator<Key>>
    class string_set : public std::set<Key, Compare, Allocator> {
    private:
        template <typename C, typename T, typename A>
        static inline std::true_type  _is_base_string (panda::basic_string<C,T,A> const volatile) { return std::true_type(); }
        static inline std::false_type _is_base_string (...) { return std::false_type(); }
        static_assert(decltype(_is_base_string(Key()))::value, "Key must be based on panda::basic_string");
        using Base  = std::set<Key, Compare, Allocator>;
        using SVKey = basic_string_view<typename Key::value_type, typename Key::traits_type>;
        static Key _key_from_sv (const SVKey& key) {
            typedef typename Key::value_type FakeCharLiteral[1];
            Key tmp(*(const FakeCharLiteral*)key.data());
            tmp.length(key.length());
            return tmp;
        }
    public:
        using typename Base::key_type;
        using typename Base::value_type;
        using typename Base::size_type;
        using typename Base::difference_type;
        using typename Base::key_compare;
        using typename Base::allocator_type;
        using typename Base::reference;
        using typename Base::const_reference;
        using typename Base::pointer;
        using typename Base::const_pointer;
        using typename Base::iterator;
        using typename Base::const_iterator;
        using typename Base::reverse_iterator;
        using typename Base::const_reverse_iterator;
        using Base::Base;
        using Base::find;
        using Base::count;
        using Base::erase;
        using Base::equal_range;
        using Base::lower_bound;
        using Base::upper_bound;
        template <class X, typename = typename std::enable_if<std::is_same<X,SVKey>::value>::type>
        iterator find (X key) { return find(_key_from_sv(key)); }
        template <class X, typename = typename std::enable_if<std::is_same<X,SVKey>::value>::type>
        const_iterator find (X key) const { return find(_key_from_sv(key)); }
        template <class X, typename = typename std::enable_if<std::is_same<X,SVKey>::value>::type>
        size_type count (X key) const { return count(_key_from_sv(key)); }
        template <class X, typename = typename std::enable_if<std::is_same<X,SVKey>::value>::type>
        size_type erase (X key) { return erase(_key_from_sv(key)); }
        template <class X, typename = typename std::enable_if<std::is_same<X,SVKey>::value>::type>
        std::pair<iterator,iterator> equal_range (X key) { return equal_range(_key_from_sv(key)); }
        template <class X, typename = typename std::enable_if<std::is_same<X,SVKey>::value>::type>
        std::pair<const_iterator,const_iterator> equal_range (X key) const { return equal_range(_key_from_sv(key)); }
        template <class X, typename = typename std::enable_if<std::is_same<X,SVKey>::value>::type>
        iterator lower_bound (X key) { return lower_bound(_key_from_sv(key)); }
        template <class X, typename = typename std::enable_if<std::is_same<X,SVKey>::value>::type>
        const_iterator lower_bound (X key) const { return lower_bound(_key_from_sv(key)); }
        template <class X, typename = typename std::enable_if<std::is_same<X,SVKey>::value>::type>
        iterator upper_bound (X key) { return upper_bound(_key_from_sv(key)); }
        template <class X, typename = typename std::enable_if<std::is_same<X,SVKey>::value>::type>
        const_iterator upper_bound (X key) const { return upper_bound(_key_from_sv(key)); }
    };
    template <class Key, class Compare = std::less<Key>, class Allocator = std::allocator<Key>>
    class string_multiset : public std::multiset<Key, Compare, Allocator> {
    private:
        template <typename C, typename T, typename A>
        static inline std::true_type  _is_base_string (panda::basic_string<C,T,A> const volatile) { return std::true_type(); }
        static inline std::false_type _is_base_string (...) { return std::false_type(); }
        static_assert(decltype(_is_base_string(Key()))::value, "Key must be based on panda::basic_string");
        using Base  = std::multiset<Key, Compare, Allocator>;
        using SVKey = basic_string_view<typename Key::value_type, typename Key::traits_type>;
        static Key _key_from_sv (const SVKey& key) {
            typedef typename Key::value_type FakeCharLiteral[1];
            Key tmp(*(const FakeCharLiteral*)key.data());
            tmp.length(key.length());
            return tmp;
        }
    public:
        using typename Base::key_type;
        using typename Base::value_type;
        using typename Base::size_type;
        using typename Base::difference_type;
        using typename Base::key_compare;
        using typename Base::allocator_type;
        using typename Base::reference;
        using typename Base::const_reference;
        using typename Base::pointer;
        using typename Base::const_pointer;
        using typename Base::iterator;
        using typename Base::const_iterator;
        using typename Base::reverse_iterator;
        using typename Base::const_reverse_iterator;
        using Base::Base;
        using Base::find;
        using Base::count;
        using Base::erase;
        using Base::equal_range;
        using Base::lower_bound;
        using Base::upper_bound;
        template <class X, typename = typename std::enable_if<std::is_same<X,SVKey>::value>::type>
        iterator find (X key) { return find(_key_from_sv(key)); }
        template <class X, typename = typename std::enable_if<std::is_same<X,SVKey>::value>::type>
        const_iterator find (X key) const { return find(_key_from_sv(key)); }
        template <class X, typename = typename std::enable_if<std::is_same<X,SVKey>::value>::type>
        size_type count (X key) const { return count(_key_from_sv(key)); }
        template <class X, typename = typename std::enable_if<std::is_same<X,SVKey>::value>::type>
        size_type erase (X key) { return erase(_key_from_sv(key)); }
        template <class X, typename = typename std::enable_if<std::is_same<X,SVKey>::value>::type>
        std::pair<iterator,iterator> equal_range (X key) { return equal_range(_key_from_sv(key)); }
        template <class X, typename = typename std::enable_if<std::is_same<X,SVKey>::value>::type>
        std::pair<const_iterator,const_iterator> equal_range (X key) const { return equal_range(_key_from_sv(key)); }
        template <class X, typename = typename std::enable_if<std::is_same<X,SVKey>::value>::type>
        iterator lower_bound (X key) { return lower_bound(_key_from_sv(key)); }
        template <class X, typename = typename std::enable_if<std::is_same<X,SVKey>::value>::type>
        const_iterator lower_bound (X key) const { return lower_bound(_key_from_sv(key)); }
        template <class X, typename = typename std::enable_if<std::is_same<X,SVKey>::value>::type>
        iterator upper_bound (X key) { return upper_bound(_key_from_sv(key)); }
        template <class X, typename = typename std::enable_if<std::is_same<X,SVKey>::value>::type>
        const_iterator upper_bound (X key) const { return upper_bound(_key_from_sv(key)); }
    };
}