mirror of
https://github.com/corda/corda.git
synced 2025-01-23 21:08:48 +00:00
66 lines
2.3 KiB
C
66 lines
2.3 KiB
C
|
/*
|
||
|
|
* Copyright (C) 2011-2016 Intel Corporation. All rights reserved.
|
||
|
|
*
|
||
|
|
* Redistribution and use in source and binary forms, with or without
|
||
|
|
* modification, are permitted provided that the following conditions
|
||
|
|
* are met:
|
||
|
|
*
|
||
|
|
* * Redistributions of source code must retain the above copyright
|
||
|
|
* notice, this list of conditions and the following disclaimer.
|
||
|
|
* * Redistributions in binary form must reproduce the above copyright
|
||
|
|
* notice, this list of conditions and the following disclaimer in
|
||
|
|
* the documentation and/or other materials provided with the
|
||
|
|
* distribution.
|
||
|
|
* * Neither the name of Intel Corporation nor the names of its
|
||
|
|
* contributors may be used to endorse or promote products derived
|
||
|
|
* from this software without specific prior written permission.
|
||
|
|
*
|
||
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
|
*
|
||
|
|
*/
|
||
|
|
#ifndef _CPPUTIL_H__
|
||
|
|
#define _CPPUTIL_H__
|
||
|
|
|
||
|
|
#include <assert.h>
|
||
|
|
#include <utility>
|
||
|
|
|
||
|
|
namespace {
|
||
|
|
template <typename T>
|
||
|
|
void delete_ptrs_from_container(T& vec)
|
||
|
|
{
|
||
|
|
typename T::iterator iter = vec.begin();
|
||
|
|
typename T::iterator end = vec.end();
|
||
|
|
typename T::iterator this_iter;
|
||
|
|
|
||
|
|
while (iter != end)
|
||
|
|
{
|
||
|
|
this_iter = iter;
|
||
|
|
++iter;
|
||
|
|
delete *this_iter;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Each pair is well-formed (p.first <= p.second) */
|
||
|
|
template <typename T>
|
||
|
|
bool is_overlap(const std::pair<T, T>& p1,
|
||
|
|
const std::pair<T, T>& p2)
|
||
|
|
{
|
||
|
|
assert(p1.first <= p1.second);
|
||
|
|
assert(p2.first <= p2.second);
|
||
|
|
|
||
|
|
return ((p1.first <= p2.second) && (p2.first <= p1.second));
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
#endif
|