net.gkovalechyn.minereset.Util.java Source code

Introduction

Here is the source code for net.gkovalechyn.minereset.Util.java

Source

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
package net.gkovalechyn.minereset;

import java.util.regex.Matcher;
import java.util.regex.Pattern;
import org.apache.commons.lang.Validate;

/**
 *
 * @author gkovalechyn
 */
public class Util {

    private static final StringBuilder stringBuilder = new StringBuilder(64);
    private static final Pattern timePattern = Pattern.compile("\\d{1,}[mhdwMys]");

    public static String joinString(String[] array) {
        Util.stringBuilder.setLength(0);

        for (int i = 0; i < array.length; i++) {
            Util.stringBuilder.append(array[i]);
            if (i < (array.length - 1)) {
                Util.stringBuilder.append(' ');
            }
        }

        return Util.stringBuilder.toString();
    }

    public static String escapeString(String orig) {
        return orig.replaceAll("\n", "\\n").replaceAll("\t", "\\t");
    }

    public static String unescapeString(String orig) {
        return orig.replaceAll("\\n", "\n").replaceAll("\\t", "\t");
    }

    public static int LevenshteinDistance(CharSequence lhs, CharSequence rhs) {
        int len0 = lhs.length() + 1;
        int len1 = rhs.length() + 1;

        // the array of distances                                                       
        int[] cost = new int[len0];
        int[] newcost = new int[len0];

        // initial cost of skipping prefix in String s0                                 
        for (int i = 0; i < len0; i++) {
            cost[i] = i;
        }

        // dynamically computing the array of distances                                  
        // transformation cost for each letter in s1                                    
        for (int j = 1; j < len1; j++) {
            // initial cost of skipping prefix in String s1                             
            newcost[0] = j;

            // transformation cost for each letter in s0                                
            for (int i = 1; i < len0; i++) {
                // matching current letters in both strings                             
                int match = (lhs.charAt(i - 1) == rhs.charAt(j - 1)) ? 0 : 1;

                // computing cost for each transformation                               
                int cost_replace = cost[i - 1] + match;
                int cost_insert = cost[i] + 1;
                int cost_delete = newcost[i - 1] + 1;

                // keep minimum cost                                                    
                newcost[i] = Math.min(Math.min(cost_insert, cost_delete), cost_replace);
            }

            // swap cost/newcost arrays                                                 
            int[] swap = cost;
            cost = newcost;
            newcost = swap;
        }

        // the distance is the cost for transforming all letters in both strings        
        return cost[len0 - 1];
    }

    public static long timeStringToLong(String string) {
        Validate.notNull(string);
        long res = 0l;
        Matcher mat = Util.timePattern.matcher(string);

        while (mat.find()) {
            String a = mat.group();
            long l = Long.parseLong(a.substring(0, a.length() - 1));

            switch (a.charAt(a.length() - 1)) {
            case 's':
                l *= 1000L;
                break;
            case 'm': //minutes
                l *= 60000l;
                break;
            case 'h': //hours
                l *= 3600000l;
                break;
            case 'd': //days
                l *= 86400000l;
                break;
            case 'w': //weeks
                l *= 604800000l;
                break;
            case 'M': //months
                l *= 2419200000l;
                break;
            case 'y': //years
                l *= 29030400000l;
                break;
            }
            res += l;
        }
        return res;
    }
}