/
graph_links.rs
709 lines (599 loc) · 23.2 KB
/
graph_links.rs
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
use std::cmp::max;
use std::fs::OpenOptions;
use std::mem::size_of;
use std::ops::Range;
use std::path::{Path, PathBuf};
use std::sync::Arc;
use common::types::PointOffsetType;
use memmap2::{Mmap, MmapMut};
use memory::{madvise, mmap_ops};
use crate::common::operation_error::{OperationError, OperationResult};
use crate::common::vector_utils::TrySetCapacityExact;
pub const MMAP_PANIC_MESSAGE: &str = "Mmap links are not loaded";
/*
Links data for whole graph layers.
sorted
points: points:
points to lvl 012345 142350
0 -> 0
1 -> 4 lvl4: 7 lvl4: 7
2 -> 2 lvl3: Z Y lvl3: ZY
3 -> 2 lvl2: abcd lvl2: adbc
4 -> 3 lvl1: ABCDE lvl1: ADBCE
5 -> 1 lvl0: 123456 lvl0: 123456 <- lvl 0 is not sorted
lvl offset: 6 11 15 17
│ │ │ │
│ │ │ │
▼ ▼ ▼ ▼
indexes: 012345 6789A BCDE FG H
flatten: 123456 ADBCE adbc ZY 7
▲ ▲ ▲ ▲ ▲ ▲ ▲
│ │ │ │ │ │ │
│ │ │ │ │ │ │
│ │ │ │ │ │ │
reindex: 142350 142350 142350 142350 (same for each level)
for lvl > 0:
links offset = level_offsets[level] + offsets[reindex[point_id]]
*/
#[derive(Default)]
struct GraphLinksFileHeader {
pub point_count: u64,
pub levels_count: u64,
pub total_links_len: u64,
pub total_offsets_len: u64,
}
fn get_reindex_slice<'a>(
data: &'a [u8],
header: &'a GraphLinksFileHeader,
) -> &'a [PointOffsetType] {
let reindex_range = header.get_reindex_range();
let reindex_byte_slice = &data[reindex_range];
mmap_ops::transmute_from_u8_to_slice(reindex_byte_slice)
}
fn get_links_slice<'a>(data: &'a [u8], header: &'a GraphLinksFileHeader) -> &'a [PointOffsetType] {
let links_range = header.get_links_range();
let links_byte_slice = &data[links_range];
mmap_ops::transmute_from_u8_to_slice(links_byte_slice)
}
fn get_offsets_slice<'a>(data: &'a [u8], header: &'a GraphLinksFileHeader) -> &'a [u64] {
let offsets_range = header.get_offsets_range();
let offsets_byte_slice = &data[offsets_range];
mmap_ops::transmute_from_u8_to_slice(offsets_byte_slice)
}
fn get_level_offsets<'a>(data: &'a [u8], header: &GraphLinksFileHeader) -> &'a [u64] {
let level_offsets_range = header.get_level_offsets_range();
let level_offsets_byte_slice = &data[level_offsets_range];
mmap_ops::transmute_from_u8_to_slice(level_offsets_byte_slice)
}
impl GraphLinksFileHeader {
pub fn raw_size() -> usize {
size_of::<u64>() * 4
}
pub fn serialize_bytes_to(&self, raw_data: &mut [u8]) {
let byte_slice = &mut raw_data[0..Self::raw_size()];
let arr: &mut [u64] = mmap_ops::transmute_from_u8_to_mut_slice(byte_slice);
arr[0] = self.point_count;
arr[1] = self.levels_count;
arr[2] = self.total_links_len;
arr[3] = self.total_offsets_len;
}
pub fn deserialize_bytes_from(raw_data: &[u8]) -> GraphLinksFileHeader {
let byte_slice = &raw_data[0..Self::raw_size()];
let arr: &[u64] = mmap_ops::transmute_from_u8_to_slice(byte_slice);
GraphLinksFileHeader {
point_count: arr[0],
levels_count: arr[1],
total_links_len: arr[2],
total_offsets_len: arr[3],
}
}
pub fn get_data_size(&self) -> u64 {
self.get_offsets_range().end as u64
}
pub fn get_level_offsets_range(&self) -> Range<usize> {
// level offsets are stored after header
// but we might want to have some extra space for future changes
let start = max(64, Self::raw_size());
start..start + self.levels_count as usize * size_of::<u64>()
}
pub fn get_reindex_range(&self) -> Range<usize> {
let start = self.get_level_offsets_range().end;
start..start + self.point_count as usize * size_of::<PointOffsetType>()
}
pub fn get_links_range(&self) -> Range<usize> {
let start = self.get_reindex_range().end;
start..start + self.total_links_len as usize * size_of::<PointOffsetType>()
}
pub fn get_offsets_range(&self) -> Range<usize> {
let start = self.get_links_range().end;
start..start + self.total_offsets_len as usize * size_of::<u64>()
}
}
pub struct GraphLinksConverter {
edges: Vec<Vec<Vec<PointOffsetType>>>,
reindex: Vec<PointOffsetType>,
back_index: Vec<usize>,
total_links_len: usize,
total_offsets_len: usize,
path: Option<PathBuf>,
}
impl GraphLinksConverter {
pub fn new(edges: Vec<Vec<Vec<PointOffsetType>>>) -> Self {
if edges.is_empty() {
return Self {
edges,
reindex: Vec::new(),
back_index: Vec::new(),
total_links_len: 0,
total_offsets_len: 1,
path: None,
};
}
// create map from index in `offsets` to point_id
let mut back_index: Vec<usize> = (0..edges.len()).collect();
// sort by max layer and use this map to build `Self.reindex`
back_index.sort_unstable_by_key(|&i| edges[i].len());
back_index.reverse();
// `reindex` is map from point id to index in `Self.offsets`
let mut reindex = vec![0; back_index.len()];
for i in 0..back_index.len() {
reindex[back_index[i]] = i as PointOffsetType;
}
// estimate size of `links` and `offsets`
let mut total_links_len = 0;
let mut total_offsets_len = 1;
for point in edges.iter() {
for layer in point.iter() {
total_links_len += layer.len();
total_offsets_len += 1;
}
}
Self {
edges,
reindex,
back_index,
total_links_len,
total_offsets_len,
path: None,
}
}
pub fn set_path(&mut self, path: PathBuf) {
self.path = Some(path);
}
fn get_header(&self) -> GraphLinksFileHeader {
GraphLinksFileHeader {
point_count: self.reindex.len() as u64,
levels_count: self.get_levels_count() as u64,
total_links_len: self.total_links_len as u64,
total_offsets_len: self.total_offsets_len as u64,
}
}
/// Size of compacted graph in bytes.
pub fn data_size(&self) -> u64 {
self.get_header().get_data_size()
}
pub fn serialize_to(&self, bytes_data: &mut [u8]) {
let header = self.get_header();
header.serialize_bytes_to(bytes_data);
{
let reindex_range = header.get_reindex_range();
let reindex_byte_slice = &mut bytes_data[reindex_range];
let reindex_slice: &mut [PointOffsetType] =
mmap_ops::transmute_from_u8_to_mut_slice(reindex_byte_slice);
reindex_slice.copy_from_slice(&self.reindex);
}
let header_levels_count = header.levels_count as usize;
let mut level_offsets = Vec::with_capacity(header_levels_count);
{
let links_range = header.get_links_range();
let offsets_range = header.get_offsets_range();
let union_range = links_range.start..offsets_range.end;
let (links_mmap, offsets_mmap) = bytes_data[union_range]
.as_mut()
.split_at_mut(links_range.len());
let links_mmap: &mut [PointOffsetType] =
mmap_ops::transmute_from_u8_to_mut_slice(links_mmap);
let offsets_mmap: &mut [u64] = mmap_ops::transmute_from_u8_to_mut_slice(offsets_mmap);
offsets_mmap[0] = 0;
let mut links_pos = 0;
let mut offsets_pos = 1;
for level in 0..header_levels_count {
level_offsets.push(offsets_pos as u64 - 1);
self.iterate_level_points(level, |_, links| {
links_mmap[links_pos..links_pos + links.len()].copy_from_slice(links);
links_pos += links.len();
offsets_mmap[offsets_pos] = links_pos as u64;
offsets_pos += 1;
});
}
}
{
let level_offsets_range = header.get_level_offsets_range();
let level_offsets_byte_slice = &mut bytes_data[level_offsets_range];
let level_offsets_slice: &mut [u64] =
mmap_ops::transmute_from_u8_to_mut_slice(level_offsets_byte_slice);
level_offsets_slice.copy_from_slice(&level_offsets);
}
}
pub fn to_bytes(&self) -> Vec<u8> {
let mut bytes = vec![0; self.data_size() as usize];
self.serialize_to(&mut bytes);
bytes
}
pub fn save_as(&mut self, path: &Path) -> OperationResult<()> {
self.path = Some(path.to_path_buf());
let temp_path = path.with_extension("tmp");
{
let file = OpenOptions::new()
.read(true)
.write(true)
.create(true)
// Don't truncate because we explicitly set the length later
.truncate(false)
.open(temp_path.as_path())?;
file.set_len(self.data_size())?;
let m = unsafe { MmapMut::map_mut(&file) };
let mut mmap = m?;
self.serialize_to(&mut mmap);
mmap.flush()?;
}
std::fs::rename(temp_path, path)?;
Ok(())
}
pub fn get_levels_count(&self) -> usize {
if self.back_index.is_empty() {
return 0;
}
// because back_index is sorted by point`s max layer, we can retrieve max level from `point_id = back_index[0]`
self.edges[self.back_index[0]].len()
}
pub fn iterate_level_points<F>(&self, level: usize, mut f: F)
where
F: FnMut(usize, &Vec<PointOffsetType>),
{
let edges_len = self.edges.len();
if level == 0 {
(0..edges_len).for_each(|point_id| f(point_id, &self.edges[point_id][0]));
} else {
for i in 0..edges_len {
let point_id = self.back_index[i];
if level >= self.edges[point_id].len() {
break;
}
f(point_id, &self.edges[point_id][level]);
}
}
}
}
pub trait GraphLinks: Default {
fn load_from_file(path: &Path) -> OperationResult<Self>;
fn from_converter(converter: GraphLinksConverter) -> OperationResult<Self>;
fn offsets_len(&self) -> usize;
fn levels_count(&self) -> usize;
fn get_links(&self, range: Range<usize>) -> &[PointOffsetType];
fn get_links_range(&self, idx: usize) -> Range<usize>;
fn get_level_offset(&self, level: usize) -> usize;
fn reindex(&self, point_id: PointOffsetType) -> PointOffsetType;
fn num_points(&self) -> usize;
fn links(&self, point_id: PointOffsetType, level: usize) -> &[PointOffsetType] {
if level == 0 {
let links_range = self.get_links_range(point_id as usize);
self.get_links(links_range)
} else {
let reindexed_point_id = self.reindex(point_id) as usize;
let layer_offsets_start = self.get_level_offset(level);
let links_range = self.get_links_range(layer_offsets_start + reindexed_point_id);
self.get_links(links_range)
}
}
fn point_level(&self, point_id: PointOffsetType) -> usize {
let reindexed_point_id = self.reindex(point_id) as usize;
// level 0 is always present, start checking from level 1. Stop checking when level is incorrect
for level in 1.. {
if let Some(offsets_range) = self.get_level_offsets_range(level) {
if offsets_range.start + reindexed_point_id >= offsets_range.end {
// incorrect level because point_id is out of range
return level - 1;
}
} else {
// incorrect level because this level is larger that available levels
return level - 1;
}
}
unreachable!()
}
fn get_level_offsets_range(&self, level: usize) -> Option<Range<usize>> {
if level < self.levels_count() {
let layer_offsets_start = self.get_level_offset(level);
let layer_offsets_end = if level + 1 < self.levels_count() {
// `level` is not last, next level_offsets is end of range
self.get_level_offset(level + 1)
} else {
// `level` is last, next `offsets.len()` is end of range
self.offsets_len() - 1
};
Some(layer_offsets_start..layer_offsets_end)
} else {
None
}
}
}
#[derive(Default)]
pub struct GraphLinksRam {
// all flattened links of all levels
links: Vec<PointOffsetType>,
// all ranges in `links`. each range is `links[offsets[i]..offsets[i+1]]`
// ranges are sorted by level
offsets: Vec<u64>,
// start offset of each level in `offsets`
level_offsets: Vec<u64>,
// for level 1 and above: reindex[point_id] = index of point_id in offsets
reindex: Vec<PointOffsetType>,
}
impl GraphLinksRam {
pub fn load_from_memory(data: &[u8]) -> OperationResult<Self> {
let header = GraphLinksFileHeader::deserialize_bytes_from(data);
let mut links: Vec<PointOffsetType> = Vec::new();
let mut offsets: Vec<u64> = Vec::new();
let mut level_offsets: Vec<u64> = Vec::new();
let mut reindex: Vec<PointOffsetType> = Vec::new();
let link_slice = get_links_slice(data, &header);
links.try_set_capacity_exact(link_slice.len())?;
links.extend_from_slice(link_slice);
let offsets_slice = get_offsets_slice(data, &header);
offsets.try_set_capacity_exact(offsets_slice.len())?;
offsets.extend_from_slice(offsets_slice);
let level_offsets_slice = get_level_offsets(data, &header);
level_offsets.try_set_capacity_exact(level_offsets_slice.len())?;
level_offsets.extend_from_slice(level_offsets_slice);
let reindex_slice = get_reindex_slice(data, &header);
reindex.try_set_capacity_exact(reindex_slice.len())?;
reindex.extend_from_slice(reindex_slice);
let graph_links = Self {
links,
offsets,
level_offsets,
reindex,
};
Ok(graph_links)
}
}
impl GraphLinks for GraphLinksRam {
fn load_from_file(path: &Path) -> OperationResult<Self> {
let file = OpenOptions::new()
.read(true)
.write(false)
.create(false)
.open(path)?;
let mmap = unsafe { Mmap::map(&file)? };
Self::load_from_memory(&mmap)
}
fn from_converter(converter: GraphLinksConverter) -> OperationResult<Self> {
let mut data = vec![0; converter.data_size() as usize];
converter.serialize_to(&mut data);
drop(converter);
Self::load_from_memory(&data)
}
fn offsets_len(&self) -> usize {
self.offsets.len()
}
fn levels_count(&self) -> usize {
self.level_offsets.len()
}
fn get_links(&self, range: Range<usize>) -> &[PointOffsetType] {
&self.links[range]
}
fn get_links_range(&self, idx: usize) -> Range<usize> {
let start = self.offsets[idx];
let end = self.offsets[idx + 1];
start as usize..end as usize
}
fn get_level_offset(&self, level: usize) -> usize {
self.level_offsets[level] as usize
}
fn reindex(&self, point_id: PointOffsetType) -> PointOffsetType {
self.reindex[point_id as usize]
}
fn num_points(&self) -> usize {
self.reindex.len()
}
}
#[derive(Default)]
pub struct GraphLinksMmap {
mmap: Option<Arc<Mmap>>,
header: GraphLinksFileHeader,
level_offsets: Vec<u64>,
}
impl GraphLinksMmap {
fn get_reindex_slice(&self) -> &[PointOffsetType] {
if let Some(mmap) = &self.mmap {
get_reindex_slice(mmap, &self.header)
} else {
panic!("{}", MMAP_PANIC_MESSAGE);
}
}
fn get_links_slice(&self) -> &[PointOffsetType] {
if let Some(mmap) = &self.mmap {
get_links_slice(mmap, &self.header)
} else {
panic!("{}", "Mmap links are not loaded");
}
}
fn get_offsets_slice(&self) -> &[u64] {
if let Some(mmap) = &self.mmap {
get_offsets_slice(mmap, &self.header)
} else {
panic!("{}", MMAP_PANIC_MESSAGE);
}
}
pub fn prefault_mmap_pages(&self, path: &Path) -> Option<mmap_ops::PrefaultMmapPages> {
mmap_ops::PrefaultMmapPages::new(self.mmap.clone()?, Some(path)).into()
}
}
impl GraphLinks for GraphLinksMmap {
fn load_from_file(path: &Path) -> OperationResult<Self> {
let file = OpenOptions::new()
.read(true)
.write(false)
.create(false)
.open(path)?;
let mmap = unsafe { Mmap::map(&file)? };
madvise::madvise(&mmap, madvise::get_global())?;
let header = GraphLinksFileHeader::deserialize_bytes_from(&mmap);
let level_offsets = get_level_offsets(&mmap, &header).to_vec();
Ok(Self {
mmap: Some(Arc::new(mmap)),
header,
level_offsets,
})
}
fn from_converter(converter: GraphLinksConverter) -> OperationResult<Self> {
if let Some(path) = converter.path {
GraphLinksMmap::load_from_file(&path)
} else {
Err(OperationError::service_error(
"HNSW links Data needs to be saved to file before it can be loaded as mmap",
))
}
}
fn offsets_len(&self) -> usize {
self.header.get_offsets_range().len() / size_of::<u64>()
}
fn levels_count(&self) -> usize {
self.level_offsets.len()
}
fn get_links(&self, range: Range<usize>) -> &[PointOffsetType] {
&self.get_links_slice()[range]
}
fn get_links_range(&self, idx: usize) -> Range<usize> {
let offsets_slice = self.get_offsets_slice();
offsets_slice[idx] as usize..offsets_slice[idx + 1] as usize
}
fn get_level_offset(&self, level: usize) -> usize {
self.level_offsets[level] as usize
}
fn reindex(&self, point_id: PointOffsetType) -> PointOffsetType {
self.get_reindex_slice()[point_id as usize]
}
fn num_points(&self) -> usize {
self.header.point_count as usize
}
}
#[cfg(test)]
mod tests {
use rand::Rng;
use tempfile::Builder;
use super::*;
fn to_vec<TGraphLinks: GraphLinks>(links: &TGraphLinks) -> Vec<Vec<Vec<PointOffsetType>>> {
let mut result = Vec::new();
let num_points = links.num_points();
for i in 0..num_points {
let mut layers = Vec::new();
let num_levels = links.point_level(i as PointOffsetType) + 1;
for level in 0..num_levels {
let links = links.links(i as PointOffsetType, level).to_vec();
layers.push(links);
}
result.push(layers);
}
result
}
fn random_links(
points_count: usize,
max_levels_count: usize,
) -> Vec<Vec<Vec<PointOffsetType>>> {
let mut rng = rand::thread_rng();
(0..points_count)
.map(|_| {
let levels_count = rng.gen_range(1..max_levels_count);
(0..levels_count)
.map(|_| {
let links_count = rng.gen_range(0..max_levels_count);
(0..links_count)
.map(|_| rng.gen_range(0..points_count) as PointOffsetType)
.collect()
})
.collect()
})
.collect()
}
/// Test that random links can be saved by `GraphLinksConverter` and loaded correctly by a GraphLinks impl.
fn test_save_load<A>(points_count: usize, max_levels_count: usize)
where
A: GraphLinks,
{
let path = Builder::new().prefix("graph_dir").tempdir().unwrap();
let links_file = path.path().join("links.bin");
let links = random_links(points_count, max_levels_count);
{
let mut links_converter = GraphLinksConverter::new(links.clone());
links_converter.save_as(&links_file).unwrap();
}
let cmp_links = to_vec(&A::load_from_file(&links_file).unwrap());
assert_eq!(links, cmp_links);
}
#[test]
fn test_graph_links_construction() {
// no points
let links: Vec<Vec<Vec<PointOffsetType>>> = vec![];
let cmp_links = to_vec(
&GraphLinksRam::from_converter(GraphLinksConverter::new(links.clone())).unwrap(),
);
assert_eq!(links, cmp_links);
// 2 points without any links
let links: Vec<Vec<Vec<PointOffsetType>>> = vec![vec![vec![]], vec![vec![]]];
let cmp_links = to_vec(
&GraphLinksRam::from_converter(GraphLinksConverter::new(links.clone())).unwrap(),
);
assert_eq!(links, cmp_links);
// one link at level 0
let links: Vec<Vec<Vec<PointOffsetType>>> = vec![vec![vec![1]], vec![vec![0]]];
let cmp_links = to_vec(
&GraphLinksRam::from_converter(GraphLinksConverter::new(links.clone())).unwrap(),
);
assert_eq!(links, cmp_links);
// 3 levels with no links at second level
let links: Vec<Vec<Vec<PointOffsetType>>> = vec![
vec![vec![1, 2]],
vec![vec![0, 2], vec![], vec![2]],
vec![vec![0, 1], vec![], vec![1]],
];
let cmp_links = to_vec(
&GraphLinksRam::from_converter(GraphLinksConverter::new(links.clone())).unwrap(),
);
assert_eq!(links, cmp_links);
// 3 levels with no links at last level
let links: Vec<Vec<Vec<PointOffsetType>>> = vec![
vec![vec![1, 2], vec![2], vec![]],
vec![vec![0, 2], vec![1], vec![]],
vec![vec![0, 1]],
];
let cmp_links = to_vec(
&GraphLinksRam::from_converter(GraphLinksConverter::new(links.clone())).unwrap(),
);
assert_eq!(links, cmp_links);
// 4 levels with random nonexistent links
let links: Vec<Vec<Vec<PointOffsetType>>> = vec![
vec![vec![1, 2, 5, 6]],
vec![vec![0, 2, 7, 8], vec![], vec![34, 45, 10]],
vec![vec![0, 1, 1, 2], vec![3, 5, 9], vec![9, 8], vec![9], vec![]],
vec![vec![0, 1, 5, 6], vec![1, 5, 0]],
vec![vec![0, 1, 9, 18], vec![1, 5, 6], vec![5], vec![9]],
];
let cmp_links = to_vec(
&GraphLinksRam::from_converter(GraphLinksConverter::new(links.clone())).unwrap(),
);
assert_eq!(links, cmp_links);
// fully random links
let links = random_links(100, 10);
let cmp_links = to_vec(
&GraphLinksRam::from_converter(GraphLinksConverter::new(links.clone())).unwrap(),
);
assert_eq!(links, cmp_links);
}
#[test]
fn test_graph_links_mmap_ram_compatibility() {
test_save_load::<GraphLinksRam>(1000, 10);
test_save_load::<GraphLinksMmap>(1000, 10);
}
}