Class MpscIntrusiveLinkedQueue

    • Field Detail

      • p01

        long p01
      • p02

        long p02
      • p03

        long p03
      • p04

        long p04
      • p05

        long p05
      • p06

        long p06
      • p07

        long p07
      • p10

        long p10
      • p11

        long p11
      • p12

        long p12
      • p13

        long p13
      • p14

        long p14
      • p15

        long p15
      • p16

        long p16
      • p17

        long p17
    • Constructor Detail

      • MpscIntrusiveLinkedQueue

        public MpscIntrusiveLinkedQueue()
    • Method Detail

      • offer

        public boolean offer​(Node node)
      • poll

        public Node poll()
      • peek

        public Node peek()
      • clear

        public void clear()
      • size

        public int size()
        This is an O(n) operation as we run through all the nodes and count them.
        The accuracy of the value returned by this method is subject to races with producer/consumer threads. In particular when racing with the consumer thread this method may under estimate the size.
        Note that passing nodes between queues, or concurrent requeuing of nodes can cause this method to return strange values.
      • isEmpty

        public boolean isEmpty()