Ignore:
Timestamp:
May 17, 2015, 1:19:35 PM (9 years ago)
Author:
Peter A. Buhr <pabuhr@…>
Branches:
ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, ctor, deferred_resn, demangler, enum, forall-pointer-decay, gc_noraii, jacob/cs343-translation, jenkins-sandbox, master, memory, new-ast, new-ast-unique-expr, new-env, no_list, persistent-indexer, pthread-emulation, qualifiedEnum, resolv-new, string, with_gc
Children:
0dd3a2f
Parents:
b87a5ed
Message:

licencing: second groups of files

File:
1 edited

Legend:

Unmodified
Added
Removed
  • translator/Tuples/TupleAssignment.h

    rb87a5ed ra32b204  
    102102    // select the alternatives that have the minimum parameter cost
    103103    Cost minCost = Cost::infinity;
    104     for( AltList::iterator i = begin; i != end; ++i ) {
    105       if( i->cost < minCost ) {
     104    for ( AltList::iterator i = begin; i != end; ++i ) {
     105      if ( i->cost < minCost ) {
    106106        minCost = i->cost;
    107107        i->cost = i->cvtCost;
    108108        alternatives.clear();
    109109        alternatives.push_back( *i );
    110       } else if( i->cost == minCost ) {
     110      } else if ( i->cost == minCost ) {
    111111        i->cost = i->cvtCost;
    112112        alternatives.push_back( *i );
Note: See TracChangeset for help on using the changeset viewer.