src/utils/Algorithm.hpp

/*
 * Copyright (c) 2005 The University of Notre Dame. All Rights Reserved.
 *
 * The University of Notre Dame grants you ("Licensee") a
 * non-exclusive, royalty free, license to use, modify and
 * redistribute this software in source and binary code form, provided
 * that the following conditions are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 *
 * 2. 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.
 *
 * This software is provided "AS IS," without a warranty of any
 * kind. All express or implied conditions, representations and
 * warranties, including any implied warranty of merchantability,
 * fitness for a particular purpose or non-infringement, are hereby
 * excluded.  The University of Notre Dame and its licensors shall not
 * be liable for any damages suffered by licensee as a result of
 * using, modifying or distributing the software or its
 * derivatives. In no event will the University of Notre Dame or its
 * licensors be liable for any lost revenue, profit or data, or for
 * direct, indirect, special, consequential, incidental or punitive
 * damages, however caused and regardless of the theory of liability,
 * arising out of the use of or inability to use software, even if the
 * University of Notre Dame has been advised of the possibility of
 * such damages.
 *
 * SUPPORT OPEN SCIENCE!  If you use OpenMD or its source code in your
 * research, please cite the appropriate papers when you publish your
 * work.  Good starting points are:
 *                                                                      
 * [1]  Meineke, et al., J. Comp. Chem. 26, 252-271 (2005).             
 * [2]  Fennell & Gezelter, J. Chem. Phys. 124, 234104 (2006).          
 * [3]  Sun, Lin & Gezelter, J. Chem. Phys. 128, 24107 (2008).          
 * [4]  Vardeman & Gezelter, in progress (2009).                        
 */

#include <functional>
#include "config.h"
namespace OpenMD {

  /** 
   * copy_if is one of the missing functions in STL. 
   * copy_if copies elements from the range [first, last) to the range [result, result + (last-first)), 
   * except that any element for which pred is false is not copied.
   */
  template<typename InputIterator, typename OutputIterator, typename Predicate>
  OutputIterator copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate p) {
    while (first != last) {
      if (p(*first)) {
        *result++ = *first;
      }
      ++first;
    }

    return result;
  }


  template<typename T>
  struct logical_xor :public std::binary_function<T, T, bool> {
    RealType operator()(T x, T y) { return x ^ y; }
  };

}
Revision:	1442
Committed:	Mon May 10 17:28:26 2010 UTC (14 years, 11 months ago) by gezelter
File size:	2877 byte(s)
Log Message:	Adding property set to svn entries
#	User	Rev	Content
1	tim	325	/*
2			* Copyright (c) 2005 The University of Notre Dame. All Rights Reserved.
3			*
4			* The University of Notre Dame grants you ("Licensee") a
5			* non-exclusive, royalty free, license to use, modify and
6			* redistribute this software in source and binary code form, provided
7			* that the following conditions are met:
8			*
9	gezelter	1390	* 1. Redistributions of source code must retain the above copyright
10	tim	325	* notice, this list of conditions and the following disclaimer.
11			*
12	gezelter	1390	* 2. Redistributions in binary form must reproduce the above copyright
13	tim	325	* notice, this list of conditions and the following disclaimer in the
14			* documentation and/or other materials provided with the
15			* distribution.
16			*
17			* This software is provided "AS IS," without a warranty of any
18			* kind. All express or implied conditions, representations and
19			* warranties, including any implied warranty of merchantability,
20			* fitness for a particular purpose or non-infringement, are hereby
21			* excluded. The University of Notre Dame and its licensors shall not
22			* be liable for any damages suffered by licensee as a result of
23			* using, modifying or distributing the software or its
24			* derivatives. In no event will the University of Notre Dame or its
25			* licensors be liable for any lost revenue, profit or data, or for
26			* direct, indirect, special, consequential, incidental or punitive
27			* damages, however caused and regardless of the theory of liability,
28			* arising out of the use of or inability to use software, even if the
29			* University of Notre Dame has been advised of the possibility of
30			* such damages.
31	gezelter	1390	*
32			* SUPPORT OPEN SCIENCE! If you use OpenMD or its source code in your
33			* research, please cite the appropriate papers when you publish your
34			* work. Good starting points are:
35			*
36			* [1] Meineke, et al., J. Comp. Chem. 26, 252-271 (2005).
37			* [2] Fennell & Gezelter, J. Chem. Phys. 124, 234104 (2006).
38			* [3] Sun, Lin & Gezelter, J. Chem. Phys. 128, 24107 (2008).
39			* [4] Vardeman & Gezelter, in progress (2009).
40	tim	325	*/
41
42			#include <functional>
43	tim	963	#include "config.h"
44	gezelter	1390	namespace OpenMD {
45	tim	325
46	gezelter	507	/**
47			* copy_if is one of the missing functions in STL.
48			* copy_if copies elements from the range [first, last) to the range [result, result + (last-first)),
49			* except that any element for which pred is false is not copied.
50			*/
51			template<typename InputIterator, typename OutputIterator, typename Predicate>
52			OutputIterator copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate p) {
53	tim	325	while (first != last) {
54	gezelter	507	if (p(*first)) {
55			result++ = first;
56			}
57			++first;
58	tim	325	}
59
60			return result;
61	gezelter	507	}
62	tim	325
63
64
65	gezelter	507	template<typename T>
66			struct logical_xor :public std::binary_function<T, T, bool> {
67	tim	963	RealType operator()(T x, T y) { return x ^ y; }
68	gezelter	507	};
69	tim	325
70			}