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
|
%%% -*- coding: utf-8; erlang-indent-level: 2 -*-
%%% -------------------------------------------------------------------
%%% Copyright 2010-2021 Manolis Papadakis <manopapad@gmail.com>,
%%% Eirini Arvaniti <eirinibob@gmail.com>,
%%% and Kostis Sagonas <kostis@cs.ntua.gr>
%%%
%%% This file is part of PropEr.
%%%
%%% PropEr is free software: you can redistribute it and/or modify
%%% it under the terms of the GNU General Public License as published by
%%% the Free Software Foundation, either version 3 of the License, or
%%% (at your option) any later version.
%%%
%%% PropEr is distributed in the hope that it will be useful,
%%% but WITHOUT ANY WARRANTY; without even the implied warranty of
%%% MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
%%% GNU General Public License for more details.
%%%
%%% You should have received a copy of the GNU General Public License
%%% along with PropEr. If not, see <http://www.gnu.org/licenses/>.
%%% @copyright 2010-2021 Manolis Papadakis, Eirini Arvaniti, and Kostis Sagonas
%%% @version {@version}
%%% @author Manolis Papadakis
%%% @doc Auto-ADT usage example: list-based implementation of a stack, with
%%% element counting.
-module(stack_adt).
-export([is_empty/1, size/1, new/0, push/2, pop/1, safe_pop/1]).
-export_type([stack/1]).
-opaque stack(T) :: {non_neg_integer(),[T]}.
%% NOTE: You don't need to include the PropEr header if no properties are
%% declared in the module.
-include_lib("proper/include/proper.hrl").
%% NOTE: You also don't need to include the EUnit header if there are no tests.
-include_lib("eunit/include/eunit.hrl").
%% NOTE: Every instance of the ADT in a spec must have variables as parameters.
%% When this would mean singleton variables, use variables starting with
%% an underscore.
-spec is_empty(stack(_T)) -> boolean().
is_empty({0, []}) -> true;
is_empty({_N, [_Top|_Rest]}) -> false.
-spec size(stack(_T)) -> non_neg_integer().
size({N, _Elems}) -> N.
-spec new() -> stack(_T).
new() -> {0, []}.
-spec push(T, stack(T)) -> stack(T).
push(X, {N,Elems}) -> {N+1, [X|Elems]}.
-spec pop(stack(T)) -> {T,stack(T)}.
pop({0, []}) -> throw(stack_empty);
pop({N, [Top|Rest]}) when N > 0 -> {Top, {N-1,Rest}}.
-spec safe_pop(stack(T)) -> {'ok',T,stack(T)} | 'error'.
safe_pop({0, []}) -> error;
safe_pop({N, [Top|Rest]}) when N > 0 -> {ok, Top, {N-1,Rest}}.
%%--------------------------------------------------------------------
%% Properties
%%--------------------------------------------------------------------
prop_push_pop() ->
?FORALL({X,S}, {integer(),stack(integer())},
begin
{Y,_} = pop(push(X,S)),
X =:= Y
end).
%%--------------------------------------------------------------------
%% EUnit tests
%%--------------------------------------------------------------------
stack_ADT_test_() ->
Opts = [{constraint_tries,100}],
{"Push/pop", ?_assert(proper:quickcheck(prop_push_pop(), Opts))}.
|
