Changeset: 1d1fbef3599d for MonetDB
URL: http://dev.monetdb.org/hg/MonetDB?cmd=changeset;node=1d1fbef3599d
Modified Files:
clients/Tests/MAL-signatures.stable.out
clients/Tests/MAL-signatures.stable.out.int128
clients/Tests/SQL-dump.stable.out
clients/Tests/exports.stable.out
Branch: default
Log Message:
Approvals.
diffs (truncated from 1497 to 300 lines):
diff --git a/clients/Tests/MAL-signatures.stable.out
b/clients/Tests/MAL-signatures.stable.out
--- a/clients/Tests/MAL-signatures.stable.out
+++ b/clients/Tests/MAL-signatures.stable.out
@@ -20,7 +20,7 @@ Ready.
# 17:25:33 > "mclient" "-lmal" "-ftest" "-Eutf-8"
"--host=/var/tmp/mtest-25210" "--port=34276"
# 17:25:33 >
-command aggr.avg(b:bat[:dbl],g:bat[:oid],e:bat[:any_1])
(X_4:bat[:dbl],X_5:bat[:lng])
+command aggr.avg(b:bat[:dbl],g:bat[:oid],e:bat[:any_1])
(X_0:bat[:dbl],X_1:bat[:lng])
address AGGRavg23_dbl;
comment Grouped tail average on dbl, also returns count
@@ -28,7 +28,7 @@ command aggr.avg(b:bat[:dbl],g:bat[:oid]
address AGGRavg13_dbl;
comment Grouped tail average on dbl
-command aggr.avg(b:bat[:flt],g:bat[:oid],e:bat[:any_1])
(X_4:bat[:dbl],X_5:bat[:lng])
+command aggr.avg(b:bat[:flt],g:bat[:oid],e:bat[:any_1])
(X_0:bat[:dbl],X_1:bat[:lng])
address AGGRavg23_dbl;
comment Grouped tail average on flt, also returns count
@@ -36,7 +36,7 @@ command aggr.avg(b:bat[:flt],g:bat[:oid]
address AGGRavg13_dbl;
comment Grouped tail average on flt
-command aggr.avg(b:bat[:lng],g:bat[:oid],e:bat[:any_1])
(X_4:bat[:dbl],X_5:bat[:lng])
+command aggr.avg(b:bat[:lng],g:bat[:oid],e:bat[:any_1])
(X_0:bat[:dbl],X_1:bat[:lng])
address AGGRavg23_dbl;
comment Grouped tail average on lng, also returns count
@@ -44,7 +44,7 @@ command aggr.avg(b:bat[:lng],g:bat[:oid]
address AGGRavg13_dbl;
comment Grouped tail average on lng
-command aggr.avg(b:bat[:int],g:bat[:oid],e:bat[:any_1])
(X_4:bat[:dbl],X_5:bat[:lng])
+command aggr.avg(b:bat[:int],g:bat[:oid],e:bat[:any_1])
(X_0:bat[:dbl],X_1:bat[:lng])
address AGGRavg23_dbl;
comment Grouped tail average on int, also returns count
@@ -52,7 +52,7 @@ command aggr.avg(b:bat[:int],g:bat[:oid]
address AGGRavg13_dbl;
comment Grouped tail average on int
-command aggr.avg(b:bat[:sht],g:bat[:oid],e:bat[:any_1])
(X_4:bat[:dbl],X_5:bat[:lng])
+command aggr.avg(b:bat[:sht],g:bat[:oid],e:bat[:any_1])
(X_0:bat[:dbl],X_1:bat[:lng])
address AGGRavg23_dbl;
comment Grouped tail average on sht, also returns count
@@ -60,7 +60,7 @@ command aggr.avg(b:bat[:sht],g:bat[:oid]
address AGGRavg13_dbl;
comment Grouped tail average on sht
-command aggr.avg(b:bat[:bte],g:bat[:oid],e:bat[:any_1])
(X_4:bat[:dbl],X_5:bat[:lng])
+command aggr.avg(b:bat[:bte],g:bat[:oid],e:bat[:any_1])
(X_0:bat[:dbl],X_1:bat[:lng])
address AGGRavg23_dbl;
comment Grouped tail average on bte, also returns count
@@ -868,11 +868,11 @@ command aggr.stdev(b:bat[:dbl],g:bat[:oi
address AGGRstdev3_dbl;
comment Grouped tail standard deviation (sample/non-biased) on dbl
-command
aggr.subavg(b:bat[:dbl],g:bat[:oid],e:bat[:any_1],s:bat[:oid],skip_nils:bit,abort_on_error:bit)
(X_7:bat[:dbl],X_8:bat[:lng])
+command
aggr.subavg(b:bat[:dbl],g:bat[:oid],e:bat[:any_1],s:bat[:oid],skip_nils:bit,abort_on_error:bit)
(X_0:bat[:dbl],X_1:bat[:lng])
address AGGRsubavg2cand_dbl;
comment Grouped average aggregate with candidates list, also returns count
-command
aggr.subavg(b:bat[:dbl],g:bat[:oid],e:bat[:any_1],skip_nils:bit,abort_on_error:bit)
(X_6:bat[:dbl],X_7:bat[:lng])
+command
aggr.subavg(b:bat[:dbl],g:bat[:oid],e:bat[:any_1],skip_nils:bit,abort_on_error:bit)
(X_0:bat[:dbl],X_1:bat[:lng])
address AGGRsubavg2_dbl;
comment Grouped average aggregate, also returns count
@@ -924,11 +924,11 @@ command aggr.stdev(b:bat[:flt],g:bat[:oi
address AGGRstdev3_dbl;
comment Grouped tail standard deviation (sample/non-biased) on flt
-command
aggr.subavg(b:bat[:flt],g:bat[:oid],e:bat[:any_1],s:bat[:oid],skip_nils:bit,abort_on_error:bit)
(X_7:bat[:dbl],X_8:bat[:lng])
+command
aggr.subavg(b:bat[:flt],g:bat[:oid],e:bat[:any_1],s:bat[:oid],skip_nils:bit,abort_on_error:bit)
(X_0:bat[:dbl],X_1:bat[:lng])
address AGGRsubavg2cand_dbl;
comment Grouped average aggregate with candidates list, also returns count
-command
aggr.subavg(b:bat[:flt],g:bat[:oid],e:bat[:any_1],skip_nils:bit,abort_on_error:bit)
(X_6:bat[:dbl],X_7:bat[:lng])
+command
aggr.subavg(b:bat[:flt],g:bat[:oid],e:bat[:any_1],skip_nils:bit,abort_on_error:bit)
(X_0:bat[:dbl],X_1:bat[:lng])
address AGGRsubavg2_dbl;
comment Grouped average aggregate, also returns count
@@ -980,11 +980,11 @@ command aggr.stdev(b:bat[:lng],g:bat[:oi
address AGGRstdev3_dbl;
comment Grouped tail standard deviation (sample/non-biased) on lng
-command
aggr.subavg(b:bat[:lng],g:bat[:oid],e:bat[:any_1],s:bat[:oid],skip_nils:bit,abort_on_error:bit)
(X_7:bat[:dbl],X_8:bat[:lng])
+command
aggr.subavg(b:bat[:lng],g:bat[:oid],e:bat[:any_1],s:bat[:oid],skip_nils:bit,abort_on_error:bit)
(X_0:bat[:dbl],X_1:bat[:lng])
address AGGRsubavg2cand_dbl;
comment Grouped average aggregate with candidates list, also returns count
-command
aggr.subavg(b:bat[:lng],g:bat[:oid],e:bat[:any_1],skip_nils:bit,abort_on_error:bit)
(X_6:bat[:dbl],X_7:bat[:lng])
+command
aggr.subavg(b:bat[:lng],g:bat[:oid],e:bat[:any_1],skip_nils:bit,abort_on_error:bit)
(X_0:bat[:dbl],X_1:bat[:lng])
address AGGRsubavg2_dbl;
comment Grouped average aggregate, also returns count
@@ -1036,11 +1036,11 @@ command aggr.stdev(b:bat[:int],g:bat[:oi
address AGGRstdev3_dbl;
comment Grouped tail standard deviation (sample/non-biased) on int
-command
aggr.subavg(b:bat[:int],g:bat[:oid],e:bat[:any_1],s:bat[:oid],skip_nils:bit,abort_on_error:bit)
(X_7:bat[:dbl],X_8:bat[:lng])
+command
aggr.subavg(b:bat[:int],g:bat[:oid],e:bat[:any_1],s:bat[:oid],skip_nils:bit,abort_on_error:bit)
(X_0:bat[:dbl],X_1:bat[:lng])
address AGGRsubavg2cand_dbl;
comment Grouped average aggregate with candidates list, also returns count
-command
aggr.subavg(b:bat[:int],g:bat[:oid],e:bat[:any_1],skip_nils:bit,abort_on_error:bit)
(X_6:bat[:dbl],X_7:bat[:lng])
+command
aggr.subavg(b:bat[:int],g:bat[:oid],e:bat[:any_1],skip_nils:bit,abort_on_error:bit)
(X_0:bat[:dbl],X_1:bat[:lng])
address AGGRsubavg2_dbl;
comment Grouped average aggregate, also returns count
@@ -1092,11 +1092,11 @@ command aggr.stdev(b:bat[:sht],g:bat[:oi
address AGGRstdev3_dbl;
comment Grouped tail standard deviation (sample/non-biased) on sht
-command
aggr.subavg(b:bat[:sht],g:bat[:oid],e:bat[:any_1],s:bat[:oid],skip_nils:bit,abort_on_error:bit)
(X_7:bat[:dbl],X_8:bat[:lng])
+command
aggr.subavg(b:bat[:sht],g:bat[:oid],e:bat[:any_1],s:bat[:oid],skip_nils:bit,abort_on_error:bit)
(X_0:bat[:dbl],X_1:bat[:lng])
address AGGRsubavg2cand_dbl;
comment Grouped average aggregate with candidates list, also returns count
-command
aggr.subavg(b:bat[:sht],g:bat[:oid],e:bat[:any_1],skip_nils:bit,abort_on_error:bit)
(X_6:bat[:dbl],X_7:bat[:lng])
+command
aggr.subavg(b:bat[:sht],g:bat[:oid],e:bat[:any_1],skip_nils:bit,abort_on_error:bit)
(X_0:bat[:dbl],X_1:bat[:lng])
address AGGRsubavg2_dbl;
comment Grouped average aggregate, also returns count
@@ -1148,11 +1148,11 @@ command aggr.stdev(b:bat[:bte],g:bat[:oi
address AGGRstdev3_dbl;
comment Grouped tail standard deviation (sample/non-biased) on bte
-command
aggr.subavg(b:bat[:bte],g:bat[:oid],e:bat[:any_1],s:bat[:oid],skip_nils:bit,abort_on_error:bit)
(X_7:bat[:dbl],X_8:bat[:lng])
+command
aggr.subavg(b:bat[:bte],g:bat[:oid],e:bat[:any_1],s:bat[:oid],skip_nils:bit,abort_on_error:bit)
(X_0:bat[:dbl],X_1:bat[:lng])
address AGGRsubavg2cand_dbl;
comment Grouped average aggregate with candidates list, also returns count
-command
aggr.subavg(b:bat[:bte],g:bat[:oid],e:bat[:any_1],skip_nils:bit,abort_on_error:bit)
(X_6:bat[:dbl],X_7:bat[:lng])
+command
aggr.subavg(b:bat[:bte],g:bat[:oid],e:bat[:any_1],skip_nils:bit,abort_on_error:bit)
(X_0:bat[:dbl],X_1:bat[:lng])
address AGGRsubavg2_dbl;
comment Grouped average aggregate, also returns count
@@ -1516,15 +1516,15 @@ command algebra.exist(b:bat[:any_1],val:
address ALGexist;
comment Returns whether 'val' occurs in b.
-pattern
algebra.firstn(b:bat[:any],s:bat[:oid],g:bat[:oid],n:lng,asc:bit,distinct:bit)
(X_7:bat[:oid],X_8:bat[:oid])
+pattern
algebra.firstn(b:bat[:any],s:bat[:oid],g:bat[:oid],n:lng,asc:bit,distinct:bit)
(X_0:bat[:oid],X_1:bat[:oid])
address ALGfirstn;
comment Calculate first N values of B with candidate list S
-pattern algebra.firstn(b:bat[:any],s:bat[:oid],n:lng,asc:bit,distinct:bit)
(X_6:bat[:oid],X_7:bat[:oid])
+pattern algebra.firstn(b:bat[:any],s:bat[:oid],n:lng,asc:bit,distinct:bit)
(X_0:bat[:oid],X_1:bat[:oid])
address ALGfirstn;
comment Calculate first N values of B with candidate list S
-pattern algebra.firstn(b:bat[:any],n:lng,asc:bit,distinct:bit)
(X_5:bat[:oid],X_6:bat[:oid])
+pattern algebra.firstn(b:bat[:any],n:lng,asc:bit,distinct:bit)
(X_0:bat[:oid],X_1:bat[:oid])
address ALGfirstn;
comment Calculate first N values of B
@@ -1552,9 +1552,9 @@ command algebra.groupby(gids:bat[:oid],c
address ALGgroupby;
comment Produces a new BAT with groups identified by the head column. The
result contains tail times the head value, ie the tail contains the result
group sizes.
-command
algebra.ilikesubjoin(l:bat[:str],r:bat[:str],sl:bat[:oid],sr:bat[:oid],nil_matches:bit,estimate:lng)
(X_7:bat[:oid],X_8:bat[:oid])
+command
algebra.ilikesubjoin(l:bat[:str],r:bat[:str],sl:bat[:oid],sr:bat[:oid],nil_matches:bit,estimate:lng)
(X_0:bat[:oid],X_1:bat[:oid])
address ILIKEsubjoin1;
-command
algebra.ilikesubjoin(l:bat[:str],r:bat[:str],esc:str,sl:bat[:oid],sr:bat[:oid],nil_matches:bit,estimate:lng)
(X_8:bat[:oid],X_9:bat[:oid])
+command
algebra.ilikesubjoin(l:bat[:str],r:bat[:str],esc:str,sl:bat[:oid],sr:bat[:oid],nil_matches:bit,estimate:lng)
(X_0:bat[:oid],X_1:bat[:oid])
address ILIKEsubjoin;
comment Join the string bat L with the pattern bat Rwith optional candidate
lists SL and SR using pattern escape string ESCand doing a case insensitive
match.The result is two aligned bats with oids of matching rows.
@@ -1566,9 +1566,9 @@ command algebra.ilike(s:str,pat:str):bit
address PCREilike2;
command algebra.ilike(s:str,pat:str,esc:str):bit
address PCREilike3;
-command
algebra.likesubjoin(l:bat[:str],r:bat[:str],sl:bat[:oid],sr:bat[:oid],nil_matches:bit,estimate:lng)
(X_7:bat[:oid],X_8:bat[:oid])
+command
algebra.likesubjoin(l:bat[:str],r:bat[:str],sl:bat[:oid],sr:bat[:oid],nil_matches:bit,estimate:lng)
(X_0:bat[:oid],X_1:bat[:oid])
address LIKEsubjoin1;
-command
algebra.likesubjoin(l:bat[:str],r:bat[:str],esc:str,sl:bat[:oid],sr:bat[:oid],nil_matches:bit,estimate:lng)
(X_8:bat[:oid],X_9:bat[:oid])
+command
algebra.likesubjoin(l:bat[:str],r:bat[:str],esc:str,sl:bat[:oid],sr:bat[:oid],nil_matches:bit,estimate:lng)
(X_0:bat[:oid],X_1:bat[:oid])
address LIKEsubjoin;
comment Join the string bat L with the pattern bat Rwith optional candidate
lists SL and SR using pattern escape string ESCand doing a case sensitive
match.The result is two aligned bats with oids of matching rows.
@@ -1640,32 +1640,32 @@ command algebra.subdiff(l:bat[:any_1],r:
address ALGsubdiff;
comment Difference of l and r with candidate lists
-command
algebra.subrangejoin(l:bat[:any_1],r1:bat[:any_1],r2:bat[:any_1],sl:bat[:oid],sr:bat[:oid],li:bit,hi:bit,estimate:lng)
(X_9:bat[:oid],X_10:bat[:oid])
+command
algebra.subrangejoin(l:bat[:any_1],r1:bat[:any_1],r2:bat[:any_1],sl:bat[:oid],sr:bat[:oid],li:bit,hi:bit,estimate:lng)
(X_0:bat[:oid],X_1:bat[:oid])
address ALGsubrangejoin;
comment Range join: values in l and r1/r2 match if r1 <[=] l <[=] r2
-command
algebra.subbandjoin(l:bat[:any_1],r:bat[:any_1],sl:bat[:oid],sr:bat[:oid],c1:any_1,c2:any_1,li:bit,hi:bit,estimate:lng)
(X_10:bat[:oid],X_11:bat[:oid])
+command
algebra.subbandjoin(l:bat[:any_1],r:bat[:any_1],sl:bat[:oid],sr:bat[:oid],c1:any_1,c2:any_1,li:bit,hi:bit,estimate:lng)
(X_0:bat[:oid],X_1:bat[:oid])
address ALGsubbandjoin;
comment Band join: values in l and r match if r - c1 <[=] l <[=] r + c2
-function
algebra.subantijoin(l:bat[:any_1],r:bat[:any_1],sl:bat[:oid],sr:bat[:oid],nil_matches:bit,estimate:lng)
(X_7:bat[:oid],X_8:bat[:oid]);
-command
algebra.subthetajoin(l:bat[:any_1],r:bat[:any_1],sl:bat[:oid],sr:bat[:oid],op:int,nil_matches:bit,estimate:lng)
(X_8:bat[:oid],X_9:bat[:oid])
+function
algebra.subantijoin(l:bat[:any_1],r:bat[:any_1],sl:bat[:oid],sr:bat[:oid],nil_matches:bit,estimate:lng)
(X_0:bat[:oid],X_1:bat[:oid]);
+command
algebra.subthetajoin(l:bat[:any_1],r:bat[:any_1],sl:bat[:oid],sr:bat[:oid],op:int,nil_matches:bit,estimate:lng)
(X_0:bat[:oid],X_1:bat[:oid])
address ALGsubthetajoin;
comment Theta join with candidate lists
-command
algebra.subsemijoin(l:bat[:any_1],r:bat[:any_1],sl:bat[:oid],sr:bat[:oid],nil_matches:bit,estimate:lng)
(X_7:bat[:oid],X_8:bat[:oid])
+command
algebra.subsemijoin(l:bat[:any_1],r:bat[:any_1],sl:bat[:oid],sr:bat[:oid],nil_matches:bit,estimate:lng)
(X_0:bat[:oid],X_1:bat[:oid])
address ALGsubsemijoin;
comment Semi join with candidate lists
-command
algebra.subouterjoin(l:bat[:any_1],r:bat[:any_1],sl:bat[:oid],sr:bat[:oid],nil_matches:bit,estimate:lng)
(X_7:bat[:oid],X_8:bat[:oid])
+command
algebra.subouterjoin(l:bat[:any_1],r:bat[:any_1],sl:bat[:oid],sr:bat[:oid],nil_matches:bit,estimate:lng)
(X_0:bat[:oid],X_1:bat[:oid])
address ALGsubouterjoin;
comment Left outer join with candidate lists
-command
algebra.subleftjoin(l:bat[:any_1],r:bat[:any_1],sl:bat[:oid],sr:bat[:oid],nil_matches:bit,estimate:lng)
(X_7:bat[:oid],X_8:bat[:oid])
+command
algebra.subleftjoin(l:bat[:any_1],r:bat[:any_1],sl:bat[:oid],sr:bat[:oid],nil_matches:bit,estimate:lng)
(X_0:bat[:oid],X_1:bat[:oid])
address ALGsubleftjoin;
comment Left join with candidate lists
-command
algebra.subjoin(l:bat[:any_1],r:bat[:any_1],sl:bat[:oid],sr:bat[:oid],nil_matches:bit,estimate:lng)
(X_7:bat[:oid],X_8:bat[:oid])
+command
algebra.subjoin(l:bat[:any_1],r:bat[:any_1],sl:bat[:oid],sr:bat[:oid],nil_matches:bit,estimate:lng)
(X_0:bat[:oid],X_1:bat[:oid])
address ALGsubjoin;
comment Join
@@ -1677,11 +1677,11 @@ command algebra.subunique(b:bat[:any_1],
address ALGsubunique2;
comment Select all unique values from the tail of the first input. Input
is a dense-headed BAT, the second input is a dense-headed BAT with sorted
tail, output is a dense-headed BAT with in the tail the head value of the
input BAT that was selected. The output BAT is sorted on the tail value.
The second input BAT is a list of candidates.
-command
algebra.subsort(b:bat[:any_1],o:bat[:oid],g:bat[:oid],reverse:bit,stable:bit)
(X_6:bat[:any_1],X_7:bat[:oid],X_8:bat[:oid])
+command
algebra.subsort(b:bat[:any_1],o:bat[:oid],g:bat[:oid],reverse:bit,stable:bit)
(X_0:bat[:any_1],X_1:bat[:oid],X_2:bat[:oid])
address ALGsubsort33;
comment Returns a copy of the BAT sorted on tail values, a BAT that specifies
how the input was reordered, and a BAT with group information.
The input and output are (must be) dense headed. The order is
descending if the reverse bit is set. This is a stable sort if
the stable bit is set.
-command
algebra.subsort(b:bat[:any_1],o:bat[:oid],g:bat[:oid],reverse:bit,stable:bit)
(X_6:bat[:any_1],X_7:bat[:oid])
+command
algebra.subsort(b:bat[:any_1],o:bat[:oid],g:bat[:oid],reverse:bit,stable:bit)
(X_0:bat[:any_1],X_1:bat[:oid])
address ALGsubsort32;
comment Returns a copy of the BAT sorted on tail values and a BAT that
specifies how the input was reordered. The input and output are (must
be) dense headed. The order is descending if the reverse bit is set.
This is a stable sort if the stable bit is set.
@@ -1689,11 +1689,11 @@ command algebra.subsort(b:bat[:any_1],o:
address ALGsubsort31;
comment Returns a copy of the BAT sorted on tail values. The input and
output are (must be) dense headed. The order is descending if the
reverse bit is set. This is a stable sort if the stable bit is set.
-command algebra.subsort(b:bat[:any_1],o:bat[:oid],reverse:bit,stable:bit)
(X_5:bat[:any_1],X_6:bat[:oid],X_7:bat[:oid])
+command algebra.subsort(b:bat[:any_1],o:bat[:oid],reverse:bit,stable:bit)
(X_0:bat[:any_1],X_1:bat[:oid],X_2:bat[:oid])
address ALGsubsort23;
comment Returns a copy of the BAT sorted on tail values, a BAT that specifies
how the input was reordered, and a BAT with group information.
The input and output are (must be) dense headed. The order is
descending if the reverse bit is set. This is a stable sort if
the stable bit is set.
-command algebra.subsort(b:bat[:any_1],o:bat[:oid],reverse:bit,stable:bit)
(X_5:bat[:any_1],X_6:bat[:oid])
+command algebra.subsort(b:bat[:any_1],o:bat[:oid],reverse:bit,stable:bit)
(X_0:bat[:any_1],X_1:bat[:oid])
address ALGsubsort22;
comment Returns a copy of the BAT sorted on tail values and a BAT that
specifies how the input was reordered. The input and output are (must
be) dense headed. The order is descending if the reverse bit is set.
This is a stable sort if the stable bit is set.
@@ -1701,11 +1701,11 @@ command algebra.subsort(b:bat[:any_1],o:
address ALGsubsort21;
comment Returns a copy of the BAT sorted on tail values. The input and
output are (must be) dense headed. The order is descending if the
reverse bit is set. This is a stable sort if the stable bit is set.
-command algebra.subsort(b:bat[:any_1],reverse:bit,stable:bit)
(X_4:bat[:any_1],X_5:bat[:oid],X_6:bat[:oid])
+command algebra.subsort(b:bat[:any_1],reverse:bit,stable:bit)
(X_0:bat[:any_1],X_1:bat[:oid],X_2:bat[:oid])
address ALGsubsort13;
comment Returns a copy of the BAT sorted on tail values, a BAT that specifies
how the input was reordered, and a BAT with group information.
The input and output are (must be) dense headed. The order is
descending if the reverse bit is set. This is a stable sort if
the stable bit is set.
-command algebra.subsort(b:bat[:any_1],reverse:bit,stable:bit)
(X_4:bat[:any_1],X_5:bat[:oid])
+command algebra.subsort(b:bat[:any_1],reverse:bit,stable:bit)
(X_0:bat[:any_1],X_1:bat[:oid])
address ALGsubsort12;
comment Returns a copy of the BAT sorted on tail values and a BAT that
specifies how the input was reordered. The input and output are (must
be) dense headed. The order is descending if the reverse bit is set.
This is a stable sort if the stable bit is set.
@@ -2080,15 +2080,15 @@ function batgeom.YMaxFromWKB(g:bat[:wkb]
function batgeom.YMinFromWKB(g:bat[:wkb]):bat[:dbl];
function batgeom.Y(w:bat[:wkb]):bat[:dbl];
function batgeom.Z(w:bat[:wkb]):bat[:dbl];
-command batgeom.coordinateFromMBR(X_1:bat[:mbr],X_2:int):bat[:dbl]
+command batgeom.coordinateFromMBR(X_0:bat[:mbr],X_1:int):bat[:dbl]
address wkbCoordinateFromMBR_bat;
comment returns xmin (=1), ymin (=2), xmax (=3) or ymax(=4) of the provided mbr
-command batgeom.coordinateFromWKB(X_1:bat[:wkb],X_2:int):bat[:dbl]
+command batgeom.coordinateFromWKB(X_0:bat[:wkb],X_1:int):bat[:dbl]
address wkbCoordinateFromWKB_bat;
comment returns xmin (=1), ymin (=2), xmax (=3) or ymax(=4) of the provided
geometry
-command batgeom.mbr(X_1:bat[:wkb]):bat[:mbr]
+command batgeom.mbr(X_0:bat[:wkb]):bat[:mbr]
address wkbMBR_bat;
comment Creates the mbr for the given wkb.
@@ -15178,11 +15178,11 @@ pattern batcalc.>(b1:bat[:uuid],b2:bat[:
address CMDbatGT;
comment Return B1 > B2
-pattern batcalc.avg(b:bat[:dbl],s:bat[:oid]) (X_3:dbl,X_4:lng)
+pattern batcalc.avg(b:bat[:dbl],s:bat[:oid]) (X_0:dbl,X_1:lng)
address CMDcalcavg;
comment average and number of non-nil values of B with candidates list
-pattern batcalc.avg(b:bat[:dbl]) (X_2:dbl,X_3:lng)
+pattern batcalc.avg(b:bat[:dbl]) (X_0:dbl,X_1:lng)
address CMDcalcavg;
comment average and number of non-nil values of B
_______________________________________________
checkin-list mailing list
[email protected]
https://www.monetdb.org/mailman/listinfo/checkin-list
