File: indexableset.cpp

package info (click to toggle)
aoflagger 3.5.1-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 6,000 kB
  • sloc: cpp: 67,891; python: 497; sh: 242; makefile: 22
file content (95 lines) | stat: -rw-r--r-- 3,392 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
#include "indexableset.h"

#include <limits>

namespace imagesets {

bool IndexableSet::FindExtremeBaseline(imagesets::ImageSet* imageSet,
                                       imagesets::ImageSetIndex& index,
                                       bool longest) {
  imagesets::IndexableSet* iSet =
      dynamic_cast<imagesets::IndexableSet*>(imageSet);
  if (iSet != nullptr) {
    double extremeSq = longest ? 0.0 : std::numeric_limits<double>::max();
    const size_t antCount = iSet->AntennaCount();
    std::vector<AntennaInfo> antennas(antCount);
    for (size_t a = 0; a != antCount; a++)
      antennas[a] = iSet->GetAntennaInfo(a);

    imagesets::ImageSetIndex loopIndex(iSet->StartIndex());
    if (loopIndex.HasWrapped()) return false;
    const size_t band = iSet->GetBand(index),
                 sequenceId = iSet->GetSequenceId(index);
    while (!loopIndex.HasWrapped()) {
      if (sequenceId == iSet->GetSequenceId(loopIndex) &&
          band == iSet->GetBand(loopIndex)) {
        const size_t a1 = iSet->GetAntenna1(loopIndex);
        const size_t a2 = iSet->GetAntenna2(loopIndex);
        const AntennaInfo &ant1 = antennas[a1], &ant2 = antennas[a2];
        const double distSq = ant1.position.DistanceSquared(ant2.position);
        if (longest) {
          if (distSq > extremeSq) {
            extremeSq = distSq;
            index = loopIndex;
          }
        } else {
          if (distSq < extremeSq && a1 != a2) {
            extremeSq = distSq;
            index = loopIndex;
          }
        }
      }
      loopIndex.Next();
    }
    if (!longest && extremeSq == std::numeric_limits<double>::max())
      return false;
    else
      return true;
  }
  return false;
}

bool IndexableSet::FindMedianBaseline(imagesets::ImageSet* imageSet,
                                      imagesets::ImageSetIndex& index) {
  imagesets::IndexableSet* iSet =
      dynamic_cast<imagesets::IndexableSet*>(imageSet);
  if (iSet == nullptr) {
    return false;
  } else {
    const size_t antCount = iSet->AntennaCount();
    std::vector<AntennaInfo> antennas(antCount);
    for (size_t a = 0; a != antCount; a++)
      antennas[a] = iSet->GetAntennaInfo(a);

    imagesets::ImageSetIndex loopIndex(iSet->StartIndex());
    const size_t band = iSet->GetBand(index),
                 sequenceId = iSet->GetSequenceId(index);
    std::vector<std::pair<double, imagesets::ImageSetIndex>> distances;
    while (!loopIndex.HasWrapped()) {
      if (sequenceId == iSet->GetSequenceId(loopIndex) &&
          band == iSet->GetBand(loopIndex)) {
        const size_t a1 = iSet->GetAntenna1(loopIndex);
        const size_t a2 = iSet->GetAntenna2(loopIndex);
        const AntennaInfo &ant1 = antennas[a1], &ant2 = antennas[a2];
        distances.emplace_back(ant1.position.DistanceSquared(ant2.position),
                               loopIndex);
      }
      loopIndex.Next();
    }
    const size_t n = distances.size();
    if (n == 0) {
      return false;
    } else {
      std::nth_element(
          distances.begin(), distances.begin() + n / 2, distances.end(),
          [](const std::pair<double, imagesets::ImageSetIndex>& l,
             const std::pair<double, imagesets::ImageSetIndex>& r) {
            return l.first < r.first;
          });
      index = (distances.begin() + n / 2)->second;
      return true;
    }
  }
}

}  // namespace imagesets