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| # 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 |
| [[ -s "$HOME/.profile" ]] && source "$HOME/.profile" # Load the default .profile | |
| # Load in .bashrc ----------------------------------------------- | |
| if [ -f ~/.bashrc ]; then | |
| source ~/.bashrc | |
| fi | |
| [[ -s "$HOME/.rvm/scripts/rvm" ]] && source "$HOME/.rvm/scripts/rvm" # Load RVM into a shell session *as a function* |
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| # Turn on advanced bash completion if the file exists | |
| if [ -f /usr/local/etc/bash_completion ]; then | |
| . /usr/local/etc/bash_completion | |
| fi | |
| # Locate virtualenvwrapper binary | |
| if [ -f ~/.local/bin/virtualenvwrapper.sh ]; then | |
| export VENVWRAP=~/.local/bin/virtualenvwrapper.sh | |
| fi |
| #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: [email protected] | |
| // | |
| // 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() */ |