Upload code/ma_common.py with huggingface_hub
Browse files- code/ma_common.py +295 -0
code/ma_common.py
ADDED
|
@@ -0,0 +1,295 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
"""merge-accuracy: downstream-ACCURACY benchmark of merge-before/after-alignment.
|
| 2 |
+
|
| 3 |
+
Imports mergeschool.core (/root/mergeability) READ-ONLY for the merge operators, aligners and
|
| 4 |
+
quotient-distance diagnostics; adds the accuracy axis (this file) that the NLL work lacks.
|
| 5 |
+
"""
|
| 6 |
+
from __future__ import annotations
|
| 7 |
+
import os, sys, json, math, gc, time, hashlib
|
| 8 |
+
for v in ("OMP_NUM_THREADS","MKL_NUM_THREADS","OPENBLAS_NUM_THREADS","NUMEXPR_NUM_THREADS"):
|
| 9 |
+
os.environ.setdefault(v, "8")
|
| 10 |
+
os.environ.setdefault("TOKENIZERS_PARALLELISM", "false")
|
| 11 |
+
os.environ.setdefault("HF_HOME", "/root/hf_cache_mergeacc")
|
| 12 |
+
sys.path.insert(0, "/root/mergeability/src")
|
| 13 |
+
sys.path.insert(0, "/root/merge-accuracy")
|
| 14 |
+
import numpy as np
|
| 15 |
+
import torch
|
| 16 |
+
torch.set_num_threads(8)
|
| 17 |
+
from transformers import AutoModelForCausalLM, AutoTokenizer, AutoConfig
|
| 18 |
+
|
| 19 |
+
from mergeschool.core import merge as MG
|
| 20 |
+
from mergeschool.core import alignment as AL
|
| 21 |
+
from mergeschool.core import metrics as MT
|
| 22 |
+
|
| 23 |
+
CACHE = "/root/hf_cache_mergeacc"
|
| 24 |
+
RES = "/root/merge-accuracy/results"
|
| 25 |
+
|
| 26 |
+
|
| 27 |
+
# ------------------------------------------------------------------ models
|
| 28 |
+
def load_model(repo, revision=None, dev="cuda", dtype=torch.float32):
|
| 29 |
+
m = AutoModelForCausalLM.from_pretrained(repo, revision=revision, cache_dir=CACHE,
|
| 30 |
+
dtype=dtype, low_cpu_mem_usage=True)
|
| 31 |
+
return m.to(dev).eval()
|
| 32 |
+
|
| 33 |
+
|
| 34 |
+
def load_tok(repo, revision=None):
|
| 35 |
+
t = AutoTokenizer.from_pretrained(repo, revision=revision, cache_dir=CACHE)
|
| 36 |
+
if t.pad_token is None:
|
| 37 |
+
t.pad_token = t.eos_token
|
| 38 |
+
return t
|
| 39 |
+
|
| 40 |
+
|
| 41 |
+
def sd_np(model):
|
| 42 |
+
return {k: v.detach().float().cpu().numpy() for k, v in model.state_dict().items()}
|
| 43 |
+
|
| 44 |
+
|
| 45 |
+
def sd_load(model, sd, dtype=torch.float32):
|
| 46 |
+
with torch.no_grad():
|
| 47 |
+
msd = model.state_dict()
|
| 48 |
+
for k, v in sd.items():
|
| 49 |
+
if k in msd and tuple(msd[k].shape) == tuple(np.shape(v)):
|
| 50 |
+
msd[k].copy_(torch.as_tensor(np.asarray(v), dtype=dtype))
|
| 51 |
+
return model
|
| 52 |
+
|
| 53 |
+
|
| 54 |
+
def shared_keys(a, b):
|
| 55 |
+
return [k for k, v in a.items() if k in b and np.shape(b[k]) == np.shape(v)]
|
| 56 |
+
|
| 57 |
+
|
| 58 |
+
# ------------------------------------------------------------------ accuracy scoring
|
| 59 |
+
@torch.no_grad()
|
| 60 |
+
def _score_batch(model, tok, ctxs, conts, dev, max_len=1024):
|
| 61 |
+
"""sum logprob, per-token mean logprob, and greedy-match flag for each (ctx, cont)."""
|
| 62 |
+
enc_c = [tok(c, add_special_tokens=False)["input_ids"] for c in ctxs]
|
| 63 |
+
enc_t = [tok(t, add_special_tokens=False)["input_ids"] for t in conts]
|
| 64 |
+
seqs, nconts = [], []
|
| 65 |
+
for c, t in zip(enc_c, enc_t):
|
| 66 |
+
if len(t) == 0:
|
| 67 |
+
t = [tok.eos_token_id]
|
| 68 |
+
s = (c + t)[-max_len:]
|
| 69 |
+
seqs.append(s); nconts.append(min(len(t), len(s) - 1))
|
| 70 |
+
L = max(len(s) for s in seqs)
|
| 71 |
+
pad = tok.pad_token_id or 0
|
| 72 |
+
x = torch.full((len(seqs), L), pad, dtype=torch.long)
|
| 73 |
+
for i, s in enumerate(seqs):
|
| 74 |
+
x[i, L - len(s):] = torch.tensor(s) # left-pad
|
| 75 |
+
x = x.to(dev)
|
| 76 |
+
logits = model(x).logits.float()
|
| 77 |
+
lp = torch.log_softmax(logits[:, :-1], -1)
|
| 78 |
+
tgt = x[:, 1:]
|
| 79 |
+
tok_lp = lp.gather(-1, tgt.unsqueeze(-1)).squeeze(-1) # (B, L-1)
|
| 80 |
+
greedy_ok = (lp.argmax(-1) == tgt)
|
| 81 |
+
out = []
|
| 82 |
+
for i, n in enumerate(nconts):
|
| 83 |
+
sl = slice(L - 1 - n, L - 1)
|
| 84 |
+
s = tok_lp[i, sl].sum().item()
|
| 85 |
+
out.append((s, s / max(n, 1), bool(greedy_ok[i, sl].all().item()), n,
|
| 86 |
+
len(conts[i])))
|
| 87 |
+
return out
|
| 88 |
+
|
| 89 |
+
|
| 90 |
+
@torch.no_grad()
|
| 91 |
+
def eval_task(model, tok, docs, dev, bs=16, max_len=1024):
|
| 92 |
+
"""Returns dict with acc, acc_norm, n. `acc` uses summed logprob (harness default);
|
| 93 |
+
`acc_norm` normalises by continuation character length. Generative tasks (doc['greedy'])
|
| 94 |
+
score exact greedy match of the continuation."""
|
| 95 |
+
reqs = []
|
| 96 |
+
for di, d in enumerate(docs):
|
| 97 |
+
for ci, (c, t) in enumerate(zip(d["ctxs"], d["conts"])):
|
| 98 |
+
reqs.append((di, ci, c, t))
|
| 99 |
+
# sort by length for efficient batching
|
| 100 |
+
order = sorted(range(len(reqs)), key=lambda i: -(len(reqs[i][2]) + len(reqs[i][3])))
|
| 101 |
+
res = [None] * len(reqs)
|
| 102 |
+
for b in range(0, len(order), bs):
|
| 103 |
+
idx = order[b:b + bs]
|
| 104 |
+
sc = _score_batch(model, tok, [reqs[i][2] for i in idx], [reqs[i][3] for i in idx],
|
| 105 |
+
dev, max_len)
|
| 106 |
+
for i, s in zip(idx, sc):
|
| 107 |
+
res[i] = s
|
| 108 |
+
per_doc = {}
|
| 109 |
+
for (di, ci, _, _), s in zip(reqs, res):
|
| 110 |
+
per_doc.setdefault(di, {})[ci] = s
|
| 111 |
+
correct, correct_norm, hits = [], [], []
|
| 112 |
+
for di, d in enumerate(docs):
|
| 113 |
+
sc = per_doc[di]
|
| 114 |
+
if d.get("greedy"):
|
| 115 |
+
hits.append(int(sc[0][2]))
|
| 116 |
+
correct.append(int(sc[0][2])); correct_norm.append(int(sc[0][2]))
|
| 117 |
+
else:
|
| 118 |
+
n = len(d["ctxs"])
|
| 119 |
+
tot = [sc[c][0] for c in range(n)]
|
| 120 |
+
nrm = [sc[c][0] / max(sc[c][4], 1) for c in range(n)]
|
| 121 |
+
correct.append(int(int(np.argmax(tot)) == d["gold"]))
|
| 122 |
+
correct_norm.append(int(int(np.argmax(nrm)) == d["gold"]))
|
| 123 |
+
a = float(np.mean(correct))
|
| 124 |
+
return {"acc": a, "acc_norm": float(np.mean(correct_norm)), "n": len(docs),
|
| 125 |
+
"stderr": float(np.sqrt(a * (1 - a) / max(len(docs), 1))),
|
| 126 |
+
"items": correct}
|
| 127 |
+
|
| 128 |
+
|
| 129 |
+
# ------------------------------------------------------------------ activations / alignment
|
| 130 |
+
def make_blocks(tok, lines, block=512, max_blocks=32, sep="\n\n"):
|
| 131 |
+
ids = tok(sep.join(lines), add_special_tokens=False)["input_ids"]
|
| 132 |
+
n = min(max_blocks, len(ids) // block)
|
| 133 |
+
if n == 0:
|
| 134 |
+
n, block = 1, min(block, len(ids))
|
| 135 |
+
return torch.from_numpy(np.asarray(ids[:n * block], dtype=np.int64).reshape(n, block))
|
| 136 |
+
|
| 137 |
+
|
| 138 |
+
@torch.no_grad()
|
| 139 |
+
def capture_acts(model, blocks, dev, n_rows=2048, bs=4, seed=0):
|
| 140 |
+
outs = None
|
| 141 |
+
for i in range(0, blocks.shape[0], bs):
|
| 142 |
+
x = blocks[i:i + bs].to(dev)
|
| 143 |
+
hs = model(x, output_hidden_states=True).hidden_states
|
| 144 |
+
if outs is None:
|
| 145 |
+
outs = [[] for _ in hs]
|
| 146 |
+
for j, h in enumerate(hs):
|
| 147 |
+
outs[j].append(h.float().reshape(-1, h.shape[-1]).cpu())
|
| 148 |
+
rng = np.random.default_rng(seed)
|
| 149 |
+
N = torch.cat(outs[0]).shape[0]
|
| 150 |
+
idx = np.sort(rng.choice(N, size=min(n_rows, N), replace=False))
|
| 151 |
+
return {j: torch.cat(outs[j])[idx].numpy().astype(np.float64) for j in range(len(outs))}
|
| 152 |
+
|
| 153 |
+
|
| 154 |
+
def flores_lines(code="eng_Latn", n=200):
|
| 155 |
+
p = f"/root/goldfish-alignment/data/{code}.jsonl"
|
| 156 |
+
out = []
|
| 157 |
+
with open(p, encoding="utf-8") as f:
|
| 158 |
+
for line in f:
|
| 159 |
+
r = json.loads(line)
|
| 160 |
+
if r.get("text"):
|
| 161 |
+
out.append(r["text"])
|
| 162 |
+
return out[:n]
|
| 163 |
+
|
| 164 |
+
|
| 165 |
+
def align_pair(sd_a, sd_b, hidden_dim, n_heads, acts_a=None, acts_b=None, method="permutation"):
|
| 166 |
+
"""Carry B into A's frame. Returns (sd_b_aligned, info)."""
|
| 167 |
+
return AL.align_weights_full(sd_a, sd_b, hidden_dim, acts_a=acts_a, acts_b=acts_b,
|
| 168 |
+
n_heads=n_heads, method=method, strict=False, accept_each=True)
|
| 169 |
+
|
| 170 |
+
|
| 171 |
+
def diagnostics(sd_a, sd_b, sd_b_perm, sd_b_orth, acts_a=None, acts_b=None):
|
| 172 |
+
"""Pre-merge diagnostic block: quotient distance / coordinate share / CKA."""
|
| 173 |
+
keys = shared_keys(sd_a, sd_b)
|
| 174 |
+
d = {}
|
| 175 |
+
for tag, sdb in (("perm", sd_b_perm), ("orth", sd_b_orth)):
|
| 176 |
+
q = MT.quotient_weight_distance(sd_a, sd_b, sdb, keys)
|
| 177 |
+
for k, v in q.items():
|
| 178 |
+
if k != "n_params":
|
| 179 |
+
d[f"{k}_{tag}"] = v
|
| 180 |
+
a = np.concatenate([np.asarray(sd_a[k], float).ravel() for k in keys])
|
| 181 |
+
b = np.concatenate([np.asarray(sd_b[k], float).ravel() for k in keys])
|
| 182 |
+
d["weight_cosine"] = float(a @ b / (np.linalg.norm(a) * np.linalg.norm(b)))
|
| 183 |
+
if acts_a is not None and acts_b is not None:
|
| 184 |
+
L = sorted(set(acts_a) & set(acts_b))
|
| 185 |
+
ck = [MT.cka(acts_a[l], acts_b[l]) for l in L]
|
| 186 |
+
d["cka_mean"] = float(np.mean(ck)); d["cka_last"] = float(ck[-1])
|
| 187 |
+
try:
|
| 188 |
+
qr = MT.quotient_residual(acts_a[L[-1]], acts_b[L[-1]], group="perm")
|
| 189 |
+
d["qmd_act_perm"] = float(qr["distance"]) # 1 - post-alignment CKA
|
| 190 |
+
d["aligned_cka_perm"] = float(qr["aligned_cka"])
|
| 191 |
+
except Exception:
|
| 192 |
+
d["qmd_act_perm"] = d["aligned_cka_perm"] = float("nan")
|
| 193 |
+
# THE diagnostic the selection experiment uses: block-normalised coordinate share, the
|
| 194 |
+
# fraction of the scale-free parameter distance that the alignment map removes.
|
| 195 |
+
d["coord_share"] = max(d.get("coord_fraction_bn_perm", 0.0) or 0.0,
|
| 196 |
+
d.get("coord_fraction_bn_orth", 0.0) or 0.0)
|
| 197 |
+
return d
|
| 198 |
+
|
| 199 |
+
|
| 200 |
+
# ------------------------------------------------------------------ merge
|
| 201 |
+
def interp(a, b, t, keys=None):
|
| 202 |
+
keys = keys or list(a)
|
| 203 |
+
return {k: (1 - t) * np.asarray(a[k], float) + t * np.asarray(b[k], float) for k in keys}
|
| 204 |
+
|
| 205 |
+
|
| 206 |
+
def ties_merge(base, exp_a, exp_b, density=0.2):
|
| 207 |
+
return MG.ties(base, [exp_a, exp_b], density=density)
|
| 208 |
+
|
| 209 |
+
|
| 210 |
+
def jload(p):
|
| 211 |
+
if not os.path.exists(p): return {}
|
| 212 |
+
out = {}
|
| 213 |
+
with open(p) as f:
|
| 214 |
+
for line in f:
|
| 215 |
+
try:
|
| 216 |
+
r = json.loads(line); out[r["key"]] = r
|
| 217 |
+
except Exception: pass
|
| 218 |
+
return out
|
| 219 |
+
|
| 220 |
+
|
| 221 |
+
def jappend(p, rec):
|
| 222 |
+
os.makedirs(os.path.dirname(p), exist_ok=True)
|
| 223 |
+
with open(p, "a") as f:
|
| 224 |
+
f.write(json.dumps(rec) + "\n"); f.flush(); os.fsync(f.fileno())
|
| 225 |
+
|
| 226 |
+
|
| 227 |
+
# ------------------------------------------------------------------ tokenizer-agnostic acts
|
| 228 |
+
@torch.no_grad()
|
| 229 |
+
def capture_acts_sent(model, tok, sents, dev, bs=8, max_len=256):
|
| 230 |
+
"""{layer: (n_sent, d)} mean-pooled residual states, ONE ROW PER SENTENCE. Row-aligned across
|
| 231 |
+
models even when the two tokenizers differ (rung 4), which token-level capture is not."""
|
| 232 |
+
outs = None
|
| 233 |
+
for i in range(0, len(sents), bs):
|
| 234 |
+
batch = sents[i:i + bs]
|
| 235 |
+
enc = tok(batch, return_tensors="pt", padding=True, truncation=True, max_length=max_len)
|
| 236 |
+
enc = {k: v.to(dev) for k, v in enc.items()}
|
| 237 |
+
hs = model(**enc, output_hidden_states=True).hidden_states
|
| 238 |
+
m = enc["attention_mask"].unsqueeze(-1).float()
|
| 239 |
+
if outs is None:
|
| 240 |
+
outs = [[] for _ in hs]
|
| 241 |
+
for j, h in enumerate(hs):
|
| 242 |
+
outs[j].append(((h.float() * m).sum(1) / m.sum(1).clamp(min=1)).cpu())
|
| 243 |
+
return {j: torch.cat(outs[j]).numpy().astype(np.float64) for j in range(len(outs))}
|
| 244 |
+
|
| 245 |
+
|
| 246 |
+
def body_keys(sd_a, sd_b):
|
| 247 |
+
"""Shared keys with equal shapes, EXCLUDING the token embedding / unembedding. For a
|
| 248 |
+
cross-tokenizer pair these are exactly the mergeable parameters; for a same-tokenizer pair
|
| 249 |
+
they are the whole transformer body and we merge the embeddings too (see merge_keys)."""
|
| 250 |
+
sk = shared_keys(sd_a, sd_b)
|
| 251 |
+
return [k for k in sk if not any(s in k for s in ("embed_in", "embed_out", "embed_tokens", "lm_head"))]
|
| 252 |
+
|
| 253 |
+
|
| 254 |
+
def merge_keys(sd_a, sd_b):
|
| 255 |
+
sk = shared_keys(sd_a, sd_b)
|
| 256 |
+
bk = body_keys(sd_a, sd_b)
|
| 257 |
+
return (sk, "full") if len(sk) == len(bk) + 0 and len(sk) > len(bk) else (
|
| 258 |
+
(sk, "full") if len(sk) > len(bk) and _emb_match(sd_a, sd_b) else (bk, "body_only"))
|
| 259 |
+
|
| 260 |
+
|
| 261 |
+
def _emb_match(sd_a, sd_b):
|
| 262 |
+
for k in sd_a:
|
| 263 |
+
if "embed_in" in k or "embed_tokens" in k:
|
| 264 |
+
return k in sd_b and np.shape(sd_a[k]) == np.shape(sd_b[k])
|
| 265 |
+
return False
|
| 266 |
+
|
| 267 |
+
|
| 268 |
+
# ------------------------------------------------------------------ generation (IFEval)
|
| 269 |
+
LLAMA31_CHAT = ("<|begin_of_text|><|start_header_id|>user<|end_header_id|>\n\n"
|
| 270 |
+
"{content}<|eot_id|><|start_header_id|>assistant<|end_header_id|>\n\n")
|
| 271 |
+
|
| 272 |
+
@torch.no_grad()
|
| 273 |
+
def generate_batch(model, tok, prompts, dev, bs=16, max_new=256, max_len=1024):
|
| 274 |
+
"""Greedy decoding, left-padded. Used for IFEval, where the constraint is on the TEXT."""
|
| 275 |
+
outs = []
|
| 276 |
+
order = sorted(range(len(prompts)), key=lambda i: -len(prompts[i]))
|
| 277 |
+
res = [None] * len(prompts)
|
| 278 |
+
tok.padding_side = "left"
|
| 279 |
+
for b in range(0, len(order), bs):
|
| 280 |
+
idx = order[b:b + bs]
|
| 281 |
+
enc = tok([prompts[i] for i in idx], return_tensors="pt", padding=True,
|
| 282 |
+
truncation=True, max_length=max_len, add_special_tokens=False).to(dev)
|
| 283 |
+
gen = model.generate(**enc, max_new_tokens=max_new, do_sample=False,
|
| 284 |
+
pad_token_id=tok.pad_token_id)
|
| 285 |
+
for j, i in enumerate(idx):
|
| 286 |
+
res[i] = tok.decode(gen[j][enc["input_ids"].shape[1]:], skip_special_tokens=True)
|
| 287 |
+
return res
|
| 288 |
+
|
| 289 |
+
|
| 290 |
+
def eval_ifeval(model, tok, dev, n=200, bs=16, max_new=256):
|
| 291 |
+
import ifeval
|
| 292 |
+
rows = ifeval.docs(n)
|
| 293 |
+
prompts = [LLAMA31_CHAT.format(content=r["prompt"]) for r in rows]
|
| 294 |
+
resp = generate_batch(model, tok, prompts, dev, bs=bs, max_new=max_new)
|
| 295 |
+
return ifeval.score(rows, resp), resp
|