69 constexpr int n=
N_ - 1;
70 for (
int i= 0; i < n; i++)
104 int i, h= 0, n=
N (s);
105 for (i= 0; i < n; i++) {
106 h= (h << 9) + (h >> 23);
177string_u16&
operator<< (string_u16& a, string_u16
b);
182string_u16
copy (string_u16 a);
int hash(pointer ptr)
Computes a hash value for a pointer.
#define CONCRETE_CODE(PTR)
Macro used to define the implementation of a concrete smart pointer.
The list class represents a linked list.
void resize(int n)
expand (or shrink) string to given length n, and try to release memory when string is shrinked.
void reserve(int n)
reserve memory space to contain at least n word in the whole string. Do not affect length of string,...
int expand_or_shrink_by(int delta)
expand (or shrink) string by delta, but do not release memory when string is shrinked.
friend int N(string_u16 a)
string_u16_view operator()(int start, int end)
string_u16(const char16_t(&s)[N_])
char16_t * buffer(int size)
char16_t & operator[](int i)
void tm_delete_array(C *Ptr)
bool operator!=(lolly_tree< T > t, int lab)
bool operator<(string_u16 a, string_u16 b)
lolly_tree< T > operator*(lolly_tree< T > t1, lolly_tree< T > t2)
lolly_tree< T > copy(lolly_tree< T > t)
lolly_tree< T > & operator<<(lolly_tree< T > &t, lolly_tree< T > t2)
bool operator==(lolly_tree< T > t, int lab)
bool operator<=(string_u16 a, string_u16 b)
lolly::data::string_view< char16_t > string_u16_view
Structure representing a concrete object with a reference count.
url delta(url base, url u)