├── .gitignore
├── arboln.py
├── arbolb.py
└── LICENSE
/.gitignore:
--------------------------------------------------------------------------------
1 | # Byte-compiled / optimized / DLL files
2 | __pycache__/
3 | *.py[cod]
4 | *$py.class
5 |
6 | # C extensions
7 | *.so
8 |
9 | # Distribution / packaging
10 | .Python
11 | env/
12 | build/
13 | develop-eggs/
14 | dist/
15 | downloads/
16 | eggs/
17 | .eggs/
18 | lib/
19 | lib64/
20 | parts/
21 | sdist/
22 | var/
23 | *.egg-info/
24 | .installed.cfg
25 | *.egg
26 |
27 | # PyInstaller
28 | # Usually these files are written by a python script from a template
29 | # before PyInstaller builds the exe, so as to inject date/other infos into it.
30 | *.manifest
31 | *.spec
32 |
33 | # Installer logs
34 | pip-log.txt
35 | pip-delete-this-directory.txt
36 |
37 | # Unit test / coverage reports
38 | htmlcov/
39 | .tox/
40 | .coverage
41 | .coverage.*
42 | .cache
43 | nosetests.xml
44 | coverage.xml
45 | *,cover
46 | .hypothesis/
47 |
48 | # Translations
49 | *.mo
50 | *.pot
51 |
52 | # Django stuff:
53 | *.log
54 | local_settings.py
55 |
56 | # Flask stuff:
57 | instance/
58 | .webassets-cache
59 |
60 | # Scrapy stuff:
61 | .scrapy
62 |
63 | # Sphinx documentation
64 | docs/_build/
65 |
66 | # PyBuilder
67 | target/
68 |
69 | # IPython Notebook
70 | .ipynb_checkpoints
71 |
72 | # pyenv
73 | .python-version
74 |
75 | # celery beat schedule file
76 | celerybeat-schedule
77 |
78 | # dotenv
79 | .env
80 |
81 | # virtualenv
82 | venv/
83 | ENV/
84 |
85 | # Spyder project settings
86 | .spyderproject
87 |
88 | # Rope project settings
89 | .ropeproject
90 |
--------------------------------------------------------------------------------
/arboln.py:
--------------------------------------------------------------------------------
1 | # Arbol N-ario
2 | # Autor: Javier Rivera
3 | #
4 |
5 |
6 | class Nodo:
7 | def __init__ (self, valor):
8 | self.info = valor
9 | self.hijos = []
10 |
11 | class Arboln:
12 | def __init__(self):
13 | self.__raiz = None
14 |
15 | def __buscar (self, valor, hermanos = None, pos = 0):
16 |
17 | if (pos >= len(hermanos)):
18 | return None
19 |
20 | if (hermanos[pos].info == valor):
21 | return hermanos[pos]
22 |
23 | nodo = self.__buscar (valor, hermanos[pos].hijos)
24 | if (nodo != None):
25 | return nodo
26 |
27 | nodo = self.__buscar (valor, hermanos, pos + 1)
28 | if (nodo != None):
29 | return nodo
30 |
31 | return None
32 |
33 | def buscar (self, valor):
34 |
35 | if (self.__raiz == valor):
36 | return True
37 |
38 | if (self.__buscar(valor, self.__raiz.hijos) != None):
39 | return True
40 | return False
41 |
42 | def insertar (self, valor, val_padre = None, pos_hijo = 0):
43 |
44 | if (self.__raiz == None):
45 | self.__raiz = Nodo(valor)
46 | return True
47 |
48 | if (val_padre == self.__raiz.info):
49 | padre = self.__raiz
50 | else:
51 | padre = self.__buscar (val_padre, self.__raiz.hijos, 0)
52 |
53 | if (padre != None):
54 | padre.hijos.insert (pos_hijo,Nodo(valor))
55 | return True
56 |
57 | return False
58 |
59 | # Retorna la informacion del padre con mas hijos
60 | def padre_mas_hijos (self, nodos = None, pos = 0):
61 |
62 | if (nodos == None):
63 | if (self.__raiz == None):
64 | return None
65 | nodos = [self.__raiz]
66 | self.__mayorpadre = self.__raiz
67 |
68 | if (pos >= len(nodos)):
69 | return 0
70 |
71 | if (len(nodos[pos].hijos) > len(self.__mayorpadre.hijos)):
72 | self.__mayorpadre = nodos[pos]
73 |
74 | self.padre_mas_hijos(nodos[pos].hijos)
75 | self.padre_mas_hijos(nodos, pos + 1)
76 |
77 | return self.__mayorpadre.info
78 |
79 | # Retorna el nro de hijos unicos (sin hermanos) en el arbol
80 | # La raiz siempre es hijo unico
81 | def hijos_unicos (self, nodos = None, pos = 0):
82 | if (nodos == None):
83 | if (self.__raiz == None):
84 | return 0
85 | nodos = [self.__raiz]
86 |
87 | if (pos >= len(nodos)):
88 | return 0
89 |
90 | h_unico = 0
91 | if (len(nodos) == 1):
92 | h_unico = 1
93 |
94 | h_unicos_hijos = self.hijos_unicos (nodos[pos].hijos)
95 | h_unicos_Hermanos = self.hijos_unicos (nodos, pos + 1)
96 |
97 | return h_unico + h_unicos_hijos + h_unicos_Hermanos
98 |
99 | # Retorna True si dos valores indicados son nodos hermanos en el arbol n-ario
100 | def son_hermanos (self, fulano, sutano, nodos = None, pos = 0):
101 | if (nodos == None):
102 | if (self.__raiz == None):
103 | return False
104 | nodos = [self.__raiz]
105 |
106 | if (pos >= len(nodos)):
107 | return False
108 |
109 | hermano = None
110 | if (fulano == nodos[pos].info): # Existe Fulano
111 | hermano = sutano
112 | elif (sutano == nodos[pos].info): # Existe Mengano
113 | hermano = fulano
114 |
115 | if (hermano != None): # Buscar el hermano si exite fulano o sutano
116 | for nodo in nodos:
117 | if (hermano == nodo.info): # Encuentra al hermano
118 | return True
119 |
120 | encontro = self.son_hermanos(fulano,sutano,nodos[pos].hijos)
121 | if (encontro):
122 | return True
123 |
124 | return self.son_hermanos(fulano,sutano,nodos, pos + 1)
125 |
126 | # Recorrido en Preorden
127 | def preorden (self, nodos = None, pos = 0):
128 |
129 | if (nodos == None):
130 | if (self.__raiz == None):
131 | return
132 | nodos = [self.__raiz]
133 |
134 | if (pos >= len(nodos)):
135 | return
136 |
137 | print nodos[pos].info,
138 | self.preorden (nodos[pos].hijos)
139 | self.preorden (nodos, pos + 1)
140 |
141 | # Retorna la cantidad de nodos en el arbol que tienen mas de n hijos
142 | def nodos_mas_hijos_de (self, n, nodos = None, pos = 0):
143 | if (nodos == None):
144 | if (self.__raiz == None):
145 | return 0
146 | nodos = [self.__raiz]
147 |
148 | if (pos >= len(nodos)):
149 | return 0
150 |
151 | cont = 0
152 | if (len(nodos[pos].hijos) > n):
153 | cont = 1
154 |
155 | cont += self.nodos_mas_hijos_de (n, nodos[pos].hijos)
156 | cont += self.nodos_mas_hijos_de (n, nodos, pos + 1)
157 |
158 | return cont
159 |
--------------------------------------------------------------------------------
/arbolb.py:
--------------------------------------------------------------------------------
1 | # Arbol Binario
2 | # Autor: Javier Rivera (UNEFA)
3 | # https://repl.it/Dkvj/11
4 |
5 | class Nodo:
6 | def __init__ (self, valor):
7 | self.info = valor
8 | self.hizq = None
9 | self.hder = None
10 |
11 | class Arbolb:
12 | def __init__(self):
13 | self.__raiz = None
14 |
15 | def insertar(self, valor, raiz = None):
16 |
17 | if (raiz == None):
18 | if (self.__raiz == None):
19 | self.__raiz = Nodo(valor)
20 | return
21 | raiz = self.__raiz
22 |
23 | if (valor < raiz.info):
24 | if(raiz.hizq == None):
25 | raiz.hizq = Nodo(valor)
26 | else:
27 | self.insertar (valor, raiz.hizq)
28 | else:
29 | if (raiz.hder == None):
30 | raiz.hder = Nodo(valor)
31 | else:
32 | self.insertar (valor, raiz.hder)
33 |
34 | # Retorna el hermano de un elemento del arbol, indica cual hermano es
35 | def hermano (self, valor, raiz = None):
36 | if (raiz == None):
37 | if (self.__raiz == None):
38 | return
39 | raiz = self.__raiz
40 |
41 | if (valor < raiz.info and raiz.hizq != None):
42 | if (raiz.hizq.info == valor):
43 | if (raiz.hder != None):
44 | return raiz.hder.info, "DER"
45 | return False, "DER"
46 | return self.hermano (valor, raiz.hizq)
47 |
48 | elif (valor > raiz.info and raiz.hder != None):
49 | if (raiz.hder.info == valor):
50 | if (raiz.hizq != None):
51 | return raiz.hizq.info, "IZQ"
52 | return False, "IZQ"
53 | return self.hermano (valor, raiz.hder)
54 |
55 | return None
56 |
57 | def __hijoMayor (self, raiz = None):
58 | if (raiz == None):
59 | if (self.__raiz == None):
60 | return
61 | raiz = self.__raiz
62 | self.__padre = None
63 |
64 | if (raiz.hder != None):
65 | self.__padre = raiz
66 | self.__dir = "D"
67 | return self.__hijoMayor(raiz.hder)
68 |
69 | return raiz
70 |
71 | def __hijoMenor (self, raiz = None):
72 | if (raiz == None):
73 | if (self.__raiz == None):
74 | return
75 | raiz = self.__raiz
76 | self.__padre = None
77 |
78 | if (raiz.hizq != None):
79 | self.__padre = raiz
80 | self.__dir = "I"
81 | return self.__hijoMenor(raiz.hizq)
82 |
83 | return raiz
84 |
85 | # Retorna la profundidad de un arbol, un arbol vacio tiene profundidad 0
86 | def prof (self, raiz = None):
87 | if (raiz == None):
88 | if (self.__raiz == None):
89 | return 0
90 | raiz = self.__raiz
91 |
92 | pizq = pder = 0
93 | if (raiz.hizq != None):
94 | pizq = self.prof (raiz.hizq)
95 |
96 | if (raiz.hder != None):
97 | pder = self.prof (raiz.hder)
98 |
99 | if (pizq > pder):
100 | return pizq + 1
101 | return pder + 1
102 |
103 | def eliminar (self, valor, raiz = None):
104 | if (raiz == None):
105 | if (self.__raiz == None):
106 | return
107 | raiz = self.__raiz
108 | self.__padre = None
109 | self.__dir = None
110 |
111 | if (raiz.info == valor):
112 | if (raiz.hizq == None or raiz.hder == None):
113 |
114 | # Caso 1: Es una Hoja
115 | if (raiz.hizq == None and raiz.hder == None):
116 | nieto = None # Es la raiz
117 |
118 | else: # Caso 2: Una rama con una sola Hoja
119 | if (raiz.hizq != None):
120 | nieto = raiz.hizq
121 | else:
122 | nieto = raiz.hder
123 |
124 | # Elimina nodo y acomoda hijo (izq o der)
125 | del raiz
126 | if (self.__dir == "I"):
127 | self.__padre.hizq = nieto
128 | elif (self.__dir == "D"):
129 | self.__padre.hder = nieto
130 | else:
131 | self.__raiz = nieto
132 |
133 | return True
134 |
135 | # Caso 3: Una rama completa
136 | self.__padre = raiz
137 | if (self.prof(raiz.hizq) > self.prof(raiz.hder)):
138 | nodoCambio = self.__hijoMayor(raiz.hizq)
139 | else:
140 | nodoCambio = self.__hijoMenor(raiz.hder)
141 |
142 | raiz.info = nodoCambio.info
143 | self.eliminar(nodoCambio.info, nodoCambio) # Elimina nodo cambiado
144 |
145 | return True
146 |
147 | # Busca Nodo
148 | self.__padre = raiz
149 | if (valor < raiz.info and raiz.hizq != None):
150 | self.__dir = "I"
151 | return self.eliminar(valor,raiz.hizq)
152 |
153 | if (raiz.hder != None):
154 | self.__dir = "D"
155 | return self.eliminar(valor,raiz.hder)
156 |
157 | return False
158 |
159 | # Retorna el numero de hojas de un arbol
160 | def num_hojas (self, raiz = None):
161 |
162 | if (raiz == None):
163 | if (self.__raiz == None):
164 | return
165 | raiz = self.__raiz
166 |
167 | if (raiz.hizq == None and raiz.hder == None):
168 | return 1
169 |
170 | n_hizq, n_hder = 0,0
171 | if (raiz.hizq != None):
172 | n_hizq = self.num_hojas(raiz.hizq)
173 |
174 | if (raiz.hder != None):
175 | n_hder = self.num_hojas(raiz.hder)
176 |
177 | return n_hizq + n_hder
178 |
179 | # Retorna si los datos de un arbol son consecutivos (paso 1) recorrido inorden
180 | def esConsecutivo (self, raiz = None):
181 | if (raiz == None):
182 | if (self.__raiz == None):
183 | return
184 | raiz = self.__raiz
185 |
186 | self.__mayor = self.__menor = raiz.info
187 |
188 | if (raiz.hizq != None):
189 | M = self.__mayor
190 | cons = self.esConsecutivo (raiz.hizq)
191 | if (not(cons) or (self.__mayor + 1) != raiz.info):
192 | return False
193 | self.__mayor = M
194 |
195 | if (raiz.hder != None):
196 | m = self.__menor
197 | cons = self.esConsecutivo (raiz.hder)
198 | if (not(cons) or raiz.info != (self.__menor - 1)):
199 | return False
200 | self.__menor = m
201 |
202 | return True
203 |
204 | # Retorna el tipo del nodo de un elemento
205 | # Raiz, Rama Derecha, Rama Izquierda, Hoja Derecho, Hoja Izquiedo,
206 | def tipo_nodo (self, valor, raiz = None, dirn = None):
207 |
208 | if (raiz == None):
209 | if (self.__raiz == None):
210 | return
211 | elif (self.__raiz.info == valor):
212 | return "RAIZ"
213 | raiz = self.__raiz
214 |
215 | if (valor == raiz.info):
216 | if (raiz.hizq == None and raiz.hder == None):
217 | return "HOJA " + dirn
218 | return "RAMA " + dirn
219 |
220 | if (valor < raiz.info and raiz.hizq != None):
221 | return self.tipo_nodo (valor, raiz.hizq, "IZQ")
222 |
223 | elif (raiz.hder != None):
224 | return self.tipo_nodo (valor, raiz.hder, "DER")
225 |
226 | # Elemento mayor del arbol
227 | def elem_mayor (self, raiz = None):
228 | if (raiz == None):
229 | if (self.__raiz == None):
230 | return
231 | raiz = self.__raiz
232 |
233 | if (raiz.hder != None):
234 | return self.elem_mayor(raiz.hder)
235 |
236 | return raiz.info
237 |
238 | # TRES FORMAS DISTINTAS DE OBTENER EL NUMERO DE NODOS DE UN ARBOL BINARIO
239 |
240 | # FORMA 1 (A): la funcion recursiva num_nodos() retorna el numeros de nodos del arbol izquierdo
241 | # y del arbol derecho y los suma EN UNA MISMA VARIABLE al nodo donde se encuentra
242 |
243 | def num_nodos(self, raiz = None):
244 | if (raiz == None):
245 | if (self.__raiz == None):
246 | return 0
247 | raiz = self.__raiz
248 |
249 | num = 0
250 | if (raiz.hizq != None):
251 | num = self.num_nodos(raiz.hizq)
252 |
253 | if (raiz.hder != None):
254 | num = num + self.num_nodos(raiz.hder)
255 |
256 | return 1 + num
257 |
258 | # FORMA 1 (B): a funcion recursiva num_nodos() retorna el numeros de nodos del arbol izquierdo
259 | # y del arbol derecho y los suma al nodo donde se encuentra
260 |
261 | def num_nodos_B (self, raiz = None):
262 | if (raiz == None):
263 | if (self.__raiz == None):
264 | return 0
265 | raiz = self.__raiz
266 |
267 | numI,numD = 0,0
268 | if (raiz.hizq != None):
269 | numI = self.num_nodos(raiz.hizq)
270 |
271 | if (raiz.hder != None):
272 | numD + self.num_nodos(raiz.hder)
273 |
274 | return 1 + numI + numD
275 |
276 |
277 | # FORMA 2: la funcion recursiva nro_nodos() envia por paranetro el numero de nodos encontrados el recorrido
278 | # (iniciado por cero en la raiz) luego lo envia por parametro a sus ramas izquierda y derecha
279 | # para que los retornen con la suma de sus hijos, finalmente retorna el parametro nro mas el nodo actual
280 |
281 | def nro_nodos (self, raiz = None, nro = 0):
282 | if (raiz == None):
283 | if (self.__raiz == None):
284 | return 0
285 | raiz = self.__raiz
286 |
287 | if (raiz.hizq != None):
288 | nro = self.nro_nodos(raiz.hizq,nro)
289 |
290 | if (raiz.hder != None):
291 | nro = self.nro_nodos(raiz.hder,nro)
292 |
293 | return 1 + nro
294 |
295 | # FORMA 3: la funcion recursiva n_nodos() crea un atributo al arbol self.__n donde sumará los valores
296 | # de los nodos a traves del recorrido, al final retorna el valor del atributo
297 |
298 | def n_nodos (self, raiz = None):
299 | if (raiz == None):
300 | self.__n = 0
301 | if (self.__raiz == None):
302 | return self.__n
303 | raiz = self.__raiz
304 |
305 | self.__n = self.__n + 1
306 | if (raiz.hizq != None):
307 | self.n_nodos(raiz.hizq)
308 |
309 | if (raiz.hder != None):
310 | self.n_nodos(raiz.hder)
311 |
312 | # Respalda el valor del atributo temporal en una variable local,
313 | # elimina el atributo temporal y retorna el valor de la variable local
314 | if (raiz == self.__raiz):
315 | n = self.__n
316 | del self.__n
317 | return n
318 |
319 | return self.__n
320 |
321 | # Metodos de recorrido de un arbol binario
322 |
323 | def preorden (self, raiz = None):
324 | if (raiz == None):
325 | if (self.__raiz == None):
326 | return
327 | raiz = self.__raiz
328 |
329 | print raiz.info,
330 | if (raiz.hizq != None):
331 | self.preorden (raiz.hizq)
332 | if (raiz.hder != None):
333 | self.preorden (raiz.hder)
334 |
335 | def postorden (self, raiz = None):
336 | if (raiz == None):
337 | if (self.__raiz == None):
338 | return
339 | raiz = self.__raiz
340 |
341 | if (raiz.hizq != None):
342 | self.postorden (raiz.hizq)
343 | if (raiz.hder != None):
344 | self.postorden (raiz.hder)
345 | print raiz.info,
346 |
347 | def inorden (self, raiz = None):
348 | if (raiz == None):
349 | if (self.__raiz == None):
350 | return
351 | raiz = self.__raiz
352 |
353 | if (raiz.hizq != None):
354 | self.inorden (raiz.hizq)
355 | print raiz.info,
356 | if (raiz.hder != None):
357 | self.inorden (raiz.hder)
358 |
359 | # Suma el valor de los nodos izquierdos, colaborador Antony duque
360 | def SumaNodoIzq (self, raiz = None):
361 | if (raiz == None):
362 | self.__siz = 0
363 | if (self.__raiz == None):
364 | return 0
365 | raiz = self.__raiz
366 |
367 | if (raiz.hizq != None):
368 | self.__siz = self.__siz + raiz.hizq.info
369 | self.SumaNodoIzq (raiz.hizq)
370 |
371 | if (raiz.hder != None):
372 | self.SumaNodoIzq (raiz.hder)
373 |
374 | return self.__siz
375 |
376 | # Hojas en un determinado nivel by:Orlando Ortega
377 | # Niveles a partir de 0
378 | #
379 | # **** ALGORTIMO SIN FALLAS ****
380 |
381 | def hojas_nivel (self, nivel, nodo = None, nro_nivel=0):
382 |
383 | if (nodo == None):
384 | if (self.__raiz == None):
385 | return 0
386 | nodo = self.__raiz
387 | self.cant_hojas = 0
388 |
389 | padre = nodo
390 |
391 | if (nivel == 0): # Nivel de la Raiz
392 | if (padre.hizq == None and padre.hder == None):
393 | return 1
394 |
395 | if (nro_nivel == nivel): # Estoy en el Nivel solicitado
396 | if (padre.hizq == None and padre.hder == None): # Es una Hoja
397 | self.cant_hojas = self.cant_hojas + 1
398 | return self.cant_hojas
399 |
400 | if (padre.hizq != None):
401 | # Busca en la rama izquierda e incrementa nivel
402 | nro_nivel = nro_nivel + 1
403 | self.hojas_nivel (nivel, padre.hizq, nro_nivel)
404 |
405 | if (padre.hder != None):
406 | # Busca en la rama derecha e incrementa nivel
407 | # si no lo incremento por la rama ziqeuierda
408 | if (padre.hizq == None):
409 | nro_nivel = nro_nivel + 1
410 | self.hojas_nivel (nivel, padre.hder, nro_nivel)
411 |
412 | return self.cant_hojas
413 |
414 |
415 | #Metodo que retorna cuantas veces existe un nodo en un Arbol binario
416 | #colaborador Gerardo Uzcategui
417 |
418 | # Los algoritmos de buscar_rep y repetidos son extremadamente ineficientes porque hacen
419 | # recorridos innecesarios, repetitivos y exponenciales en los arboles.
420 |
421 | def buscar_rep(self, valor, raiz = None):
422 |
423 | if (raiz == None):
424 | self.__rep = 0
425 | if (self.__raiz == None):
426 | return
427 | raiz = self.__raiz
428 |
429 | if (raiz.info == valor):
430 | self.__rep = self.__rep + 1
431 |
432 | if (valor < raiz.info and raiz.hizq != None):
433 | return self.buscar_rep(valor,raiz.hizq)
434 |
435 | if (valor >= raiz.info and raiz.hder != None):
436 | return self.buscar_rep(valor,raiz.hder)
437 |
438 | return self.__rep
439 |
440 | #Metodo que indica si un arbol binario tiene nodos repetidos o no
441 | #colaborador Gerardo Uzcategui
442 |
443 | def repetidos(self, raiz = None):
444 |
445 | if (raiz == None):
446 | if (self.__raiz == None):
447 | return False
448 | raiz = self.__raiz
449 |
450 | if (self.buscar_rep(raiz.info) > 1):
451 | return True
452 |
453 | g,h = False,False
454 | if (raiz.hizq != None):
455 | g = self.repetidos(raiz.hizq)
456 |
457 | if (raiz.hder != None):
458 | h = self.repetidos(raiz.hder)
459 |
460 | if (g or h == True):
461 | return True
462 |
463 | return False
464 |
465 | # Retorna si un arbol binario es perfecto (todas sus hojas estan completas y en el último nivel)
466 | def esPerfecto (self, raiz = None, nivel = 0):
467 |
468 | if (raiz == None):
469 | if (self.__raiz == None):
470 | return
471 | self.__nivel_hoja = None # atributo que almacena el nivel de las hojas
472 | raiz = self.__raiz
473 |
474 | if (raiz.hizq == None and raiz.hder == None): # Es una hoja
475 | if (self.__nivel_hoja == None):
476 | self.__nivel_hoja = nivel
477 |
478 | if (self.__nivel_hoja != nivel): # verifica si todas las hojas estan en el mimsmo nivel
479 | return False
480 |
481 | if (raiz.hizq != None):
482 | if (self.esPerfecto(raiz.hizq, nivel+1) == False):
483 | return False
484 |
485 | if (raiz.hder != None):
486 | return self.esPerfecto(raiz.hder, nivel+1)
487 |
488 | return True
489 |
490 | # Metodo que retorna los elementos de un arbol binario que hacen falta para que
491 | # el arbol tenga todo sus valores consecutivamente con paso 1
492 |
493 | def faltanConsecutivo (self, raiz = None):
494 |
495 | if (raiz == None):
496 | if (self.__raiz == None):
497 | return
498 | raiz = self.__raiz
499 | self.__faltan = [] # Guarda los elementos faltantes
500 |
501 | self.__mayor = self.__menor = raiz.info
502 |
503 | if (raiz.hizq != None):
504 | M = self.__mayor
505 | self.faltanConsecutivo (raiz.hizq)
506 | if (raiz.info != (self.__mayor + 1)):
507 | for i in range(self.__mayor + 1, raiz.info):
508 | self.__faltan.append(i)
509 | self.__mayor = M
510 |
511 | if (raiz.hder != None):
512 | m = self.__menor
513 | self.faltanConsecutivo (raiz.hder)
514 | if (raiz.info != (self.__menor - 1)):
515 | for i in range(raiz.info + 1,self.__menor):
516 | self.__faltan.append(i)
517 | self.__menor = m
518 |
519 | self.__faltan.sort()
520 | return self.__faltan
521 |
522 |
523 |
--------------------------------------------------------------------------------
/LICENSE:
--------------------------------------------------------------------------------
1 | GNU GENERAL PUBLIC LICENSE
2 | Version 3, 29 June 2007
3 |
4 | Copyright (C) 2007 Free Software Foundation, Inc.
5 | Everyone is permitted to copy and distribute verbatim copies
6 | of this license document, but changing it is not allowed.
7 |
8 | Preamble
9 |
10 | The GNU General Public License is a free, copyleft license for
11 | software and other kinds of works.
12 |
13 | The licenses for most software and other practical works are designed
14 | to take away your freedom to share and change the works. By contrast,
15 | the GNU General Public License is intended to guarantee your freedom to
16 | share and change all versions of a program--to make sure it remains free
17 | software for all its users. We, the Free Software Foundation, use the
18 | GNU General Public License for most of our software; it applies also to
19 | any other work released this way by its authors. You can apply it to
20 | your programs, too.
21 |
22 | When we speak of free software, we are referring to freedom, not
23 | price. Our General Public Licenses are designed to make sure that you
24 | have the freedom to distribute copies of free software (and charge for
25 | them if you wish), that you receive source code or can get it if you
26 | want it, that you can change the software or use pieces of it in new
27 | free programs, and that you know you can do these things.
28 |
29 | To protect your rights, we need to prevent others from denying you
30 | these rights or asking you to surrender the rights. Therefore, you have
31 | certain responsibilities if you distribute copies of the software, or if
32 | you modify it: responsibilities to respect the freedom of others.
33 |
34 | For example, if you distribute copies of such a program, whether
35 | gratis or for a fee, you must pass on to the recipients the same
36 | freedoms that you received. You must make sure that they, too, receive
37 | or can get the source code. And you must show them these terms so they
38 | know their rights.
39 |
40 | Developers that use the GNU GPL protect your rights with two steps:
41 | (1) assert copyright on the software, and (2) offer you this License
42 | giving you legal permission to copy, distribute and/or modify it.
43 |
44 | For the developers' and authors' protection, the GPL clearly explains
45 | that there is no warranty for this free software. For both users' and
46 | authors' sake, the GPL requires that modified versions be marked as
47 | changed, so that their problems will not be attributed erroneously to
48 | authors of previous versions.
49 |
50 | Some devices are designed to deny users access to install or run
51 | modified versions of the software inside them, although the manufacturer
52 | can do so. This is fundamentally incompatible with the aim of
53 | protecting users' freedom to change the software. The systematic
54 | pattern of such abuse occurs in the area of products for individuals to
55 | use, which is precisely where it is most unacceptable. Therefore, we
56 | have designed this version of the GPL to prohibit the practice for those
57 | products. If such problems arise substantially in other domains, we
58 | stand ready to extend this provision to those domains in future versions
59 | of the GPL, as needed to protect the freedom of users.
60 |
61 | Finally, every program is threatened constantly by software patents.
62 | States should not allow patents to restrict development and use of
63 | software on general-purpose computers, but in those that do, we wish to
64 | avoid the special danger that patents applied to a free program could
65 | make it effectively proprietary. To prevent this, the GPL assures that
66 | patents cannot be used to render the program non-free.
67 |
68 | The precise terms and conditions for copying, distribution and
69 | modification follow.
70 |
71 | TERMS AND CONDITIONS
72 |
73 | 0. Definitions.
74 |
75 | "This License" refers to version 3 of the GNU General Public License.
76 |
77 | "Copyright" also means copyright-like laws that apply to other kinds of
78 | works, such as semiconductor masks.
79 |
80 | "The Program" refers to any copyrightable work licensed under this
81 | License. Each licensee is addressed as "you". "Licensees" and
82 | "recipients" may be individuals or organizations.
83 |
84 | To "modify" a work means to copy from or adapt all or part of the work
85 | in a fashion requiring copyright permission, other than the making of an
86 | exact copy. The resulting work is called a "modified version" of the
87 | earlier work or a work "based on" the earlier work.
88 |
89 | A "covered work" means either the unmodified Program or a work based
90 | on the Program.
91 |
92 | To "propagate" a work means to do anything with it that, without
93 | permission, would make you directly or secondarily liable for
94 | infringement under applicable copyright law, except executing it on a
95 | computer or modifying a private copy. Propagation includes copying,
96 | distribution (with or without modification), making available to the
97 | public, and in some countries other activities as well.
98 |
99 | To "convey" a work means any kind of propagation that enables other
100 | parties to make or receive copies. Mere interaction with a user through
101 | a computer network, with no transfer of a copy, is not conveying.
102 |
103 | An interactive user interface displays "Appropriate Legal Notices"
104 | to the extent that it includes a convenient and prominently visible
105 | feature that (1) displays an appropriate copyright notice, and (2)
106 | tells the user that there is no warranty for the work (except to the
107 | extent that warranties are provided), that licensees may convey the
108 | work under this License, and how to view a copy of this License. If
109 | the interface presents a list of user commands or options, such as a
110 | menu, a prominent item in the list meets this criterion.
111 |
112 | 1. Source Code.
113 |
114 | The "source code" for a work means the preferred form of the work
115 | for making modifications to it. "Object code" means any non-source
116 | form of a work.
117 |
118 | A "Standard Interface" means an interface that either is an official
119 | standard defined by a recognized standards body, or, in the case of
120 | interfaces specified for a particular programming language, one that
121 | is widely used among developers working in that language.
122 |
123 | The "System Libraries" of an executable work include anything, other
124 | than the work as a whole, that (a) is included in the normal form of
125 | packaging a Major Component, but which is not part of that Major
126 | Component, and (b) serves only to enable use of the work with that
127 | Major Component, or to implement a Standard Interface for which an
128 | implementation is available to the public in source code form. A
129 | "Major Component", in this context, means a major essential component
130 | (kernel, window system, and so on) of the specific operating system
131 | (if any) on which the executable work runs, or a compiler used to
132 | produce the work, or an object code interpreter used to run it.
133 |
134 | The "Corresponding Source" for a work in object code form means all
135 | the source code needed to generate, install, and (for an executable
136 | work) run the object code and to modify the work, including scripts to
137 | control those activities. However, it does not include the work's
138 | System Libraries, or general-purpose tools or generally available free
139 | programs which are used unmodified in performing those activities but
140 | which are not part of the work. For example, Corresponding Source
141 | includes interface definition files associated with source files for
142 | the work, and the source code for shared libraries and dynamically
143 | linked subprograms that the work is specifically designed to require,
144 | such as by intimate data communication or control flow between those
145 | subprograms and other parts of the work.
146 |
147 | The Corresponding Source need not include anything that users
148 | can regenerate automatically from other parts of the Corresponding
149 | Source.
150 |
151 | The Corresponding Source for a work in source code form is that
152 | same work.
153 |
154 | 2. Basic Permissions.
155 |
156 | All rights granted under this License are granted for the term of
157 | copyright on the Program, and are irrevocable provided the stated
158 | conditions are met. This License explicitly affirms your unlimited
159 | permission to run the unmodified Program. The output from running a
160 | covered work is covered by this License only if the output, given its
161 | content, constitutes a covered work. This License acknowledges your
162 | rights of fair use or other equivalent, as provided by copyright law.
163 |
164 | You may make, run and propagate covered works that you do not
165 | convey, without conditions so long as your license otherwise remains
166 | in force. You may convey covered works to others for the sole purpose
167 | of having them make modifications exclusively for you, or provide you
168 | with facilities for running those works, provided that you comply with
169 | the terms of this License in conveying all material for which you do
170 | not control copyright. Those thus making or running the covered works
171 | for you must do so exclusively on your behalf, under your direction
172 | and control, on terms that prohibit them from making any copies of
173 | your copyrighted material outside their relationship with you.
174 |
175 | Conveying under any other circumstances is permitted solely under
176 | the conditions stated below. Sublicensing is not allowed; section 10
177 | makes it unnecessary.
178 |
179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180 |
181 | No covered work shall be deemed part of an effective technological
182 | measure under any applicable law fulfilling obligations under article
183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
184 | similar laws prohibiting or restricting circumvention of such
185 | measures.
186 |
187 | When you convey a covered work, you waive any legal power to forbid
188 | circumvention of technological measures to the extent such circumvention
189 | is effected by exercising rights under this License with respect to
190 | the covered work, and you disclaim any intention to limit operation or
191 | modification of the work as a means of enforcing, against the work's
192 | users, your or third parties' legal rights to forbid circumvention of
193 | technological measures.
194 |
195 | 4. Conveying Verbatim Copies.
196 |
197 | You may convey verbatim copies of the Program's source code as you
198 | receive it, in any medium, provided that you conspicuously and
199 | appropriately publish on each copy an appropriate copyright notice;
200 | keep intact all notices stating that this License and any
201 | non-permissive terms added in accord with section 7 apply to the code;
202 | keep intact all notices of the absence of any warranty; and give all
203 | recipients a copy of this License along with the Program.
204 |
205 | You may charge any price or no price for each copy that you convey,
206 | and you may offer support or warranty protection for a fee.
207 |
208 | 5. Conveying Modified Source Versions.
209 |
210 | You may convey a work based on the Program, or the modifications to
211 | produce it from the Program, in the form of source code under the
212 | terms of section 4, provided that you also meet all of these conditions:
213 |
214 | a) The work must carry prominent notices stating that you modified
215 | it, and giving a relevant date.
216 |
217 | b) The work must carry prominent notices stating that it is
218 | released under this License and any conditions added under section
219 | 7. This requirement modifies the requirement in section 4 to
220 | "keep intact all notices".
221 |
222 | c) You must license the entire work, as a whole, under this
223 | License to anyone who comes into possession of a copy. This
224 | License will therefore apply, along with any applicable section 7
225 | additional terms, to the whole of the work, and all its parts,
226 | regardless of how they are packaged. This License gives no
227 | permission to license the work in any other way, but it does not
228 | invalidate such permission if you have separately received it.
229 |
230 | d) If the work has interactive user interfaces, each must display
231 | Appropriate Legal Notices; however, if the Program has interactive
232 | interfaces that do not display Appropriate Legal Notices, your
233 | work need not make them do so.
234 |
235 | A compilation of a covered work with other separate and independent
236 | works, which are not by their nature extensions of the covered work,
237 | and which are not combined with it such as to form a larger program,
238 | in or on a volume of a storage or distribution medium, is called an
239 | "aggregate" if the compilation and its resulting copyright are not
240 | used to limit the access or legal rights of the compilation's users
241 | beyond what the individual works permit. Inclusion of a covered work
242 | in an aggregate does not cause this License to apply to the other
243 | parts of the aggregate.
244 |
245 | 6. Conveying Non-Source Forms.
246 |
247 | You may convey a covered work in object code form under the terms
248 | of sections 4 and 5, provided that you also convey the
249 | machine-readable Corresponding Source under the terms of this License,
250 | in one of these ways:
251 |
252 | a) Convey the object code in, or embodied in, a physical product
253 | (including a physical distribution medium), accompanied by the
254 | Corresponding Source fixed on a durable physical medium
255 | customarily used for software interchange.
256 |
257 | b) Convey the object code in, or embodied in, a physical product
258 | (including a physical distribution medium), accompanied by a
259 | written offer, valid for at least three years and valid for as
260 | long as you offer spare parts or customer support for that product
261 | model, to give anyone who possesses the object code either (1) a
262 | copy of the Corresponding Source for all the software in the
263 | product that is covered by this License, on a durable physical
264 | medium customarily used for software interchange, for a price no
265 | more than your reasonable cost of physically performing this
266 | conveying of source, or (2) access to copy the
267 | Corresponding Source from a network server at no charge.
268 |
269 | c) Convey individual copies of the object code with a copy of the
270 | written offer to provide the Corresponding Source. This
271 | alternative is allowed only occasionally and noncommercially, and
272 | only if you received the object code with such an offer, in accord
273 | with subsection 6b.
274 |
275 | d) Convey the object code by offering access from a designated
276 | place (gratis or for a charge), and offer equivalent access to the
277 | Corresponding Source in the same way through the same place at no
278 | further charge. You need not require recipients to copy the
279 | Corresponding Source along with the object code. If the place to
280 | copy the object code is a network server, the Corresponding Source
281 | may be on a different server (operated by you or a third party)
282 | that supports equivalent copying facilities, provided you maintain
283 | clear directions next to the object code saying where to find the
284 | Corresponding Source. Regardless of what server hosts the
285 | Corresponding Source, you remain obligated to ensure that it is
286 | available for as long as needed to satisfy these requirements.
287 |
288 | e) Convey the object code using peer-to-peer transmission, provided
289 | you inform other peers where the object code and Corresponding
290 | Source of the work are being offered to the general public at no
291 | charge under subsection 6d.
292 |
293 | A separable portion of the object code, whose source code is excluded
294 | from the Corresponding Source as a System Library, need not be
295 | included in conveying the object code work.
296 |
297 | A "User Product" is either (1) a "consumer product", which means any
298 | tangible personal property which is normally used for personal, family,
299 | or household purposes, or (2) anything designed or sold for incorporation
300 | into a dwelling. In determining whether a product is a consumer product,
301 | doubtful cases shall be resolved in favor of coverage. For a particular
302 | product received by a particular user, "normally used" refers to a
303 | typical or common use of that class of product, regardless of the status
304 | of the particular user or of the way in which the particular user
305 | actually uses, or expects or is expected to use, the product. A product
306 | is a consumer product regardless of whether the product has substantial
307 | commercial, industrial or non-consumer uses, unless such uses represent
308 | the only significant mode of use of the product.
309 |
310 | "Installation Information" for a User Product means any methods,
311 | procedures, authorization keys, or other information required to install
312 | and execute modified versions of a covered work in that User Product from
313 | a modified version of its Corresponding Source. The information must
314 | suffice to ensure that the continued functioning of the modified object
315 | code is in no case prevented or interfered with solely because
316 | modification has been made.
317 |
318 | If you convey an object code work under this section in, or with, or
319 | specifically for use in, a User Product, and the conveying occurs as
320 | part of a transaction in which the right of possession and use of the
321 | User Product is transferred to the recipient in perpetuity or for a
322 | fixed term (regardless of how the transaction is characterized), the
323 | Corresponding Source conveyed under this section must be accompanied
324 | by the Installation Information. But this requirement does not apply
325 | if neither you nor any third party retains the ability to install
326 | modified object code on the User Product (for example, the work has
327 | been installed in ROM).
328 |
329 | The requirement to provide Installation Information does not include a
330 | requirement to continue to provide support service, warranty, or updates
331 | for a work that has been modified or installed by the recipient, or for
332 | the User Product in which it has been modified or installed. Access to a
333 | network may be denied when the modification itself materially and
334 | adversely affects the operation of the network or violates the rules and
335 | protocols for communication across the network.
336 |
337 | Corresponding Source conveyed, and Installation Information provided,
338 | in accord with this section must be in a format that is publicly
339 | documented (and with an implementation available to the public in
340 | source code form), and must require no special password or key for
341 | unpacking, reading or copying.
342 |
343 | 7. Additional Terms.
344 |
345 | "Additional permissions" are terms that supplement the terms of this
346 | License by making exceptions from one or more of its conditions.
347 | Additional permissions that are applicable to the entire Program shall
348 | be treated as though they were included in this License, to the extent
349 | that they are valid under applicable law. If additional permissions
350 | apply only to part of the Program, that part may be used separately
351 | under those permissions, but the entire Program remains governed by
352 | this License without regard to the additional permissions.
353 |
354 | When you convey a copy of a covered work, you may at your option
355 | remove any additional permissions from that copy, or from any part of
356 | it. (Additional permissions may be written to require their own
357 | removal in certain cases when you modify the work.) You may place
358 | additional permissions on material, added by you to a covered work,
359 | for which you have or can give appropriate copyright permission.
360 |
361 | Notwithstanding any other provision of this License, for material you
362 | add to a covered work, you may (if authorized by the copyright holders of
363 | that material) supplement the terms of this License with terms:
364 |
365 | a) Disclaiming warranty or limiting liability differently from the
366 | terms of sections 15 and 16 of this License; or
367 |
368 | b) Requiring preservation of specified reasonable legal notices or
369 | author attributions in that material or in the Appropriate Legal
370 | Notices displayed by works containing it; or
371 |
372 | c) Prohibiting misrepresentation of the origin of that material, or
373 | requiring that modified versions of such material be marked in
374 | reasonable ways as different from the original version; or
375 |
376 | d) Limiting the use for publicity purposes of names of licensors or
377 | authors of the material; or
378 |
379 | e) Declining to grant rights under trademark law for use of some
380 | trade names, trademarks, or service marks; or
381 |
382 | f) Requiring indemnification of licensors and authors of that
383 | material by anyone who conveys the material (or modified versions of
384 | it) with contractual assumptions of liability to the recipient, for
385 | any liability that these contractual assumptions directly impose on
386 | those licensors and authors.
387 |
388 | All other non-permissive additional terms are considered "further
389 | restrictions" within the meaning of section 10. If the Program as you
390 | received it, or any part of it, contains a notice stating that it is
391 | governed by this License along with a term that is a further
392 | restriction, you may remove that term. If a license document contains
393 | a further restriction but permits relicensing or conveying under this
394 | License, you may add to a covered work material governed by the terms
395 | of that license document, provided that the further restriction does
396 | not survive such relicensing or conveying.
397 |
398 | If you add terms to a covered work in accord with this section, you
399 | must place, in the relevant source files, a statement of the
400 | additional terms that apply to those files, or a notice indicating
401 | where to find the applicable terms.
402 |
403 | Additional terms, permissive or non-permissive, may be stated in the
404 | form of a separately written license, or stated as exceptions;
405 | the above requirements apply either way.
406 |
407 | 8. Termination.
408 |
409 | You may not propagate or modify a covered work except as expressly
410 | provided under this License. Any attempt otherwise to propagate or
411 | modify it is void, and will automatically terminate your rights under
412 | this License (including any patent licenses granted under the third
413 | paragraph of section 11).
414 |
415 | However, if you cease all violation of this License, then your
416 | license from a particular copyright holder is reinstated (a)
417 | provisionally, unless and until the copyright holder explicitly and
418 | finally terminates your license, and (b) permanently, if the copyright
419 | holder fails to notify you of the violation by some reasonable means
420 | prior to 60 days after the cessation.
421 |
422 | Moreover, your license from a particular copyright holder is
423 | reinstated permanently if the copyright holder notifies you of the
424 | violation by some reasonable means, this is the first time you have
425 | received notice of violation of this License (for any work) from that
426 | copyright holder, and you cure the violation prior to 30 days after
427 | your receipt of the notice.
428 |
429 | Termination of your rights under this section does not terminate the
430 | licenses of parties who have received copies or rights from you under
431 | this License. If your rights have been terminated and not permanently
432 | reinstated, you do not qualify to receive new licenses for the same
433 | material under section 10.
434 |
435 | 9. Acceptance Not Required for Having Copies.
436 |
437 | You are not required to accept this License in order to receive or
438 | run a copy of the Program. Ancillary propagation of a covered work
439 | occurring solely as a consequence of using peer-to-peer transmission
440 | to receive a copy likewise does not require acceptance. However,
441 | nothing other than this License grants you permission to propagate or
442 | modify any covered work. These actions infringe copyright if you do
443 | not accept this License. Therefore, by modifying or propagating a
444 | covered work, you indicate your acceptance of this License to do so.
445 |
446 | 10. Automatic Licensing of Downstream Recipients.
447 |
448 | Each time you convey a covered work, the recipient automatically
449 | receives a license from the original licensors, to run, modify and
450 | propagate that work, subject to this License. You are not responsible
451 | for enforcing compliance by third parties with this License.
452 |
453 | An "entity transaction" is a transaction transferring control of an
454 | organization, or substantially all assets of one, or subdividing an
455 | organization, or merging organizations. If propagation of a covered
456 | work results from an entity transaction, each party to that
457 | transaction who receives a copy of the work also receives whatever
458 | licenses to the work the party's predecessor in interest had or could
459 | give under the previous paragraph, plus a right to possession of the
460 | Corresponding Source of the work from the predecessor in interest, if
461 | the predecessor has it or can get it with reasonable efforts.
462 |
463 | You may not impose any further restrictions on the exercise of the
464 | rights granted or affirmed under this License. For example, you may
465 | not impose a license fee, royalty, or other charge for exercise of
466 | rights granted under this License, and you may not initiate litigation
467 | (including a cross-claim or counterclaim in a lawsuit) alleging that
468 | any patent claim is infringed by making, using, selling, offering for
469 | sale, or importing the Program or any portion of it.
470 |
471 | 11. Patents.
472 |
473 | A "contributor" is a copyright holder who authorizes use under this
474 | License of the Program or a work on which the Program is based. The
475 | work thus licensed is called the contributor's "contributor version".
476 |
477 | A contributor's "essential patent claims" are all patent claims
478 | owned or controlled by the contributor, whether already acquired or
479 | hereafter acquired, that would be infringed by some manner, permitted
480 | by this License, of making, using, or selling its contributor version,
481 | but do not include claims that would be infringed only as a
482 | consequence of further modification of the contributor version. For
483 | purposes of this definition, "control" includes the right to grant
484 | patent sublicenses in a manner consistent with the requirements of
485 | this License.
486 |
487 | Each contributor grants you a non-exclusive, worldwide, royalty-free
488 | patent license under the contributor's essential patent claims, to
489 | make, use, sell, offer for sale, import and otherwise run, modify and
490 | propagate the contents of its contributor version.
491 |
492 | In the following three paragraphs, a "patent license" is any express
493 | agreement or commitment, however denominated, not to enforce a patent
494 | (such as an express permission to practice a patent or covenant not to
495 | sue for patent infringement). To "grant" such a patent license to a
496 | party means to make such an agreement or commitment not to enforce a
497 | patent against the party.
498 |
499 | If you convey a covered work, knowingly relying on a patent license,
500 | and the Corresponding Source of the work is not available for anyone
501 | to copy, free of charge and under the terms of this License, through a
502 | publicly available network server or other readily accessible means,
503 | then you must either (1) cause the Corresponding Source to be so
504 | available, or (2) arrange to deprive yourself of the benefit of the
505 | patent license for this particular work, or (3) arrange, in a manner
506 | consistent with the requirements of this License, to extend the patent
507 | license to downstream recipients. "Knowingly relying" means you have
508 | actual knowledge that, but for the patent license, your conveying the
509 | covered work in a country, or your recipient's use of the covered work
510 | in a country, would infringe one or more identifiable patents in that
511 | country that you have reason to believe are valid.
512 |
513 | If, pursuant to or in connection with a single transaction or
514 | arrangement, you convey, or propagate by procuring conveyance of, a
515 | covered work, and grant a patent license to some of the parties
516 | receiving the covered work authorizing them to use, propagate, modify
517 | or convey a specific copy of the covered work, then the patent license
518 | you grant is automatically extended to all recipients of the covered
519 | work and works based on it.
520 |
521 | A patent license is "discriminatory" if it does not include within
522 | the scope of its coverage, prohibits the exercise of, or is
523 | conditioned on the non-exercise of one or more of the rights that are
524 | specifically granted under this License. You may not convey a covered
525 | work if you are a party to an arrangement with a third party that is
526 | in the business of distributing software, under which you make payment
527 | to the third party based on the extent of your activity of conveying
528 | the work, and under which the third party grants, to any of the
529 | parties who would receive the covered work from you, a discriminatory
530 | patent license (a) in connection with copies of the covered work
531 | conveyed by you (or copies made from those copies), or (b) primarily
532 | for and in connection with specific products or compilations that
533 | contain the covered work, unless you entered into that arrangement,
534 | or that patent license was granted, prior to 28 March 2007.
535 |
536 | Nothing in this License shall be construed as excluding or limiting
537 | any implied license or other defenses to infringement that may
538 | otherwise be available to you under applicable patent law.
539 |
540 | 12. No Surrender of Others' Freedom.
541 |
542 | If conditions are imposed on you (whether by court order, agreement or
543 | otherwise) that contradict the conditions of this License, they do not
544 | excuse you from the conditions of this License. If you cannot convey a
545 | covered work so as to satisfy simultaneously your obligations under this
546 | License and any other pertinent obligations, then as a consequence you may
547 | not convey it at all. For example, if you agree to terms that obligate you
548 | to collect a royalty for further conveying from those to whom you convey
549 | the Program, the only way you could satisfy both those terms and this
550 | License would be to refrain entirely from conveying the Program.
551 |
552 | 13. Use with the GNU Affero General Public License.
553 |
554 | Notwithstanding any other provision of this License, you have
555 | permission to link or combine any covered work with a work licensed
556 | under version 3 of the GNU Affero General Public License into a single
557 | combined work, and to convey the resulting work. The terms of this
558 | License will continue to apply to the part which is the covered work,
559 | but the special requirements of the GNU Affero General Public License,
560 | section 13, concerning interaction through a network will apply to the
561 | combination as such.
562 |
563 | 14. Revised Versions of this License.
564 |
565 | The Free Software Foundation may publish revised and/or new versions of
566 | the GNU General Public License from time to time. Such new versions will
567 | be similar in spirit to the present version, but may differ in detail to
568 | address new problems or concerns.
569 |
570 | Each version is given a distinguishing version number. If the
571 | Program specifies that a certain numbered version of the GNU General
572 | Public License "or any later version" applies to it, you have the
573 | option of following the terms and conditions either of that numbered
574 | version or of any later version published by the Free Software
575 | Foundation. If the Program does not specify a version number of the
576 | GNU General Public License, you may choose any version ever published
577 | by the Free Software Foundation.
578 |
579 | If the Program specifies that a proxy can decide which future
580 | versions of the GNU General Public License can be used, that proxy's
581 | public statement of acceptance of a version permanently authorizes you
582 | to choose that version for the Program.
583 |
584 | Later license versions may give you additional or different
585 | permissions. However, no additional obligations are imposed on any
586 | author or copyright holder as a result of your choosing to follow a
587 | later version.
588 |
589 | 15. Disclaimer of Warranty.
590 |
591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599 |
600 | 16. Limitation of Liability.
601 |
602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610 | SUCH DAMAGES.
611 |
612 | 17. Interpretation of Sections 15 and 16.
613 |
614 | If the disclaimer of warranty and limitation of liability provided
615 | above cannot be given local legal effect according to their terms,
616 | reviewing courts shall apply local law that most closely approximates
617 | an absolute waiver of all civil liability in connection with the
618 | Program, unless a warranty or assumption of liability accompanies a
619 | copy of the Program in return for a fee.
620 |
621 | END OF TERMS AND CONDITIONS
622 |
623 | How to Apply These Terms to Your New Programs
624 |
625 | If you develop a new program, and you want it to be of the greatest
626 | possible use to the public, the best way to achieve this is to make it
627 | free software which everyone can redistribute and change under these terms.
628 |
629 | To do so, attach the following notices to the program. It is safest
630 | to attach them to the start of each source file to most effectively
631 | state the exclusion of warranty; and each file should have at least
632 | the "copyright" line and a pointer to where the full notice is found.
633 |
634 | {one line to give the program's name and a brief idea of what it does.}
635 | Copyright (C) {year} {name of author}
636 |
637 | This program is free software: you can redistribute it and/or modify
638 | it under the terms of the GNU General Public License as published by
639 | the Free Software Foundation, either version 3 of the License, or
640 | (at your option) any later version.
641 |
642 | This program is distributed in the hope that it will be useful,
643 | but WITHOUT ANY WARRANTY; without even the implied warranty of
644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
645 | GNU General Public License for more details.
646 |
647 | You should have received a copy of the GNU General Public License
648 | along with this program. If not, see .
649 |
650 | Also add information on how to contact you by electronic and paper mail.
651 |
652 | If the program does terminal interaction, make it output a short
653 | notice like this when it starts in an interactive mode:
654 |
655 | {project} Copyright (C) {year} {fullname}
656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657 | This is free software, and you are welcome to redistribute it
658 | under certain conditions; type `show c' for details.
659 |
660 | The hypothetical commands `show w' and `show c' should show the appropriate
661 | parts of the General Public License. Of course, your program's commands
662 | might be different; for a GUI interface, you would use an "about box".
663 |
664 | You should also get your employer (if you work as a programmer) or school,
665 | if any, to sign a "copyright disclaimer" for the program, if necessary.
666 | For more information on this, and how to apply and follow the GNU GPL, see
667 | .
668 |
669 | The GNU General Public License does not permit incorporating your program
670 | into proprietary programs. If your program is a subroutine library, you
671 | may consider it more useful to permit linking proprietary applications with
672 | the library. If this is what you want to do, use the GNU Lesser General
673 | Public License instead of this License. But first, please read
674 | .
675 |
--------------------------------------------------------------------------------