@@ -23,9 +23,9 @@ impl Layout {
23
23
}
24
24
}
25
25
26
- pub fn ffi_size ( & self ) -> ( Col_ , Row_ ) {
26
+ pub fn ffi_size ( & self ) -> ( Row_ , Col_ ) {
27
27
let ( n, m) = self . size ( ) ;
28
- ( m as Col_ , n as Row_ )
28
+ ( n as Row_ , m as Col_ )
29
29
}
30
30
31
31
pub fn ffi_layout ( & self ) -> Layout_ {
@@ -38,17 +38,17 @@ impl Layout {
38
38
39
39
pub trait AllocatedArray2D {
40
40
type Scalar ;
41
- fn layout ( & self ) -> LResult < Layout > ;
42
- fn square_layout ( & self ) -> LResult < Layout > ;
43
- fn as_allocated ( & self ) -> LResult < & [ Self :: Scalar ] > ;
41
+ fn layout ( & self ) -> Result < Layout > ;
42
+ fn square_layout ( & self ) -> Result < Layout > ;
43
+ fn as_allocated ( & self ) -> Result < & [ Self :: Scalar ] > ;
44
44
}
45
45
46
46
impl < A , S > AllocatedArray2D for ArrayBase < S , Ix2 >
47
47
where S : Data < Elem = A >
48
48
{
49
49
type Scalar = A ;
50
50
51
- fn layout ( & self ) -> LResult < Layout > {
51
+ fn layout ( & self ) -> Result < Layout > {
52
52
let strides = self . strides ( ) ;
53
53
if :: std:: cmp:: min ( strides[ 0 ] , strides[ 1 ] ) != 1 {
54
54
return Err ( StrideError :: new ( strides[ 0 ] , strides[ 1 ] ) . into ( ) ) ;
@@ -60,7 +60,7 @@ impl<A, S> AllocatedArray2D for ArrayBase<S, Ix2>
60
60
}
61
61
}
62
62
63
- fn square_layout ( & self ) -> LResult < Layout > {
63
+ fn square_layout ( & self ) -> Result < Layout > {
64
64
let l = self . layout ( ) ?;
65
65
let ( n, m) = l. size ( ) ;
66
66
if n == m {
@@ -70,7 +70,7 @@ impl<A, S> AllocatedArray2D for ArrayBase<S, Ix2>
70
70
}
71
71
}
72
72
73
- fn as_allocated ( & self ) -> LResult < & [ A ] > {
73
+ fn as_allocated ( & self ) -> Result < & [ A ] > {
74
74
let slice = self . as_slice_memory_order ( ) . ok_or ( MemoryContError :: new ( ) ) ?;
75
75
Ok ( slice)
76
76
}
0 commit comments