Examples of valueIterator()


Examples of aterm.ATermAppl.valueIterator()

      /*
       * Data range is a singleton, replace variable with constant (lines 17 - 18)
       */
      if (dr.isFinite() && dr.isEnumerable() && !dr.containsAtLeast(2)) {
        final Object c = dr.valueIterator().next();
        it.remove();
        consts.add(i);
        constValues[i] = c;
        normalized[i] = TRIVIALLY_SATISFIABLE;
        continue;
View Full Code Here

Examples of com.clarkparsia.pellet.datatypes.DatatypeReasoner.valueIterator()

          if ( !dtReasoner.containsAtLeast( 2, types ) ) {
            /*
             * This literal is a variable, but given current ranges can only
             * take on a single value.  Merge with that value.
             */
            final Object value = dtReasoner.valueIterator( types ).next();
            final ATermAppl valueTerm = dtReasoner.getLiteral( value );
            Literal valueLiteral = abox.getLiteral( valueTerm );
            if (valueLiteral == null) {
              /*
               * No dependency set is used here because omitting it prevents the
View Full Code Here

Examples of com.clarkparsia.pellet.datatypes.types.real.RestrictedRealDatatype.valueIterator()

    RestrictedDatatype<Number> dr = new RestrictedRealDatatype( dt, IntegerInterval
        .allIntegers(), null, null );
    dr = dr.applyConstrainingFacet( MIN_INCLUSIVE.getName(), -250 );
    dr = dr.applyConstrainingFacet( MAX_INCLUSIVE.getName(), 350 );

    Iterator<Number> it = dr.valueIterator();
    for( int i = -250; i <= 350; i++ ) {
      assertEquals( 0, OWLRealUtils.compare( i, it.next() ) );
    }
  }
View Full Code Here

Examples of nexj.core.util.HashTab.valueIterator()

      {
         u.undo(getState(stateMap, u));
      }

      // validate state initial state to catch alter/drop steps lacking associated create steps
      for (Lookup.Iterator itr = stateMap.valueIterator(); itr.hasNext();)
      {
         ((UpgradeState)itr.next()).start();
      }

      // roll forward to the requested version
View Full Code Here

Examples of nexj.core.util.HashTab.valueIterator()

      {
         throw eh;
      }

      // validate initial state to catch alter/drop steps lacking associated create steps
      for (Lookup.Iterator itr = stateMap.valueIterator(); itr.hasNext();)
      {
         ((UpgradeState)itr.next()).start();
      }

      // validate that the overall state is still valid after every upgrade version is applied
View Full Code Here

Examples of nexj.core.util.HashTab.valueIterator()

      if (eh != null)
      {
         throw eh;
      }

      for (Lookup.Iterator itr = stateMap.valueIterator(); itr.hasNext();)
      {
         ((UpgradeState)itr.next()).end();
      }
   }
View Full Code Here

Examples of nexj.core.util.HashTab.valueIterator()

         }
      }

      MetadataCompoundValidationException e = null;

      for (Iterator/*<Argument>*/ itr = argMap.valueIterator(); itr.hasNext();)
      {
         if (e == null)
         {
            e = new MetadataCompoundValidationException();
         }
View Full Code Here

Examples of nexj.core.util.HashTab2D.valueIterator()

         itr.setValue(new Pair(new Compiler().compile(m_variables,
            event.getArguments(true), body, m_posMap, m_urlMap, machine)));
         map.put(event.getRoot(), itr.getKey2(), null);
      }

      for (Lookup2D.Iterator itr = map.valueIterator(); itr.hasNext();)
      {
         itr.next();

         addDerivedFlowFunctions((Pair)itr.getKey2(), (Event)itr.getKey1(),
            (Pair)m_functionMap.get(itr.getKey1(), itr.getKey2()));
View Full Code Here

Examples of nexj.core.util.HashTab2D.valueIterator()

      // as expected. For this a modifiable RelationalSchema is required.
      addDropTable(tableMap, (RelationalSchema)schema.clone());

      List/*<Table>*/ tableList = new ArrayList/*<Table>*/();

      for (Iterator/*<List<Table>>*/ itr = tableMap.valueIterator(); itr.hasNext();)
      {
         tableList.addAll((Collection)itr.next());
      }

      Collections.sort(tableList, TABLE_COMPARATOR); // sort table array in predictable order
View Full Code Here

Examples of nexj.core.util.LinkedHashTab.valueIterator()

               childPart.resolveInheritance(baseMessageChildPart);
            }
         }

         // Add parts defined in the derived message.
         for (Iterator itr = orderedPartSet.valueIterator(); itr.hasNext(); )
         {
            addPart((MessagePart)itr.next());
         }

         // Inherit the mapping
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.