2002-08-01 15:26:32 +00:00
|
|
|
|
# This file is part of lyx2lyx
|
2003-12-05 20:09:24 +00:00
|
|
|
|
# -*- coding: iso-8859-1 -*-
|
2004-04-14 08:45:46 +00:00
|
|
|
|
# Copyright (C) 2002-2004 Dekel Tsur <dekel@lyx.org>, Jos<6F> Matos <jamatos@lyx.org>
|
2002-08-01 15:26:32 +00:00
|
|
|
|
#
|
|
|
|
|
# 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 2
|
|
|
|
|
# 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, write to the Free Software
|
|
|
|
|
# Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
|
|
|
|
|
2002-08-02 19:25:14 +00:00
|
|
|
|
import string
|
2004-04-14 08:45:46 +00:00
|
|
|
|
import re
|
2002-08-02 19:25:14 +00:00
|
|
|
|
|
|
|
|
|
def check_token(line, token):
|
|
|
|
|
if line[:len(token)] == token:
|
2006-07-01 19:16:09 +00:00
|
|
|
|
return 1
|
2002-08-01 15:26:32 +00:00
|
|
|
|
return 0
|
|
|
|
|
|
2004-05-11 16:13:33 +00:00
|
|
|
|
|
2002-08-02 19:25:14 +00:00
|
|
|
|
# We need to check that the char after the token is space, but I think
|
|
|
|
|
# we can ignore this
|
|
|
|
|
def find_token(lines, token, start, end = 0):
|
|
|
|
|
if end == 0:
|
2006-07-01 19:16:09 +00:00
|
|
|
|
end = len(lines)
|
2002-08-01 15:26:32 +00:00
|
|
|
|
m = len(token)
|
2002-08-02 19:25:14 +00:00
|
|
|
|
for i in xrange(start, end):
|
2006-07-01 19:16:09 +00:00
|
|
|
|
if lines[i][:m] == token:
|
|
|
|
|
return i
|
2002-08-01 15:26:32 +00:00
|
|
|
|
return -1
|
|
|
|
|
|
2004-05-11 16:13:33 +00:00
|
|
|
|
|
2006-03-17 09:52:13 +00:00
|
|
|
|
def find_token_exact(lines, token, start, end = 0):
|
2002-08-24 12:13:44 +00:00
|
|
|
|
if end == 0:
|
2006-07-01 19:16:09 +00:00
|
|
|
|
end = len(lines)
|
2002-08-24 12:13:44 +00:00
|
|
|
|
for i in xrange(start, end):
|
2006-03-17 09:52:13 +00:00
|
|
|
|
x = string.split(lines[i])
|
|
|
|
|
y = string.split(token)
|
|
|
|
|
if len(x) < len(y):
|
|
|
|
|
continue
|
|
|
|
|
if x[:len(y)] == y:
|
|
|
|
|
return i
|
2002-08-24 12:13:44 +00:00
|
|
|
|
return -1
|
|
|
|
|
|
2004-05-11 16:13:33 +00:00
|
|
|
|
|
2002-08-02 19:25:14 +00:00
|
|
|
|
def find_tokens(lines, tokens, start, end = 0):
|
|
|
|
|
if end == 0:
|
2006-07-01 19:16:09 +00:00
|
|
|
|
end = len(lines)
|
2006-04-10 15:50:31 +00:00
|
|
|
|
for i in xrange(start, end):
|
2006-07-01 19:16:09 +00:00
|
|
|
|
for token in tokens:
|
|
|
|
|
if lines[i][:len(token)] == token:
|
|
|
|
|
return i
|
2002-08-02 19:25:14 +00:00
|
|
|
|
return -1
|
|
|
|
|
|
2004-05-11 16:13:33 +00:00
|
|
|
|
|
2006-03-17 09:52:13 +00:00
|
|
|
|
def find_tokens_exact(lines, tokens, start, end = 0):
|
|
|
|
|
if end == 0:
|
2006-07-01 19:16:09 +00:00
|
|
|
|
end = len(lines)
|
2006-04-10 15:50:31 +00:00
|
|
|
|
for i in xrange(start, end):
|
2006-03-17 09:52:13 +00:00
|
|
|
|
for token in tokens:
|
|
|
|
|
x = string.split(lines[i])
|
|
|
|
|
y = string.split(token)
|
|
|
|
|
if len(x) < len(y):
|
|
|
|
|
continue
|
|
|
|
|
if x[:len(y)] == y:
|
|
|
|
|
return i
|
|
|
|
|
return -1
|
|
|
|
|
|
|
|
|
|
|
2002-08-02 19:25:14 +00:00
|
|
|
|
def find_re(lines, rexp, start, end = 0):
|
|
|
|
|
if end == 0:
|
2006-07-01 19:16:09 +00:00
|
|
|
|
end = len(lines)
|
2002-08-02 19:25:14 +00:00
|
|
|
|
for i in xrange(start, end):
|
2006-07-01 19:16:09 +00:00
|
|
|
|
if rexp.match(lines[i]):
|
|
|
|
|
return i
|
2002-08-01 15:26:32 +00:00
|
|
|
|
return -1
|
|
|
|
|
|
2004-05-11 16:13:33 +00:00
|
|
|
|
|
2002-08-01 15:26:32 +00:00
|
|
|
|
def find_token_backwards(lines, token, start):
|
|
|
|
|
m = len(token)
|
2002-08-02 19:25:14 +00:00
|
|
|
|
for i in xrange(start, -1, -1):
|
2006-07-01 19:16:09 +00:00
|
|
|
|
line = lines[i]
|
|
|
|
|
if line[:m] == token:
|
|
|
|
|
return i
|
2002-08-01 15:26:32 +00:00
|
|
|
|
return -1
|
|
|
|
|
|
2004-05-11 16:13:33 +00:00
|
|
|
|
|
2002-08-03 14:29:12 +00:00
|
|
|
|
def find_tokens_backwards(lines, tokens, start):
|
|
|
|
|
for i in xrange(start, -1, -1):
|
2006-07-01 19:16:09 +00:00
|
|
|
|
line = lines[i]
|
|
|
|
|
for token in tokens:
|
|
|
|
|
if line[:len(token)] == token:
|
|
|
|
|
return i
|
2002-08-03 14:29:12 +00:00
|
|
|
|
return -1
|
|
|
|
|
|
2004-05-11 16:13:33 +00:00
|
|
|
|
|
2002-08-02 19:25:14 +00:00
|
|
|
|
def get_value(lines, token, start, end = 0):
|
2006-03-17 09:52:13 +00:00
|
|
|
|
i = find_token_exact(lines, token, start, end)
|
2002-08-02 19:25:14 +00:00
|
|
|
|
if i == -1:
|
2006-07-01 19:16:09 +00:00
|
|
|
|
return ""
|
2003-01-08 15:47:15 +00:00
|
|
|
|
if len(string.split(lines[i])) > 1:
|
|
|
|
|
return string.split(lines[i])[1]
|
|
|
|
|
else:
|
|
|
|
|
return ""
|
2002-08-02 20:34:20 +00:00
|
|
|
|
|
2004-05-11 16:13:33 +00:00
|
|
|
|
|
2006-07-27 11:37:26 +00:00
|
|
|
|
def del_token(lines, token, start, end):
|
|
|
|
|
k = find_token_exact(lines, token, start, end)
|
2002-08-24 12:13:44 +00:00
|
|
|
|
if k == -1:
|
2006-07-27 11:37:26 +00:00
|
|
|
|
return end
|
2002-08-24 12:13:44 +00:00
|
|
|
|
else:
|
2006-07-01 19:16:09 +00:00
|
|
|
|
del lines[k]
|
2006-07-27 11:37:26 +00:00
|
|
|
|
return end - 1
|
2002-08-24 12:13:44 +00:00
|
|
|
|
|
2004-05-11 16:13:33 +00:00
|
|
|
|
|
2002-08-31 11:27:01 +00:00
|
|
|
|
def find_end_of(lines, i, start_token, end_token):
|
2002-08-06 12:10:09 +00:00
|
|
|
|
count = 1
|
2002-08-31 11:27:01 +00:00
|
|
|
|
n = len(lines)
|
|
|
|
|
while i < n:
|
2006-07-01 19:16:09 +00:00
|
|
|
|
i = find_tokens(lines, [end_token, start_token], i+1)
|
|
|
|
|
if check_token(lines[i], start_token):
|
|
|
|
|
count = count+1
|
|
|
|
|
else:
|
|
|
|
|
count = count-1
|
|
|
|
|
if count == 0:
|
|
|
|
|
return i
|
2002-08-31 11:27:01 +00:00
|
|
|
|
return -1
|
2002-08-19 19:51:01 +00:00
|
|
|
|
|
2004-05-11 16:13:33 +00:00
|
|
|
|
|
2002-08-19 19:51:01 +00:00
|
|
|
|
# Finds the matching \end_inset
|
2002-08-31 11:27:01 +00:00
|
|
|
|
def find_beginning_of(lines, i, start_token, end_token):
|
2002-08-19 19:51:01 +00:00
|
|
|
|
count = 1
|
2002-10-28 21:23:31 +00:00
|
|
|
|
while i > 0:
|
2006-07-01 19:16:09 +00:00
|
|
|
|
i = find_tokens_backwards(lines, [start_token, end_token], i-1)
|
|
|
|
|
if check_token(lines[i], end_token):
|
|
|
|
|
count = count+1
|
|
|
|
|
else:
|
|
|
|
|
count = count-1
|
|
|
|
|
if count == 0:
|
|
|
|
|
return i
|
2002-08-31 11:27:01 +00:00
|
|
|
|
return -1
|
|
|
|
|
|
2004-05-11 16:13:33 +00:00
|
|
|
|
|
2002-08-02 20:34:20 +00:00
|
|
|
|
def is_nonempty_line(line):
|
|
|
|
|
return line != " "*len(line)
|
|
|
|
|
|
2004-05-11 16:13:33 +00:00
|
|
|
|
|
2002-08-02 20:34:20 +00:00
|
|
|
|
def find_nonempty_line(lines, start, end = 0):
|
|
|
|
|
if end == 0:
|
2006-07-01 19:16:09 +00:00
|
|
|
|
end = len(lines)
|
2002-08-02 20:34:20 +00:00
|
|
|
|
for i in xrange(start, end):
|
2006-07-01 19:16:09 +00:00
|
|
|
|
if is_nonempty_line(lines[i]):
|
|
|
|
|
return i
|
2002-08-02 20:34:20 +00:00
|
|
|
|
return -1
|