/usr/share/pyshared/pymecavideo/listes.py is in python-mecavideo 6.1-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 | #-*- coding: utf-8 -*-
"""
listes, a module for pymecavideo:
a program to track moving points in a video frameset
this module is about defining a few list classes.
Copyright (C) 2007 Jean-Baptiste Butet <ashashiwa@gmail.com>
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/>.
"""
class listePointee:
"""Une liste de données avec un pointeur, qui permet de revenir en arrière
et en avant dans la liste.
"""
def __init__(self):
"""Crée la liste, initialement vide.
"""
self.data=[]
self.ptr=-1
def count(self):
"""
@return le nombre d'éléments existants, indépendamment de la
position du pointeur
"""
return len(self.data)
def append(self, val):
"""Ajoute un élément. Si le pointeur n'était pas à la fin, détruit
les enregistrements qui suivent.
"""
if self.ptr < len(self.data)-1:
for i in range(len(self.data)-1, self.ptr, -1):
del self.data[i]
self.data.append(val)
self.ptr=len(self.data)-1
def incPtr(self):
if self.ptr < len(self.data)-1:
self.ptr+=1
def decPtr(self):
if self.ptr > -1:
self.ptr -= 1
def __iter__(self):
return listePointeeIterateur(self)
def __getitem__(self,i):
if i >=0 and i <=self.ptr:
return self.data[i]
else:
raise IndexError
def __len__(self):
return self.ptr+1
def nextCount(self):
"""
renvoie le nombre de données après le pointeur
"""
return len(self.data)-self.ptr-1
def __str__(self):
s="liste pointee : ["
for i in range(len(self.data)):
if i==self.ptr:
s += "@"
s += "%s"%self.data[i]
if i==self.ptr:
s += "@"
if i < len(self.data)-1:
s += ", "
s += "]"
return s
def __repr__(self):
return self.__str__()
class listePointeeIterateur:
"""Un itérateur pour le type précédent.
"""
def __init__(self, lp):
self.i=0
self.lp=lp
def next(self):
i=self.i
self.i+=1
if i > self.lp.ptr:
raise StopIteration
return self.lp.data[i]
if __name__=="__main__":
print "quelques tests de liste pointée"
l1=listePointee()
l1.append(1)
l1.append(['a','b'])
l1.append(2)
l1.append(3)
l1.decPtr()
print """
l1=listePointee()
l1.append(1)
l1.append(['a','b'])
l1.append(2)
l1.append(3)
l1.decPtr()
"""
print ">>> l1 = %s" %l1
print ">>> l1[0] = %s" %l1[0]
print """
for e in l1:
print e
"""
for e in l1:
print e
print "\n>>> len(l1) = %s" %len(l1)
l1.incPtr()
print """
l1.incPtr()
"""
for e in l1:
print e
print "\n>>> len(l1) = %s" %len(l1)
l1.decPtr()
l1.decPtr()
l1.append('x')
print """
l1.decPtr()
l1.decPtr()
l1.append('x')
"""
for e in l1:
print e
print "\n>>> len(l1) = %s" %len(l1)
|