1 /****************************************************************/ 2 /* Parallel Combinatorial BLAS Library (for Graph Computations) */ 3 /* version 1.6 -------------------------------------------------*/ 4 /* date: 6/15/2017 ---------------------------------------------*/ 5 /* authors: Ariful Azad, Aydin Buluc --------------------------*/ 6 /****************************************************************/ 7 /* 8 Copyright (c) 2010-2017, 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 30 #ifndef _HEAP_ENTRY_H 31 #define _HEAP_ENTRY_H 32 33 namespace combblas { 34 35 template <class IT, class NT> 36 class HeapEntry 37 { 38 public: HeapEntry()39 HeapEntry() {}; HeapEntry(IT mykey,IT myrunr,NT mynum)40 HeapEntry(IT mykey, IT myrunr, NT mynum): key(mykey), runr(myrunr),num(mynum){} 41 IT key; 42 IT runr; 43 NT num; 44 45 // Operators are swapped for performance 46 // If you want/need to convert them back to their normal definitions, don't forget to add 47 // "greater< HeapEntry<T> >()" optional parameter to all the heap operations operating on HeapEntry<T> objects. 48 // For example: push_heap(heap, heap + kisect, greater< HeapEntry<T> >()); 49 50 bool operator > (const HeapEntry & rhs) const 51 { return (key < rhs.key); } 52 bool operator < (const HeapEntry & rhs) const 53 { return (key > rhs.key); } 54 bool operator == (const HeapEntry & rhs) const 55 { return (key == rhs.key); } 56 }; 57 58 } 59 60 #endif 61 62