org.ligboy.translate.TokenGenerator Maven / Gradle / Ivy

Go to download
package org.ligboy.translate;

import org.jetbrains.annotations.NonNls;
import org.jetbrains.annotations.NotNull;

import java.util.ArrayList;
import java.util.List;

/**
 * Google translate token generator
 * @author ligboy
 */
@SuppressWarnings("WeakerAccess")
public class TokenGenerator {

    private String mTokenKey = "406249.3075489964";
    private static final String SB = "+-a^+6";
    private static final String ZB = "+-3^+b+-f";

    /**
     * @param tokenKey The key of token.
     */
    public TokenGenerator(@NonNls String tokenKey) {
        mTokenKey = tokenKey;
    }

    private long qM(long a, String b) {
        int limit = (b != null ? b.length() : 0) - 2;
        long aa = a;
        long d;
        for (int i = 0; i < limit; i += 3) {
            //noinspection ConstantConditions
            d = b.charAt(i + 2);
            d = d >= 'a' ? d - 87 : d - 48;
            d = b.charAt(i + 1) == '+' ? ((int) aa) >>> d : ((int) aa) << d;
            //noinspection PointlessBitwiseExpression
            aa = b.charAt(i) == '+' ? ((int) (aa +  d)) & ((int) 4294967295L) : ((int) aa) ^ ((int) d);
        }
        return aa;
    }

    /**
     * Calculate the token of source.
     * @param text The source to be target.
     * @return The token
     */
    public String token(@NonNls String text) {
        String[] d = mTokenKey.split("\\.");
        long b = Integer.valueOf(d[0]);
        List e = new ArrayList();
        for (int i = 0, g = 0; g < text.length(); g++) {
            char m = text.charAt(g);
            if (128 > m) {
                e.add((int) m);
            } else {
                if (2048 > m) {
                    e.add(m >> 6 | 192);
                } else {
                    if (55296 == (m & 64512) && g + 1 < text.length() && 56320 == (text.charAt(g + 1) & 64512)) {
                        m = (char) (65536 + ((m & 1023) << 10) + (text.charAt(++g) & 1023));
                        e.add(m >> 18 | 240);
                        e.add(m >> 12 & 63 | 128);
                    } else {
                        e.add(m >> 12 | 224);
                    }
                    e.add(m >> 6 & 63 | 128);
                }
                e.add(m & 63 | 128);
            }
        }
        long ab = b;
        for (Integer anE : e) {
            ab += anE;
            ab = qM(ab, SB);
        }
        ab = qM(ab, ZB);
        ab = ((int) ab) ^ (int) Long.valueOf(d[1]).longValue();
        if (0 > ab) {
            ab = ((int) ab & (int) 2147483647L) + 2147483648L;
        }
        ab %= 1E6;
        return (ab + "." + ((int) ab ^ (int) b));
    }

    /**
     * Get Token Key
     * @return The Token Key.
     */
    public String getTokenKey() {
        return mTokenKey;
    }

    /**
     * Set Token Key
     * @param tokenKey The Token Key.
     * @return This {@link TokenGenerator} instance.
     */
    public TokenGenerator setTokenKey(@NotNull String tokenKey) {
        mTokenKey = tokenKey;
        return this;
    }
}