Result:
found more than 682 distributions - search limited to the first 2001 files matching your query
( run in 0.470 )
Algorithm-Diff
view release on metacpan or search on metacpan
return ($hunk->{"start1"} - $oldhunk->{"end1"} <= 1 ||
$hunk->{"start2"} - $oldhunk->{"end2"} <= 1);
}
# Prepend hunk arg1 to hunk arg0
# Note that arg1 isn't updated! Only arg0 is.
sub prepend_hunk {
my ($hunk, $oldhunk) = @_;
$hunk->{"start1"} = $oldhunk->{"start1"};
$hunk->{"start2"} = $oldhunk->{"start2"};
Algorithm-DistanceMatrix
view release on metacpan or search on metacpan
; manifest (after all generated files)
[Manifest] ; create MANIFEST
; before release
[CheckPrereqsIndexed] ; ensure prereqs are on CPAN
[CheckChangesHasContent] ; ensure Changes has been updated
[TestRelease] ; ensure t/ tests pass (including dynamic extra tests)
[ConfirmRelease] ; prompt before uploading
; releaser
[UploadToCPAN] ; uploads to CPAN
Algorithm-ExpectationMaximization
view release on metacpan or search on metacpan
lib/Algorithm/ExpectationMaximization.pm view on Meta::CPAN
L<https://engineering.purdue.edu/kak/Tutorials/ExpectationMaximization.pdf>.
The EM algorithm in our context reduces to an iterative invocation of the following
steps: (1) Given the current guess for the means and the covariances of the different
Gaussians in our mixture model, use Bayes' Rule to update the posterior class
probabilities at each of the data points; (2) Using the updated posterior class
probabilities, first update the class priors; (3) Using the updated class priors,
update the class means and the class covariances; and go back to Step (1). Ideally,
the iterations should terminate when the expected log-likelihood of the observed data
has reached a maximum and does not change with any further iterations. The stopping
rule used in this module is the detection of no change over three consecutive
iterations in the values calculated for the priors.
Algorithm-FEC
view release on metacpan or search on metacpan
int i;
gf mask;
char *Pp = allPp[GF_BITS] ;
mask = 1; /* x ** 0 = 1 */
gf_exp[GF_BITS] = 0; /* will be updated at the end of the 1st loop */
/*
* first, generate the (polynomial representation of) powers of \alpha,
* which are stored in gf_exp[i] = \alpha ** i .
* At the same time build gf_log[gf_exp[i]] = i .
* The first GF_BITS powers are simply bits shifted to the left.
Algorithm-LBFGS
view release on metacpan or search on metacpan
- <b>Callback interface</b>:
The library receives function and gradient values via a callback interface.
The library also notifies the progress of the optimization by invoking a
callback function. In the original implementation, a user had to set
function and gradient values every time the function returns for obtaining
updated values.
- <b>Thread safe</b>:
The library is thread-safe, which is the secondary gain from the callback
interface.
- <b>Cross platform.</b> The source code can be compiled on Microsoft Visual
Studio 2005, GNU C Compiler (gcc), etc.
Algorithm-LeakyBucket
view release on metacpan or search on metacpan
lib/Algorithm/LeakyBucket.pm view on Meta::CPAN
}
=head1 BUGS
Probably some. There is a known bug where if you are in an infinite loop you could move faster than
memcached could be updated remotely, so you'll likely at that point only bbe limted by the local
counters. I'm not sure how im going to fix this yet as this is in early development.
=head1 TODO
Will need to look at including some actual tests im thinking. Maybe once we get more real usage out
Algorithm-LibLinear
view release on metacpan or search on metacpan
lib/Algorithm/LibLinear.pm view on Meta::CPAN
=head2 find_parameters(data_set => $data_set, num_folds => $num_folds [, initial_cost => -1.0] [, initial_loss_sensitivity => -1.0] [, update => 0])
Finds the best parameters by N-fold cross validation. If C<initial_cost> or C<initial_loss_sensitivity> is a negative, the value is automatically calculated.
Works only for 3 solvers: C<'L2R_LR'>, C<'L2R_L2LOSS_SVC'> and C<'L2R_L2LOSS_SVR'>. Error will be thrown for otherwise.
When C<update> is set true, the instance is updated to use the found parameters. This behaviour is disabled by default.
Return value is an ArrayRef containing 3 values: found C<cost>, found C<loss_sensitivity> (only if solver is C<'L2R_L2LOSS_SVR'>) and mean accuracy of cross validation with the found parameters.
=head2 train(data_set => $data_set)
Algorithm-MasterMind
view release on metacpan or search on metacpan
2012-07-10 Juan J. Merelo Guervós <jjmerelo@gmail.com>
* lib/Algorithm/MasterMind.pm: Starting 0.4.1 with a minor version
change for A::E.
* Makefile.PL: Changing Clone to Clone::Fast, more updated.
2012-06-05 Juan J. Merelo Guervós <jjmerelo@gmail.com>
* lib/Algorithm/MasterMind/EvoD.pm (issue_next): Getting rid of
fixed-size consistent sets to use whatever stands unchanged for 5
Algorithm-MinPerfHashTwoLevel
view release on metacpan or search on metacpan
lib/Tie/Hash/MinPerfHashTwoLevel/OnDisk.pm view on Meta::CPAN
If it should prove impossible to construct a solution using the seed chosen
then a new one will be constructed deterministically from the old until a
solution is found (see L<max_tries>) (prior to version v0.10 this used rand()).
Should you wish to access the seed actually used for the final solution
then you can pass in a reference to a scalar containing your chosen seed.
The reference scalar will be updated after successful construction.
Thus both of the following are valid:
Tie::Hash::MinPerfHashTwoLevel::OnDisk->make_file(seed => "1234567812345678", ...);
Tie::Hash::MinPerfHashTwoLevel::OnDisk->make_file(seed => \my $seed= "1234567812345678", ...);
Algorithm-Networksort
view release on metacpan or search on metacpan
It could be argued that the module should be named
Algorithm::Networksort::Optimal, but 'optimal' has seven
letters and 'best' has four, so 'best' wins.
- Doug Hoyte provided code for an astonishing three more
algorithms: odd-even merge, odd-even transposition, and balanced.
- The example scripts in eg/ have been updated and in some
cases improved.
- Found untested cases (formats in particular) and added them
to the tests.
- SVG output is massively improved. The graphing example is now
HTML5 instead of XML, beginning circles now cover their line
Sun May 20 2012
- Really bad bug introduced in version 1.08 (text graph
options were checked for in the wrong hash) has been squashed.
1.10
Wed Mar 28 2012
- Finally organized changes (I had a hardware failure), and updated
the MANIFEST file to include the new JSON formatted META files.
Ready for release to CPAN.
Tue Jan 31 2012
- Perl version requirement changed to 5.8.3 (from 5.6.0). Support
for 5.6.0 in various perl development tools is being dropped,
Algorithm-Nhash
view release on metacpan or search on metacpan
Revision history for Algorithm-Nhash
0.002 2011-05-13 18:36:03 Europe/London
updated distribution to use Dist::Zilla
Algorithm-QuineMcCluskey
view release on metacpan or search on metacpan
- We now use Logic::Minimizer as a base class.
- Consequently, removed attributes and methods that are
now in Logic::Minimizer, and are provided automatically.
- Use L::M's catch_errors() for attribute validation.
- Update Build.PL with Logic::Minimizer requirement.
- And updated the version number everywhere.
0.19
2019-07-31
- There was more processing than needed in least_covered() to do
what was basically a find-the-minimum loop, plus it was
Algorithm-RectanglesContainingDot_XS
view release on metacpan or search on metacpan
Revision history for Perl extension Algorithm::RectanglesContainingDot_XS.
0.02 Mar 11, 2007
- updated to work under perl 5.6.x
- docs updated
0.01 Thu Mar 8 10:16:35 2007
- original version; created by h2xs 1.23 with options
-An Algorithm::RectanglesContainingDot_XS
Algorithm-SAT-Backtracking
view release on metacpan or search on metacpan
t/01_backtrack.t view on Meta::CPAN
= { pink => 1, red => 0, purple => 0, green => 0, yellow => 1 };
my $new_model = $agent->update( $t_model, 'foobar', 1 );
is( $t_model->{foobar}, undef, "old model doesn't have 'foobar'" );
$new_model->{test} = 0;
is( $t_model->{test}, undef, "old model it's not affected by new one" );
is( $new_model->{foobar}, 1, "new model was updated" );
};
# Testing solve
subtest "solve()" => sub {
my $variables = [ 'blue', 'green', 'yellow', 'pink', 'purple' ];
Algorithm-SISort
view release on metacpan or search on metacpan
the path up to the .pm file to process in the Makefile.
- Updated my email address in the documentation
0.12 Jun 01 2001
- ran the documentation files through a spell checker
- updated package to use Inline 0.40's Inline::MakeMaker
The package now requires Inline v 0.40 to install
0.11 Mon Feb 19 12:58 GMT 2001
- added time zones to the Changelog
- changed Sort() to only copy the input array once.
Algorithm-SVMLight
view release on metacpan or search on metacpan
t/02-custom.t view on Meta::CPAN
my $i = 0;
$s->ranking_callback( sub {$i++} );
$s->train;
ok $s->is_trained, "Train model";
is $i, 3, "\$i should be updated during training";
# Try a fake ranking callback
$i = 0;
$s->ranking_callback( sub {my($r1, $r2) = @_; $_= abs($r1-$r2); $i += $_; $_} );
$s->train;
Algorithm-SkipList
view release on metacpan or search on metacpan
1.01 Fri Sep 3 2004
- minor correction to distribution
1.00 Fri Sep 3 2004
- renamed distribution to Algorithm-SkipList
- updated version numbers
- added deprecation note to List::SkipList abstract
0.73_01 Mon Aug 2 2004
- renamed module to Algorithm::SkipList from List::SkipList
- Node and Header types are now in separate files
0.72 Wed Jun 30 2004
- removed List::SkipList::Null type and $NULL variable
- moved Test::More from requires to build_requires parameter
0.71 Sat Jun 12 2004
- updated POD
- redesigned internals of first_key, next_key and last_key
* delete now resets last_key
* the parameters for last_key are changed (this interface was
meant for internal use only, however)
- added index_by_key, key_by_index and value_by_index methods
- updated documentation on p and k parameters
- added support for k parameter
- redid probability distribution calculations
- fixed bug in benchmarks (was "existing" bogus keys)
- added support for duplicate values
- added find_duplicates method
- append calls _adjust_level_threshold
- minor optimizations of node class
* renamed internal key {LASTNODE} to {LIST_END} so as not to
be confused with last_key method
- _first_node is not autoloading since it's now used by first_key
- updated POD to reflect issue with undefined values
- improved copy method (undef values handled)
- copy method can accept an argument: copy from key
* copy method no longer resets first_key
* _first_node no longer returns a finger (it was never used)
- updated documentation on values for max_level and p
- corrected typos in documentation
- added tests for deleted greatest bug
- fixed bug with greatest method when deleting last node
- added _greatest_node method to find the last node as needed
- other minor code changes
* max_level cannot be greater than 32 (cleaner code)
- increased coverage of "heavy" test script
- minor updates to all test scripts
0.65 Thu June 3 2004
- updated README
0.64 Thu June 3 2004
- updated examples in documentation of custom node
- minor optimizations and code cleanup
- commented-out call to prev() in _debug
- removed use of Carp::Assert in tests
- redesigned benchmark script and included parse-out.pl
- updated Benchmark.txt
- updated README
0.63 Fri May 28 2004
- The default value of P is now 0.25, which appears to yield
better results in tests.
* renamed _random_level to _new_node_level
- SIZE_THRESHOLD/SIZE_LEVEL now decrease with deletions
- additional minor optimizations and code cleanup
- optimizations of Header and Null node types
- updated tests
- Benchmark: re-commented-out delete test for Tree::RedBlack
(which was accidentally uncommented in v0.62)
0.62 Tue May 18 2004
- fixed typo in (commented-out) assertion
- additional minor optimizations and code cleanup
- updated tests
- corrected README
0.61 Mon May 17 2004
* find no longer returns a finger in array context
* header is now a special subclass of List::SkipList::Node
- added null() method to return global null node
- a lot of minor code optimizations
- added comments
- maximum level of new nodes changed so that it is based on size
of list
- updated Benchmark.txt file
0.60 Sat Apr 24 2004
- updates to POD
- cleaned up comments
- added next function
- added experimental hooks to implement prev and prev_key methods
- added stub prev_key method
- bug fix: reset method called during copy method
- added more tests to heavy test script
* renamed find to find_with_finger and added find for searches
which do not return updated fingers
* renamed _search to _search_with_finger and added _search for
searches which do not return updated fingers
- modified next_key test to check for initial key of "0"
- removed if (CACHE_INSERT_FINGERS) tests
- additional optimizations and code cleanup
- added test to search for non-existent keys in Benchmark.pl
- replaced explicit package names with __PACKAGE__ placeholder
0.32 Mon Mar 15 2004
- renamed test.pl to t/01-SkipList.t
- added Build.PL to distribution
- updated README
- corrected and updated POD
0.31 Fri Feb 13 2004
- removed memoized node example from POD
- reformatted E-mail addresses in various files to foil
spam harvesters
- changes calls to keys to CORE::keys [Bug 5317]
- added version to List::SkipList::Node
- corrected errors in POD formatting
- corrected and updated POD
- added META.yml file to distribution
0.30 Tue Dec 2 2003
- ability to tie hashes
- made some methods autoloading
0.11 Sun Nov 16 2003
- modified test script to better check next_key function
- bug fix: next_key did not check that $last_key existed
0.10 Sat Nov 15 01:11:00 2003
- updated test script appropriately
- added first_key and next_key methods
- added ability to customize List::SkipList::Node
- moved debug method to after __END__ block
- renamed random_level to _random_level
- changed type checking to use isa() method
- updated documentation
0.02 Fri Nov 14 01:08:00 2003
- incorporated experimental code into module
- began writing initial test script
Algorithm-SpatialIndex
view release on metacpan or search on metacpan
lib/Algorithm/SpatialIndex/Strategy/OctTree.pm view on Meta::CPAN
}
else {
# bucket full, need to add new layer of nodes and split the bucket
$self->_split_node($node, $bucket);
# refresh data that will have changed:
$node = $storage->fetch_node($node->id); # has updated subnode ids
$subnodes = $node->subnode_ids;
# Now we just continue with the normal subnode checking below:
}
}
} # end scope
Algorithm-Toy-HashSC
view release on metacpan or search on metacpan
lib/Algorithm/Toy/HashSC.pm view on Meta::CPAN
Adds the given key and value to the hash. The I<key> may be an object
with a B<hashcode> method; this method should return a number that for
the expected set of key values results in evenly distributed numbers
across the given B<modulus>. If the key already exists in the hash, the
value will be updated.
=item B<take> I<key>
Deletes the given key/value pair from the hash, and returns the value. A
destructive version of B<get>.
Algorithm-VectorClocks
view release on metacpan or search on metacpan
lib/Algorithm/VectorClocks.pm view on Meta::CPAN
=head2 order_vector_clocks({ $id => $vc, ... })
Returns the list of server IDs in order (the latest comes first).
The arguments can be a HASH reference of server IDs and their vector clocks.
If some vector clocks are same or independently updated (cannot be ordered),
they are packed into single element as an array reference.
In the following example, vector clocks of A and C are independent with each other,
and B is older than them:
@res = order_vector_clocks({ A => $vc_a, B => $vc_b, C => $vc_c });
Alien-AntTweakBar
view release on metacpan or search on metacpan
Revision history for Alien-AntTweakBar
0.03 2014-07-30
Repository URLs updated to PerlGameDev github account
Build on FreeBSD 10 was fixed
0.02 2014-07-12
The library now builds as static libary (.a).
Succesful tests has been reported on Linux, Win32 and FreeBSD.
POD documentation has been updated.
Fix build failures, and more precicely detect build failures
0.01 2014-06-28
Alien-Base-Dino
view release on metacpan or search on metacpan
corpus/libpalindrome/config.guess view on Meta::CPAN
http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.guess
and
http://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.sub
If $0 has already been updated, send the following data and any
information you think might be pertinent to config-patches@gnu.org to
provide the necessary information to handle your system.
config.guess timestamp = $timestamp
Alien-Base
view release on metacpan or search on metacpan
- Identical to 0.016_02 release, except alien_stage_install is
OFF by default (it was turned on for dev release 0.016_01,
and will be turned back on or after May 25).
0.016_02 Fri Apr 24, 2015
- Fix bug where ConfigData.pm was not updated after install to blib
(plicease gh#121)
0.016_01 Tue Apr 22, 2015
- alien_stage_install is now on by default
- Library files are added to packlist
- Note: released from "packlist" branch
0.001 Oct 9, 2012
- First Beta release!
- Documentation updated
- Better autogeneration of pkgconfig information (run4flat++)
0.000_022 Oct 8, 2012
- Major refactoring
- separate alien_{x}_commands where x = build, test, install
Alien-Build
view release on metacpan or search on metacpan
lib/Alien/Build/Plugin/Download/Negotiate.pm view on Meta::CPAN
if($self->url =~ /^http.*github.com.*releases$/)
{
Alien::Build->log('!! WARNING !! WARNING !!');
Alien::Build->log('!! WARNING !! It looks like this alien is using the regular download negotiator');
Alien::Build->log('plugin on a GitHub release page. This will typically not work due to changes');
Alien::Build->log('in the way GitHub release page works now. The Alien should instead be updated');
Alien::Build->log('to use the Download::GitHub plugin, which uses the GitHub API to find available');
Alien::Build->log('releases. See: https://metacpan.org/pod/Alien::Build::Plugin::Download::GitHub');
Alien::Build->log('!! WARNING !! WARNING !!');
}
Alien-CMake
view release on metacpan or search on metacpan
- Add IRC link to metadata
- update to cmake 3.9.1 on 64 bit Linux
- update to cmake 3.6.3 on 32 bit Linux
- update to cmake 3.9.1 on 32 bit windows
- Please use Alien::cmake3 instead, this distribution
may not be updated much longer
0.08 05/09/2016
- Prefer 64bit cmake on Linux x86_64 (rt#114240)
0.07 02/13/2016
Alien-Capstone
view release on metacpan or search on metacpan
- 0.04
- cpantesters failure fix
- 0.03
- added README and updated LICENSE
- 0.02
- added documentation
- 0.01
Alien-FreeImage
view release on metacpan or search on metacpan
src/Source/FreeImage/ZLibInterface.cpp view on Meta::CPAN
}
return dest_len;
}
/**
Update a running crc from source and return the updated crc, using the ZLib library.
If source is NULL, this function returns the required initial value for the crc.
@param crc Running crc value
@param source Source buffer
@param source_size Size of the source buffer, in bytes
Alien-GvaScript
view release on metacpan or search on metacpan
doc/html/AutoCompleter.html view on Meta::CPAN
<p>The dropdown list can be navigated through arrow keys. Selecting a
suggestion in the list is done either by a click, or by pressing the
<code>RETURN</code> key (this is handled by the
<i>Alien::GvaScript::ChoiceList</i> component of
GvaScript). Then the value of that suggestion fills the input field
value, dependent fields (if any) are updated, and the <code>onLegalValue</code>
event is triggered.</p>
<p>A number of variations on this behaviour may be controlled by the options
described below.</p>
</div>
doc/html/AutoCompleter.html view on Meta::CPAN
} } );</pre>
<p>Inline object that specifies dependencies between the field
controlled by the autocompleter, and other fields in the same form.
When leaving the autocompleted field (<code>onBlur</code>), the dependent fields
will be updated automatically. This only works for autocompleters
in strict mode.</p>
<p>Each key in the inline object specifies the name of a field related
to the autocompleted field. If field names are in dotted notation,
then the related field is taken as a path relative to the autocompleted
field : so for example if the autocompleted field has name
Alien-IUP
view release on metacpan or search on metacpan
- using LWP::Simple instead of File::Fetch for download
- using Digest::file instead of Digest::SHA
0.201 2011-02-18
- IMPORTANT: the first stable release with iup-3.4
- dev build: switch to iup-3.4 + updated im, cd
0.116 2011-02-10
- IMPORTANT: the last release with iup-3.3
- Unix: if not enough libs found - show more debug info
- not building libs that are currently not used by IUP
- less build messages by default
- dev build: with the latest CVS sources
0.113 2011-01-05
- same as 0.112_01 + updated TODO
- fixing -lstdc++ issue on non-gcc compilers
0.112 2010-12-30
- skipping iuptuio on solaris - http://www.cpantesters.org/cpan/report/c39d9264-0ae3-11e0-afb0-adca6bb533f3
- skipping iuptuio on cygwin (not only gcc3)
- info.t fix
0.107 2010-12-07
- iuptuio target added (Unix.pm)
- more debug info saved to config_data
- updated im-INC-order.diff
0.106 2010-12-02
- updated cd-GTK_BASE.diff
0.105 2010-12-02
- important fix: GTK2 + pkg-config
- improved build target autoselection
0.104 2010-12-01
- updated iup-GTK_WIDGET.diff
0.103 2010-12-01
- Motif/X11 build fix
- fix for http://www.cpantesters.org/cpan/report/ec6300d2-fb91-11df-a694-e2b03d723d5a
- require installed cairo for GTK2 build
- fixing netbsd failure (using USE_PKGCONFIG)
- webkit/webkit.h test (disabling iupweb if no webkit)
- patches for DragonFly BSD
- improved cygwin build
- new checksum for updated iup-3.3_Sources.tar.gz
- new builder for cygwin (separated from generic UNIX)
0.024 2010-11-14
- IMPORTANT: the last release with iup-3.2
- die if no GUI lib detected
Alien-Judy
view release on metacpan or search on metacpan
src/judy-1.0.5/ChangeLog view on Meta::CPAN
the entire library again.
1.0.2 Version (Jan 2006 ) by (twh)
o fixed assumption of signed char in test programs.
o updated sh_build
o fixed generation of man pages from html
o fixed 32-bit and 64-bit configure
1.0.1 Version (Dec 2004) by (twh)
( run in 0.470 second using v1.01-cache-2.11-cpan-05444aca049 )