add a recent commit to release notes (#566)

* add recent commit to release notes Signed-off-by: Kaituo Li <kaituo@amazon.com> * add one line space between title and bullet point Signed-off-by: Kaituo Li <kaituo@amazon.com> * backport flaky test fix Signed-off-by: Kaituo Li <kaituo@amazon.com>
opensearch-project · Jun 9, 2022 · 29da6f8 · 29da6f8
1 parent d1bfdd7
commit 29da6f8
Show file tree

Hide file tree

Showing 2 changed files with 10 additions and 3 deletions.
diff --git a/release-notes/opensearch-anomaly-detection.release-notes-1.3.3.0.md b/release-notes/opensearch-anomaly-detection.release-notes-1.3.3.0.md
@@ -7,3 +7,7 @@ Compatible with OpenSearch 1.3.3
 * Use current time as training data end time  ([#547](https://github.com/opensearch-project/anomaly-detection/pull/547))
 * Support writing features using filter aggregation ([#425](https://github.com/opensearch-project/anomaly-detection/pull/425))
 
+### Infrastructure
+
+* removed bwc zips and fetching opendistro from cloudfront ([#565](https://github.com/opensearch-project/anomaly-detection/pull/565))
+
diff --git a/src/test/java/org/opensearch/ad/feature/NoPowermockSearchFeatureDaoTests.java b/src/test/java/org/opensearch/ad/feature/NoPowermockSearchFeatureDaoTests.java
@@ -599,8 +599,10 @@ public void testParseBuckets() throws InstantiationException,
             new MockBigArrays(new MockPageCacheRecycler(Settings.EMPTY), new NoneCircuitBreakerService()),
             1
         );
-        hllpp.collect(0, BitMixer.mix64(randomIntBetween(1, 100)));
-        hllpp.collect(0, BitMixer.mix64(randomIntBetween(1, 100)));
+        long hash1 = BitMixer.mix64(randomIntBetween(1, 100));
+        long hash2 = BitMixer.mix64(randomIntBetween(1, 100));
+        hllpp.collect(0, hash1);
+        hllpp.collect(0, hash2);
 
         Constructor ctor = null;
         ctor = InternalCardinality.class.getDeclaredConstructor(String.class, AbstractHyperLogLogPlusPlus.class, Map.class);
@@ -626,7 +628,8 @@ public void testParseBuckets() throws InstantiationException,
         assertTrue(parsedResult.isPresent());
         double[] parsedCardinality = parsedResult.get();
         assertEquals(1, parsedCardinality.length);
-        assertEquals(2, parsedCardinality[0], 0.001);
+        double buckets = hash1 == hash2 ? 1 : 2;
+        assertEquals(buckets, parsedCardinality[0], 0.001);
 
         // release MockBigArrays; otherwise, test will fail
         Releasables.close(hllpp);