test_10.stable.out

一个内存数据库的源代码这是服务器端还有客户端

stdout of test 'test_10` in directory 'tests/suite_00` itself:


# 07:27:19 >  
# 07:27:19 >  Mtimeout -timeout 60 mserver5 "--config=/ufs/mk/monet5/Linux/etc/MonetDB5.conf" --debug=10 --set "monet_mod_path=/ufs/mk/monet5/Linux/lib/MonetDB5:/ufs/mk/opensource/MonetDB/Linux/lib/MonetDB" --set "gdk_dbfarm=/ufs/mk/monet5/Linux/var/MonetDB5/dbfarm" --set "sql_logdir=/ufs/mk/monet5/Linux/var/MonetDB5/dblogs" --set mapi_port=35545 --set monet_prompt= --trace --dbname=mTests_tests_suite_00  test_10.mal < /dev/null
# 07:27:19 >  

# MonetDB Server v4.99.19
# Copyright (c) 1993-2006 CWI, all rights reserved
# Compiled for x86_64-redhat-linux-gnu/64bit with 64bit OIDs dynamically linked
# config:/ufs/mk/monet5/Linux/etc/MonetDB5.conf
# dbfarm:/ufs/mk/monet5/Linux/var/MonetDB5/dbfarm
# dbname:mTests_tests_suite_00
# Visit http://monetdb.cwi.nl/ for further information
## Monet Mil to Mal compiler
##include mil;
## Copyright (c) 2001-2004, CWI. All rights reserved.
#
##Predefined code segment
##The compiler can not guarantee an accurate compilation,
##because MIL unlike MAL is a dynamically typed language.
##A few guidelines to maximize usefullness.
##- make the type of variables explicit, in particular 'nil'
##- upon advice of M2m to remap identifiers, change it in your program directly
##use the "mil_schema" for additional support routines
##	mil.line("setoid(oid(20000000));");
#	aa_a := calc.oid(20000000);
#	ba_a := calc.setoid(aa_a);
##	mil.line("# Sorting activities\n");
##	mil.line("# left->right shift + left boundary;\n");
#	s := bat.new(nil:int,nil:int);
##	mil.line("insert(s,5,5);insert(s,3,3);insert(s,4,2);insert(s,2,1);");
#	ca_a := bat.insert(s,5,5);
#	da_a := bat.insert(s,3,3);
#	ea_a := bat.insert(s,4,2);
#	fa_a := bat.insert(s,2,1);
##	mil.line("insert(s,1,1);insert(s,4,2); bat.insert(s,4,3);");
#	ga_a := bat.insert(s,1,1);
#	ha_a := bat.insert(s,4,2);
#	ia_a := bat.insert(s,4,3);
##	mil.line("printf(\"#~BeginVariableOutput~#\\n\");");
#	ja_a := io.printf("#~BeginVariableOutput~#\n");
##	mil.line("sort(s).print();");
#	ka_a := algebra.sort(s);
#	la_a := io.print(ka_a);
##	mil.line("printf(\"#~EndVariableOutput~#\\n\");");
#	ma_a := io.printf("#~EndVariableOutput~#\n");
##	mil.line("sortHT(s).print();");
#	na_a := algebra.sortHT(s);
#	oa_a := io.print(na_a);
##	mil.line("sortHT(s).print();");
#	na := algebra.sortHT(s);
#	oa_a := io.print(na);
##	mil.line("# right->left shift + right boundary;\n");
#	s := bat.new(nil:int,nil:int);
##	mil.line("insert(s,2,1);insert(s,4,1); bat.insert(s,3,1); insert(s,5,1);");
#	pa_a := bat.insert(s,2,1);
#	qa_a := bat.insert(s,4,1);
#	ra_a := bat.insert(s,3,1);
#	sa_a := bat.insert(s,5,1);
##	mil.line("insert(s,6,1);insert(s,4,2);insert(s,1,1);");
#	ta_a := bat.insert(s,6,1);
#	ua_a := bat.insert(s,4,2);
#	va_a := bat.insert(s,1,1);
##	mil.line("printf(\"#~BeginVariableOutput~#\\n\");");
#	wa_a := io.printf("#~BeginVariableOutput~#\n");
##	mil.line("sort(s).print();");
#	xa_a := algebra.sort(s);
#	ya_a := io.print(xa_a);
##	mil.line("printf(\"#~EndVariableOutput~#\\n\");");
#	ab_a := io.printf("#~EndVariableOutput~#\n");
##	mil.line("sortHT(s).print();");
#	bb_a := algebra.sortHT(s);
#	cb_a := io.print(bb_a);
##	mil.line("quit();");
#	db_a := clients.quit();
#
function user.main():void;	# 0  (main:void)
# Monet Mil to Mal compiler 	# 1  (_1:str)
# Copyright (c) 2001-2004, CWI. All rights reserved. 	# 2  (_2:str)
#Predefined code segment 	# 3  (_3:str)
#The compiler can not guarantee an accurate compilation, 	# 4  (_4:str)
#because MIL unlike MAL is a dynamically typed language. 	# 5  (_5:str)
#A few guidelines to maximize usefullness. 	# 6  (_6:str)
#- make the type of variables explicit, in particular 'nil' 	# 7  (_7:str)
#- upon advice of M2m to remap identifiers, change it in your program directly 	# 8  (_8:str)
#use the "mil_schema" for additional support routines 	# 9  (_9:str)
#	io.print("setoid(oid(20000000));"); 	# 10  (_10:str)
    aa_a := calc.oid(20000000);	# 11 CALCint2oid (aa_a:oid)<-(_12:int)
    ba_a := calc.setoid(aa_a);	# 12 CALCsetoidInc (ba_a:oid)<-(aa_a:oid)
#	io.print("# Sorting activities\n"); 	# 13  (_14:str)
#	io.print("# left->right shift + left boundary;\n"); 	# 14  (_15:str)
    s := bat.new(nil:int,nil:int);	# 15 CMDBATnew (s:bat[:int,:int])<-(_17:int)(_17:int)
#	io.print("insert(s,5,5);insert(s,3,3);insert(s,4,2);insert(s,2,1);"); 	# 16  (_18:str)
    ca_a := bat.insert(s,5,5);	# 17 BKCinsert_bun (ca_a:void)<-(s:bat[:int,:int])(_20:int)(_20:int)
    da_a := bat.insert(s,3,3);	# 18 BKCinsert_bun (da_a:void)<-(s:bat[:int,:int])(_22:int)(_22:int)
    ea_a := bat.insert(s,4,2);	# 19 BKCinsert_bun (ea_a:void)<-(s:bat[:int,:int])(_24:int)(_25:int)
    fa_a := bat.insert(s,2,1);	# 20 BKCinsert_bun (fa_a:void)<-(s:bat[:int,:int])(_25:int)(_27:int)
#	io.print("insert(s,1,1);insert(s,4,2); bat.insert(s,4,3);"); 	# 21  (_28:str)
    ga_a := bat.insert(s,1,1);	# 22 BKCinsert_bun (ga_a:void)<-(s:bat[:int,:int])(_27:int)(_27:int)
    ha_a := bat.insert(s,4,2);	# 23 BKCinsert_bun (ha_a:void)<-(s:bat[:int,:int])(_24:int)(_25:int)
    ia_a := bat.insert(s,4,3);	# 24 BKCinsert_bun (ia_a:void)<-(s:bat[:int,:int])(_24:int)(_22:int)
#	io.print("printf(\"#~BeginVariableOutput~#\\n\");"); 	# 25  (_32:str)
    ja_a := io.printf("#~BeginVariableOutput~#\n");	# 26 IOprint_str (ja_a:void)<-(_34:str)
#	io.print("sort(s).print();"); 	# 27  (_35:str)
    ka_a := algebra.sort(s);	# 28 ALGhsort (ka_a:bat[:int,:int])<-(s:bat[:int,:int])
    la_a := io.print(ka_a);	# 29 IOprint_val (la_a:void)<-(ka_a:bat[:int,:int])
#	io.print("printf(\"#~EndVariableOutput~#\\n\");"); 	# 30  (_38:str)
    ma_a := io.printf("#~EndVariableOutput~#\n");	# 31 IOprint_str (ma_a:void)<-(_40:str)
#	io.print("sortHT(s).print();"); 	# 32  (_41:str)
    na_a := algebra.sortHT(s);	# 33 ALGhtsort (na_a:bat[:int,:int])<-(s:bat[:int,:int])
    oa_a := io.print(na_a);	# 34 IOprint_val (oa_a:void)<-(na_a:bat[:int,:int])
#	io.print("sortHT(s).print();"); 	# 35  (_41:str)
    na := algebra.sortHT(s);	# 36 ALGhtsort (na:bat[:int,:int])<-(s:bat[:int,:int])
    oa_a := io.print(na);	# 37 IOprint_val (oa_a:void)<-(na:bat[:int,:int])
#	io.print("# right->left shift + right boundary;\n"); 	# 38  (_45:str)
    s := bat.new(nil:int,nil:int);	# 39 CMDBATnew (s:bat[:int,:int])<-(_17:int)(_17:int)
#	io.print("insert(s,2,1);insert(s,4,1); bat.insert(s,3,1); insert(s,5,1);"); 	# 40  (_46:str)
    pa_a := bat.insert(s,2,1);	# 41 BKCinsert_bun (pa_a:void)<-(s:bat[:int,:int])(_25:int)(_27:int)
    qa_a := bat.insert(s,4,1);	# 42 BKCinsert_bun (qa_a:void)<-(s:bat[:int,:int])(_24:int)(_27:int)
    ra_a := bat.insert(s,3,1);	# 43 BKCinsert_bun (ra_a:void)<-(s:bat[:int,:int])(_22:int)(_27:int)
    sa_a := bat.insert(s,5,1);	# 44 BKCinsert_bun (sa_a:void)<-(s:bat[:int,:int])(_20:int)(_27:int)
#	io.print("insert(s,6,1);insert(s,4,2);insert(s,1,1);"); 	# 45  (_51:str)
    ta_a := bat.insert(s,6,1);	# 46 BKCinsert_bun (ta_a:void)<-(s:bat[:int,:int])(_53:int)(_27:int)
    ua_a := bat.insert(s,4,2);	# 47 BKCinsert_bun (ua_a:void)<-(s:bat[:int,:int])(_24:int)(_25:int)
    va_a := bat.insert(s,1,1);	# 48 BKCinsert_bun (va_a:void)<-(s:bat[:int,:int])(_27:int)(_27:int)
#	io.print("printf(\"#~BeginVariableOutput~#\\n\");"); 	# 49  (_32:str)
    wa_a := io.printf("#~BeginVariableOutput~#\n");	# 50 IOprint_str (wa_a:void)<-(_34:str)
#	io.print("sort(s).print();"); 	# 51  (_35:str)
    xa_a := algebra.sort(s);	# 52 ALGhsort (xa_a:bat[:int,:int])<-(s:bat[:int,:int])
    ya_a := io.print(xa_a);	# 53 IOprint_val (ya_a:void)<-(xa_a:bat[:int,:int])
#	io.print("printf(\"#~EndVariableOutput~#\\n\");"); 	# 54  (_38:str)
    ab_a := io.printf("#~EndVariableOutput~#\n");	# 55 IOprint_str (ab_a:void)<-(_40:str)
#	io.print("sortHT(s).print();"); 	# 56  (_41:str)
    bb_a := algebra.sortHT(s);	# 57 ALGhtsort (bb_a:bat[:int,:int])<-(s:bat[:int,:int])
    cb_a := io.print(bb_a);	# 58 IOprint_val (cb_a:void)<-(bb_a:bat[:int,:int])
#	io.print("quit();"); 	# 59  (_62:str)
    db_a := clients.quit();	# 60 CLTquitDefault (db_a:void)
end main;	# 61  
#~BeginVariableOutput~#
#-----------------#
# t	h	  # name
# int	int	  # type
#-----------------#
[ 1,	  1	  ]
[ 2,	  1	  ]
[ 3,	  3	  ]
[ 4,	  3	  ]
[ 4,	  2	  ]
[ 4,	  2	  ]
[ 5,	  5	  ]
#~EndVariableOutput~#
#-----------------#
# h	t	  # name
# int	int	  # type
#-----------------#
[ 1,	  1	  ]
[ 2,	  1	  ]
[ 3,	  3	  ]
[ 4,	  2	  ]
[ 4,	  2	  ]
[ 4,	  3	  ]
[ 5,	  5	  ]
#-----------------#
# h	t	  # name
# int	int	  # type
#-----------------#
[ 1,	  1	  ]
[ 2,	  1	  ]
[ 3,	  3	  ]
[ 4,	  2	  ]
[ 4,	  2	  ]
[ 4,	  3	  ]
[ 5,	  5	  ]
#~BeginVariableOutput~#
#-----------------#
# t	h	  # name
# int	int	  # type
#-----------------#
[ 1,	  1	  ]
[ 2,	  1	  ]
[ 3,	  1	  ]
[ 4,	  1	  ]
[ 4,	  2	  ]
[ 5,	  1	  ]
[ 6,	  1	  ]
#~EndVariableOutput~#
#-----------------#
# h	t	  # name
# int	int	  # type
#-----------------#
[ 1,	  1	  ]
[ 2,	  1	  ]
[ 3,	  1	  ]
[ 4,	  1	  ]
[ 4,	  2	  ]
[ 5,	  1	  ]
[ 6,	  1	  ]

# 07:27:19 >  
# 07:27:19 >  Done.
# 07:27:19 >