Skip to content

Commit

Permalink
...and documentation for PMCMatrix2D
Browse files Browse the repository at this point in the history
  • Loading branch information
Whiteknight committed Sep 1, 2010
1 parent 0d73c5b commit 3cc1c0d
Show file tree
Hide file tree
Showing 3 changed files with 329 additions and 64 deletions.
4 changes: 2 additions & 2 deletions src/pmc/complexmatrix2d.pmc
Expand Up @@ -1339,7 +1339,7 @@ Return a single Complex PMC from the item at the specified coordinates

=item* transpose()

Transposes the matrix lazily. This operation is O(n). Some operations, such as
Transposes the matrix lazily. This operation is O(1). Some operations, such as
mathematical operations do not work on a matrix which has been lazily
transposed, so those operations will force the matrix memory to be eagerly
transposed.
Expand Down Expand Up @@ -1367,7 +1367,7 @@ transposed.

=item* mem_transpose()

Transposes the actual data storage of the matrix. More expensive up-front
Transposes the actual data storage of the matrix. More expensive O(n) up-front
than the transpose() method, but the resulting memory structure is more suitable
for use in certain mathematical operations.

Expand Down
6 changes: 3 additions & 3 deletions src/pmc/nummatrix2d.pmc
Expand Up @@ -1017,7 +1017,7 @@ unaffected. Calling fill() never causes the matrix to shrink.

=item* item_at()

Return a single Complex PMC from the item at the specified coordinates
Return a single Float PMC from the item at the specified coordinates

=cut

Expand All @@ -1044,7 +1044,7 @@ Return a single Complex PMC from the item at the specified coordinates

=item* transpose()

Transposes the matrix lazily. This operation is O(n). Some operations, such as
Transposes the matrix lazily. This operation is O(1). Some operations, such as
mathematical operations do not work on a matrix which has been lazily
transposed, so those operations will force the matrix memory to be eagerly
transposed.
Expand All @@ -1071,7 +1071,7 @@ transposed.

=item* mem_transpose()

Transposes the actual data storage of the matrix. More expensive up-front
Transposes the actual data storage of the matrix. More expensive O(n) up-front
than the transpose() method, but the resulting memory structure is more suitable
for use in certain mathematical operations.

Expand Down

0 comments on commit 3cc1c0d

Please sign in to comment.