OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:Sparse
(Results
1 - 25
of
44
) sorted by null
1
2
/external/eigen/test/
mpl2only.cpp
15
#include <Eigen/
Sparse
>
/external/llvm/include/llvm/ProfileData/
InstrProfWriter.h
36
bool
Sparse
;
43
InstrProfWriter(bool
Sparse
= false);
74
void setOutputSparse(bool
Sparse
);
/external/llvm/include/llvm/ADT/
SparseSet.h
1
//===--- llvm/ADT/SparseSet.h -
Sparse
set ----------------------*- C++ -*-===//
11
// Briggs, Torczon, "An efficient representation for
sparse
sets", ACM Letters
14
// A
sparse
set holds a small number of objects identified by integer keys from
15
// a moderately sized universe. The
sparse
set uses more memory than other
97
/// SparseSet contains a dense vector holding all the objects and a
sparse
99
/// the
sparse
array which is the size of the key universe. The SparseT
103
/// When SparseT is uint32_t, find() only touches 2 cache lines, but the
sparse
107
/// lines, but the
sparse
array is 4x smaller. N is the number of elements in
129
SparseT *
Sparse
;
146
SparseSet() :
Sparse
(nullptr), Universe(0) {
[
all
...]
SparseMultiSet.h
1
//===--- llvm/ADT/SparseMultiSet.h -
Sparse
multiset ------------*- C++ -*-===//
13
// A
sparse
multiset holds a small number of objects identified by integer keys
14
// from a moderately sized universe. The
sparse
multiset uses more memory than
47
/// SparseMultiSet contains a dense vector holding all the objects and a
sparse
49
/// the
sparse
array which is the size of the key universe. The SparseT template
53
///
sparse
array uses 4 x Universe bytes.
56
/// lines, but the
sparse
array is 4x smaller. N is the number of elements in
116
SparseT *
Sparse
;
191
:
Sparse
(nullptr), Universe(0), FreelistIdx(SMSNode::INVALID), NumFree(0) {}
193
~SparseMultiSet() { free(
Sparse
); }
[
all
...]
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ProfileData/
InstrProfWriter.h
40
bool
Sparse
;
47
InstrProfWriter(bool
Sparse
= false);
91
void setOutputSparse(bool
Sparse
);
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/
SparseSet.h
1
//===- llvm/ADT/SparseSet.h -
Sparse
set ------------------------*- C++ -*-===//
11
// Briggs, Torczon, "An efficient representation for
sparse
sets", ACM Letters
14
// A
sparse
set holds a small number of objects identified by integer keys from
15
// a moderately sized universe. The
sparse
set uses more memory than other
101
/// SparseSet contains a dense vector holding all the objects and a
sparse
103
/// the
sparse
array which is the size of the key universe. The SparseT
107
/// When SparseT is uint32_t, find() only touches 2 cache lines, but the
sparse
111
/// lines, but the
sparse
array is 4x smaller. N is the number of elements in
133
SparseT *
Sparse
= nullptr;
148
~SparseSet() { free(
Sparse
); }
[
all
...]
SparseMultiSet.h
1
//===- llvm/ADT/SparseMultiSet.h -
Sparse
multiset --------------*- C++ -*-===//
13
// A
sparse
multiset holds a small number of objects identified by integer keys
14
// from a moderately sized universe. The
sparse
multiset uses more memory than
55
/// SparseMultiSet contains a dense vector holding all the objects and a
sparse
57
/// the
sparse
array which is the size of the key universe. The SparseT template
61
///
sparse
array uses 4 x Universe bytes.
64
/// lines, but the
sparse
array is 4x smaller. N is the number of elements in
124
SparseT *
Sparse
= nullptr;
196
~SparseMultiSet() { free(
Sparse
); }
210
free(
Sparse
);
[
all
...]
/device/linaro/bootloader/edk2/EdkCompatibilityPkg/Foundation/Ppi/BaseMemoryTest/
BaseMemoryTest.h
37
Sparse
,
/external/tensorflow/tensorflow/core/util/
example_proto_fast_parsing.h
32
#include "tensorflow/core/util/
sparse
/sparse_tensor.h"
55
struct
Sparse
{
61
std::vector<
Sparse
>
sparse
;
member in struct:tensorflow::example::FastParseExampleConfig
/external/eigen/doc/special_examples/
Tutorial_sparse_example.cpp
1
#include <Eigen/
Sparse
>
4
typedef Eigen::SparseMatrix<double> SpMat; // declares a column-major
sparse
matrix type of double
Tutorial_sparse_example_details.cpp
1
#include <Eigen/
Sparse
>
5
typedef Eigen::SparseMatrix<double> SpMat; // declares a column-major
sparse
matrix type of double
/external/eigen/Eigen/src/SparseCore/
SparseUtil.h
78
template<typename T> struct eval<T,
Sparse
>
96
// TODO this seems almost identical to plain_matrix_type<T,
Sparse
>
111
template<typename T> struct plain_matrix_type<T,
Sparse
>
121
struct plain_object_eval<T,
Sparse
>
126
struct solve_traits<Decomposition,RhsType,
Sparse
>
132
struct generic_xpr_base<Derived, MatrixXpr,
Sparse
>
SparsePermutation.h
13
// This file implements
sparse
* permutation products
88
template <int ProductTag> struct product_promote_storage_type<
Sparse
, PermutationStorage, ProductTag> { typedef
Sparse
ret; };
89
template <int ProductTag> struct product_promote_storage_type<PermutationStorage,
Sparse
, ProductTag> { typedef
Sparse
ret; };
SparseDenseProduct.h
17
template <> struct product_promote_storage_type<
Sparse
,Dense, OuterProduct> { typedef
Sparse
ret; };
18
template <> struct product_promote_storage_type<Dense,
Sparse
, OuterProduct> { typedef
Sparse
ret; };
212
// then build a
sparse
-view so that we can seamlessly iterate over it.
213
typedef typename conditional<is_same<typename internal::traits<Lhs1>::StorageKind,
Sparse
>::value,
215
typedef typename conditional<is_same<typename internal::traits<Lhs1>::StorageKind,
Sparse
>::value,
252
Scalar get(const RhsEval &rhs, Index outer,
Sparse
=
Sparse
())
285
//
sparse
* dense outer produc
[
all
...]
SparseTranspose.h
45
template<typename MatrixType> class TransposeImpl<MatrixType,
Sparse
>
SparseTriangularView.h
18
* \brief Base class for a triangular part in a \b
sparse
matrix
21
* It extends class TriangularView with additional methods which are available for
sparse
expressions only.
25
template<typename MatrixType, unsigned int Mode> class TriangularViewImpl<MatrixType,Mode,
Sparse
>
61
/** Applies the inverse of \c *this to the
sparse
vector or matrix \a other, "in-place" */
SparseAssign.h
36
// by default
sparse
evaluation do not alias, so we can safely bypass the generic call_assignment routine
52
struct storage_kind_to_evaluator_kind<
Sparse
> {
57
struct storage_kind_to_shape<
Sparse
> {
126
// Generic
Sparse
to
Sparse
assignment
136
// Generic
Sparse
to Dense assignment
/external/llvm/lib/ProfileData/
InstrProfWriter.cpp
144
InstrProfWriter::InstrProfWriter(bool
Sparse
)
145
:
Sparse
(
Sparse
), FunctionData(), ProfileKind(PF_Unknown),
155
void InstrProfWriter::setOutputSparse(bool
Sparse
) {
156
this->
Sparse
=
Sparse
;
186
if (!
Sparse
)
/external/swiftshader/third_party/llvm-7.0/llvm/lib/ProfileData/
InstrProfWriter.cpp
165
InstrProfWriter::InstrProfWriter(bool
Sparse
)
166
:
Sparse
(
Sparse
), InfoObj(new InstrProfRecordWriterTrait()) {}
176
void InstrProfWriter::setOutputSparse(bool
Sparse
) {
177
this->
Sparse
=
Sparse
;
223
if (!
Sparse
)
/device/generic/goldfish/tools/
README.md
22
*
Sparse
image detection
41
* Output in
sparse
format
/external/eigen/bench/
sparse_lu.cpp
6
#include <Eigen/
Sparse
>
/external/eigen/Eigen/src/Core/util/
XprHelper.h
522
*
sparse
op dense ->
sparse
523
* dense op
sparse
->
sparse
532
template <typename Functor> struct cwise_promote_storage_type<
Sparse
,Dense,Functor> { typedef
Sparse
ret; };
533
template <typename Functor> struct cwise_promote_storage_type<Dense,
Sparse
,Functor> { typedef
Sparse
ret; };
539
template <typename LhsKind, int LhsOrder, int RhsOrder> struct cwise_promote_storage_order<LhsKind,
Sparse
,LhsOrder,RhsOrder> { enum { value = RhsOrder }; };
540
template <typename RhsKind, int LhsOrder, int RhsOrder> struct cwise_promote_storage_order<
Sparse
,RhsKind,LhsOrder,RhsOrder> { enum { value = LhsOrder }; }
[
all
...]
Constants.h
177
* Means that the underlying coefficients can be accessed through pointers to the
sparse
(un)compressed storage format,
493
/** The type used to identify a general
sparse
storage. */
494
struct
Sparse
{};
/external/syzkaller/vendor/golang.org/x/net/idna/
trie.go
30
//
Sparse
block handling code.
/device/linaro/bootloader/edk2/QuarkPlatformPkg/Platform/Pei/PlatformInit/
MrcWrapper.h
76
Sparse
,
Completed in 2220 milliseconds
1
2