A
          / \      _             Play Now                         Nemesis on 
          | |     | |  _______   _        _   _______    _______   _    _______
          | |\    | | |   ____| |  \    /  | |   ____|  /   ____| | |  /   ____|
 /-------/-------------------------------------------------------------------,
O= Home <=XX|  About  News  Pics  Adventurers  Wizards  Download  Connect     >
 \-------\-------------------------------------------------------------------'
          | |   \   | |  |____  | |      | | |  |____   ___ \  \  | |  ___ \  \
          | |     \_| |_______| |_|      |_| |_______| |_______/  |_| |_______/
          \ /
           V  

Documentation Area

Document Path: /doc/efun/order_alist

Name: order_alist

Syntax:
    mixed * order_alist(mixed *keys, mixed *|void data, ...)

Description:
    Creates an alist.

    Either takes an array containing keys, and others containing
    the associated data, where all arrays are to be of the same
    length, or takes a single array that contains as first member
    the array of keys and has an arbitrary number of other members
    containing data, each of wich has to be of the same length as
    the key array.

    Complexity is O(n * lg(n) + n * m), where n is the number of
    elements in the key array and m is the number of data arrays + 1.

    Note that the dimensions of the arrays are used the other
    way than in lisp to allow for faster searching.

    Keys have to be of type integer, string or object. Types can
    be mixed.

Return value:
    Returns an array holding the sorted key array
    and the data arrays; the same permutation that is applied to
    the key array is applied to all data arrays.

See also:
LPC/alists
efun/assoc
efun/insert_alist