diff options
author | Steven Moreland <smoreland@google.com> | 2017-02-16 14:29:50 -0800 |
---|---|---|
committer | Steven Moreland <smoreland@google.com> | 2017-02-16 14:30:44 -0800 |
commit | 16afa6a0f0bc60e36abf5b0a05868f4cfe7b5916 (patch) | |
tree | 9821d0fabb492a227f3da3a91bb0b2b1a6c8c005 /libutils | |
parent | 1a055a895719ef76c519de60a5942edbf530950c (diff) | |
download | core-16afa6a0f0bc60e36abf5b0a05868f4cfe7b5916.tar.gz core-16afa6a0f0bc60e36abf5b0a05868f4cfe7b5916.tar.bz2 core-16afa6a0f0bc60e36abf5b0a05868f4cfe7b5916.zip |
Remove unused primes.py python file.
primes.py was used to calculate primes for BasicHashTable which no
longer exists.
Change-Id: I8c6e9b7882bcb8a3832c55249be6db9421d1f771
Diffstat (limited to 'libutils')
-rwxr-xr-x | libutils/primes.py | 47 |
1 files changed, 0 insertions, 47 deletions
diff --git a/libutils/primes.py b/libutils/primes.py deleted file mode 100755 index e161dd801..000000000 --- a/libutils/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 "};" |