forked from mystiq/hydrogen-web
62bcb27784
turns out we do have to always check for replay attacks because failing to decrypt doesn't prevent an item from being stored, so if you reload and then load you might be decrypting it for the first time
114 lines
3.7 KiB
JavaScript
114 lines
3.7 KiB
JavaScript
/*
|
|
Copyright 2020 Bruno Windels <bruno@windels.cloud>
|
|
|
|
Licensed under the Apache License, Version 2.0 (the "License");
|
|
you may not use this file except in compliance with the License.
|
|
You may obtain a copy of the License at
|
|
|
|
http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
Unless required by applicable law or agreed to in writing, software
|
|
distributed under the License is distributed on an "AS IS" BASIS,
|
|
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
See the License for the specific language governing permissions and
|
|
limitations under the License.
|
|
*/
|
|
|
|
import {SortedArray, MappedList, ConcatList} from "../../../observable/index.js";
|
|
import {Direction} from "./Direction.js";
|
|
import {TimelineReader} from "./persistence/TimelineReader.js";
|
|
import {PendingEventEntry} from "./entries/PendingEventEntry.js";
|
|
import {EventEntry} from "./entries/EventEntry.js";
|
|
|
|
export class Timeline {
|
|
constructor({roomId, storage, closeCallback, fragmentIdComparer, pendingEvents, user}) {
|
|
this._roomId = roomId;
|
|
this._storage = storage;
|
|
this._closeCallback = closeCallback;
|
|
this._fragmentIdComparer = fragmentIdComparer;
|
|
this._remoteEntries = new SortedArray((a, b) => a.compare(b));
|
|
this._timelineReader = new TimelineReader({
|
|
roomId: this._roomId,
|
|
storage: this._storage,
|
|
fragmentIdComparer: this._fragmentIdComparer
|
|
});
|
|
const localEntries = new MappedList(pendingEvents, pe => {
|
|
return new PendingEventEntry({pendingEvent: pe, user});
|
|
}, (pee, params) => {
|
|
pee.notifyUpdate(params);
|
|
});
|
|
this._allEntries = new ConcatList(this._remoteEntries, localEntries);
|
|
}
|
|
|
|
/** @package */
|
|
async load() {
|
|
const entries = await this._timelineReader.readFromEnd(50);
|
|
this._remoteEntries.setManySorted(entries);
|
|
}
|
|
|
|
findEntry(eventKey) {
|
|
// a storage event entry has a fragmentId and eventIndex property, used for sorting,
|
|
// just like an EventKey, so this will work, but perhaps a bit brittle.
|
|
const entry = new EventEntry(eventKey, this._fragmentIdComparer);
|
|
try {
|
|
const idx = this._remoteEntries.indexOf(entry);
|
|
if (idx !== -1) {
|
|
return this._remoteEntries.get(idx);
|
|
}
|
|
} catch (err) {
|
|
// fragmentIdComparer threw, ignore
|
|
return;
|
|
}
|
|
}
|
|
|
|
replaceEntries(entries) {
|
|
for (const entry of entries) {
|
|
this._remoteEntries.replace(entry);
|
|
}
|
|
}
|
|
|
|
// TODO: should we rather have generic methods for
|
|
// - adding new entries
|
|
// - updating existing entries (redaction, relations)
|
|
/** @package */
|
|
appendLiveEntries(newEntries) {
|
|
this._remoteEntries.setManySorted(newEntries);
|
|
}
|
|
|
|
/** @package */
|
|
addGapEntries(newEntries) {
|
|
this._remoteEntries.setManySorted(newEntries);
|
|
}
|
|
|
|
// tries to prepend `amount` entries to the `entries` list.
|
|
async loadAtTop(amount) {
|
|
const firstEventEntry = this._remoteEntries.array.find(e => !!e.eventType);
|
|
if (!firstEventEntry) {
|
|
return;
|
|
}
|
|
const entries = await this._timelineReader.readFrom(
|
|
firstEventEntry.asEventKey(),
|
|
Direction.Backward,
|
|
amount
|
|
);
|
|
this._remoteEntries.setManySorted(entries);
|
|
}
|
|
|
|
/** @public */
|
|
get entries() {
|
|
return this._allEntries;
|
|
}
|
|
|
|
/** @public */
|
|
close() {
|
|
if (this._closeCallback) {
|
|
this._closeCallback();
|
|
this._closeCallback = null;
|
|
}
|
|
}
|
|
|
|
enableEncryption(decryptEntries) {
|
|
this._timelineReader.enableEncryption(decryptEntries);
|
|
}
|
|
}
|