1 | // toipullproducer.cc
|
---|
2 | // Eric Aubourg CEA/DAPNIA/SPP octobre 1999
|
---|
3 |
|
---|
4 |
|
---|
5 | #include "toipullproducer.h"
|
---|
6 |
|
---|
7 | TOIPullProducer::TOIPullProducer() {
|
---|
8 | needBefore = needAfter = 0;
|
---|
9 | }
|
---|
10 |
|
---|
11 | bool TOIPullProducer::canGetValue(long sampleNum, TOI const& toi) {
|
---|
12 | map<TOI, TOIProducer*> m = neededTOIs[toi];
|
---|
13 | for (map<TOI, TOIProducer*>::iterator i = m.begin(); i != m.end(); i++) {
|
---|
14 | if (!(*i).second->canGetValue(sampleNum-needBefore, (*i).first) ||
|
---|
15 | !(*i).second->canGetValue(sampleNum+needAfter, (*i).first)) return false;
|
---|
16 | }
|
---|
17 | return true;
|
---|
18 | }
|
---|
19 |
|
---|
20 | bool TOIPullProducer::canGetPrevValue(long sampleNum, TOI const& toi) {
|
---|
21 | return canGetValue(sampleNum-1, toi);
|
---|
22 | }
|
---|
23 |
|
---|
24 | bool TOIPullProducer::canGetNextValue(long sampleNum, TOI const& toi) {
|
---|
25 | return canGetValue(sampleNum+1, toi);
|
---|
26 | }
|
---|
27 |
|
---|
28 | bool TOIPullProducer::canGetValueLater(long sampleNum, TOI const& toi) {
|
---|
29 | map<TOI, TOIProducer*> m = neededTOIs[toi];
|
---|
30 | for (map<TOI, TOIProducer*>::iterator i = m.begin(); i != m.end(); i++) {
|
---|
31 | if (!(*i).second->canGetValueLater(sampleNum+needAfter, (*i).first)) return false;
|
---|
32 | }
|
---|
33 | return true;
|
---|
34 | }
|
---|
35 |
|
---|
36 |
|
---|
37 | double TOIPullProducer::getPrevValue(long& sampleNum, TOI const& toi) {
|
---|
38 | return getValue(--sampleNum, toi);
|
---|
39 | }
|
---|
40 |
|
---|
41 | double TOIPullProducer::getNextValue(long& sampleNum, TOI const& toi) {
|
---|
42 | return getValue(++sampleNum, toi);
|
---|
43 | }
|
---|
44 |
|
---|
45 |
|
---|
46 | long TOIPullProducer::firstSampleNum(TOI const& toi) {
|
---|
47 | long xx = -999999999L;
|
---|
48 | map<TOI, TOIProducer*> m = neededTOIs[toi];
|
---|
49 | for (map<TOI, TOIProducer*>::iterator i = m.begin(); i != m.end(); i++) {
|
---|
50 | long x = (*i).second->firstSampleNum((*i).first) + needBefore;
|
---|
51 | if (x > xx) xx=x;
|
---|
52 | }
|
---|
53 | return xx;
|
---|
54 | }
|
---|
55 |
|
---|
56 | long TOIPullProducer::lastSampleNum(TOI const& toi) {
|
---|
57 | long xx = 999999999L;
|
---|
58 | map<TOI, TOIProducer*> m = neededTOIs[toi];
|
---|
59 | for (map<TOI, TOIProducer*>::iterator i = m.begin(); i != m.end(); i++) {
|
---|
60 | long x = (*i).second->lastSampleNum((*i).first) - needAfter;
|
---|
61 | if (x < xx) xx=x;
|
---|
62 | }
|
---|
63 | return xx;
|
---|
64 | }
|
---|
65 |
|
---|
66 | void TOIPullProducer::propagateLowBound(TOI const& toi, long sampleNum) {
|
---|
67 | CHKPROD
|
---|
68 | map<TOI, TOIProducer*> need = neededTOIs[toi];
|
---|
69 | for (map<TOI, TOIProducer*>::iterator i = need.begin(); i != need.end(); i++) {
|
---|
70 | (*i).second->wontNeedEarlier((*i).first, this, sampleNum-needBefore);
|
---|
71 | }
|
---|
72 | }
|
---|