Printing out interval value



Hi Folks,

I am playing with CLP(R)-based Scheduling algorithm from Bratko's book
(Fig 14.4) using SWI Prolog and have the following question. I would
really appreciate if someone can help me.

The output of this algorithm is formated as array of
Task/Processor/Start/Duration elements, i.e. [t1/1/0.0/2, ... ] . In
case where the Start time is exact number, everything works fine.
However, in some cases, there is flexibility to start certain step
withing particular time interval without affecting the complete
processing time. It means that start time is not the concrete value
but interval. Something like {2 =< Start =< 4} . When I am trying to
print out the result array, what I see is uninitialized variable Start,
i.e. [t2/_G97261{itf = ...}/2/2, ...] . Based on the calculated time I
think that the algorithm works correct even in this case. But obviously,
I would like to see the calculated interval values somehow. So my
question is - what is the right way (if any) in SWI to get upper and
lower bound of the calculated variable (interval) and what does "itf =
...." means?


Thank you very much,
Andrey.
.



Relevant Pages

  • Re: regex question - trying to find ".mp3" in a SELECT box
    ... But `Array' is a Function object reference. ... Establish a new execution context using F's FormalParameterList, ... Since is not a primitive value, the exception should be thrown. ... | 5.2 Algorithm Conventions ...
    (comp.lang.javascript)
  • Re: Reference to derived type element by index?
    ... as a set of distinctively-named scalars. ... In another scope, the same common block ... would be a single array. ... algorithm and a specific application of the algorithm, ...
    (comp.lang.fortran)
  • Re: counting subsets of S so that sum(S_n) = N
    ... and make my algorithm generate only unique subsets? ... and the array of boolean at one step of the algorithm is ... implementation without needing recursion. ... subsequence in W, process it and return. ...
    (comp.programming)
  • [SUMMARY] Maximum Sub-Array (#131)
    ... # sum the integer values of array contents ... algorithm, ... all possible lengths, to check each subarray. ... $ time ruby -r max_sub_array ...
    (comp.lang.ruby)
  • Re: Collatz at the Hilbert Hotel
    ... equivalence of the Hilbert algorithm to the standard Collatz ... ## ca is the one-dimensional array of cells. ... In this example, the life-form ...
    (sci.math)