Skip to content

Commit

Permalink
Merge pull request #368 from willow-ahrens/wma/tensorr
Browse files Browse the repository at this point in the history
oops
  • Loading branch information
willow-ahrens authored Jan 9, 2024
2 parents e44fc29 + c1cb8c8 commit 5d4af0b
Showing 1 changed file with 6 additions and 6 deletions.
12 changes: 6 additions & 6 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -33,8 +33,8 @@ Finch supports a wide variety of array structure beyond sparsity. Whether you're

| Feature/Structure | Example Usage |
|-------------------|---------------|
| Major Sparse Formats and Structured Arrays | `A = Tensorr(Dense(SparseList(Element(0.0)), 3, 4)`|
| Background Values Other Than Zero | `B = Tensorr(SparseList(Element(1.0)), 9)`|
| Major Sparse Formats and Structured Arrays | `A = Tensor(Dense(SparseList(Element(0.0)), 3, 4)`|
| Background Values Other Than Zero | `B = Tensor(SparseList(Element(1.0)), 9)`|
| Broadcasts and Reductions | `sum(A .* B)`|
| Custom Operators | `x[] <<min>>= y[i] + z[i]`|
| Multiple Outputs | `x[] <<min>>= y[i]; z[] <<max>>= y[i]`|
Expand Down Expand Up @@ -64,7 +64,7 @@ Below is a Julia program using Finch to compute the minimum, maximum, sum, and v
```julia
using Finch

X = Tensorr(SparseList(Element(0.0)), fsprand(10, 0.5))
X = Tensor(SparseList(Element(0.0)), fsprand(10, 0.5))
x_min = Scalar(Inf)
x_max = Scalar(-Inf)
x_sum = Scalar(0.0)
Expand All @@ -87,9 +87,9 @@ end;
As a more traditional example, what follows is a sparse matrix-vector multiplication using a column-major approach.

```julia
x = Tensorr(Dense(Element(0.0)), rand(42));
A = Tensorr(Dense(SparseList(Element(0.0))), fsprand(42, 42, 0.1));
y = Tensorr(Dense(Element(0.0)));
x = Tensor(Dense(Element(0.0)), rand(42));
A = Tensor(Dense(SparseList(Element(0.0))), fsprand(42, 42, 0.1));
y = Tensor(Dense(Element(0.0)));

@finch begin
y .= 0
Expand Down

0 comments on commit 5d4af0b

Please sign in to comment.