First create ec2 Ubuntu instance
Then install all the things needed for Mirth Connect (following this video: http://www.youtube.com/watch?v=omZyAO2naqs)
# Update Ubuntu
sudo aptitude update
# Safe upgrade of Ubuntu
sudo aptitude safe-upgrade
First create ec2 Ubuntu instance
Then install all the things needed for Mirth Connect (following this video: http://www.youtube.com/watch?v=omZyAO2naqs)
# Update Ubuntu
sudo aptitude update
# Safe upgrade of Ubuntu
sudo aptitude safe-upgrade
defmodule YourAppName.Search do | |
# ... | |
@doc """ | |
Queries listings. | |
""" | |
def query_listings(query, current_user) do | |
default_scope = from l in Listing, where: l.draft == false or l.user_id == ^current_user.id, order_by: [desc: l.updated_at], limit: 50 | |
id = _try_integer(query) |
A simple Ecto custom type for the Postgres tstzrange
type.
Based on: https://gist.github.com/felipegasparini/7c9a6fa0c2c463c17540b8e8544f16cf With the following differences:
Ecto.Datetime
tstzrange
instead of tsrange
{start, finish}
rather than a list [start, finish]
# Fixing permissions of packaged gems | |
files: | |
"/opt/elasticbeanstalk/hooks/appdeploy/pre/10_fixing_permission.sh": | |
content: | | |
#!/usr/bin/env bash | |
# . /opt/elasticbeanstalk/containerfiles/envvars | |
. /opt/elasticbeanstalk/support/envvars | |
CACHE_GEM_DIR=$EB_CONFIG_APP_ONDECK/vendor/cache |
#include <stdio.h> | |
#include <stdlib.h> | |
#define ValType double | |
#define IS_LESS(v1, v2) (v1 < v2) | |
void siftDown( ValType *a, int start, int count); | |
#define SWAP(r,s) do{ValType t=r; r=s; s=t; } while(0) |
// graph.cpp | |
// | |
// Author: Jon Gautsch | |
// | |
// Contact: jgautsch@nd.edu | |
// | |
// Course: CSE 30331, Fall 2013 | |
#include "graph.h" | |
#include <sstream> |
#include <stdio.h> | |
#include <stdlib.h> | |
// #include "Tree.h" | |
typedef int ElementType; | |
struct TreeNode; | |
typedef struct TreeNode *Position; | |
typedef struct TreeNode *SearchTree; | |
SearchTree MakeEmpty(SearchTree T); |
/* HPSORT.C : PROGRAM TO CREATE A HEAP AND TO SORT A HEAP, HEAP IS STORED IN AN ARRAY */ | |
#include<stdio.h> | |
#include<conio.h> | |
void crheap(int [], int); | |
void processheap(int [],int); | |
int main(void) | |
{ | |
int k[50],child,parent,q,key,n,t,i; | |
clrscr(); | |
printf("\n enter the no. of elements: "); |
/***** Jon Gautsch and Rob Wirthman | |
***** thermd.c | |
***** CSE 30264 - Project 2 | |
***** | |
***** USAGE: ./tcpserver | |
***** | |
***** See comments and README.txt for details | |
*****/ | |
#include <stdio.h> /* for printf() and fprintf() */ |
/***** Jon Gautsch and Rob Wirthman | |
***** thermd.c | |
***** CSE 30264 - Project 2 | |
***** | |
***** USAGE: ./tcpserver | |
***** | |
***** See comments and README.txt for details | |
*****/ | |
#include <stdio.h> /* for printf() and fprintf() */ |