| 1 | Patch-Source: https://github.com/daoswald/List-BinarySearch/pull/4.patch
|
| 2 | --
|
| 3 | From 035981013670af1c1503684e410b2f13cd10016d Mon Sep 17 00:00:00 2001
|
| 4 | From: Martin Barth <[email protected]>
|
| 5 | Date: Thu, 21 Sep 2017 09:25:13 +0200
|
| 6 | Subject: [PATCH] Fixed a little mistake in the POD
|
| 7 |
|
| 8 | ---
|
| 9 | lib/List/BinarySearch.pm | 2 +-
|
| 10 | 1 file changed, 1 insertion(+), 1 deletion(-)
|
| 11 |
|
| 12 | diff --git a/lib/List/BinarySearch.pm b/lib/List/BinarySearch.pm
|
| 13 | index a51e7f5..362c15c 100644
|
| 14 | |
| 15 | |
| 16 | @@ -324,7 +324,7 @@ As an example, consider the following data structure:
|
| 17 |
|
| 18 | A numeric custom comparator for such a data structure would look like this:
|
| 19 |
|
| 20 | - sub{ $a <=> $b->[0] }
|
| 21 | + sub{ $a->[0] <=> $b->[0] }
|
| 22 |
|
| 23 | In this regard, the callback is unlike C<sort>, because C<sort> is always
|
| 24 | comparing to elements, whereas C<binsearch> is comparing a target with an
|