summaryrefslogtreecommitdiffhomepage
path: root/dev/kernel/NeKit/KString.inl
blob: 1faefb0896d40f33d7075a56d72e40c9139f108c (plain)
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
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
/* -------------------------------------------

  Copyright (C) 2024-2025, Amlal El Mahrouss, all rights reserved.

------------------------------------------- */

#include <NeKit/Utils.h>

/// @file BasicKString<>.cc
/// @brief Kernel String manipulation file.

namespace Kernel {
inline void rt_string_append(Char* lhs, const Char* rhs, Int32 cur) {
  SizeT sz_rhs = rt_string_len(rhs);
  SizeT rhs_i  = 0;

  for (; rhs_i < sz_rhs; ++rhs_i) {
    lhs[rhs_i + cur] = rhs[rhs_i];
  }
}

template <>
inline Char* BasicKString<>::Data() {
  return this->fData;
}

template <>
inline const Char* BasicKString<>::CData() const {
  return const_cast<const Char*>(this->fData);
}

template <>
inline SizeT BasicKString<>::Length() const {
  return this->fDataSz;
}

template <>
inline bool BasicKString<>::operator==(const BasicKString<>& rhs) const {
  if (rhs.Length() != this->Length()) return false;

  for (Size index = 0; index < this->Length(); ++index) {
    if (rhs.fData[index] != this->fData[index]) return false;
  }

  return true;
}

template <>
inline bool BasicKString<>::operator==(const Char* rhs) const {
  if (rt_string_len(rhs) != this->Length()) return false;

  for (Size index = 0; index < rt_string_len(rhs); ++index) {
    if (rhs[index] != this->fData[index]) return false;
  }

  return true;
}

template <>
inline bool BasicKString<>::operator!=(const BasicKString<>& rhs) const {
  if (rhs.Length() != this->Length()) return false;

  for (Size index = 0; index < rhs.Length(); ++index) {
    if (rhs.fData[index] == this->fData[index]) return false;
  }

  return true;
}

template <>
inline bool BasicKString<>::operator!=(const Char* rhs) const {
  if (rt_string_len(rhs) != this->Length()) return false;

  for (Size index = 0; index < rt_string_len(rhs); ++index) {
    if (rhs[index] == this->fData[index]) return false;
  }

  return true;
}

template <>
inline BasicKString<>& BasicKString<>::operator+=(const BasicKString<>& rhs) {
  if (rt_string_len(rhs.fData) > this->Length()) return *this;

  rt_string_append(this->fData, const_cast<Char*>(rhs.fData), this->fCur);
  this->fCur += rt_string_len(const_cast<Char*>(rhs.fData));

  return *this;
}

template <>
inline BasicKString<>& BasicKString<>::operator+=(const Char* rhs) {
  rt_string_append(this->fData, const_cast<Char*>(rhs), this->fCur);
  this->fCur += rt_string_len(const_cast<Char*>(rhs));

  return *this;
}

inline ErrorOr<BasicKString<>> KStringBuilder::Construct(const Char* data) {
  if (!data || *data == 0) return ErrorOr<BasicKString<>>(new BasicKString<>(0));

  BasicKString<>* view = new BasicKString<>(rt_string_len(data));
  (*view) += data;

  return ErrorOr<BasicKString<>>(*view);
}

inline const Char* KStringBuilder::FromBool(const Char* fmt, bool i) {
  if (!fmt) return ("?");

  const Char* boolean_expr = i ? "YES" : "NO";
  Char*       ret          = (Char*) RTL_ALLOCA(rt_string_len(boolean_expr) + rt_string_len(fmt));

  if (!ret) return ("?");

  const auto fmt_len = rt_string_len(fmt);
  const auto res_len = rt_string_len(boolean_expr);

  for (Size idx = 0; idx < fmt_len; ++idx) {
    if (fmt[idx] == '%') {
      SizeT result_cnt = idx;

      for (auto y_idx = idx; y_idx < res_len; ++y_idx) {
        ret[result_cnt] = boolean_expr[y_idx];
        ++result_cnt;
      }

      break;
    }

    ret[idx] = fmt[idx];
  }

  return ret;
}

inline bool KStringBuilder::Equals(const Char* lhs, const Char* rhs) {
  if (rt_string_len(rhs) != rt_string_len(lhs)) return false;

  for (Size index = 0; index < rt_string_len(rhs); ++index) {
    if (rhs[index] != lhs[index]) return false;
  }

  return true;
}

inline bool KStringBuilder::Equals(const Utf8Char* lhs, const Utf8Char* rhs) {
  if (urt_string_len(rhs) != urt_string_len(lhs)) return false;

  for (Size index = 0; rhs[index] != 0; ++index) {
    if (rhs[index] != lhs[index]) return false;
  }

  return true;
}

inline const Char* KStringBuilder::Format(const Char* fmt, const Char* fmt2) {
  if (!fmt || !fmt2) return ("?");

  Char* ret = (Char*) RTL_ALLOCA(sizeof(char) * (rt_string_len(fmt2) + rt_string_len(fmt)));

  if (!ret) return ("?");

  const auto len = rt_string_len(fmt);

  for (Size idx = 0; idx < len; ++idx) {
    if (fmt[idx] == '%' && idx < rt_string_len(fmt) && fmt[idx] == 's') {
      Size result_cnt = idx;

      for (Size y_idx = 0; y_idx < rt_string_len(fmt2); ++y_idx) {
        ret[result_cnt] = fmt2[y_idx];
        ++result_cnt;
      }
    }

    ret[idx] = fmt[idx];
  }

  return ret;
}
}  // namespace Kernel