cardinality = "total number of set bits in BitSet" - Java java.util

Java examples for java.util:BitSet

  1. HOME
  2. Java
  3. java.util
  4. BitSet

Description

cardinality = "total number of set bits in BitSet"

Demo Code

/* $RCSfile$//from  w ww  . java 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.
 */
//package com.java2s;
import java.util.BitSet;

public class Main {
    /**
     * cardinality = "total number of set bits"
     * @param bs
     * @return number of set bits
     */
    public static int cardinalityOf(BitSet bs) {
        return (bs == null ? 0 : bs.cardinality());
    }
}

Related Tutorials