2023-01-05 20:25:55 +08:00
|
|
|
/**************************************************************************/
|
|
|
|
/* optimized_translation.cpp */
|
|
|
|
/**************************************************************************/
|
|
|
|
/* This file is part of: */
|
|
|
|
/* GODOT ENGINE */
|
|
|
|
/* https://godotengine.org */
|
|
|
|
/**************************************************************************/
|
|
|
|
/* Copyright (c) 2014-present Godot Engine contributors (see AUTHORS.md). */
|
|
|
|
/* Copyright (c) 2007-2014 Juan Linietsky, Ariel Manzur. */
|
|
|
|
/* */
|
|
|
|
/* Permission is hereby granted, free of charge, to any person obtaining */
|
|
|
|
/* a copy of this software and associated documentation files (the */
|
|
|
|
/* "Software"), to deal in the Software without restriction, including */
|
|
|
|
/* without limitation the rights to use, copy, modify, merge, publish, */
|
|
|
|
/* distribute, sublicense, and/or sell copies of the Software, and to */
|
|
|
|
/* permit persons to whom the Software is furnished to do so, subject to */
|
|
|
|
/* the following conditions: */
|
|
|
|
/* */
|
|
|
|
/* The above copyright notice and this permission notice shall be */
|
|
|
|
/* included in all copies or substantial portions of the Software. */
|
|
|
|
/* */
|
|
|
|
/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
|
|
|
|
/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
|
|
|
|
/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. */
|
|
|
|
/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
|
|
|
|
/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
|
|
|
|
/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
|
|
|
|
/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
|
|
|
|
/**************************************************************************/
|
2018-01-05 07:50:27 +08:00
|
|
|
|
2021-01-16 23:28:54 +08:00
|
|
|
#include "optimized_translation.h"
|
2017-01-16 15:04:19 +08:00
|
|
|
|
2020-11-08 06:33:38 +08:00
|
|
|
#include "core/templates/pair.h"
|
2014-02-10 09:10:30 +08:00
|
|
|
|
Split thirdparty smaz.c out of compressed_translation.cpp
Code comes from https://github.com/antirez/smaz/blob/150e125cbae2e8fd20dd332432776ce13395d4d4/smaz.c
With a small modification to match Godot expectations:
```
diff --git a/thirdparty/core/smaz.c b/thirdparty/core/smaz.c
index 9b1ebc2..555dfea 100644
--- a/thirdparty/core/smaz.c
+++ b/thirdparty/core/smaz.c
@@ -14,7 +14,7 @@ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
#include <string.h>
/* Our compression codebook, used for compression */
-static char *Smaz_cb[241] = {
+static const char *Smaz_cb[241] = {
"\002s,\266", "\003had\232\002leW", "\003on \216", "", "\001yS",
"\002ma\255\002li\227", "\003or \260", "", "\002ll\230\003s t\277",
"\004fromg\002mel", "", "\003its\332", "\001z\333", "\003ingF", "\001>\336",
@@ -89,7 +89,7 @@ static char *Smaz_rcb[254] = {
"e, ", " it", "whi", " ma", "ge", "x", "e c", "men", ".com"
};
-int smaz_compress(char *in, int inlen, char *out, int outlen) {
+int smaz_compress(const char *in, int inlen, char *out, int outlen) {
unsigned int h1,h2,h3=0;
int verblen = 0, _outlen = outlen;
char verb[256], *_out = out;
@@ -167,7 +167,7 @@ out:
return out-_out;
}
-int smaz_decompress(char *in, int inlen, char *out, int outlen) {
+int smaz_decompress(const char *in, int inlen, char *out, int outlen) {
unsigned char *c = (unsigned char*) in;
char *_out = out;
int _outlen = outlen;
@@ -192,7 +192,7 @@ int smaz_decompress(char *in, int inlen, char *out, int outlen) {
inlen -= 2+len;
} else {
/* Codebook entry */
- char *s = Smaz_rcb[*c];
+ const char *s = Smaz_rcb[*c];
int len = strlen(s);
if (outlen < len) return _outlen+1;
diff --git a/thirdparty/core/smaz.h b/thirdparty/core/smaz.h
index a547d89..a9d8a33 100644
--- a/thirdparty/core/smaz.h
+++ b/thirdparty/core/smaz.h
@@ -14,7 +14,7 @@ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
#ifndef _SMAZ_H
#define _SMAZ_H
-int smaz_compress(char *in, int inlen, char *out, int outlen);
-int smaz_decompress(char *in, int inlen, char *out, int outlen);
+int smaz_compress(const char *in, int inlen, char *out, int outlen);
+int smaz_decompress(const char *in, int inlen, char *out, int outlen);
#endif
```
2017-04-29 01:00:11 +08:00
|
|
|
extern "C" {
|
|
|
|
#include "thirdparty/misc/smaz.h"
|
2014-02-10 09:10:30 +08:00
|
|
|
}
|
|
|
|
|
2021-01-16 23:28:54 +08:00
|
|
|
struct CompressedString {
|
2022-05-02 22:28:25 +08:00
|
|
|
int orig_len = 0;
|
2014-02-10 09:10:30 +08:00
|
|
|
CharString compressed;
|
2022-05-02 22:28:25 +08:00
|
|
|
int offset = 0;
|
2014-02-10 09:10:30 +08:00
|
|
|
};
|
|
|
|
|
2021-01-16 23:28:54 +08:00
|
|
|
void OptimizedTranslation::generate(const Ref<Translation> &p_from) {
|
2020-08-07 19:17:12 +08:00
|
|
|
// This method compresses a Translation instance.
|
2021-03-12 21:35:16 +08:00
|
|
|
// Right now, it doesn't handle context or plurals, so Translation subclasses using plurals or context (i.e TranslationPO) shouldn't be compressed.
|
2014-02-10 09:10:30 +08:00
|
|
|
#ifdef TOOLS_ENABLED
|
2021-05-03 23:40:21 +08:00
|
|
|
ERR_FAIL_COND(p_from.is_null());
|
2014-02-10 09:10:30 +08:00
|
|
|
List<StringName> keys;
|
|
|
|
p_from->get_message_list(&keys);
|
|
|
|
|
|
|
|
int size = Math::larger_prime(keys.size());
|
|
|
|
|
2020-03-17 14:33:00 +08:00
|
|
|
Vector<Vector<Pair<int, CharString>>> buckets;
|
2022-05-13 21:04:37 +08:00
|
|
|
Vector<HashMap<uint32_t, int>> table;
|
2014-02-10 09:10:30 +08:00
|
|
|
Vector<uint32_t> hfunc_table;
|
2021-01-16 23:28:54 +08:00
|
|
|
Vector<CompressedString> compressed;
|
2014-02-10 09:10:30 +08:00
|
|
|
|
|
|
|
table.resize(size);
|
|
|
|
hfunc_table.resize(size);
|
|
|
|
buckets.resize(size);
|
|
|
|
compressed.resize(keys.size());
|
|
|
|
|
|
|
|
int idx = 0;
|
|
|
|
int total_compression_size = 0;
|
|
|
|
|
2021-07-24 21:46:25 +08:00
|
|
|
for (const StringName &E : keys) {
|
2014-02-10 09:10:30 +08:00
|
|
|
//hash string
|
2021-07-16 11:45:57 +08:00
|
|
|
CharString cs = E.operator String().utf8();
|
2014-02-10 09:10:30 +08:00
|
|
|
uint32_t h = hash(0, cs.get_data());
|
|
|
|
Pair<int, CharString> p;
|
|
|
|
p.first = idx;
|
|
|
|
p.second = cs;
|
2018-07-25 09:11:03 +08:00
|
|
|
buckets.write[h % size].push_back(p);
|
2014-02-10 09:10:30 +08:00
|
|
|
|
|
|
|
//compress string
|
2021-07-16 11:45:57 +08:00
|
|
|
CharString src_s = p_from->get_message(E).operator String().utf8();
|
2021-01-16 23:28:54 +08:00
|
|
|
CompressedString ps;
|
2014-02-10 09:10:30 +08:00
|
|
|
ps.orig_len = src_s.size();
|
|
|
|
ps.offset = total_compression_size;
|
|
|
|
|
|
|
|
if (ps.orig_len != 0) {
|
|
|
|
CharString dst_s;
|
|
|
|
dst_s.resize(src_s.size());
|
2018-12-16 08:44:18 +08:00
|
|
|
int ret = smaz_compress(src_s.get_data(), src_s.size(), dst_s.ptrw(), src_s.size());
|
2014-02-10 09:10:30 +08:00
|
|
|
if (ret >= src_s.size()) {
|
|
|
|
//if compressed is larger than original, just use original
|
|
|
|
ps.orig_len = src_s.size();
|
|
|
|
ps.compressed = src_s;
|
|
|
|
} else {
|
|
|
|
dst_s.resize(ret);
|
|
|
|
//ps.orig_len=;
|
|
|
|
ps.compressed = dst_s;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
ps.orig_len = 1;
|
|
|
|
ps.compressed.resize(1);
|
|
|
|
ps.compressed[0] = 0;
|
|
|
|
}
|
|
|
|
|
2018-07-25 09:11:03 +08:00
|
|
|
compressed.write[idx] = ps;
|
2014-02-10 09:10:30 +08:00
|
|
|
total_compression_size += ps.compressed.size();
|
|
|
|
idx++;
|
|
|
|
}
|
|
|
|
|
|
|
|
int bucket_table_size = 0;
|
|
|
|
|
|
|
|
for (int i = 0; i < size; i++) {
|
2020-03-17 14:33:00 +08:00
|
|
|
const Vector<Pair<int, CharString>> &b = buckets[i];
|
2022-05-13 21:04:37 +08:00
|
|
|
HashMap<uint32_t, int> &t = table.write[i];
|
2014-02-10 09:10:30 +08:00
|
|
|
|
2020-05-14 22:41:43 +08:00
|
|
|
if (b.size() == 0) {
|
2014-02-10 09:10:30 +08:00
|
|
|
continue;
|
2020-05-14 22:41:43 +08:00
|
|
|
}
|
2014-02-10 09:10:30 +08:00
|
|
|
|
|
|
|
int d = 1;
|
|
|
|
int item = 0;
|
|
|
|
|
|
|
|
while (item < b.size()) {
|
|
|
|
uint32_t slot = hash(d, b[item].second.get_data());
|
|
|
|
if (t.has(slot)) {
|
|
|
|
item = 0;
|
|
|
|
d++;
|
|
|
|
t.clear();
|
|
|
|
} else {
|
|
|
|
t[slot] = b[item].first;
|
|
|
|
item++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-07-25 09:11:03 +08:00
|
|
|
hfunc_table.write[i] = d;
|
2014-02-10 09:10:30 +08:00
|
|
|
bucket_table_size += 2 + b.size() * 4;
|
|
|
|
}
|
|
|
|
|
2019-10-14 17:40:55 +08:00
|
|
|
ERR_FAIL_COND(bucket_table_size == 0);
|
|
|
|
|
2014-02-10 09:10:30 +08:00
|
|
|
hash_table.resize(size);
|
|
|
|
bucket_table.resize(bucket_table_size);
|
|
|
|
|
2020-02-18 05:06:54 +08:00
|
|
|
int *htwb = hash_table.ptrw();
|
|
|
|
int *btwb = bucket_table.ptrw();
|
2014-02-10 09:10:30 +08:00
|
|
|
|
|
|
|
uint32_t *htw = (uint32_t *)&htwb[0];
|
|
|
|
uint32_t *btw = (uint32_t *)&btwb[0];
|
|
|
|
|
|
|
|
int btindex = 0;
|
|
|
|
|
|
|
|
for (int i = 0; i < size; i++) {
|
2022-05-13 21:04:37 +08:00
|
|
|
const HashMap<uint32_t, int> &t = table[i];
|
2014-02-10 09:10:30 +08:00
|
|
|
if (t.size() == 0) {
|
|
|
|
htw[i] = 0xFFFFFFFF; //nothing
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
htw[i] = btindex;
|
|
|
|
btw[btindex++] = t.size();
|
|
|
|
btw[btindex++] = hfunc_table[i];
|
|
|
|
|
2021-08-10 04:13:42 +08:00
|
|
|
for (const KeyValue<uint32_t, int> &E : t) {
|
|
|
|
btw[btindex++] = E.key;
|
|
|
|
btw[btindex++] = compressed[E.value].offset;
|
|
|
|
btw[btindex++] = compressed[E.value].compressed.size();
|
|
|
|
btw[btindex++] = compressed[E.value].orig_len;
|
2014-02-10 09:10:30 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
strings.resize(total_compression_size);
|
2020-02-18 05:06:54 +08:00
|
|
|
uint8_t *cw = strings.ptrw();
|
2014-02-10 09:10:30 +08:00
|
|
|
|
|
|
|
for (int i = 0; i < compressed.size(); i++) {
|
|
|
|
memcpy(&cw[compressed[i].offset], compressed[i].compressed.get_data(), compressed[i].compressed.size());
|
|
|
|
}
|
|
|
|
|
|
|
|
ERR_FAIL_COND(btindex != bucket_table_size);
|
|
|
|
set_locale(p_from->get_locale());
|
|
|
|
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2021-01-16 23:28:54 +08:00
|
|
|
bool OptimizedTranslation::_set(const StringName &p_name, const Variant &p_value) {
|
2022-09-29 17:53:28 +08:00
|
|
|
String prop_name = p_name.operator String();
|
|
|
|
if (prop_name == "hash_table") {
|
2014-02-10 09:10:30 +08:00
|
|
|
hash_table = p_value;
|
2022-09-29 17:53:28 +08:00
|
|
|
} else if (prop_name == "bucket_table") {
|
2014-02-10 09:10:30 +08:00
|
|
|
bucket_table = p_value;
|
2022-09-29 17:53:28 +08:00
|
|
|
} else if (prop_name == "strings") {
|
2014-02-10 09:10:30 +08:00
|
|
|
strings = p_value;
|
2022-09-29 17:53:28 +08:00
|
|
|
} else if (prop_name == "load_from") {
|
2014-02-10 09:10:30 +08:00
|
|
|
generate(p_value);
|
2020-05-14 22:41:43 +08:00
|
|
|
} else {
|
2014-02-10 09:10:30 +08:00
|
|
|
return false;
|
2020-05-14 22:41:43 +08:00
|
|
|
}
|
2014-02-10 09:10:30 +08:00
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2021-01-16 23:28:54 +08:00
|
|
|
bool OptimizedTranslation::_get(const StringName &p_name, Variant &r_ret) const {
|
2022-09-29 17:53:28 +08:00
|
|
|
String prop_name = p_name.operator String();
|
|
|
|
if (prop_name == "hash_table") {
|
2014-02-10 09:10:30 +08:00
|
|
|
r_ret = hash_table;
|
2022-09-29 17:53:28 +08:00
|
|
|
} else if (prop_name == "bucket_table") {
|
2014-02-10 09:10:30 +08:00
|
|
|
r_ret = bucket_table;
|
2022-09-29 17:53:28 +08:00
|
|
|
} else if (prop_name == "strings") {
|
2014-02-10 09:10:30 +08:00
|
|
|
r_ret = strings;
|
2020-05-14 22:41:43 +08:00
|
|
|
} else {
|
2014-02-10 09:10:30 +08:00
|
|
|
return false;
|
2020-05-14 22:41:43 +08:00
|
|
|
}
|
2014-02-10 09:10:30 +08:00
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2021-01-16 23:28:54 +08:00
|
|
|
StringName OptimizedTranslation::get_message(const StringName &p_src_text, const StringName &p_context) const {
|
|
|
|
// p_context passed in is ignore. The use of context is not yet supported in OptimizedTranslation.
|
2020-07-16 16:52:06 +08:00
|
|
|
|
2014-02-10 09:10:30 +08:00
|
|
|
int htsize = hash_table.size();
|
|
|
|
|
2020-05-14 22:41:43 +08:00
|
|
|
if (htsize == 0) {
|
2014-02-10 09:10:30 +08:00
|
|
|
return StringName();
|
2020-05-14 22:41:43 +08:00
|
|
|
}
|
2014-02-10 09:10:30 +08:00
|
|
|
|
|
|
|
CharString str = p_src_text.operator String().utf8();
|
|
|
|
uint32_t h = hash(0, str.get_data());
|
|
|
|
|
2020-02-18 05:06:54 +08:00
|
|
|
const int *htr = hash_table.ptr();
|
2014-02-10 09:10:30 +08:00
|
|
|
const uint32_t *htptr = (const uint32_t *)&htr[0];
|
2020-02-18 05:06:54 +08:00
|
|
|
const int *btr = bucket_table.ptr();
|
2014-02-10 09:10:30 +08:00
|
|
|
const uint32_t *btptr = (const uint32_t *)&btr[0];
|
2020-02-18 05:06:54 +08:00
|
|
|
const uint8_t *sr = strings.ptr();
|
2014-02-10 09:10:30 +08:00
|
|
|
const char *sptr = (const char *)&sr[0];
|
|
|
|
|
|
|
|
uint32_t p = htptr[h % htsize];
|
|
|
|
|
|
|
|
if (p == 0xFFFFFFFF) {
|
|
|
|
return StringName(); //nothing
|
|
|
|
}
|
|
|
|
|
|
|
|
const Bucket &bucket = *(const Bucket *)&btptr[p];
|
|
|
|
|
|
|
|
h = hash(bucket.func, str.get_data());
|
|
|
|
|
|
|
|
int idx = -1;
|
|
|
|
|
|
|
|
for (int i = 0; i < bucket.size; i++) {
|
|
|
|
if (bucket.elem[i].key == h) {
|
|
|
|
idx = i;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (idx == -1) {
|
|
|
|
return StringName();
|
|
|
|
}
|
|
|
|
|
|
|
|
if (bucket.elem[idx].comp_size == bucket.elem[idx].uncomp_size) {
|
|
|
|
String rstr;
|
|
|
|
rstr.parse_utf8(&sptr[bucket.elem[idx].str_offset], bucket.elem[idx].uncomp_size);
|
|
|
|
|
|
|
|
return rstr;
|
|
|
|
} else {
|
|
|
|
CharString uncomp;
|
|
|
|
uncomp.resize(bucket.elem[idx].uncomp_size + 1);
|
2017-11-25 11:07:54 +08:00
|
|
|
smaz_decompress(&sptr[bucket.elem[idx].str_offset], bucket.elem[idx].comp_size, uncomp.ptrw(), bucket.elem[idx].uncomp_size);
|
2014-02-10 09:10:30 +08:00
|
|
|
String rstr;
|
|
|
|
rstr.parse_utf8(uncomp.get_data());
|
|
|
|
return rstr;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-11-09 20:45:21 +08:00
|
|
|
Vector<String> OptimizedTranslation::get_translated_message_list() const {
|
|
|
|
Vector<String> msgs;
|
|
|
|
|
|
|
|
const int *htr = hash_table.ptr();
|
|
|
|
const uint32_t *htptr = (const uint32_t *)&htr[0];
|
|
|
|
const int *btr = bucket_table.ptr();
|
|
|
|
const uint32_t *btptr = (const uint32_t *)&btr[0];
|
|
|
|
const uint8_t *sr = strings.ptr();
|
|
|
|
const char *sptr = (const char *)&sr[0];
|
|
|
|
|
|
|
|
for (int i = 0; i < hash_table.size(); i++) {
|
|
|
|
uint32_t p = htptr[i];
|
|
|
|
if (p != 0xFFFFFFFF) {
|
|
|
|
const Bucket &bucket = *(const Bucket *)&btptr[p];
|
|
|
|
for (int j = 0; j < bucket.size; j++) {
|
|
|
|
if (bucket.elem[j].comp_size == bucket.elem[j].uncomp_size) {
|
|
|
|
String rstr;
|
|
|
|
rstr.parse_utf8(&sptr[bucket.elem[j].str_offset], bucket.elem[j].uncomp_size);
|
|
|
|
msgs.push_back(rstr);
|
|
|
|
} else {
|
|
|
|
CharString uncomp;
|
|
|
|
uncomp.resize(bucket.elem[j].uncomp_size + 1);
|
|
|
|
smaz_decompress(&sptr[bucket.elem[j].str_offset], bucket.elem[j].comp_size, uncomp.ptrw(), bucket.elem[j].uncomp_size);
|
|
|
|
String rstr;
|
|
|
|
rstr.parse_utf8(uncomp.get_data());
|
|
|
|
msgs.push_back(rstr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return msgs;
|
|
|
|
}
|
|
|
|
|
2021-01-16 23:28:54 +08:00
|
|
|
StringName OptimizedTranslation::get_plural_message(const StringName &p_src_text, const StringName &p_plural_text, int p_n, const StringName &p_context) const {
|
|
|
|
// The use of plurals translation is not yet supported in OptimizedTranslation.
|
2020-07-16 16:52:06 +08:00
|
|
|
return get_message(p_src_text, p_context);
|
|
|
|
}
|
|
|
|
|
2021-01-16 23:28:54 +08:00
|
|
|
void OptimizedTranslation::_get_property_list(List<PropertyInfo> *p_list) const {
|
Variant: Added 64-bit packed arrays, renamed Variant::REAL to FLOAT.
- Renames PackedIntArray to PackedInt32Array.
- Renames PackedFloatArray to PackedFloat32Array.
- Adds PackedInt64Array and PackedFloat64Array.
- Renames Variant::REAL to Variant::FLOAT for consistency.
Packed arrays are for storing large amount of data and creating stuff like
meshes, buffers. textures, etc. Forcing them to be 64 is a huge waste of
memory. That said, many users requested the ability to have 64 bits packed
arrays for their games, so this is just an optional added type.
For Variant, the float datatype is always 64 bits, and exposed as `float`.
We still have `real_t` which is the datatype that can change from 32 to 64
bits depending on a compile flag (not entirely working right now, but that's
the idea). It affects math related datatypes and code only.
Neither Variant nor PackedArray make use of real_t, which is only intended
for math precision, so the term is removed from there to keep only float.
2020-02-25 02:20:53 +08:00
|
|
|
p_list->push_back(PropertyInfo(Variant::PACKED_INT32_ARRAY, "hash_table"));
|
|
|
|
p_list->push_back(PropertyInfo(Variant::PACKED_INT32_ARRAY, "bucket_table"));
|
2020-02-18 05:06:54 +08:00
|
|
|
p_list->push_back(PropertyInfo(Variant::PACKED_BYTE_ARRAY, "strings"));
|
2014-02-10 09:10:30 +08:00
|
|
|
p_list->push_back(PropertyInfo(Variant::OBJECT, "load_from", PROPERTY_HINT_RESOURCE_TYPE, "Translation", PROPERTY_USAGE_EDITOR));
|
|
|
|
}
|
2020-05-14 20:29:06 +08:00
|
|
|
|
2021-01-16 23:28:54 +08:00
|
|
|
void OptimizedTranslation::_bind_methods() {
|
|
|
|
ClassDB::bind_method(D_METHOD("generate", "from"), &OptimizedTranslation::generate);
|
2014-02-10 09:10:30 +08:00
|
|
|
}
|