| 1 | /*
|
|---|
| 2 | * Copyright (c) 2019 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_BITS_THREAD_PACKAGED_TASK
|
|---|
| 30 | #define LIBCPP_BITS_THREAD_PACKAGED_TASK
|
|---|
| 31 |
|
|---|
| 32 | namespace std
|
|---|
| 33 | {
|
|---|
| 34 | /**
|
|---|
| 35 | * 30.6.9, class template packaged_task:
|
|---|
| 36 | */
|
|---|
| 37 |
|
|---|
| 38 | template<class>
|
|---|
| 39 | class packaged_task; // undefined
|
|---|
| 40 |
|
|---|
| 41 | template<class R, class... Args>
|
|---|
| 42 | class packaged_task<R(Args...)>
|
|---|
| 43 | {
|
|---|
| 44 | packaged_task() noexcept
|
|---|
| 45 | {}
|
|---|
| 46 |
|
|---|
| 47 | template<class F>
|
|---|
| 48 | explicit packaged_task(F&& f)
|
|---|
| 49 | {}
|
|---|
| 50 |
|
|---|
| 51 | template<class F, class Allocator>
|
|---|
| 52 | explicit packaged_task(allocator_arg_t, const Allocator& a, F&& f)
|
|---|
| 53 | {}
|
|---|
| 54 |
|
|---|
| 55 | ~packaged_task()
|
|---|
| 56 | {}
|
|---|
| 57 |
|
|---|
| 58 | packaged_task(const packaged_task&) = delete;
|
|---|
| 59 | packaged_task& operator=(const packaged_task&) = delete;
|
|---|
| 60 |
|
|---|
| 61 | packaged_task(packaged_task&& rhs)
|
|---|
| 62 | {}
|
|---|
| 63 |
|
|---|
| 64 | packaged_task& operator=(packaged_task&& rhs)
|
|---|
| 65 | {}
|
|---|
| 66 |
|
|---|
| 67 | void swap(packaged_task& other) noexcept
|
|---|
| 68 | {}
|
|---|
| 69 |
|
|---|
| 70 | bool valid() const noexcept
|
|---|
| 71 | {}
|
|---|
| 72 |
|
|---|
| 73 | future<R> get_future()
|
|---|
| 74 | {}
|
|---|
| 75 |
|
|---|
| 76 | void operator()(Args...)
|
|---|
| 77 | {}
|
|---|
| 78 |
|
|---|
| 79 | void make_ready_at_thread_exit(Args...)
|
|---|
| 80 | {}
|
|---|
| 81 |
|
|---|
| 82 | void reset()
|
|---|
| 83 | {}
|
|---|
| 84 | };
|
|---|
| 85 |
|
|---|
| 86 | template<class R, class... Args>
|
|---|
| 87 | void swap(packaged_task<R(Args...)>& lhs, packaged_task<R(Args...)>& rhs) noexcept
|
|---|
| 88 | {
|
|---|
| 89 | lhs.swap(rhs);
|
|---|
| 90 | };
|
|---|
| 91 |
|
|---|
| 92 | template<class R, class Alloc>
|
|---|
| 93 | struct uses_allocator<packaged_task<R>, Alloc>: true_type
|
|---|
| 94 | { /* DUMMY BODY */ };
|
|---|
| 95 | }
|
|---|
| 96 |
|
|---|
| 97 | #endif
|
|---|