/usr/share/pyshared/advancedcaching/provider.py is in agtl 0.8.0.3-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 | #!/usr/bin/python
# -*- coding: utf-8 -*-
# Copyright (C) 2010 Daniel Fett
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see <http://www.gnu.org/licenses/>.
#
# Author: Daniel Fett agtl@danielfett.de
# Jabber: fett.daniel@jaber.ccc.de
# Bugtracker and GIT Repository: http://github.com/webhamster/advancedcaching
#
from math import sqrt
from sqlite3 import connect, Row
from copy import copy
class PointProvider():
MAX_RESULTS = 1000
def __init__(self, filename, ctype, table):
self.filterstack = []
self.conn = connect(filename)
self.conn.row_factory = Row
self.conn.text_factory = str
self.ctype = ctype
self.cache_table = table
self.filterstring = []
self.filterargs = []
# yes, the synchronous=off setting is a bit dangerous for the database,
# but the advantages outbalance unlikely database corruption
self.conn.executescript(
'PRAGMA temp_store = MEMORY;' \
'PRAGMA synchronous=OFF;' \
'CREATE TABLE IF NOT EXISTS %s (%s);' % (self.cache_table, ', '.join('%s %s' % m for m in self.ctype.SQLROW.items())))
self.check_table()
self.conn.executescript(
'CREATE INDEX IF NOT EXISTS %(table)s_latlon ON %(table)s (lat ASC, lon ASC);' \
'CREATE INDEX IF NOT EXISTS %(table)s_name ON %(table)s (name ASC);' \
'CREATE INDEX IF NOT EXISTS %(table)s_fieldnote ON %(table)s (logas);' % {'table' : self.cache_table}
)
#c.execute('CREATE TABLE IF NOT EXISTS %s (%s)' % (self.cache_table, ', '.join(' '.join(m) for m in self.ctype.SQLROW.items())))
#self.check_table()
#c.execute('CREATE INDEX IF NOT EXISTS %s_latlon ON %s (lat ASC, lon ASC)' % (self.cache_table, self.cache_table))
def check_table(self):
c = self.conn.cursor()
fields = copy(self.ctype.SQLROW)
c.execute('PRAGMA TABLE_INFO(%s)' % self.cache_table)
for row in c:
if row[1] in fields:
del fields[row[1]]
# add all remaining fields
for name, type in fields.items():
cmd = 'ALTER TABLE %s ADD COLUMN %s %s' % (self.cache_table, name, type)
print "Updating your Database, adding Column %s to Table %s:\n%s" % (name, self.cache_table, cmd)
c.execute(cmd)
self.save()
def get_table_info(self):
c = self.conn.cursor()
c.execute('PRAGMA TABLE_INFO(%s)' % self.cache_table)
return c.fetchall()
def save(self):
self.conn.commit()
def __del__(self):
self.conn.commit()
self.conn.close()
def add_point(self, p, replace=False):
if replace:
self.conn.execute("INSERT OR REPLACE INTO %s (`%s`) VALUES (%s)" % (self.cache_table, '`, `'.join(self.ctype.SQLROW.keys()), ', '.join(':%s' % k for k in self.ctype.SQLROW.keys())), p.serialize())
return None
else:
c = self.conn.cursor()
c.execute("SELECT found FROM %s WHERE name = ?" % self.cache_table, (p.name,))
num = len(c.fetchall())
existing = (num == 1)
c.close()
if existing:
self.conn.execute("UPDATE %s SET found = ?, type = ?, lat = ?, lon = ?, status = ? WHERE name = ?" % self.cache_table, (p.found, p.type, p.lat, p.lon, p.status, p.name))
return False
else:
self.conn.execute("INSERT INTO %s (`%s`) VALUES (%s)" % (self.cache_table, '`, `'.join(self.ctype.SQLROW.keys()), ', '.join(':%s' % k for k in self.ctype.SQLROW.keys())), p.serialize())
return True
# should be used with caution :-)
def get_all(self):
c = self.conn.cursor()
c.execute('SELECT * FROM %s' % self.cache_table)
return self.pack_result(c)
# should never ever be used with anything except a user provided query
def get_by_query(self, query):
c = self.conn.execute(query)
return self.pack_result(c)
def get_points(self, c1, c2):
c = self.conn.execute('SELECT * FROM %s WHERE (lat BETWEEN ? AND ?) AND (lon BETWEEN ? AND ?)' % self.cache_table, (min(c1.lat, c2.lat), max(c1.lat, c2.lat), min(c1.lon, c2.lon), max(c1.lon, c2.lon)))
return self.pack_result(c)
def get_titles_and_names(self):
c = self.conn.execute('SELECT name, title FROM %s' % self.cache_table)
strings = []
for row in c:
strings.append(row['name'])
strings.append(row['title'])
c.close()
return strings
def get_new_fieldnotes_count(self):
c = self.conn.execute('SELECT count(*) AS cnt FROM %s WHERE logas != %d' % (self.cache_table, self.ctype.LOG_NO_LOG))
for row in c:
return row['cnt']
return 0
def get_new_fieldnotes(self):
c = self.conn.execute('SELECT * FROM %s WHERE logas != %d' % (self.cache_table, self.ctype.LOG_NO_LOG))
return self.pack_result(c)
def get_nearest_point_filter(self, center, c1, c2, found):
filterstring = copy(self.filterstring)
filterargs = copy(self.filterargs)
filterstring.append('((lat BETWEEN ? AND ?) AND (lon BETWEEN ? AND ?))')
filterargs.append(min(c1.lat, c2.lat))
filterargs.append(max(c1.lat, c2.lat))
filterargs.append(min(c1.lon, c2.lon))
filterargs.append(max(c1.lon, c2.lon))
if found == True:
filterstring.append('(found = 1)')
elif found == False:
filterstring.append('(found = 0)')
# we don't have 'power' or other advanced mathematic operators
# in sqlite, so doing distance calculation in python
query = 'SELECT * FROM %s WHERE %s' % (self.cache_table, " AND ".join(filterstring))
c = self.conn.execute(query, tuple(filterargs))
mindist = () # we use this as positive infinity
mindistrow = None
for row in c:
# we have points very close to each other
# for the sake of performance, using simpler
# distance calc here
dist = sqrt((row['lat'] - center.lat) ** 2 + (row['lon'] - center.lon) ** 2)
if dist < mindist:
mindistrow = row
mindist = dist
if mindistrow == None:
return None
coord = self.ctype(mindistrow['lat'], mindistrow['lon'], '', mindistrow)
return coord
def set_filter(self, found=None, has_details=None, owner_search='', name_search='', size=None, terrain=None, diff=None, ctype=None, adapt_filter=False, marked=None):
# a value "None" means: apply no filtering on this value
filter = copy(locals())
del filter['self']
self.filter = filter
if adapt_filter:
filterstring = copy(self.filterstring)
filterargs = copy(self.filterargs)
else:
filterstring = []
filterargs = []
if found == True:
filterstring.append('(found = 1)')
elif found == False:
filterstring.append('(found = 0)')
if marked == True:
filterstring.append('(marked = 1)')
elif marked == False:
filterstring.append('(marked = 0)')
if has_details == True:
filterstring.append("(desc != '' or shortdesc != '')")
elif has_details == False:
filterstring.append("NOT (desc != '' or shortdesc != '')")
if owner_search != None and len(owner_search) > 2:
filterstring.append("(owner LIKE '%%%s%%')" % owner_search)
if name_search != None and len(name_search) > 2:
filterstring.append("((name LIKE '%%%s%%') OR (title LIKE '%%%s%%'))" % (name_search, name_search))
if size != None:
filterstring.append('(size IN (%s))' % (", ".join(str(b) for b in size)))
if terrain != None:
if type(terrain) == tuple:
filterstring.append('(terrain >= ?) AND (terrain <= ?)')
filterargs.append(terrain[0] * 10)
filterargs.append(terrain[1] * 10)
elif type(terrain) == list:
filterstring.append('(terrain IN (%s))' % (", ".join('?' for b in terrain)))
for b in terrain:
filterargs.append(b * 10)
if diff != None:
if type(diff) == tuple:
filterstring.append('(difficulty >= ?) AND (difficulty <= ?)')
filterargs.append(diff[0] * 10)
filterargs.append(diff[1] * 10)
elif type(diff) == list:
filterstring.append('(difficulty IN (%s))' % (", ".join('?' for b in diff)))
for b in diff:
filterargs.append(b * 10)
if ctype != None:
if len(ctype) > 0:
filterstring.append('(type IN (%s))' % (", ".join('?' for b in ctype)))
for b in ctype:
filterargs.append(b)
if len(filterstring) == 0:
filterstring.append('1')
self.filterstring = filterstring
self.filterargs = filterargs
def push_filter(self):
self.filterstack.append((self.filterstring, self.filterargs))
def pop_filter(self):
self.filterstring, self.filterargs = self.filterstack.pop()
def get_points_filter(self, location=None, found=None, max_results=None):
filterstring = copy(self.filterstring)
filterargs = copy(self.filterargs)
if max_results == None:
max_results = self.MAX_RESULTS
if location != None:
c1, c2 = location
filterstring.append('(lat BETWEEN ? AND ?) AND (lon BETWEEN ? AND ?)')
filterargs.append(min(c1.lat, c2.lat))
filterargs.append(max(c1.lat, c2.lat))
filterargs.append(min(c1.lon, c2.lon))
filterargs.append(max(c1.lon, c2.lon))
if found == True:
filterstring.append('(found = 1)')
elif found == False:
filterstring.append('(found = 0)')
query = 'SELECT * FROM %s WHERE %s LIMIT %s' % (self.cache_table, " AND ".join(filterstring), max_results)
c = self.conn.execute(query, tuple(filterargs))
return self.pack_result(c)
def pack_result(self, cursor):
points = [self.ctype(None, None, None, row) for row in cursor]
cursor.close()
return points
def find_by_string(self, string):
query = 'SELECT * FROM %s WHERE name LIKE ? OR title LIKE ? LIMIT 2' % self.cache_table
c = self.conn.execute(query, (string, string))
row = c.fetchone()
coord = self.ctype(None, None, None, row)
# we cannot reliably determine # of results, so using workaround here
if c.fetchone() != None:
return None
return coord
def update_field(self, coordinate, field, newvalue, save = True):
query = 'UPDATE %s SET %s = ? WHERE name = ?' % (self.cache_table, field)
self.conn.execute(query, (newvalue, coordinate.name))
if save:
self.save()
def get_by_name(self, gcname):
query = 'SELECT * FROM %s WHERE name LIKE ? LIMIT 2' % self.cache_table
c = self.conn.execute(query, (gcname,))
row = c.fetchone()
if row != None:
coord = self.ctype(None, None, None, row)
return coord
else:
return None
def remove_geocaches(self, list):
names = [x.name for x in list if x.name != '']
query = 'DELETE FROM %s WHERE name IN (%s)' % (self.cache_table, (','.join('?' for x in names)))
self.conn.execute(query, tuple(names))
self.save()
def optimize(self):
self.conn.execute('VACUUM')
|