From c09c5ff07c6767c2dfe24ef725f34461c1ceff69 Mon Sep 17 00:00:00 2001
From: Giorgos Stamatelatos <gstamatelat@gmail.com>
Date: Tue, 3 Jul 2018 22:13:36 +0300
Subject: [PATCH] Tweak package-info style

---
 src/javadoc/stylesheet.css                        | 1 +
 src/main/java/gr/james/sampling/package-info.java | 2 +-
 2 files changed, 2 insertions(+), 1 deletion(-)

diff --git a/src/javadoc/stylesheet.css b/src/javadoc/stylesheet.css
index 1c8ffa0..d10fd28 100644
--- a/src/javadoc/stylesheet.css
+++ b/src/javadoc/stylesheet.css
@@ -45,6 +45,7 @@ ol.citations li {
 ol.citations li:before {
     content: "[" counter(citations-counter) "]";
     margin-right: 0.5em;
+    margin-left: 0.5em;
 }
 
 ol.citations li {
diff --git a/src/main/java/gr/james/sampling/package-info.java b/src/main/java/gr/james/sampling/package-info.java
index d5ac0f0..375a91c 100644
--- a/src/main/java/gr/james/sampling/package-info.java
+++ b/src/main/java/gr/james/sampling/package-info.java
@@ -109,7 +109,7 @@
  * <li><a href="https://doi.org/10.1145/3147.3165">Vitter, Jeffrey S. "Random sampling with a reservoir."
  * ACM Transactions on Mathematical Software (TOMS) 11.1 (1985): 37-57.</a></li>
  * <li><a href="https://doi.org/10.1145/198429.198435">Li, Kim-Hung. "Reservoir-sampling algorithms of time complexity
- * O(n(1+log(N/n)))." ACM Transactions on Mathematical Software (TOMS) 20.4 (1994): 481-493.</a></li>
+ * O(n(1 + log(N/n)))." ACM Transactions on Mathematical Software (TOMS) 20.4 (1994): 481-493.</a></li>
  * <li><a href="https://doi.org/10.2307/2336002">Chao, M. T. "A general purpose unequal probability sampling plan."
  * Biometrika 69.3 (1982): 653-656.</a></li>
  * <li><a href="https://doi.org/10.1080/02664769624152">Sugden, R. A. "Chao's list sequential scheme for unequal