Juan Lopes juanplopes

## Dafuq.java
import static java.lang.System.exit;
import static java.lang.System.out;

public class Dafuq {

    /**
     * This does not do what you think it does.
     * <p>
     * You think code is documentation? No! Documentation is code!
      \u002a\u002f

## JavaBluetooth.md

      
              1 file
            
          
              0 forks
            
          
                9 comments
              
            
              7 stars
            
          
                SingingBush
                / JavaBluetooth.md
            
            
              Last active
              November 21, 2025 03:45
            
              
                A short article about the lack a standard API for Bluetooth in Java SE
              
          
    Bluetooth (or the lack of) on Java

Java SE has never had support for bluetooth, the closest thing to a standard is JABWT (Java APIs for Bluetooth Wireless Technology) defined in JSR-82 which is actually for Java ME (Micro Edition).
JSR-82 provides the specification for the javax.bluetooth and javax.obex packages and would allow for code somewhat like:
import javax.bluetooth.BluetoothStateException;
import javax.bluetooth.DeviceClass;

  
## resposta_aos_novatos.md

      
              1 file
            
          
              3 forks
            
          
                3 comments
              
            
              9 stars
            
          
                luzfcb
                / resposta_aos_novatos.md
            
            
              Last active
              March 13, 2024 21:20
            
              
                resposta aos iniciantes novatos pythonbrasil
              
          
    Olá, seja bem vindo ao grupo Python-Brasil.

Insira aqui o pedido de mais informações ou possivel solução a pergunta feita

Dito isto, aqui nós possuímos algumas regras que ajudam a manter essa lista útil e agradável para os participantes
Antes de mandar as suas próximas perguntas, pedimos para que leia o texto:

  
## pave.md

      
              1 file
            
          
              1 fork
            
          
                1 comment
              
            
              5 stars
            
          
                juanplopes
                / pave.md
            
            
              Last active
              August 29, 2015 14:05
            
              
                Candidato, é pavê ou pra comê? (texto de @kramercarlos)
              
          
    Texto criado pelo amigo Carlos Krämer (github . twitter . facebook) lá no Facebook, reproduzido aqui com a permissão dele.
Jornalista: Candidato, é pavê ou pra comê?

Dilma: Veja bem, nunca foi tanto pra comê quanto no meu governo. Há um ditado.... eu digo, editaram quando eu era o cachorro atrás de uma criança ... que diz que todo mundo que insere, ou melhor, ingere o que é pavê, tem uma satisfação imensa de... como dizem... dobrar a esquina. Mas nós precisamos continuar mudando, meu governo foi ótimo, eu fui eleita para dar prosseguimento ao governo Lula, Lula, LULA. Mas ninguém está mais insatisfeita com ele, digo, com o governo, não com o Lula, do que eu, mas os pessimistas é que estão tornando tudo ruim.
Marina: Eu não acho que é pavê nem pra comê. Nós precisamos aprender a reunir o que é bom em tudo, as melhores

  
## ssp.py
import logging
import sys

from graph import *
from residual import *
from dijkstras import Dijkstra

first_from_set = lambda s: list(s)[0]
excess_criteria = lambda x: x.supply > 0
deficit_criteria = lambda x: x.supply < 0

## gist:178060e556e68421a8c5
from collections import defaultdict

def add(network, a, b, capacity):
	network[a][b] = network[b][a] = capacity

def send(network, a, b, V, minimum=1000000):
    V.add(a)
    if a == b:
        print '-> path', a
        return minimum

## convexhull01.html
<!doctype html>
<html>
    <head>
        <title>ConvexHull 01</title>
        <style type="text/css">
            * {
                margin: 0;
                padding: 0;
            }

## Main.java
QuantileSketch sketch = new QuantileSketch();
for (int i = 0; i < 100000000; i++) {
    double x1 = Math.random();
    double x2 = Math.random();

    //random normal distribution with mean=0 and stdev=1
    sketch.offer(abs(sqrt(-2 * log(x1)) * cos(2 * Math.PI * x2)));
}

for (int i = 0; i <= 100; i++) {

## gist:8172796

      
              1 file
            
          
              405 forks
            
          
                23 comments
              
            
              1658 stars
            
          
                debasishg
                / gist:8172796
            
            
              Last active
              November 16, 2025 01:54
            
              
                A collection of links for streaming algorithms and data structures
              
          
    General Background and Overview


Probabilistic Data Structures for Web Analytics and Data Mining : A great overview of the space of probabilistic data structures and how they are used in approximation algorithm implementation.
Models and Issues in Data Stream Systems
Philippe Flajolet’s contribution to streaming algorithms : A presentation by Jérémie Lumbroso that visits some of the hostorical perspectives and how it all began with Flajolet
Approximate Frequency Counts over Data Streams by Gurmeet Singh Manku & Rajeev Motwani : One of the early papers on the subject.
[Methods for Finding Frequent Items in Data Streams](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.187.9800&amp;rep=rep1&amp;t


## rsa.py
from random import randint

#----Step 1
# First, choose two random primes.
# In real world, they should be really big primes (hundreds of digits).

p, q = 41, 47

#----Step 2
# From them we have n=p*q and phi(n)=(p-1)*(q-1).
	import static java.lang.System.exit;
	import static java.lang.System.out;

	public class Dafuq {

	/**
	* This does not do what you think it does.
	* <p>
	* You think code is documentation? No! Documentation is code!
	\u002a\u002f
	import logging
	import sys

	from graph import *
	from residual import *
	from dijkstras import Dijkstra

	first_from_set = lambda s: list(s)[0]
	excess_criteria = lambda x: x.supply > 0
	deficit_criteria = lambda x: x.supply < 0
	from collections import defaultdict

	def add(network, a, b, capacity):
	network[a][b] = network[b][a] = capacity

	def send(network, a, b, V, minimum=1000000):
	V.add(a)
	if a == b:
	print '-> path', a
	return minimum
	<!doctype html>
	<html>
	<head>
	<title>ConvexHull 01</title>
	<style type="text/css">
	* {
	margin: 0;
	padding: 0;
	}
	QuantileSketch sketch = new QuantileSketch();
	for (int i = 0; i < 100000000; i++) {
	double x1 = Math.random();
	double x2 = Math.random();

	//random normal distribution with mean=0 and stdev=1
	sketch.offer(abs(sqrt(-2 * log(x1)) * cos(2 * Math.PI * x2)));
	}

	for (int i = 0; i <= 100; i++) {
	from random import randint

	#----Step 1
	# First, choose two random primes.
	# In real world, they should be really big primes (hundreds of digits).

	p, q = 41, 47

	#----Step 2
	# From them we have n=pq and phi(n)=(p-1)(q-1).