Algorithm-BIT-XS
view release on metacpan or search on metacpan
lib/Algorithm/BIT/XS.pm view on Meta::CPAN
=head1 DESCRIPTIONA binary indexed tree is a data structure similar to an array of integers.The two main operations are updating an element and calculating aprefix sum, both of which run in time logarithmic in the size of the tree.=over=item Algorithm::BIT::XS->B<new>(I<$len>)Create a new binary indexed tree of length I<$len>. As binary indexedtrees are 1-indexed, its indexes are [1..I<$len>]. It is initiallyfilled with zeroes.=item $bit->B<clear>()Clears the binary indexed tree (sets all elements to 0).=item $bit->B<query>(I<$idx>)Returns the prefix sum I<$bit>[1] + I<$bit>[2] + ... + I<$bit>[I<$idx>].
lib/Algorithm/BIT2D/XS.pm view on Meta::CPAN
=head1 DESCRIPTIONA binary indexed tree is a data structure similar to an array of integers.The two main operations are updating an element and calculating aprefix sum, both of which run in time logarithmic in the size of the tree.=over=item Algorithm::BIT2D::XS->B<new>(I<$n>, I<$m>)Create a new 2D binary indexed tree of length I<$n> x I<$m>. As binaryindexed trees are 1-indexed, its indexes are [1..I<$n>][1..I<$m>].It is initially filled with zeroes.=item $bit->B<clear>()Clears the binary indexed tree (sets all elements to 0).=item $bit->B<query>(I<$i1>, I<$i2>)Returns the rectangle sum from I<$bit>[1][1] to I<$bit>[I<$i1>][I<$i2>].
mfree||5.007002|nmg_clear|||mg_copy|||mg_dup|||mg_find_mglob|||mg_findext|5.013008||pnmg_find|||nmg_free_type||5.013006|mg_free|||mg_get|||mg_length||5.005000|mg_localize|||mg_magical|||nmg_set|||mg_size||5.005000|mini_mktime||5.007002|nminus_v|||missingterm|||mode_from_discipline|||modkids|||more_bodies|||
reg_named_buff_all||5.009005|reg_named_buff_exists||5.009005|reg_named_buff_fetch||5.009005|reg_named_buff_firstkey||5.009005|reg_named_buff_iter|||reg_named_buff_nextkey||5.009005|reg_named_buff_scalar||5.009005|reg_named_buff|||reg_node|||reg_numbered_buff_fetch|||reg_numbered_buff_length|||reg_numbered_buff_store|||reg_qr_package|||reg_recode|||reg_scan_name|||reg_skipcomment|||nreg_temp_copy|||reganode|||regatom|||regbranch|||regclass_swash||5.009004|
unsharepvn||5.003070|unwind_handler_stack|||update_debugger_info|||upg_version||5.009005|usage|||utf16_textfilter|||utf16_to_utf8_reversed||5.006001|utf16_to_utf8||5.006001|utf8_distance||5.006000|utf8_hop||5.006000|nutf8_length||5.007001|utf8_mg_len_cache_update|||utf8_mg_pos_cache_update|||utf8_to_bytes||5.006001|utf8_to_uvchr_buf||5.015009|utf8_to_uvchr||5.007001|utf8_to_uvuni_buf||5.015009|utf8_to_uvuni||5.007001|utf8n_to_uvchr||5.007001|utf8n_to_uvuni||5.007001|utilize|||
yylex|||yyparse|||yyunlex|||yywarn|||);if(exists$opt{'list-unsupported'}) {my$f;for$f(sort{lc$acmplc$b}keys%API) {nextunless$API{$f}{todo};"$f ",'.'x(40-length($f))," ", format_version($API{$f}{todo}),"\n";}exit0;}# Scan for possible replacement candidatesmy(%replace,%need,%hints,%warnings,%depends);my$replace= 0;my($hint,$define,$function);
/* Older perls (<=5.003) lack AvFILLp */#ifndef AvFILLp# define AvFILLp AvFILL#endif#ifndef ERRSV# define ERRSV get_sv("@",FALSE)#endif/* Hint: gv_stashpvn* This function's backport doesn't support thelengthparameter, but* rather ignores it. Portability can only be ensuredifthelength* parameter is usedforspeed reasons, but thelengthcan always be* correctly computed from the string argument.*/#ifndef gv_stashpvn# define gv_stashpvn(str,len,create) gv_stashpv(str,create)#endif/* Replace: 1 */#ifndef get_cv# define get_cv perl_get_cv#endif
#endif#define my_strlcat DPPP_(my_my_strlcat)#define Perl_my_strlcat DPPP_(my_my_strlcat)#if defined(NEED_my_strlcat) || defined(NEED_my_strlcat_GLOBAL)Size_tDPPP_(my_my_strlcat)(char*dst, const char*src, Size_t size){Size_t used,length, copy;used = strlen(dst);length= strlen(src);if(size > 0 && used < size - 1) {copy = (length>= size - used) ? size - used - 1 :length;memcpy(dst + used, src, copy);dst[used + copy] ='\0';}returnused +length;}#endif#endif#if !defined(my_strlcpy)#if defined(NEED_my_strlcpy)static Size_t DPPP_(my_my_strlcpy)(char * dst, const char * src, Size_t size);static#elseextern Size_t DPPP_(my_my_strlcpy)(char * dst, const char * src, Size_t size);#endif#define my_strlcpy DPPP_(my_my_strlcpy)#define Perl_my_strlcpy DPPP_(my_my_strlcpy)#if defined(NEED_my_strlcpy) || defined(NEED_my_strlcpy_GLOBAL)Size_tDPPP_(my_my_strlcpy)(char*dst, const char*src, Size_t size){Size_tlength, copy;length= strlen(src);if(size > 0) {copy = (length>= size) ? size - 1 :length;memcpy(dst, src, copy);dst[copy] ='\0';}returnlength;}#endif#endif#ifndef PERL_PV_ESCAPE_QUOTE# define PERL_PV_ESCAPE_QUOTE 0x0001#endif#ifndef PERL_PV_PRETTY_QUOTE# define PERL_PV_PRETTY_QUOTE PERL_PV_ESCAPE_QUOTE
( run in 0.251 second using v1.01-cache-2.11-cpan-3cd7ad12f66 )