rishi/scryer-prolog
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Merge pull request #2534 from hurufu/document_non_counted_backtracking

Browse Source 
Document non counted backtracking
This commit is contained in:
Mark Thom
2024-09-16 17:41:53 -06:00
committed by GitHub
parent a898d7a667 4b0f9558b3
commit 0bc3d67298
2 changed files with 11 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
src/lib/iso_ext.pl
View File

@@ -223,6 +223,7 @@ run_cleaners_without_handling(Cp) :-
%% call_with_inference_limit(Goal, Limit, Result). %% call_with_inference_limit(Goal, Limit, Result).
% %
% Similar to `call(Goal)` but it limits the number of inferences for each solution of Goal. % Similar to `call(Goal)` but it limits the number of inferences for each solution of Goal.
% Calls to it may be nested, but only the last limit will be in power.
call_with_inference_limit(G, L, R) :- call_with_inference_limit(G, L, R) :-
( integer(L) -> ( integer(L) ->
( L < 0 -> ( L < 0 ->

13
src/lib/ops_and_meta_predicates.pl
View File

@@ -5,9 +5,16 @@
:- op(1199, fx, meta_predicate). :- op(1199, fx, meta_predicate).
/* this is an implementation specific declarative operator used to implement call_with_inference_limit/3 % Implementation specific declarative operator used to implement
and setup_call_cleanup/3. switches to the default trust_me and retry_me_else. Indexing choice % call_with_inference_limit/3 and setup_call_cleanup/3. Compiler switches
instructions are unchanged. */ % to the default trust_me, retry_me_else and some other instructions for all
% predicates that are marked with it. Indexing choice instructions are unchanged.
%
% Implementation details:
% Default instructions are not subject to inference counting, so their
% execution will not be considered if they happen to be called by
% call_with_inference_limit/3.
%
:- op(700, fx, non_counted_backtracking). :- op(700, fx, non_counted_backtracking).
% arithmetic operators. % arithmetic operators.