/usr/include/gap/set.h is in gap-dev 4r6p5-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 | /****************************************************************************
**
*W set.h GAP source Martin Schönert
**
**
*Y Copyright (C) 1996, Lehrstuhl D für Mathematik, RWTH Aachen, Germany
*Y (C) 1998 School Math and Comp. Sci., University of St Andrews, Scotland
*Y Copyright (C) 2002 The GAP Group
**
** This file declaress the functions which mainly deal with proper sets.
**
** A *proper set* is a list that has no holes, no duplicates, and is sorted.
** For the full definition of sets see chapter "Sets" in the {\GAP} Manual.
** Read also section "More about Sets" about the internal flag for sets.
*/
#ifndef GAP_SET_H
#define GAP_SET_H
/****************************************************************************
**
*F SetList(<list>) . . . . . . . . . . . . . . . . . make a set from a list
**
** 'SetList' returns a new set that contains the elements of <list>. Note
** that 'SetList' returns a new list even if <list> was already a set. In
** this case 'SetList' is equal to 'ShallowCopy'.
**
** 'SetList' makes a copy of the list <list>, removes the holes, sorts the
** copy and finally removes duplicates, which must appear next to each other
** now that the copy is sorted.
*/
extern Obj SetList (
Obj list );
/****************************************************************************
**
*F IsSet(<list>) . . . . . . . . . . . . . . . . . . test if a list is a set
**
** 'IsSet' returns 1 if the list <list> is a proper set and 0 otherwise. A
** proper set is a list that has no holes, no duplicates, and is sorted. As
** a sideeffect 'IsSet' changes the type of proper sets to 'T_SET'.
**
** A typical call in the set functions looks like this: \\
** | if ( ! IsSet(list) ) list = SetList(list); | \\
** This tests if 'list' is a proper set. If it is, then the type is changed
** to 'T_SET'. If it is not then 'SetList' is called to make a copy of
** 'list', remove the holes, sort the copy, and remove the duplicates.
*/
extern Int IsSet (
Obj list );
/****************************************************************************
**
*F * * * * * * * * * * * * * initialize package * * * * * * * * * * * * * * *
*/
/****************************************************************************
**
*F InitInfoSet() . . . . . . . . . . . . . . . . . . table of init functions
*/
StructInitInfo * InitInfoSet ( void );
#endif // GAP_SET_H
/****************************************************************************
**
*E set.c . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ends here
*/
|