Patch-Source: https://github.com/daoswald/List-BinarySearch/pull/4.patch
--
From 035981013670af1c1503684e410b2f13cd10016d Mon Sep 17 00:00:00 2001
From: Martin Barth <ufobat@users.noreply.github.com>
Date: Thu, 21 Sep 2017 09:25:13 +0200
Subject: [PATCH] Fixed a little mistake in the POD

---
 lib/List/BinarySearch.pm | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/lib/List/BinarySearch.pm b/lib/List/BinarySearch.pm
index a51e7f5..362c15c 100644
--- a/lib/List/BinarySearch.pm
+++ b/lib/List/BinarySearch.pm
@@ -324,7 +324,7 @@ As an example, consider the following data structure:
 
 A numeric custom comparator for such a data structure would look like this:
 
-    sub{ $a <=> $b->[0] }
+    sub{ $a->[0] <=> $b->[0] }
 
 In this regard, the callback is unlike C<sort>, because C<sort> is always
 comparing to elements, whereas C<binsearch> is comparing a target with an