MySpace Friend Renamer provides an extension that allows you to rename your MySpace Friends.

This adds a right click option to Myspace Pages and allows you to change the display name for any of your friends. Handy if your friends change names often, or pick strange and obscure names.

Also in response to comments. If a tab is not in focus when the page loads, the extension will not rename.

I believe that the extension will conflict with other extensions that change pages when they load. If I find a better way to do it, I will change it.

WWW::Myspace::FriendAdder Perl module will interactively add friends to your Myspace account.

SYNOPSIS

This module gives you a little more flexibility when adding friends to your Myspace account. It is interactive and will occasionally prompt you for input. Youll have the most success when using it at the command line, but you do have the option of suppressing its reporting and interactive nature if you want to run it from a cgi script or if you just find it annoying. Hey, youve got your reasons, right? This module is an extension of Grant Grueningers handy WWW::Myspace module.

use WWW::Myspace;
use WWW::Myspace::FriendAdder;

my $myspace = WWW::Myspace->new();

my $adder = WWW::Myspace::FriendAdder->new( $myspace );

my @friend_ids = (List, of, friend, ids);

$adder->send_friend_requests( @friend_ids );

By default, this routine will try to add as many friends as possible until it it reaches max_count, which defaults to 50, but can be set to any number of your choosing. See below. When Myspace prompts you for user input, the routine will pause and allow you as much time as you need to fill out the Myspace form. Once you have done so, you may prompt the script to continue or to exit. Upon its exit, the script will report on its success and/or failure.

WWW::Myspace is a Perl module to access MySpace.com profile information from Perl.

WARNING - DO NOT USE THIS MODULE FOR MASS MESSAGING OR COMMENTING.

Myspace will cripple or disable your account:

Older accounts:

Messages will appear in your Sent folder but not in the receivers inbox, although theyll be able to see it if theyre paging through from another message. The receiver will get a "New Comments" notification and be able to see your comment, but it wont appear on the profile page.

Newer accounts:

If you created your myspace account in or after June 2006 (approximately), and you use a "bot" (including this module) to send messages, your message sending ability will be disabled and your account may be deleted. This is due to security features myspace has implemented to prevent spam abuse by people using multiple accounts.

SYNOPSIS

WWW::Myspace.pm provides methods to access your myspace.com account and functions automatically. It provides a simple interface for scripts to log in, access lists of friends, scan users profiles, retreive profile data, send messages, and post comments.

use WWW::Myspace;
my $myspace = WWW::Myspace->new ($account, $password);
OR
my $myspace = new WWW::Myspace; # Prompts for email and password
unless ( $myspace->logged_in ) { die "Login failed: " . $myspace->error }

my ( @friends ) = $myspace->get_friends();

This module is designed to help you automate and centralize redundant tasks so that you can better handle keeping in personal touch with numerous friends or fans, or coordinate fan communications among multiple band members. This module operates well within MySpaces security measures. If youre looking for a spambot, this aint it.

WWW::Myspace works by interacting with the site through a UserAgent object, using HTTP::Request::Form to process forms. Since by nature web sites are dynamic, if you find that some interaction with the site breaks, check for a new version of this module (or if you go source diving, submit a patch). You can run "cpan -i WWW::Myspace" as a cron job or before running your scripts, if appropriate, to make sure you have the latest version.

Netscape Friends Activity Sidebar is a Firefox extension that helps you keep tabs on what stories your Netscape friends are submitting, commenting, and voting on. A new toolbar button (shown in the extension preview image) features Chad, the older, more mature brother of AOLs little yellow chat mascot. When there is new activity by your friends (i.e., a new comment, story submission, or vote, depending on your settings), the button will be activated and Chad will send a friendly wave your way. Clicking on the activated button will open a list of your friends activity in the sidebar, allowing you to easily browse their stories and comments. Each time you view your friends activity, you will only be shown activity that is new since the last time you opened the sidebar.

Note: The sidebar limits activity to five items for each friend. If there are more than five items to view, a "View all of Chads activity" link will be shown at the bottom of the friends section. You can always view all of a friends activity by clicking on their name or avatar.

To make use of this extension, you must be logged into Netscape.com. If you do not have a Netscape.com account, sign up at http://www.netscape.com/signup Accounts are free, and it only takes a few minutes to create one. Once you have a Netscape.com account, you can submit stories and videos, vote for other peoples stories, rate comments, comment on stories you find interesting, as well as use this extension.

Hide Menubar is an extension used to hide your Mainmenu Toolbar automatically.

Supports to hide your Mainmenu Toolbar automatically, you can press the ALT key to show it temporarily.

Online is a speed focused program to give a textual display of your friends/buddies currently logged onto a unix host.

This program is distributed in the hope that it will be useful for everyone, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
A PARTICULAR PURPOSE. See the GNU General Public License for more details. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version.

You should have received a copy of the GNU General Public License along with this program; if not, write to the
Free Software Foundation, Inc.
59 Temple Place, Suite 330,
Boston, MA 02111-1307 USA

Unofficial Myspace Toolbar provides a way to automatically login to Myspace.

Automatically login to Myspace, instantly access your messages, view hidden comments, create styled comments/bulletins and more with this intuitive and customizable toolbar!

NEW! Myspace Notifications: Find out if you have new comments, bulletins, etc without logging into myspace.

The toolbar can automatically hide when you are not using Myspace. To toggle this feature, click the "m" on the status bar.

Livejournal Friends Checker is a Firefox extension that places an icon in the lower left corner of your browser when one of your friends post. Only works with paid accounts.

*** This only work for paid users (on livejournal.com). ***

This code is released under the BSD license. I make use of Pajs md5
library (which is released under the BSD license). You can get the code
for the md5 library at http://pajhome.org.uk/crypt/md5/

List::MoreUtils is a Perl module that can provide the stuff missing in List::Util.

SYNOPSIS

use List::MoreUtils qw(any all none notall true false firstidx first_index
lastidx last_index insert_after insert_after_string
apply after after_incl before before_incl indexes
firstval first_value lastval last_value each_array
each_arrayref pairwise natatime mesh zip uniq minmax);

List::MoreUtils provides some trivial but commonly needed functionality on lists which is not going to go into List::Util.

All of the below functions are implementable in only a couple of lines of Perl code. Using the functions from this module however should give slightly better performance as everything is implemented in C. The pure-Perl implementation of these functions only serves as a fallback in case the C portions of this module couldnt be compiled on this machine.

any BLOCK LIST

Returns a true value if any item in LIST meets the criterion given through BLOCK. Sets $_ for each item in LIST in turn:

print "At least one value undefined"
if any { !defined($_) } @list;

Returns false otherwise, or undef if LIST is empty.

all BLOCK LIST

Returns a true value if all items in LIST meet the criterion given through BLOCK. Sets $_ for each item in LIST in turn:

print "All items defined"
if all { defined($_) } @list;

Returns false otherwise, or undef if LIST is empty.

none BLOCK LIST

Logically the negation of any. Returns a true value if no item in LIST meets the criterion given through BLOCK. Sets $_ for each item in LIST in turn:

print "No value defined"
if none { defined($_) } @list;

Returns false otherwise, or undef if LIST is empty.

notall BLOCK LIST

Logically the negation of all. Returns a true value if not all items in LIST meet the criterion given through BLOCK. Sets $_ for each item in LIST in turn:

print "Not all values defined"
if notall { defined($_) } @list;

Returns false otherwise, or undef if LIST is empty.

true BLOCK LIST

Counts the number of elements in LIST for which the criterion in BLOCK is true. Sets $_ for each item in LIST in turn:

printf "%i item(s) are defined", true { defined($_) } @list;

false BLOCK LIST

Counts the number of elements in LIST for which the criterion in BLOCK is false. Sets $_ for each item in LIST in turn:

printf "%i item(s) are not defined", false { defined($_) } @list;

firstidx BLOCK LIST

first_index BLOCK LIST

Returns the index of the first element in LIST for which the criterion in BLOCK is true. Sets $_ for each item in LIST in turn:

my @list = (1, 4, 3, 2, 4, 6);
printf "item with index %i in list is 4", firstidx { $_ == 4 } @list;
__END__
item with index 1 in list is 4

Returns -1 if no such item could be found.

first_index is an alias for firstidx.

List::Util Perl module contains a selection of general-utility list subroutines.

SYNOPSIS

use List::Util qw(first max maxstr min minstr reduce shuffle sum);

List::Util contains a selection of subroutines that people have expressed would be nice to have in the perl core, but the usage would not really be high enough to warrant the use of a keyword, and the size so small such that being individual extensions would be wasteful.

By default List::Util does not export any subroutines. The subroutines defined are

first BLOCK LIST

Similar to grep in that it evaluates BLOCK setting $_ to each element of LIST in turn. first returns the first element where the result from BLOCK is a true value. If BLOCK never returns true or LIST was empty then undef is returned.

$foo = first { defined($_) } @list # first defined value in @list
$foo = first { $_ > $value } @list # first value in @list which
# is greater than $value

This function could be implemented using reduce like this

$foo = reduce { defined($a) ? $a : wanted($b) ? $b : undef } undef, @list

for example wanted() could be defined() which would return the first defined value in @list

max LIST

Returns the entry in the list with the highest numerical value. If the list is empty then undef is returned.

$foo = max 1..10 # 10
$foo = max 3,9,12 # 12
$foo = max @bar, @baz # whatever

This function could be implemented using reduce like this

$foo = reduce { $a > $b ? $a : $b } 1..10

maxstr LIST

Similar to max, but treats all the entries in the list as strings and returns the highest string as defined by the gt operator. If the list is empty then undef is returned.

$foo = maxstr A..Z # Z
$foo = maxstr "hello","world" # "world"
$foo = maxstr @bar, @baz # whatever

This function could be implemented using reduce like this

$foo = reduce { $a gt $b ? $a : $b } A..Z

min LIST

Similar to max but returns the entry in the list with the lowest numerical value. If the list is empty then undef is returned.

$foo = min 1..10 # 1
$foo = min 3,9,12 # 3
$foo = min @bar, @baz # whatever

This function could be implemented using reduce like this

$foo = reduce { $a < $b ? $a : $b } 1..10

minstr LIST

Similar to min, but treats all the entries in the list as strings and returns the lowest string as defined by the lt operator. If the list is empty then undef is returned.

$foo = minstr A..Z # A
$foo = minstr "hello","world" # "hello"
$foo = minstr @bar, @baz # whatever

This function could be implemented using reduce like this

$foo = reduce { $a lt $b ? $a : $b } A..Z

reduce BLOCK LIST

Reduces LIST by calling BLOCK, in a scalar context, multiple times, setting $a and $b each time. The first call will be with $a and $b set to the first two elements of the list, subsequent calls will be done by setting $a to the result of the previous call and $b to the next element in the list.

Returns the result of the last call to BLOCK. If LIST is empty then undef is returned. If LIST only contains one element then that element is returned and BLOCK is not executed.

$foo = reduce { $a < $b ? $a : $b } 1..10 # min
$foo = reduce { $a lt $b ? $a : $b } aa..zz # minstr
$foo = reduce { $a + $b } 1 .. 10 # sum
$foo = reduce { $a . $b } @bar # concat
shuffle LIST

Returns the elements of LIST in a random order

@cards = shuffle 0..51 # 0..51 in a random order

sum LIST

Returns the sum of all the elements in LIST. If LIST is empty then undef is returned.

$foo = sum 1..10 # 55
$foo = sum 3,9,12 # 24
$foo = sum @bar, @baz # whatever

This function could be implemented using reduce like this

$foo = reduce { $a + $b } 1..10

List::MRU is a Perl module that implements a simple fixed-size MRU-ordered list.

SYNOPSIS

use List::MRU;

# Constructor
$lm = List::MRU->new(max => 20);

# Constructor with explicit eq subroutine for obj equality tests
$lm = List::MRU->new(max => 20, eq => sub {
$_[0]->stringify eq $_[1]->stringify
});

# Constructor using explicit UUIDs
$lm - List::MRU->new(max => 5, uuid => 1);

# Add item, moving to head of list if already exists
$lm->add($item);
# Add item, moving to head of list if $uuid matches or object already exists
$lm->add($item, $uuid);

# Iterate in most-recently-added order
for $item ($lm->list) {
print "$itemn";
}
# each-style iteration
while (($item, $uuid) = $lm->each) {
print "$item, $uuidn";
}

# Item deletion
$lm->delete($item);
$lm->delete(uuid => $uuid);

# Accessors
$max = $lm->max; # max items in list
$count = $lm->count; # current items in list

Perl module implementing a simple fixed-size most-recently-used- (MRU)-ordered list of values/objects. Well, really its a most- recently-added list - items added to the list are just promoted to the front of the list if they already exist, otherwise they are added there.

Works fine with with non-scalar items, but you will need to supply an explicit eq subroutine to the constructor to handle testing for the same object (or alternatively have overloaded the eq operator for your object).

List::MRU also supports having explicit UUIDs attached to items, allowing List::MRU items to be modified, instead of a change just creating a new entry.

List::RewriteElements is a Perl module that can create a new list by rewriting elements of a first list.

SYNOPSIS

use List::RewriteElements;

Constructor

Simplest case: Input from array, output to STDOUT.

$lre = List::RewriteElements->new( {
list => @source,
body_rule => sub {
my $record = shift;
$record .= q{additional field};
},
} );
Input from file, output to STDOUT:
$lre = List::RewriteElements->new( {
file => "/path/to/source/file",
body_rule => sub {
my $record = shift;
$record .= q{,additional field};
},
} );
Provide a different rule for the first element in the list:
$lre = List::RewriteElements->new( {
file => "/path/to/source/file",
header_rule => sub {
my $record = shift;
$record .= q{,ADDITIONAL HEADER};
},
body_rule => sub {
my $record = shift;
$record .= q{,additional field};
},
} );
Input from file, output to file:
$lre = List::RewriteElements->new( {
file => "/path/to/source/file",
body_rule => sub {
my $record = shift;
$record .= q{additional field};
},
output_file => "/path/to/output/file",
} );
To name output file, just provide a suffix to filename:
$lre = List::RewriteElements->new( {
file => "/path/to/source/file",
body_rule => sub {
my $record = shift;
$record .= q{additional field};
},
output_suffix => .out,
} );
Provide criteria to suppress output of header or individual record.
$lre = List::RewriteElements->new( {
file => "/path/to/source/file",
header_suppress => sub {
my $record = shift;
return if $record =~ /$somepattern/;
},
body_suppress => sub {
my $record = shift;
return if $record ne somestring;
},
body_rule => sub {
my $record = shift;
$record .= q{additional field};
},
} );

Generate Output

$lre->generate_output();

Report Output Information

$path_to_output_file = $lre->get_output_path();

$output_file_basename = $lre->get_output_basename();

$output_row_count = $lre->get_total_rows();

$output_record_count = $lre->get_total_records();

$records_changed = $lre->get_records_changed();

$records_unchanged = $lre->get_records_unchanged();

$records_deleted = $lre->get_records_deleted();

$header_status = $lre->get_header_status();

It is common in many situations for you to receive a flat data file from someone else and have to generate a new file in which each row or record in the incoming file must either (a) be transformed according to some rule before being printing to the new file; or (b) if it meets certain criteria, not output to the new file at all.

List::RewriteElements enables you to write such rules and criteria, generate the file of transformed data records, and get back some basic statistics about the transformation.

List::RewriteElements is useful when the number of records in the incoming file may be large and you do not want to hold the entire list in memory. Similarly, the newly generated records are not held in memory but are immediately printed to STDOUT or to file.

On the other hand, if for some reason you already have an array of records in memory, you can use List::RewriteElements to apply rules and criteria to each element of the array and then print the transformed records (again, without holding the output in memory).

List::Comprehensions is a Perl module that allows for list comprehensions in Perl.

SYNOPSIS

use List::Comprehensions;
use warnings;

my @res = ();

@res = comp1 { [ @_ ] } [0..4], [0..4], [0..4];

no warnings once;
@res = comp2 { [$i, $j, $k] }
i => [0..4],
j => [0..4],
k => [0..4];

# if strict vars is on, use lexicals. eg:
use strict vars;

my ($i, $j, $k);
@res = comp2 { [$i, $j, $k] }
i => [0..4],
j => [0..4],
k => [0..4];

# each being less efficient but equivelant to

@res = ();
for $i ( 0..4 ) {
for $j ( 0..4 ) {
for $k ( 0..4 ) {
push @res, [$i, $j, $k];
}
}
}

Dir::List is a Perl module, that provides you with various information about a specified directory. For example, it can obtain the user and group of files, the sizes of sub-directories, the filetype, and accessibility. Caching functionality is available.

Whats New in This Release:

· The unmaintained Changes has been removed.
· Some missing requirements have been added.
· This release deletes $self->{list} at the beginning of dirinfo, in order to not return old results (this is especially a problem in mod_perl where you only instantiate one Dir::List).

List::Pairwise is a Perl module with map/grep arrays and hashes pairwise.

SYNOPSIS

use List::Pairwise qw(:all);

my %a = (
snoogy1 => 4,
snoogy2 => 2,
NOT => 4,
snoogy3 => 5,
hehe => 12,
);

# keys/values emulation (only slower)
my @keys = mapp {$a} %a;
my @values = mapp {$b} %a;

# reverse hash (does not work in-place)
my %reverse_a = mapp {$b, $a} %a;

# reverse array pairs in-place
my @a = %a;
mapp { ($a, $b) = ($b, $a) } @a;

# modify values in-place
mapp {$b++} %a;

# modify keys (does not work in-place)
my %b = mapp {lc($a) => $b} %a;

# grep hash subset
my %subset1 = grepp {$a =~ /snoogy/} %a;
my %subset2 = grepp {$b < 5} %a;

# grep some specific values
my @snoog_values = mapp {$b} grepp {$a =~ /snoogy/} %a;
# This does not work:
# values grepp {$a =~ /snoogy/} %a; # values() expects a real hash

DNS List is a BIND zone file -to- HTML script written in PHP which enables drilling down on particular hosts to view CNAME records (if any).

In order to display an easily readable list of entries hosted on my DNS servers, I wrote this PHP script to parse A and CNAME records out of my BIND zone files, and generate an expandable/collapsable table containing the information.

This script expects to find the zonefile in a zonefile subdirectory of the directory in which the script currently resides. Again this is easy to change, but it was written for my purposes and Im providing it here should it be useful to others. There is a lot of hard-coding within the script for "kw.zone" and "test.zone" - so modify this to suit your needs. The script can parse fairly simple zone files easily, but hasnt been tested with more complex zones. Your milage will vary.

Preferences Hide and Seek can configure hard to find and hidden options of GNOME.

Preferences Hide and Seek is a utility that groups together the options that actually exist for GNOME, but are usually hard to find or are just plain hidden from the user.

This utility also makes it possible to create a simple data file to expose gconf-based options to the user. It was created to allow usable access to the hidden application options buried within gconf.

Here are some key features of "Preferences Hide and Seek":

· Easy to create an advanced preferences dialog for any application that utilizes GConf.
· Single application mode can be used to mimmick a standard dialog.
· Supports GConf key types boolean, integer, float and string.
· Can set minimum and maximum range for numeric key types.
· Can present string keys as a file or folder name selection.
· Can present string keys as a drop down menu.
· Can present string keys as a font selection.
· Can present string keys as a color selection.
· Can present integer enumerations as a drop down menu.
· Radio buttons support integer, float, and string key types.
· Check buttons, radio buttons, and drop down menus can control the sensitivity of other objects.

WWW::Facebook::API::REST::Client::Friends is a Perl module with Friend methods for Client.

SYNOPSIS

use WWW::Facebook::API::REST::Client;

SUBROUTINES/METHODS

base

The WWW::Facebook::API::REST::Client::Base object to use to make calls to the REST server

get

The friends.get method of the Facebook API

get_typed

The friends.getTyped method of the Facebook API

are_friends

The friends.areFriends method of the Facebook API

get_app_users

The friends.getAppUsers method of the Facebook API

DIAGNOSTICS

link type required

No link type was passed to get_typed. Pass a link type that is permitted by the Facebook API.

id1 array ref required

No id1 array ref was passed to are_friends. Pass two array refs as per the Facebook API.

id2 array ref required

No id2 array ref was passed to are_friends. Pass two array refs as per the Facebook API.

CONFIGURATION AND ENVIRONMENT

WWW::Facebook::API::REST::Client::Friends requires no configuration files or environment variables.

list files package prints to file list of files in a given directory.

Handy if youd like to, say, tell a friend of yours what ebooks you have, and wouldnt feel like typing them all by hand.

Hope you can find it useful.


INSTALLATION

i assume youve got everything in its standard places; otherwise you probably know what to do anyway.

to install for one user

copy listFiles.desktop to ~/.kde/share/apps/konqueror/servicemenus
copy listFiles.sh to /usr/local/bin or elsewhere in the path

to install for all users

copy listFiles.desktop to /usr/share/apps/konqueror/servicemenus
copy listFiles.sh to /usr/local/bin or elsewhere in the path

Whats New in This Release:

· added counting the number of items
· added the possibility to change the place where the listing is written to
· some minor changes to the code

List::Maker is a Perl module that can generate more sophisticated lists than just $a..$b.

SYNOPSIS

use List::Maker;

@list = < 1..10 >; # (1,2,3,4,5,6,7,8,9,10)

@list = < 10..1 >; # (10,9,8,7,6,5,4,3,2,1)

@list = < 1,3,..10 > # (1,3,5,7,9)
@list = < 1..10 x 2 > # (1,3,5,7,9)

@list = < 0..10 : prime N >; # (2,3,5,7)
@list = < 1,3,..30 : /7/ > # (7,17,27)

@words = < a list of words >; # (a, list, of, words)
@words = < a list "of words" >; # (a list, of words)

The List::Maker module hijacks Perls built-in file globbing syntax (< *.pl > and glob *.pl) and retargets it at list creation.

The rationale is simple: most people rarely if ever glob a set of files, but they have to create lists in almost every program they write. So the list construction syntax should be easier than the filename expansion syntax.