Free number lookup software for linux

number is a perl script that will print the English name of a number. One can print names of extremely large numbers (e.g. 1e1234567). Number can be run on the command line, or as a CGI script when run as number.cgi.

Number prints names in both the American and European naming system. It can also print the decimal expansion of a number in either naming system.

Number::Encode is a Perl module to encode bit strings into digit strings.

SYNOPSIS

use Number::Encode qw(nonuniform uniform);

Provides a mechanism to convert arbitrary bit-strings into numeric digit strings. The transformation can be uniform or non-uniform depending on the type of distribution of the numeric digits achieved.

The former approach is useful for security-related applications such as calling cards and the such, which require a uniform digit distribution. The algorythm used to generate uniform distributions, while deterministic, is more constly than the non-uniform variant.

This module is distributed under the same terms and warranty as Perl itself.

Scalar::Number is a Perl module with numeric aspects of scalars.

SYNOPSIS

use Scalar::Number qw(scalar_num_part);

$num = scalar_num_part($scalar);

use Scalar::Number qw(sclnum_is_natint sclnum_is_float);

if(sclnum_is_natint($value)) { ...
if(sclnum_is_float($value)) { ...

use Scalar::Number qw(sclnum_val_cmp sclnum_id_cmp);

@sorted_nums = sort { sclnum_val_cmp($a, $b) } @floats;
@sorted_nums = sort { sclnum_id_cmp($a, $b) } @floats;

This module is about the numeric part of plain (string) Perl scalars. A scalar has a numeric value, which may be expressed in either the native integer type or the native floating point type. Many values are expressible both ways, in which case the exact representation is insignificant. To fully understand Perl arithmetic it is necessary to know about both of these representations, and the differing behaviours of numbers according to which way they are expressible.
This module provides functions to extract the numeric part of a scalar, classify a number by expressibility, and compare numbers across representations.

Number::Phone::IE is a Perl module with Republic of Ireland-specific methods for Number::Phone.
SYNOPSIS
use Number::Phone;
$dermots_phone = Number::Phone->new(IE, 017654321);
METHODS
The following methods from Number::Phone are overridden:
is_valid
The number is valid within the national numbering scheme. It may or may not yet be allocated, or it may be reserved. Any number which returns true for any of the following methods will also be valid.
is_allocated
The number has been allocated to a telco for use. It may or may not yet be in use or may be reserved. Not currently implemented.
is_geographic
The number refers to a geographic area.
is_fixed_line
The number, when in use, can only refer to a fixed line.
is_mobile
The number, when in use, can only refer to a mobile phone.
is_pager
The number, when in use, can only refer to a pager.
is_tollfree
Callers will not be charged for calls to this number under normal circumstances.
is_specialrate
The number, when in use, attracts special rates. For instance, national dialling at local rates, or premium rates for services.
is_adult
The number, when in use, goes to a service of an adult nature, such as porn.
is_network_service
The number is some kind of network service such as a human operator, directory enquiries, emergency services etc
country_code
Returns 353.
regulator
Returns some text in an appropriate character set saying who the telecoms regulator is, with optional details such as their web site or phone number.
areacode
Return the area code - if applicable - for the number. If not applicable, returns undef.
areaname
Return the area name - if applicable - for the number, or undef.
subscriber
Return the subscriber part of the number
operator
Return the name of the telco operating this number, in an appropriate character set and with optional details such as their web site or phone number. Not currently implemented.
format
Return a sanely formatted version of the number, complete with IDD code, eg for the Irish number (021) 765-4321 it would return +353 21 7654321.
country
If the number is_international, return the two-letter ISO country code.
NYI
Version restrictions:
- Strictly sppeaking, this kind of duplication of the Number::Phone::UK class is bad. A tidy-up is in order, though it may emerge that a completely new implemantation is better.
- The results are only as accurate as my own investigations into current allocations. User feedback welcome.
- While the names of the nominal owners of mobile prefixes are given, number portability makes this information unreliable.

Test::Number::Delta is a Perl module to compare the difference between numbers against a given tolerance.

SYNOPSIS

# Import test functions
use Test::Number::Delta;

# Equality test with default tolerance
delta_ok( 1e-5, 2e-5, values within 1e-6);

# Inequality test with default tolerance
delta_not_ok( 1e-5, 2e-5, values not within 1e-6);

# Provide specific tolerance
delta_within( 1e-3, 2e-3, 1e-4, values within 1e-4);
delta_not_within( 1e-3, 2e-3, 1e-4, values not within 1e-4);

# Compare arrays or matrices
@a = ( 3.14, 1.41 );
@b = ( 3.15, 1.41 );
delta_ok( @a, @b, compare @a and @b );

# Set a different default tolerance
use Test::Number::Delta within => 1e-5;
delta_ok( 1.1e-5, 2e-5, values within 1e-5); # ok

# Set a relative tolerance
use Test::Number::Delta relative => 1e-3;
delta_ok( 1.01, 1.0099, values within 1.01e-3);

At some point or another, most programmers find they need to compare floating-point numbers for equality. The typical idiom is to test if the absolute value of the difference of the numbers is within a desired tolerance, usually called epsilon. This module provides such a function for use with Test::Harness. Usage is similar to other test functions described in Test::More. Semantically, the delta_within function replaces this kind of construct:

ok ( abs($p - $q) < $epsilon, $p is equal to $q ) or
diag "$p is not equal to $q to within $epsilon";

While theres nothing wrong with that construct, its painful to type it repeatedly in a test script. This module does the same thing with a single function call. The delta_ok function is similar, but either uses a global default value for epsilon or else calculates a relative epsilon on the fly so that epsilon is scaled automatically to the size of the arguments to delta_ok. Both functions are exported automatically.

Because checking floating-point equality is not always reliable, it is not possible to check the equal to boundary of less than or equal to epsilon. Therefore, Test::Number::Delta only compares if the absolute value of the difference is less than epsilon (for equality tests) or greater than epsilon (for inequality tests).

QMBTagger is a Qt-based frontend to the MusicBrainz client library, allowing lookup and tagging of MP3, Ogg, and FLAC files by acoustic IDs. It also allows lookup of CDs based on their tables of contents.
Enhancements:
- FIXED: Bug 945936. Added in the necessary preprocessor directives to keep ogg,mp3,flac support from building if it was not detected by the configure script.
- ADDED: Feature Request 946019. Added support for removing songs from the song list.
- CHANGED: Switched to a QListBox for the list of files since we only need one column.
- ADDED: Feature Request 946017. Added support for keeping track of the directory and a command line option -d directory/path, which sets the directory to start in.
- FIXED: Bug 946401. Check if QMBFile.GetSelectedChild() returns NULL.
- FIXED: Make last directory saving/loading work with loading files too.
- FIXED: Clicking Open Directory and then hitting Cancel no longer tries to open the directory.
- FIXED: No longer does weird things when you query and a song was already selected. Also immediately displays results if a song was already selected.
- FIXED: Bug 969872. Was segfaulting because trm_t object was being reused. Now creates new trm_t object for each song.
- FIXED: Duration is padded correctly now (so it shows up as, e.g., 00:06:04 instead of 0:6:4).
- FIXED: trm_t no longer needs to be deleted in QMBFileView destructor because it is done in the query loop.
- FIXED: Can now use Qt 3.1.2.
- CHANGED: Version number bumped for release.
- FIXED: Aborted on error during CD lookup because of improper string use.

Math::Numbers is a Perl module that contains methods for mathematical approaches of concepts of the number theory.

SYNOPSIS

use Math::Numbers;

my $a = 123;
my $b = 34;

my $numbers = Math::Numbers->new($a, $b [, ...]);

print "They are coprimes (relatively primes)!n" if $numbers->are_coprimes;
print "The greatest common divisor of these at least two numbers is ", $numbers->gcd;

my $number = Math::Numbers->new($a);

print "It is prime!n" if $number->is_prime;

my @divisors = $number->get_divisors;

print "$a is divisor of $b!n" if $number->is_divisor_of($b);

Math::Numbers is quite a simple module on matters of programming. What its interesting is the focus and approach it is intended to be made from the Number Theory basis for Perl beginners (like me) and also for young mathematicians (like me).

The normal topics of Number Theory include divisibility, prime numbers (which is separately intended to be covered by Math::Primes), congruences, quadratic residues, approximation for Real numbers, diophantine equations, etc. and all this is intended to be convered by the module on the concept on getting and setting values and also retriving the proof methods.

METHODS

new

# Some methods require more than only one argument.
my $numbers = Math::Numbers->new($p, $q, ...);

# Some methods require only one.
my $number = Math::Numbers->new($p);

Create a Math::Numbers object. Note that some of the methods will require objects created with only one or a defined numbers of arguments.

gcd
my $gcd = $numbers->gcd;

Calculation of the Greatest Common Divisor. This is made by two different methods which are described below: Blutos algorithm and Euclidean algorithm: The former is used when computing GCD for more than two integers; the latter is used when getting the GCD for two numbers to improve speed. See below for information on each.

Bluto_algorithm

You will mostly not require to call this method, but directly gcd(). Blutos algorithm uses a brute force calculation used by mathematicians to get divisors and then GCD also called Primality Test. Bluto takes some spinaches stolen from Popeye and starts dividing m all the way through 2 to m/2.

Euclidean_algorithm

Euclid rocks. I have a very nice Budgerigar (http://en.wikipedia.org/wiki/Budgerigar) called the same in honor of him (have to upload a pic of him).

As of now, this algorithm is only computed on two integers. From the Wikipedia entry: Given two natural numbers a and b: check if b is zero; if yes, a is the gcd. If not, repeat the process using (respectively) b, and the remainder after dividing a by b. This is exactly what our method does.
is_divisor_of

print "Yes, $p is divisor of $a...n" if $number->is_divisor_of($a);

Lets see if the number from the object is a divisor of $a, which means that the division $number/$a will return an integer (not necesarily a natural). If it does, itll return 1; 0, otherwise.

get_divisors
my @divisors = $number->get_divisors;

What are the divisors of the number brought by the object? This only includes the Natural numbers.

is_prime
print "$p is not prime!n" unless $number->is_prime

Returns 0 or 1 if the number from the object is prime or not, respectively. This method uses the, a bit slow, primality test.

are_coprimes
print "They are coprimes because their GCD is 1!n" if $numbers->are_coprimes;

Are the numbers from the object coprimes (relatively primes)? This means, the GCD is 1; (a, b, c, ...) = 1. Returns 1 or 0.