From 3744281b9ae8aa0ab86ceaee1afe8a603e3aeb2c Mon Sep 17 00:00:00 2001
From: marha <marha@users.sourceforge.net>
Date: Mon, 19 Nov 2012 10:16:38 +0100
Subject: dos -> unix

---
 xorg-server/xkeyboard-config/tests/ruby/utils.rb | 128 +++++++++++------------
 1 file changed, 64 insertions(+), 64 deletions(-)

(limited to 'xorg-server/xkeyboard-config/tests/ruby/utils.rb')

diff --git a/xorg-server/xkeyboard-config/tests/ruby/utils.rb b/xorg-server/xkeyboard-config/tests/ruby/utils.rb
index 93ff0ee5e..3c699a7a8 100644
--- a/xorg-server/xkeyboard-config/tests/ruby/utils.rb
+++ b/xorg-server/xkeyboard-config/tests/ruby/utils.rb
@@ -1,64 +1,64 @@
-#
-# $Id$
-#
-# Commont classes
-#
-
-#
-# The hash containing non-unique mappings
-# It can have a->b and a->c together
-# Also, for every mapping it counts the number of times this mapping was set
-#
-class NonuniqueCountingHash < Hash
-
-  alias get_original []
-  alias put_original []=
-
-  def []=(key, value)
-    own = self.get_original(key)
-    hash = get_original(key)
-    if hash.nil?
-      put_original(key, hash = Hash.new)
-    end
-    if hash.has_key?(value)
-      hash[value] += 1
-    else
-      hash[value] = 1
-    end
-  end
-  
-  #
-  # Number of all mappings (a->b and a->c counted as 2 mappings)
-  #
-  def full_length()
-    values.inject(0) do | rv, hash |
-      rv + hash.length
-    end
-  end
-
-  def cardinality(key1, key2)
-    if has_key?(key1) 
-      hash = get_original(key1)
-      if hash.has_key?(key2)
-        hash[key2]
-      else
-        0
-      end
-    else
-      0
-    end
-  end
-
-  def filter(limit)
-    find_all do | key, hash |
-      hash.find_all do | key1, counter |
-        if (counter <= limit)
-          hash.delete(key1)
-        end
-      end
-      if hash.empty? 
-        delete(key)
-      end
-    end
-  end
-end
+#
+# $Id$
+#
+# Commont classes
+#
+
+#
+# The hash containing non-unique mappings
+# It can have a->b and a->c together
+# Also, for every mapping it counts the number of times this mapping was set
+#
+class NonuniqueCountingHash < Hash
+
+  alias get_original []
+  alias put_original []=
+
+  def []=(key, value)
+    own = self.get_original(key)
+    hash = get_original(key)
+    if hash.nil?
+      put_original(key, hash = Hash.new)
+    end
+    if hash.has_key?(value)
+      hash[value] += 1
+    else
+      hash[value] = 1
+    end
+  end
+  
+  #
+  # Number of all mappings (a->b and a->c counted as 2 mappings)
+  #
+  def full_length()
+    values.inject(0) do | rv, hash |
+      rv + hash.length
+    end
+  end
+
+  def cardinality(key1, key2)
+    if has_key?(key1) 
+      hash = get_original(key1)
+      if hash.has_key?(key2)
+        hash[key2]
+      else
+        0
+      end
+    else
+      0
+    end
+  end
+
+  def filter(limit)
+    find_all do | key, hash |
+      hash.find_all do | key1, counter |
+        if (counter <= limit)
+          hash.delete(key1)
+        end
+      end
+      if hash.empty? 
+        delete(key)
+      end
+    end
+  end
+end
-- 
cgit v1.2.3