/*
* Created on 29-Apr-2005
* Created by Paul Gardner
* Copyright (C) 2005, 2006 Aelitis, All Rights Reserved.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
* 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 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
* AELITIS, SAS au capital de 46,603.30 euros
* 8 Allee Lenotre, La Grille Royale, 78600 Le Mesnil le Roi, France.
*
*/
package com.aelitis.azureus.core.util.bloom;
import java.util.Map;
public interface
BloomFilter
{
public int
add(
byte[] value );
public int
remove(
byte[] value );
public boolean
contains(
byte[] value );
public int
count(
byte[] value );
/**
* Returns number of unique entries
* @return
*/
public int
getEntryCount();
/**
* Returns overall capacity
* @return
*/
public void
clear();
public long
getStartTimeMono();
public int
getSize();
public BloomFilter
getReplica();
public Map<String,Object>
serialiseToMap();
public String
getString();
}