Lines Matching refs:ShapeIndex
88 // duplicated. That is, every distinct ShapeIndex in the Shape has a unique T
140 const T& element(const ShapeIndex& index) const;
141 T* mutable_element(const ShapeIndex& index);
160 bool IsLeaf(const ShapeIndex& index) const {
165 // std::pair<ShapeIndex, T&>
249 // Fn : A callable of type void(const ShapeIndex& index, const T& data)
259 // void (const ShapeIndex& index, T* data).
271 // Copy the subtree of values from 'other' rooted at ShapeIndex
278 const ShapeIndex& source_base_index,
279 const ShapeIndex& target_base_index);
300 ShapeIndex* index);
303 ShapeIndex* index);
306 Node* Lookup(const ShapeIndex& index);
307 const Node* Lookup(const ShapeIndex& index) const;
323 // expensive. The iterator value_type is equivalent to a std::pair<ShapeIndex,
328 std::pair<ShapeIndex, T&>> {
331 typename std::conditional<is_const, std::pair<ShapeIndex, const T&>,
332 std::pair<ShapeIndex, T&>>::type;
444 ShapeIndex index;
526 const T& ShapeTree<T>::element(const ShapeIndex& index) const {
531 T* ShapeTree<T>::mutable_element(const ShapeIndex& index) {
536 internal::ShapeTreeNode<T>* ShapeTree<T>::Lookup(const ShapeIndex& index) {
548 const ShapeIndex& index) const {
556 ShapeIndex* index) {
570 ShapeIndex* index) {
584 ShapeIndex index;
591 ShapeIndex index;
598 ShapeIndex index;
600 [&func](const ShapeIndex& index, const T& data) {
611 ShapeIndex index;
613 [&func](const ShapeIndex& index, T* data) {
623 const ShapeIndex& source_base_index,
624 const ShapeIndex& target_base_index) {
629 const ShapeIndex& index, T* data) {
638 ShapeIndex source_index = source_base_index;
650 [this, &other, &equal](const ShapeIndex& index, const T& data) {
