Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Void.h
Go to the documentation of this file.
1
6/*
7 * This file is part of Algorithms library toolkit.
8 * Copyright (C) 2017 Jan Travnicek (jan.travnicek@fit.cvut.cz)
9
10 * Algorithms library toolkit is free software: you can redistribute it and/or modify
11 * it under the terms of the GNU General Public License as published by
12 * the Free Software Foundation, either version 3 of the License, or
13 * (at your option) any later version.
14
15 * Algorithms library toolkit is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 * GNU General Public License for more details.
19
20 * You should have received a copy of the GNU General Public License
21 * along with Algorithms library toolkit. If not, see <http://www.gnu.org/licenses/>.
22 */
23
24#pragma once
25
26#include <alib/string>
27
28namespace object {
29
34class Void {
35public:
40 explicit Void ( );
41
49 std::strong_ordering operator <=> ( const Void & ) const {
50 return std::strong_ordering::equal;
51 }
52
60 bool operator == ( const Void & ) const {
61 return true;
62 }
63
72 friend std::ostream & operator <<( std::ostream & out, const Void & );
73
78 static Void VOID;
79
80};
81
82} /* namespace object */
83
Represents void object.
Definition: Void.h:34
bool operator==(const Void &) const
Definition: Void.h:60
Void()
Creates a new instance of void object.
friend std::ostream & operator<<(std::ostream &out, const Void &)
Definition: Void.cpp:14
std::strong_ordering operator<=>(const Void &) const
Definition: Void.h:49
static Void VOID
Singleton instance of the void object.
Definition: Void.h:78
Definition: AnyObject.h:28