1 files changed, 6 insertions, 6 deletions

diff --git a/frontend/gamma/js/MochiKit/Sortable.js b/frontend/gamma/js/MochiKit/Sortable.js
index 863b506..ca9db21 100644
--- a/frontend/gamma/js/MochiKit/Sortable.js
+++ b/frontend/gamma/js/MochiKit/Sortable.js
@@ -1,21 +1,21 @@
 /***
 Copyright (c) 2005 Thomas Fuchs (http://script.aculo.us, http://mir.aculo.us)
     Mochi-ized By Thomas Herve (_firstname_@nimail.org)
 
 See scriptaculous.js for full license.
 
 ***/
 
-MochiKit.Base._module('Sortable', '1.5', ['Base', 'Iter', 'DOM', 'Position', 'DragAndDrop']);
+MochiKit.Base.module(MochiKit, 'Sortable', '1.5', ['Base', 'Iter', 'DOM', 'Position', 'DragAndDrop']);
 
 MochiKit.Base.update(MochiKit.Sortable, {
     __export__: false,
 
     /***
 
     Manage sortables. Mainly use the create function to add a sortable.
 
     ***/
     sortables: {},
 
     _findRootElement: function (element) {
@@ -170,33 +170,33 @@ MochiKit.Base.update(MochiKit.Sortable, {
         if (options.zindex) {
             options_for_draggable.zindex = options.zindex;
         }
 
         // build options for the droppables
         var options_for_droppable = {
             overlap: options.overlap,
             containment: options.containment,
             hoverclass: options.hoverclass,
             onhover: self.onHover,
             tree: options.tree,
             accept: options.accept
-        }
+        };
 
         var options_for_tree = {
             onhover: self.onEmptyHover,
             overlap: options.overlap,
             containment: options.containment,
             hoverclass: options.hoverclass,
             accept: options.accept
-        }
+        };
 
         // fix for gecko engine
         MochiKit.DOM.removeEmptyTextNodes(element);
 
         options.draggables = [];
         options.droppables = [];
 
         // drop on empty handling
         if (options.dropOnEmpty || options.tree) {
             new MochiKit.DragAndDrop.Droppable(element, options_for_tree);
             options.droppables.push(element);
         }
@@ -421,29 +421,29 @@ MochiKit.Base.update(MochiKit.Sortable, {
 
             if (!match) {
                 continue;
             }
 
             var child = {
                 id: encodeURIComponent(match ? match[1] : null),
                 element: element,
                 parent: parent,
                 children: [],
                 position: parent.children.length,
                 container: self._findChildrenElement(children[i], options.treeTag.toUpperCase())
-            }
+            };
 
             /* Get the element containing the children and recurse over it */
             if (child.container) {
-                self._tree(child.container, options, child)
+                self._tree(child.container, options, child);
             }
 
             parent.children.push (child);
         }
 
         return parent;
     },
 
     /* Finds the first element of the given tag type within a parent element.
        Used for finding the first LI[ST] within a L[IST]I[TEM].*/
     _findChildrenElement: function (element, containerTag) {
         if (element && element.hasChildNodes) {
@@ -466,25 +466,25 @@ MochiKit.Base.update(MochiKit.Sortable, {
             treeTag: sortableOptions.treeTag,
             only: sortableOptions.only,
             name: element.id,
             format: sortableOptions.format
         }, options || {});
 
         var root = {
             id: null,
             parent: null,
             children: new Array,
             container: element,
             position: 0
-        }
+        };
 
         return MochiKit.Sortable._tree(element, options, root);
     },
 
     /**
      * Specifies the sequence for the Sortable.
      * @param {Node} element    Element to use as the Sortable.
      * @param {Object} newSequence    New sequence to use.
      * @param {Object} options    Options to use fro the Sortable.
      */
     setSequence: function (element, newSequence, options) {
         var self = MochiKit.Sortable;