diff options
author | Kurt Zenker <kz@openoffice.org> | 2008-06-25 13:20:01 +0000 |
---|---|---|
committer | Kurt Zenker <kz@openoffice.org> | 2008-06-25 13:20:01 +0000 |
commit | 8b90c3bc354b42c6151c6d6a420333cc534ea024 (patch) | |
tree | 6a3faff3dc53b2bedae94d7ba3c25f55079f9c84 /psprint | |
parent | a2e02e63241ceb3fabd2fdb6c033fcd7f5ea6acf (diff) |
INTEGRATION: CWS vcl89 (1.3.8); FILE MERGED
2008/05/19 09:12:06 pl 1.3.8.1: #i89625# remove unused code
Diffstat (limited to 'psprint')
-rw-r--r-- | psprint/source/fontsubset/list.h | 21 |
1 files changed, 10 insertions, 11 deletions
diff --git a/psprint/source/fontsubset/list.h b/psprint/source/fontsubset/list.h index 5a511f645bf0..b86521a1f666 100644 --- a/psprint/source/fontsubset/list.h +++ b/psprint/source/fontsubset/list.h @@ -7,7 +7,7 @@ * OpenOffice.org - a multi-platform office productivity suite * * $RCSfile: list.h,v $ - * $Revision: 1.3 $ + * $Revision: 1.4 $ * * This file is part of OpenOffice.org. * @@ -28,7 +28,7 @@ * ************************************************************************/ -/* $Id: list.h,v 1.3 2008-04-11 10:15:17 rt Exp $ */ +/* $Id: list.h,v 1.4 2008-06-25 14:20:01 kz Exp $ */ /*[]---------------------------------------------------[]*/ /*| |*/ @@ -54,47 +54,46 @@ extern "C" /*- constructors and a destructor */ list listNewEmpty(void); +#ifdef TEST list listNewCopy(list); +#endif void listDispose(list); void listSetElementDtor(list, void (*f)(void *)); /*- this function will be executed when the element is removed via listRemove() or listClear() */ -/*- assignment */ - list listCopy(list to, list from); - /*- queries */ void * listCurrent(list); int listCount(list); int listIsEmpty(list); +#ifdef TEST int listAtFirst(list); int listAtLast(list); int listPosition(list); /* Expensive! */ - +#endif /*- search */ int listFind(list, void *); /* Returns true/false */ /*- positioning functions */ /*- return the number of elements by which the current position in the list changes */ int listNext(list); - int listPrev(list); int listSkipForward(list, int n); - int listSkipBackward(list, int n); int listToFirst(list); int listToLast(list); int listPositionAt(list, int n); /* Expensive! */ /*- adding and removing elements */ list listAppend(list, void *); +#ifdef TEST list listPrepend(list, void *); list listInsertAfter(list, void *); list listInsertBefore(list, void *); +#endif list listRemove(list); /* removes the current element */ list listClear(list); /* removes all elements */ +#ifdef TEST /*- forall */ void listForAll(list, void (*f)(void *)); - -/*- conversion */ - void **listToArray(list); +#endif #ifdef __cplusplus } |