Ifpack Package Browser (Single Doxygen Collection) Development
Loading...
Searching...
No Matches
SortedSet_dh.h
Go to the documentation of this file.
1/*@HEADER
2// ***********************************************************************
3//
4// Ifpack: Object-Oriented Algebraic Preconditioner Package
5// Copyright (2002) Sandia Corporation
6//
7// Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
8// license for use of this work by or on behalf of the U.S. Government.
9//
10// Redistribution and use in source and binary forms, with or without
11// modification, are permitted provided that the following conditions are
12// met:
13//
14// 1. Redistributions of source code must retain the above copyright
15// notice, this list of conditions and the following disclaimer.
16//
17// 2. Redistributions in binary form must reproduce the above copyright
18// notice, this list of conditions and the following disclaimer in the
19// documentation and/or other materials provided with the distribution.
20//
21// 3. Neither the name of the Corporation nor the names of the
22// contributors may be used to endorse or promote products derived from
23// this software without specific prior written permission.
24//
25// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
26// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
28// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
29// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
30// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
31// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
32// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
33// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
34// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
35// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36//
37// Questions? Contact Michael A. Heroux (maherou@sandia.gov)
38//
39// ***********************************************************************
40//@HEADER
41*/
42
43#ifndef SORTED_SET_DH
44#define SORTED_SET_DH
45
46#include "euclid_common.h"
47
48#ifdef __cplusplus
49extern "C"
50{
51#endif
52
54 {
55 int n; /* max items that can be stored */
56 int *list; /* list of inserted elements */
57 int count; /* the number of elements in the list */
58 };
59
60 extern void SortedSet_dhCreate (SortedSet_dh * ss, int initialSize);
61 extern void SortedSet_dhDestroy (SortedSet_dh ss);
62 extern void SortedSet_dhInsert (SortedSet_dh ss, int idx);
63 extern void SortedSet_dhGetList (SortedSet_dh ss, int **list, int *count);
64
65#ifdef __cplusplus
66}
67#endif
68
69#endif
void SortedSet_dhCreate(SortedSet_dh *ss, int initialSize)
Definition: SortedSet_dh.c:51
void SortedSet_dhGetList(SortedSet_dh ss, int **list, int *count)
Definition: SortedSet_dh.c:126
void SortedSet_dhDestroy(SortedSet_dh ss)
Definition: SortedSet_dh.c:68
void SortedSet_dhInsert(SortedSet_dh ss, int idx)
Definition: SortedSet_dh.c:83