AutocompleteCombiner<T> final#
Combines local and remote autocomplete results with deduplication.
Features:
- Deduplication by item ID (configurable preference for local or remote).
- Section markers for visual separation.
- Option to show remote only when local is empty.
Constructors#
AutocompleteCombiner() const#
Implementation
const AutocompleteCombiner({
required HeadlessItemAdapter<T> itemAdapter,
required RAutocompleteCombinePolicy policy,
}) : _itemAdapter = itemAdapter,
_policy = policy;
Properties#
hashCode no setter inherited#
The hash code for this object.
A hash code is a single integer which represents the state of the object that affects operator == comparisons.
All objects have hash codes. The default hash code implemented by Object represents only the identity of the object, the same way as the default operator == implementation only considers objects equal if they are identical (see identityHashCode).
If operator == is overridden to use the object state instead, the hash code must also be changed to represent that state, otherwise the object cannot be used in hash based data structures like the default Set and Map implementations.
Hash codes must be the same for objects that are equal to each other according to operator ==. The hash code of an object should only change if the object changes in a way that affects equality. There are no further requirements for the hash codes. They need not be consistent between executions of the same program and there are no distribution guarantees.
Objects that are not equal are allowed to have the same hash code. It is even technically allowed that all instances have the same hash code, but if clashes happen too often, it may reduce the efficiency of hash-based data structures like HashSet or HashMap.
If a subclass overrides hashCode, it should override the operator == operator as well to maintain consistency.
Inherited from Object.
Implementation
external int get hashCode;
runtimeType no setter inherited#
A representation of the runtime type of the object.
Inherited from Object.
Implementation
external Type get runtimeType;
Methods#
combine()#
Combines local and remote results according to the policy.
Returns a AutocompleteCombineResult with combined items and counts.
Implementation
AutocompleteCombineResult<T> combine({
required List<T> local,
required List<T> remote,
}) {
return combineWithFeatures(local: local, remote: remote);
}
combineWithFeatures()#
Combines local and remote results and also returns aligned per-item features.
Implementation
AutocompleteCombineResult<T> combineWithFeatures({
required List<T> local,
required List<T> remote,
}) {
final showSections = _policy.showSections;
final localSection = showSections ? RAutocompleteSectionId.local : null;
final remoteSection = showSections ? RAutocompleteSectionId.remote : null;
HeadlessItemFeatures localFeatures() => createItemFeatures(
source: RAutocompleteItemSource.local, sectionId: localSection);
HeadlessItemFeatures remoteFeatures() => createItemFeatures(
source: RAutocompleteItemSource.remote, sectionId: remoteSection);
if (_policy.remoteOnlyWhenLocalEmpty && local.isNotEmpty) {
final lf = localFeatures();
final withFeatures = local.map((v) => (v, lf)).toList();
return AutocompleteCombineResult(
combined: local,
withFeatures: withFeatures,
localCount: local.length,
remoteCount: 0,
);
}
if (!_policy.dedupeById) {
final lf = localFeatures();
final rf = remoteFeatures();
final withFeatures = <(T, HeadlessItemFeatures)>[
...local.map((v) => (v, lf)),
...remote.map((v) => (v, rf)),
];
return AutocompleteCombineResult(
combined: [...local, ...remote],
withFeatures: withFeatures,
localCount: local.length,
remoteCount: remote.length,
);
}
final seenIds = <ListboxItemId>{};
final withFeatures = <(T, HeadlessItemFeatures)>[];
final preferLocal =
_policy.dedupePreference == RAutocompleteDedupePreference.preferLocal;
final first = preferLocal ? local : remote;
final second = preferLocal ? remote : local;
final firstFeatures = preferLocal ? localFeatures() : remoteFeatures();
final secondFeatures = preferLocal ? remoteFeatures() : localFeatures();
var firstCount = 0;
for (final item in first) {
final id = _itemAdapter.id(item);
if (seenIds.add(id)) {
withFeatures.add((item, firstFeatures));
firstCount++;
}
}
var secondCount = 0;
for (final item in second) {
final id = _itemAdapter.id(item);
if (seenIds.add(id)) {
withFeatures.add((item, secondFeatures));
secondCount++;
}
}
final (localCount, remoteCount) =
preferLocal ? (firstCount, secondCount) : (secondCount, firstCount);
return AutocompleteCombineResult(
combined: withFeatures.map((r) => r.$1).toList(),
withFeatures: withFeatures,
localCount: localCount,
remoteCount: remoteCount,
);
}
createItemFeatures()#
Creates item features for marking the source of an item.
Returns features with RAutocompleteItemSource and optionally section ID.
Implementation
HeadlessItemFeatures createItemFeatures({
required RAutocompleteItemSource source,
RAutocompleteSectionId? sectionId,
}) {
return HeadlessItemFeatures.build((b) {
b.set(rAutocompleteItemSourceKey, source);
if (sectionId != null) {
b.set(rAutocompleteSectionIdKey, sectionId);
}
});
}
markWithSource()#
Marks a list of items with source features.
Returns a list of (item, features) pairs.
Implementation
List<(T, HeadlessItemFeatures)> markWithSource({
required List<T> items,
required RAutocompleteItemSource source,
RAutocompleteSectionId? sectionId,
}) {
final features = createItemFeatures(source: source, sectionId: sectionId);
return items.map((item) => (item, features)).toList();
}
noSuchMethod() inherited#
Invoked when a nonexistent method or property is accessed.
A dynamic member invocation can attempt to call a member which doesn't exist on the receiving object. Example:
dynamic object = 1;
object.add(42); // Statically allowed, run-time error
This invalid code will invoke the noSuchMethod method
of the integer 1 with an Invocation
representing the
.add(42) call and arguments (which then throws).
Classes can override noSuchMethod to provide custom behavior for such invalid dynamic invocations.
A class with a non-default noSuchMethod invocation can also omit implementations for members of its interface. Example:
class MockList<T> implements List<T> {
noSuchMethod(Invocation invocation) {
log(invocation);
super.noSuchMethod(invocation); // Will throw.
}
}
void main() {
MockList().add(42);
}
This code has no compile-time warnings or errors even though
the MockList class has no concrete implementation of
any of the List interface methods.
Calls to List methods are forwarded to noSuchMethod,
so this code will log an invocation similar to
Invocation.method(#add, [42]) and then throw.
If a value is returned from noSuchMethod,
it becomes the result of the original invocation.
If the value is not of a type that can be returned by the original
invocation, a type error occurs at the invocation.
The default behavior is to throw a NoSuchMethodError.
Inherited from Object.
Implementation
@pragma("vm:entry-point")
@pragma("wasm:entry-point")
external dynamic noSuchMethod(Invocation invocation);
toString() inherited#
A string representation of this object.
Some classes have a default textual representation,
often paired with a static parse function (like int.parse).
These classes will provide the textual representation as
their string representation.
Other classes have no meaningful textual representation
that a program will care about.
Such classes will typically override toString to provide
useful information when inspecting the object,
mainly for debugging or logging.
Inherited from Object.
Implementation
external String toString();
Operators#
operator ==() inherited#
The equality operator.
The default behavior for all Objects is to return true if and
only if this object and other are the same object.
Override this method to specify a different equality relation on a class. The overriding method must still be an equivalence relation. That is, it must be:
Total: It must return a boolean for all arguments. It should never throw.
Reflexive: For all objects
o,o == omust be true.-
Symmetric: For all objects
o1ando2,o1 == o2ando2 == o1must either both be true, or both be false. -
Transitive: For all objects
o1,o2, ando3, ifo1 == o2ando2 == o3are true, theno1 == o3must be true.
The method should also be consistent over time, so whether two objects are equal should only change if at least one of the objects was modified.
If a subclass overrides the equality operator, it should override the hashCode method as well to maintain consistency.
Inherited from Object.
Implementation
external bool operator ==(Object other);