@ -13,7 +13,7 @@ from unidecode import unidecode
import locale
import re
import sys
import warnings
#import warnings
from songbook . authors import processauthors
from songbook . plastex import simpleparse
@ -22,6 +22,7 @@ from songbook.plastex import simpleparse
keywordPattern = re . compile ( r " ^ % ( \ w+) \ s?(.*)$ " )
firstLetterPattern = re . compile ( r " ^(?: \ { ? \\ \ w+ \ }?)*[^ \ w]*( \ w) " )
def sortkey ( value ) :
'''
From a title , return something usable for sorting . It handles locale ( but
@ -30,35 +31,40 @@ def sortkey(value):
'''
return locale . strxfrm ( unidecode ( simpleparse ( value ) . replace ( ' ' , ' A ' ) ) )
def processSXDEntry ( tab ) :
return ( tab [ 0 ] , tab [ 1 ] , tab [ 2 ] )
def processSXD ( filename ) :
file = open ( filename )
index_ file= open ( filename )
data = [ ]
for line in file :
for line in index_ file:
data . append ( line . strip ( ) )
file . close ( )
index_ file. close ( )
i = 1
idx = index ( data [ 0 ] )
while len ( data ) > i and data [ i ] . startswith ( ' % ' ) :
keywords = keywordPattern . match ( data [ i ] ) . groups ( )
idx . keyword ( keywords [ 0 ] , keywords [ 1 ] )
idx . keyword ( keywords [ 0 ] , keywords [ 1 ] )
i + = 1
idx . compileKeywords ( )
for i in range ( i , len ( data ) , 3 ) :
entry = processSXDEntry ( data [ i : i + 3 ] )
idx . add ( entry [ 0 ] , entry [ 1 ] , entry [ 2 ] )
for i in range ( i , len ( data ) , 3 ) :
entry = processSXDEntry ( data [ i : i + 3 ] )
idx . add ( entry [ 0 ] , entry [ 1 ] , entry [ 2 ] )
return idx
class index :
def __init__ ( self , indextype ) :
self . data = dict ( )
self . keywords = dict ( )
self . prefix_patterns = [ ]
self . authwords = { " after " : [ ] , " ignore " : [ ] , " sep " : [ ] }
if indextype == " TITLE INDEX DATA FILE " :
self . indextype = " TITLE "
elif indextype == " SCRIPTURE INDEX DATA FILE " :
@ -70,23 +76,21 @@ class index:
def filter ( self , key ) :
letter = firstLetterPattern . match ( key ) . group ( 1 )
if re . match ( ' \ d ' , letter ) :
if re . match ( ' \ d ' , letter ) :
letter = ' 0-9 '
return ( letter . upper ( ) , key )
def keyword ( self , key , word ) :
if not self . keywords . has_ key( key ) :
if not key in self . keywords . keys ( ) :
self . keywords [ key ] = [ ]
self . keywords [ key ] . append ( word )
def compileKeywords ( self ) :
self . prefix_patterns = [ ]
if self . indextype == " TITLE " :
if ' prefix ' in self . keywords :
for prefix in self . keywords [ ' prefix ' ] :
self . prefix_patterns . append ( re . compile ( r " ^( %s )( \ b| \\ )( \ s*.*)$ " % prefix ) )
self . authwords = { " after " : [ ] , " ignore " : [ ] , " sep " : [ ] }
if self . indextype == " AUTHOR " :
for key in self . keywords :
if key in self . authwords :
@ -94,20 +98,22 @@ class index:
for word in self . authwords . keys ( ) :
if word in self . keywords :
if word == " after " :
self . authwords [ word ] = [ re . compile ( r " ^.* %s \ b(.*) " % after ) for after in self . keywords [ word ] ]
self . authwords [ word ] = [ re . compile ( r " ^.* %s \ b(.*) " % after )
for after in self . keywords [ word ] ]
elif word == " sep " :
self . authwords [ word ] = [ " %s " % sep for sep in self . authwords [ word ] ] + [ " , " ]
self . authwords [ word ] = [ re . compile ( r " ^(.*) %s (.*)$ " % sep ) for sep in self . authwords [ word ] ]
self . authwords [ word ] = [ re . compile ( r " ^(.*) %s (.*)$ " % sep )
for sep in self . authwords [ word ] ]
else :
self . authwords [ word ] = self . keywords [ word ]
def _raw_add ( self , key , number , link ) :
( first , key ) = self . filter ( key )
if not self . data . has_ key( first ) :
if not first in self . data . keys ( ) :
self . data [ first ] = dict ( )
if not self . data [ first ] . has_ key( key ) :
if not key in self . data [ first ] . keys ( ) :
self . data [ first ] [ key ] = [ ]
self . data [ first ] [ key ] . append ( { ' num ' : number , ' link ' : link } )
self . data [ first ] [ key ] . append ( { ' num ' : number , ' link ' : link } )
def add ( self , key , number , link ) :
if self . indextype == " TITLE " :
@ -116,8 +122,8 @@ class index:
match = pattern . match ( key )
if match :
self . _raw_add (
" %s ( %s ) " % ( match . group ( 2 ) + match . group ( 3 ) , match . group ( 1 ) ) ,
number , link )
" %s ( %s ) " % ( match . group ( 2 ) + match . group ( 3 ) ,
match . group ( 1 ) ) , number , link )
return
self . _raw_add ( key , number , link )
@ -129,26 +135,26 @@ class index:
self . _raw_add ( author , number , link )
def refToStr ( self , ref ) :
if sys . version_info > = ( 2 , 6 ) :
if sys . version_info > = ( 2 , 6 ) :
return ' \\ hyperlink {{ {0[link]} }} {{ {0[num]} }} ' . format ( ref )
else :
return ' \\ hyperlink { %(link)s } { %(num)s } ' % ref
def entryToStr ( self , key , entry ) :
if sys . version_info > = ( 2 , 6 ) :
if sys . version_info > = ( 2 , 6 ) :
return unicode ( ' \\ idxentry {{ {0} }} {{ {1} }} \n ' ) . format ( key , ' \\ \\ ' . join ( map ( self . refToStr , entry ) ) )
else :
return unicode ( ' \\ idxentry { %s } { %s } \n ' ) % ( key , ' \\ \\ ' . join ( map ( self . refToStr , entry ) ) )
def idxBlockToStr ( self , letter , entries ) :
str = ' \\ begin {idxblock} { ' + letter + ' } ' + ' \n '
string = ' \\ begin {idxblock} { ' + letter + ' } ' + ' \n '
for key in sorted ( entries . keys ( ) , key = sortkey ) :
str + = self . entryToStr ( key , entries [ key ] )
str + = ' \\ end {idxblock} ' + ' \n '
return str
string + = self . entryToStr ( key , entries [ key ] )
string + = ' \\ end {idxblock} ' + ' \n '
return string
def entriesToStr ( self ) :
str = " "
string = " "
for letter in sorted ( self . data . keys ( ) ) :
str + = self . idxBlockToStr ( letter , self . data [ letter ] )
return str
string + = self . idxBlockToStr ( letter , self . data [ letter ] )
return string
Luthaf
11 years ago