Lines Matching refs:and
2 * Copyright (c) 1995, 2007, Oracle and/or its affiliates. All rights reserved.
5 * This code is free software; you can redistribute it and/or modify it
39 * {@code BitSet} through logical AND, logical inclusive OR, and
49 * of a bit set and is defined independently of implementation.
81 * significant bit and 63 refers to the most significant bit).
99 * the user knows what he's doing and try harder to preserve it.
201 * buffer between its position and limit.
207 * <p>The long buffer is not modified by this method, and no
211 * of a sequence of bits between its position and limit, to be
246 * buffer between its position and limit.
252 * <p>The byte buffer is not modified by this method, and no
256 * of a sequence of bits between its position and limit, to be
280 * <br>then {@code bytes.length == (s.length()+7)/8} and
309 * <br>then {@code longs.length == (s.length()+63)/64} and
895 * has the value {@code true} if and only if it both initially
896 * had the value {@code true} and the corresponding bit in the
901 public void and(BitSet set) {
919 * value {@code true} if and only if it either already had the
953 * value {@code true} if and only if one of the following
956 * <li>The bit initially has the value {@code true}, and the
958 * <li>The bit initially has the value {@code false}, and the
1042 * The result is {@code true} if and only if the argument is
1043 * not {@code null} and is a {@code Bitset} object that has
1152 * highest, separated by ", " (a comma and a space) and