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
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
//! Interned names: strings, model values and record field names.
//!
//! TLC keeps every name in one global table (`util.UniqueString`) and orders names by
//! their position in it (`UniqueString.compareTo` returns `this.tok - other.tok`).
//! dive mirrors that with an [`Interner`] that hands out [`Atom`]s numbered in
//! insertion order. Fed in SANY/TLC's encounter order, the numbering reproduces TLC's
//! order of strings, model values and record fields.
use std::cmp::Ordering;
use std::collections::HashMap;
use std::fmt;
use std::hash::{Hash, Hasher};
use std::sync::{Arc, Mutex, PoisonError};
use crate::ctx::ValueOrder;
impl crate::Value {
/// Requested heap payload retained by a narrow immutable conversion cache.
///
/// Admits only booleans, inline integers and flat tuples/records containing
/// those values. The caller separately charges its table capacity, including
/// inline Value/Atom owners. Record name payload is shared only when its Arc
/// is already pinned by `names`; foreign owners and all other shapes decline.
/// Includes private function headers (and fixed fingerprint cache) and boxed
/// element/field storage. Opaque Arc headers and allocator overhead are not
/// measured; this is not a whole-process memory allowance.
/// `proceed` checks work before each component; false declines caching.
///
/// ```
/// use dive_value::{Ctx, Interner, Value};
/// let names = Interner::new();
/// let record = Value::record(vec![(names.intern("x"), Value::Int(1))], Ctx::dive())?;
/// assert!(record.flat_cache_heap_bytes(&names, &mut || true).is_some());
/// assert_eq!(record.flat_cache_heap_bytes(&names, &mut || false), None);
/// # Ok::<(), dive_value::ValueError>(())
/// ```
#[must_use]
pub fn flat_cache_heap_bytes(
&self,
names: &Interner,
proceed: &mut dyn FnMut() -> bool,
) -> Option<usize> {
use crate::value::{FcnInner, FcnRepr};
if !proceed() {
return None;
}
let immediate = |value: &Self| matches!(value, Self::Bool(_) | Self::Int(_));
match self {
Self::Bool(_) | Self::Int(_) => Some(0),
Self::Fcn(function) => {
let payload = match &function.0.repr {
FcnRepr::Tuple(elements) => {
for value in elements {
if !proceed() || !immediate(value) {
return None;
}
}
std::mem::size_of_val(elements.as_ref())
}
FcnRepr::Record(fields) => {
for (name, value) in fields {
if !proceed()
|| !immediate(value)
|| !names
.resolve(name.tok())
.is_some_and(|known| Arc::ptr_eq(&name.0, &known.0))
{
return None;
}
}
std::mem::size_of_val(fields.as_ref())
}
FcnRepr::General(_) => return None,
};
std::mem::size_of::<FcnInner>().checked_add(payload)
}
_ => None,
}
}
/// Conservative requested payload for a closed function-tree read cache.
///
/// Admits Bool/Int, strings pinned by this exact `names` interner, and
/// recursively closed tuples, records and functions. General function keys
/// must be Bool/Int or run-owned strings. All sets (including normalized
/// sets), model values, big integers and other shapes decline without
/// evaluation or normalization. Function literal classes remain unchanged.
///
/// Counts each occurrence, conservatively overcharging shared children.
/// Includes function headers, boxed arrays, general-domain headers and the
/// maximum future scalar-domain TLC-order array. Scalar keys cannot create
/// the allocating product-domain index. Fingerprint and scalar lookup caches
/// are fixed header fields and have no normalization-history side effects.
/// The caller separately charges its table and row array. Opaque Arc headers
/// and allocator overhead remain excluded; this is not a process memory cap.
/// Inspection checks `proceed` at each step and declines after 4,096 values
/// or 64 function levels. Declining only bypasses caching.
///
/// ```
/// use dive_value::{Ctx, Interner, Value};
/// let names = Interner::new();
/// let nested = Value::fcn(vec![(Value::Int(0),
/// Value::tuple(vec![Value::string(&names, "tok")]))], Ctx::tlc())?;
/// assert!(nested.closed_function_cache_heap_bytes(&names, &mut || true).is_some());
/// # Ok::<(), dive_value::ValueError>(())
/// ```
#[must_use]
pub fn closed_function_cache_heap_bytes(
&self,
names: &Interner,
proceed: &mut dyn FnMut() -> bool,
) -> Option<usize> {
closed_cache_bytes(self, names, &mut 4096, 0, false, proceed)
}
/// Requested payload for immutable closed function/set conversion reuse.
///
/// Extends [`Self::closed_function_cache_heap_bytes`] to already materialized
/// enumerated sets, recursively retaining the same leaf/key restrictions,
/// name ownership, 4,096-value and 64-level bounds. No set is normalized or
/// enumerated: raw and symbolic representations decline even if they have
/// cached elements. Set headers and complete element arrays are charged,
/// including repeated shared children. Fixed set hash/fingerprint fields
/// cannot introduce further retained arrays. Declining bypasses reuse only;
/// the caller's conversion and control requirements are unchanged.
///
/// ```
/// use dive_value::{Ctx, Interner, Value};
/// let names = Interner::new();
/// let set = Value::set(vec![Value::tuple(vec![Value::Int(1)])], Ctx::dive())?;
/// assert!(set.closed_cache_heap_bytes(&names, &mut || true).is_some());
/// assert_eq!(Value::nat(Ctx::dive()).closed_cache_heap_bytes(&names, &mut || true), None);
/// # Ok::<(), dive_value::ValueError>(())
/// ```
#[must_use]
pub fn closed_cache_heap_bytes(
&self,
names: &Interner,
proceed: &mut dyn FnMut() -> bool,
) -> Option<usize> {
closed_cache_bytes(self, names, &mut 4096, 0, true, proceed)
}
}
fn run_owned(name: &Atom, names: &Interner) -> bool {
names
.resolve(name.tok())
.is_some_and(|known| Arc::ptr_eq(&name.0, &known.0))
}
fn closed_cache_bytes(
value: &crate::Value,
names: &Interner,
remaining: &mut usize,
depth: usize,
sets: bool,
proceed: &mut dyn FnMut() -> bool,
) -> Option<usize> {
use crate::Value;
use crate::function_domain::DomainInner;
use crate::value::{FcnInner, FcnRepr, SetInner, SetRepr};
*remaining = remaining.checked_sub(1)?;
if !proceed() {
return None;
}
match value {
Value::Bool(_) | Value::Int(_) => Some(0),
Value::Str(name) if run_owned(name, names) => Some(0),
Value::Set(set) if sets && depth < 64 && matches!(set.0.repr, SetRepr::Enum) => {
let elements = set.0.elems.get()?;
let mut bytes = std::mem::size_of::<SetInner>()
.checked_add(std::mem::size_of_val(elements.as_ref()))?;
for child in elements.as_ref() {
bytes = bytes.checked_add(closed_cache_bytes(
child,
names,
remaining,
depth + 1,
sets,
proceed,
)?)?;
}
Some(bytes)
}
Value::Fcn(function) if depth < 64 => {
let mut bytes = std::mem::size_of::<FcnInner>();
match &function.0.repr {
FcnRepr::Tuple(elements) => {
bytes = bytes.checked_add(std::mem::size_of_val(elements.as_ref()))?;
for child in elements {
bytes = bytes.checked_add(closed_cache_bytes(
child,
names,
remaining,
depth + 1,
sets,
proceed,
)?)?;
}
}
FcnRepr::Record(fields) => {
bytes = bytes.checked_add(std::mem::size_of_val(fields.as_ref()))?;
for (name, child) in fields {
if !proceed() || !run_owned(name, names) {
return None;
}
bytes = bytes.checked_add(closed_cache_bytes(
child,
names,
remaining,
depth + 1,
sets,
proceed,
)?)?;
}
}
FcnRepr::General(general) => {
bytes = bytes.checked_add(std::mem::size_of::<DomainInner>())?;
bytes =
bytes.checked_add(std::mem::size_of_val(general.domain.keys.as_ref()))?;
bytes = bytes.checked_add(std::mem::size_of_val(general.values.as_ref()))?;
// DomainIndex::of can only choose Integers or Unknown for
// scalar keys: Product requires a tuple first key. The sole
// later retained allocation is tlc_order's boxed usize[n].
bytes = bytes.checked_add(
general
.domain
.keys
.len()
.checked_mul(std::mem::size_of::<usize>())?,
)?;
for key in &general.domain.keys {
if !matches!(key, Value::Bool(_) | Value::Int(_) | Value::Str(_)) {
return None;
}
bytes = bytes.checked_add(closed_cache_bytes(
key,
names,
remaining,
depth + 1,
sets,
proceed,
)?)?;
}
for child in &general.values {
bytes = bytes.checked_add(closed_cache_bytes(
child,
names,
remaining,
depth + 1,
sets,
proceed,
)?)?;
}
}
}
Some(bytes)
}
_ => None,
}
}
/// An interned name. Cloning is a reference-count increment.
///
/// Equality is by text, so atoms from different interners still compare correctly for
/// equality; ordering by token is only meaningful within one interner.
#[derive(Clone)]
pub struct Atom(Arc<AtomInner>);
struct AtomInner {
text: Box<str>,
tok: u32,
hash: u64,
utf16_len: u32,
/// TLC's model-value type: the first UTF-16 unit when the name has more than two
/// units and its second unit is `_` (`ModelValue` constructor). 0 means untyped.
mv_type: u16,
}
impl Atom {
fn new(text: &str, tok: u32) -> Self {
let units: Vec<u16> = text.encode_utf16().collect();
let mv_type = if units.len() > 2 && units[1] == u16::from(b'_') {
units[0]
} else {
0
};
Self(Arc::new(AtomInner {
text: text.into(),
tok,
hash: text_hash(text),
utf16_len: u32::try_from(units.len()).unwrap_or(u32::MAX),
mv_type,
}))
}
/// The name's text.
#[must_use]
pub fn as_str(&self) -> &str {
&self.0.text
}
/// The intern token: the position at which the name was first interned.
#[must_use]
pub fn tok(&self) -> u32 {
self.0.tok
}
/// The length in UTF-16 code units (Java's `String.length()`).
#[must_use]
pub fn utf16_len(&self) -> u32 {
self.0.utf16_len
}
/// TLC's model-value type character, as a UTF-16 unit, if the name is typed
/// (`x_name`: more than two units, the second being `_`).
#[must_use]
pub fn mv_type(&self) -> Option<u16> {
(self.0.mv_type != 0).then_some(self.0.mv_type)
}
/// A precomputed, deterministic 64-bit hash of the text.
#[must_use]
pub fn text_hash(&self) -> u64 {
self.0.hash
}
/// Orders two atoms under the given string order.
#[must_use]
pub fn cmp_with(&self, other: &Self, order: ValueOrder) -> Ordering {
if Arc::ptr_eq(&self.0, &other.0) {
return Ordering::Equal;
}
match order {
ValueOrder::Tlc => self
.0
.tok
.cmp(&other.0.tok)
.then_with(|| self.0.text.cmp(&other.0.text)),
ValueOrder::Canonical => self.0.text.cmp(&other.0.text),
}
}
}
impl PartialEq for Atom {
fn eq(&self, other: &Self) -> bool {
Arc::ptr_eq(&self.0, &other.0)
|| (self.0.hash == other.0.hash && self.0.text == other.0.text)
}
}
impl Eq for Atom {}
impl Hash for Atom {
fn hash<H: Hasher>(&self, state: &mut H) {
state.write_u64(self.0.hash);
}
}
impl fmt::Debug for Atom {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
write!(f, "{:?}#{}", self.as_str(), self.tok())
}
}
impl fmt::Display for Atom {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
f.write_str(self.as_str())
}
}
/// FNV-1a over the bytes, then a 64-bit finalizer. Deterministic across runs.
pub(crate) fn text_hash(text: &str) -> u64 {
let mut h: u64 = 0xcbf2_9ce4_8422_2325;
for b in text.bytes() {
h ^= u64::from(b);
h = h.wrapping_mul(0x0100_0000_01b3);
}
mix64(h)
}
/// The `splitmix64` finalizer.
pub(crate) const fn mix64(mut z: u64) -> u64 {
z = (z ^ (z >> 30)).wrapping_mul(0xbf58_476d_1ce4_e5b9);
z = (z ^ (z >> 27)).wrapping_mul(0x94d0_49bb_1331_11eb);
z ^ (z >> 31)
}
/// The table of names for one run. Thread-safe; share it with an [`Arc`].
///
/// Tokens are assigned in insertion order, starting at 0. To reproduce TLC's order of
/// strings, model values and record fields, intern names in the order SANY and TLC
/// first meet them.
///
/// ```
/// use dive_value::Interner;
/// let names = Interner::new();
/// let b = names.intern("b");
/// let a = names.intern("a");
/// assert!(b.tok() < a.tok());
/// assert_eq!(names.intern("b"), b);
/// ```
#[derive(Default)]
pub struct Interner {
table: Mutex<Table>,
}
#[derive(Default)]
struct Table {
by_text: HashMap<Box<str>, Atom>,
/// `by_tok[t]` is the atom with token `t`.
by_tok: Vec<Atom>,
}
impl Interner {
/// An empty table.
#[must_use]
pub fn new() -> Self {
Self::default()
}
/// Returns the atom for `text`, interning it with the next token if it is new.
pub fn intern(&self, text: &str) -> Atom {
let mut table = self.table.lock().unwrap_or_else(PoisonError::into_inner);
if let Some(atom) = table.by_text.get(text) {
return atom.clone();
}
let tok = u32::try_from(table.by_tok.len()).unwrap_or(u32::MAX);
let atom = Atom::new(text, tok);
table.by_text.insert(text.into(), atom.clone());
table.by_tok.push(atom.clone());
atom
}
/// Returns the atom with token `tok`, if one has been interned.
///
/// This is the inverse of [`Atom::tok`] for this table. State encodings store
/// names by token ([`crate::codec`]), and decoding resolves them here.
///
/// ```
/// use dive_value::Interner;
/// let names = Interner::new();
/// let a = names.intern("a");
/// assert_eq!(names.resolve(a.tok()), Some(a));
/// assert_eq!(names.resolve(7), None);
/// ```
#[must_use]
pub fn resolve(&self, tok: u32) -> Option<Atom> {
let table = self.table.lock().unwrap_or_else(PoisonError::into_inner);
usize::try_from(tok)
.ok()
.and_then(|t| table.by_tok.get(t))
.cloned()
}
/// Returns the atom for `text` if it has been interned.
#[must_use]
pub fn get(&self, text: &str) -> Option<Atom> {
let table = self.table.lock().unwrap_or_else(PoisonError::into_inner);
table.by_text.get(text).cloned()
}
/// The number of interned names.
#[must_use]
pub fn len(&self) -> usize {
self.table
.lock()
.unwrap_or_else(PoisonError::into_inner)
.by_tok
.len()
}
/// Whether no name has been interned.
#[must_use]
pub fn is_empty(&self) -> bool {
self.len() == 0
}
}
impl fmt::Debug for Interner {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
f.debug_struct("Interner")
.field("len", &self.len())
.finish()
}
}
#[cfg(test)]
#[allow(
clippy::expect_used,
reason = "flat-cache storage and ownership fixtures"
)]
mod flat_cache_tests {
use super::*;
use crate::{Ctx, Value};
#[test]
fn only_flat_immediates_with_run_owned_names_receive_known_payload_charge() {
let names = Interner::new();
let key = names.intern("x");
let record =
Value::record(vec![(key.clone(), Value::Int(1))], Ctx::dive()).expect("record");
let general =
Value::fcn(vec![(Value::Str(key), Value::Int(1))], Ctx::dive()).expect("function");
let expected =
std::mem::size_of::<crate::value::FcnInner>() + std::mem::size_of::<(Atom, Value)>();
assert_eq!(
record.flat_cache_heap_bytes(&names, &mut || true),
Some(expected)
);
assert_eq!(
general.flat_cache_heap_bytes(&names, &mut || true),
Some(expected)
);
let tuple = Value::tuple(vec![Value::Int(1), Value::Bool(true)]);
assert_eq!(
tuple.flat_cache_heap_bytes(&names, &mut || true),
Some(std::mem::size_of::<crate::value::FcnInner>() + 2 * std::mem::size_of::<Value>())
);
let foreign = Interner::new();
let other = Value::record(vec![(foreign.intern("x"), Value::Int(1))], Ctx::dive())
.expect("foreign record");
assert_eq!(other.flat_cache_heap_bytes(&names, &mut || true), None);
for unsupported in [
Value::tuple(vec![tuple]),
Value::string(&names, "x"),
Value::empty_set(Ctx::dive()),
Value::fcn(vec![(Value::Int(0), Value::Int(1))], Ctx::dive()).expect("general domain"),
] {
assert_eq!(
unsupported.flat_cache_heap_bytes(&names, &mut || true),
None
);
}
assert_eq!(record.flat_cache_heap_bytes(&names, &mut || false), None);
assert_eq!(
Value::Int(1).flat_cache_heap_bytes(&names, &mut || true),
Some(0)
);
}
#[test]
fn closed_function_charge_covers_nested_arrays_and_future_domain_order() {
use crate::function_domain::DomainInner;
use crate::value::{FcnInner, FcnRepr};
for ctx in [Ctx::dive(), Ctx::tlc()] {
let names = Interner::new();
let child = Value::record(
vec![(
names.intern("message"),
Value::tuple(vec![Value::string(&names, "tok"), Value::Int(3)]),
)],
ctx,
)
.expect("record");
let child_bytes = child
.closed_function_cache_heap_bytes(&names, &mut || true)
.expect("closed child");
let value = Value::fcn(
vec![(Value::Int(0), child.clone()), (Value::Int(1), child)],
ctx,
)
.expect("integer-domain function");
let expected = std::mem::size_of::<FcnInner>()
+ std::mem::size_of::<DomainInner>()
+ 4 * std::mem::size_of::<Value>()
+ 2 * std::mem::size_of::<usize>()
+ 2 * child_bytes;
assert_eq!(
value.closed_function_cache_heap_bytes(&names, &mut || true),
Some(expected)
);
let repr = &value.as_fcn().expect("function").0.repr;
assert!(matches!(repr, FcnRepr::General(_)));
if let FcnRepr::General(general) = repr {
assert_eq!(
general.domain.checked_index(&Value::Int(1)),
crate::DomainLookup::Found(1)
);
assert_eq!(general.domain.tlc_order().expect("pure order").len(), 2);
}
assert_eq!(
value.closed_function_cache_heap_bytes(&names, &mut || true),
Some(expected),
"lazy header facts/order allocation were prepaid"
);
}
}
#[test]
fn closed_inspection_declines_history_foreign_names_and_product_keys_without_effects() {
let names = Interner::new();
let foreign = Interner::new();
for leaf in [
Value::empty_set(Ctx::dive()),
Value::set_raw(vec![Value::Int(1)], Ctx::dive()),
Value::string(&foreign, "foreign"),
Value::model(&names, "model"),
Value::int(crate::Int::from_big(num_bigint::BigInt::from(1u64) << 80)),
] {
let tree = Value::tuple(vec![leaf]);
assert_eq!(
tree.closed_function_cache_heap_bytes(&names, &mut || true),
None
);
}
let key = Value::tuple(vec![Value::Int(0)]);
let product =
Value::fcn(vec![(key, Value::Int(1))], Ctx::dive()).expect("product-domain function");
assert_eq!(
product.closed_function_cache_heap_bytes(&names, &mut || true),
None
);
let value = Value::tuple(vec![Value::Int(1)]);
assert_eq!(
value.closed_function_cache_heap_bytes(&names, &mut || false),
None
);
let mut deep = Value::Int(0);
for _ in 0..65 {
deep = Value::tuple(vec![deep]);
}
assert_eq!(
deep.closed_function_cache_heap_bytes(&names, &mut || true),
None
);
let wide = Value::tuple(vec![Value::Int(0); 4096]);
assert_eq!(
wide.closed_function_cache_heap_bytes(&names, &mut || true),
None
);
assert!(
Value::tuple(vec![Value::Int(0); 4095])
.closed_function_cache_heap_bytes(&names, &mut || true)
.is_some()
);
}
#[test]
fn concrete_set_charge_includes_headers_arrays_and_repeated_closed_children() {
use crate::value::{FcnInner, SetInner};
let names = Interner::new();
for ctx in [Ctx::dive(), Ctx::tlc()] {
let leaf = Value::set(vec![Value::Int(1)], ctx).expect("set");
let leaf_bytes = std::mem::size_of::<SetInner>() + std::mem::size_of::<Value>();
assert_eq!(
leaf.closed_cache_heap_bytes(&names, &mut || true),
Some(leaf_bytes)
);
assert_eq!(
leaf.closed_function_cache_heap_bytes(&names, &mut || true),
None
);
let tree = Value::tuple(vec![leaf.clone(), leaf]);
assert_eq!(
tree.closed_cache_heap_bytes(&names, &mut || true),
Some(
std::mem::size_of::<FcnInner>()
+ 2 * std::mem::size_of::<Value>()
+ 2 * leaf_bytes
)
);
let record = Value::record(vec![(names.intern("items"), tree)], ctx).expect("record");
let outer = Value::set(vec![record], ctx).expect("outer set");
assert!(
outer
.closed_cache_heap_bytes(&names, &mut || true)
.is_some()
);
assert_eq!(outer.closed_cache_heap_bytes(&names, &mut || false), None);
}
}
#[test]
fn set_cache_inspection_keeps_symbolic_raw_foreign_and_depth_boundaries() {
use crate::value::{Set, SetRepr};
let names = Interner::new();
let foreign = Interner::new();
for ctx in [Ctx::dive(), Ctx::tlc()] {
let raw = Value::set_raw(vec![Value::Int(1)], ctx);
let interval = Value::interval(1.into(), 2.into(), ctx);
interval
.as_set()
.expect("interval")
.elements(ctx)
.expect("cached elements");
for value in [
raw,
interval,
Value::nat(ctx),
Value::subset(Value::empty_set(ctx), ctx),
Value::Set(Set::new(ctx.order, SetRepr::Enum)),
Value::tuple(vec![Value::string(&foreign, "foreign")]),
Value::tuple(vec![Value::model(&names, "model")]),
] {
assert_eq!(value.closed_cache_heap_bytes(&names, &mut || true), None);
}
let mut deep = Value::Int(0);
for _ in 0..65 {
deep = Value::set(vec![deep], ctx).expect("nested set");
}
assert_eq!(deep.closed_cache_heap_bytes(&names, &mut || true), None);
let wide = Value::set((0..4096).map(Value::Int).collect(), ctx).expect("wide set");
assert_eq!(wide.closed_cache_heap_bytes(&names, &mut || true), None);
}
}
#[test]
fn concrete_cache_inspection_never_calls_even_an_already_materialized_provider() {
use std::sync::atomic::{AtomicUsize, Ordering};
#[derive(Debug)]
struct Probe(Arc<AtomicUsize>);
impl crate::DeferredSet for Probe {
fn kind(&self) -> crate::DeferredKind {
self.0.fetch_add(1, Ordering::Relaxed);
crate::DeferredKind::Filter
}
fn elements(&self, _ctx: Ctx) -> crate::Result<Vec<Value>> {
self.0.fetch_add(1, Ordering::Relaxed);
Ok(vec![Value::Int(1)])
}
fn member(&self, _value: &Value, _ctx: Ctx) -> Option<crate::Result<bool>> {
self.0.fetch_add(1, Ordering::Relaxed);
Some(Ok(true))
}
}
let names = Interner::new();
for ctx in [Ctx::dive(), Ctx::tlc()] {
let calls = Arc::new(AtomicUsize::new(0));
let value = Value::deferred(Arc::new(Probe(calls.clone())), ctx);
assert_eq!(value.closed_cache_heap_bytes(&names, &mut || true), None);
assert_eq!(calls.load(Ordering::Relaxed), 0);
let set = value.as_set().expect("provider set");
set.elements(ctx)
.expect("deliberately materialize provider");
assert!(set.has_cached_elements());
let before = calls.load(Ordering::Relaxed);
assert_eq!(value.closed_cache_heap_bytes(&names, &mut || true), None);
assert_eq!(calls.load(Ordering::Relaxed), before);
}
}
}