-
-
Notifications
You must be signed in to change notification settings - Fork 6
Expand file tree
/
Copy pathUnitedMemoryLinksBase.cs
More file actions
936 lines (898 loc) · 34.8 KB
/
UnitedMemoryLinksBase.cs
File metadata and controls
936 lines (898 loc) · 34.8 KB
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
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
using System;
using System.Collections.Generic;
using System.Numerics;
using System.Runtime.CompilerServices;
using Platform.Disposables;
using Platform.Singletons;
using Platform.Converters;
using Platform.Numbers;
using Platform.Memory;
using Platform.Data.Exceptions;
using Platform.Delegates;
#pragma warning disable CS1591 // Missing XML comment for publicly visible type or member
namespace Platform.Data.Doublets.Memory.United.Generic
{
/// <summary>
/// <para>
/// Represents the united memory links base.
/// </para>
/// <para></para>
/// </summary>
/// <seealso cref="DisposableBase"/>
/// <seealso cref="ILinks{TLinkAddress}"/>
public abstract class UnitedMemoryLinksBase<TLinkAddress> : DisposableBase, ILinks<TLinkAddress> where TLinkAddress : IUnsignedNumber<TLinkAddress>, IComparisonOperators<TLinkAddress, TLinkAddress, bool>
{
private static readonly Comparer<TLinkAddress> _comparer = Comparer<TLinkAddress>.Default;
private static readonly TLinkAddress _zero = default;
private static readonly TLinkAddress _one = ++_zero;
/// <summary>Возвращает размер одной связи в байтах.</summary>
/// <remarks>
/// Используется только во вне класса, не рекомедуется использовать внутри.
/// Так как во вне не обязательно будет доступен unsafe С#.
/// </remarks>
public static readonly long LinkSizeInBytes = RawLink<TLinkAddress>.SizeInBytes;
/// <summary>
/// <para>
/// The size in bytes.
/// </para>
/// <para></para>
/// </summary>
public static readonly long LinkHeaderSizeInBytes = LinksHeader<TLinkAddress>.SizeInBytes;
/// <summary>
/// <para>
/// The link size in bytes.
/// </para>
/// <para></para>
/// </summary>
public static readonly long DefaultLinksSizeStep = LinkSizeInBytes * 1024 * 1024;
/// <summary>
/// <para>
/// The memory.
/// </para>
/// <para></para>
/// </summary>
protected readonly IResizableDirectMemory _memory;
/// <summary>
/// <para>
/// The memory reservation step.
/// </para>
/// <para></para>
/// </summary>
protected readonly long _memoryReservationStep;
/// <summary>
/// <para>
/// The targets tree methods.
/// </para>
/// <para></para>
/// </summary>
protected ILinksTreeMethods<TLinkAddress> TargetsTreeMethods;
/// <summary>
/// <para>
/// The sources tree methods.
/// </para>
/// <para></para>
/// </summary>
protected ILinksTreeMethods<TLinkAddress> SourcesTreeMethods;
// TODO: Возможно чтобы гарантированно проверять на то, является ли связь удалённой, нужно использовать не список а дерево, так как так можно быстрее проверить на наличие связи внутри
/// <summary>
/// <para>
/// The unused links list methods.
/// </para>
/// <para></para>
/// </summary>
protected ILinksListMethods<TLinkAddress> UnusedLinksListMethods;
/// <summary>
/// Возвращает общее число связей находящихся в хранилище.
/// </summary>
protected virtual TLinkAddress Total
{
[MethodImpl(MethodImplOptions.AggressiveInlining)]
get
{
ref var header = ref GetHeaderReference();
return Subtract(header.AllocatedLinks, header.FreeLinks);
}
}
/// <summary>
/// <para>
/// Gets the constants value.
/// </para>
/// <para></para>
/// </summary>
public virtual LinksConstants<TLinkAddress> Constants
{
[MethodImpl(MethodImplOptions.AggressiveInlining)]
get;
}
/// <summary>
/// <para>
/// Ensures that this instance has not been disposed.
/// </para>
/// <para></para>
/// </summary>
/// <exception cref="ObjectDisposedException">
/// <para>Thrown when this instance has been disposed.</para>
/// <para></para>
/// </exception>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
protected virtual void EnsureNotDisposed()
{
if (IsDisposed)
{
throw new ObjectDisposedException(GetType().Name, "Cannot access a disposed Links instance. The database connection has been closed and is no longer available for operations.");
}
}
/// <summary>
/// <para>
/// Initializes a new <see cref="UnitedMemoryLinksBase"/> instance.
/// </para>
/// <para></para>
/// </summary>
/// <param name="memory">
/// <para>A memory.</para>
/// <para></para>
/// </param>
/// <param name="memoryReservationStep">
/// <para>A memory reservation step.</para>
/// <para></para>
/// </param>
/// <param name="constants">
/// <para>A constants.</para>
/// <para></para>
/// </param>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
protected UnitedMemoryLinksBase(IResizableDirectMemory memory, long memoryReservationStep, LinksConstants<TLinkAddress> constants)
{
_memory = memory;
_memoryReservationStep = memoryReservationStep;
Constants = constants;
}
/// <summary>
/// <para>
/// Initializes a new <see cref="UnitedMemoryLinksBase"/> instance.
/// </para>
/// <para></para>
/// </summary>
/// <param name="memory">
/// <para>A memory.</para>
/// <para></para>
/// </param>
/// <param name="memoryReservationStep">
/// <para>A memory reservation step.</para>
/// <para></para>
/// </param>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
protected UnitedMemoryLinksBase(IResizableDirectMemory memory, long memoryReservationStep) : this(memory, memoryReservationStep, Default<LinksConstants<TLinkAddress>>.Instance) { }
/// <summary>
/// <para>
/// Inits the memory.
/// </para>
/// <para></para>
/// </summary>
/// <param name="memory">
/// <para>The memory.</para>
/// <para></para>
/// </param>
/// <param name="memoryReservationStep">
/// <para>The memory reservation step.</para>
/// <para></para>
/// </param>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
protected virtual void Init(IResizableDirectMemory memory, long memoryReservationStep)
{
if (memory.ReservedCapacity < memoryReservationStep)
{
memory.ReservedCapacity = memoryReservationStep;
}
SetPointers(memory);
ref var header = ref GetHeaderReference();
// Гарантия корректности _memory.UsedCapacity относительно _header->AllocatedLinks
memory.UsedCapacity = (long.CreateTruncating(header.AllocatedLinks) * LinkSizeInBytes) + LinkHeaderSizeInBytes;
// Гарантия корректности _header->ReservedLinks относительно _memory.ReservedCapacity
header.ReservedLinks = TLinkAddress.CreateTruncating((memory.ReservedCapacity - LinkHeaderSizeInBytes) / LinkSizeInBytes);
}
/// <summary>
/// <para>
/// Counts the substitution.
/// </para>
/// <para></para>
/// </summary>
/// <param name="restriction">
/// <para>The substitution.</para>
/// <para></para>
/// </param>
/// <exception cref="NotSupportedException">
/// <para>Другие размеры и способы ограничений не поддерживаются.</para>
/// <para></para>
/// </exception>
/// <returns>
/// <para>The link</para>
/// <para></para>
/// </returns>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public virtual TLinkAddress Count(IList<TLinkAddress>? restriction)
{
EnsureNotDisposed();
// Если нет ограничений, тогда возвращаем общее число связей находящихся в хранилище.
if (restriction.Count == 0)
{
return Total;
}
var constants = Constants;
var any = constants.Any;
var index = this.GetIndex(restriction);
if (restriction.Count == 1)
{
if (index == any)
{
return Total;
}
return Exists(index) ? GetOne() : GetZero();
}
if (restriction.Count == 2)
{
var value = restriction[1];
if (index == any)
{
if (value == any)
{
return Total; // Any - как отсутствие ограничения
}
return Add(SourcesTreeMethods.CountUsages(value), TargetsTreeMethods.CountUsages(value));
}
else
{
if (!Exists(index))
{
return GetZero();
}
if (value == any)
{
return GetOne();
}
ref var storedLinkValue = ref GetLinkReference(index);
if (AreEqual(storedLinkValue.Source, value) || AreEqual(storedLinkValue.Target, value))
{
return GetOne();
}
return GetZero();
}
}
if (restriction.Count == 3)
{
var source = this.GetSource(restriction);
var target = this.GetTarget(restriction);
if (index == any)
{
if (source == any && target == any)
{
return Total;
}
else if (source == any)
{
return TargetsTreeMethods.CountUsages(target);
}
else if (target == any)
{
return SourcesTreeMethods.CountUsages(source);
}
else //if(source != Any && target != Any)
{
// Эквивалент Exists(source, target) => Count(Any, source, target) > 0
var link = SourcesTreeMethods.Search(source, target);
return AreEqual(link, constants.Null) ? GetZero() : GetOne();
}
}
else
{
if (!Exists(index))
{
return GetZero();
}
if (source == any && target == any)
{
return GetOne();
}
ref var storedLinkValue = ref GetLinkReference(index);
if (source != any && target != any)
{
if (AreEqual(storedLinkValue.Source, source) && AreEqual(storedLinkValue.Target, target))
{
return GetOne();
}
return GetZero();
}
var value = default(TLinkAddress);
if (source == any)
{
value = target;
}
if (target == any)
{
value = source;
}
if (AreEqual(storedLinkValue.Source, value) || AreEqual(storedLinkValue.Target, value))
{
return GetOne();
}
return GetZero();
}
}
throw new NotSupportedException("Другие размеры и способы ограничений не поддерживаются.");
}
/// <summary>
/// <para>
/// Eaches the handler.
/// </para>
/// <para></para>
/// </summary>
/// <param name="handler">
/// <para>The handler.</para>
/// <para></para>
/// </param>
/// <param name="restriction">
/// <para>The substitution.</para>
/// <para></para>
/// </param>
/// <exception cref="NotSupportedException">
/// <para>Другие размеры и способы ограничений не поддерживаются.</para>
/// <para></para>
/// </exception>
/// <returns>
/// <para>The link</para>
/// <para></para>
/// </returns>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public virtual TLinkAddress Each(IList<TLinkAddress>? restriction, ReadHandler<TLinkAddress>? handler)
{
EnsureNotDisposed();
var constants = Constants;
var @break = constants.Break;
if (restriction.Count == 0)
{
for (var link = GetOne(); LessOrEqualThan(link, GetHeaderReference().AllocatedLinks); link = link + TLinkAddress.One)
{
if (Exists(link) && AreEqual(handler(GetLinkStruct(link)), @break))
{
return @break;
}
}
return @break;
}
var @continue = constants.Continue;
var any = constants.Any;
var index = this.GetIndex(restriction);
if (restriction.Count == 1)
{
if (index == any)
{
return Each(Array.Empty<TLinkAddress>(), handler);
}
if (!Exists(index))
{
return @continue;
}
return handler(GetLinkStruct(index));
}
if (restriction.Count == 2)
{
var value = restriction[1];
if (index == any)
{
if (value == any)
{
return Each(Array.Empty<TLinkAddress>(), handler);
}
if (AreEqual(Each(new Link<TLinkAddress>(index, value, any), handler), @break))
{
return @break;
}
return Each(new Link<TLinkAddress>(index, any, value), handler);
}
else
{
if (!Exists(index))
{
return @continue;
}
if (value == any)
{
return handler(GetLinkStruct(index));
}
ref var storedLinkValue = ref GetLinkReference(index);
if (AreEqual(storedLinkValue.Source, value) ||
AreEqual(storedLinkValue.Target, value))
{
return handler(GetLinkStruct(index));
}
return @continue;
}
}
if (restriction.Count == 3)
{
var source = this.GetSource(restriction);
var target = this.GetTarget(restriction);
if (index == any)
{
if (source == any && target == any)
{
return Each(Array.Empty<TLinkAddress>(), handler);
}
else if (source == any)
{
return TargetsTreeMethods.EachUsage(target, handler);
}
else if (target == any)
{
return SourcesTreeMethods.EachUsage(source, handler);
}
else //if(source != Any && target != Any)
{
var link = SourcesTreeMethods.Search(source, target);
return AreEqual(link, constants.Null) ? @continue : handler(GetLinkStruct(link));
}
}
else
{
if (!Exists(index))
{
return @continue;
}
if (source == any && target == any)
{
return handler(GetLinkStruct(index));
}
ref var storedLinkValue = ref GetLinkReference(index);
if (source != any && target != any)
{
if (AreEqual(storedLinkValue.Source, source) &&
AreEqual(storedLinkValue.Target, target))
{
return handler(GetLinkStruct(index));
}
return @continue;
}
var value = default(TLinkAddress);
if (source == any)
{
value = target;
}
if (target == any)
{
value = source;
}
if (AreEqual(storedLinkValue.Source, value) ||
AreEqual(storedLinkValue.Target, value))
{
return handler(GetLinkStruct(index));
}
return @continue;
}
}
throw new NotSupportedException("Другие размеры и способы ограничений не поддерживаются.");
}
/// <remarks>
/// TODO: Возможно можно перемещать значения, если указан индекс, но значение существует в другом месте (но не в менеджере памяти, а в логике Links)
/// </remarks>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public virtual TLinkAddress Update(IList<TLinkAddress>? restriction, IList<TLinkAddress>? substitution, WriteHandler<TLinkAddress>? handler)
{
EnsureNotDisposed();
var constants = Constants;
var @null = constants.Null;
var linkIndex = this.GetIndex(restriction);
var before = GetLinkStruct(linkIndex);
ref var link = ref GetLinkReference(linkIndex);
ref var header = ref GetHeaderReference();
ref var firstAsSource = ref header.RootAsSource;
ref var firstAsTarget = ref header.RootAsTarget;
// Будет корректно работать только в том случае, если пространство выделенной связи предварительно заполнено нулями
if (!AreEqual(link.Source, @null))
{
SourcesTreeMethods.Detach(ref firstAsSource, linkIndex);
}
if (!AreEqual(link.Target, @null))
{
TargetsTreeMethods.Detach(ref firstAsTarget, linkIndex);
}
link.Source = this.GetSource(substitution);
link.Target = this.GetTarget(substitution);
if (!AreEqual(link.Source, @null))
{
SourcesTreeMethods.Attach(ref firstAsSource, linkIndex);
}
if (!AreEqual(link.Target, @null))
{
TargetsTreeMethods.Attach(ref firstAsTarget, linkIndex);
}
return handler != null ? handler(before, GetLinkStruct(linkIndex)) : Constants.Continue;
}
/// <remarks>
/// TODO: Возможно нужно будет заполнение нулями, если внешнее API ими не заполняет пространство
/// </remarks>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public virtual TLinkAddress Create(IList<TLinkAddress>? substitution, WriteHandler<TLinkAddress>? handler)
{
EnsureNotDisposed();
ref var header = ref GetHeaderReference();
var freeLink = header.FirstFreeLink;
if (!AreEqual(freeLink, Constants.Null))
{
UnusedLinksListMethods.Detach(freeLink);
}
else
{
var maximumPossibleInnerReference = Constants.InternalReferencesRange.Maximum;
if (GreaterThan(header.AllocatedLinks, maximumPossibleInnerReference))
{
throw new LinksLimitReachedException<TLinkAddress>(maximumPossibleInnerReference);
}
if (GreaterOrEqualThan(header.AllocatedLinks, header.ReservedLinks - TLinkAddress.One))
{
_memory.ReservedCapacity += _memoryReservationStep;
SetPointers(_memory);
header = ref GetHeaderReference();
header.ReservedLinks = TLinkAddress.CreateTruncating(_memory.ReservedCapacity / LinkSizeInBytes);
}
freeLink = header.AllocatedLinks = header.AllocatedLinks + TLinkAddress.One;
_memory.UsedCapacity += LinkSizeInBytes;
}
return handler != null ? handler(null, new Link<TLinkAddress>(freeLink, Constants.Null, Constants.Null)) : Constants.Continue;
}
/// <summary>
/// <para>
/// Deletes the substitution.
/// </para>
/// <para></para>
/// </summary>
/// <param name="restriction">
/// <para>The substitution.</para>
/// <para></para>
/// </param>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public virtual TLinkAddress Delete(IList<TLinkAddress>? restriction, WriteHandler<TLinkAddress>? handler)
{
EnsureNotDisposed();
ref var header = ref GetHeaderReference();
var link = restriction[Constants.IndexPart];
var before = GetLinkStruct(link);
if (LessThan(link, header.AllocatedLinks))
{
UnusedLinksListMethods.AttachAsFirst(link);
// return handler?.Invoke(before, null);
return handler != null ? handler(before, null) : Constants.Continue;
}
else if (AreEqual(link, header.AllocatedLinks))
{
header.AllocatedLinks = header.AllocatedLinks - TLinkAddress.One;
_memory.UsedCapacity -= LinkSizeInBytes;
// Убираем все связи, находящиеся в списке свободных в конце файла, до тех пор, пока не дойдём до первой существующей связи
// Позволяет оптимизировать количество выделенных связей (AllocatedLinks)
while (GreaterThan(header.AllocatedLinks, GetZero()) && IsUnusedLink(header.AllocatedLinks))
{
UnusedLinksListMethods.Detach(header.AllocatedLinks);
header.AllocatedLinks = header.AllocatedLinks - TLinkAddress.One;
_memory.UsedCapacity -= LinkSizeInBytes;
}
return handler != null ? handler(before, null) : Constants.Continue;
}
return Constants.Continue;
}
/// <summary>
/// <para>
/// Gets the link struct using the specified link index.
/// </para>
/// <para></para>
/// </summary>
/// <param name="linkIndex">
/// <para>The link index.</para>
/// <para></para>
/// </param>
/// <returns>
/// <para>A list of t link</para>
/// <para></para>
/// </returns>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public IList<TLinkAddress>? GetLinkStruct(TLinkAddress linkIndex)
{
ref var link = ref GetLinkReference(linkIndex);
return new Link<TLinkAddress>(linkIndex, link.Source, link.Target);
}
/// <remarks>
/// TODO: Возможно это должно быть событием, вызываемым из IMemory, в том случае, если адрес реально поменялся
///
/// Указатель this.links может быть в том же месте,
/// так как 0-я связь не используется и имеет такой же размер как Header,
/// поэтому header размещается в том же месте, что и 0-я связь
/// </remarks>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
protected abstract void SetPointers(IResizableDirectMemory memory);
/// <summary>
/// <para>
/// Resets the pointers.
/// </para>
/// <para></para>
/// </summary>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
protected virtual void ResetPointers()
{
SourcesTreeMethods = null;
TargetsTreeMethods = null;
UnusedLinksListMethods = null;
}
/// <summary>
/// <para>
/// Gets the header reference.
/// </para>
/// <para></para>
/// </summary>
/// <returns>
/// <para>A ref links header of t link</para>
/// <para></para>
/// </returns>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
protected abstract ref LinksHeader<TLinkAddress> GetHeaderReference();
/// <summary>
/// <para>
/// Gets the link reference using the specified link index.
/// </para>
/// <para></para>
/// </summary>
/// <param name="linkIndex">
/// <para>The link index.</para>
/// <para></para>
/// </param>
/// <returns>
/// <para>A ref raw link of t link</para>
/// <para></para>
/// </returns>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
protected abstract ref RawLink<TLinkAddress> GetLinkReference(TLinkAddress linkIndex);
/// <summary>
/// <para>
/// Determines whether this instance exists.
/// </para>
/// <para></para>
/// </summary>
/// <param name="link">
/// <para>The link.</para>
/// <para></para>
/// </param>
/// <returns>
/// <para>The bool</para>
/// <para></para>
/// </returns>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
protected virtual bool Exists(TLinkAddress link)
=> GreaterOrEqualThan(link, Constants.InternalReferencesRange.Minimum)
&& LessOrEqualThan(link, GetHeaderReference().AllocatedLinks)
&& !IsUnusedLink(link);
/// <summary>
/// <para>
/// Determines whether this instance is unused link.
/// </para>
/// <para></para>
/// </summary>
/// <param name="linkIndex">
/// <para>The link index.</para>
/// <para></para>
/// </param>
/// <returns>
/// <para>The bool</para>
/// <para></para>
/// </returns>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
protected virtual bool IsUnusedLink(TLinkAddress linkIndex)
{
if (!AreEqual(GetHeaderReference().FirstFreeLink, linkIndex)) // May be this check is not needed
{
ref var link = ref GetLinkReference(linkIndex);
return AreEqual(link.SizeAsSource, default) && !AreEqual(link.Source, default);
}
else
{
return true;
}
}
/// <summary>
/// <para>
/// Gets the one.
/// </para>
/// <para></para>
/// </summary>
/// <returns>
/// <para>The link</para>
/// <para></para>
/// </returns>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
protected virtual TLinkAddress GetOne() => _one;
/// <summary>
/// <para>
/// Gets the zero.
/// </para>
/// <para></para>
/// </summary>
/// <returns>
/// <para>The link</para>
/// <para></para>
/// </returns>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
protected virtual TLinkAddress GetZero() => default;
/// <summary>
/// <para>
/// Determines whether this instance are equal.
/// </para>
/// <para></para>
/// </summary>
/// <param name="first">
/// <para>The first.</para>
/// <para></para>
/// </param>
/// <param name="second">
/// <para>The second.</para>
/// <para></para>
/// </param>
/// <returns>
/// <para>The bool</para>
/// <para></para>
/// </returns>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
protected virtual bool AreEqual(TLinkAddress first, TLinkAddress second) => first == second;
/// <summary>
/// <para>
/// Determines whether this instance less than.
/// </para>
/// <para></para>
/// </summary>
/// <param name="first">
/// <para>The first.</para>
/// <para></para>
/// </param>
/// <param name="second">
/// <para>The second.</para>
/// <para></para>
/// </param>
/// <returns>
/// <para>The bool</para>
/// <para></para>
/// </returns>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
protected virtual bool LessThan(TLinkAddress first, TLinkAddress second) => _comparer.Compare(first, second) < 0;
/// <summary>
/// <para>
/// Determines whether this instance less or equal than.
/// </para>
/// <para></para>
/// </summary>
/// <param name="first">
/// <para>The first.</para>
/// <para></para>
/// </param>
/// <param name="second">
/// <para>The second.</para>
/// <para></para>
/// </param>
/// <returns>
/// <para>The bool</para>
/// <para></para>
/// </returns>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
protected virtual bool LessOrEqualThan(TLinkAddress first, TLinkAddress second) => _comparer.Compare(first, second) <= 0;
/// <summary>
/// <para>
/// Determines whether this instance greater than.
/// </para>
/// <para></para>
/// </summary>
/// <param name="first">
/// <para>The first.</para>
/// <para></para>
/// </param>
/// <param name="second">
/// <para>The second.</para>
/// <para></para>
/// </param>
/// <returns>
/// <para>The bool</para>
/// <para></para>
/// </returns>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
protected virtual bool GreaterThan(TLinkAddress first, TLinkAddress second) => _comparer.Compare(first, second) > 0;
/// <summary>
/// <para>
/// Determines whether this instance greater or equal than.
/// </para>
/// <para></para>
/// </summary>
/// <param name="first">
/// <para>The first.</para>
/// <para></para>
/// </param>
/// <param name="second">
/// <para>The second.</para>
/// <para></para>
/// </param>
/// <returns>
/// <para>The bool</para>
/// <para></para>
/// </returns>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
protected virtual bool GreaterOrEqualThan(TLinkAddress first, TLinkAddress second) => _comparer.Compare(first, second) >= 0;
/// <summary>
/// <para>
/// Adds the first.
/// </para>
/// <para></para>
/// </summary>
/// <param name="first">
/// <para>The first.</para>
/// <para></para>
/// </param>
/// <param name="second">
/// <para>The second.</para>
/// <para></para>
/// </param>
/// <returns>
/// <para>The link</para>
/// <para></para>
/// </returns>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
protected virtual TLinkAddress Add(TLinkAddress first, TLinkAddress second) => first + second;
/// <summary>
/// <para>
/// Subtracts the first.
/// </para>
/// <para></para>
/// </summary>
/// <param name="first">
/// <para>The first.</para>
/// <para></para>
/// </param>
/// <param name="second">
/// <para>The second.</para>
/// <para></para>
/// </param>
/// <returns>
/// <para>The link</para>
/// <para></para>
/// </returns>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
protected virtual TLinkAddress Subtract(TLinkAddress first, TLinkAddress second) => first - second;
#region Disposable
/// <summary>
/// <para>
/// Gets the allow multiple dispose calls value.
/// </para>
/// <para></para>
/// </summary>
protected override bool AllowMultipleDisposeCalls
{
[MethodImpl(MethodImplOptions.AggressiveInlining)]
get => true;
}
/// <summary>
/// <para>
/// Disposes the manual.
/// </para>
/// <para></para>
/// </summary>
/// <param name="manual">
/// <para>The manual.</para>
/// <para></para>
/// </param>
/// <param name="wasDisposed">
/// <para>The was disposed.</para>
/// <para></para>
/// </param>
[MethodImpl(MethodImplOptions.AggressiveInlining)]
protected override void Dispose(bool manual, bool wasDisposed)
{
if (!wasDisposed)
{
ResetPointers();
_memory.DisposeIfPossible();
}
}
#endregion
}
}