QPQ-AG/gmbytecode
10
0
Fork 0
Code Issues 1 Pull Requests 1 Actions Packages Projects Releases 9 Wiki Activity

Update properties

Browse Source
This commit is contained in:
Thomas Arts 2019-08-23 15:00:12 +02:00
parent d794566363
commit f31887c2ed
1 changed files with 28 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

38
quickcheck/aefate_eqc.erl
View File

@ -24,7 +24,7 @@ prop_roundtrip() ->
end)). end)).
prop_format_scan() -> prop_format_scan() ->
?FORALL(FateData, fate_data(), ?FORALL(FateData, fate_data([variant, map]),
?WHENFAIL(eqc:format("Trying to format ~p failed~n", [FateData]), ?WHENFAIL(eqc:format("Trying to format ~p failed~n", [FateData]),
begin begin
String = aeb_fate_data:format(FateData), String = aeb_fate_data:format(FateData),
@ -72,13 +72,14 @@ prop_fuzz() ->
prop_order() -> prop_order() ->
?FORALL(Items, vector(3, fate_data()), ?FORALL(Items, vector(3, fate_data([variant, map])),
begin begin
%% Use lt to take minimum %% Use lt to take minimum
Min = lt_min(Items), Min = lt_min(Items),
Max = lt_max(Items), Max = lt_max(Items),
conjunction([ {minimum, is_empty([ {Min, '>', I} || I<-Items, aeb_fate_data:lt(I, Min)])}, conjunction([ {minimum, is_empty([ {Min, '>', I} || I<-Items, aeb_fate_data:lt(I, Min)])},
{maximum, is_empty([ {Max, '<', I} || I<-Items, aeb_fate_data:lt(Max, I)])}]) {maximum, is_empty([ {Max, '<', I} || I<-Items, aeb_fate_data:lt(Max, I)])},
{asym, aeb_fate_data:lt(Min, Max) orelse Min == Max}])
end). end).
lt_min([X, Y | Rest]) -> lt_min([X, Y | Rest]) ->
@ -101,18 +102,24 @@ prop_idempotent() ->
aeb_fate_encoding:sort(aeb_fate_encoding:sort(Items)))). aeb_fate_encoding:sort(aeb_fate_encoding:sort(Items)))).
fate_data(Kind) ->
?SIZED(Size, ?LET(Data, fate_data(Size, Kind), eqc_symbolic:eval(Data))).
fate_data() -> fate_data() ->
?SIZED(Size, ?LET(Data, fate_data(Size, [map, variant]), eqc_symbolic:eval(Data))). fate_data([map, variant, store_map]).
%% keys may contain variants but no maps
fate_data_key() -> fate_data_key() ->
?SIZED(Size, ?LET(Data, fate_data(Size div 4, [variant]), eqc_symbolic:eval(Data))). fate_data([variant]).
fate_data(0, _Options) -> fate_data(0, Options) ->
?LAZY( ?LAZY(
frequency( frequency(
[{5, oneof([fate_integer(), fate_boolean(), fate_nil(), fate_unit()])}, [{50, oneof([fate_integer(), fate_boolean(), fate_nil(), fate_unit()])},
{1, oneof([fate_string(), fate_address(), fate_bytes(), fate_contract(), {10, oneof([fate_string(), fate_address(), fate_bytes(), fate_contract(),
fate_oracle(), fate_oracle_q(), fate_bits(), fate_channel()])}])); fate_oracle(), fate_oracle_q(), fate_bits(), fate_channel()])}] ++
[{1, fate_store_map()} || lists:member(store_map, Options)]));
fate_data(Size, Options) -> fate_data(Size, Options) ->
?LAZY( ?LAZY(
oneof([fate_data(0, Options), oneof([fate_data(0, Options),
@ -161,9 +168,20 @@ fate_list(Size, Options) ->
fate_map(Size, Options) -> fate_map(Size, Options) ->
?LET(N, choose(0, 6), ?LET(N, choose(0, 6),
?LETSHRINK(Values, fate_values(Size, N, Options), ?LETSHRINK(Values, fate_values(Size, N, Options),
?LET(Keys, vector(length(Values), fate_data(Size div max(1, N * 2), Options -- [map])), ?LET(Keys, vector(length(Values), fate_data(Size div max(1, N * 2), Options -- [map, store_map])),
return(aeb_fate_data:make_map(maps:from_list(lists:zip(Keys, Values))))))). return(aeb_fate_data:make_map(maps:from_list(lists:zip(Keys, Values))))))).
fate_store_map() ->
%% only #{} is allowed as cache in serialization
?LET(X, oneof([int(), largeint()]),
return(aeb_fate_data:make_store_map(abs(X)))).
fate_bad_map() ->
?LET(N, choose(0, 6),
?LET(Values, vector(N, ?SIZED(Size, resize(Size div 8, fate_data()))),
?LET(Keys, vector(N, ?SIZED(Size, resize(Size div 4, fate_data()))),
return(aeb_fate_data:make_map(maps:from_list(lists:zip(Keys, Values))))))).
non_quote_string() -> non_quote_string() ->
?SUCHTHAT(S, utf8(), [ quote || <<34>> <= S ] == []). ?SUCHTHAT(S, utf8(), [ quote || <<34>> <= S ] == []).