KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > org > netbeans > modules > javacore > parser > OrderedArrayMeasure


1 /*
2  * The contents of this file are subject to the terms of the Common Development
3  * and Distribution License (the License). You may not use this file except in
4  * compliance with the License.
5  *
6  * You can obtain a copy of the License at http://www.netbeans.org/cddl.html
7  * or http://www.netbeans.org/cddl.txt.
8  *
9  * When distributing Covered Code, include this CDDL Header Notice in each file
10  * and include the License file at http://www.netbeans.org/cddl.txt.
11  * If applicable, add the following below the CDDL Header, with the fields
12  * enclosed by brackets [] replaced by your own identifying information:
13  * "Portions Copyrighted [year] [name of copyright owner]"
14  *
15  * The Original Software is NetBeans. The Initial Developer of the Original
16  * Software is Sun Microsystems, Inc. Portions Copyright 1997-2006 Sun
17  * Microsystems, Inc. All Rights Reserved.
18  */
19 package org.netbeans.modules.javacore.parser;
20
21 /**
22  *
23  * @author Martin Matula
24  */
25 class OrderedArrayMeasure implements Measure {
26     private final Measure measure;
27
28     OrderedArrayMeasure(Measure elementsMeasure) {
29         measure = elementsMeasure;
30     }
31
32     public int getDistance(Object JavaDoc first, Object JavaDoc second) {
33         Object JavaDoc[] array1 = (Object JavaDoc[]) first;
34         Object JavaDoc[] array2 = (Object JavaDoc[]) second;
35         int minSize = Math.min(array1.length, array2.length);
36         int difference = Math.abs(array1.length-array2.length);
37         int result = 0;
38         
39         if (minSize==0) {
40             if (difference!=0)
41                 result=INFINITE_DISTANCE;
42             return result;
43         }
44         for (int i = 0; i < minSize; i++) {
45             result += measure.getDistance(array1[i], array2[i]);
46         }
47         result += difference * INFINITE_DISTANCE;
48         result /= (minSize+difference);
49         return result > INFINITE_DISTANCE ? INFINITE_DISTANCE : result;
50     }
51 }
52
Popular Tags