Published April 6, 2026 | Version v6.0.3
Software Open

JuliaReach/LazySets.jl: v6.0.3

  • 1. Aalborg University
  • 2. Universidad de la República
  • 3. TU Delft
  • 4. @SRA-VJTI
  • 5. @PlantingSpace
  • 6. Urudata Software
  • 7. @Shopify
  • 8. Delft University of Technology
  • 9. AMD
  • 10. ZeroDeposit
  • 11. @JuliaComputing

Description

LazySets v6.0.3

Diff since v6.0.2

Merged pull requests:

  • Revise integration of GeometryBasics (#4239) (@schillic)
  • Revise Singleton tests (#4240) (@schillic)
  • Add type-stable copy for Singleton (#4241) (@schillic)
  • Fix documentation of copy (#4242) (@schillic)
  • Update method documentation (#4243) (@schillic)
  • Better area and volume for AbstractSingleton (#4244) (@schillic)
  • Better radius for AbstractSingleton (#4245) (@schillic)
  • Better extrema for AbstractSingleton (#4246) (@schillic)
  • Better _affine_map_inverse_zonotope (#4247) (@schillic)
  • Better error message (#4248) (@schillic)
  • Use isequivalent (#4249) (@schillic)
  • @validate element (#4250) (@schillic)
  • Add convert from EmptySet to HPolyhedron (#4251) (@schillic)
  • Fix isequivalent for empty polyhedral arguments (#4252) (@schillic)
  • Bump codecov/codecov-action from 5 to 6 (#4253) (@dependabot[bot])
  • Better isflat for AbstractSingleton (#4254) (@schillic)
  • Better norm for AbstractSingleton (#4255) (@schillic)
  • Better distance for AbstractSingleton (#4256) (@schillic)
  • Better copy for Hyperrectangle (#4257) (@schillic)
  • Improve tests for copy (#4258) (@schillic)
  • Fix polyhedron for EmptySet (#4259) (@schillic)
  • @validate isflat (#4260) (@schillic)
  • Change parameters to avoid warning in tests (#4261) (@schillic)
  • Allow IntervalConstraintProgramming v0.15 (#4262) (@schillic)
  • Use get_order for Taylor* polynomials (#4264) (@schillic)
  • v6.0.3 (#4265) (@schillic)

Files

JuliaReach/LazySets.jl-v6.0.3.zip

Files (1.1 MB)

Name Size Download all
md5:7b59e90e235d566b50563b6e73b1205f
1.1 MB Preview Download

Additional details

Related works