/usr/include/cxdeque.h is in libcext-dev 6.4.1-5.
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 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 | /* $Id: cxdeque.h,v 1.3 2011-02-21 14:15:31 rpalsa Exp $
*
* This file is part of the ESO C Extension Library
* Copyright (C) 2001-2011 European Southern Observatory
*
* 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.
*
* This program is distributed in the hope that it will be useful,
* 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.
*
* 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., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
/*
* $Author: rpalsa $
* $Date: 2011-02-21 14:15:31 $
* $Revision: 1.3 $
* $Name: not supported by cvs2svn $
*/
#ifndef CX_DEQUE_H
#define CX_DEQUE_H
#include <cxtypes.h>
#include <cxmemory.h>
CX_BEGIN_DECLS
typedef struct _cx_deque_ cx_deque;
typedef cxsize cx_deque_const_iterator;
typedef cxsize cx_deque_iterator;
/*
* Create, copy and destroy operations
*/
cx_deque *cx_deque_new(void);
void cx_deque_delete(cx_deque* deque);
void cx_deque_destroy(cx_deque *deque, cx_free_func deallocate);
/*
* Non-modifying operations
*/
cxsize cx_deque_size(const cx_deque *deque);
cxbool cx_deque_empty(const cx_deque *deque);
cxsize cx_deque_max_size(const cx_deque *deque);
/*
* Assignment operations
*/
void cx_deque_swap(cx_deque *deque, cx_deque *other);
cxptr cx_deque_assign(cx_deque *deque, cx_deque_iterator position, cxptr data);
/*
* Element access
*/
cxptr cx_deque_front(const cx_deque *deque);
cxptr cx_deque_back(const cx_deque *deque);
cxptr cx_deque_get(const cx_deque *deque, cx_deque_const_iterator position);
/*
* Iterator functions
*/
cx_deque_iterator cx_deque_begin(const cx_deque *deque);
cx_deque_iterator cx_deque_end(const cx_deque *deque);
cx_deque_iterator cx_deque_next(const cx_deque *deque,
cx_deque_const_iterator position);
cx_deque_iterator cx_deque_previous(const cx_deque *deque,
cx_deque_const_iterator position);
/*
* Inserting and removing elements
*/
void cx_deque_push_front(cx_deque *deque, cxcptr data);
cxptr cx_deque_pop_front(cx_deque *deque);
void cx_deque_push_back(cx_deque *deque, cxcptr data);
cxptr cx_deque_pop_back(cx_deque *deque);
cx_deque_iterator cx_deque_insert(cx_deque *deque, cx_deque_iterator position,
cxcptr data);
cx_deque_iterator cx_deque_erase(cx_deque *deque, cx_deque_iterator position,
cx_free_func deallocate);
void cx_deque_clear(cx_deque *deque);
/*
* Extra deque interfaces
*/
/*
* Removing elements
*/
cxptr cx_deque_extract(cx_deque *deque, cx_deque_iterator position);
void cx_deque_remove(cx_deque *deque, cxcptr data);
/*
* Splice functions
*/
void cx_deque_unique(cx_deque *deque, cx_compare_func compare);
void cx_deque_splice(cx_deque *deque, cx_deque_iterator position,
cx_deque *other, cx_deque_iterator start,
cx_deque_iterator end);
void cx_deque_merge(cx_deque *deque, cx_deque *other, cx_compare_func compare);
void cx_deque_sort(cx_deque *deque, cx_compare_func compare);
void cx_deque_reverse(cx_deque *deque);
CX_END_DECLS
#endif /* CX_DEQUE_H */
|