- Timestamp:
- 11/19/13 10:07:16 (11 years ago)
- Branches:
- master
- Children:
- b30c30d
- Parents:
- e0cd003
- git-author:
- Tomasz Obrebski <to@…> (11/19/13 09:55:00)
- git-committer:
- Tomasz Obrebski <obrebski@…> (11/19/13 10:07:16)
- Location:
- src
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
src/dgp/dgp1.cc
r3b02b04 rb97a556 173 173 174 174 if(debug) sgraph.print_node_debug(stderr,"C ",newheadind,h); 175 if(debug) print_sets(newheadind);175 // if(debug) print_sets(newheadind); 176 176 return newheadind; 177 177 } … … 192 192 193 193 if(debug) sgraph.print_node_debug(stderr,"C ",newind,d); 194 if(debug) print_sets(newind);194 // if(debug) print_sets(newind); 195 195 196 196 return newind; … … 212 212 213 213 if(debug) sgraph.print_node_debug(stderr,"C ",newheadind,h); 214 if(debug) print_sets(newheadind);214 // if(debug) print_sets(newheadind); 215 215 216 216 return newheadind; … … 230 230 231 231 if(debug) sgraph.print_node_debug(stderr,"C ",newind,d); 232 if(debug) print_sets(newind);232 // if(debug) print_sets(newind); 233 233 234 234 return newind; … … 304 304 if(debug) sgraph.print_arc(stderr,newheadind,d,l.role,0); 305 305 if(debug) sgraph.print_node_debug(stderr,"U ",newheadind,h); 306 if(debug) print_sets(newheadind);306 // if(debug) print_sets(newheadind); 307 307 if(debug) sgraph.print_node_debug(stderr,"U ",newdepind,d); 308 if(debug) print_sets(newdepind);308 // if(debug) print_sets(newdepind); 309 309 } 310 310 -
src/dgp/sgraph.cc
r3b02b04 rb97a556 113 113 for(vector<Arc>::iterator h=node.heads.begin(); h!=node.heads.end(); ++h) 114 114 { 115 if(cont) buf+=sprintf(buf,","); else cont=true; 116 buf+=sprintf(buf,"++%s-%d(%d~%d)",h->role.str(),h->dst,h->headanc,h->depanc); 115 // if(cont) buf+=sprintf(buf,","); else cont=true; 116 buf+=sprintf(buf,"(++%s:%d)",h->role.str(),h->dst); 117 // buf+=sprintf(buf,"++%s-%d(%d~%d)",h->role.str(),h->dst,h->headanc,h->depanc); 118 // buf+=sprintf(buf,"(<-%s-%d)",h->role.str(),h->dst); 117 119 } 118 120 … … 121 123 { 122 124 // if(! nodes[d->dst].saturated()) continue; // NIE DRUKUJ NIENASYCONYCH PODRZEDNIKOW 123 if(cont) buf+=sprintf(buf,","); else cont=true; 124 buf+=sprintf(buf,"--%s-%d(%d~%d)",d->role.str(),d->dst,d->headanc,d->depanc); 125 // if(cont) buf+=sprintf(buf,","); else cont=true; 126 buf+=sprintf(buf,"(--%s:%d)",d->role.str(),d->dst); 127 // buf+=sprintf(buf,"--%s-%d(%d~%d)",d->role.str(),d->dst,d->headanc,d->depanc); 128 // buf+=sprintf(buf,"(-%s->%d)",d->role.str(),d->dst); 125 129 } 126 130 -
src/tre/tre
r3b02b04 rb97a556 21 21 $helptext= 22 22 "The program generates trees from the graph output by dgp. dgp must\n"+ 23 "must be run with '- ids' option.\n\n"+23 "must be run with '--info=ds' option.\n\n"+ 24 24 "Command: tre [options]\n\n"+ 25 25 "Options:\n"+ … … 269 269 270 270 if parts[3]==nil || parts[4]==nil || parts[5]==nil 271 $stderr.print "ERR: tre requires dgp be called with '--info 271 $stderr.print "ERR: tre requires dgp be called with '--info=ds' option. Aborting.\n" 272 272 exit 273 273 end … … 280 280 $arcs |= parts[2].split(',').map{ |a| case a 281 281 when /\-\-(\w+)-(\d+)\((\d+)~(\d+)\)/ 282 [i, $2.to_i, $1, $3.to_i, $4.to_i] 282 # [i, $2.to_i, $1, $3.to_i, $4.to_i] 283 [i, $2.to_i, $1, 0, 0] 283 284 when /\+\+(\w+)-(\d+)\((\d+)~(\d+)\)/ 284 [$2.to_i, i, $1, $3.to_i, $4.to_i] 285 # [$2.to_i, i, $1, $3.to_i, $4.to_i] 286 [$2.to_i, i, $1, 0, 0] 285 287 end } 286 288 $succ |= parts[3][1..-2].split(',').map{|x| [x.to_i,i]}
Note: See TracChangeset
for help on using the changeset viewer.