CLICK ME
yes, even hidden code blocks!
print("hello world!")
#include<u.h> | |
#include<libc.h> | |
#define MAX(a, b) ((a) > (b) ? (a) : (b)) | |
/* Hilbert curve functions (from Wikipedia) */ | |
/* rotate/flip a quadrant appropriately */ | |
void rot(int n, int *x, int *y, int rx, int ry) | |
{ |
import java.io.IOException; | |
import java.util.StringTokenizer; | |
import org.apache.hadoop.conf.Configuration; | |
import org.apache.hadoop.fs.Path; | |
import org.apache.hadoop.io.IntWritable; | |
import org.apache.hadoop.io.Text; | |
import org.apache.hadoop.mapreduce.Job; | |
import org.apache.hadoop.mapreduce.Mapper; | |
import org.apache.hadoop.mapreduce.Reducer; |
""" | |
helloevolve.py implements a genetic algorithm that starts with a base | |
population of randomly generated strings, iterates over a certain number of | |
generations while implementing 'natural selection', and prints out the most fit | |
string. | |
The parameters of the simulation can be changed by modifying one of the many | |
global variables. To change the "most fit" string, modify OPTIMAL. POP_SIZE | |
controls the size of each generation, and GENERATIONS is the amount of | |
generations that the simulation will loop through before returning the fittest |
#!/bin/bash | |
if [ "$(id -u)" != "0" ]; then | |
echo "This script must be run as root" 1>&2 | |
exit 1 | |
fi | |
DISTRO= | |
OS= | |
if grep 'Debian' /etc/issue > /dev/null 2>&1 ; then |
The always enthusiastic and knowledgeable mr. @jasaltvik shared with our team an article on writing (good) Git commit messages: How to Write a Git Commit Message. This excellent article explains why good Git commit messages are important, and explains what constitutes a good commit message. I wholeheartedly agree with what @cbeams writes in his article. (Have you read it yet? If not, go read it now. I'll wait.) It's sensible stuff. So I decided to start following the
Stack Name | Stack Type | Operating System / Platform | Server | Database | Language or SDK | Framework | UI | Message Bus / Queue | |
---|---|---|---|---|---|---|---|---|---|
AMP | Web (Backend) | Apache | MySQL / MariaDB | Perl / PHP / Python | |||||
BAMP | Web (Backend) | BSD | Apache | MySQL / MariaDB | Perl / PHP / Python | ||||
BAPP | Web (Backend) | BSD | Apache | PostgreSQL | Perl / PHP / Python | ||||
BCHS | Web (Backend) | BSD | SQLite | httpd | C | ||||
DAMP | Web (Backend) | Darwin | Apache | MySQL / MariaDB | Perl / PHP / Python | ||||
ELK | Time Series Data | Logstash | Elasticsearch | Kibana | |||||
ELKB | Time Series Data | Logstash | Elasticsearch | Beats | Kibana | ||||
FAMP | Web (Backend) | FreeBSD | Apache | MySQL / MariaDB | Perl / PHP / Python | ||||
FWAP | Web (Backend) | Windows | Apache | Firebird | Perl / PHP / Python |
This project is a tiny compiler for a very simple language consisting of boolean expression.
The language has two constants: 1
for true and 0
for false, and 4 logic gates:
!
(not), &
(and), |
(or), and ^
(xor).
It can also use parentheses to manage priorities.
Here is its grammar in BNF format:
expr ::= "0" | "1"
Large language model (LLM) providers have integrated search capabilities into their platforms, combining traditional search with AI-powered reasoning for contextual and accurate responses. Customize your browser to use these AI-enhanced tools as your default search engine to improve your search experience. For Safari users, install this extension to customize search engines.[^1]