69ae314807
r=db48x sr=blake a=asa git-svn-id: svn://10.0.0.236/trunk@116832 18797224-902f-48f8-a5cc-f745e15eee43
66 lines
2.3 KiB
C++
66 lines
2.3 KiB
C++
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*-
|
|
*
|
|
* The contents of this file are subject to the Netscape Public
|
|
* License Version 1.1 (the "License"); you may not use this file
|
|
* except in compliance with the License. You may obtain a copy of
|
|
* the License at http://www.mozilla.org/NPL/
|
|
*
|
|
* Software distributed under the License is distributed on an "AS
|
|
* IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or
|
|
* implied. See the License for the specific language governing
|
|
* rights and limitations under the License.
|
|
*
|
|
* The Original Code is the JavaScript 2 Prototype.
|
|
*
|
|
* The Initial Developer of the Original Code is Netscape
|
|
* Communications Corporation. Portions created by Netscape are
|
|
* Copyright (C) 1998 Netscape Communications Corporation. All
|
|
* Rights Reserved.
|
|
*
|
|
* Contributor(s):
|
|
*
|
|
* Alternatively, the contents of this file may be used under the
|
|
* terms of the GNU Public License (the "GPL"), in which case the
|
|
* provisions of the GPL are applicable instead of those above.
|
|
* If you wish to allow use of your version of this file only
|
|
* under the terms of the GPL and not to allow others to use your
|
|
* version of this file under the NPL, indicate your decision by
|
|
* deleting the provisions above and replace them with the notice
|
|
* and other provisions required by the GPL. If you do not delete
|
|
* the provisions above, a recipient may use your version of this
|
|
* file under either the NPL or the GPL.
|
|
*/
|
|
|
|
#ifndef algo_h___
|
|
#define algo_h___
|
|
|
|
namespace JavaScript
|
|
{
|
|
//
|
|
// Algorithms
|
|
//
|
|
|
|
// Assign zero to every element between first inclusive and last exclusive.
|
|
// This is equivalent ot fill(first, last, 0) but may be more efficient.
|
|
template<class ForwardIterator>
|
|
inline void zero(ForwardIterator first, ForwardIterator last)
|
|
{
|
|
while (first != last) {
|
|
*first = 0;
|
|
++first;
|
|
}
|
|
}
|
|
|
|
|
|
// Same as find(first, last, value) but may be more efficient because
|
|
// it doesn't use a reference for value.
|
|
template<class InputIterator, class T>
|
|
inline InputIterator findValue(InputIterator first, InputIterator last, T value)
|
|
{
|
|
while (first != last && !(*first == value))
|
|
++first;
|
|
return first;
|
|
}
|
|
}
|
|
#endif /* algo_h___ */
|