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

com.mchange.util.impl.HashIntChecklist Maven / Gradle / Ivy

Go to download

Enables C3P0 with Hibernate connections in the GuicedPersistence provider Requires JDK 8 and up

There is a newer version: 62
Show newest version
/*
 * Distributed as part of mchange-commons-java 0.2.11
 *
 * Copyright (C) 2015 Machinery For Change, Inc.
 *
 * Author: Steve Waldman 
 *
 * This library is free software; you can redistribute it and/or modify
 * it under the terms of EITHER:
 *
 *     1) The GNU Lesser General Public License (LGPL), version 2.1, as 
 *        published by the Free Software Foundation
 *
 * OR
 *
 *     2) The Eclipse Public License (EPL), version 1.0
 *
 * You may choose which license to accept if you wish to redistribute
 * or modify this work. You may offer derivatives of this work
 * under the license you have chosen, or you may provide the same
 * choice of license which you have been offered here.
 *
 * This software 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.
 *
 * You should have received copies of both LGPL v2.1 and EPL v1.0
 * along with this software; see the files LICENSE-EPL and LICENSE-LGPL.
 * If not, the text of these licenses are currently available at
 *
 * LGPL v2.1: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html
 *  EPL v1.0: http://www.eclipse.org/org/documents/epl-v10.php 
 * 
 */

package com.mchange.util.impl;

import com.mchange.util.IntChecklist;
import com.mchange.util.IntEnumeration;

public class HashIntChecklist implements IntChecklist
{
  private final static Object DUMMY = new Object();

  IntObjectHash ioh = new IntObjectHash();

  public void check(int num)
    {ioh.put(num, DUMMY);}

  public void uncheck(int num)
    {ioh.remove(num);}

  public boolean isChecked(int num)
    {return ioh.containsInt(num);}

  public void clear()
    {ioh.clear();}

  public int countChecked()
    {return ioh.getSize();}

  public int[] getChecked()
    {
      synchronized (ioh)
	{
	  int[] out = new int[ioh.getSize()];
	  IntEnumeration ints = ioh.ints();
	  for (int i = 0; ints.hasMoreInts(); ++i) out[i] = ints.nextInt();
	  return out;
	}
    }

  public IntEnumeration checked()
    {return ioh.ints();}

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy