… | |
… | |
45 | |
45 | |
46 | void add_result(int data, double *k, int ndims) |
46 | void add_result(int data, double *k, int ndims) |
47 | { |
47 | { |
48 | AV *r = newAV (); |
48 | AV *r = newAV (); |
49 | |
49 | |
|
|
50 | av_push (r, c2sv (k, ndims)); |
50 | av_push (r, newSViv (data)); |
51 | av_push (r, newSViv (data)); |
51 | av_push (r, c2sv (k, ndims)); |
|
|
52 | |
52 | |
53 | av_push (searchres, newRV_noinc ((SV *)r)); |
53 | av_push (searchres, newRV_noinc ((SV *)r)); |
54 | } |
54 | } |
55 | |
55 | |
56 | MODULE = Tree::M PACKAGE = Tree::M::MT |
56 | MODULE = Tree::M PACKAGE = Tree::M |
57 | |
57 | |
58 | PROTOTYPES: ENABLE |
58 | PROTOTYPES: ENABLE |
59 | |
59 | |
60 | PMT * |
60 | PMT * |
61 | new(class, ndims, min = 0.0, max = 255.0, steps = 65536.0) |
61 | _new(class, ndims, min = 0.0, max = 255.0, steps = 256.0, pagesize = 4096) |
62 | int ndims |
62 | int ndims |
63 | double min |
63 | double min |
64 | double max |
64 | double max |
65 | double steps |
65 | double steps |
|
|
66 | unsigned int pagesize |
66 | CODE: |
67 | CODE: |
67 | RETVAL = new PMT(ndims, min, max, steps); |
68 | RETVAL = new PMT(ndims, min, max, steps, pagesize); |
68 | OUTPUT: |
69 | OUTPUT: |
69 | RETVAL |
70 | RETVAL |
70 | |
71 | |
71 | void |
72 | void |
72 | PMT::create(path) |
73 | PMT::create(path) |
… | |
… | |
110 | THIS->top(sv2c(k, THIS->ndims), n); |
111 | THIS->top(sv2c(k, THIS->ndims), n); |
111 | RETVAL = newRV_noinc ((SV *)searchres); |
112 | RETVAL = newRV_noinc ((SV *)searchres); |
112 | OUTPUT: |
113 | OUTPUT: |
113 | RETVAL |
114 | RETVAL |
114 | |
115 | |
|
|
116 | void |
|
|
117 | PMT::sync() |
|
|
118 | |
115 | int |
119 | int |
116 | PMT::maxlevel() |
120 | PMT::maxlevel() |
117 | |
121 | |
118 | void |
122 | void |
119 | PMT::DESTROY() |
123 | PMT::DESTROY() |