[prev in list] [next in list] [prev in thread] [next in thread] 

List:       monetdb-checkins
Subject:    [Monetdb-checkins] MonetDB5/src/mal/Tests tst161.stable.out, , 1.12,
From:       Martin Kersten <mlkersten () users ! sourceforge ! net>
Date:       2009-07-30 5:55:54
Message-ID: E1MWOcP-00048H-8b () 23jxhf1 ! ch3 ! sourceforge ! com
[Download RAW message or body]

Update of /cvsroot/monetdb/MonetDB5/src/mal/Tests
In directory 23jxhf1.ch3.sourceforge.com:/tmp/cvs-serv15839

Modified Files:
	tst161.stable.out tst162.stable.out tst450.stable.out 
Log Message:
Approved output


U tst450.stable.out
Index: tst450.stable.out
===================================================================
RCS file: /cvsroot/monetdb/MonetDB5/src/mal/Tests/tst450.stable.out,v
retrieving revision 1.220
retrieving revision 1.221
diff -u -d -r1.220 -r1.221
--- tst450.stable.out	9 May 2009 20:35:33 -0000	1.220
+++ tst450.stable.out	30 Jul 2009 05:55:50 -0000	1.221
@@ -172,6 +172,30 @@
 command bpm.insert(pb:bat[:any_1,:any_2],b:bat[:any_1,:any_2]):void address \
BPMinsert;  #Insert elements into the BAT partitions.
 
+command cluster.new(b:bat[:oid,:dbl],bits:int,offset:int,order:bit) \
(psum:bat[:oid,:wrd],map:bat[:oid,:bte]) address CLS_create2_dbl; +#Compute the \
cluster map for bat b. A cluster map is a list of partition ids. The p(refix) sum is \
a by product which returns the prefix sum of the per partition frequency. Prefix sum \
and map can be use to 'cluster' related columns based on b. Incase the offset is non \
negative it is used to shift the key values. Offset together with the mask bits \
should make sure that the result of the partitioning can be used in a order by \
sequence. If this holds and the input is sorted we return a 'compressed' \
representation of the map, ie [:oid,:bte], the repeated values are not inserted. The \
order flag indicates that the clustering is used for ordering, ie patition keys \
aren't fixed so we can internaly optimize partition sizes. +
+command cluster.new(b:bat[:oid,:flt],bits:int,offset:int,order:bit) \
(psum:bat[:oid,:wrd],map:bat[:oid,:bte]) address CLS_create2_flt; +#Compute the \
cluster map for bat b. A cluster map is a list of partition ids. The p(refix) sum is \
a by product which returns the prefix sum of the per partition frequency. Prefix sum \
and map can be use to 'cluster' related columns based on b. Incase the offset is non \
negative it is used to shift the key values. Offset together with the mask bits \
should make sure that the result of the partitioning can be used in a order by \
sequence. If this holds and the input is sorted we return a 'compressed' \
representation of the map, ie [:oid,:bte], the repeated values are not inserted. The \
order flag indicates that the clustering is used for ordering, ie patition keys \
aren't fixed so we can internaly optimize partition sizes. +
+command cluster.new(b:bat[:oid,:lng],bits:int,offset:int,order:bit) \
(psum:bat[:oid,:wrd],map:bat[:oid,:bte]) address CLS_create2_lng; +#Compute the \
cluster map for bat b. A cluster map is a list of partition ids. The p(refix) sum is \
a by product which returns the prefix sum of the per partition frequency. Prefix sum \
and map can be use to 'cluster' related columns based on b. Incase the offset is non \
negative it is used to shift the key values. Offset together with the mask bits \
should make sure that the result of the partitioning can be used in a order by \
sequence. If this holds and the input is sorted we return a 'compressed' \
representation of the map, ie [:oid,:bte], the repeated values are not inserted. The \
order flag indicates that the clustering is used for ordering, ie patition keys \
aren't fixed so we can internaly optimize partition sizes. +
+command cluster.new(b:bat[:oid,:wrd],bits:int,offset:int,order:bit) \
(psum:bat[:oid,:wrd],map:bat[:oid,:bte]) address CLS_create2_wrd; +#Compute the \
cluster map for bat b. A cluster map is a list of partition ids. The p(refix) sum is \
a by product which returns the prefix sum of the per partition frequency. Prefix sum \
and map can be use to 'cluster' related columns based on b. Incase the offset is non \
negative it is used to shift the key values. Offset together with the mask bits \
should make sure that the result of the partitioning can be used in a order by \
sequence. If this holds and the input is sorted we return a 'compressed' \
representation of the map, ie [:oid,:bte], the repeated values are not inserted. The \
order flag indicates that the clustering is used for ordering, ie patition keys \
aren't fixed so we can internaly optimize partition sizes. +
+command cluster.new(b:bat[:oid,:int],bits:int,offset:int,order:bit) \
(psum:bat[:oid,:wrd],map:bat[:oid,:bte]) address CLS_create2_int; +#Compute the \
cluster map for bat b. A cluster map is a list of partition ids. The p(refix) sum is \
a by product which returns the prefix sum of the per partition frequency. Prefix sum \
and map can be use to 'cluster' related columns based on b. Incase the offset is non \
negative it is used to shift the key values. Offset together with the mask bits \
should make sure that the result of the partitioning can be used in a order by \
sequence. If this holds and the input is sorted we return a 'compressed' \
representation of the map, ie [:oid,:bte], the repeated values are not inserted. The \
order flag indicates that the clustering is used for ordering, ie patition keys \
aren't fixed so we can internaly optimize partition sizes. +
+command cluster.new(b:bat[:oid,:sht],bits:int,offset:int,order:bit) \
(psum:bat[:oid,:wrd],map:bat[:oid,:bte]) address CLS_create2_sht; +#Compute the \
cluster map for bat b. A cluster map is a list of partition ids. The p(refix) sum is \
a by product which returns the prefix sum of the per partition frequency. Prefix sum \
and map can be use to 'cluster' related columns based on b. Incase the offset is non \
negative it is used to shift the key values. Offset together with the mask bits \
should make sure that the result of the partitioning can be used in a order by \
sequence. If this holds and the input is sorted we return a 'compressed' \
representation of the map, ie [:oid,:bte], the repeated values are not inserted. The \
order flag indicates that the clustering is used for ordering, ie patition keys \
aren't fixed so we can internaly optimize partition sizes. +
+command cluster.new(b:bat[:oid,:chr],bits:int,offset:int,order:bit) \
(psum:bat[:oid,:wrd],map:bat[:oid,:bte]) address CLS_create2_chr; +#Compute the \
cluster map for bat b. A cluster map is a list of partition ids. The p(refix) sum is \
a by product which returns the prefix sum of the per partition frequency. Prefix sum \
and map can be use to 'cluster' related columns based on b. Incase the offset is non \
negative it is used to shift the key values. Offset together with the mask bits \
should make sure that the result of the partitioning can be used in a order by \
sequence. If this holds and the input is sorted we return a 'compressed' \
representation of the map, ie [:oid,:bte], the repeated values are not inserted. The \
order flag indicates that the clustering is used for ordering, ie patition keys \
aren't fixed so we can internaly optimize partition sizes. +
+command cluster.new(b:bat[:oid,:bte],bits:int,offset:int,order:bit) \
(psum:bat[:oid,:wrd],map:bat[:oid,:bte]) address CLS_create2_bte; +#Compute the \
cluster map for bat b. A cluster map is a list of partition ids. The p(refix) sum is \
a by product which returns the prefix sum of the per partition frequency. Prefix sum \
and map can be use to 'cluster' related columns based on b. Incase the offset is non \
negative it is used to shift the key values. Offset together with the mask bits \
should make sure that the result of the partitioning can be used in a order by \
sequence. If this holds and the input is sorted we return a 'compressed' \
representation of the map, ie [:oid,:bte], the repeated values are not inserted. The \
order flag indicates that the clustering is used for ordering, ie patition keys \
aren't fixed so we can internaly optimize partition sizes. +
 command crackers.insert(b:bat[:oid,:dbl],bp:bat[:oid,:dbl],c:bat[:dbl,:dbl]):void \
address CRKinsert;  #Keep the insertions BAT separatelly and merge in the future on \
demand with the Ripple  

U tst162.stable.out
Index: tst162.stable.out
===================================================================
RCS file: /cvsroot/monetdb/MonetDB5/src/mal/Tests/tst162.stable.out,v
retrieving revision 1.12
retrieving revision 1.13
diff -u -d -r1.12 -r1.13
--- tst162.stable.out	18 Nov 2008 22:42:15 -0000	1.12
+++ tst162.stable.out	30 Jul 2009 05:55:50 -0000	1.13
@@ -10,8 +10,7 @@
 # Compiled for x86_64-unknown-linux-gnu/64bit with 64bit OIDs dynamically linked
 # Copyright (c) 1993-2008 CWI, all rights reserved
 # Visit http://monetdb.cwi.nl/ for further information
-# Listening for connection requests on mapi:monetdb://eir.ins.cwi.nl:32526/
-!SyntaxException:convertConstant:pointer conversion error
+# Listening for connection requests on mapi:monetdb://eir.ins.cwi.nl:30696/
 !SyntaxException:defConstant:constant coercion error from int to strtype
 #    return l:= nil:strtype;
 #end l;

U tst161.stable.out
Index: tst161.stable.out
===================================================================
RCS file: /cvsroot/monetdb/MonetDB5/src/mal/Tests/tst161.stable.out,v
retrieving revision 1.12
retrieving revision 1.13
diff -u -d -r1.12 -r1.13
--- tst161.stable.out	18 Nov 2008 22:42:15 -0000	1.12
+++ tst161.stable.out	30 Jul 2009 05:55:48 -0000	1.13
@@ -10,8 +10,7 @@
 # Compiled for x86_64-unknown-linux-gnu/64bit with 64bit OIDs dynamically linked
 # Copyright (c) 1993-2008 CWI, all rights reserved
 # Visit http://monetdb.cwi.nl/ for further information
-# Listening for connection requests on mapi:monetdb://eir.ins.cwi.nl:32526/
-!SyntaxException:convertConstant:pointer conversion error
+# Listening for connection requests on mapi:monetdb://eir.ins.cwi.nl:30696/
 !SyntaxException:defConstant:constant coercion error from int to mytype
 #end l;
 function mytype.l():mytype;


------------------------------------------------------------------------------
Let Crystal Reports handle the reporting - Free Crystal Reports 2008 30-Day 
trial. Simplify your report design, integration and deployment - and focus on 
what you do best, core application coding. Discover what's new with 
Crystal Reports now.  http://p.sf.net/sfu/bobj-july
_______________________________________________
Monetdb-checkins mailing list
Monetdb-checkins@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/monetdb-checkins


[prev in list] [next in list] [prev in thread] [next in thread]