|
| 1 | +import 'dart:math' as math; |
| 2 | + |
| 3 | +import '../api/model/model.dart'; |
| 4 | + |
| 5 | +extension Max<T extends num> on Iterable<T> { |
| 6 | + /// Finds the maximum number in an [Iterable]. |
| 7 | + /// |
| 8 | + /// Returns null if the [Iterable] is empty. |
| 9 | + T? max() => isNotEmpty ? reduce(math.max) : null; |
| 10 | +} |
| 11 | + |
| 12 | +extension PossibleIndex<T extends num> on List<T> { |
| 13 | + /// The index of [element] in this sorted list. |
| 14 | + /// |
| 15 | + /// Uses binary search to find the index, so the list must be sorted, |
| 16 | + /// otherwise the result is unpredictable. |
| 17 | + /// |
| 18 | + /// If [element] is found, returns its index (0-based). |
| 19 | + /// |
| 20 | + /// ```dart |
| 21 | + /// final somePrimes = [11, 13, 17, 23, 27, 29]; |
| 22 | + /// final index = somePrimes.possibleIndexOf(17); // 2 |
| 23 | + /// ``` |
| 24 | + /// If [element] is not found, returns the possible index (1-based) |
| 25 | + /// with a negative sign, where if the [element] is inserted, |
| 26 | + /// the order of the list is maintained. |
| 27 | + /// |
| 28 | + /// ```dart |
| 29 | + /// final somePrimes = [11, 13, 17, 23, 27, 29]; |
| 30 | + /// int index = somePrimes.possibleIndexOf(7); // -1 |
| 31 | + /// index = somePrimes.possibleIndexOf(19); // -4 |
| 32 | + /// ``` |
| 33 | + int possibleIndexOf(T element) { |
| 34 | + indexOf(element); |
| 35 | + int low = 0; |
| 36 | + int high = length - 1; |
| 37 | + |
| 38 | + while (high >= low) { |
| 39 | + int mid = (low + high) ~/ 2; |
| 40 | + if (element == this[mid]) { |
| 41 | + return mid; |
| 42 | + } else if (element < this[mid]) { |
| 43 | + high = mid - 1; |
| 44 | + } else { |
| 45 | + low = mid + 1; |
| 46 | + } |
| 47 | + } |
| 48 | + return -low - 1; |
| 49 | + } |
| 50 | +} |
| 51 | + |
| 52 | +/// A data structure to keep track of message ids. |
| 53 | +class IdTracker { |
| 54 | + final List<int> _ids = []; |
| 55 | + |
| 56 | + void add(int id) { |
| 57 | + if (_ids.isEmpty) { |
| 58 | + _ids.add(id); |
| 59 | + } else { |
| 60 | + int i = _ids.possibleIndexOf(id); |
| 61 | + if (i >= 0) { // the [id] already exists, so do not add it. |
| 62 | + return; |
| 63 | + } |
| 64 | + i = -i - 1; // change the index back to 0-based for readability. |
| 65 | + if (i == _ids.length) { // the [id] should be added to the end of the list. |
| 66 | + _ids.add(id); |
| 67 | + } else { |
| 68 | + _ids.insert(i, id); |
| 69 | + } |
| 70 | + } |
| 71 | + } |
| 72 | + |
| 73 | + // TODO: remove |
| 74 | + |
| 75 | + /// The maximum id in the tracker list. |
| 76 | + /// |
| 77 | + /// Returns -1 if the tracker list is empty. |
| 78 | + int get maxId => _ids.isNotEmpty ? _ids.last : -1; |
| 79 | + |
| 80 | + @override |
| 81 | + String toString() { |
| 82 | + return _ids.toString(); |
| 83 | + } |
| 84 | +} |
| 85 | + |
| 86 | +/// A data structure to keep track of stream and topic messages. |
| 87 | +/// |
| 88 | +/// The owner should call [clear] in order to free resources. |
| 89 | +class RecentSenders { |
| 90 | + // streamSenders[streamId][senderId] = IdTracker |
| 91 | + final Map<int, Map<int, IdTracker>> _streamSenders = {}; |
| 92 | + |
| 93 | + // topicSenders[streamId][topic][senderId] = IdTracker |
| 94 | + final Map<int, Map<String, Map<int, IdTracker>>> _topicSenders = {}; |
| 95 | + |
| 96 | + void clear() { |
| 97 | + _streamSenders.clear(); |
| 98 | + _topicSenders.clear(); |
| 99 | + } |
| 100 | + |
| 101 | + int maxIdForStreamSender({required int streamId, required int senderId}) { |
| 102 | + return _streamSenders[streamId]?[senderId]?.maxId ?? -1; |
| 103 | + } |
| 104 | + |
| 105 | + int maxIdForStreamTopicSender({ |
| 106 | + required int streamId, |
| 107 | + required String topic, |
| 108 | + required int senderId, |
| 109 | + }) { |
| 110 | + topic = topic.toLowerCase(); |
| 111 | + return _topicSenders[streamId]?[topic]?[senderId]?.maxId ?? -1; |
| 112 | + } |
| 113 | + |
| 114 | + void addStreamMessage({ |
| 115 | + required int streamId, |
| 116 | + required int senderId, |
| 117 | + required messageId, |
| 118 | + }) { |
| 119 | + final senderMap = _streamSenders[streamId] ?? {}; |
| 120 | + final idTracker = senderMap[senderId] ?? IdTracker(); |
| 121 | + _streamSenders[streamId] = senderMap; |
| 122 | + senderMap[senderId] = idTracker; |
| 123 | + idTracker.add(messageId); |
| 124 | + } |
| 125 | + |
| 126 | + void addTopicMessage({ |
| 127 | + required int streamId, |
| 128 | + required String topic, |
| 129 | + required int senderId, |
| 130 | + required messageId, |
| 131 | + }) { |
| 132 | + topic = topic.toLowerCase(); |
| 133 | + final topicMap = _topicSenders[streamId] ?? {}; |
| 134 | + final senderMap = topicMap[topic] ?? {}; |
| 135 | + final idTracker = senderMap[senderId] ?? IdTracker(); |
| 136 | + _topicSenders[streamId] = topicMap; |
| 137 | + topicMap[topic] = senderMap; |
| 138 | + senderMap[senderId] = idTracker; |
| 139 | + idTracker.add(messageId); |
| 140 | + } |
| 141 | + |
| 142 | + void processStreamMessage(Message message) { |
| 143 | + if (message is! StreamMessage) { |
| 144 | + return; |
| 145 | + } |
| 146 | + |
| 147 | + final streamId = message.streamId; |
| 148 | + final topic = message.subject; |
| 149 | + final senderId = message.senderId; |
| 150 | + final messageId = message.id; |
| 151 | + |
| 152 | + addStreamMessage( |
| 153 | + streamId: streamId, senderId: senderId, messageId: messageId); |
| 154 | + addTopicMessage( |
| 155 | + streamId: streamId, |
| 156 | + topic: topic, |
| 157 | + senderId: senderId, |
| 158 | + messageId: messageId); |
| 159 | + } |
| 160 | + |
| 161 | + // TODO: removeTopicMessage |
| 162 | + |
| 163 | + int compareByRecency({ |
| 164 | + required User userA, |
| 165 | + required User userB, |
| 166 | + required int streamId, |
| 167 | + // TODO(#493): may turn this into a non-nullable string. |
| 168 | + required String? topic, |
| 169 | + }) { |
| 170 | + int aMessageId, bMessageId; |
| 171 | + |
| 172 | + if (topic != null) { |
| 173 | + aMessageId = maxIdForStreamTopicSender( |
| 174 | + streamId: streamId, topic: topic, senderId: userA.userId); |
| 175 | + bMessageId = maxIdForStreamTopicSender( |
| 176 | + streamId: streamId, topic: topic, senderId: userB.userId); |
| 177 | + |
| 178 | + if (aMessageId != bMessageId) { |
| 179 | + return bMessageId - aMessageId; |
| 180 | + } |
| 181 | + } |
| 182 | + |
| 183 | + aMessageId = |
| 184 | + maxIdForStreamSender(streamId: streamId, senderId: userA.userId); |
| 185 | + bMessageId = |
| 186 | + maxIdForStreamSender(streamId: streamId, senderId: userB.userId); |
| 187 | + |
| 188 | + return bMessageId - aMessageId; |
| 189 | + } |
| 190 | +} |
0 commit comments