io.zulia.util.ZuliaUtil Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of zulia-common Show documentation
zulia-common
There is a newer version: 1.6.4
package io.zulia.util;

import org.bson.BsonBinaryReader;
import org.bson.BsonBinaryWriter;
import org.bson.Document;
import org.bson.codecs.DecoderContext;
import org.bson.codecs.DocumentCodec;
import org.bson.codecs.EncoderContext;
import org.bson.io.BasicOutputBuffer;

import java.nio.ByteBuffer;
import java.util.Collection;
import java.util.Objects;
import java.util.function.Consumer;

public class ZuliaUtil {

	private static final DocumentCodec documentCodec = new DocumentCodec();

	public static void handleLists(Object o, Consumer action) {
		if (o instanceof Collection) {
			Collection c = (Collection) o;
			c.stream().filter(Objects::nonNull).forEach(obj -> {
				if (obj instanceof Collection) {
					handleLists(obj, action);
				}
				else {
					action.accept(obj);
				}
			});
		}
		else if (o instanceof Object[]) {
			Object[] arr = (Object[]) o;
			for (Object obj : arr) {
				if (obj != null) {
					action.accept(action);
				}
			}
		}
		else {
			if (o != null) {
				action.accept(o);
			}
		}
	}

	public static byte[] mongoDocumentToByteArray(Document mongoDocument) {
		BasicOutputBuffer outputBuffer = new BasicOutputBuffer();
		BsonBinaryWriter writer = new BsonBinaryWriter(outputBuffer);
		new DocumentCodec().encode(writer, mongoDocument, EncoderContext.builder().isEncodingCollectibleDocument(true).build());
		return outputBuffer.toByteArray();
	}

	public static Document byteArrayToMongoDocument(byte[] byteArray) {
		BsonBinaryReader bsonReader = new BsonBinaryReader(ByteBuffer.wrap(byteArray));

		return documentCodec.decode(bsonReader, DecoderContext.builder().build());
	}

	public static int computeLevenshteinDistance(String string1, String string2) {

		char str1[] = string1.toCharArray();
		char str2[] = string2.toCharArray();

		int insert = 40;
		int delete = 40;
		int substitute = 40;
		int substituteCase = 1;

		if (string1.length() < string2.length()) {
			insert = 2;
		}
		int distance[][] = new int[str1.length + 1][str2.length + 1];

		for (int i = 0; i <= str1.length; i++) {
			distance[i][0] = i * delete;
		}
		for (int j = 0; j <= str2.length; j++) {
			distance[0][j] = j * insert;
		}

		for (int i = 1; i <= str1.length; i++) {
			for (int j = 1; j <= str2.length; j++) {
				boolean same = (str1[i - 1] == str2[j - 1]);

				int subPen = 0;

				if (!same) {
					if (Character.toLowerCase(str1[i - 1]) == Character.toLowerCase(str2[j - 1])) {
						subPen = substituteCase;
					}
					else {
						subPen = substitute;
					}
				}

				distance[i][j] = minimum(distance[i - 1][j] + delete, distance[i][j - 1] + insert, distance[i - 1][j - 1] + subPen);
			}
		}
		return distance[str1.length][str2.length];
	}

	private static int minimum(int a, int b, int c) {
		if (a <= b && a <= c)
			return a;
		if (b <= a && b <= c)
			return b;
		return c;
	}
}