diff --git a/cpp/src/arrow/acero/accumulation_queue.h b/cpp/src/arrow/acero/accumulation_queue.h index a173f9840388f..92d62d5d99d16 100644 --- a/cpp/src/arrow/acero/accumulation_queue.h +++ b/cpp/src/arrow/acero/accumulation_queue.h @@ -22,6 +22,7 @@ #include #include +#include "arrow/acero/visibility.h" #include "arrow/compute/exec.h" #include "arrow/result.h" @@ -70,7 +71,7 @@ class AccumulationQueue { /// For example, in a top-n node, the process callback should determine how many /// rows need to be delivered for the given batch, and then return a task to actually /// deliver those rows. -class SequencingQueue { +class ARROW_ACERO_EXPORT SequencingQueue { public: using Task = std::function; @@ -123,7 +124,7 @@ class SequencingQueue { /// /// It can be helpful to think of this as if a dedicated thread is running Process as /// batches arrive -class SerialSequencingQueue { +class ARROW_ACERO_EXPORT SerialSequencingQueue { public: /// Strategy that describes how to handle items class Processor {