COMBINATORIAL_BLAS  1.6
Deleter.h
Go to the documentation of this file.
1 /****************************************************************/
2 /* Parallel Combinatorial BLAS Library (for Graph Computations) */
3 /* version 1.4 -------------------------------------------------*/
4 /* date: 1/17/2014 ---------------------------------------------*/
5 /* authors: Aydin Buluc (abuluc@lbl.gov), Adam Lugowski --------*/
6 /****************************************************************/
7 /*
8  Copyright (c) 2010-2014, The Regents of the University of California
9 
10  Permission is hereby granted, free of charge, to any person obtaining a copy
11  of this software and associated documentation files (the "Software"), to deal
12  in the Software without restriction, including without limitation the rights
13  to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
14  copies of the Software, and to permit persons to whom the Software is
15  furnished to do so, subject to the following conditions:
16 
17  The above copyright notice and this permission notice shall be included in
18  all copies or substantial portions of the Software.
19 
20  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
21  IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
22  FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
23  AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
24  LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
25  OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
26  THE SOFTWARE.
27  */
28 
29 #ifndef _DELETER_H_
30 #define _DELETER_H_
31 
32 #include <iostream>
33 
34 namespace combblas {
35 
37 {
38  template<typename T, typename _BinaryPredicate, typename Pred>
39  void operator()(const T *ptr, _BinaryPredicate cond, Pred first, Pred second) const
40  {
41  if(cond(first,second))
42  delete ptr;
43  }
44 };
45 
46 
47 template<typename A>
48 void DeleteAll(A arr1)
49 {
50  delete [] arr1;
51 }
52 
53 template<typename A, typename B>
54 void DeleteAll(A arr1, B arr2)
55 {
56  delete [] arr2;
57  DeleteAll(arr1);
58 }
59 
60 template<typename A, typename B, typename C>
61 void DeleteAll(A arr1, B arr2, C arr3)
62 {
63  delete [] arr3;
64  DeleteAll(arr1, arr2);
65 }
66 
67 template<typename A, typename B, typename C, typename D>
68 void DeleteAll(A arr1, B arr2, C arr3, D arr4)
69 {
70  delete [] arr4;
71  DeleteAll(arr1, arr2, arr3);
72 }
73 
74 
75 template<typename A, typename B, typename C, typename D, typename E>
76 void DeleteAll(A arr1, B arr2, C arr3, D arr4, E arr5)
77 {
78  delete [] arr5;
79  DeleteAll(arr1, arr2, arr3, arr4);
80 }
81 
82 template<typename A, typename B, typename C, typename D, typename E, typename F>
83 void DeleteAll(A arr1, B arr2, C arr3, D arr4, E arr5, F arr6)
84 {
85  delete [] arr6;
86  DeleteAll(arr1, arr2, arr3, arr4,arr5);
87 }
88 
89 }
90 
91 #endif
double B
void DeleteAll(A arr1)
Definition: Deleter.h:48
double D
double A
void operator()(const T *ptr, _BinaryPredicate cond, Pred first, Pred second) const
Definition: Deleter.h:39
double C
Definition: CCGrid.h:4