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
c59c5e9a
Commit
c59c5e9a
authored
May 07, 1999
by
Tom Tromey
Committed by
Tom Tromey
May 07, 1999
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
* java/lang/natCharacter.cc (isLowerCase): Use a binary search.
From-SVN: r26829
parent
a06fcbd4
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
20 additions
and
3 deletions
+20
-3
libjava/ChangeLog
+2
-0
libjava/java/lang/natCharacter.cc
+18
-3
No files found.
libjava/ChangeLog
View file @
c59c5e9a
1999-05-07 Tom Tromey <tromey@cygnus.com>
1999-05-07 Tom Tromey <tromey@cygnus.com>
* java/lang/natCharacter.cc (isLowerCase): Use a binary search.
* libtool-version: New file.
* libtool-version: New file.
* Makefile.in: Rebuilt.
* Makefile.in: Rebuilt.
* Makefile.am (libgcj_la_LDFLAGS): Use -version-info, not
* Makefile.am (libgcj_la_LDFLAGS): Use -version-info, not
...
...
libjava/java/lang/natCharacter.cc
View file @
c59c5e9a
...
@@ -152,12 +152,27 @@ java::lang::Character::isLowerCase (jchar ch)
...
@@ -152,12 +152,27 @@ java::lang::Character::isLowerCase (jchar ch)
if
(
table_search
(
lower_case_table
,
asize
(
lower_case_table
),
ch
)
!=
-
1
)
if
(
table_search
(
lower_case_table
,
asize
(
lower_case_table
),
ch
)
!=
-
1
)
return
true
;
return
true
;
// FIXME: use a binary search.
int
low
,
high
,
i
,
old
;
for
(
unsigned
int
i
=
0
;
i
<
asize
(
lower_anomalous_table
);
++
i
)
low
=
0
;
high
=
asize
(
lower_anomalous_table
);
i
=
high
/
2
;
while
(
true
)
{
{
if
(
lower_anomalous_table
[
i
]
==
ch
)
if
(
ch
<
lower_anomalous_table
[
i
])
high
=
i
;
else
if
(
ch
>
lower_anomalous_table
[
i
])
low
=
i
;
else
return
true
;
return
true
;
old
=
i
;
i
=
(
high
+
low
)
/
2
;
if
(
i
==
old
)
break
;
}
}
return
false
;
return
false
;
}
}
...
...
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