tiny.simd.sort

1pub const sort = @import("sort/root.zig");

1const constants = @import("constants.zig");2const heap = @import("heap.zig");3const key = @import("key.zig");4const network = @import("network.zig");5const partition = @import("partition.zig");6const pivot = @import("pivot.zig");7const random = @import("random.zig");8const vq = @import("vq.zig");910pub const Direction = key.Direction;11pub const SortAscending = key.Ascending;12pub const SortDescending = key.Descending;13pub const K32V32 = key.K32V32;14pub const K64V64 = key.K64V64;15pub const Error = vq.Error;16pub const sort = vq.sort;17pub const partialSort = vq.partialSort;18pub const select = vq.select;19pub const haveFloat16 = vq.haveFloat16;20pub const haveFloat64 = vq.haveFloat64;2122pub const testing = struct {23    pub const Scratch = network.Scratch;24    pub const NetworkError = network.Error;25    pub const maximum_buffer_bytes = constants.maximum_buffer_bytes;26    pub const networkSort = network.sort;27    pub const baseCaseKeyCapacity = constants.baseCaseKeyCapacity;28    pub const before = key.before;29    pub const networkBefore = key.networkBefore;30    pub const equivalent = key.equivalent;31    pub const medianOf3 = key.medianOf3;32    pub const previous = key.previous;33    pub const RandomState = random.State;34    pub const randomBits = random.randomBits;35    pub const randomChunkIndex = random.chunkIndex;36    pub const PartitionBounds = partition.Bounds;37    pub const partitionAround = partition.around;38    pub const nanToBack = partition.nanToBack;39    pub const canonicalNaN = partition.canonicalNaN;40    pub const heapSort = heap.sort;41    pub const choosePivot = pivot.choose;42    pub const maximum_levels = vq.maximum_levels;43};