alvinalexander.com | career | drupal | java | mac | mysql | perl | scala | uml | unix  

What this is

This file is included in the DevDaily.com "Java Source Code Warehouse" project. The intent of this project is to help you "Learn Java by Example" TM.

Other links

The source code

/*
 *                 Sun Public License Notice
 *
 * The contents of this file are subject to the Sun Public License
 * Version 1.0 (the "License"). You may not use this file except in
 * compliance with the License. A copy of the License is available at
 * http://www.sun.com/
 *
 * The Original Code is NetBeans. The Initial Developer of the Original
 * Code is Ralph Krueger. 
 */

package org.netbeans.modules.changelog;


import java.util.*;

/**
 *
 * @author  Ralph Krueger
 */


public class SummaryProcessor {
    
    /** the max. number of top values.
     */
    private static final int MAX_LENGTH = 10;
    
    /** Holds value of property commitCount. */
    private int commitCount;
    
    /** Holds value of property userList. */
    private HashMap usersList;
    
    private HashMap mostChangedFilesMap;
    private HashMap activeUsersMap;
    
    /** Creates a new instance of SummaryProcessor */
    public SummaryProcessor() {
        usersList = new HashMap();
        commitCount = 0;
        mostChangedFilesMap = new HashMap();
    }

    
    public void processGroup(RevisionsGroup group) {
        String user = group.getUser();
        increaseCountByOne(usersList, user);
        commitCount = commitCount + 1;
        Iterator it = group.getList().iterator();
        while (it.hasNext()) {
            LogInfoRevision rev = (LogInfoRevision)it.next();
            increaseCountByOne(mostChangedFilesMap, 
                         rev.getLogInfoHeader().getRepositoryFilename());
            
        }
    }
    
    private void increaseCountByOne(Map map, Object key) {
        Integer val = (Integer)map.get(key);
        if (val == null) {
            val = new Integer(1);
        } else {
            val = new Integer(val.intValue() + 1);
        }
        map.put(key, val);
    }
    
    private List createSortedList(Map map) {
        Iterator it = map.keySet().iterator();
        LinkedList keyList = new LinkedList();
        LinkedList valList = new LinkedList();
        while (it.hasNext()) {
            Object key = it.next();
            Integer val = (Integer)map.get(key);
            Iterator valIt = valList.iterator();
            boolean wasSet = false;
            int valIndex = -1;
            while (valIt.hasNext()) {
                Integer val2 = (Integer)valIt.next();
                valIndex = valIndex + 1;
                if (val.compareTo(val2) >= 0) {
                    keyList.add(valIndex, key);
                    valList.add(valIndex, val);
                    wasSet = true;
                    break;
                }
            }
            if (!wasSet && keyList.size() < MAX_LENGTH) {
                keyList.add(key);
                valList.add(val);
            }
            if (keyList.size() >= MAX_LENGTH) {
                keyList.removeLast();
                valList.removeLast();
            }
        }
        return keyList;
    }
    
    /** Getter for property mostActiveUsers.
     * @return Value of property mostActiveUsers.
     */
    public String[] getMostActiveUsers() {
        List topList = createSortedList(usersList);
        String[] toReturn = new String[topList.size()];
        Iterator it = topList.iterator();
        int count = 0;
        while (it.hasNext()) {
            String item = (String)it.next();
            Integer num = (Integer)usersList.get(item);
            toReturn[count] = num.toString() + " " + item;
            count = count + 1;
        }
        return toReturn;
    }
    
    /** Getter for property mostChangedFiles.
     * @return Value of property mostChangedFiles.
     */
    public String[] getMostChangedFiles() {
        List topList = createSortedList(mostChangedFilesMap);
        String[] toReturn = new String[topList.size()];
        Iterator it = topList.iterator();
        int count = 0;
        while (it.hasNext()) {
            String item = (String)it.next();
            Integer num = (Integer)mostChangedFilesMap.get(item);
            toReturn[count] = num.toString() + " " + item;
            count = count + 1;
        }
        return toReturn;
    }    

    /** Getter for property commitCount.
     * @return Value of property commitCount.
     */
    public int getCommitCount() {
        return this.commitCount;
    }
    
    /** Getter for property userList.
     * @return Value of property userList.
     */
    public String[] getUserList() {
        String[] toReturn = new String[usersList.size()];
        toReturn = (String[])usersList.keySet().toArray(toReturn);
        return toReturn;
    }
    
}
... this post is sponsored by my books ...

#1 New Release!

FP Best Seller

 

new blog posts

 

Copyright 1998-2021 Alvin Alexander, alvinalexander.com
All Rights Reserved.

A percentage of advertising revenue from
pages under the /java/jwarehouse URI on this website is
paid back to open source projects.