accessor2D_multiplexed.cpp

A special case: The 2D register might have multiplexed data on the backend side (backend specific implementation of the TwoDRegisterAccessor).

A special case: The 2D register might have multiplexed data on the backend side (backend specific implementation of the TwoDRegisterAccessor).

// SPDX-FileCopyrightText: Deutsches Elektronen-Synchrotron DESY, MSK, ChimeraTK Project <chimeratk-support@desy.de>
// SPDX-License-Identifier: LGPL-3.0-or-later
 
#include <ChimeraTK/Device.h>
#include <ChimeraTK/Utilities.h>
 
#include <iostream>
 
int main() {
  ChimeraTK::setDMapFilePath("example.dmap");
 
  ChimeraTK::Device myDevice("MY_DEVICE");
  myDevice.open();
 
  /*
   * We populate the memory region with multiple multiplexed sequences
   * so that we can use this for demonstrating the demultiplexing of the
   * TwoDRegisterAccessor (for some implementations depeding on the backend).
   *
   * In this example we only have 4 sequences with 4 samples each.
   * We write numbers 0 to 15 as multiplexed data and expect the following
   * result: sequence 0:  0   4   8   12 sequence 1:  1   5   9   13 sequence 2:
   * 2   6   10  14 sequence 3:  3   7   11  15
   *
   * We use a register named AREA_DATA_RAW which provides plain access to the
   * data region.
   */
  auto dataRegion = myDevice.getOneDRegisterAccessor<double>("ADC/AREA_DATA_RAW");
  int counter = 0;
  for(auto& dataWord : dataRegion) {
    dataWord = counter++;
  }
  dataRegion.write();
 
  /*
   * Now check how it looks using the TwoDRegisterAccessor. We just copy it from
   * the accessor2D.cpp example.
   */
  ChimeraTK::TwoDRegisterAccessor<double> twoDAccessor = myDevice.getTwoDRegisterAccessor<double>("ADC/DATA");
  twoDAccessor.read();
 
  for(size_t i = 0; i < twoDAccessor.getNChannels(); ++i) {
    std::cout << "Channel " << i << ":";
    std::vector<double>& channel = twoDAccessor[i];
    for(double sample : channel) {
      std::cout << " " << sample;
    }
    std::cout << std::endl;
  }
 
  myDevice.close();
 
  return 0;
}