Here you can find the source of nextClearBitModulo(int index, int poolSize, BitSet bitSet)
Parameter | Description |
---|---|
index | starting point |
poolSize | the bit set size |
bitSet | bitset to search |
static private int nextClearBitModulo(int index, int poolSize, BitSet bitSet)
//package com.java2s; /*// w ww. j a va 2s .co m * 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. */ import java.util.BitSet; public class Main { /** * Returns index of next clear (false) bit, starting from and including * index. If all bits from index to the end are set (true), search from the * beginning. Return -1 if all bits are set (true). * * @param index starting point * @param poolSize the bit set size * @param bitSet bitset to search * @return index of next clear bit, starting in index */ static private int nextClearBitModulo(int index, int poolSize, BitSet bitSet) { int indexToSet = bitSet.nextClearBit(index); if (indexToSet == poolSize && index != 0) { indexToSet = bitSet.nextClearBit(0); } /* means that all bits are already set, so we return -1 */ if (indexToSet == poolSize) { return -1; } return indexToSet; } }