Mirror/zeek
1
0
Fork 0
mirror of https://github.com/zeek/zeek.git synced 2025-10-04 07:38:19 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 2

Fix val_size BIF tests and improve docs

Browse source 
Improve documentation of "order" BIF, and made the "val_size" tests
more portable.
This commit is contained in:
Daniel Thayer 2012-06-08 15:25:49 -05:00
parent 83dcbd4aa7
commit 18e61fcdfc
4 changed files with 13 additions and 10 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/bro.bif
View file

@ -1494,6 +1494,8 @@ function sort%(v: any, ...%) : any
## v: The vector whose order to compute.
##
## Returns: A ``vector of count`` with the indices of the ordered elements.
## For example, the elements of *v* in order are (assuming ``o``
## is the vector returned by ``order``): v[o[0]], v[o[1]], etc.
##
## .. bro:see:: sort
function order%(v: any, ...%) : index_vec

2
testing/btest/Baseline/bifs.val_size/out
View file

@ -1,2 +0,0 @@
72
72

3
testing/btest/bifs/order.bro
View file

@ -22,8 +22,7 @@ function myfunc2(a: double, b: double): int
event bro_init()
{
# TODO: these results don't make sense
# Tests without supplying a comparison function
local a1 = vector( 5, 2, 8, 3 );

16
testing/btest/bifs/val_size.bro
View file

@ -1,12 +1,16 @@
#
# @TEST-EXEC: bro %INPUT > out
# @TEST-EXEC: btest-diff out
# @TEST-EXEC: bro %INPUT
event bro_init()
{
local a = 1;
local b = T;
local a = T;
local b = 12;
local c: table[string] of addr = { ["a"] = 192.168.0.2, ["b"] = 10.0.0.2 };
if ( val_size(a) > val_size(b) )
exit(1);
if ( val_size(b) > val_size(c) )
exit(1);
print val_size(a);
print val_size(b);
}