netty Architecture Docs
Home / Function/ pollCeilingEntry() — netty Function Reference

pollCeilingEntry() — netty Function Reference

Architecture documentation for the pollCeilingEntry() function in ConcurrentSkipListIntObjMultimap.java from the netty codebase.

Function java CommonUtil Concurrent calls 2

Entity Profile

Dependency Diagram

graph TD
  0516e48d_e917_da11_8922_79ca766dc67f["pollCeilingEntry()"]
  d9a8da36_aab9_ab33_dc67_870b34dcd270["ConcurrentSkipListIntObjMultimap"]
  0516e48d_e917_da11_8922_79ca766dc67f -->|defined in| d9a8da36_aab9_ab33_dc67_870b34dcd270
  73583e8b_7c0e_6565_1f6c_c76bfaba5388["findNear()"]
  0516e48d_e917_da11_8922_79ca766dc67f -->|calls| 73583e8b_7c0e_6565_1f6c_c76bfaba5388
  7a298538_fab1_9d5c_bb2a_55a4157a788f["remove()"]
  0516e48d_e917_da11_8922_79ca766dc67f -->|calls| 7a298538_fab1_9d5c_bb2a_55a4157a788f
  style 0516e48d_e917_da11_8922_79ca766dc67f fill:#6366f1,stroke:#818cf8,color:#fff

Relationship Graph

Source Code

common/src/main/java/io/netty/util/concurrent/ConcurrentSkipListIntObjMultimap.java lines 1442–1454

    public IntEntry<V> pollCeilingEntry(int key) {
        // TODO optimize this
        Node<V> node;
        V val;
        do {
            node = findNear(key, GT | EQ);
            if (node == null) {
                return null;
            }
            val = node.val;
        } while (val == null || !remove(node.key, val));
        return new IntEntry<>(node.key, val);
    }

Domain

Subdomains

Defined In

Calls

Source

Frequently Asked Questions

What does pollCeilingEntry() do?
pollCeilingEntry() is a function in the netty codebase, defined in common/src/main/java/io/netty/util/concurrent/ConcurrentSkipListIntObjMultimap.java.
Where is pollCeilingEntry() defined?
pollCeilingEntry() is defined in common/src/main/java/io/netty/util/concurrent/ConcurrentSkipListIntObjMultimap.java at line 1442.
What does pollCeilingEntry() call?
pollCeilingEntry() calls 2 function(s): findNear, remove.

Analyze Your Own Codebase

Get architecture documentation, dependency graphs, and domain analysis for your codebase in minutes.

Try Supermodel Free