Java Code Examples for io.netty.util.AsciiString#hashCode()

/**
 * Add the header field to the dynamic table. Entries are evicted from the dynamic table until
 * the size of the table and the new header field is less than the table's maxHeaderTableSize. If the size
 * of the new entry is larger than the table's maxHeaderTableSize, the dynamic table will be cleared.
 */
private void add(CharSequence name, CharSequence value, long headerSize) {
    // Clear the table if the header field size is larger than the maxHeaderTableSize.
    if (headerSize > maxHeaderTableSize) {
        clear();
        return;
    }

    // Evict oldest entries until we have enough maxHeaderTableSize.
    while (maxHeaderTableSize - size < headerSize) {
        remove();
    }

    int h = AsciiString.hashCode(name);
    int i = index(h);
    HeaderEntry old = headerFields[i];
    HeaderEntry e = new HeaderEntry(h, name, value, head.before.index - 1, old);
    headerFields[i] = e;
    e.addBefore(head);
    size += headerSize;
}
 

private void calculateNext() {
    for (; i < current.length; i += 2) {
        AsciiString roName = current[i];
        if (roName.hashCode() == nameHash && roName.contentEqualsIgnoreCase(name)) {
            next = current[i + 1];
            i += 2;
            return;
        }
    }
    if (i >= current.length && current == pseudoHeaders) {
        i = 0;
        current = otherHeaders;
        calculateNext();
    } else {
        next = null;
    }
}
 

private CharSequence get0(CharSequence name) {
    final int nameHash = AsciiString.hashCode(name);
    for (int i = 0; i < nameValuePairs.length; i += 2) {
        CharSequence roName = nameValuePairs[i];
        if (AsciiString.hashCode(roName) == nameHash && contentEqualsIgnoreCase(roName, name)) {
            return nameValuePairs[i + 1];
        }
    }
    return null;
}
 

@Override
public List<String> getAll(String name) {
    if (isEmpty()) {
        return Collections.emptyList();
    }
    final int nameHash = AsciiString.hashCode(name);
    List<String> values = new ArrayList<String>(4);
    for (int i = 0; i < nameValuePairs.length; i += 2) {
        CharSequence roName = nameValuePairs[i];
        if (AsciiString.hashCode(roName) == nameHash && contentEqualsIgnoreCase(roName, name)) {
            values.add(nameValuePairs[i + 1].toString());
        }
    }
    return values;
}
 

private int findNextValue() {
    for (int i = nextNameIndex; i < nameValuePairs.length; i += 2) {
        final CharSequence roName = nameValuePairs[i];
        if (nameHash == AsciiString.hashCode(roName) && contentEqualsIgnoreCase(name, roName)) {
            return i;
        }
    }
    return -1;
}
 

private int findNextValue() {
    for (int i = nextNameIndex; i < nameValuePairs.length; i += 2) {
        final CharSequence roName = nameValuePairs[i];
        if (nameHash == AsciiString.hashCode(roName) && contentEqualsIgnoreCase(name, roName)) {
            return i;
        }
    }
    return -1;
}
 

/**
 * Returns the header entry with the lowest index value for the header field. Returns null if
 * header field is not in the dynamic table.
 */
private HeaderEntry getEntry(CharSequence name, CharSequence value) {
    if (length() == 0 || name == null || value == null) {
        return null;
    }
    int h = AsciiString.hashCode(name);
    int i = index(h);
    for (HeaderEntry e = headerFields[i]; e != null; e = e.next) {
        // To avoid short circuit behavior a bitwise operator is used instead of a boolean operator.
        if (e.hash == h && (equalsConstantTime(name, e.name) & equalsConstantTime(value, e.value)) != 0) {
            return e;
        }
    }
    return null;
}
 

/**
 * Returns the lowest index value for the header field name in the dynamic table. Returns -1 if
 * the header field name is not in the dynamic table.
 */
private int getIndex(CharSequence name) {
    if (length() == 0 || name == null) {
        return -1;
    }
    int h = AsciiString.hashCode(name);
    int i = index(h);
    for (HeaderEntry e = headerFields[i]; e != null; e = e.next) {
        if (e.hash == h && equalsConstantTime(name, e.name) != 0) {
            return getIndex(e.index);
        }
    }
    return -1;
}
 

@Override
public boolean contains(CharSequence name, CharSequence value, boolean caseInsensitive) {
    final int nameHash = AsciiString.hashCode(name);
    final HashingStrategy<CharSequence> strategy =
            caseInsensitive ? CASE_INSENSITIVE_HASHER : CASE_SENSITIVE_HASHER;
    final int valueHash = strategy.hashCode(value);

    return contains(name, nameHash, value, valueHash, strategy, otherHeaders)
            || contains(name, nameHash, value, valueHash, strategy, pseudoHeaders);
}
 

private static boolean contains(CharSequence name, int nameHash, CharSequence value, int valueHash,
                                HashingStrategy<CharSequence> hashingStrategy, AsciiString[] headers) {
    final int headersEnd = headers.length - 1;
    for (int i = 0; i < headersEnd; i += 2) {
        AsciiString roName = headers[i];
        AsciiString roValue = headers[i + 1];
        if (roName.hashCode() == nameHash && roValue.hashCode() == valueHash &&
            roName.contentEqualsIgnoreCase(name) && hashingStrategy.equals(roValue, value)) {
            return true;
        }
    }
    return false;
}
 

ReadOnlyStringValueIterator(CharSequence name) {
    this.name = name;
    nameHash = AsciiString.hashCode(name);
    nextNameIndex = findNextValue();
}
 

ReadOnlyValueIterator(CharSequence name) {
    this.name = name;
    nameHash = AsciiString.hashCode(name);
    nextNameIndex = findNextValue();
}
 

ReadOnlyValueIterator(CharSequence name) {
    nameHash = AsciiString.hashCode(name);
    this.name = name;
    calculateNext();
}
 

@Override
public int hashCode(AsciiString o) {
    return o.hashCode();
}
 

@Override
int hashName(CharSequence name) {
    return AsciiString.hashCode(name);
}