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
// *****************************************************************************
/*!
  \file      src/Base/Callback.hpp
  \copyright 2012-2015 J. Bakosi,
             2016-2018 Los Alamos National Security, LLC.,
             2019-2021 Triad National Security, LLC.,
             2022-2025 J. Bakosi
             All rights reserved. See the LICENSE file for details.
  \brief     Tagged tuple types used for passing Charm++ callbacks
  \details   Tagged tuple types used for passing Charm++ callbacks.
*/
// *****************************************************************************
#pragma once

#include "NoWarning/charm++.hpp"<--- Include file: "NoWarning/charm++.hpp" not found.

#include "TaggedTuple.hpp"

namespace tag {
struct load;
struct partitioned;
struct distributed;
struct refinserted;
struct queried;
struct responded;
struct compatibility;
struct bndint;
struct matched;
struct refined;
struct discinserted;
struct workinserted;
} // tag::

namespace tk {

using PartitionerCallback =
  tk::TaggedTuple< brigand::list<
      tag::queried,        CkCallback
    , tag::responded,      CkCallback
    , tag::load,           CkCallback
    , tag::partitioned,    CkCallback
    , tag::distributed,    CkCallback
    , tag::refinserted,    CkCallback
  > >;

using RefinerCallback =
  tk::TaggedTuple< brigand::list<
      tag::queried,        CkCallback
    , tag::responded,      CkCallback
    , tag::compatibility,  CkCallback
    , tag::bndint,         CkCallback
    , tag::matched,        CkCallback
    , tag::refined,        CkCallback
  > >;

using SorterCallback =
  tk::TaggedTuple< brigand::list<
      tag::queried,        CkCallback
    , tag::responded,      CkCallback
    , tag::discinserted,   CkCallback
    , tag::workinserted,   CkCallback
  > >;

} // tk::