Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
P
Postgres FD Implementation
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Abuhujair Javed
Postgres FD Implementation
Commits
7ff432c9
Commit
7ff432c9
authored
Oct 04, 2001
by
Bruce Momjian
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
1. Implemented binary search in array
Oleg Bartunov
parent
720ca220
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
20 additions
and
24 deletions
+20
-24
contrib/intarray/README.intarray
contrib/intarray/README.intarray
+2
-0
contrib/intarray/_int.c
contrib/intarray/_int.c
+18
-24
No files found.
contrib/intarray/README.intarray
View file @
7ff432c9
...
...
@@ -12,6 +12,8 @@ for additional information.
CHANGES:
October 1, 2001
1. Change search method in array to binary
September 28, 2001
1. gist__int_ops now is without lossy
2. add sort entry in picksplit
...
...
contrib/intarray/_int.c
View file @
7ff432c9
...
...
@@ -1741,33 +1741,29 @@ makepol(WORKSTATE *state) {
typedef
struct
{
int4
*
arrb
;
int4
*
arre
;
int4
*
ptr
;
}
CHKVAL
;
/*
* is there value 'val' in array or not ?
*/
*/
static
bool
checkcondition_arr
(
void
*
checkval
,
int4
val
)
{
#ifdef BS_DEBUG
elog
(
NOTICE
,
"OPERAND %d"
,
val
);
#endif
if
(
val
>
*
(((
CHKVAL
*
)
checkval
)
->
ptr
)
)
{
while
(
((
CHKVAL
*
)
checkval
)
->
ptr
<
((
CHKVAL
*
)
checkval
)
->
arre
)
{
((
CHKVAL
*
)
checkval
)
->
ptr
++
;
if
(
*
(((
CHKVAL
*
)
checkval
)
->
ptr
)
==
val
)
return
true
;
if
(
val
<
*
(((
CHKVAL
*
)
checkval
)
->
ptr
)
)
return
false
;
}
}
else
if
(
val
<
*
(((
CHKVAL
*
)
checkval
)
->
ptr
)
)
{
while
(
((
CHKVAL
*
)
checkval
)
->
ptr
>
((
CHKVAL
*
)
checkval
)
->
arrb
)
{
((
CHKVAL
*
)
checkval
)
->
ptr
--
;
if
(
*
(((
CHKVAL
*
)
checkval
)
->
ptr
)
==
val
)
return
true
;
if
(
val
>
*
(((
CHKVAL
*
)
checkval
)
->
ptr
)
)
return
false
;
}
}
else
{
return
true
;
int4
*
StopLow
=
((
CHKVAL
*
)
checkval
)
->
arrb
;
int4
*
StopHigh
=
((
CHKVAL
*
)
checkval
)
->
arre
;
int4
*
StopMiddle
;
/* Loop invariant: StopLow <= val < StopHigh */
while
(
StopLow
<
StopHigh
)
{
StopMiddle
=
StopLow
+
(
StopHigh
-
StopLow
)
/
2
;
if
(
*
StopMiddle
==
val
)
return
(
true
);
else
if
(
*
StopMiddle
<
val
)
StopLow
=
StopMiddle
+
1
;
else
StopHigh
=
StopMiddle
;
}
return
false
;
return
false
;
}
static
bool
...
...
@@ -1818,8 +1814,7 @@ execconsistent( QUERYTYPE *query, ArrayType *array, bool calcnot ) {
CHKVAL
chkval
;
chkval
.
arrb
=
ARRPTR
(
array
);
chkval
.
arre
=
chkval
.
arrb
+
ARRNELEMS
(
array
)
-
1
;
chkval
.
ptr
=
chkval
.
arrb
+
ARRNELEMS
(
array
)
/
2
;
chkval
.
arre
=
chkval
.
arrb
+
ARRNELEMS
(
array
);
return
execute
(
GETQUERY
(
query
)
+
query
->
size
-
1
,
(
void
*
)
&
chkval
,
calcnot
,
...
...
@@ -1854,8 +1849,7 @@ boolop(PG_FUNCTION_ARGS) {
PREPAREARR
(
val
);
chkval
.
arrb
=
ARRPTR
(
val
);
chkval
.
arre
=
chkval
.
arrb
+
ARRNELEMS
(
val
)
-
1
;
chkval
.
ptr
=
chkval
.
arrb
+
ARRNELEMS
(
val
)
/
2
;
chkval
.
arre
=
chkval
.
arrb
+
ARRNELEMS
(
val
);
result
=
execute
(
GETQUERY
(
query
)
+
query
->
size
-
1
,
&
chkval
,
true
,
...
...
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