Package io.netty.util

Class DefaultAttributeMap

java.lang.Object

io.netty.util.DefaultAttributeMap

All Implemented Interfaces:

AttributeMap

Direct Known Subclasses:

AbstractChannel, AbstractHttp2StreamChannel

public class DefaultAttributeMap
extends java.lang.Object
implements AttributeMap

Default AttributeMap implementation which not exibit any blocking behaviour on attribute lookup while using a copy-on-write approach on the modify path.
Attributes lookup and remove exibit O(logn) time worst-case complexity, hence attribute::set(null) is to be preferred to remove.

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
private static class	DefaultAttributeMap.DefaultAttribute<T>

Field Summary

Fields

Modifier and Type	Field	Description
private DefaultAttributeMap.DefaultAttribute[]	attributes
private static java.util.concurrent.atomic.AtomicReferenceFieldUpdater<DefaultAttributeMap,DefaultAttributeMap.DefaultAttribute[]>	ATTRIBUTES_UPDATER
private static DefaultAttributeMap.DefaultAttribute[]	EMPTY_ATTRIBUTES

Constructor Summary

Constructors

Constructor	Description
DefaultAttributeMap()

Method Summary

Modifier and Type	Method	Description
<T> Attribute<T>	attr(AttributeKey<T> key)	Get the Attribute for the given AttributeKey.
<T> boolean	hasAttr(AttributeKey<T> key)	Returns true if and only if the given Attribute exists in this AttributeMap.
private static void	orderedCopyOnInsert(DefaultAttributeMap.DefaultAttribute[] sortedSrc, int srcLength, DefaultAttributeMap.DefaultAttribute[] copy, DefaultAttributeMap.DefaultAttribute toInsert)
private <T> void	removeAttributeIfMatch(AttributeKey<T> key, DefaultAttributeMap.DefaultAttribute<T> value)
private static int	searchAttributeByKey(DefaultAttributeMap.DefaultAttribute[] sortedAttributes, AttributeKey<?> key)	Similarly to Arrays::binarySearch it perform a binary search optimized for this use case, in order to save polymorphic calls (on comparator side) and unnecessary class checks.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

ATTRIBUTES_UPDATER

private static final java.util.concurrent.atomic.AtomicReferenceFieldUpdater<DefaultAttributeMap,DefaultAttributeMap.DefaultAttribute[]> ATTRIBUTES_UPDATER

EMPTY_ATTRIBUTES

private static final DefaultAttributeMap.DefaultAttribute[] EMPTY_ATTRIBUTES

attributes

private volatile DefaultAttributeMap.DefaultAttribute[] attributes

Constructor Detail

DefaultAttributeMap

public DefaultAttributeMap()

Method Detail

searchAttributeByKey

private static int searchAttributeByKey(DefaultAttributeMap.DefaultAttribute[] sortedAttributes,
                                        AttributeKey<?> key)

Similarly to Arrays::binarySearch it perform a binary search optimized for this use case, in order to save polymorphic calls (on comparator side) and unnecessary class checks.

orderedCopyOnInsert

private static void orderedCopyOnInsert(DefaultAttributeMap.DefaultAttribute[] sortedSrc,
                                        int srcLength,
                                        DefaultAttributeMap.DefaultAttribute[] copy,
                                        DefaultAttributeMap.DefaultAttribute toInsert)

attr

public <T> Attribute<T> attr(AttributeKey<T> key)

Description copied from interface: AttributeMap

Get the Attribute for the given AttributeKey. This method will never return null, but may return an Attribute which does not have a value set yet.

Specified by:

attr in interface AttributeMap

hasAttr

public <T> boolean hasAttr(AttributeKey<T> key)

Description copied from interface: AttributeMap

Returns true if and only if the given Attribute exists in this AttributeMap.

Specified by:

hasAttr in interface AttributeMap

removeAttributeIfMatch

private <T> void removeAttributeIfMatch(AttributeKey<T> key,
                                        DefaultAttributeMap.DefaultAttribute<T> value)