Package org.jgroups.stack

Examples of org.jgroups.stack.NakReceiverWindow.removeMany()

689
690
691
692
693
694
695
696
697
698
699
        // delivery of P1, Q1, Q2, P2: FIFO (implemented by UNICAST) says messages need to be delivered only in the
        // order in which they were sent by their senders
        boolean released_processing=false;
        try {
            while(true) {
                List<Message> msgs=win.removeMany(processing, true, max_msg_batch_size); // remove my own messages
                if(msgs == null || msgs.isEmpty()) {
                    released_processing=true;
                    return;
                }
View Full Code Here
668
669
670
671
672
673
674
675
676
677
678
            win.add(2, msg());
            win.add(3, msg());
            win.add(5, msg());
            win.add(6, msg());
            System.out.println("win = " + win);
            List<Message> msgs=win.removeMany(null);
            System.out.println("msgs = " + msgs);
            assert msgs.size() == 3;

            win.add(4, msg());
            msgs=win.removeMany(null);
View Full Code Here
673
674
675
676
677
678
679
680
681
682
683
            List<Message> msgs=win.removeMany(null);
            System.out.println("msgs = " + msgs);
            assert msgs.size() == 3;

            win.add(4, msg());
            msgs=win.removeMany(null);
            System.out.println("msgs = " + msgs);
            assert msgs.size() == 3;
        }
        finally {
            timer.stop();
View Full Code Here
692
693
694
695
696
697
698
699
700
701
702
            win.add(6, msg());
            win.add(7, msg());
            win.add(9, msg());
            win.add(10, msg());
            System.out.println("win = " + win);
            List<Message> msgs=win.removeMany(null);
            System.out.println("msgs = " + msgs);
            assert msgs.size() == 3;

            win.add(8, msg());
            msgs=win.removeMany(null);
View Full Code Here
697
698
699
700
701
702
703
704
705
706
707
            List<Message> msgs=win.removeMany(null);
            System.out.println("msgs = " + msgs);
            assert msgs.size() == 3;

            win.add(8, msg());
            msgs=win.removeMany(null);
            System.out.println("msgs = " + msgs);
            assert msgs.size() == 3;
        }
        finally {
            timer.stop();
View Full Code Here
700
701
702
703
704
705
706
707
708
709
710
        // delivery of P1, Q1, Q2, P2: FIFO (implemented by UNICAST) says messages need to be delivered only in the
        // order in which they were sent by their senders
        boolean released_processing=false;
        try {
            while(true) {
                List<Message> msgs=win.removeMany(processing, true, max_msg_batch_size); // remove my own messages
                if(msgs == null || msgs.isEmpty()) {
                    released_processing=true;
                    return;
                }
View Full Code Here
611
612
613
614
615
616
617
618
619
620
621
        // We *can* deliver messages from *different* senders concurrently, e.g. reception of P1, Q1, P2, Q2 can result in
        // delivery of P1, Q1, Q2, P2: FIFO (implemented by UNICAST) says messages need to be delivered only in the
        // order in which they were sent by their senders
        try {
            while(true) {
                List<Message> msgs=win.removeMany(processing);
                if(msgs == null || msgs.isEmpty())
                    return;

                for(Message m: msgs) {
                    // discard OOB msg: it has already been delivered (http://jira.jboss.com/jira/browse/JGRP-377)
View Full Code Here
668
669
670
671
672
673
674
675
676
677
678
            win.add(2, msg());
            win.add(3, msg());
            win.add(5, msg());
            win.add(6, msg());
            System.out.println("win = " + win);
            List<Message> msgs=win.removeMany(null);
            System.out.println("msgs = " + msgs);
            assert msgs.size() == 3;

            win.add(4, msg());
            msgs=win.removeMany(null);
View Full Code Here
673
674
675
676
677
678
679
680
681
682
683
            List<Message> msgs=win.removeMany(null);
            System.out.println("msgs = " + msgs);
            assert msgs.size() == 3;

            win.add(4, msg());
            msgs=win.removeMany(null);
            System.out.println("msgs = " + msgs);
            assert msgs.size() == 3;
        }
        finally {
            timer.stop();
View Full Code Here
692
693
694
695
696
697
698
699
700
701
702
            win.add(6, msg());
            win.add(7, msg());
            win.add(9, msg());
            win.add(10, msg());
            System.out.println("win = " + win);
            List<Message> msgs=win.removeMany(null);
            System.out.println("msgs = " + msgs);
            assert msgs.size() == 3;

            win.add(8, msg());
            msgs=win.removeMany(null);
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.