Merge pull request #849 from triska/master
Remove duplicated definitions
This commit is contained in:
@@ -49,17 +49,6 @@
|
||||
Compatibility predicates.
|
||||
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - */
|
||||
|
||||
group_pairs_by_key([], []).
|
||||
group_pairs_by_key([M-N|T0], [M-[N|TN]|T]) :-
|
||||
same_key(M, T0, TN, T1),
|
||||
group_pairs_by_key(T1, T).
|
||||
|
||||
same_key(M0, [M-N|T0], [N|TN], T) :-
|
||||
M0 == M,
|
||||
!,
|
||||
same_key(M, T0, TN, T).
|
||||
same_key(_, L, [], L).
|
||||
|
||||
must_be(What, Term) :- must_be(What, unknown(Term)-1, Term).
|
||||
|
||||
must_be(acyclic, Where, Term) :- !,
|
||||
|
||||
@@ -6985,10 +6985,6 @@ cumulative(Tasks, Options) :-
|
||||
resource_limit(Start, End, Tasks, Bss, L)
|
||||
).
|
||||
|
||||
min_(E, M0, M) :- M is min(E,M0).
|
||||
|
||||
max_(E, M0, M) :- M is max(E,M0).
|
||||
|
||||
/* - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
|
||||
Trivial lower and upper bounds, assuming no gaps and not necessarily
|
||||
retaining the rectangular shape of each task.
|
||||
|
||||
Reference in New Issue
Block a user