/** * Most of the code in the Qalingo project is copyrighted Hoteia and licensed * under the Apache License Version 2.0 (release version 0.8.0) * http://www.apache.org/licenses/LICENSE-2.0 * * Copyright (c) Hoteia, 2012-2014 * http://www.hoteia.com - http://twitter.com/hoteia - contact@hoteia.com * */ package org.hoteia.qalingo.core.solr.util; import java.util.Random; import org.slf4j.Logger; import org.slf4j.LoggerFactory; import org.springframework.beans.factory.annotation.Autowired; import org.springframework.security.crypto.password.PasswordEncoder; public class SolrUtil { private final Logger logger = LoggerFactory.getLogger(getClass()); static final String ALPHA_CAPS = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; static final String ALPHA = "abcdefghijklmnopqrstuvwxyz"; static final String NUM = "0123456789"; static final String SPL_CHARS = "!@#$%*"; @Autowired protected PasswordEncoder encoder; public static String randomSeed() { String seed = new String(generateSeed(8, 8, 1, 1, 1)); return seed; } protected static char[] generateSeed(int minLen, int maxLen, int noOfCAPSAlpha, int noOfDigits, int noOfSplChars) { if(minLen > maxLen) throw new IllegalArgumentException("Min. Length > Max. Length!"); if( (noOfCAPSAlpha + noOfDigits + noOfSplChars) > minLen ) throw new IllegalArgumentException ("Min. Length should be atleast sum of (CAPS, DIGITS, SPL CHARS) Length!"); Random rnd = new Random(); int len = rnd.nextInt(maxLen - minLen + 1) + minLen; char[] pswd = new char[len]; int index = 0; for (int i = 0; i < noOfCAPSAlpha; i++) { index = getNextIndex(rnd, len, pswd); pswd[index] = ALPHA_CAPS.charAt(rnd.nextInt(ALPHA_CAPS.length())); } for (int i = 0; i < noOfDigits; i++) { index = getNextIndex(rnd, len, pswd); pswd[index] = NUM.charAt(rnd.nextInt(NUM.length())); } for (int i = 0; i < noOfSplChars; i++) { index = getNextIndex(rnd, len, pswd); pswd[index] = SPL_CHARS.charAt(rnd.nextInt(SPL_CHARS.length())); } for(int i = 0; i < len; i++) { if(pswd[i] == 0) { pswd[i] = ALPHA.charAt(rnd.nextInt(ALPHA.length())); } } return pswd; } private static int getNextIndex(Random rnd, int len, char[] pswd) { int index = rnd.nextInt(len); while(pswd[index = rnd.nextInt(len)] != 0); return index; } }