Home
last modified time | relevance | path

Searched defs:Rep (Results 1 – 25 of 85) sorted by relevance

1234

/external/tensorflow/tensorflow/core/lib/io/
Dtable_builder.cc70 struct TableBuilder::Rep { struct in tensorflow::table::TableBuilder
71 Options options;
72 Options index_block_options;
73 WritableFile* file;
74 uint64 offset;
75 Status status;
76 BlockBuilder data_block;
77 BlockBuilder index_block;
78 string last_key;
79 int64 num_entries;
[all …]
Dtable.cc30 struct Table::Rep { struct in tensorflow::table::Table
31 ~Rep() { delete index_block; } in ~Rep()
33 Options options;
34 Status status;
35 RandomAccessFile* file;
36 uint64 cache_id;
38 BlockHandle metaindex_handle; // Handle to metaindex_block: saved from footer
39 Block* index_block;
/external/libcxx/test/std/utilities/time/
Drep.h19 TEST_CONSTEXPR Rep() : data_(-1) {} in Rep() function
20 explicit TEST_CONSTEXPR Rep(int i) : data_(i) {} in Rep() function
Dyears.pass.cpp22 typedef D::rep Rep; in main() typedef
Dmonths.pass.cpp23 typedef D::rep Rep; in main() typedef
Dseconds.pass.cpp21 typedef D::rep Rep; in main() typedef
Dhours.pass.cpp21 typedef D::rep Rep; in main() typedef
Ddays.pass.cpp22 typedef D::rep Rep; in main() typedef
Dmicroseconds.pass.cpp21 typedef D::rep Rep; in main() typedef
/external/llvm-project/libcxx/test/std/utilities/time/
Drep.h18 TEST_CONSTEXPR Rep() : data_(-1) {} in Rep() function
19 explicit TEST_CONSTEXPR Rep(int i) : data_(i) {} in Rep() function
/external/libcxx/test/std/utilities/time/time.duration/time.duration.special/
Dzero.pass.cpp30 typedef typename D::rep Rep; in test() typedef
36 typedef typename D::rep Rep; in test() typedef
Dmax.pass.cpp31 typedef typename D::rep Rep; in test() typedef
37 typedef typename D::rep Rep; in test() typedef
Dmin.pass.cpp31 typedef typename D::rep Rep; in test() typedef
37 typedef typename D::rep Rep; in test() typedef
/external/tensorflow/tensorflow/compiler/mlir/hlo/lib/utils/
Dcycle_detector.cc51 struct GraphCycles::Rep { struct in mlir::GraphCycles
52 Vec<Node*> nodes;
54 Vec<int32_t> free_nodes;
58 Vec<int32_t> deltaf;
60 Vec<int32_t> deltab;
62 Vec<int32_t> list;
64 Vec<int32_t> merged;
66 Vec<int32_t> stack;
/external/llvm-project/clang/test/SemaTemplate/
Dtemp-param-subst-linear.cpp38 template<typename T, int N> struct Rep : Rep<typename Rep<T, N-1>::type, 1> {}; struct
39 template<typename ...T> struct Rep<TypeList<T...>, 1> { typedef TypeList<T..., T...> type; }; argument
/external/sfntly/cpp/src/test/tinyxml/
Dtinystr.h211 struct Rep struct
222 // rep_ = static_cast<Rep*>(operator new(sizeof(Rep) + cap)); in init() argument
/external/angle/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.cc345 struct GraphCycles::Rep { struct in absl::synchronization_internal::GraphCycles
346 Vec<Node*> nodes_;
347 Vec<int32_t> free_nodes_; // Indices for unused entries in nodes_
348 PointerMap ptrmap_;
351 Vec<int32_t> deltaf_; // Results of forward DFS
352 Vec<int32_t> deltab_; // Results of backward DFS
353 Vec<int32_t> list_; // All nodes to reprocess
354 Vec<int32_t> merged_; // Rank values to assign to list_ entries
355 Vec<int32_t> stack_; // Emulates recursion stack for depth-first searches
357 Rep() : ptrmap_(&nodes_) {} in Rep() argument
/external/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.cc344 struct GraphCycles::Rep { struct in absl::synchronization_internal::GraphCycles
345 Vec<Node*> nodes_;
346 Vec<int32_t> free_nodes_; // Indices for unused entries in nodes_
347 PointerMap ptrmap_;
350 Vec<int32_t> deltaf_; // Results of forward DFS
351 Vec<int32_t> deltab_; // Results of backward DFS
352 Vec<int32_t> list_; // All nodes to reprocess
353 Vec<int32_t> merged_; // Rank values to assign to list_ entries
354 Vec<int32_t> stack_; // Emulates recursion stack for depth-first searches
356 Rep() : ptrmap_(&nodes_) {} in Rep() function
/external/webrtc/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.cc344 struct GraphCycles::Rep { struct in absl::synchronization_internal::GraphCycles
345 Vec<Node*> nodes_;
346 Vec<int32_t> free_nodes_; // Indices for unused entries in nodes_
347 PointerMap ptrmap_;
350 Vec<int32_t> deltaf_; // Results of forward DFS
351 Vec<int32_t> deltab_; // Results of backward DFS
352 Vec<int32_t> list_; // All nodes to reprocess
353 Vec<int32_t> merged_; // Rank values to assign to list_ entries
354 Vec<int32_t> stack_; // Emulates recursion stack for depth-first searches
356 Rep() : ptrmap_(&nodes_) {} in Rep() function
/external/openscreen/third_party/abseil/src/absl/synchronization/internal/
Dgraphcycles.cc345 struct GraphCycles::Rep { struct in absl::synchronization_internal::GraphCycles
346 Vec<Node*> nodes_;
347 Vec<int32_t> free_nodes_; // Indices for unused entries in nodes_
348 PointerMap ptrmap_;
351 Vec<int32_t> deltaf_; // Results of forward DFS
352 Vec<int32_t> deltab_; // Results of backward DFS
353 Vec<int32_t> list_; // All nodes to reprocess
354 Vec<int32_t> merged_; // Rank values to assign to list_ entries
355 Vec<int32_t> stack_; // Emulates recursion stack for depth-first searches
357 Rep() : ptrmap_(&nodes_) {} in Rep() argument
/external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.cc344 struct GraphCycles::Rep { struct in absl::synchronization_internal::GraphCycles
345 Vec<Node*> nodes_;
346 Vec<int32_t> free_nodes_; // Indices for unused entries in nodes_
347 PointerMap ptrmap_;
350 Vec<int32_t> deltaf_; // Results of forward DFS
351 Vec<int32_t> deltab_; // Results of backward DFS
352 Vec<int32_t> list_; // All nodes to reprocess
353 Vec<int32_t> merged_; // Rank values to assign to list_ entries
354 Vec<int32_t> stack_; // Emulates recursion stack for depth-first searches
356 Rep() : ptrmap_(&nodes_) {} in Rep() function
/external/libtextclassifier/abseil-cpp/absl/synchronization/internal/
Dgraphcycles.cc344 struct GraphCycles::Rep { struct in absl::synchronization_internal::GraphCycles
345 Vec<Node*> nodes_;
346 Vec<int32_t> free_nodes_; // Indices for unused entries in nodes_
347 PointerMap ptrmap_;
350 Vec<int32_t> deltaf_; // Results of forward DFS
351 Vec<int32_t> deltab_; // Results of backward DFS
352 Vec<int32_t> list_; // All nodes to reprocess
353 Vec<int32_t> merged_; // Rank values to assign to list_ entries
354 Vec<int32_t> stack_; // Emulates recursion stack for depth-first searches
356 Rep() : ptrmap_(&nodes_) {} in Rep() argument
/external/tensorflow/tensorflow/compiler/xla/service/graphcycles/
Dgraphcycles.cc68 struct GraphCycles::Rep { struct in tensorflow::GraphCycles
69 Vec<Node*> nodes_;
70 Vec<int32> free_nodes_; // Indices for unused entries in nodes_
73 Vec<int32> deltaf_; // Results of forward DFS
74 Vec<int32> deltab_; // Results of backward DFS
75 Vec<int32> list_; // All nodes to reprocess
76 Vec<int32> merged_; // Rank values to assign to list_ entries
77 Vec<int32> stack_; // Emulates recursion stack when doing depth first search
/external/tensorflow/tensorflow/python/grappler/
Ditem_wrapper.cc83 struct Rep { struct in ColocationGroups
85 Rep* parent;
88 int rank;
90 std::string value;
/external/protobuf/src/google/protobuf/
Drepeated_field.h286 struct Rep { struct
290 // We can not use sizeof(Rep) - sizeof(Element) due to the trailing padding on argument

1234