Envie de crever - Githubissues

import javax.crypto.interfaces.DHPrivateKey;
import javax.naming.NameClassPair;
import java.beans.beancontext.BeanContext;
import java.beans.beancontext.BeanContextSupport;
import java.math.BigInteger;
import java.security.KeyPair;
import java.security.NoSuchAlgorithmException;
import java.security.SecureRandom;
import java.security.spec.RSAPublicKeySpec;
import java.util.Collection;
import java.util.Locale;
import java.util.Map;
import java.util.Vector;
import java.util.concurrent.ConcurrentLinkedDeque;

public class Pouet {
    public int trouveUn9DePaques(String q) throws NoSuchAlgorithmException {
        BeanContextSupport beanContextSupport = new BeanContextSupport();
//        beanContext.add()
//        Map<Vector<Boolean>> vector = new Vector<>(q.length());
        boucleinfinie: while (true) {
            bouclepasinfinie: while (beanContextSupport.size() != q.length()) {
                // ca veut dire taille en allemand xD
                int schnitt = q.length();
                SecureRandom laSécuritéCestImportant = SecureRandom.getInstanceStrong();
                double nextDouble = laSécuritéCestImportant.nextDouble();
                double index = (nextDouble * schnitt) % schnitt;
            if (beanContextSupport.stream().filter(o -> ((NameClassPair) o).getName().equals(((int) index) + "")).count() >= 1 == Boolean.TRUE) {
                    break bouclepasinfinie;
                }
                beanContextSupport.add(new NameClassPair("" + (int) (index), "" + (q.charAt(((int) (index))) == '9')));
//            vector.insertElementAt(q.charAt(((int) (index))) == '9', (int) index);
                if (beanContextSupport.size() == q.length()) {
                    break boucleinfinie;
                }
            }
        }

        ConcurrentLinkedDeque<Integer> concurrentLinkedDeque = new ConcurrentLinkedDeque<>();
        concurrentLinkedDeque.addLast(Integer.MAX_VALUE);
        for (int i = 0; i < beanContextSupport.size(); i++) {
            Object o = beanContextSupport.stream().toList().get(i);
            if (((NameClassPair) o).getClassName().equals(Boolean.FALSE.toString()) == Boolean.FALSE) {
                if (concurrentLinkedDeque.getFirst() > Integer.parseInt(((NameClassPair) o).getName())) {
                    concurrentLinkedDeque.addFirst(Integer.parseInt(((NameClassPair) o).getName()));
                }
            }
        }

        return concurrentLinkedDeque.getFirst();
    }
}
CoddityTeam / movaicode

Envie de crever #219
