50 if (ptEqualBlk_ ==
true) {
51 if (ptEqn != blkEqn)
return(-1);
55 ptEqns_->insert(std::pair<int,int>(ptEqn, blkEqn));
63 std::pair<int, int> newpair;
64 std::map<int,std::pair<int,int> >::iterator
65 b_iter = blkEqns_->find(blkEqn);
67 if (b_iter == blkEqns_->end()) {
68 newpair.first = ptEqn;
69 newpair.second = blkSize;
70 blkEqns_->insert(std::pair<
int,std::pair<int,int> >(blkEqn, newpair));
73 newpair = (*b_iter).second;
74 if (newpair.first > ptEqn) {
75 newpair.first = ptEqn;
76 newpair.second = blkSize;
77 (*b_iter).second = newpair;
87 if (ptEqualBlk_ ==
true)
return(0);
89 std::pair<int,int> newpair;
90 std::map<int,std::pair<int,int> >::iterator
91 b_iter = blkEqns_->find(blkEqn);
92 if (b_iter == blkEqns_->end()) {
96 newpair = (*b_iter).second;
97 newpair.second = size;
98 (*b_iter).second = newpair;
100 if (maxSize_ < size) maxSize_ = size;
150 if (ptEqualBlk_ ==
true) {
156 std::map<int,std::pair<int,int> >::iterator
157 b_iter = blkEqns_->find(blkEqn);
158 if (b_iter == blkEqns_->end()) {
162 ptEqn = (*b_iter).second.first;
163 blkSize = (*b_iter).second.second;
173 if (ptEqualBlk_ ==
true) {
179 std::map<int,int>::iterator
180 p_iter = ptEqns_->find(ptEqn);
181 if (p_iter == ptEqns_->end()) {
185 blkEqn = (*p_iter).second;
187 std::map<int,std::pair<int,int> >::iterator
188 b_iter = blkEqns_->find(blkEqn);
190 std::pair<int,int> bpair = (*b_iter).second;
192 blkOffset = ptEqn - bpair.first;