Skip to content

CHANGELOG.md

Latest commit

 

History

History
79 lines (61 loc) · 3 KB

CHANGELOG.md

File metadata and controls

79 lines (61 loc) · 3 KB

Changelog

This project follows semantic versioning (semver) 2.0. Any new features, or breaking changes, will be written in this file. Bugfixes, internal refactors, documentation improvements and style changes will not be mentioned here, because they do not impact how the package is to be used.

0.4.0

Breaking changes

  • Removed the Unsafe trait type:

    • Instead of MutableMemoryView(::Unsafe, ::MemoryView), use unsafe_from_parts(::MemoryRef, ::Int)
    • Using the inner constructor MemoryView{T, M}(::Unsafe, ::MemoryRef{T}, ::Int) was never documented API and is now removed.

  • Matrix and other Array types with a different dimensionality than 1 is now NotMemory, since it is not equal to its own memory view, due to shape mismatch.

  • Out of bounds access now throws a LightBoundsError from the LightBoundsErrors package, instead of Base.BoundsError. This improves codegen slightly, as it enables escape analysis of the array, and outlines error paths slightly more aggressively.

  • MemoryView(::SubArray) now accepts fewer subarray types. However, it is unlikely that any instance that is now no longer accepted worked previously, so it is unlikely to be breaking in practice.

Other

  • parentindices now works correctly for zero-sized structs.
  • Base.memoryref(::MemoryView) obtains the MemoryRef in a MemoryView.

0.3.5

  • Add method MemoryKind{::Type{<:MemoryView}}
  • Add package extension for LibDeflate.jl

0.3.4

  • Add new function unsafe_from_parts to construct a memory view from a MemoryRef.

0.3.3

New features

  • Add a new split_each function, which iterates over memory views delimited by a single element delimiter.

Other changes

  • Add some more fast methods for Memory/Vector/MemoryView interop
  • Add a fast method for Base.readbytes! reading into a memory view

0.3.2

  • Support FixedSizeArrays
  • Various bugfixes and optimisations
  • Format with Runic

0.3.1

  • Fix a bug in parentindices, where it returned the wrong type
  • Make similar return a mutable array always
  • Various bugfixes and optimisations

0.3.0

Breaking changes

  • Change the bounds checking behaviour of the find* functions to match those of Vector. In particular, previously, findnext(pred, mem, -5) would be equivalent to searching from index 1, and similarly, findprev(pred, mem, lastindex(mem) + 10) would be equialent to searching from lastindex(mem). Now, searching from an index before the first valid index throws a BoundsError. Findfirst searching from i > lastindex(mem), and findlast searching from i < 1 will still simply return nothing, just like searching vectors.

Other changes

  • Add optimised versions of findprev and findlast, searching bytes
  • Add optimised version of find*(iszero, bytes) methods
  • Add optimised generic find* methods
  • Add functions split_first, split_last, split_at and split_unaligned
  • Add a more correct implementation of Base.mightalias for memory views and some types of arrays