Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
27 changed files
with
964 additions
and
468 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,105 @@ | ||
| # Copyright 2017, Iain Dunning, Joey Huchette, Miles Lubin, and contributors | ||
| # This Source Code Form is subject to the terms of the Mozilla Public | ||
| # License, v. 2.0. If a copy of the MPL was not distributed with this | ||
| # file, You can obtain one at http://mozilla.org/MPL/2.0/. | ||
|
|
||
| """ | ||
| default_container(indices) | ||
| If `indices` is a [`NestedIterator`](@ref), return a | ||
| [`SparseAxisArray`](@ref). Otherwise, `indices` should be | ||
| a `VectorizedProductIterator` and the function returns | ||
| `Array` if all iterators of the product are `Base.OneTo` and retunrs | ||
| [`DenseAxisArray`](@ref) otherwise. | ||
| """ | ||
| function default_container end | ||
|
|
||
| """ | ||
| container(f::Function, indices, ::Type{C}) | ||
| Create a container of type `C` with indices `indices` and values at given | ||
| indices given by `f`. | ||
| container(f::Function, indices) | ||
| Create a container with indices `indices` and values at given indices given by | ||
| `f`. The type of container used is determined by [`default_container`](@ref). | ||
| ## Examples | ||
| ```@jldoctest | ||
| julia> Containers.container((i, j) -> i + j, Containers.vectorized_product(Base.OneTo(3), Base.OneTo(3))) | ||
| 3×3 Array{Int64,2}: | ||
| 2 3 4 | ||
| 3 4 5 | ||
| 4 5 6 | ||
| julia> Containers.container((i, j) -> i + j, Containers.vectorized_product(1:3, 1:3)) | ||
| 2-dimensional DenseAxisArray{Int64,2,...} with index sets: | ||
| Dimension 1, 1:3 | ||
| Dimension 2, 1:3 | ||
| And data, a 3×3 Array{Int64,2}: | ||
| 2 3 4 | ||
| 3 4 5 | ||
| 4 5 6 | ||
| julia> Containers.container((i, j) -> i + j, Containers.vectorized_product(2:3, Base.OneTo(3))) | ||
| 2-dimensional DenseAxisArray{Int64,2,...} with index sets: | ||
| Dimension 1, 2:3 | ||
| Dimension 2, Base.OneTo(3) | ||
| And data, a 2×3 Array{Int64,2}: | ||
| 3 4 5 | ||
| 4 5 6 | ||
| julia> Containers.container((i, j) -> i + j, Containers.nested(() -> 1:3, i -> i:3, condition = (i, j) -> isodd(i) || isodd(j))) | ||
| SparseAxisArray{Int64,2,Tuple{Int64,Int64}} with 5 entries: | ||
| [1, 2] = 3 | ||
| [2, 3] = 5 | ||
| [3, 3] = 6 | ||
| [1, 1] = 2 | ||
| [1, 3] = 4 | ||
| ``` | ||
| """ | ||
| function container end | ||
|
|
||
| container(f::Function, indices) = container(f, indices, default_container(indices)) | ||
|
|
||
| const ArrayIndices{N} = VectorizedProductIterator{NTuple{N, Base.OneTo{Int}}} | ||
| default_container(::ArrayIndices) = Array | ||
| function container(f::Function, indices::ArrayIndices, ::Type{Array}) | ||
| return map(I -> f(I...), indices) | ||
| end | ||
| function _oneto(indices) | ||
| if indices isa UnitRange{Int} && indices == 1:length(indices) | ||
| return Base.OneTo(length(indices)) | ||
| end | ||
| error("Index set for array is not one-based interval.") | ||
| end | ||
| function container(f::Function, indices::VectorizedProductIterator, | ||
| ::Type{Array}) | ||
| container(f, vectorized_product(_oneto.(indices.prod.iterators)...), Array) | ||
| end | ||
| default_container(::VectorizedProductIterator) = DenseAxisArray | ||
| function container(f::Function, indices::VectorizedProductIterator, | ||
| ::Type{DenseAxisArray}) | ||
| return DenseAxisArray(map(I -> f(I...), indices), indices.prod.iterators...) | ||
| end | ||
| default_container(::NestedIterator) = SparseAxisArray | ||
| function container(f::Function, indices, | ||
| ::Type{SparseAxisArray}) | ||
| mappings = map(I -> I => f(I...), indices) | ||
| data = Dict(mappings) | ||
| if length(mappings) != length(data) | ||
| unique_indices = Set() | ||
| duplicate = nothing | ||
| for index in indices | ||
| if index in unique_indices | ||
| duplicate = index | ||
| break | ||
| end | ||
| push!(unique_indices, index) | ||
| end | ||
| error("Repeated index ", duplicate, ". Index sets must have unique elements.") | ||
| end | ||
| return SparseAxisArray(Dict(data)) | ||
| end |
Oops, something went wrong.