All Downloads are FREE. Search and download functionalities are using the official Maven repository.

io.questdb.std.AbstractLowerCaseCharSequenceHashMap Maven / Gradle / Ivy

/*******************************************************************************
 *     ___                  _   ____  ____
 *    / _ \ _   _  ___  ___| |_|  _ \| __ )
 *   | | | | | | |/ _ \/ __| __| | | |  _ \
 *   | |_| | |_| |  __/\__ \ |_| |_| | |_) |
 *    \__\_\\__,_|\___||___/\__|____/|____/
 *
 *  Copyright (c) 2014-2019 Appsicle
 *  Copyright (c) 2019-2024 QuestDB
 *
 *  Licensed under the Apache License, Version 2.0 (the "License");
 *  you may not use this file except in compliance with the License.
 *  You may obtain a copy of the License at
 *
 *  http://www.apache.org/licenses/LICENSE-2.0
 *
 *  Unless required by applicable law or agreed to in writing, software
 *  distributed under the License is distributed on an "AS IS" BASIS,
 *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *  See the License for the specific language governing permissions and
 *  limitations under the License.
 *
 ******************************************************************************/

package io.questdb.std;

abstract class AbstractLowerCaseCharSequenceHashMap extends AbstractLowerCaseCharSequenceHashSet {
    private final ObjList list;

    protected AbstractLowerCaseCharSequenceHashMap(int initialCapacity, double loadFactor) {
        super(initialCapacity, loadFactor);
        list = new ObjList<>(capacity);
    }

    @Override
    public void clear() {
        super.clear();
        list.clear();
    }

    public boolean contains(CharSequence key) {
        return keyIndex(key) < 0;
    }

    public boolean contains(CharSequence key, int lo, int hi) {
        return keyIndex(key, lo, hi) < 0;
    }

    public ObjList keys() {
        return list;
    }

    @Override
    public void removeAt(int index) {
        if (index < 0) {
            final CharSequence key = keys[-index - 1];
            super.removeAt(index);
            list.remove(key);
        }
    }

    protected void putAt0(int index, CharSequence key) {
        keys[index] = key;
        list.add(key);
        if (--free == 0) {
            rehash();
        }
    }

    protected abstract void rehash();
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy