header_libraries/tests/daw_maybe_unique_ptr_test.cpp at master · beached/header_libraries · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
// Copyright (c) Darrell Wright
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt)
//
// Official repository: https://github.com/beached/header_libraries
//
#ifdef NDEBUG
#undef NDEBUG
#endif

#include <daw/daw_maybe_unique_ptr.h>

#include <cassert>
#include <memory>

struct Base {
	int x = 55;
	Base( ) = default;
	Base( int v )
	  : x( v ) {}
	virtual ~Base( ) = default;
};

struct Child : Base {
	Child( ) = default;
	Child( int v )
	  : Base( v ) {}
};

int main( ) {
	auto a1 = daw::make_maybe_unique<int>( 5 );
	assert( a1 );
	assert( *a1 == 5 );
	auto a2 = daw::make_maybe_unique<int>( 5 );
	assert( a2 );
	assert( *a2 == 5 );
	assert( a1 != a2 );
	auto b = daw::make_maybe_unique<int[]>( 5 );
	assert( b );
	b[0] = 0;
	b[1] = 1;
	b[2] = 2;
	b[3] = 3;
	b[4] = 4;
	assert( b[1] == 1 );
	auto c = daw::make_maybe_unique_array<int[]>( 1, 2, 3, 4, 5 );
	assert( c );
	assert( c[1] == 2 );
	c.reset( );
	assert( not c );
	c = std::move( b );
	assert( c );
	assert( not b );
	assert( c[1] == 1 );
	auto d = std::move( a1 );
	assert( d );
	assert( not a1 );
	assert( *d == 5 );
	a2.reset( );
	assert( not a2 );

	std::default_delete<int>{ };
	daw::maybe_unique_ptr<Base> my_base = daw::make_maybe_unique<Child>( );
	int x = -1;
	my_base = std::move( my_base ).and_then( [&]( auto p ) {
		x = p->x;
		return p;
	} );
	assert( x == my_base->x );
	my_base = std::move( my_base ).and_then( []( auto p ) {
		return daw::make_maybe_unique<Child>( p->x );
	} );
	daw::maybe_unique_ptr<Child> my_child2 = nullptr;
	auto x2 = std::move( my_child2 )
	            .or_else( []( ) {
		            return daw::make_maybe_unique<Child>( 55 );
	            } )
	            .and_then( []( daw::maybe_unique_ptr<Base> p ) {
		            return daw::make_maybe_unique<Child>( 42 + p->x );
	            } )
	            .or_else( []( ) {
		            return daw::make_maybe_unique<Child>( 23 );
	            } )
	            .transform( []( auto const &p ) {
		            return p->x;
	            } );
	assert( x2 == 97 );
}