xwords/xwords4/android/scripts/fix_loc_xmls.py

63 lines
2.1 KiB
Python
Raw Normal View History

#!/usr/bin/python
import mk_xml, os, sys, codecs
from lxml import etree
def longestCommon( name, pairs ):
match = None
for ii in range(1, len(name)):
str = name[:ii]
for key in pairs.keys():
if str == key[:ii]:
print str, "matches", key, "so far"
2014-04-12 07:54:13 +02:00
match = key
break
2014-04-12 07:54:13 +02:00
return match
def checkAgainst( path, pairs ):
print "looking at", path
doc = etree.parse( path )
root = doc.getroot();
2014-04-12 07:54:13 +02:00
for child in root.iter():
if child.tag == "string":
name = child.get("name")
if not name in pairs:
candidate = longestCommon( name, pairs )
print name, "not found in the English strings"
print "closest I can find is", candidate
print "here are the two strings, English then the other"
print pairs[candidate]
print child.text
2014-04-12 08:12:16 +02:00
response = raw_input( "replace %s with %s? (y, n, s or q)" % (name, candidate) )
2014-04-12 07:54:13 +02:00
if response == 'y':
child.set('name', candidate)
2014-04-12 08:12:16 +02:00
elif response == 's':
2014-04-12 07:54:13 +02:00
break
2014-04-12 08:12:16 +02:00
elif response == 'q':
sys.exit(0)
# try = tryNames( name, pairs )
# response = raw_input( "unknown name: %s; respond:" % (name) )
# print "you wrote:", response
# Now walk the doc, comparing names with the set in pairs and
# enforcing rules about names, offering to change whereever
# possible
out = open( path, "w" )
out.write( etree.tostring( doc, pretty_print=True, encoding="utf-8", xml_declaration=True ) )
def main():
pairs = mk_xml.getStrings()
for subdir, dirs, files in os.walk('res_src'):
for file in [file for file in files if file == "strings.xml"]:
path = "%s/%s" % (subdir, file)
checkAgainst( path, pairs )
2014-04-12 08:12:16 +02:00
sys.exit(0)
##############################################################################
if __name__ == '__main__':
main()