Robert M. Vunabandi robertvunabandi

## refs.results
Number of frames = 1
Input file path is: input/apple.in_new
---- RESULTS ----
Elapsed execution time: 0.014831s
0 Line-Wall Collisions
1 Line-Line Collisions
---- END RESULTS ----
Number of frames = 2
Input file path is: input/apple.in_new
---- RESULTS ----

## fib_cilk.csv

          
            time-sec
             llvm-ir-instructions
             cilk-spawns

            
              0.000185
               174
               7

            
              0.000197
               174
               7

            
              0.000200
               174
               7

            
              0.000189
               174
               7

            
              0.000227
               174
               7

            
              0.000193
               174
               7

            
              0.000195
               174
               7

            
              0.000201
               174
               7

            
              0.000231
               174
               7

## LinRegData.csv

          
            time-sec
             function-calls
             llvm-ir-instructions

            
              0.000159
               16
               112

            
              0.000135
               16
               112

            
              0.000132
               16
               112

            
              0.000125
               16
               112

            
              0.000126
               16
               112

            
              0.000130
               16
               112

            
              0.000131
               16
               112

            
              0.000148
               16
               112

            
              0.000142
               16
               112

## README-Template.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                robertvunabandi
                / README-Template.md
            
            
              Created
              February 9, 2019 15:42
                — forked from PurpleBooth/README-Template.md
            
              
                A template to make good README.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


## sticky_footer_no_comment.js
window.addEventListener("load", activateStickyFooter);

function activateStickyFooter() {
  adjustFooterCssTopToSticky();
  window.addEventListener("resize", adjustFooterCssTopToSticky);
}

function adjustFooterCssTopToSticky() {
  const footer = document.querySelector("#footer");
  const bounding_box = footer.getBoundingClientRect();

## sticky_footer.js
// when the page load, activate the sticky footer
window.addEventListener("load", activateStickyFooter);

function activateStickyFooter() {
  // need to adjust the footer top when the page just loads
  // because the footer may not be sticky
  adjustFooterCssTopToSticky();

  // whenever the window is resized, we need to re-adjust the
  // footer top to update its position

## Calculator.js
"use strict";

class Calc {
  constructor() {
    this._setToBaseState();
  }

  _setToBaseState() {
    // find static methods at end of Calc class
    this.__FIRST = "0";

## combinations.js
/**
 * Copyright (c) 2017 Robert M. Vunabandi
 * Created August 6th, 2017
 * Licensed under the MIT license.
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is

## Tree.py
def Tree3(s, p, c, L):
    # attempts the same as &Tree and &Tree2 with a different approach
    # this assumes that p is ordered from smallest to highest
    res = 0
    lfinal = set()
    for i in range(len(p)):
        pos = [L]
        tSum = c
        while tSum < s:
            pos.append(pos[-1]+[p[i]])
	Number of frames = 1
	Input file path is: input/apple.in_new
	---- RESULTS ----
	Elapsed execution time: 0.014831s
	0 Line-Wall Collisions
	1 Line-Line Collisions
	---- END RESULTS ----
	Number of frames = 2
	Input file path is: input/apple.in_new
	---- RESULTS ----
time-sec	llvm-ir-instructions	cilk-spawns
0.000185	174	7
0.000197	174	7
0.000200	174	7
0.000189	174	7
0.000227	174	7
0.000193	174	7
0.000195	174	7
0.000201	174	7
0.000231	174	7
time-sec	function-calls	llvm-ir-instructions
0.000159	16	112
0.000135	16	112
0.000132	16	112
0.000125	16	112
0.000126	16	112
0.000130	16	112
0.000131	16	112
0.000148	16	112
0.000142	16	112
	window.addEventListener("load", activateStickyFooter);

	function activateStickyFooter() {
	adjustFooterCssTopToSticky();
	window.addEventListener("resize", adjustFooterCssTopToSticky);
	}

	function adjustFooterCssTopToSticky() {
	const footer = document.querySelector("#footer");
	const bounding_box = footer.getBoundingClientRect();
	// when the page load, activate the sticky footer
	window.addEventListener("load", activateStickyFooter);

	function activateStickyFooter() {
	// need to adjust the footer top when the page just loads
	// because the footer may not be sticky
	adjustFooterCssTopToSticky();

	// whenever the window is resized, we need to re-adjust the
	// footer top to update its position
	"use strict";

	class Calc {
	constructor() {
	this._setToBaseState();
	}

	_setToBaseState() {
	// find static methods at end of Calc class
	this.__FIRST = "0";
	/**
	* Copyright (c) 2017 Robert M. Vunabandi
	* Created August 6th, 2017
	* Licensed under the MIT license.
	*
	* Permission is hereby granted, free of charge, to any person obtaining a copy
	* of this software and associated documentation files (the "Software"), to deal
	* in the Software without restriction, including without limitation the rights
	* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
	* copies of the Software, and to permit persons to whom the Software is
	def Tree3(s, p, c, L):
	# attempts the same as &Tree and &Tree2 with a different approach
	# this assumes that p is ordered from smallest to highest
	res = 0
	lfinal = set()
	for i in range(len(p)):
	pos = [L]
	tSum = c
	while tSum < s:
	pos.append(pos[-1]+[p[i]])