Clover coverage report - DrJava Test Coverage (drjava-20120304-r5456)
Coverage timestamp: Sun Mar 4 2012 03:13:23 CST
file stats: LOC: 107   Methods: 2
NCLOC: 47   Classes: 1
 
 Source file Conditionals Statements Methods TOTAL
ReducedModelState.java 100% 100% 100% 100%
coverage
 1    /*BEGIN_COPYRIGHT_BLOCK
 2    *
 3    * Copyright (c) 2001-2010, JavaPLT group at Rice University (drjava@rice.edu)
 4    * All rights reserved.
 5    *
 6    * Redistribution and use in source and binary forms, with or without
 7    * modification, are permitted provided that the following conditions are met:
 8    * * Redistributions of source code must retain the above copyright
 9    * notice, this list of conditions and the following disclaimer.
 10    * * Redistributions in binary form must reproduce the above copyright
 11    * notice, this list of conditions and the following disclaimer in the
 12    * documentation and/or other materials provided with the distribution.
 13    * * Neither the names of DrJava, the JavaPLT group, Rice University, nor the
 14    * names of its contributors may be used to endorse or promote products
 15    * derived from this software without specific prior written permission.
 16    *
 17    * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 18    * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 19    * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 20    * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
 21    * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 22    * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 23    * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
 24    * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
 25    * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
 26    * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 27    * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 28    *
 29    * This software is Open Source Initiative approved Open Source Software.
 30    * Open Source Initative Approved is a trademark of the Open Source Initiative.
 31    *
 32    * This file is part of DrJava. Download the current version of this project
 33    * from http://www.drjava.org/ or http://sourceforge.net/projects/drjava/
 34    *
 35    * END_COPYRIGHT_BLOCK*/
 36   
 37    package edu.rice.cs.drjava.model.definitions.reducedmodel;
 38   
 39    import static edu.rice.cs.drjava.model.definitions.reducedmodel.ReducedModelStates.*;
 40   
 41    /** Represents the bstract notion of a shadowing state. The shadowing state of text is simply its interpretation during
 42    * compilation. Commented text is ignored; quoted text is accumulated into string constants. This classification
 43    * supports accurate highlighting, indenting, and other analyses of program text.
 44    * @version $Id: ReducedModelState.java 5175 2010-01-20 08:46:32Z mgricken $
 45    */
 46    public abstract class ReducedModelState {
 47   
 48    abstract ReducedModelState update(TokenList.Iterator copyCursor);
 49   
 50    /** Combines the current and next braces if they match the given types. If we have braces of first and second in
 51    * immediate succession, and if second's gap is 0, combine them into first+second. The cursor remains on the same
 52    * block after this method is called.
 53    * @param first the first half of a multiple char brace
 54    * @param second the second half of a multiple char brace
 55    * @return true if we combined two braces or false if not
 56    */
 57  63586 boolean _combineCurrentAndNextIfFind(String first, String second, TokenList.Iterator copyCursor) {
 58  63586 if (copyCursor.atStart() || copyCursor.atEnd() || copyCursor.atLastItem() ||
 59    !copyCursor.current().getType().equals(first))
 60  61859 return false;
 61   
 62  1727 copyCursor.next(); // move to second one to check if we can combine
 63   
 64    // The second one is eligible to combine if it exists (atLast is false),
 65    // if it has the right brace type, and if it has no gap.
 66  1727 if (copyCursor.current().getType().equals(second)) {
 67  51 if (copyCursor.current().getType().equals("") && copyCursor.prevItem().getType().equals("")) {
 68    // delete first Gap and augment the second
 69  1 copyCursor.prev();
 70  1 int growth = copyCursor.current().getSize();
 71  1 copyCursor.remove();
 72  1 copyCursor.current().grow(growth);
 73    }
 74  50 else if (copyCursor.current().getType().length() == 2) {
 75  3 String tail = copyCursor.current().getType().substring(1,2);
 76  3 String head = copyCursor.prevItem().getType() +
 77    copyCursor.current().getType().substring(0,1);
 78  3 copyCursor.current().setType(tail);
 79  3 copyCursor.prev();
 80  3 copyCursor.current().setType(head);
 81  3 copyCursor.current().setState(FREE);
 82    }
 83    else {
 84    // delete the first Brace and augment the second
 85  47 copyCursor.prev();
 86  47 copyCursor.remove();
 87  47 copyCursor.current().setType(first + second);
 88    }
 89  51 return true;
 90    }
 91    else {
 92    // we couldn't combine, so move back and return
 93  1676 copyCursor.prev();
 94  1676 return false;
 95    }
 96    }
 97   
 98  6158 boolean _combineCurrentAndNextIfEscape(TokenList.Iterator copyCursor) {
 99  6158 boolean combined = _combineCurrentAndNextIfFind("\\","\\",copyCursor); // \-\
 100  6158 combined = combined || _combineCurrentAndNextIfFind("\\","\'",copyCursor); // \-'
 101  6158 combined = combined || _combineCurrentAndNextIfFind("\\","\\'",copyCursor);// \-\'
 102  6158 combined = combined || _combineCurrentAndNextIfFind("\\","\"",copyCursor); // \-"
 103  6158 combined = combined || _combineCurrentAndNextIfFind("\\","\\\"",copyCursor);// \-\"
 104  6158 combined = combined || _combineCurrentAndNextIfFind("\\","\\\\",copyCursor);// \-\\
 105  6158 return combined;
 106    }
 107    }