|
| 1 | +using CSharpClassLibrary.IIterator; |
| 2 | +using System; |
| 3 | +using System.Collections; |
| 4 | +using System.Collections.Generic; |
| 5 | +using System.Linq; |
| 6 | + |
| 7 | +//https://stackoverflow.com/questions/1273001/is-there-a-hasnext-method-for-an-ienumerator |
| 8 | + |
| 9 | +namespace CSharpClassLibrary.RandomComplier |
| 10 | +{ |
| 11 | + public sealed class PeekableEnumerableAdapter<T> : IIterable<T>, IIterator<T> |
| 12 | + { |
| 13 | + public bool FetchedNext { get; private set; } |
| 14 | + public bool NextAvailable { get; private set; } |
| 15 | + public IEnumerable<T> Enumerable { get; } |
| 16 | + public IEnumerator<T> Enumerator { get; } |
| 17 | + public int CacheSize { get; } = 10; |
| 18 | + public Queue<T> Queue { get; } = new Queue<T>(); |
| 19 | + public Stack<T> Stack { get; } = new Stack<T>(); |
| 20 | + public T EndToken { get; private set; } |
| 21 | + public T NextObject { get; private set; } |
| 22 | + |
| 23 | + public PeekableEnumerableAdapter(IEnumerable<T> enumerable) |
| 24 | + { |
| 25 | + Enumerable = enumerable; |
| 26 | + Enumerator = enumerable.GetEnumerator(); |
| 27 | + } |
| 28 | + |
| 29 | + public PeekableEnumerableAdapter(IEnumerable<T> enumerable, T endToken) |
| 30 | + { |
| 31 | + Enumerable = enumerable; |
| 32 | + Enumerator = enumerable.GetEnumerator(); |
| 33 | + EndToken = endToken; |
| 34 | + } |
| 35 | + |
| 36 | + public PeekableEnumerableAdapter(IEnumerator<T> enumerator) |
| 37 | + { |
| 38 | + Enumerator = enumerator; |
| 39 | + } |
| 40 | + |
| 41 | + public IIterator<T> Iterator() |
| 42 | + { |
| 43 | + return new PeekableEnumerableAdapter<T>(Enumerable.GetEnumerator()); |
| 44 | + } |
| 45 | + |
| 46 | + public bool HasNext |
| 47 | + { |
| 48 | + get |
| 49 | + { |
| 50 | + if (EndToken != null || Stack.Count > 0) return true; |
| 51 | + CheckNext(); |
| 52 | + return NextAvailable; |
| 53 | + } |
| 54 | + } |
| 55 | + |
| 56 | + |
| 57 | + public T Peek() |
| 58 | + { |
| 59 | + if (Stack.Count > 0) |
| 60 | + { |
| 61 | + return Stack.Peek(); |
| 62 | + } |
| 63 | + if (!HasNext) |
| 64 | + { |
| 65 | + return EndToken; |
| 66 | + } |
| 67 | + T val = Next(); |
| 68 | + PutItBack(); |
| 69 | + return val; |
| 70 | + } |
| 71 | + |
| 72 | + public T Next() |
| 73 | + { |
| 74 | + if (Stack.Count > 0) |
| 75 | + { |
| 76 | + T NextObject = Stack.Pop(); |
| 77 | + while (Queue.Count > CacheSize - 1) |
| 78 | + { |
| 79 | + Queue.Dequeue(); |
| 80 | + } |
| 81 | + Queue.Enqueue(NextObject); |
| 82 | + return NextObject; |
| 83 | + } |
| 84 | + else |
| 85 | + { |
| 86 | + CheckNext(); |
| 87 | + if (!NextAvailable) |
| 88 | + { |
| 89 | + T tmp = EndToken; |
| 90 | + EndToken = default; |
| 91 | + return tmp; |
| 92 | + } |
| 93 | + while (Queue.Count > CacheSize - 1) |
| 94 | + { |
| 95 | + Queue.Dequeue(); |
| 96 | + } |
| 97 | + Queue.Enqueue(NextObject); |
| 98 | + FetchedNext = false; |
| 99 | + return NextObject; |
| 100 | + } |
| 101 | + } |
| 102 | + |
| 103 | + private void CheckNext() |
| 104 | + { |
| 105 | + if (!FetchedNext) |
| 106 | + { |
| 107 | + NextAvailable = Enumerator.MoveNext(); |
| 108 | + if (NextAvailable) |
| 109 | + { |
| 110 | + NextObject = Enumerator.Current; |
| 111 | + } |
| 112 | + FetchedNext = true; |
| 113 | + } |
| 114 | + } |
| 115 | + |
| 116 | + public void Remove() |
| 117 | + { |
| 118 | + throw new NotSupportedException(); |
| 119 | + } |
| 120 | + |
| 121 | + public void PutItBack() |
| 122 | + { |
| 123 | + if (Queue.Count > 0) |
| 124 | + { |
| 125 | + Queue.Reverse(); |
| 126 | + Stack.Push(Queue.Dequeue()); |
| 127 | + Queue.Reverse(); |
| 128 | + } |
| 129 | + } |
| 130 | + |
| 131 | + public void Dispose() |
| 132 | + { |
| 133 | + Enumerator.Dispose(); |
| 134 | + } |
| 135 | + } |
| 136 | +} |
0 commit comments