import type { AuditEventNodeConnectionForward, AuditEventNodeConnectionReverse, AuditEventDiscoveryVertexQueued, AuditEventDiscoveryVertexProcessed, AuditEventDiscoveryVertexFailed, AuditEventDiscoveryVertexCulled, AuditEventDiscoveryVertexCancelled, AuditEventDiscoveryCheckRediscovery, TopicSubPath } from './types.js';
import type * as nodesEvents from '../nodes/events.js';
import type * as discoveryEvents from '../discovery/events.js';
import type { AuditEventId } from '../ids/index.js';
import type { TopicPath } from './types.js';
import { createAuditEventIdGenerator, encodeAuditEventId, decodeAuditEventId } from '../ids/index.js';
declare function extractFromSeek(seek: AuditEventId | number | Date, randomSource?: (size: number) => Uint8Array): {
    auditEventId: AuditEventId;
    timestamp: number;
};
declare const nodeConnectionReverseTopicPath: readonly ["node", "connection", "reverse"];
declare function fromEventNodeConnectionManagerConnectionReverse(evt: nodesEvents.EventNodeConnectionManagerConnectionReverse): AuditEventNodeConnectionReverse['data'];
declare const nodeConnectionForwardTopicPath: readonly ["node", "connection", "forward"];
declare function fromEventNodeConnectionManagerConnectionForward(evt: nodesEvents.EventNodeConnectionManagerConnectionForward): AuditEventNodeConnectionForward['data'];
declare const discoveryVertexQueuedTopicPath: readonly ["discovery", "vertex", "queued"];
declare function fromEventDiscoveryVertexQueued(evt: discoveryEvents.EventDiscoveryVertexQueued): AuditEventDiscoveryVertexQueued['data'];
declare const discoveryVertexProcessedTopicPath: readonly ["discovery", "vertex", "processed"];
declare function fromEventDiscoveryVertexProcessed(evt: discoveryEvents.EventDiscoveryVertexProcessed): AuditEventDiscoveryVertexProcessed['data'];
declare const discoveryVertexFailedTopicPath: readonly ["discovery", "vertex", "failed"];
declare function fromEventDiscoveryVertexFailed(evt: discoveryEvents.EventDiscoveryVertexFailed): AuditEventDiscoveryVertexFailed['data'];
declare const discoveryVertexCulledTopicPath: readonly ["discovery", "vertex", "culled"];
declare function fromEventDiscoveryVertexCulled(evt: discoveryEvents.EventDiscoveryVertexCulled): AuditEventDiscoveryVertexCulled['data'];
declare const discoveryVertexCancelledTopicPath: readonly ["discovery", "vertex", "cancelled"];
declare function fromEventDiscoveryVertexCancelled(evt: discoveryEvents.EventDiscoveryVertexCancelled): AuditEventDiscoveryVertexCancelled['data'];
declare const discoveryCheckRediscoveryTopicPath: readonly ["discovery", "checkRediscovery"];
declare function fromEventDiscoveryCheckRediscovery(_evt: discoveryEvents.EventDiscoveryCheckRediscovery): AuditEventDiscoveryCheckRediscovery['data'];
declare const nodeGraphTopicPath: readonly ["node", "graph"];
declare const topicPaths: readonly [readonly ["node", "connection", "forward"], readonly ["node", "connection", "reverse"], readonly ["discovery", "vertex", "queued"], readonly ["discovery", "vertex", "processed"], readonly ["discovery", "vertex", "failed"], readonly ["discovery", "vertex", "culled"], readonly ["discovery", "vertex", "cancelled"], readonly ["discovery", "checkRediscovery"]];
/**
 * All the valid `topicPath`s condensed into a tree format.
 * Used to quickly check if a path is valid.
 */
declare const topicPathTree: any;
/**
 * TypeGuard used to assert if a value is a `TopicPath`.
 * Uses `topicPathTree` to quickly check if the path is valid.
 */
declare function isTopicPath(it: unknown): it is TopicPath;
declare const nodeConnectionMetricPath: readonly ["node", "connection"];
declare const nodeConnectionInboundMetricPath: readonly ["node", "connection", "inbound"];
declare const nodeConnectionOutboundMetricPath: readonly ["node", "connection", "outbound"];
declare const metricPaths: readonly [readonly ["node", "connection"], readonly ["node", "connection", "inbound"], readonly ["node", "connection", "outbound"]];
/**
 * Will take an array of dot path sorted paths and return the minimal list common paths.
 * So sub-paths will be filtered out if we already contain a parent path E.G. `a.b` will be removed if we also include `a`.
 * Duplicate paths will be removed, so `a` will be removed if two `a`'s exist.
 */
declare function filterSubPaths(paths: Array<TopicSubPath>): Array<TopicSubPath>;
/**
 * This takes N generators that yield data in a sorted order and combines their outputs in a fully sorted order.
 * This will only work on pre-sorted outputs from the generator.
 */
declare function genSort<T>(sortFn: (a: T, b: T) => number, ...gens: Array<AsyncGenerator<T, void, void>>): AsyncGenerator<T, void, void>;
export { extractFromSeek, createAuditEventIdGenerator, encodeAuditEventId, decodeAuditEventId, nodeConnectionReverseTopicPath, fromEventNodeConnectionManagerConnectionReverse, nodeConnectionForwardTopicPath, fromEventNodeConnectionManagerConnectionForward, discoveryVertexQueuedTopicPath, fromEventDiscoveryVertexQueued, discoveryVertexProcessedTopicPath, fromEventDiscoveryVertexProcessed, discoveryVertexFailedTopicPath, fromEventDiscoveryVertexFailed, discoveryVertexCulledTopicPath, fromEventDiscoveryVertexCulled, discoveryVertexCancelledTopicPath, fromEventDiscoveryVertexCancelled, discoveryCheckRediscoveryTopicPath, fromEventDiscoveryCheckRediscovery, nodeGraphTopicPath, topicPaths, topicPathTree, isTopicPath, nodeConnectionMetricPath, nodeConnectionInboundMetricPath, nodeConnectionOutboundMetricPath, metricPaths, filterSubPaths, genSort, };