Result:
found more than 1112 distributions - search limited to the first 2001 files matching your query
( run in 1.512 )
Algorithm-PageRank-XS
view release on metacpan or search on metacpan
=head2 --copy=I<suffix>
If this option is given, a copy of each file will be saved with
the given suffix that contains the suggested changes. This does
not require any external programs. Note that this does not
automagially add a dot between the original filename and the
suffix. If you want the dot, you have to include it in the option
argument.
If neither C<--patch> or C<--copy> are given, the default is to
simply print the diffs for each file. This requires either
$self =~ s/^SKIP.*(?=^__DATA__)/SKIP
if (\@ARGV && \$ARGV[0] eq '--unstrip') {
eval { require Devel::PPPort };
\$@ and die "Cannot require Devel::PPPort, please install.\\n";
if (\$Devel::PPPort::VERSION < $VERSION) {
die "$0 was originally generated with Devel::PPPort $VERSION.\\n"
. "Your Devel::PPPort is only version \$Devel::PPPort::VERSION.\\n"
. "Please install a newer version, or --unstrip will not work.\\n";
}
Devel::PPPort::WriteFile(\$0);
exit 0;
}
print <<END;
Sorry, but this is a stripped version of \$0.
To be able to use its original script and doc functionality,
please try to regenerate this file using:
\$^X \$0 --unstrip
END
Algorithm-Pair-Best2
view release on metacpan or search on metacpan
distribute and/or modify the software.
Also, for each author's protection and ours, we want to make certain
that everyone understands that there is no warranty for this free
software. If the software is modified by someone else and passed on, we
want its recipients to know that what they have is not the original, so
that any problems introduced by others will not reflect on the original
authors' reputations.
The precise terms and conditions for copying, distribution and
modification follow.
5. By copying, distributing or modifying the Program (or any work based
on the Program) you indicate your acceptance of this license to do so,
and all its terms and conditions.
6. Each time you redistribute the Program (or any work based on the
Program), the recipient automatically receives a license from the original
licensor to copy, distribute or modify the Program subject to these
terms and conditions. You may not impose any further restrictions on the
recipients' exercise of the rights granted herein.
7. The Free Software Foundation may publish revised and/or new versions
recipients of the item may redistribute it under the same conditions they
received it.
1. You may make and give away verbatim copies of the source form of the
Standard Version of this Package without restriction, provided that you
duplicate all of the original copyright notices and associated disclaimers.
2. You may apply bug fixes, portability fixes and other modifications derived
from the Public Domain or from the Copyright Holder. A Package modified in such
a way shall still be considered the Standard Version.
Algorithm-Pair-Swiss
view release on metacpan or search on metacpan
Revision history for Perl extension Algorithm::Pair::Swiss.
0.1 2006-06-10
- original version; unable to handle odd number of parties
- and sadly I used 0.1 instead of 0.01 as the version number
0.11 2006-06-10
- algorithm fixed to also properly handle odd number of parties
- some corrections to the documentation
Algorithm-Paxos
view release on metacpan or search on metacpan
distribute and/or modify the software.
Also, for each author's protection and ours, we want to make certain
that everyone understands that there is no warranty for this free
software. If the software is modified by someone else and passed on, we
want its recipients to know that what they have is not the original, so
that any problems introduced by others will not reflect on the original
authors' reputations.
The precise terms and conditions for copying, distribution and
modification follow.
5. By copying, distributing or modifying the Program (or any work based
on the Program) you indicate your acceptance of this license to do so,
and all its terms and conditions.
6. Each time you redistribute the Program (or any work based on the
Program), the recipient automatically receives a license from the original
licensor to copy, distribute or modify the Program subject to these
terms and conditions. You may not impose any further restrictions on the
recipients' exercise of the rights granted herein.
7. The Free Software Foundation may publish revised and/or new versions
recipients of the item may redistribute it under the same conditions they
received it.
1. You may make and give away verbatim copies of the source form of the
Standard Version of this Package without restriction, provided that you
duplicate all of the original copyright notices and associated disclaimers.
2. You may apply bug fixes, portability fixes and other modifications derived
from the Public Domain or from the Copyright Holder. A Package modified in such
a way shall still be considered the Standard Version.
Algorithm-Permute
view release on metacpan or search on metacpan
lib/Algorithm/Permute.pm view on Meta::CPAN
=back
=head1 AUTHOR
Edwin Pratomo <edpratomo@cpan.org> was the original author.
Stephan Loyd <sloyd@cpan.org> is co-maintainer after version 0.12.
The object oriented interface is taken from Tom Phoenix's C<List::Permutor>.
Robin Houston <robin@kitsite.com> invented and contributed the callback
Algorithm-Points-MinimumDistance
view release on metacpan or search on metacpan
lib/Algorithm/Points/MinimumDistance.pm view on Meta::CPAN
my $nn = Algorithm::Points::MinimumDistance->new( ... );
my $nn_dist = $nn->distance( point => [1, 4] );
Returns the distance between the specified point and its nearest
neighbour. The point should be one of your original set. There is no
check that this is the case. Note that if a point has no particularly
close neighbours, then C<boxsize> will be returned instead.
=cut
Algorithm-Prefixspan
view release on metacpan or search on metacpan
Revision history for Perl extension Algorithm-Prefixspan
0.04 2015-06-18T03:43:35Z
- original version
Algorithm-QuadTree-XS
view release on metacpan or search on metacpan
0.02 Tue May 31 2022
- fix compilation on threaded perls
0.01 Mon May 30 2022
- original version
Algorithm-QuadTree
view release on metacpan or search on metacpan
- Added test suite
- Added github repository and bugtracker
- Maintenance-related changes
0.1 Mon Aug 9 13:56:27 2004
- original version; created by h2xs 1.21 with options
-AX -n Algorithm::QuadTree
Algorithm-QuineMcCluskey
view release on metacpan or search on metacpan
for row_dom(), col_dom(), and purge_essentials()). Always
pass in the argument -- it's less confusing that way.
- Trim Util.pm of tobits() -- it's embedded in BUILD now.
2014-08-19
- More work in find_primes(). An array slice in a hash isn't
working as originally coded (I seem to recall the rules
changing some time ago). Changed it to two statements for
now.
2014-07-07
- After looking over the labeling in the run.t file, added
a new attribute, "title". We can now say what the A::QMcC
object actually represents.
- Broke up run.t into separate test files. The original
file was compact and in theory easy to add to, but I was
having trouble figuring out what was causing my Moose
errors. Plus, there were too many eval calls in the code.
- The original code changed the minterms, maxterms, and
dontcares attributes from the passed-in list of decimal
into bitstrings, and saved them back in the attributes.
We can't do that now, because Moose has set those fields
typed as 'ArrarRef[Int]'.
So, set up three new fields that represent the three fields
Algorithm-RabinKarp
view release on metacpan or search on metacpan
lib/Algorithm/RabinKarp.pm view on Meta::CPAN
=item new($k, [FileHandle|Scalar|Coderef] )
Creates a new hash generator. If you provide a callback function, it must
return the next integer value in the stream. Additionally, you may
return the original position of the value in the stream (ie, you may have been
filtering characters out because they're redundant.)
=cut
sub new {
Algorithm-RandomMatrixGeneration
view release on metacpan or search on metacpan
- Stores the matrix in sparse format. That is, not every value
of the returned array is defined but only non-zero values are
stored in the matrix.
0.01 Sat Mar 18 20:06:48 2006
- original version; created by h2xs 1.23 with options
-AXc -n Algorithm::RandomMatrixGeneration
Algorithm-RateLimiter-TokenBucket
view release on metacpan or search on metacpan
CONTRIBUTING.md view on Meta::CPAN
```
4. **Make Your Changes**: Write your code. Please adhere to the existing coding style and add comments to new or complex logic.
5. **Test Your Changes**: A pull request is far more likely to be accepted if it includes tests. If you add new functionality, please add a corresponding test case.
6. **Update the Changelog**: Add an entry to the `[Unreleased]` section of `CHANGELOG.md` describing your change.
7. **Submit a Pull Request**: Push your branch to your fork and open a pull request against the `main` branch of the original repository. Please provide a clear description of your changes and link to the relevant issue (e.g., `Fixes #123`).
Algorithm-RectanglesContainingDot
view release on metacpan or search on metacpan
0.02 Mar 9, 2007
- use Algorithm::RectanglesContainingDot_XS when available
0.01 Tue Mar 6 16:56:02 2007
- original version; created by h2xs 1.23 with options
-AXn Algorithm::RectanglesContainingDot
Algorithm-RectanglesContainingDot_XS
view release on metacpan or search on metacpan
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-Retry
view release on metacpan or search on metacpan
lib/Algorithm/Retry.pm view on Meta::CPAN
summary => 'How much to add randomness',
schema => ['float*', between=>[0, 0.5]],
description => <<'_',
If you set this to a value larger than 0, the actual delay will be between a
random number between original_delay * (1-jitter_factor) and original_delay *
(1+jitter_factor). Jitters are usually added to avoid so-called "thundering
herd" problem.
_
},
lib/Algorithm/Retry.pm view on Meta::CPAN
=item * B<jitter_factor> => I<float>
How much to add randomness.
If you set this to a value larger than 0, the actual delay will be between a
random number between original_delay * (1-jitter_factor) and original_delay *
(1+jitter_factor). Jitters are usually added to avoid so-called "thundering
herd" problem.
=item * B<max_attempts> => I<uint> (default: 0)
Algorithm-SAT-Backtracking
view release on metacpan or search on metacpan
distribute and/or modify the software.
Also, for each author's protection and ours, we want to make certain
that everyone understands that there is no warranty for this free
software. If the software is modified by someone else and passed on, we
want its recipients to know that what they have is not the original, so
that any problems introduced by others will not reflect on the original
authors' reputations.
The precise terms and conditions for copying, distribution and
modification follow.
5. By copying, distributing or modifying the Program (or any work based
on the Program) you indicate your acceptance of this license to do so,
and all its terms and conditions.
6. Each time you redistribute the Program (or any work based on the
Program), the recipient automatically receives a license from the original
licensor to copy, distribute or modify the Program subject to these
terms and conditions. You may not impose any further restrictions on the
recipients' exercise of the rights granted herein.
7. The Free Software Foundation may publish revised and/or new versions
recipients of the item may redistribute it under the same conditions they
received it.
1. You may make and give away verbatim copies of the source form of the
Standard Version of this Package without restriction, provided that you
duplicate all of the original copyright notices and associated disclaimers.
2. You may apply bug fixes, portability fixes and other modifications derived
from the Public Domain or from the Copyright Holder. A Package modified in such
a way shall still be considered the Standard Version.
Algorithm-SISort
view release on metacpan or search on metacpan
0.10 Sun Feb 18 23:31 GMT 2001
- renamed to Algorithm::SISort
- initial packaging and release
0.01 Sun Feb 18 13:28 GMT 2001
- original version; created by h2xs 1.20 with options
-AXn Sort::SiSort
Algorithm-SVM
view release on metacpan or search on metacpan
Revision history for Perl extension Algorithm::SVM.
0.01 Thu Jun 27 11:16:17 2002
- original version; created by h2xs 1.21 with options
-n Algorithm::SVM svm.h
0.02 Mon Sep 23 13:12:51 EDT 2002
- compilation errors on Mac OS X fixed, other bug fixes
and code cleanups.
Algorithm-SVMLight
view release on metacpan or search on metacpan
- Added the get_linear_weights() method, which returns an array of
the trained weights used in a linear model.
0.01 Thu Jul 7 11:45:21 2005
- original version
Algorithm-Scale2x
view release on metacpan or search on metacpan
0.02 Tue May 15 2007
- fix test suite. "@x = qw(0) x 4;" doesn't work on perls <= 5.8.7
0.01 Mon May 14 2007
- original version
Algorithm-Shape-RandomTree
view release on metacpan or search on metacpan
distribute and/or modify the software.
Also, for each author's protection and ours, we want to make certain
that everyone understands that there is no warranty for this free
software. If the software is modified by someone else and passed on, we
want its recipients to know that what they have is not the original, so
that any problems introduced by others will not reflect on the original
authors' reputations.
The precise terms and conditions for copying, distribution and
modification follow.
5. By copying, distributing or modifying the Program (or any work based
on the Program) you indicate your acceptance of this license to do so,
and all its terms and conditions.
6. Each time you redistribute the Program (or any work based on the
Program), the recipient automatically receives a license from the original
licensor to copy, distribute or modify the Program subject to these
terms and conditions. You may not impose any further restrictions on the
recipients' exercise of the rights granted herein.
7. The Free Software Foundation may publish revised and/or new versions
recipients of the item may redistribute it under the same conditions they
received it.
1. You may make and give away verbatim copies of the source form of the
Standard Version of this Package without restriction, provided that you
duplicate all of the original copyright notices and associated disclaimers.
2. You may apply bug fixes, portability fixes and other modifications derived
from the Public Domain or from the Copyright Holder. A Package modified in such
a way shall still be considered the Standard Version.
Algorithm-SixDegrees
view release on metacpan or search on metacpan
Made some error messages more descriptive.
Improved documentation.
Added extra test: t/errors.t
Improved test coverage in other tests
[BUGS]
Fixed an issue where the origin keys were polluting internal
tables when an alternate source was defined.
0.01 Sat Feb 5 00:57:45 CST 2005 (svn r6)
[NOTES]
First version, released on an unsuspecting world.
Algorithm-SkipList
view release on metacpan or search on metacpan
0.02 Fri Nov 14 01:08:00 2003
- incorporated experimental code into module
- began writing initial test script
0.01 Fri Nov 14 00:50:00 2003
- original version; created by h2xs 1.21 with options
-X -n List::SkipList -v 0.01
0.00 Wed Nov 12 2003
- experimental versions, unreleased.
Algorithm-SlopeOne
view release on metacpan or search on metacpan
lib/Algorithm/SlopeOne.pm view on Meta::CPAN
L<Slope One|https://en.wikipedia.org/wiki/Slope_One> - Wikipedia article
=item *
L<Slope One Predictors for Online Rating-Based Collaborative Filtering|http://lemire.me/fr/abstracts/SDM2005.html> - original paper
=item *
L<Collaborative filtering made easy|http://www.serpentine.com/blog/2006/12/12/collaborative-filtering-made-easy/> - Python implementation by Bryan O'Sullivan (primary reference, test code)
Algorithm-Statistic
view release on metacpan or search on metacpan
=head2 --copy=I<suffix>
If this option is given, a copy of each file will be saved with
the given suffix that contains the suggested changes. This does
not require any external programs. Note that this does not
automagially add a dot between the original filename and the
suffix. If you want the dot, you have to include it in the option
argument.
If neither C<--patch> or C<--copy> are given, the default is to
simply print the diffs for each file. This requires either
$self =~ s/^SKIP.*(?=^__DATA__)/SKIP
if (\@ARGV && \$ARGV[0] eq '--unstrip') {
eval { require Devel::PPPort };
\$@ and die "Cannot require Devel::PPPort, please install.\\n";
if (eval \$Devel::PPPort::VERSION < $VERSION) {
die "$0 was originally generated with Devel::PPPort $VERSION.\\n"
. "Your Devel::PPPort is only version \$Devel::PPPort::VERSION.\\n"
. "Please install a newer version, or --unstrip will not work.\\n";
}
Devel::PPPort::WriteFile(\$0);
exit 0;
}
print <<END;
Sorry, but this is a stripped version of \$0.
To be able to use its original script and doc functionality,
please try to regenerate this file using:
\$^X \$0 --unstrip
END
Algorithm-StringHash-FromCSharp35-XS
view release on metacpan or search on metacpan
Revision history for Perl extension Algorithm::StringHash::FromCSharp35::XS.
0.01 Fri May 17 23:44:46 2013
- original version; created by h2xs 1.23 on my Mac
0.02 Mon May 20 18:16:40 2013
- bugfix: error calc
- add 01.t
0.03 Tue May 21 11:05:10 2013
- bugfix: error calc
Algorithm-TSort
view release on metacpan or search on metacpan
0.02 2012-10-12 MSK
- rewrite Makefile.PL for LICENCE info.
0.01 2010-09-21 MSK
- original version; created by h2xs 1.23 with options
-AXO -n Algorithm::TSort
Algorithm-TicketClusterer
view release on metacpan or search on metacpan
examples/retrieve_similar_tickets.pl view on Meta::CPAN
foreach my $ticket_id (sort { $retrieved_hash{$b} <=> $retrieved_hash{$a} }
keys %retrieved_hash) {
my $similarity_score = $retrieved_hash{$ticket_id};
print "\n\n\n --------- Retrieved ticket at similarity rank $rank (simlarity score: $similarity_score) ---------\n";
$clusterer->show_processed_ticket_clustering_data_for_given_id( $ticket_id );
$clusterer->show_original_ticket_for_given_id( $ticket_id );
$rank++;
}
Algorithm-TimelinePacking
view release on metacpan or search on metacpan
lib/Algorithm/TimelinePacking.pm view on Meta::CPAN
# Output shows minimum rooms needed, with no scheduling conflicts
=head2 Hadoop Job Timeline
The original use case - visualize MapReduce job execution:
my @jobs = (
[$start_epoch, $end_epoch, $job_id, $user, $map_tasks, $reduce_tasks],
...
);
( run in 1.512 second using v1.01-cache-2.11-cpan-cdf2f3d4e48 )