2024-06-03 16:09:33 +00:00
|
|
|
// -*- mode:c++; indent-tabs-mode:nil; c-basic-offset:4; coding:utf-8 -*-
|
2024-06-06 01:30:39 +00:00
|
|
|
// vi: set et ft=cpp ts=4 sts=4 sw=4 fenc=utf-8 :vi
|
2024-06-03 16:09:33 +00:00
|
|
|
//
|
|
|
|
// Copyright 2024 Justine Alexandra Roberts Tunney
|
|
|
|
//
|
|
|
|
// Permission to use, copy, modify, and/or distribute this software for
|
|
|
|
// any purpose with or without fee is hereby granted, provided that the
|
|
|
|
// above copyright notice and this permission notice appear in all copies.
|
|
|
|
//
|
|
|
|
// THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
|
|
|
|
// WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
|
|
|
|
// WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE
|
|
|
|
// AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
|
|
|
|
// DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
|
|
|
|
// PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
|
|
|
|
// TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
|
|
|
|
// PERFORMANCE OF THIS SOFTWARE.
|
|
|
|
|
2024-06-29 02:07:35 +00:00
|
|
|
#include "ctl/is_same.h"
|
2024-06-03 16:09:33 +00:00
|
|
|
#include "ctl/string.h"
|
2024-06-23 17:08:48 +00:00
|
|
|
#include "libc/mem/leaks.h"
|
2024-06-03 16:09:33 +00:00
|
|
|
|
|
|
|
#include "libc/str/str.h"
|
|
|
|
|
|
|
|
// #include <string>
|
2024-06-29 02:07:35 +00:00
|
|
|
// #include <utility>
|
2024-06-20 18:52:12 +00:00
|
|
|
// #define ctl std
|
|
|
|
|
|
|
|
using String = ctl::string;
|
|
|
|
|
|
|
|
#undef ctl
|
|
|
|
|
|
|
|
inline bool
|
|
|
|
issmall(const String& s)
|
|
|
|
{
|
|
|
|
return s.capacity() == sizeof(s) &&
|
|
|
|
s.data() == reinterpret_cast<const char*>(&s);
|
|
|
|
}
|
2024-06-03 16:09:33 +00:00
|
|
|
|
|
|
|
int
|
2024-06-04 12:41:53 +00:00
|
|
|
main()
|
2024-06-03 16:09:33 +00:00
|
|
|
{
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String s;
|
2024-06-03 16:09:33 +00:00
|
|
|
s += 'h';
|
|
|
|
s += 'i';
|
|
|
|
if (s != "hi")
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String s;
|
2024-06-03 16:09:33 +00:00
|
|
|
if (!s.empty())
|
|
|
|
return 6;
|
|
|
|
s.reserve(32);
|
|
|
|
if (!s.empty())
|
|
|
|
return 7;
|
|
|
|
if (!s.starts_with(""))
|
|
|
|
return 8;
|
|
|
|
if (s.starts_with("a"))
|
|
|
|
return 9;
|
|
|
|
s += "abc";
|
|
|
|
if (!s.starts_with("a"))
|
|
|
|
return 10;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String s;
|
2024-06-03 16:09:33 +00:00
|
|
|
s += "hello world how are you";
|
|
|
|
s.reserve(3);
|
|
|
|
if (s != "hello world how are you")
|
|
|
|
return 11;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String s(4, 'x');
|
2024-06-03 16:09:33 +00:00
|
|
|
if (s != "xxxx")
|
|
|
|
return 12;
|
|
|
|
s.resize(3);
|
|
|
|
if (s != "xxx")
|
|
|
|
return 13;
|
|
|
|
s.resize(4, 'y');
|
|
|
|
if (s != "xxxy")
|
|
|
|
return 14;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String a = "a";
|
|
|
|
String b = "a";
|
2024-06-03 16:09:33 +00:00
|
|
|
if (a.compare(b) != 0)
|
|
|
|
return 17;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String a = "a";
|
|
|
|
String b = "b";
|
2024-06-03 16:09:33 +00:00
|
|
|
if (a.compare(b) >= 0)
|
|
|
|
return 18;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String a = "a";
|
|
|
|
String b = "ab";
|
2024-06-03 16:09:33 +00:00
|
|
|
if (a.compare(b) >= 0)
|
|
|
|
return 19;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String a = "ab";
|
|
|
|
String b = "a";
|
2024-06-03 16:09:33 +00:00
|
|
|
if (a.compare(b) <= 0)
|
|
|
|
return 20;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String a = "";
|
|
|
|
String b = "";
|
2024-06-03 16:09:33 +00:00
|
|
|
if (a.compare(b) != 0)
|
|
|
|
return 21;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String a = "fooBARbaz";
|
2024-06-03 16:09:33 +00:00
|
|
|
if (a.substr(3, 3) != "BAR")
|
|
|
|
return 22;
|
|
|
|
if (a.replace(3, 3, "MOO") != "fooMOObaz")
|
|
|
|
return 23;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String a = "fooBAR";
|
2024-06-03 16:09:33 +00:00
|
|
|
if (a.substr(3, 3) != "BAR")
|
|
|
|
return 24;
|
|
|
|
if (a.replace(3, 3, "MOO") != "fooMOO")
|
|
|
|
return 25;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String a = "fooBAR";
|
2024-06-03 16:09:33 +00:00
|
|
|
if (a.substr(1, 0) != "")
|
|
|
|
return 26;
|
|
|
|
if (a.replace(1, 0, "MOO") != "fMOOooBAR")
|
|
|
|
return 27;
|
|
|
|
if (!a.starts_with("fMOOooBAR"))
|
|
|
|
return 28;
|
|
|
|
if (!a.ends_with(""))
|
|
|
|
return 29;
|
|
|
|
if (!a.ends_with("BAR"))
|
|
|
|
return 30;
|
|
|
|
if (a.ends_with("bar"))
|
|
|
|
return 31;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String s1 = "hello";
|
|
|
|
String s2 = "world";
|
|
|
|
String s3 = s1 + " " + s2;
|
2024-06-03 16:09:33 +00:00
|
|
|
if (s3 != "hello world")
|
|
|
|
return 32;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String s = "hello";
|
2024-06-03 16:09:33 +00:00
|
|
|
if (s.size() != 5)
|
|
|
|
return 33;
|
|
|
|
if (s.length() != 5)
|
|
|
|
return 34;
|
|
|
|
if (s.capacity() < 5)
|
|
|
|
return 35;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String s = "hello";
|
2024-06-03 16:09:33 +00:00
|
|
|
if (s[0] != 'h' || s[1] != 'e' || s[2] != 'l' || s[3] != 'l' ||
|
|
|
|
s[4] != 'o')
|
|
|
|
return 36;
|
|
|
|
s[0] = 'H';
|
|
|
|
if (s != "Hello")
|
|
|
|
return 37;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String s = "hello";
|
2024-06-03 16:09:33 +00:00
|
|
|
if (s.find('e') != 1)
|
|
|
|
return 38;
|
|
|
|
if (s.find('l') != 2)
|
|
|
|
return 39;
|
2024-06-10 14:00:37 +00:00
|
|
|
if (s.find('x') != s.npos)
|
2024-06-03 16:09:33 +00:00
|
|
|
return 40;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String s = "hello";
|
2024-06-03 16:09:33 +00:00
|
|
|
if (!s.ends_with("lo"))
|
|
|
|
return 41;
|
|
|
|
if (s.ends_with("el"))
|
|
|
|
return 42;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String s = "hello";
|
|
|
|
String sub = s.substr(1, 3);
|
2024-06-03 16:09:33 +00:00
|
|
|
if (sub != "ell")
|
|
|
|
return 43;
|
|
|
|
sub = s.substr(2);
|
|
|
|
if (sub != "llo")
|
|
|
|
return 44;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String s = "hello";
|
|
|
|
String s2 = s;
|
2024-06-03 16:09:33 +00:00
|
|
|
if (s != s2)
|
|
|
|
return 45;
|
|
|
|
s2[0] = 'H';
|
|
|
|
if (s == s2)
|
|
|
|
return 46;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String s = "hello";
|
2024-06-19 05:00:59 +00:00
|
|
|
String s2 = ctl::move(s);
|
2024-06-03 16:09:33 +00:00
|
|
|
if (s2 != "hello")
|
|
|
|
return 47;
|
|
|
|
if (!s.empty())
|
|
|
|
return 48;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String s = "hello";
|
2024-06-03 16:09:33 +00:00
|
|
|
const char* cstr = s.c_str();
|
|
|
|
if (strcmp(cstr, "hello") != 0)
|
|
|
|
return 49;
|
|
|
|
}
|
|
|
|
|
|
|
|
// {
|
2024-06-10 14:00:37 +00:00
|
|
|
// String s = "hello";
|
2024-06-03 16:09:33 +00:00
|
|
|
// char buffer[10];
|
|
|
|
// s.copy(buffer, sizeof(buffer));
|
|
|
|
// if (strcmp(buffer, "hello") != 0)
|
|
|
|
// return 50;
|
|
|
|
// }
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String s = "hello";
|
2024-06-03 16:09:33 +00:00
|
|
|
s.resize(3);
|
|
|
|
if (s != "hel")
|
|
|
|
return 51;
|
|
|
|
s.resize(10, 'x');
|
|
|
|
if (s != "helxxxxxxx")
|
|
|
|
return 52;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String s = "hello";
|
2024-06-03 16:09:33 +00:00
|
|
|
s.clear();
|
|
|
|
if (!s.empty())
|
|
|
|
return 53;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String s = "hello";
|
2024-06-03 16:09:33 +00:00
|
|
|
auto it = s.begin();
|
|
|
|
if (*it != 'h')
|
|
|
|
return 54;
|
|
|
|
++it;
|
|
|
|
if (*it != 'e')
|
|
|
|
return 55;
|
|
|
|
}
|
|
|
|
|
2024-06-11 04:51:19 +00:00
|
|
|
{
|
|
|
|
String s = "hello";
|
|
|
|
String s2 = "world";
|
|
|
|
s.swap(s2);
|
|
|
|
if (s != "world" || s2 != "hello")
|
|
|
|
return 56;
|
|
|
|
}
|
2024-06-03 16:09:33 +00:00
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String s = "hello";
|
2024-06-03 16:09:33 +00:00
|
|
|
if (s.front() != 'h' || s.back() != 'o')
|
|
|
|
return 57;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String s = "hello";
|
2024-06-03 16:09:33 +00:00
|
|
|
s.push_back('!');
|
|
|
|
if (s != "hello!")
|
|
|
|
return 58;
|
|
|
|
s.pop_back();
|
|
|
|
if (s != "hello")
|
|
|
|
return 59;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String s = "hello";
|
2024-06-03 16:09:33 +00:00
|
|
|
s.insert(2, "XYZ");
|
|
|
|
if (s != "heXYZllo")
|
|
|
|
return 60;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String s = "hello";
|
2024-06-03 16:09:33 +00:00
|
|
|
s.erase(1, 2);
|
|
|
|
if (s != "hlo")
|
|
|
|
return 61;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String s = "hello";
|
2024-06-03 16:09:33 +00:00
|
|
|
s.replace(1, 2, "XYZ");
|
|
|
|
if (s != "hXYZlo")
|
|
|
|
return 62;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String s = "hello";
|
2024-06-03 16:09:33 +00:00
|
|
|
s.append(" world");
|
|
|
|
if (s != "hello world")
|
|
|
|
return 63;
|
ctl::string small-string optimization (#1199)
A small-string optimization is a way of reusing inline storage space for
sufficiently small strings, rather than allocating them on the heap. The
current approach takes after an old Facebook string class: it reuses the
highest-order byte for flags and small-string size, in such a way that a
maximally-sized small string will have its last byte zeroed, making it a
null terminator for the C string.
The only flag we have is in the highest-order bit, that says whether the
string is big (set) or small (cleared.) Most of the logic switches based
on the value of this bit; e.g. data() returns big()->p if it's set, else
small()->buf if it's cleared. For a small string, the capacity is always
fixed at sizeof(string) - 1 bytes; we store the length in the last byte,
but we store it as the number of remaining bytes of capacity, so that at
max size, the last byte will read zero and serve as our null terminator.
Morally speaking, our class's storage is a union over two POD C structs.
For now I gravitated towards a slightly more obtuse approach: the string
class itself contains a blob of the right size, and we alias that blob's
pointer for the two structs, taking some care not to run afoul of object
lifetime rules in C++. If anyone wants to improve on this, contributions
are welcome.
This commit also introduces the `ctl::__` namespace. It can't be legally
spelled by library users, and serves as our version of boost's "detail".
We introduced a string::swap function, and we now use that in operator=.
operator= now takes its argument by value, so we never need to check for
the case where the pointers are equal and can just swap the entire store
of the argument with our own, leaving the C++ destructor to free our old
storage afterwards.
There are probably still a few places where our capacity is slightly off
and we grow too fast, although there don't appear to be any where we are
too slow. I will leave these to be fixed in future changes.
2024-06-07 00:50:51 +00:00
|
|
|
for (int i = 0; i < 10; ++i) {
|
|
|
|
s.append(" world");
|
|
|
|
}
|
|
|
|
if (s != "hello world world world world world world world world world "
|
2024-06-07 05:15:37 +00:00
|
|
|
"world world") {
|
ctl::string small-string optimization (#1199)
A small-string optimization is a way of reusing inline storage space for
sufficiently small strings, rather than allocating them on the heap. The
current approach takes after an old Facebook string class: it reuses the
highest-order byte for flags and small-string size, in such a way that a
maximally-sized small string will have its last byte zeroed, making it a
null terminator for the C string.
The only flag we have is in the highest-order bit, that says whether the
string is big (set) or small (cleared.) Most of the logic switches based
on the value of this bit; e.g. data() returns big()->p if it's set, else
small()->buf if it's cleared. For a small string, the capacity is always
fixed at sizeof(string) - 1 bytes; we store the length in the last byte,
but we store it as the number of remaining bytes of capacity, so that at
max size, the last byte will read zero and serve as our null terminator.
Morally speaking, our class's storage is a union over two POD C structs.
For now I gravitated towards a slightly more obtuse approach: the string
class itself contains a blob of the right size, and we alias that blob's
pointer for the two structs, taking some care not to run afoul of object
lifetime rules in C++. If anyone wants to improve on this, contributions
are welcome.
This commit also introduces the `ctl::__` namespace. It can't be legally
spelled by library users, and serves as our version of boost's "detail".
We introduced a string::swap function, and we now use that in operator=.
operator= now takes its argument by value, so we never need to check for
the case where the pointers are equal and can just swap the entire store
of the argument with our own, leaving the C++ destructor to free our old
storage afterwards.
There are probably still a few places where our capacity is slightly off
and we grow too fast, although there don't appear to be any where we are
too slow. I will leave these to be fixed in future changes.
2024-06-07 00:50:51 +00:00
|
|
|
return 64;
|
|
|
|
}
|
2024-06-03 16:09:33 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// {
|
2024-06-10 14:00:37 +00:00
|
|
|
// String s = "hello";
|
2024-06-03 16:09:33 +00:00
|
|
|
// s.assign("world");
|
|
|
|
// if (s != "world")
|
|
|
|
// return 64;
|
|
|
|
// }
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String s = "hello";
|
2024-06-03 16:09:33 +00:00
|
|
|
if (s.compare("world") >= 0)
|
|
|
|
return 65;
|
|
|
|
if (s.compare("hello") != 0)
|
|
|
|
return 66;
|
|
|
|
if (s.compare("hallo") <= 0)
|
|
|
|
return 67;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String s = "hello";
|
2024-06-03 16:09:33 +00:00
|
|
|
if (s == "world")
|
|
|
|
return 68;
|
|
|
|
if (s != "hello")
|
|
|
|
return 69;
|
|
|
|
if (s < "hallo")
|
|
|
|
return 70;
|
|
|
|
if (s > "world")
|
|
|
|
return 71;
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
|
|
|
if ("hello"s != "hello")
|
|
|
|
return 77;
|
|
|
|
if ("hell"s + "o" != "hello")
|
|
|
|
return 78;
|
|
|
|
}
|
|
|
|
|
2024-06-07 05:15:37 +00:00
|
|
|
{
|
2024-06-10 14:00:37 +00:00
|
|
|
String s;
|
Introduce more CTL content
This change introduces accumulate, addressof, advance, all_of, distance,
array, enable_if, allocator_traits, back_inserter, bad_alloc, is_signed,
any_of, copy, exception, fill, fill_n, is_same, is_same_v, out_of_range,
lexicographical_compare, is_integral, uninitialized_fill_n, is_unsigned,
numeric_limits, uninitialized_fill, iterator_traits, move_backward, min,
max, iterator_tag, move_iterator, reverse_iterator, uninitialized_move_n
This change experiments with rewriting the ctl::vector class to make the
CTL design more similar to the STL. So far it has not slowed things down
to have 42 #include lines rather than 2, since it's still almost nothing
compared to LLVM's code. In fact the closer we can flirt with being just
like libcxx, the better chance we might have of discovering exactly what
makes it so slow to compile. It would be an enormous discovery if we can
find one simple trick to solving the issue there instead.
This also fixes a bug in `ctl::string(const string &s)` when `s` is big.
2024-06-28 05:18:55 +00:00
|
|
|
if constexpr (ctl::is_same_v<ctl::string, decltype(s)>) {
|
2024-06-07 05:15:37 +00:00
|
|
|
// tests the small-string optimization on ctl::string
|
|
|
|
for (int i = 0; i < 23; ++i) {
|
|
|
|
s.append("a");
|
2024-06-20 18:52:12 +00:00
|
|
|
if (!issmall(s)) {
|
2024-06-07 05:15:37 +00:00
|
|
|
return 79 + i;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
s.append("a");
|
2024-06-20 18:52:12 +00:00
|
|
|
if (issmall(s)) {
|
2024-06-07 05:15:37 +00:00
|
|
|
return 103;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// just check that append in a loop works
|
|
|
|
for (int i = 0; i < 24; ++i) {
|
|
|
|
s.append("a");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (s != "aaaaaaaaaaaaaaaaaaaaaaaa") {
|
|
|
|
return 104;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2024-06-20 18:52:12 +00:00
|
|
|
{
|
|
|
|
String s("arst", 4);
|
|
|
|
for (int i = 0; i < 30; ++i) {
|
|
|
|
s.append("a");
|
|
|
|
}
|
|
|
|
s.resize(4);
|
|
|
|
if (s != "arst")
|
|
|
|
return 105;
|
Introduce more CTL content
This change introduces accumulate, addressof, advance, all_of, distance,
array, enable_if, allocator_traits, back_inserter, bad_alloc, is_signed,
any_of, copy, exception, fill, fill_n, is_same, is_same_v, out_of_range,
lexicographical_compare, is_integral, uninitialized_fill_n, is_unsigned,
numeric_limits, uninitialized_fill, iterator_traits, move_backward, min,
max, iterator_tag, move_iterator, reverse_iterator, uninitialized_move_n
This change experiments with rewriting the ctl::vector class to make the
CTL design more similar to the STL. So far it has not slowed things down
to have 42 #include lines rather than 2, since it's still almost nothing
compared to LLVM's code. In fact the closer we can flirt with being just
like libcxx, the better chance we might have of discovering exactly what
makes it so slow to compile. It would be an enormous discovery if we can
find one simple trick to solving the issue there instead.
This also fixes a bug in `ctl::string(const string &s)` when `s` is big.
2024-06-28 05:18:55 +00:00
|
|
|
if constexpr (ctl::is_same_v<ctl::string, decltype(s)>) {
|
2024-06-20 18:52:12 +00:00
|
|
|
String r(s);
|
|
|
|
if (issmall(s) || !issmall(r))
|
|
|
|
return 106;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2024-06-03 16:09:33 +00:00
|
|
|
CheckForMemoryLeaks();
|
|
|
|
}
|