summaryrefslogtreecommitdiff
path: root/libs/utils/primes.py
diff options
context:
space:
mode:
author Alex Ray <aray@google.com> 2013-07-30 12:48:57 -0700
committer Alex Ray <aray@google.com> 2013-07-31 13:48:57 -0700
commitb304edb0b1f45ec7d4f10cfbff1b91f50bca86e4 (patch)
tree954f7258776d0f5c2683b85ed6307e6cc3ac2b30 /libs/utils/primes.py
parent8776c34ca2e6cc92c453f5a83e11bcb67b0d5aff (diff)
remove libutils
libutils is being moved from frameworks/native/ to system/core/ in order to facilitate native C++ platform (non-frameworks) code. Change-Id: I44089fb960591a40b8a9c30faabb10459d107d71
Diffstat (limited to 'libs/utils/primes.py')
-rwxr-xr-xlibs/utils/primes.py47
1 files changed, 0 insertions, 47 deletions
diff --git a/libs/utils/primes.py b/libs/utils/primes.py
deleted file mode 100755
index e161dd801e..0000000000
--- a/libs/utils/primes.py
+++ /dev/null
@@ -1,47 +0,0 @@
-#!/usr/bin/env python2.6
-#
-# Copyright (C) 2011 The Android Open Source Project
-#
-# Licensed under the Apache License, Version 2.0 (the "License");
-# you may not use this file except in compliance with the License.
-# You may obtain a copy of the License at
-#
-# http://www.apache.org/licenses/LICENSE-2.0
-#
-# Unless required by applicable law or agreed to in writing, software
-# distributed under the License is distributed on an "AS IS" BASIS,
-# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-# See the License for the specific language governing permissions and
-# limitations under the License.
-#
-
-#
-# Generates a table of prime numbers for use in BasicHashtable.cpp.
-#
-# Each prime is chosen such that it is a little more than twice as large as
-# the previous prime in the table. This makes it easier to choose a new
-# hashtable size when the underlying array is grown by as nominal factor
-# of two each time.
-#
-
-def is_odd_prime(n):
- limit = (n - 1) / 2
- d = 3
- while d <= limit:
- if n % d == 0:
- return False
- d += 2
- return True
-
-print "static size_t PRIMES[] = {"
-
-n = 5
-max = 2**31 - 1
-while n < max:
- print " %d," % (n)
- n = n * 2 + 1
- while not is_odd_prime(n):
- n += 2
-
-print " 0,"
-print "};"