Lines Matching refs:ContractDims
143 static const int ContractDims = internal::array_size<Indices>::value;
144 static const int NumDims = LDims + RDims - 2 * ContractDims;
146 typedef array<Index, ContractDims> contract_t;
147 typedef array<Index, LDims - ContractDims> left_nocontract_t;
148 typedef array<Index, RDims - ContractDims> right_nocontract_t;
167 array<IndexPair<Index>, ContractDims> eval_op_indices;
177 for (int i = 0; i < ContractDims; i++) {
191 for (int i = 0; i < ContractDims; i++) {
192 eval_op_indices[i].first = LDims - 1 - op.indices()[ContractDims - 1 - i].second;
193 eval_op_indices[i].second = RDims - 1 - op.indices()[ContractDims - 1 - i].first;
198 // is increasing. Using O(n^2) sorting is OK since ContractDims is small
199 for (int i = 0; i < ContractDims; i++) {
200 for (int j = i + 1; j < ContractDims; j++) {
241 for (int j = 0; j < ContractDims; j++) {
269 for (int j = 0; j < ContractDims; j++) {
296 for (int i = 0; i < ContractDims; i++) {
601 static const int ContractDims = internal::array_size<Indices>::value;
603 typedef array<Index, ContractDims> contract_t;
604 typedef array<Index, LDims - ContractDims> left_nocontract_t;
605 typedef array<Index, RDims - ContractDims> right_nocontract_t;
607 static const int NumDims = LDims + RDims - 2 * ContractDims;
