// -*- c++ -*- /* * Jakelib2 - General purpose C++ library * Copyright (C) 2001 Florian Wolff (florian@donuz.de) * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2.1 of the License, or (at your option) any later version. * * This library 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 * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA * * $Id: AbstractSet.jlc,v 1.5 2003/09/27 08:10:29 florian Exp $ */ #include "jakelib2.h" #include "jakelib2/util/AbstractSet.h" #include "jakelib2/util/Iterator.h" using namespace jakelib::lang; using namespace jakelib::util; JAKELIB_IMPLEMENT_CLASS_1("jakelib.util.AbstractSet", AbstractSet, AbstractCollection, Set); /*****************************************************************************\ * AbstractSet | *****************************************************************************/ AbstractSet::AbstractSet() { } /*****************************************************************************\ * equals | *****************************************************************************/ jboolean AbstractSet::equals(jakelib::lang::Object* o) { return (o == this || (o->instanceOf(`"jakelib.util.Set"`) && ((Set*) o)->size() == size() && containsAll((Collection*) o))); } /*****************************************************************************\ * hashCode | *****************************************************************************/ jint AbstractSet::hashCode() { Iterator* itr = iterator(); int hash = 0; int pos = size(); while (--pos >= 0) hash += AbstractCollection::hashCode(itr->next()); return hash; } /*****************************************************************************\ * removeAll | *****************************************************************************/ jboolean AbstractSet::removeAll(jakelib::util::Collection* c) { int oldsize = size(); int count = c->size(); Iterator* i; if (oldsize < count) { for (i = iterator(), count = oldsize; count > 0; count--) if (c->contains(i->next())) i->remove(); } else for (i = c->iterator(); count > 0; count--) remove(i->next()); return oldsize != size(); }