com.mchange.util.impl.LinkedListIntChecklistImpl Maven / Gradle / Ivy
/*
* 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.*;
/* This code modified from class swaldman.util.IntChecklist */
/* which was originally written at the Media Lab */
public class LinkedListIntChecklistImpl implements IntChecklist
{
private final LLICIRecord headRecord = new LLICIRecord();
private int num_checked = 0;
public void check(int num)
{
LLICIRecord finger = findPrevious(num);
if (finger.next == null || finger.next.contained != num)
{
LLICIRecord newRec = new LLICIRecord();
newRec.next = finger.next;
newRec.contained = num;
finger.next = newRec;
++num_checked;
}
}
public void uncheck(int num)
{
LLICIRecord finger = findPrevious(num);
if (finger.next != null && finger.next.contained == num)
{
finger.next = finger.next.next;
--num_checked;
}
}
public boolean isChecked(int num)
{
LLICIRecord finger = findPrevious(num);
return (finger.next != null && finger.next.contained == num);
}
public void clear()
{
headRecord.next = null;
num_checked = 0;
}
public int countChecked()
{return num_checked;}
public int[] getChecked()
{
LLICIRecord finger = headRecord;
int[] out = new int[num_checked];
int i = 0;
while (finger.next != null)
{
out[i++] = finger.next.contained;
finger = finger.next;
}
return out;
}
public IntEnumeration checked()
{
return new IntEnumerationHelperBase()
{
LLICIRecord finger = headRecord;
public int nextInt()
{
try
{
finger = finger.next;
return finger.contained;
}
catch (NullPointerException e)
{throw new java.util.NoSuchElementException();}
}
public boolean hasMoreInts()
{return (finger.next != null);}
};
}
private LLICIRecord findPrevious(int num)
{
LLICIRecord finger = headRecord;
while (finger.next != null && finger.next.contained < num)
finger = finger.next;
return finger;
}
}
class LLICIRecord
{
int contained = 0;
LLICIRecord next = null;
}