summaryrefslogtreecommitdiffstats
path: root/include/framework/interface
diff options
context:
space:
mode:
authorDouglas Rumbaugh <dbr4@psu.edu>2024-02-09 12:30:21 -0500
committerDouglas Rumbaugh <dbr4@psu.edu>2024-02-09 12:30:21 -0500
commit402fc269c0aaa671d84a6d15918735ad4b90e6b2 (patch)
tree145b1658f31a005eda33c9231b2b8ee7bab7915f /include/framework/interface
parent711769574e647839677739192698e400529efe75 (diff)
downloaddynamic-extension-402fc269c0aaa671d84a6d15918735ad4b90e6b2.tar.gz
Comment updates/fixes
Diffstat (limited to 'include/framework/interface')
-rw-r--r--include/framework/interface/Query.h5
-rw-r--r--include/framework/interface/Record.h7
2 files changed, 3 insertions, 9 deletions
diff --git a/include/framework/interface/Query.h b/include/framework/interface/Query.h
index 8cf9660..3d487f0 100644
--- a/include/framework/interface/Query.h
+++ b/include/framework/interface/Query.h
@@ -9,12 +9,9 @@
#pragma once
#include "framework/QueryRequirements.h"
-#include <concepts>
namespace de{
-// FIXME: The interface is not completely specified yet, as it is pending
-// determining a good way to handle additional template arguments
-// to get the Shard and Record types into play
+
template <typename Q, typename R, typename S>
concept QueryInterface = requires(void *p, S *sh, std::vector<void*> &s, std::vector<std::vector<Wrapped<R>>> &rv, BufferView<R> *bv) {
{Q::get_query_state(sh, p)} -> std::convertible_to<void*>;
diff --git a/include/framework/interface/Record.h b/include/framework/interface/Record.h
index 29df4b6..5b9f307 100644
--- a/include/framework/interface/Record.h
+++ b/include/framework/interface/Record.h
@@ -138,7 +138,7 @@ struct CosinePoint{
return true;
}
- // lexicographic order
+ /* lexicographic order */
inline bool operator<(const CosinePoint& other) const {
for (size_t i=0; i<D; i++) {
if (data[i] < other.data[i]) {
@@ -182,7 +182,7 @@ struct EuclidPoint{
return true;
}
- // lexicographic order
+ /* lexicographic order */
inline bool operator<(const EuclidPoint& other) const {
for (size_t i=0; i<D; i++) {
if (data[i] < other.data[i]) {
@@ -228,7 +228,4 @@ public:
private:
R *P;
};
-
-
-
}