From e0c4c2867c20368c5b5d88cbbf92da7b7a3f386e Mon Sep 17 00:00:00 2001
From: Patrik Nyblom <pan@arwen.du.uab.ericsson.se>
Date: Mon, 2 Nov 2009 15:55:20 +0100
Subject: Teach binary.c the semantics to take longest instead of shortest
 match

Add testcase embryos and reference implementation.
Change name of compile function according to EEP31.
---
 lib/stdlib/src/binary.erl | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

(limited to 'lib/stdlib/src/binary.erl')

diff --git a/lib/stdlib/src/binary.erl b/lib/stdlib/src/binary.erl
index f2774f8c84..d649f974bb 100644
--- a/lib/stdlib/src/binary.erl
+++ b/lib/stdlib/src/binary.erl
@@ -19,8 +19,8 @@
 -module(binary).
 %%
 %% The following functions implemented as BIF's
-%%  binary:match_compile/1
-%%  binary:match/3
+%%  binary:compile_pattern/1
+%%  binary:find/3
 %% XXX:PaN more to come...
 
 -export([first/1,first/2,last/1,last/2,nth/2,extract/3]).
-- 
cgit v1.2.3