DFT interface and implementations

aux/inc/WireCellAux/DftTools.h

@@ -0,0 +1,69 @@
+/**
+   This provides std::vector and Eigen::Array typed interface to an
+   IDFT.
+ */
+
+#ifndef WIRECELL_AUX_DFTTOOLS
+#define WIRECELL_AUX_DFTTOOLS
+
+#include "WireCellIface/IDFT.h"
+#include <vector>
+#include <Eigen/Core>
+
+namespace WireCell::Aux {
+
+    using complex_t = IDFT::complex_t;
+
+    // std::vector based functions
+
+    using dft_vector_t = std::vector<complex_t>;
+
+    // 1D with vectors
+
+    inline dft_vector_t fwd(IDFT::pointer dft, const dft_vector_t& seq)
+    {
+        dft_vector_t ret(seq.size());
+        dft->fwd1d(seq.data(), ret.data(), ret.size());
+        return ret;
+    }
+
+    inline dft_vector_t inv(IDFT::pointer dft, const dft_vector_t& spec)
+    {
+        dft_vector_t ret(spec.size());
+        dft->inv1d(spec.data(), ret.data(), ret.size());
+        return ret;
+    }
+
+    // Eigen array based functions
+
+    /// A complex, 2D array.  Use Array::cast<type>() if you need to
+    /// convert to/from real.
+    using dft_array_t = Eigen::ArrayXXcf;
+
+    // 2D with Eigen arrays.  Use eg arr.cast<complex_>() to provde
+    // from real or arr.real()() to convert result to real.
+
+    // Transform both dimesions.
+    dft_array_t fwd(IDFT::pointer dft, const dft_array_t& arr);
+    dft_array_t inv(IDFT::pointer dft, const dft_array_t& arr);
+
+    // Transform a 2D array along one axis.
+    //
+    // The axis identifies the logical array "dimension" over which
+    // the transform is applied.  For example, axis=1 means the
+    // transforms are applied along columns (ie, on a per-row basis).
+    // Note: this is the same convention as held by numpy.fft.
+    //
+    // The axis is interpreted in the "logical" sense Eigen arrays
+    // indexed as array(irow, icol).  Ie, the dimension traversing
+    // rows is axis 0 and the dimension traversing columns is axis 1.
+    // Note: internal storage order of an Eigen array may differ from
+    // the logical order and indeed that of the array template type
+    // order.  Neither is pertinent in setting the axis.
+    dft_array_t fwd(IDFT::pointer dft, const dft_array_t& arr, int axis);
+    dft_array_t inv(IDFT::pointer dft, const dft_array_t& arr, int axis);
+
+
+}
+
+#endif

aux/inc/WireCellAux/FftwDFT.h

@@ -0,0 +1,57 @@
+#ifndef WIRECELLAUX_FFTWDFT
+#define WIRECELLAUX_FFTWDFT
+
+#include "WireCellIface/IDFT.h"
+
+namespace WireCell::Aux {
+
+    /** 
+        The FftwDFT component provides IDFT based on FFTW3.
+
+        All instances share a common thread-safe plan cache.  There is
+        no benefit to using more than one instance in a process.
+
+        See IDFT.h for important comments.
+    */
+    class FftwDFT : public IDFT {
+      public:
+
+        FftwDFT();
+        virtual ~FftwDFT();
+
+        // 1d 
+
+        virtual 
+        void fwd1d(const complex_t* in, complex_t* out,
+                   int size) const;
+
+        virtual 
+        void inv1d(const complex_t* in, complex_t* out,
+                   int size) const;
+
+        virtual 
+        void fwd1b(const complex_t* in, complex_t* out,
+                   int nrows, int ncols, int axis) const;
+
+        virtual 
+        void inv1b(const complex_t* in, complex_t* out,
+                   int nrows, int ncols, int axis) const;
+
+        virtual 
+        void fwd2d(const complex_t* in, complex_t* out,
+                   int nrows, int ncols) const;
+        virtual 
+        void inv2d(const complex_t* in, complex_t* out,
+                   int nrows, int ncols) const;
+
+        virtual
+        void transpose(const scalar_t* in, scalar_t* out,
+                       int nrows, int ncols) const;
+        virtual
+        void transpose(const complex_t* in, complex_t* out,
+                       int nrows, int ncols) const;
+
+    };
+}
+
+#endif

aux/inc/WireCellAux/Semaphore.h

@@ -0,0 +1,34 @@
+/** Implement a semaphore component interace. */
+
+#ifndef WIRECELLAUX_SEMAPHORE
+#define WIRECELLAUX_SEMAPHORE
+
+#include "WireCellIface/IConfigurable.h"
+#include "WireCellIface/ISemaphore.h"
+#include "WireCellUtil/Semaphore.h"
+
+
+namespace WireCell::Aux {
+    class Semaphore : public ISemaphore,
+                      public IConfigurable
+    {
+      public:
+        Semaphore();
+        virtual ~Semaphore();
+
+        // IConfigurable interface
+        virtual void configure(const WireCell::Configuration& config);
+        virtual WireCell::Configuration default_configuration() const;
+
+        // ISemaphore
+        virtual void acquire() const;
+        virtual void release() const;
+
+      private:
+
+        mutable FastSemaphore m_sem;
+
+    };
+}  // namespace WireCell::Pytorch
+
+#endif  // WIRECELLPYTORCH_TORCHSERVICE

aux/inc/WireCellAux/SimpleTensor.h

@@ -2,7 +2,9 @@
 #define WIRECELL_AUX_SIMPLETENSOR
 
 #include "WireCellIface/ITensor.h"
+
 #include <boost/multi_array.hpp>
+#include <cstring>
 
 namespace WireCell {
 
@@ -13,14 +15,26 @@ namespace WireCell {
            public:
             typedef ElementType element_t;
 
-            SimpleTensor(const shape_t& shape)
+            // Create simple tensor, allocating space for data.  If
+            // data given it must have at least as many elements as
+            // implied by shape and that span will be copied into
+            // allocated memory.
+            SimpleTensor(const shape_t& shape,
+                         const element_t* data=nullptr,
+                         const Configuration& md = Configuration())
             {
                 size_t nbytes = element_size();
-                for (const auto& s : shape) {
+                m_shape = shape;
+                for (const auto& s : m_shape) {
                     nbytes *= s;
                 }
-                m_store.resize(nbytes);
-                m_shape = shape;
+                if (data) {
+                    const std::byte* bytes = reinterpret_cast<const std::byte*>(data);
+                    m_store.assign(bytes, bytes+nbytes);
+                }
+                else {
+                    m_store.resize(nbytes);
+                }
             }
             virtual ~SimpleTensor() {}
 

aux/inc/WireCellAux/TensorTools.h

@@ -0,0 +1,77 @@
+#ifndef WIRECELL_AUX_TENSORTOOLS
+#define WIRECELL_AUX_TENSORTOOLS
+
+#include "WireCellIface/ITensor.h"
+#include "WireCellIface/IDFT.h"
+#include "WireCellUtil/Exceptions.h"
+
+#include <Eigen/Core>
+#include <complex>
+
+namespace WireCell::Aux {
+
+    bool is_row_major(const ITensor::pointer& ten) {
+        if (ten->order().empty() or ten->order()[0] == 1) {
+            return true;
+        }
+        return false;
+    }
+
+    template<typename scalar_t>
+    bool is_type(const ITensor::pointer& ten) {
+        return (ten->element_type() == typeid(scalar_t));
+    }
+
+
+    // Extract the underlying data array from the tensor as a vector.
+    // Caution: this ignores storage order hints and 1D or 2D will be
+    // flattened assuming C-ordering, aka row-major (if 2D).  It
+    // throws ValueError on type mismatch.
+    template<typename element_type>
+    std::vector<element_type> asvec(const ITensor::pointer& ten)
+    {
+        if (ten->element_type() != typeid(element_type)) {
+            THROW(ValueError() << errmsg{"element type mismatch"});
+        }
+        const element_type* data = (const element_type*)ten->data();
+        const size_t nelems = ten->size()/sizeof(element_type);
+        return std::vector<element_type>(data, data+nelems);
+    }
+
+    // Extract the tensor data as an Eigen array.
+    template<typename element_type>
+    Eigen::Array<element_type, Eigen::Dynamic, Eigen::Dynamic> // this default is column-wise
+    asarray(const ITensor::pointer& tens)
+    {
+        if (tens->element_type() != typeid(element_type)) {
+            THROW(ValueError() << errmsg{"element type mismatch"});
+        }
+        using ROWM = Eigen::Array<element_type, Eigen::Dynamic, Eigen::Dynamic, Eigen::RowMajor>;
+        using COLM = Eigen::Array<element_type, Eigen::Dynamic, Eigen::Dynamic, Eigen::ColMajor>;
+
+        auto shape = tens->shape();
+        int nrows, ncols;
+        if (shape.size() == 1) {
+            nrows = 1;
+            ncols = shape[0];
+        }
+        else {
+            nrows = shape[0];
+            ncols = shape[1];
+        }
+
+        // Eigen::Map is a non-const view of data but a copy happens
+        // on return.  We need to temporarily break const correctness.
+        const element_type* cdata = reinterpret_cast<const element_type*>(tens->data());
+        element_type* mdata = const_cast<element_type*>(cdata);
+
+        if (is_row_major(tens)) {
+            return Eigen::Map<ROWM>(mdata, nrows, ncols);
+        }
+        // column-major
+        return Eigen::Map<COLM>(mdata, nrows, ncols);
+    }
+
+}
+
+#endif