KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > org > armedbear > lisp > ceiling


1 /*
2  * ceiling.java
3  *
4  * Copyright (C) 2004 Peter Graves
5  * $Id: ceiling.java,v 1.1 2004/08/15 11:16:08 piso Exp $
6  *
7  * This program is free software; you can redistribute it and/or
8  * modify it under the terms of the GNU General Public License
9  * as published by the Free Software Foundation; either version 2
10  * of the License, or (at your option) any later version.
11  *
12  * This program is distributed in the hope that it will be useful,
13  * but WITHOUT ANY WARRANTY; without even the implied warranty of
14  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15  * GNU General Public License for more details.
16  *
17  * You should have received a copy of the GNU General Public License
18  * along with this program; if not, write to the Free Software
19  * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
20  */

21
22 package org.armedbear.lisp;
23
24 // ### ceiling number &optional divisor
25
public final class ceiling extends Primitive
26 {
27     private ceiling()
28     {
29         super("ceiling", "number &optional divisor");
30     }
31
32     public LispObject execute(LispObject arg) throws ConditionThrowable
33     {
34         return execute(arg, Fixnum.ONE);
35     }
36
37     public LispObject execute(LispObject first, LispObject second)
38         throws ConditionThrowable
39     {
40         LispObject quotient = first.truncate(second);
41         final LispThread thread = LispThread.currentThread();
42         LispObject remainder = thread._values[1];
43         if (remainder.zerop())
44             return quotient;
45         if (second.minusp()) {
46             if (first.plusp())
47                 return quotient;
48         } else {
49             if (first.minusp())
50                 return quotient;
51         }
52         quotient = quotient.incr();
53         thread._values[0] = quotient;
54         thread._values[1] = remainder.subtract(second);
55         return quotient;
56     }
57
58     private static final Primitive CEILING = new ceiling();
59 }
60
Popular Tags