mik30s

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <linux/ioctl.h>
#include <linux/types.h>
#include <linux/v4l2-common.h>
#include <linux/v4l2-controls.h>
#include <linux/videodev2.h>
#include <fcntl.h>
#include <unistd.h>

mik30s

#include "OptimalBST.h"

template<class T>
void clearTable(T **table, int, int, float);
bool greaterThan(float a, float b);

// constructor
OptimalBST::OptimalBST(float* _probabilities, int size)
    :numColumns(size+1), numRows(size+2), numberOfProbabilities(size)
{

mik30s

#include <iostream>
#include <sys/types.h>
#include <sys/socket.h>
#include <netdb.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <cstdlib>
#include <string>

using namespace std;

mik30s

// The Following solves a linear programming problem
// In standardized form using the simplex method
// Please the read below.
/************************************************USAGE*************************************************************
 * 1.Create an instance of the simplex class
 * 2.Fill in the table with the standardized form of the problem by calling simplex.fillTable()
 * 3.Create a while loop and call the simplex.compute() method until it returns ERROR.IS_OPTIMAL or ERROR.UNBOUNDED 
 * ****************************************************************************************************************/

public class Simplex {

mik30s

In file included from /home/michael/Code/repos/breckel/compiler/sources/symboltablebuilder.h:9:0,
                 from /home/michael/Code/repos/breckel/compiler/sources/symboltablebuilder.cpp:1:
/home/michael/Code/repos/breckel/compiler/sources/ast.h: In instantiation of ‘brekell::frontend::Ast::traverse(brekell::frontend::Ast::TraversalType, Processor)::<lambda(auto:1&)>::<lambda(Processor, brekell::frontend::Ast::NodePtr&, auto:2)> mutable [with auto:2 = brekell::frontend::Ast::traverse(brekell::frontend::Ast::TraversalType, Processor)::<lambda(auto:1&)> [with auto:1 = brekell::semantics::SymbolTableBuilder::build()::<lambda(brekell::frontend::Ast::NodePtr&)>; Processor = brekell::semantics::SymbolTableBuilder::build()::<lambda(brekell::frontend::Ast::NodePtr&)>]::<lambda(brekell::semantics::SymbolTableBuilder::build()::<lambda(brekell::frontend::Ast::NodePtr&)>, brekell::frontend::Ast::NodePtr&, auto:2)>; auto:1 = brekell::semantics::SymbolTableBuilder::build()::<lambda(brekell::frontend::Ast::NodePtr&)>;

mik30s

County	Voting System	Latitude (generated)	Longitude (generated)
Yadkin	M 100	36.15	-80.657
Wilkes	M 100	36.21	-81.207
Wayne	M 100	35.392	-78.052
Watauga	M 100	36.246	-81.686
Washington	M 100	35.84	-76.6
Wake	M 100	35.817	-78.624
Vance	M 100	36.373	-78.394
Tyrrell	M 100	35.879	-76.123
Swain	M 100	35.429	-83.554

mik30s

package lab.pkg2.texteditor;

import javafx.application.Application;
import javafx.scene.Scene;
import javafx.scene.control.TextArea;
import javafx.scene.layout.StackPane;
import javafx.stage.Stage;

public class Lab2TextEditor extends Application {
    

mik30s

package edu.tarleton;

import java.util.HashMap;
import java.util.Iterator;
import java.util.function.Consumer;
import javafx.event.ActionEvent;
import javafx.event.EventHandler;
import javafx.scene.control.Menu;
import javafx.scene.control.MenuBar;
import javafx.scene.control.MenuItem;

mik30s

mik30s