Net::DRI::Data::ContactSet(3)

NAME
Net::DRI::Data::ContactSet - Handle an ordered collection of contacts for Net::DRI

DESCRIPTION
This class encapsulates a set of contacts, with associated types. For each type, it can stores as many contacts as needed. Contacts are compared among themselves by calling the id() method on them. Thus all Contact classes must define such a method, which returns a string.

METHODS

  new()
creates a new object

  types()
returns the list of current types stored in this class

  has_type()
returns 1 if the given type as first argument has some contacts in this object, 0 otherwise

  add()
with the first argument being a contact, and the second (optional) a type, adds the contact to the list of contacts for this type or all types (if no second argument). If the contact already exists (same id()), it will be replaced when found. Returns the object itself.

  del()
the opposite of add()

  rem()
alias for del()

  clear()
removes all contact currently associated to all types

  set()
with an array ref as first argument, and a type (optional) as second, set the current list of the given type (or all types) to be the list of contacts in first argument. Returns the object itself.

  get()
returns list (in list context) or first element of list (in scalar context) for the type given as argument

  get_all()
returns list of contacts, without duplicates, for all types

SUPPORT
For now, support questions should be sent to:

<netdri@dotandco.com>

Please also see the SUPPORT file in the distribution.

SEE ALSO
http://www.dotandco.com/services/software/Net-DRI/

AUTHOR
Patrick Mevzek, <netdri@dotandco.com>

COPYRIGHT
Copyright (c) 2005,2006,2007,2008 Patrick Mevzek <netdri@dotandco.com>. All rights reserved.

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.

See the LICENSE file that comes with this distribution for more details.