Last change
on this file since 70 was
46,
checked in by Sam Hocevar, 20 years ago
|
- fixed a segfault when the target seeker speed was zero.
- factorized the seeker generation on fragbomb explosion.
|
File size:
1.2 KB
|
Line | |
---|
1 | /* |
---|
2 | * ttyvaders Textmode shoot'em up |
---|
3 | * Copyright (c) 2002 Sam Hocevar <sam@zoy.org> |
---|
4 | * All Rights Reserved |
---|
5 | * |
---|
6 | * $Id: math.c,v 1.2 2002/12/22 23:01:35 sam Exp $ |
---|
7 | * |
---|
8 | * This program is free software; you can redistribute it and/or modify |
---|
9 | * it under the terms of the GNU General Public License as published by |
---|
10 | * the Free Software Foundation; either version 2 of the License, or |
---|
11 | * (at your option) any later version. |
---|
12 | * |
---|
13 | * This program is distributed in the hope that it will be useful, |
---|
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
---|
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
---|
16 | * GNU General Public License for more details. |
---|
17 | * |
---|
18 | * You should have received a copy of the GNU General Public License |
---|
19 | * along with this program; if not, write to the Free Software |
---|
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
---|
21 | */ |
---|
22 | |
---|
23 | #include "common.h" |
---|
24 | |
---|
25 | int r00t( int a ) |
---|
26 | { |
---|
27 | int x = a > 100000 ? 1000 : a > 1000 ? 100 : a > 10 ? 10 : 1; |
---|
28 | |
---|
29 | if( a <= 0 ) |
---|
30 | { |
---|
31 | return 0; |
---|
32 | } |
---|
33 | |
---|
34 | /* Newton's method. Three iterations would be more than enough. */ |
---|
35 | x = (x * x + a) / x / 2; |
---|
36 | x = (x * x + a) / x / 2; |
---|
37 | x = (x * x + a) / x / 2; |
---|
38 | x = (x * x + a) / x / 2; |
---|
39 | |
---|
40 | return x; |
---|
41 | } |
---|
42 | |
---|
Note: See
TracBrowser
for help on using the repository browser.