range-set-blaze

Added

• Added experimental floating-point range support through the float_experimental feature for f32/f64, and the float_nightly_experimental feature for f16/f128. Finite supports finite values with zero canonicalized to +0.0, while Total supports all floating-point values in total order, including NaNs, infinities, and signed zero. Both provide constructors, range operations, and after/before navigation APIs.

Fix wasm-pack test command syntax for improved compatibility

Added

• AssumeSortedStarts now verifies, in debug builds only, that the ranges it is given actually have sorted starts, panicking with a clear message otherwise. Release builds are unaffected (zero runtime cost). (PR #29)

Breaking

• AssumeSortedStarts regains a leading type parameter: AssumeSortedStarts<I> -> AssumeSortedStarts<T, I>. Most AssumeSortedStarts::new(iter) calls are unchanged due to inference; explicit type aliases/annotations may need updating.

Update rand package versions to 0.8.6 and 0.9.4 in Cargo.lock

Added

• Implemented SortedStarts/SortedDisjoint (and the *Map equivalents) for applicable core::iter/std::iter adapter types whose iterators cannot break the sorted-disjoint invariants, so these standard iterators can be used directly with the library's operators (PR #27).
• Added a combinator to turn an Option<SortedDisjoint> into a SortedDisjoint via FlatMap/Flatten.

Notes

• core::iter::StepBy is not yet supported because it does not implement FusedIterator upstream; see the TODO in src/sorted_disjoint.rs and https://internals.rust-lang.org/t/implement-fusediterator-for-core-stepby/24074

Changed

• Removed redundant struct-level trait bounds across iterator/map/set wrapper structs and kept
  constraints on impls/usage sites where needed.

Breaking

• AssumeSortedStarts and AssumePrioritySortedStartsMap now take fewer generic parameters.
  • AssumeSortedStarts<T, I> -> AssumeSortedStarts<I>
  • AssumePrioritySortedStartsMap<T, VR, I> -> AssumePrioritySortedStartsMap<I>
• Migration note: calls like AssumeSortedStarts::new(iter) and
  AssumePrioritySortedStartsMap::new(iter) are typically unchanged due to inference; explicit
  type aliases/annotations may need updates.

Changed

• Removed redundant struct-level trait bounds across iterator/map/set wrapper structs and kept constraints on impls/usage sites where needed.

Breaking

• AssumeSortedStarts and AssumePrioritySortedStartsMap now take fewer generic parameters.
  • AssumeSortedStarts<T, I> -> AssumeSortedStarts<I>
  • AssumePrioritySortedStartsMap<T, VR, I> -> AssumePrioritySortedStartsMap<I>
• Migration note: calls like AssumeSortedStarts::new(iter) and AssumePrioritySortedStartsMap::new(iter) are typically unchanged due to inference; explicit type aliases/annotations may need updates.

Parallelize check-all, skip benches locally, and fix SIMD/example reg…

Changed

• RangeSetBlaze::ranges_insert and RangeMapBlaze::ranges_insert now accept any RangeBounds<T>, not just RangeInclusive<T> (issue #24).

Update lockfile for 0.4.3

Changed

• Improved local CI ergonomics and speed:
  • cargo check-all now runs independent checks in parallel
  • local check-all test target now uses --lib --tests --examples to skip slow benches
• Updated from_slice SIMD imports/bounds for compatibility with current Rust nightly APIs.
• Updated examples/nine_rules_maps assertions to match right-to-left precedence semantics.

• Fix SIMD compatibility for nightly: remove LaneCount/SupportedLaneCount

• Update from_slice feature for Rust nightly post-2026-01-28
• Remove obsolete LaneCount and SupportedLaneCount trait bounds
• Update documentation and examples
• Bump version to 0.4.2

• Add developer tooling and fix clippy warnings

• Add justfile for local CI testing
• Add CONTRIBUTING.md developer guide
• Update README.md with contributing section
• Fix clippy::unnecessary_option_map_or_else in integer.rs

Changed

• Updated from_slice feature for compatibility with Rust nightly (post-2026-01-28)
  • Removed obsolete LaneCount and SupportedLaneCount trait bounds from SIMD code
  • Lane count constraints now compiler-enforced (max 64 lanes, power-of-two only)
  • Requires recent Rust nightly for from_slice feature
  • No functional changes; purely a compatibility update

• Implemented RangeOnce<T>, a zero-allocation adapter that yields 0 or 1 non-empty inclusive ranges.

  • RangeOnce implements SortedStarts<T> and SortedDisjoint<T>, providing a sound and ergonomic way to work with single ranges.

  • Example:

    &a & RangeOnce::new(15, 35);
    &a | RangeOnce::new(22, 25);  
    

  • Empty ranges (start > end) now produce an empty iterator, preserving all invariants.

• Added From<RangeInclusive<T>> for RangeSetBlaze, allowing direct conversion of single ranges:

  RangeSetBlaze::from(5..=10);
  RangeSetBlaze::from(5..=4); // yields empty set
  

• Changed precedence of RangeMapBlaze to always be right-to-left.

• Added support for maps, RangeMapBlaze.
• Add support for char, IpAddV4, and IpAddV6 integer-like types.
• Some breaking changes in the rest of the package to improve the API and performance.

• Added RangeSetBlaze::from_sorted_starts
• Added documentation for SortedStarts and AssumeSortedStarts
• Changed CheckSortedDisjoint::new to support IntoIterator
• Changed AssumeSortedStarts::new to support IntoIterator

• Added DoubleEndedIterator when iterating integer elements. Thanks to enh.

Changed

• Added optional from_slice cargo feature and support for a new RangeSetBlaze::from_slice constructor. The feature uses SIMD and requires Rust nightly.