Examples of edu.emory.mathcs.backport.java.util.concurrent.ConcurrentLinkedQueue$Node

Package edu.emory.mathcs.backport.java.util.concurrent

Examples of edu.emory.mathcs.backport.java.util.concurrent.ConcurrentLinkedQueue$Node

lupos.sparql1_1.Node
s.rochester.edu/u/michael/PODC96.html"> Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms by Maged M. Michael and Michael L. Scott.
Beware that, unlike in most collections, the size method is NOT a constant-time operation. Because of the asynchronous nature of these queues, determining the current number of elements requires a traversal of the elements.
This class and its iterator implement all of the optional methods of the {@link Collection} and {@link Iterator} interfaces.
This class is a member of the Java Collections Framework. @since 1.5 @author Doug Lea

            if ( worker != null && worker.isAlive() )
                throw new RuntimeException( "Stat collecting already started" );
    
            // add all current sessions
    
            polledSessions = new ConcurrentLinkedQueue();
    
            for ( Iterator iter = service.getManagedServiceAddresses().iterator(); iter.hasNext(); )
            {
                SocketAddress element = ( SocketAddress ) iter.next();

View Full Code Here

     * judge session timeout.
     */
    private ElapsedTime lastSelectTime;


    public DefaultReactor() {
        registerColl = new ConcurrentLinkedQueue();
        deregisterColl = new ConcurrentLinkedQueue();
        interestColl = new ConcurrentLinkedQueue();
    }

View Full Code Here

            if (worker != null && worker.isAlive())
                throw new RuntimeException("Stat collecting already started");


            // add all current sessions


            polledSessions = new ConcurrentLinkedQueue();


            for (Iterator iter = service.getManagedServiceAddresses()
                    .iterator(); iter.hasNext();) {
                SocketAddress element = (SocketAddress) iter.next();

View Full Code Here

            if (worker != null && worker.isAlive())
                throw new RuntimeException("Stat collecting already started");


            // add all current sessions


            polledSessions = new ConcurrentLinkedQueue();


            for (Iterator iter = service.getManagedServiceAddresses()
                    .iterator(); iter.hasNext();) {
                SocketAddress element = (SocketAddress) iter.next();

View Full Code Here

            if ( worker != null && worker.isAlive() )
                throw new RuntimeException( "Stat collecting already started" );
    
            // add all current sessions
    
            polledSessions = new ConcurrentLinkedQueue();
    
            for ( Iterator iter = service.getManagedServiceAddresses().iterator(); iter.hasNext(); )
            {
                SocketAddress element = ( SocketAddress ) iter.next();

View Full Code Here

            if (worker != null && worker.isAlive())
                throw new RuntimeException("Stat collecting already started");


            // add all current sessions


            polledSessions = new ConcurrentLinkedQueue();


            for (Iterator iter = service.getManagedServiceAddresses()
                    .iterator(); iter.hasNext();) {
                SocketAddress element = (SocketAddress) iter.next();

View Full Code Here

    // create list for SortContainers...
    final LinkedList<SortContainer> scl = new LinkedList<SortContainer>();


    // walk through children...
    for (int i = 0; i < node.jjtGetNumChildren(); ++i) {
      Node n = node.jjtGetChild(i); // get current child


      boolean desc = false; // set order ASC as default


      // current node is Order node...
      if (n instanceof ASTAscOrder || n instanceof ASTDescOrder) {
        if (n instanceof ASTDescOrder) // reset order value to DESC...
          desc = true;


        i++; // increase counter to get next child (which is sort
        // condition)
      }


      n = node.jjtGetChild(i); // get next child (which is sort condition)


      // parse node with the filter...
      final SPARQLParserVisitorImplementationDumper filterDumper = new SPARQLParserVisitorImplementationDumper();
      final String sortString = n.accept(filterDumper);


      try {
        final SortContainer sc = new SortContainer(this.prefix, desc,
            sortString); // create SortContainer

View Full Code Here

  @SuppressWarnings("unchecked")
  public Object visit(final ASTTripleSet node, final Object data) {
    final Item[] item = { null, null, null };


    for (int i = 0; i < 3; i++) {
      final Node n = node.jjtGetChild(i);
      item[i] = lupos.sparql1_1.operatorgraph.SPARQLCoreParserVisitorImplementation.getItem(n);
    }


    final HashMap<Item, QueryRDFTerm> rdfHash = (HashMap<Item, QueryRDFTerm>) data;

View Full Code Here


    // if AST exists...
    if (debugViewerCreator!=null && debugViewerCreator instanceof SPARQLDebugViewerCreator
        && ((SPARQLDebugViewerCreator) debugViewerCreator).getAST() != null) {


      final Node ast = ((SPARQLDebugViewerCreator) debugViewerCreator).getAST(); // get AST


      // walk through first level children of AST...
      for (int i = 0; i < ast.jjtGetNumChildren(); ++i) {
        final Node child = ast.jjtGetChild(i); // get current child


        if (child instanceof ASTSelectQuery) {
          final ASTSelectQuery selectChild = (ASTSelectQuery) child;


          // SELECT is not the wildcard *...
          if (!selectChild.isSelectAll()) {
            // walk through select children...
            for (int j = 0; j < selectChild.jjtGetNumChildren(); ++j) {
              final Node selectChildChild = selectChild
              .jjtGetChild(j);


              // child of select is variable...
              if (selectChildChild instanceof ASTVar) {
                final ASTVar var = (ASTVar) selectChildChild;


                // add name of variable to order...
                if (!resultOrder.contains(var.getName())) {
                  resultOrder.add(var.getName());
                }
              } else if (selectChildChild instanceof ASTAs) {
                for (int j1 = 0; j1 < selectChildChild
                .jjtGetNumChildren(); ++j1) {
                  final Node selectChildChildChild = selectChildChild
                  .jjtGetChild(j1);
                  if (selectChildChildChild instanceof ASTVar) {
                    final ASTVar var = (ASTVar) selectChildChildChild;


                    // add name of variable to order...

View Full Code Here

        ret += "\n";
        final String orderByClause = " ORDER BY "
          + toBeSorted.toString() + "\n";
        boolean ORDERBYADDED = false;
        while (i < node.jjtGetNumChildren()) {
          final Node child = node.jjtGetChild(i);
          if (!ORDERBYADDED
              && (child instanceof ASTOrderConditions
                  || child instanceof ASTLimit || child instanceof ASTOffset)) {
            ORDERBYADDED = true;
            ret += orderByClause;

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of edu.emory.mathcs.backport.java.util.concurrent.ConcurrentLinkedQueue$Node

ca.eandb.jmist.framework.color.Color

ca.eandb.jmist.math.Point2

ca.eandb.jmist.math.Point3

ca.eandb.jmist.math.Ray3

ca.eandb.jmist.math.SphericalCoordinates

ca.eandb.jmist.math.Vector3

cc.mallet.types.FeatureVector

cc.mallet.types.Instance

cc.mallet.types.InstanceList

com.badlogic.gdx.math.Rectangle

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.