Skip to content

Instantly share code, notes, and snippets.

View natebenes's full-sized avatar

Nate Benes natebenes

71 followers · 63 following
View GitHub Profile
@natebenes
natebenes / gist:600993
Created September 28, 2010 13:32
function () {
DF.namespace("DF.browserInformation");
(DF.browserInformation = function () {
var a, b, d, g = [{
string: navigator.vendor,
searchStr: "Apple",
id: "Safari",
versionStr: "Version",
versMin: 1.3,
os: "mac"
@natebenes
natebenes / basic-upload.html
Created June 18, 2010 21:56
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8"/>
<title>Google Storage File Upload Example</title>
</head>
<body>
<div>
<form action="http://YOUR-BUCKET.commondatastorage.googleapis.com" enctype="multipart/form-data" method="post">
<fieldset>
@natebenes
natebenes / jsonhelper.f90
Created June 4, 2010 20:22
module jsonFx
implicit none
contains
subroutine getFileNames(names, counter)
implicit none
integer, intent(out) :: counter
character(len=512), dimension(500000), INTENT(OUT) :: names
character(len=512) :: tempStr = "", pwd="", blankage
integer :: openErr, readErr, strLen, k
@natebenes
natebenes / listNames.f90
Created May 3, 2010 00:39
program testNames
implicit none
integer :: count
character(len=50), dimension(500000) :: AllNames
CALL getFileNames(AllNames, count)
WRITE(*,*) count
end program
@natebenes
natebenes / constructbettertree.f90
Created April 27, 2010 18:05
Recursive Function Construct_Tree(expression) result(return_tree)
stack, intent(inout) :: expression
treenode :: left_exp, right_exp, return_tree
character :: symbol, op_symbol, closeparen
! some better pseudocode
symbol = pop(expression)
IF symbol == "("
left_exp = construct_tree(expression)
@natebenes
natebenes / insert.f90
Created April 21, 2010 19:21
TYPE :: node
character (len=2) :: value
type(node), pointer :: left, right
END TYPE
recursive subroutine insert (t,value)
IMPLICIT NONE
TYPE(node), pointer, INTENT(IN) :: t ! really a tree
character(len=2), intent(in) :: value
@natebenes
natebenes / misc.f90
Created April 21, 2010 19:19
myInt = 0
myChar = "15 + 42 + fish/shark"
READ(*,"A") userInput
READ(myChar(1:2),"I", IOSTAT=someerrors) myInt
@natebenes
natebenes / validExp.f90
Created April 21, 2010 19:17
logical function validExp(inputstring, length)
IMPLICIT NONE
character(len=500), intent(in) :: inputstring
integer, intent(in) :: length
integer:: i, counter = 0
character(len=1) :: testCharacter
character(len=16), parameter :: allowed = "1234567890+-/$()"
validExp = .FALSE.
DO i = 1, length
@natebenes
natebenes / factorial.f90
Created April 21, 2010 19:15
RECURSIVE FUNCTION factorial(n) RESULT(FactNum)
IMPLICIT NONE
INTEGER :: FactNum
INTEGER, INTENT(IN) :: n
! What if fact < 0 ?
IF (n==0) THEN
Fact = 1
ELSE
@natebenes
natebenes / dump.xml
Created April 12, 2010 22:16
<pdf2xml>
<meta name="Author" content="Shivashis"/>
<meta name="Creator" content="Microsoft® Office Word 2007"/>
<meta name="Producer" content="Microsoft® Office Word 2007"/>
<meta name="CreationDate" content="20100408180658"/>
<page t="0" l="0" w="612" h="792">
<text l="260" t="62" w="91" h="18" p="260,78,342,9">PROGRAM 4</text>
<text l="72" t="97" w="468" h="13" p="72,25,107,76,193,63,266,37,313,21,344,38,391,12,414,20,444,6,460,38,508,32">This programming assignment carries 200 points, so this a double credit</text>
<text l="72" t="113" w="468" h="13" p="72,67,146,12,165,20,192,76,276,63,346,21,374,22,403,29,439,25,471,35,514,26">assignment. In this programming assignment you will work with linked lists,</text>