Skip to content

Instantly share code, notes, and snippets.

View reaganmcf's full-sized avatar
👨‍💻
Working on chipmunk

Reagan McFarland reaganmcf

👨‍💻
Working on chipmunk
View GitHub Profile
$ yay -S lightmon
:: Checking for conflicts...
:: Checking for inner conflicts...
[Aur:1] lightmon-0.2.0-1
1 lightmon (Installed) (Build Files Exist)
==> Packages to cleanBuild?
==> [N]one [A]ll [Ab]ort [I]nstalled [No]tInstalled or (1 2 3, 1-3, ^4)
==> A
:: Deleting (1/1): /home/rmcf/.cache/yay/lightmon
open Stdlib
let _ = Random.self_init ()
type term =
| Constant of string
| Variable of string
| Function of string * term list
type head = term
@reaganmcf
reaganmcf / cloudSettings
Last active February 11, 2021 06:02
settings
{"lastUpload":"2021-02-11T06:02:48.281Z","extensionVersion":"v3.4.3"}
typedef struct _locks {
char* project_name;
pthread_mutex_t lock;
struct ProjectLock* next;
} ProjectLock;
//lets say we have 3 projects
char* p1 = "project1";
char* p2 = "project2";
char* p3 = "project3";
@reaganmcf
reaganmcf / Test.md
Created September 26, 2019 16:25
Test

test

@reaganmcf
reaganmcf / notes.md
Created May 19, 2019 23:17
Notes with Ballinger

Lesson with Ballingers

  • If you are using indicators for analysis, you should try to combine a leading + a lagging indicator
    • Leading Indicator
      • These arrive at a value before a price does
      • Ex: RSI gets to 20 before prices reaches its low
      • Most leading indicators are oscillators
      • If trading view puts it at the bottom of the viewport, it is usually a leading indicator
    • Lagging Indicator
      • These react to price with a delay almost They deform and react to a price event
  • Ex: Bollinger Bands
@reaganmcf
reaganmcf / regex-example.java
Last active February 24, 2019 20:04
Regex in Java
String regex = "(\\w+)"; //match one or more letters into a capture group
Pattern pattern = Pattern.compile(regex, Pattern.MULTILINE);
Matcher matcher = pattern.matcher("This is a test string");
while(matcher.find()) {
String currMatch = matcher.group();
System.out.println(currMatch);
}
// Output
// ------

Study Group - Session #1

Practice Problem 1 - LinkedList Recursive Sum

public int sum(Node front) {
  if(front == null) return 0;
  return front.data + sum(front.next)
}
@reaganmcf
reaganmcf / polynomial.java
Created February 2, 2019 16:16
Polynomial Add
public static Node add(Node poly1, Node poly2) {
if(poly1 == null && poly2 == null) return null;
float newCoeff;
int newDegree;
Node nextNode;
if(poly1 == null) {
newCoeff = poly2.term.coeff;
newDegree = poly2.term.degree;
nextNode = add(null, poly2.next);
@reaganmcf
reaganmcf / deploy.sh
Created August 27, 2018 21:50
Deploy Skill
ask deploy