Lines Matching full:dimension

86   for (int dimension{0}; dimension < rank; ++dimension) {
87 shape.emplace_back(GetExtent(base, dimension, invariantOnly_));
234 // Determines lower bound on a dimension. This can be other than 1 only
269 // last dimension of assumed-size dummy array: don't worry
270 // about handling an empty dimension
277 // If we can't prove that the dimension is nonempty,
391 const NamedEntity &base, int dimension, bool invariantOnly) {
393 dimension, nullptr, invariantOnly}(base);
397 int dimension, bool invariantOnly) {
400 dimension, &context, invariantOnly}(base));
404 const NamedEntity &base, int dimension, bool invariantOnly) {
406 dimension, nullptr, invariantOnly}(base);
410 int dimension, bool invariantOnly) {
413 dimension, &context, invariantOnly}(base));
488 const Symbol &symbol, int dimension) {
492 shape && dimension < static_cast<int>(shape->size())) {
493 if (auto &extent{shape->at(dimension)};
503 NamedEntity{symbol}, DescriptorInquiry::Field::Extent, dimension}};
507 const NamedEntity &base, int dimension, bool invariantOnly) {
508 CHECK(dimension >= 0);
515 if (semantics::IsDescriptor(symbol) && dimension < *assoc->rank()) {
517 NamedEntity{base}, DescriptorInquiry::Field::Extent, dimension}};
522 return GetAssociatedExtent(last, dimension);
529 if (dimension < static_cast<int>(shape->size())) {
530 return std::move(shape->at(dimension));
536 if (j++ == dimension) {
544 DescriptorInquiry::Field::Extent, dimension}};
556 int dimension, bool invariantOnly) {
557 return Fold(context, GetExtent(base, dimension, invariantOnly));
561 int dimension, bool invariantOnly) {
567 upper = GetUBOUND(base, dimension, invariantOnly);
571 lower = GetLBOUND(base, dimension, invariantOnly);
591 const NamedEntity &base, int dimension, bool invariantOnly) {
592 return Fold(context, GetExtent(subscript, base, dimension, invariantOnly));
614 const NamedEntity &base, int dimension, bool invariantOnly) {
618 if (dimension < rank) {
619 const auto &bound{details->shape()[dimension].ubound().GetExplicit()};
624 dimension + 1 == symbol.Rank()) {
628 GetRawLowerBound(base, dimension), GetExtent(base, dimension));
635 } else if (assoc->rank() && dimension >= *assoc->rank()) {
637 } else if (auto extent{GetAssociatedExtent(symbol, dimension)}) {
639 GetRawLowerBound(base, dimension), std::move(extent));
646 const NamedEntity &base, int dimension, bool invariantOnly) {
647 return Fold(context, GetRawUpperBound(base, dimension, invariantOnly));
670 const NamedEntity &base, int dimension, bool invariantOnly) {
674 if (dimension < rank) {
675 const semantics::ShapeSpec &shapeSpec{details->shape()[dimension]};
679 dimension + 1 == symbol.Rank()) {
681 } else if (auto lb{GetLBOUND(base, dimension, invariantOnly)}) {
683 std::move(*lb), GetExtent(base, dimension, invariantOnly));
692 if (IsDescriptor(resolved) && dimension < *assoc->rank()) {
694 DescriptorInquiry::Field::LowerBound, dimension}};
696 std::move(base), DescriptorInquiry::Field::Extent, dimension}};
699 } else if (auto extent{GetAssociatedExtent(symbol, dimension)}) {
700 if (auto lb{GetLBOUND(base, dimension, invariantOnly)}) {
709 const NamedEntity &base, int dimension, bool invariantOnly) {
710 return GetUBOUND(nullptr, base, dimension, invariantOnly);
714 int dimension, bool invariantOnly) {
715 return Fold(context, GetUBOUND(&context, base, dimension, invariantOnly));
738 const Symbol &symbol0, int dimension, bool invariantOnly) {
742 if (dimension < corank) {
743 const semantics::ShapeSpec &shapeSpec{object->coshape()[dimension]};
756 const Symbol &symbol0, int dimension, bool invariantOnly) {
760 if (dimension < corank - 1) {
761 const semantics::ShapeSpec &shapeSpec{object->coshape()[dimension]};
824 for (int dimension{0}; dimension < rank; ++dimension) {
825 auto &extent{(*exprShape)[dimension]};
827 extent = GetExtent(base, dimension);
877 int dimension{0};
881 shape.emplace_back(GetExtent(ss, base, dimension));
883 ++dimension;
899 int dimension{0};
902 shape.emplace_back(GetExtent(ss, base, dimension));
904 ++dimension;
1218 messages.Say("Dimension %1$d of %2$s has extent %3$jd, "