All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.tencent.angel.sona.tree.stats.hash.HashFactory Maven / Gradle / Ivy

/*
 * Tencent is pleased to support the open source community by making Angel available.
 *
 * Copyright (C) 2017-2018 THL A29 Limited, a Tencent company. All rights reserved.
 *
 * Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in
 * compliance with the License. You may obtain a copy of the License at
 *
 * https://opensource.org/licenses/Apache-2.0
 *
 * Unless required by applicable law or agreed to in writing, software distributed under the License
 * is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express
 * or implied. See the License for the specific language governing permissions and limitations under
 * the License.
 *
 */
package com.tencent.angel.sona.tree.stats.hash;

import com.tencent.angel.sona.tree.util.MathUtil;

import java.io.IOException;
import java.io.ObjectInputStream;
import java.io.ObjectOutputStream;
import java.util.*;

public class HashFactory {
    private static final Int2IntHash[] int2intHashes =
            new Int2IntHash[]{new BJHash(0), new Mix64Hash(0),
            new TWHash(0), new BKDRHash(0, 31), new BKDRHash(0, 131),
            new BKDRHash(0, 267), new BKDRHash(0, 1313), new BKDRHash(0, 13131)};
    private static final Random random = new Random();

    public static void precompute(int maxKey) {
        for (Int2IntHash hash: int2intHashes)
            hash.precompute(maxKey);
    }

    public static Int2IntHash getRandomInt2IntHash(int size) {
        int idx = random.nextInt(int2intHashes.length);
        Int2IntHash res = int2intHashes[idx].clone();
        res.setSize(size);
        return res;
    }

    public static Int2IntHash[] getRandomInt2IntHashes(int hashNum, int size) {
        if (hashNum > int2intHashes.length) {
            throw new RuntimeException(String.format("Currently only %d " +
                    "hash functions are available", int2intHashes.length));
        } else {
            Int2IntHash[] res = new Int2IntHash[hashNum];
            int[] indexes = new int[int2intHashes.length];
            Arrays.setAll(indexes, i -> i);
            MathUtil.shuffle(indexes);
            for (int i = 0; i < hashNum; i++) {
                res[i] = int2intHashes[indexes[i]].clone();
                res[i].setSize(size);
            }
            return res;
        }
    }

    public static void serialize(ObjectOutputStream oos, Int2IntHash hash)
            throws IOException {
        oos.writeObject(hash);
    }

    public static Int2IntHash deserialize(ObjectInputStream ois)
            throws ClassNotFoundException, IOException {
        Int2IntHash res = (Int2IntHash) ois.readObject();
        for (Int2IntHash hash: int2intHashes) {
            if (res.equalsIgnoreSize(hash))
                res.setPrecomputeBuffer(hash.getPrecomputeBuffer());
        }
        return res;
    }
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy