HomeSort by relevance Sort by last modified time
    Searched full:sparse (Results 251 - 275 of 507) sorted by null

<<11121314151617181920>>

  /frameworks/base/core/java/android/widget/
TableLayout.java 142 * <p>The result of the parsing is stored in a sparse boolean array. The
143 * parsed column ids are used as the keys of the sparse array. The values
147 * @return a sparse array of boolean mapping column indexes to the columns
160 // putting true in this sparse array indicates that the
  /system/core/logcat/
event.logtags 1 # The entries in this file map a sparse set of log tag numbers to tag names.
  /external/chromium/net/disk_cache/
entry_impl.cc 862 scoped_ptr<SparseControl> sparse;
863 sparse.reset(new SparseControl(const_cast<EntryImpl*>(this)));
864 return sparse->CouldBeSparse();
888 // Save the sparse info to disk. This will generate IO for this entry and
    [all...]
  /external/eigen/Eigen/src/SparseCore/
SparseMatrix.h 19 * \brief A versatible sparse matrix representation
47 typedef Sparse StorageKind;
558 /** Constructs a sparse matrix from the sparse expression \a other */
575 /** Swaps the content of two sparse matrices of the same type.
    [all...]
SparseBlock.h 86 // template<typename Sparse>
268 // template<typename Sparse>
  /external/v8/src/
array.js 39 // Gets a sorted array of array keys. Useful for operations on sparse
89 // Optimized for sparse arrays if separator is ''.
217 // special array operations to handle sparse arrays in a sensible fashion.
260 // special array operations to handle sparse arrays in a sensible fashion.
485 // For implementing reverse() on large, sparse arrays.
1004 // The following functions cannot be made efficient on sparse arrays while
    [all...]
  /cts/tools/dasm/test/
all_opcodes.d 71 sparse-switch v11
74 sparse-switch-end
  /cts/tools/vm-tests-tf/src/dot/junit/opcodes/sparse_switch/d/
T_sparse_switch_11.dfh 148 // parsed: offset 280, len 6: |0000: sparse-switch v4, 00000010 // +0x00000010
164 // parsed: offset 312, len 28: |0010: sparse-switch-data (14 units)
T_sparse_switch_12.dfh 148 // parsed: offset 280, len 6: |0000: sparse-switch v4, 00000010 // +0x00000010
164 // parsed: offset 312, len 28: |0010: sparse-switch-data (14 units)
T_sparse_switch_14.dfh 150 // parsed: offset 282, len 6: |0001: sparse-switch v4, 00000010 // +0x0000000f
164 // parsed: offset 312, len 28: |0010: sparse-switch-data (14 units)
T_sparse_switch_7.dfh 148 // parsed: offset 280, len 6: |0000: sparse-switch v4, 00000010 // +0x00000010
164 // parsed: offset 312, len 28: |0010: sparse-switch-data (14 units)
T_sparse_switch_8.dfh 148 // parsed: offset 280, len 6: |0000: sparse-switch v4, 00000010 // +0x00000010
164 // parsed: offset 312, len 28: |0010: sparse-switch-data (14 units)
T_sparse_switch_9.dfh 148 // parsed: offset 280, len 6: |0000: sparse-switch v4, 00000010 // +0x00000010
165 // parsed: offset 312, len 28: |0010: sparse-switch-data (14 units)
  /dalvik/dx/src/com/android/dx/cf/code/
BasicBlocker.java 56 * {@code non-null, sparse;} for each instruction offset to a branch of
62 * {@code non-null, sparse;} for each instruction offset to a throwing
  /external/chromium/net/http/
partial_data.cc 246 // sparse entry so let's not write to this entry.
285 // Make sure that this is really a sparse entry.
  /external/eigen/bench/
sparse_setter.cpp 118 // eigen sparse matrices
151 std::cout << "Eigen google sparse\t" << timer.value() << "\n";
  /external/eigen/test/
sparse_basic.cpp 11 #include "sparse.h"
193 // sparse cwise* dense
  /external/libvpx/libvpx/examples/includes/geshi/geshi/
scilab.php 59 'sparse', 'boolean sparse', 'list', 'tlist', 'library', 'endfunction'
  /external/llvm/include/llvm/Analysis/
TargetTransformInfo.h 197 /// may or may not degrade performance if the population is sparse. A HW
199 /// with, SW implementation when the population is sparse; otherwise, it is
  /external/llvm/lib/Analysis/
SparsePropagation.cpp 1 //===- SparsePropagation.cpp - Sparse Conditional Property Propagation ----===//
10 // This file implements an abstract sparse conditional propagation algorithm,
  /external/v8/test/mjsunit/
array-reduce.js 468 "reduce sparse no initial value not throwing TypeError");
480 "reduceRight sparse no initial value not throwing TypeError");
  /external/webkit/Source/WebCore/platform/graphics/chromium/
FontUtilsChromiumWin.cpp 66 // A simple mapping from UScriptCode to family name. This is a sparse array,
371 // but its coverage is rather sparse.
  /external/wpa_supplicant_8/src/utils/
common.h 435 * Definitions for sparse validation
436 * (http://kernel.org/pub/linux/kernel/people/josh/sparse/)
  /dalvik/libdex/
DexOpcodes.cpp 77 "sparse-switch",
  /external/ceres-solver/internal/ceres/
dense_sparse_matrix_test.cc 31 // TODO(keir): Implement a generic "compare sparse matrix implementations" test

Completed in 1103 milliseconds

<<11121314151617181920>>