aboutsummaryrefslogtreecommitdiffstats
path: root/lib/stdlib/src/gb_trees.erl
diff options
context:
space:
mode:
authorHans Bolinder <[email protected]>2012-12-13 09:49:13 +0100
committerHans Bolinder <[email protected]>2013-01-09 09:24:17 +0100
commit93d2c2c88e88168354782f356bdf572d0c3aa462 (patch)
treeba5f395e721076ef1fac49ee4ed856e76cb316df /lib/stdlib/src/gb_trees.erl
parent151f7832c74975297b1dce6302dd192285d7c2a8 (diff)
downloadotp-93d2c2c88e88168354782f356bdf572d0c3aa462.tar.gz
otp-93d2c2c88e88168354782f356bdf572d0c3aa462.tar.bz2
otp-93d2c2c88e88168354782f356bdf572d0c3aa462.zip
Prepare OTP files for Unicode as default encoding
Diffstat (limited to 'lib/stdlib/src/gb_trees.erl')
-rw-r--r--lib/stdlib/src/gb_trees.erl3
1 files changed, 2 insertions, 1 deletions
diff --git a/lib/stdlib/src/gb_trees.erl b/lib/stdlib/src/gb_trees.erl
index 258713c90f..de0c239e26 100644
--- a/lib/stdlib/src/gb_trees.erl
+++ b/lib/stdlib/src/gb_trees.erl
@@ -1,3 +1,4 @@
+%% -*- coding: utf-8 -*-
%%
%% %CopyrightBegin%
%%
@@ -19,7 +20,7 @@
%% =====================================================================
%% General Balanced Trees - highly efficient dictionaries.
%%
-%% Copyright (C) 1999-2001 Sven-Olof Nystr�m, Richard Carlsson
+%% Copyright (C) 1999-2001 Sven-Olof Nyström, Richard Carlsson
%%
%% An efficient implementation of Prof. Arne Andersson's General
%% Balanced Trees. These have no storage overhead compared to plain