2022-08-08 13:32:08 +00:00
|
|
|
import 'dart:convert';
|
2022-08-04 10:50:19 +00:00
|
|
|
import 'dart:math';
|
2022-08-08 13:32:08 +00:00
|
|
|
import 'package:cryptography/cryptography.dart';
|
|
|
|
import 'package:omemo_dart/src/keys.dart';
|
2022-08-04 10:50:19 +00:00
|
|
|
|
2022-08-02 16:13:14 +00:00
|
|
|
/// Flattens [inputs] and concatenates the elements.
|
|
|
|
List<int> concat(List<List<int>> inputs) {
|
|
|
|
final tmp = List<int>.empty(growable: true);
|
|
|
|
for (final input in inputs) {
|
|
|
|
tmp.addAll(input);
|
|
|
|
}
|
|
|
|
|
|
|
|
return tmp;
|
|
|
|
}
|
2022-08-03 14:41:33 +00:00
|
|
|
|
|
|
|
/// Compares the two lists [a] and [b] and return true if [a] and [b] are index-by-index
|
|
|
|
/// equal. Returns false, if they are not "equal";
|
2022-08-05 14:52:02 +00:00
|
|
|
bool listsEqual<T>(List<T> a, List<T> b) {
|
2022-08-03 14:41:33 +00:00
|
|
|
// TODO(Unknown): Do we need to use a constant time comparison?
|
|
|
|
if (a.length != b.length) return false;
|
|
|
|
|
|
|
|
for (var i = 0; i < a.length; i++) {
|
|
|
|
if (a[i] != b[i]) return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
2022-08-04 10:50:19 +00:00
|
|
|
|
|
|
|
/// Use Dart's cryptographically secure random number generator at Random.secure()
|
|
|
|
/// to generate [length] random numbers between 0 and 256 exclusive.
|
|
|
|
List<int> generateRandomBytes(int length) {
|
|
|
|
final bytes = List<int>.empty(growable: true);
|
|
|
|
final r = Random.secure();
|
|
|
|
for (var i = 0; i < length; i++) {
|
|
|
|
bytes.add(r.nextInt(256));
|
|
|
|
}
|
|
|
|
|
|
|
|
return bytes;
|
|
|
|
}
|
2022-08-04 11:19:27 +00:00
|
|
|
|
|
|
|
/// Generate a random number between 0 inclusive and 2**32 exclusive (2**32 - 1 inclusive).
|
|
|
|
int generateRandom32BitNumber() {
|
|
|
|
return Random.secure().nextInt(4294967295 /*pow(2, 32) - 1*/);
|
|
|
|
}
|
2022-08-08 13:32:08 +00:00
|
|
|
|
2023-06-12 17:20:43 +00:00
|
|
|
OmemoPublicKey? decodeKeyIfNotNull(
|
2023-06-12 17:37:45 +00:00
|
|
|
Map<String, dynamic> map,
|
|
|
|
String key,
|
|
|
|
KeyPairType type,
|
|
|
|
) {
|
2022-08-08 13:32:08 +00:00
|
|
|
if (map[key] == null) return null;
|
|
|
|
|
|
|
|
return OmemoPublicKey.fromBytes(
|
|
|
|
base64.decode(map[key]! as String),
|
|
|
|
type,
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
2022-10-02 17:23:58 +00:00
|
|
|
int getTimestamp() {
|
|
|
|
return DateTime.now().millisecondsSinceEpoch;
|
|
|
|
}
|
2023-06-16 18:13:30 +00:00
|
|
|
|
|
|
|
/// Describes the differences between two lists in terms of its items.
|
|
|
|
class ListDiff<T> {
|
|
|
|
ListDiff(this.added, this.removed);
|
|
|
|
|
|
|
|
/// The items that were added.
|
|
|
|
final List<T> added;
|
|
|
|
|
|
|
|
/// The items that were removed.
|
|
|
|
final List<T> removed;
|
|
|
|
}
|
|
|
|
|
|
|
|
extension BeforeAfterListDiff<T> on List<T> {
|
|
|
|
/// Compute the set-based changes between this list and [newList].
|
|
|
|
ListDiff<T> diff(List<T> newList) {
|
|
|
|
final oldSet = Set<T>.from(this);
|
|
|
|
final newSet = Set<T>.from(newList);
|
|
|
|
|
|
|
|
return ListDiff(
|
|
|
|
newSet.difference(oldSet).toList(),
|
|
|
|
oldSet.difference(newSet).toList(),
|
|
|
|
);
|
|
|
|
}
|
|
|
|
}
|