Francisco Lucas LucasAlfare

💭

Attempting "masterize" JetPack Compose

I'm a pharmacist, but I like programming... Instagram: @lucas.alfare

LucasAlfare / settings.json

Created July 12, 2024 02:24 — forked from diego3g/NODE.md

VSCode Settings (Updated)

	{
	"workbench.startupEditor": "newUntitledFile",
	"editor.fontSize": 15,
	"editor.lineHeight": 1.8,
	"javascript.suggest.autoImports": true,
	"javascript.updateImportsOnFileMove.enabled": "always",
	"editor.rulers": [
	80,
	120
	],

LucasAlfare / ProceduralMapGenerationWithPerlinNoise.java

Created September 23, 2023 20:14 — forked from smonteillet/ProceduralMapGenerationWithPerlinNoise.java

Simple Procedural Map Generation using Java/Swing and a Perlin Noise like algorithm

	import java.awt.Color;
	import java.awt.Graphics;
	import java.util.Random;

	import javax.swing.JFrame;
	import javax.swing.JPanel;

	public final class ProceduralMapGenerationWithPerlinNoise
	{

LucasAlfare / RandomPolygon.java

Created September 23, 2023 04:53 — forked from Rogach/RandomPolygon.java

	package org.rogach.jopenvoronoi;

	import java.io.*;
	import java.util.*;
	import java.awt.geom.Point2D;
	import java.awt.Color;

	// random polygon generator
	// uses space partitioning algorithm, described here: http://www.geometrylab.de/applet-29-en#space
	public class RandomPolygon {

LucasAlfare / gearcube.js

Created May 24, 2023 20:56 — forked from cs0x7f/gearcube.js

Gear Cube Random State Scramble

	var getgearoptscramble=(function() {
	var cmv = [];
	var emv = [];
	var prun = [];

	function cornerMove(idx, m) {
	var arr = [], temp;
	mathlib.setNPerm(arr, idx, 4);
	temp = arr[0];
	arr[0] = arr[m+1];

LucasAlfare / index.html

Created May 20, 2020 15:06 — forked from biovisualize/index.html

Fast pixel drawing on canvas

	<!DOCTYPE html>
	<html>
	<head>
	<meta charset="utf-8">
	<title></title>
	<script type="text/javascript" src="http://d3js.org/d3.v3.min.js"></script>
	<style type="text/css">

	</style>
	</head>

LucasAlfare / Split.java

Created December 7, 2019 14:23 — forked from banthar/Split.java

java split benchmark

	import java.util.ArrayList;
	import java.util.Arrays;
	import java.util.Iterator;
	import java.util.LinkedList;
	import java.util.StringTokenizer;

	public class Split {

	private static String string = "a/b/c/d/e/f/g/h/i/j/asd/asdas/dasdjasodjoa/sjd/oajs/djoasjd/as/odj/jaowdj/oajw/odj/aojwd/oja/owjd/oja/wjdoja/wdj/awjdojaw/odj/oawjd/oja/wjdoawjdojaw/d/dff";

LucasAlfare / SkewbSolver.java

Created October 4, 2019 03:59 — forked from cs0x7f/SkewbSolver.java

Verify whether all states of the skewb can be solved at exactly 11 moves.

	package puzzle;

	import java.util.Random;

	public class SkewbSolver {


	private static final int[] fact = { 1, 1, 1, 3, 12, 60, 360 };//fact[x] = x!/2
	private static char[][] permmv = new char[4320][4];
	private static char[][] twstmv = new char[2187][4];