--- /dev/null
+/*
+ * Copyright (c) 2017 Uber Technologies, Inc.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#include <gtest/gtest.h>
+
+#include "jaegertracing/Logging.h"
+#include "jaegertracing/Tracer.h"
+#include "jaegertracing/Sender.h"
+#include "jaegertracing/reporters/CompositeReporter.h"
+#include "jaegertracing/reporters/InMemoryReporter.h"
+#include "jaegertracing/reporters/LoggingReporter.h"
+#include "jaegertracing/reporters/NullReporter.h"
+#include "jaegertracing/reporters/RemoteReporter.h"
+#include "jaegertracing/samplers/ConstSampler.h"
+
+namespace jaegertracing {
+namespace reporters {
+namespace {
+
+class FakeTransport : public Sender {
+ public:
+ FakeTransport(std::vector<Span>& spans, std::mutex& mutex)
+ : _spans(spans)
+ , _mutex(mutex)
+ {
+ }
+
+ int append(const Span& span) override
+ {
+ std::lock_guard<std::mutex> lock(_mutex);
+ _spans.push_back(span);
+ return 1;
+ }
+
+ int flush() override { return 0; }
+
+ void close() override {}
+
+ private:
+ std::vector<Span>& _spans;
+ std::mutex& _mutex;
+};
+
+const Span span;
+
+} // anonymous namespace
+
+TEST(Reporter, testRemoteReporter)
+{
+ std::vector<Span> spans;
+ std::mutex mutex;
+ auto logger = logging::nullLogger();
+ auto metrics = metrics::Metrics::makeNullMetrics();
+ constexpr auto kFixedQueueSize = 10;
+ RemoteReporter reporter(
+ std::chrono::milliseconds(1),
+ kFixedQueueSize,
+ std::unique_ptr<Sender>(new FakeTransport(spans, mutex)),
+ *logger,
+ *metrics);
+ constexpr auto kNumReports = 100;
+ for (auto i = 0; i < kNumReports; ++i) {
+ reporter.report(span);
+ // TODO(isaachier): Find a way to make this test more rigorous.
+ std::this_thread::sleep_for(std::chrono::milliseconds(1));
+ }
+ reporter.close();
+ ASSERT_EQ(spans.size(), kNumReports);
+}
+
+TEST(Reporter, testNullReporter)
+{
+ NullReporter reporter;
+ constexpr auto kNumReports = 100;
+ for (auto i = 0; i < kNumReports; ++i) {
+ reporter.report(span);
+ }
+ reporter.close();
+}
+
+TEST(Reporter, testLoggingReporter)
+{
+ const auto logger = logging::nullLogger();
+ LoggingReporter reporter(*logger);
+ constexpr auto kNumReports = 100;
+ for (auto i = 0; i < kNumReports; ++i) {
+ reporter.report(span);
+ }
+ reporter.close();
+}
+
+TEST(Reporter, testInMemoryReporter)
+{
+ InMemoryReporter reporter;
+ constexpr auto kNumReports = 100;
+ for (auto i = 0; i < kNumReports; ++i) {
+ reporter.report(span);
+ }
+ ASSERT_EQ(kNumReports, reporter.spansSubmitted());
+ reporter.reset();
+ ASSERT_EQ(0, reporter.spansSubmitted());
+ reporter.close();
+}
+
+TEST(Reporter, testCompositeReporter)
+{
+ std::vector<std::shared_ptr<Reporter>> reporters;
+ reporters.push_back(std::make_shared<InMemoryReporter>());
+ reporters.push_back(std::make_shared<InMemoryReporter>());
+
+ CompositeReporter reporter(reporters);
+ reporter.report(span);
+ ASSERT_EQ(1,
+ std::static_pointer_cast<InMemoryReporter>(reporters[0])
+ ->spansSubmitted());
+ ASSERT_EQ(1,
+ std::static_pointer_cast<InMemoryReporter>(reporters[1])
+ ->spansSubmitted());
+}
+
+} // namespace reporters
+} // namespace jaegertracing