mirror of
https://github.com/sol1/rustguac.git
synced 2026-09-10 17:47:13 +00:00
Dave Kempe
87 lines
2.4 KiB
JavaScript
87 lines
2.4 KiB
JavaScript
/*
|
|
* Licensed to the Apache Software Foundation (ASF) under one
|
|
* or more contributor license agreements. See the NOTICE file
|
|
* distributed with this work for additional information
|
|
* regarding copyright ownership. The ASF licenses this file
|
|
* to you 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.
|
|
*/
|
|
|
|
var Guacamole = Guacamole || {};
|
|
|
|
/**
|
|
* Integer pool which returns consistently increasing integers while integers
|
|
* are in use, and previously-used integers when possible.
|
|
*
|
|
* When a minimum pool size is specified, new integers are preferred over reused
|
|
* integers until the minimum size is reached.
|
|
*
|
|
* @constructor
|
|
* @param {number} [min_size]
|
|
* The minimum number of integers which must have been returned before
|
|
* previously-used and freed integers are allowed to be returned.
|
|
*/
|
|
Guacamole.IntegerPool = function(min_size) {
|
|
|
|
/**
|
|
* Reference to this integer pool.
|
|
*
|
|
* @private
|
|
*/
|
|
var guac_pool = this;
|
|
|
|
/**
|
|
* Array of available integers.
|
|
*
|
|
* @private
|
|
* @type {!number[]}
|
|
*/
|
|
var pool = [];
|
|
|
|
/**
|
|
* The next integer to return if no more integers remain.
|
|
*
|
|
* @type {!number}
|
|
*/
|
|
this.next_int = 0;
|
|
|
|
/**
|
|
* Returns the next available integer in the pool. If possible, a previously
|
|
* used integer will be returned.
|
|
*
|
|
* @return {!number}
|
|
* The next available integer.
|
|
*/
|
|
this.next = function() {
|
|
|
|
// If free'd integers exist and we've allocated the minimum, reuse it
|
|
if (pool.length > 0 && (!min_size || guac_pool.next_int >= min_size))
|
|
return pool.shift();
|
|
|
|
// Otherwise, return a new integer
|
|
return guac_pool.next_int++;
|
|
|
|
};
|
|
|
|
/**
|
|
* Frees the given integer, allowing it to be reused.
|
|
*
|
|
* @param {!number} integer
|
|
* The integer to free.
|
|
*/
|
|
this.free = function(integer) {
|
|
pool.push(integer);
|
|
};
|
|
|
|
};
|