realvjy

// Lines
float hash( float n ) {
    return fract(sin(n)*753.5453123);
}

// Slight modification of iq's noise function.
float noise(vector_float2 x )
{
    vector_float2 p = floor(x);
    vector_float2 f = fract(x);

samdods

//
//  Config.swift
//  Analytics
//

public protocol AnalyticsConfig {
    static var analyticsKey: String { get }
    static var appVersion: String { get }
}

sjcotto

function isChatMessage(message) {
    if (message.__x_isSentByMe) {
        return false;
    }
    if (message.__x_isNotification) {
        return false;
    }
    if (!message.__x_isUserCreatedType) {
        return false;
    }

sagaya

import random

credit_card_number = ""

def make_random_number(number_of_element):
    random_numbers = []
    for i in range(number_of_element):
        random_numbers.append(random.randint(0, 9))
    return random_numbers

sagaya

var card_number = ""

func make_random_number(num:Int)->[Int]{
    var result = [Int]()
    for _ in 0...num {
        result.append(Int(arc4random_uniform(9)))
    }
    return result
}
func luhn_algorithm(){

iamjason

let state = [ "AK - Alaska", 
                "AL - Alabama", 
                "AR - Arkansas", 
                "AS - American Samoa", 
                "AZ - Arizona", 
                "CA - California", 
                "CO - Colorado", 
                "CT - Connecticut", 
                "DC - District of Columbia", 
                "DE - Delaware", 

mycodeschool

/* Queue - Circular Array implementation in C++*/
#include<iostream>
using namespace std; 
#define MAX_SIZE 101  //maximum size of the array that will store Queue. 

// Creating a class named Queue.
class Queue
{
private:
	int A[MAX_SIZE];

lukaskonarovsky

#include "dynamicarray.h"

using namespace std;

DynamicArray::DynamicArray() {
  DynamicArray::DynamicArray(5);
}

DynamicArray::DynamicArray(int initSize) {
  size = initSize;