Merge pull request #411 from brendanzab/version-bump
Bump cargo version to v0.14.1
This commit is contained in:
commit
14277a07b1
4 changed files with 15 additions and 7 deletions
12
CHANGELOG.md
12
CHANGELOG.md
|
@ -6,6 +6,13 @@ This project adheres to [Semantic Versioning](http://semver.org/).
|
|||
|
||||
## [Unreleased]
|
||||
|
||||
## [v0.14.1] - 2017-05-02
|
||||
|
||||
### Fixed
|
||||
|
||||
- Added a workaround for rust-lang/rust#41478, and in the process cleaned up
|
||||
some type projections for angles
|
||||
|
||||
## [v0.14.0] - 2017-04-26
|
||||
|
||||
## Changed
|
||||
|
@ -251,8 +258,9 @@ This project adheres to [Semantic Versioning](http://semver.org/).
|
|||
|
||||
## v0.0.1 - 2014-06-24
|
||||
|
||||
[Unreleased]: https://github.com/brendanzab/cgmath/compare/v0.14.0...HEAD
|
||||
[v0.13.1]: https://github.com/brendanzab/cgmath/compare/v0.13.1...v0.14.0
|
||||
[Unreleased]: https://github.com/brendanzab/cgmath/compare/v0.14.1...HEAD
|
||||
[v0.14.1]: https://github.com/brendanzab/cgmath/compare/v0.14.0...v0.14.1
|
||||
[v0.14.0]: https://github.com/brendanzab/cgmath/compare/v0.13.1...v0.14.0
|
||||
[v0.13.1]: https://github.com/brendanzab/cgmath/compare/v0.13.0...v0.13.1
|
||||
[v0.12.0]: https://github.com/brendanzab/cgmath/compare/v0.12.0...v0.13.0
|
||||
[v0.12.0]: https://github.com/brendanzab/cgmath/compare/v0.11.0...v0.12.0
|
||||
|
|
|
@ -1,7 +1,7 @@
|
|||
[package]
|
||||
|
||||
name = "cgmath"
|
||||
version = "0.14.0"
|
||||
version = "0.14.1"
|
||||
authors = ["Brendan Zabarauskas <bjzaba@yahoo.com.au>"]
|
||||
license = "Apache-2.0"
|
||||
description = "A linear algebra and mathematics library for computer graphics."
|
||||
|
|
|
@ -32,8 +32,8 @@ use vector::{Vector2, Vector3};
|
|||
/// creates a circular motion, and preserves at least one point in the space.
|
||||
pub trait Rotation<P: EuclideanSpace>: Sized + Copy + One where
|
||||
// FIXME: Ugly type signatures - blocked by rust-lang/rust#24092
|
||||
Self: ApproxEq<Epsilon = <P as EuclideanSpace>::Scalar>,
|
||||
<P as EuclideanSpace>::Scalar: BaseFloat,
|
||||
Self: ApproxEq<Epsilon = P::Scalar>,
|
||||
P::Scalar: BaseFloat,
|
||||
Self: iter::Product<Self>,
|
||||
{
|
||||
/// Create a rotation to a given direction with an 'up' vector.
|
||||
|
|
|
@ -64,9 +64,9 @@ pub struct Decomposed<V: VectorSpace, R> {
|
|||
}
|
||||
|
||||
impl<P: EuclideanSpace, R: Rotation<P>> Transform<P> for Decomposed<P::Diff, R>
|
||||
where <P as EuclideanSpace>::Scalar: BaseFloat,
|
||||
where P::Scalar: BaseFloat,
|
||||
// FIXME: Investigate why this is needed!
|
||||
<P as EuclideanSpace>::Diff: VectorSpace
|
||||
P::Diff: VectorSpace
|
||||
{
|
||||
#[inline]
|
||||
fn one() -> Decomposed<P::Diff, R> {
|
||||
|
|
Loading…
Reference in a new issue