Here you can find the source of deleteBits(BitSet bs, BitSet bsDelete)
| Parameter | Description |
|---|---|
| bs | a parameter |
| bsDelete | a parameter |
public static BitSet deleteBits(BitSet bs, BitSet bsDelete)
//package com.java2s; /* $RCSfile$/*from w w w . j a v a 2 s.c o m*/ * $Author: egonw $ * $Date: 2005-11-10 09:52:44 -0600 (Thu, 10 Nov 2005) $ * $Revision: 4255 $ * * Copyright (C) 2003-2005 The Jmol Development Team * * Contact: jmol-developers@lists.sf.net * * 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., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. */ import java.util.BitSet; public class Main { /** * this one slides deleted bits out of a pattern. * * deleteBits 101011b, 000011b --> 1010b * * Java 1.4, not 1.3 * * @param bs * @param bsDelete * @return shorter bitset */ public static BitSet deleteBits(BitSet bs, BitSet bsDelete) { if (bs == null || bsDelete == null) return bs; int ipt = bsDelete.nextSetBit(0); if (ipt < 0) return bs; int len = bs.length(); int lend = Math.min(len, bsDelete.length()); int i; for (i = bsDelete.nextClearBit(ipt); i < lend && i >= 0; i = bsDelete.nextClearBit(i + 1)) bs.set(ipt++, bs.get(i)); for (i = lend; i < len; i++) bs.set(ipt++, bs.get(i)); if (ipt < len) bs.clear(ipt, len); return bs; } }