2017-02-13 01:17:09 +08:00
|
|
|
|
//! Abstract definition of a matrix data storage allocator.
|
|
|
|
|
|
2016-12-05 05:44:42 +08:00
|
|
|
|
use std::any::Any;
|
|
|
|
|
|
2019-03-23 21:29:07 +08:00
|
|
|
|
use crate::base::constraint::{SameNumberOfColumns, SameNumberOfRows, ShapeConstraint};
|
|
|
|
|
use crate::base::dimension::{Dim, U1};
|
|
|
|
|
use crate::base::storage::ContiguousStorageMut;
|
|
|
|
|
use crate::base::{DefaultAllocator, Scalar};
|
2016-12-05 05:44:42 +08:00
|
|
|
|
|
|
|
|
|
/// A matrix allocator of a memory buffer that may contain `R::to_usize() * C::to_usize()`
|
|
|
|
|
/// elements of type `N`.
|
|
|
|
|
///
|
|
|
|
|
/// An allocator is said to be:
|
|
|
|
|
/// − static: if `R` and `C` both implement `DimName`.
|
|
|
|
|
/// − dynamic: if either one (or both) of `R` or `C` is equal to `Dynamic`.
|
|
|
|
|
///
|
|
|
|
|
/// Every allocator must be both static and dynamic. Though not all implementations may share the
|
|
|
|
|
/// same `Buffer` type.
|
2019-11-20 04:57:37 +08:00
|
|
|
|
pub trait Allocator<N: Scalar + Copy, R: Dim, C: Dim = U1>: Any + Sized {
|
2017-02-13 01:17:09 +08:00
|
|
|
|
/// The type of buffer this allocator can instanciate.
|
2017-08-03 01:37:44 +08:00
|
|
|
|
type Buffer: ContiguousStorageMut<N, R, C> + Clone;
|
2016-12-05 05:44:42 +08:00
|
|
|
|
|
|
|
|
|
/// Allocates a buffer with the given number of rows and columns without initializing its content.
|
|
|
|
|
unsafe fn allocate_uninitialized(nrows: R, ncols: C) -> Self::Buffer;
|
|
|
|
|
|
|
|
|
|
/// Allocates a buffer initialized with the content of the given iterator.
|
2018-02-02 19:26:35 +08:00
|
|
|
|
fn allocate_from_iterator<I: IntoIterator<Item = N>>(
|
|
|
|
|
nrows: R,
|
|
|
|
|
ncols: C,
|
|
|
|
|
iter: I,
|
|
|
|
|
) -> Self::Buffer;
|
2016-12-05 05:44:42 +08:00
|
|
|
|
}
|
|
|
|
|
|
2017-08-03 01:37:44 +08:00
|
|
|
|
/// A matrix reallocator. Changes the size of the memory buffer that initially contains (RFrom ×
|
|
|
|
|
/// CFrom) elements to a smaller or larger size (RTo, CTo).
|
2019-11-20 04:57:37 +08:00
|
|
|
|
pub trait Reallocator<N: Scalar + Copy, RFrom: Dim, CFrom: Dim, RTo: Dim, CTo: Dim>:
|
2018-10-22 13:00:10 +08:00
|
|
|
|
Allocator<N, RFrom, CFrom> + Allocator<N, RTo, CTo>
|
|
|
|
|
{
|
2017-08-03 01:37:44 +08:00
|
|
|
|
/// Reallocates a buffer of shape `(RTo, CTo)`, possibly reusing a previously allocated buffer
|
|
|
|
|
/// `buf`. Data stored by `buf` are linearly copied to the output:
|
|
|
|
|
///
|
|
|
|
|
/// * The copy is performed as if both were just arrays (without a matrix structure).
|
|
|
|
|
/// * If `buf` is larger than the output size, then extra elements of `buf` are truncated.
|
|
|
|
|
/// * If `buf` is smaller than the output size, then extra elements of the output are left
|
|
|
|
|
/// uninitialized.
|
2018-02-02 19:26:35 +08:00
|
|
|
|
unsafe fn reallocate_copy(
|
|
|
|
|
nrows: RTo,
|
|
|
|
|
ncols: CTo,
|
|
|
|
|
buf: <Self as Allocator<N, RFrom, CFrom>>::Buffer,
|
|
|
|
|
) -> <Self as Allocator<N, RTo, CTo>>::Buffer;
|
2016-12-05 05:44:42 +08:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// The number of rows of the result of a componentwise operation on two matrices.
|
|
|
|
|
pub type SameShapeR<R1, R2> = <ShapeConstraint as SameNumberOfRows<R1, R2>>::Representative;
|
|
|
|
|
|
|
|
|
|
/// The number of columns of the result of a componentwise operation on two matrices.
|
|
|
|
|
pub type SameShapeC<C1, C2> = <ShapeConstraint as SameNumberOfColumns<C1, C2>>::Representative;
|
|
|
|
|
|
|
|
|
|
// FIXME: Bad name.
|
2017-08-03 01:37:44 +08:00
|
|
|
|
/// Restricts the given number of rows and columns to be respectively the same.
|
2018-10-22 13:00:10 +08:00
|
|
|
|
pub trait SameShapeAllocator<N, R1, C1, R2, C2>:
|
|
|
|
|
Allocator<N, R1, C1> + Allocator<N, SameShapeR<R1, R2>, SameShapeC<C1, C2>>
|
2018-02-02 19:26:35 +08:00
|
|
|
|
where
|
|
|
|
|
R1: Dim,
|
|
|
|
|
R2: Dim,
|
|
|
|
|
C1: Dim,
|
|
|
|
|
C2: Dim,
|
2019-11-20 04:57:37 +08:00
|
|
|
|
N: Scalar + Copy,
|
2018-02-02 19:26:35 +08:00
|
|
|
|
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
|
|
|
|
|
{
|
2016-12-05 05:44:42 +08:00
|
|
|
|
}
|
|
|
|
|
|
2017-08-03 01:37:44 +08:00
|
|
|
|
impl<N, R1, R2, C1, C2> SameShapeAllocator<N, R1, C1, R2, C2> for DefaultAllocator
|
2018-02-02 19:26:35 +08:00
|
|
|
|
where
|
|
|
|
|
R1: Dim,
|
|
|
|
|
R2: Dim,
|
|
|
|
|
C1: Dim,
|
|
|
|
|
C2: Dim,
|
2019-11-20 04:57:37 +08:00
|
|
|
|
N: Scalar + Copy,
|
2018-02-02 19:26:35 +08:00
|
|
|
|
DefaultAllocator: Allocator<N, R1, C1> + Allocator<N, SameShapeR<R1, R2>, SameShapeC<C1, C2>>,
|
|
|
|
|
ShapeConstraint: SameNumberOfRows<R1, R2> + SameNumberOfColumns<C1, C2>,
|
2018-10-22 13:00:10 +08:00
|
|
|
|
{}
|
2016-12-05 05:44:42 +08:00
|
|
|
|
|
|
|
|
|
// XXX: Bad name.
|
2017-08-03 01:37:44 +08:00
|
|
|
|
/// Restricts the given number of rows to be equal.
|
2018-10-22 13:00:10 +08:00
|
|
|
|
pub trait SameShapeVectorAllocator<N, R1, R2>:
|
|
|
|
|
Allocator<N, R1> + Allocator<N, SameShapeR<R1, R2>> + SameShapeAllocator<N, R1, U1, R2, U1>
|
2018-02-02 19:26:35 +08:00
|
|
|
|
where
|
|
|
|
|
R1: Dim,
|
|
|
|
|
R2: Dim,
|
2019-11-20 04:57:37 +08:00
|
|
|
|
N: Scalar + Copy,
|
2018-02-02 19:26:35 +08:00
|
|
|
|
ShapeConstraint: SameNumberOfRows<R1, R2>,
|
|
|
|
|
{
|
2016-12-05 05:44:42 +08:00
|
|
|
|
}
|
|
|
|
|
|
2017-08-03 01:37:44 +08:00
|
|
|
|
impl<N, R1, R2> SameShapeVectorAllocator<N, R1, R2> for DefaultAllocator
|
2018-02-02 19:26:35 +08:00
|
|
|
|
where
|
|
|
|
|
R1: Dim,
|
|
|
|
|
R2: Dim,
|
2019-11-20 04:57:37 +08:00
|
|
|
|
N: Scalar + Copy,
|
2018-02-02 19:26:35 +08:00
|
|
|
|
DefaultAllocator: Allocator<N, R1, U1> + Allocator<N, SameShapeR<R1, R2>>,
|
|
|
|
|
ShapeConstraint: SameNumberOfRows<R1, R2>,
|
2018-10-22 13:00:10 +08:00
|
|
|
|
{}
|