| 1 | /*
|
|---|
| 2 | * Copyright (c) 2017 Jaroslav Jindrak
|
|---|
| 3 | * All rights reserved.
|
|---|
| 4 | *
|
|---|
| 5 | * Redistribution and use in source and binary forms, with or without
|
|---|
| 6 | * modification, are permitted provided that the following conditions
|
|---|
| 7 | * are met:
|
|---|
| 8 | *
|
|---|
| 9 | * - Redistributions of source code must retain the above copyright
|
|---|
| 10 | * notice, this list of conditions and the following disclaimer.
|
|---|
| 11 | * - Redistributions in binary form must reproduce the above copyright
|
|---|
| 12 | * notice, this list of conditions and the following disclaimer in the
|
|---|
| 13 | * documentation and/or other materials provided with the distribution.
|
|---|
| 14 | * - The name of the author may not be used to endorse or promote products
|
|---|
| 15 | * derived from this software without specific prior written permission.
|
|---|
| 16 | *
|
|---|
| 17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|---|
| 18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|---|
| 19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|---|
| 20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|---|
| 21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|---|
| 22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|---|
| 23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|---|
| 24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|---|
| 25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|---|
| 26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|---|
| 27 | */
|
|---|
| 28 |
|
|---|
| 29 | #ifndef LIBCPP_ALGORITHM
|
|---|
| 30 | #define LIBCPP_ALGORITHM
|
|---|
| 31 |
|
|---|
| 32 | namespace std
|
|---|
| 33 | {
|
|---|
| 34 | /**
|
|---|
| 35 | * 25.3.1, copy:
|
|---|
| 36 | */
|
|---|
| 37 |
|
|---|
| 38 | template<class InputIterator, class OutputIterator>
|
|---|
| 39 | OutputIterator copy(InputIterator first, InputIterator last, OutputIterator result)
|
|---|
| 40 | {
|
|---|
| 41 | while(first != last)
|
|---|
| 42 | *result++ = first++;
|
|---|
| 43 |
|
|---|
| 44 | return result;
|
|---|
| 45 | }
|
|---|
| 46 |
|
|---|
| 47 | /**
|
|---|
| 48 | * 25.4.7, minimum and maximum:
|
|---|
| 49 | */
|
|---|
| 50 |
|
|---|
| 51 | template<class T>
|
|---|
| 52 | constexpr const T& max(const T& lhs, const T& rhs)
|
|---|
| 53 | {
|
|---|
| 54 | return (lhs > rhs) ? lhs : rhs;
|
|---|
| 55 | }
|
|---|
| 56 |
|
|---|
| 57 | template<class T>
|
|---|
| 58 | constexpr const T& min(const T& lhs, const T& rhs)
|
|---|
| 59 | {
|
|---|
| 60 | return (lhs < rhs) ? lhs : rhs;
|
|---|
| 61 | }
|
|---|
| 62 | }
|
|---|
| 63 |
|
|---|
| 64 | #endif
|
|---|
