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

com.mysql.cj.util.SequentialIdLease Maven / Gradle / Ivy

The newest version!
/*
 * Copyright (c) 2019, 2020, Oracle and/or its affiliates.
 *
 * This program is free software; you can redistribute it and/or modify it under
 * the terms of the GNU General Public License, version 2.0, as published by the
 * Free Software Foundation.
 *
 * This program is also distributed with certain software (including but not
 * limited to OpenSSL) that is licensed under separate terms, as designated in a
 * particular file or component or in included license documentation. The
 * authors of MySQL hereby grant you an additional permission to link the
 * program and your derivative works with the separately licensed software that
 * they have included with MySQL.
 *
 * Without limiting anything contained in the foregoing, this file, which is
 * part of MySQL Connector/J, is also subject to the Universal FOSS Exception,
 * version 1.0, a copy of which can be found at
 * http://oss.oracle.com/licenses/universal-foss-exception.
 *
 * This program is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
 * FOR A PARTICULAR PURPOSE. See the GNU General Public License, version 2.0,
 * for more details.
 *
 * You should have received a copy of the GNU General Public License along with
 * this program; if not, write to the Free Software Foundation, Inc.,
 * 51 Franklin St, Fifth Floor, Boston, MA 02110-1301  USA
 */

package com.mysql.cj.util;

import java.util.Iterator;
import java.util.Set;
import java.util.TreeSet;

public class SequentialIdLease {
    private Set sequentialIdsLease = new TreeSet<>();

    /**
     * Finds and allocates the first available sequential id.
     * 
     * @return the next free sequential id.
     */
    public int allocateSequentialId() {
        int nextSequentialId = 0;
        for (Iterator it = this.sequentialIdsLease.iterator(); it.hasNext() && nextSequentialId + 1 == it.next(); nextSequentialId++) {
            // Find the first free sequential id.
        }
        this.sequentialIdsLease.add(++nextSequentialId);
        return nextSequentialId;
    }

    /**
     * Frees the given sequential id so that it can be reused.
     * 
     * @param sequentialId
     *            the sequential id to release
     */
    public void releaseSequentialId(int sequentialId) {
        this.sequentialIdsLease.remove(sequentialId);
    }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy