Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
R
riscv-gcc-1
Overview
Overview
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
lvzhengyang
riscv-gcc-1
Commits
db50e427
Commit
db50e427
authored
Oct 29, 2000
by
Bryce McKinlay
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Re-indent in preparation for diff.
From-SVN: r37114
parent
7d3af72b
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
14 additions
and
14 deletions
+14
-14
libjava/java/util/BitSet.java
+14
-14
No files found.
libjava/java/util/BitSet.java
View file @
db50e427
...
...
@@ -4,9 +4,9 @@
This file is part of libgcj.
This software is copyrighted work licensed under the terms of the
Libgcj License. Please consult the file "LIBGCJ_LICENSE" for
details. */
This software is copyrighted work licensed under the terms of the
Libgcj License. Please consult the file "LIBGCJ_LICENSE" for
details. */
package
java
.
util
;
import
java.io.Serializable
;
...
...
@@ -24,11 +24,11 @@ public final class BitSet implements Cloneable, Serializable
{
public
void
and
(
BitSet
bs
)
{
int
max
=
Math
.
min
(
bits
.
length
,
bs
.
bits
.
length
);
int
max
=
Math
.
min
(
bits
.
length
,
bs
.
bits
.
length
);
int
i
;
for
(
i
=
0
;
i
<
max
;
++
i
)
bits
[
i
]
&=
bs
.
bits
[
i
];
for
(
;
i
<
bits
.
length
;
++
i
)
for
(
;
i
<
bits
.
length
;
++
i
)
bits
[
i
]
=
0
;
}
...
...
@@ -54,22 +54,22 @@ public final class BitSet implements Cloneable, Serializable
int
bit
=
pos
%
64
;
int
offset
=
pos
/
64
;
ensure
(
offset
);
bits
[
offset
]
&=
~
(
1L
<<
bit
);
bits
[
offset
]
&=
~
(
1L
<<
bit
);
}
public
Object
clone
()
{
BitSet
bs
=
new
BitSet
(
bits
.
length
*
64
);
System
.
arraycopy
(
bits
,
0
,
bs
.
bits
,
0
,
bits
.
length
);
System
.
arraycopy
(
bits
,
0
,
bs
.
bits
,
0
,
bits
.
length
);
return
bs
;
}
public
boolean
equals
(
Object
obj
)
{
if
(!
(
obj
instanceof
BitSet
))
if
(!
(
obj
instanceof
BitSet
))
return
false
;
BitSet
bs
=
(
BitSet
)
obj
;
int
max
=
Math
.
min
(
bits
.
length
,
bs
.
bits
.
length
);
int
max
=
Math
.
min
(
bits
.
length
,
bs
.
bits
.
length
);
int
i
;
for
(
i
=
0
;
i
<
max
;
++
i
)
if
(
bits
[
i
]
!=
bs
.
bits
[
i
])
...
...
@@ -141,16 +141,16 @@ public final class BitSet implements Cloneable, Serializable
{
if
((
word
&
bit
)
!=
0
)
{
if
(!
first
)
result
.
append
(
", "
);
result
.
append
(
64
*
i
+
j
);
if
(!
first
)
result
.
append
(
", "
);
result
.
append
(
64
*
i
+
j
);
first
=
false
;
}
bit
<<=
1
;
}
}
return
result
.
append
(
"}"
).
toString
();
return
result
.
append
(
"}"
).
toString
();
}
public
void
xor
(
BitSet
bs
)
...
...
@@ -167,7 +167,7 @@ public final class BitSet implements Cloneable, Serializable
if
(
lastElt
+
1
>
bits
.
length
)
{
long
[]
nd
=
new
long
[
lastElt
+
1
];
System
.
arraycopy
(
bits
,
0
,
nd
,
0
,
bits
.
length
);
System
.
arraycopy
(
bits
,
0
,
nd
,
0
,
bits
.
length
);
bits
=
nd
;
}
}
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment