1.1 --- a/src/share/vm/libadt/vectset.cpp Mon Feb 07 09:46:01 2011 -0800
1.2 +++ b/src/share/vm/libadt/vectset.cpp Mon Feb 07 10:25:39 2011 -0800
1.3 @@ -1,5 +1,5 @@
1.4 /*
1.5 - * Copyright (c) 1997, 2010, Oracle and/or its affiliates. All rights reserved.
1.6 + * Copyright (c) 1997, 2011, Oracle and/or its affiliates. All rights reserved.
1.7 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
1.8 *
1.9 * This code is free software; you can redistribute it and/or modify it
1.10 @@ -350,28 +350,11 @@
1.11 return (int)_xor;
1.12 }
1.13
1.14 -//------------------------------iterate----------------------------------------
1.15 -SetI_ *VectorSet::iterate(uint &elem) const
1.16 -{
1.17 - VSetI_ *foo = (new(ResourceObj::C_HEAP) VSetI_(this));
1.18 - elem = foo->next();
1.19 - return foo;
1.20 -}
1.21 -
1.22 //=============================================================================
1.23 -//------------------------------VSetI_-----------------------------------------
1.24 -// Initialize the innards of a VectorSet iterator
1.25 -VSetI_::VSetI_( const VectorSet *vset ) : s(vset)
1.26 -{
1.27 - i = (uint)-1L;
1.28 - j = (uint)-1L;
1.29 - mask = (unsigned)(1L<<31);
1.30 -}
1.31 -
1.32 //------------------------------next-------------------------------------------
1.33 // Find and return the next element of a vector set, or return garbage and
1.34 -// make "VSetI_::test()" fail.
1.35 -uint VSetI_::next(void)
1.36 +// make "VectorSetI::test()" fail.
1.37 +uint VectorSetI::next(void)
1.38 {
1.39 j++; // Next element in word
1.40 mask = (mask & max_jint) << 1;// Next bit in word
