1.1 --- a/src/share/classes/com/sun/tools/javac/util/Bits.java Sat Sep 08 22:54:21 2012 -0700 1.2 +++ b/src/share/classes/com/sun/tools/javac/util/Bits.java Thu Sep 13 14:29:36 2012 -0700 1.3 @@ -1,5 +1,5 @@ 1.4 /* 1.5 - * Copyright (c) 1999, 2011, Oracle and/or its affiliates. All rights reserved. 1.6 + * Copyright (c) 1999, 2012, 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 @@ -127,7 +127,7 @@ 1.11 (bits[x >>> wordshift] & (1 << (x & wordmask))) != 0; 1.12 } 1.13 1.14 - /** this set = this set & xs. 1.15 + /** {@literal this set = this set & xs}. 1.16 */ 1.17 public Bits andSet(Bits xs) { 1.18 sizeTo(xs.bits.length); 1.19 @@ -179,12 +179,12 @@ 1.20 return n - (x&1); 1.21 } 1.22 1.23 - /** Return the index of the least bit position >= x that is set. 1.24 + /** Return the index of the least bit position ≥ x that is set. 1.25 * If none are set, returns -1. This provides a nice way to iterate 1.26 * over the members of a bit set: 1.27 - * <pre> 1.28 + * <pre>{@code 1.29 * for (int i = bits.nextBit(0); i>=0; i = bits.nextBit(i+1)) ... 1.30 - * </pre> 1.31 + * }</pre> 1.32 */ 1.33 public int nextBit(int x) { 1.34 int windex = x >>> wordshift;