Skip to content

Instantly share code, notes, and snippets.

View OpenClosedPrincipleExample.cs
using System;
using System.Collections.Generic;
namespace OpenClosedPrincipleExample
{
class Program
{
static void Main(string[] args)
{
var customerMessages = new List<Message>
View constraints.cs
class GenericClass<T> where T : class
{
private T _genericField;
public T genericProperty { get; set; }
public GenericClass(T value)
{
_genericField = value;
}
View generics.cs
class GenericClass<T> where T
{
private T _genericField;
public T genericProperty { get; set; }
public GenericClass(T value)
{
_genericField = value;
}
View GenericMethod.cs
public T Add<T> (T num1, T num2)
{
dynamic a = num1;
dynamic b = num2;
return a + b;
}
View GenericExamples.cs
//This is how you declare a class signature which uses a Generic Type
public class GenericList<Type>
{
public void Add(Type input)
{
//logic for adding to list..
Console.WriteLine(input.ToString());
}
}
View README-Template.md

Project Title

One Paragraph of project description goes here

Getting Started

These instructions will get you a copy of the project up and running on your local machine for development and testing purposes. See deployment for notes on how to deploy the project on a live system.

Prerequisites

View mapping.sol
pragma solidity ^0.4.0;
contract MappyingContract{
mapping(uint => uint[])luckyNumbers;
mapping(address => uint [])addNumbers;
uint[] numbers;
constructor() public{
luckyNumbers[0] = [1,2,3,4];
luckyNumbers[1] = [1,2,3,5];
@shoupn
shoupn / compileDeployer.js
Created Jul 12, 2018
Web3 Solidity Contract Deployment Script
View compileDeployer.js
const solc = require("solc");
const fs = require("fs");
const Web3 = require('web3');
const password = "test";
//web3 provider. can also use ws if started node as websocket
var web3 = new Web3(
new Web3.providers.HttpProvider('http://localhost:8545'));
//Read solidity contract file
@shoupn
shoupn / series.py
Created Jun 23, 2018
Largest In a Series
View series.py
from collections import deque
digits_str = "73167176531330624919225119674426574742355349194934\
96983520312774506326239578318016984801869478851843\
85861560789112949495459501737958331952853208805511\
12540698747158523863050715693290963295227443043557\
66896648950445244523161731856403098711121722383113\
62229893423380308135336276614282806444486645238749\
30358907296290491560440772390713810515859307960866\
70172427121883998797908792274921901699720888093776\
@shoupn
shoupn / sum_primes.py
Created Jun 23, 2018
Sieve of Eratosthenes Algorithm for Finding Prime Numbers
View sum_primes.py
import math
def primeSieve(sieveSize):
# Returns a list of prime numbers calculated using
# the Sieve of Eratosthenes algorithm.
sieve = [True] * sieveSize
sieve[0] = False # zero and one are not prime numbers
sieve[1] = False
for i in range(2, int(math.sqrt(sieveSize)) + 1):
pointer = i * 2
You can’t perform that action at this time.