From fd7d0c3bfe996029263b523e1e2089da000664dc Mon Sep 17 00:00:00 2001
From: Damien Doligez <damien.doligez-inria.fr>
Date: Fri, 26 Aug 2005 12:10:47 +0000
Subject: [PATCH] PR#3755 indentation trompeuse

git-svn-id: http://caml.inria.fr/svn/ocaml/trunk@7032 f963ae5c-01c2-4b8c-9fe0-0dff7051ff02
---
 stdlib/queue.ml | 27 ++++++++++++---------------
 1 file changed, 12 insertions(+), 15 deletions(-)

diff --git a/stdlib/queue.ml b/stdlib/queue.ml
index 096d7141d..9e21686a1 100644
--- a/stdlib/queue.ml
+++ b/stdlib/queue.ml
@@ -24,7 +24,7 @@ exception Empty
 type 'a cell = {
     content: 'a;
     mutable next: 'a cell
-  } 
+  }
 
 (* A queue is a reference to either nothing or some cell of a cyclic
    list. By convention, that cell is to be viewed as the last cell in
@@ -42,12 +42,12 @@ type 'a cell = {
 type 'a t = {
     mutable length: int;
     mutable tail: 'a cell
-  } 
+  }
 
 let create () = {
   length = 0;
   tail = Obj.magic None
-} 
+}
 
 let clear q =
   q.length <- 0;
@@ -84,17 +84,15 @@ let top =
   peek
 
 let take q =
-  if q.length = 0 then
-    raise Empty
+  if q.length = 0 then raise Empty;
+  q.length <- q.length - 1;
+  let tail = q.tail in
+  let head = tail.next in
+  if head == tail then
+    q.tail <- Obj.magic None
   else
-    q.length <- q.length - 1;
-    let tail = q.tail in
-    let head = tail.next in
-    if head == tail then
-      q.tail <- Obj.magic None
-    else
-      tail.next <- head.next;
-    head.content
+    tail.next <- head.next;
+  head.content
 
 let pop =
   take
@@ -121,7 +119,7 @@ let copy q =
     {
       length = q.length;
       tail = tail'
-    } 
+    }
 
 let is_empty q =
   q.length = 0
@@ -165,4 +163,3 @@ let transfer q1 q2 =
     end;
     q2.length <- q2.length + length1;
     q2.tail <- tail1
-