;; functions precede arguments
(+ 1 2)
;; operators do too
(+ 1 2 3 4 5 6)
;; and lists of lists!
(dec (+ 1 2 3))
;; and list that don't eval
'(1 2 3 4)
Parenthesis ... and a few brackets and curlies too
;; define a vector var with a literal
(def v [1 2 3 4])
;; define a map with a literal
(def m { :one 1 :two 2 :three 3 })
verb (function) oriented instead of noun (object) oriented
functions can be called and defined
;; define a function
(defn walmart-greeting []
"watch out for falling prices!")
;; call a function
(walmart-greeting)
functions can be returned from functions
;; define a function that returns a function
(defn walmart-greeting []
(fn [] "watch out for falling prices!"))
;; get it and bind it
(def greet-me (walmart-greeting))
;; call it!
(greet-me)
functions can be arguments to functions
;; create a higher order function
(defn greet-me [greeter] (greeter))
;; call it with an anonymous function
(greet-me (fn [] "watch out for falling prices!"))
looping and iteration via recursive function calls
;; return a sequence of falling prices
(defn falling-prices [result x]
(if (zero? x)
result
(recur (conj result x) (dec x))))
;; make it happen
(falling-prices [] 5)
lexical scoping / closures
;; create a function that closes over local name
(defn make-greeting [place]
(let [walmart place]
(fn [welcome-to]
(str welcome-to walmart))))
;; bind it
(def greeting (make-greeting "Walmart!"))
;; call it
(greeting "Welcome to ")
IMMUTABLE...but more on that later...
;; use java.lang.Math#sqrt static method
(Math/sqrt 9)
;; instantiate Java objects
(java.awt.Point. 10 20)
;; and call instance methods on them
(.x (java.awt.Point. 10 20))
;; with parameters even
(.divide (java.math.BigDecimal. "42") 2M)
Oh and by the way...
Life doesn't run on a single thread of execution
problem solved by locking shared state before mutation
The greatest trick that OO languages ever pulled was convincing the world that identity is the same as state
OOP thinks in terms of stateful "things" with destructive methods
All changes happen, or the transaction fails and retries. Coordinated changes on multiple identities
provides validator functions to check consistency of data and rollback transaction on failure
mutated data within a transaction is only visible to the thread that made the change
Not Applicable
Represent identities that change values over time
Shared, synchronous, and coordinated changes
;; create the ref
(def foreclosed-homes (ref {}))
;; deref the ref with a handy little macro
@foreclosed-homes
;; create transaction with the 'dosync' macro
(dosync
(ref-set foreclosed-homes {}))
;; create new buyer
(defn new-buyer [id login bid]
{:id id
:login login
:net-worth net-worth})
(defn add-buyer [login bid]
(dosync
(let [counter (count @buyers)
buyer (new-buyer (inc counter) login bid)]
(alter buyers assoc login buyer))))
Shared, asynchronous, and independent changes
;; create the agent
(def kungfu-skill-level (agent 0))
;; deref the agent with a handy little macro
@kungfu-skill-level
(send kungfu-skill-level + 1000)
(send-off kungfu-skill-level + 1000)


Pizza Peddler
Ngowwa Pizzeria is a small family owned business.
It started as a small business in Ongata Rongai and as years passed it has grown to become bigger and better


Instructor: Elba Garza
Office Location: HRBB 522
Office Hours: MW 3:00-4:00PM
E-Mail<EMAIL_ADDRESS>Teaching Assistant: Sharmistha Maity
Office Hours: Wednesday 2:30-3:30 PM and Thursday 11:30AM-12:30PM
Location: TBD
E-mail<EMAIL_ADDRESS>Here is the Syllabus
September 3rd: First zyBook assignment due at 5:30 PM.
August 27th: Labs will commence on August 29th, 2018.
Homework 1: Due September 7th at 5:30 PM


An Algorithm is a sequence of steps to solve a problem. Design and Analysis of Algorithm is very important for designing algorithm to solve different types of problems in the branch of computer science and information technology. An algorithm is an efficient method that can be expressed within finite amount of time and space. An algorithm is the best way to represent the solution of a particular problem in a very simple and efficient way. If we have an algorithm for a specific problem, then we can implement it in any programming language, meaning that the algorithm is independent from any programming languages. So Designing and analyzing the algorithm plays an important role.
The unit wise description of the subject is as given below:-
UNIT 1: INTRODUCTION
This unit deals with the Notion of an algorithm, Fundamentals of Algorithmic Problem Solving, Fundamentals of the Analysis of Algorithmic efficiency and Analysis Framework. Most important part of this unit is Asymptotic Notations and its properties and performing Mathematical analysis of Recursive and Non-Recursive Algorithms
UNIT 2:BRUTE FORCE AND DIVIDE-AND-CONQUER
By this unit we come across the Problem-Solving Techniques. Under Brute Force we come across problems like Closest-Pair and Convex-hull, Travelling Salesman problem, Knapsack problem and Assignment problem. Under Divide and Conquer we come across problems like Merge Sort, Quick Sort, Binary Search, Multiplication of Large Integers and Strassen’s Matrix Multiplication
UNIT 3:DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE
This unit deals how Dynamic Programming solves problems by combining the solutions of sub problems and Greedy Technique follows local optimal choice at each step with the hope of finding global optimum solution Under Dynamic Programming we come across problems like Computing Binomial Coefficient, Knapsack problem and Memory functions Under Greedy Technique we come across problems like Prim,Kruskal,Dijksta;s Algorithms and Huffman Trees
UNIT 4:ITERATIVE IMPROVEMENT
This unit deals how Iterative Improvement approaches a solution by progressive approximation and how it finds the (k+1)th approximate solution using kth approximate solution. We come across problems like Simplex Method, Maximum Flow problem, Maximum Matching in Bipartite Graphs and Stable Marriage Problem
UNIT 5:COPING WITH THE LIMITATIONS OF ALGORITHM POWER
This unit deals how to identify the Algorithms Limits by using Lower-Bound Arguments, Decision Trees, P,NP and NP-Complete problems and under Coping with the limitations we come across problems like n-Queens problem, Hamiltonian Circuit problem and Subset Sum problem and under Branch and Bound technique we come across problems like Travelling Salesman,Knapsack,Assignment Problems
By understanding the fundamentals of Algorithm Design, Algorithm developing methods and Problem Solving techniques One can easily understand the problem and an Algorithm can be designed using different techniques. After designing an Algorithm it must be analysed regarding time complexity. By implementing Design and Analysis of Algorithm Conecpt Time Complexity and Space Complexity will be reduced.
• Algorithm Design Engineer
• Algorithm Designer
• Algorithm Engineer
• Algorithm Analyst
Students who choose to have their careers in DAA should have deep knowledge in Problem Solving Techniques, Algorithm designing techniques and Algorithm analyzing techniques. He/She must be very innovative in developing the algorithms to reduce the Time and Space Complexity and also must be very creative in solving a problem in very small steps. While creating software’s in any organization, First foremost step is designing an Algorithm for it and after analyzing is done. So Design and Analysis of Algorithms is an important domain in the organizations for developing Softwares. So for that Students must be very well known of design and analysis of algorithm techniques.


I am originally from the suburbs of Indianapolis. I love trying new things, home brewing, rooting for the Packers and the Colts, reading, baking, barbequing, and most importantly learning. I have a Bachelor's of Arts in Political Science from the University of Indianapolis, Master's of Public Affairs with a concentration in Nonprofit Management, and attended The Iron Yard to become a Full Stack Engineer.
I worked as a Conversion Project Manager for Bloomerang coordinating database migrations from a legacy database to the Bloomerang architecture working with various departments and clientele.
I was promoted to the Manager of Data Services where I managed a staff of seven and acted as an escalation point along with maintaining independent projects. I was then promoted to the Director of Implementation position where I managed the department budget, department timelines, and coordinated internal schedules.
As a Conversion Project Manager I quickly learned how to manage multiple different timelines, kept clients/internal team members on tasks, and kept communcation flowing.
I have nearly a decades worth of experience doing customer service while in/at the Peace Corps, AmeriCorps, Blackbaud, American Legion Auxiliary, and Bloomerang.
I also have a certificate in dispute resolution and negotiation from Indiana University.


Health Insurance Risk Calculator
Instructions... Please provide me the following information so I can understand more about you
Please Select Your Age
Please Provide me your Height
ft inches
Please provide your weight
pounds
Please Select Your BMI
Please Select Your Blood Pressure
Please Select Your Family Disease


If you’d like to try out Jest with an existing codebase, there are a number of ways to convert to Jest:
If you are using AVA, Chai, Expect.js (by Automattic), Jasmine, Mocha, proxyquire, Should.js or Tape you can use the third-party jest-codemods to do most of the dirty migration work. It runs a code transformation on your codebase using jscodeshift.
Install Jest Codemods with yarn
by running:
To transform your existing tests, navigate to the project containing the tests and run:
More information can be found at https://github.com/skovhus/jest-codemods.


Researching a way to render insertion points
A few observations: 1) Insertion point should not be to the left of the next visual node. 2) All insertion points can be split into three categories: - before visual node - after visual node - into visual node 3) All points from top of selected node should be duplicated at its bottom.


{% extends 'comics/base.html' %} {% block page_title %} | Community{% endblock %} {% block page_description %}Join us on your favorite social media platform!{% endblock %} {% block content %}
Back to: Comic
Join us on your favorite social platform!


I'm only visible on screens XXXL
I'm only visible on screens XXL
I'm only visible on screens XL
I'm only visible on screens L
I'm only visible on screens M
I'm only visible on screens S
I'm only visible on screens XS


galaxy_dive.read_data.ahf module¶
Tools for reading AHF output files.
@author: Zach Hafen @contact<EMAIL_ADDRESS>@status: Development
-
class
galaxy_dive.read_data.ahf.
AHFReader
(data_dir)[source]¶ Bases:
object
Read AHF data. Note! All positions are in comoving coordinates, and everything has 1/h’s sprinkled throughout.
-
check_files_exist
(snum_start, snum_end, snum_step, file_str='AHF_halos')[source]¶ Check that AHF was successfully run for all files in the given range.
Parameters: Returns: If True, all files in the given range exist.
Return type: files_exist (bool)
-
get_filepath
(snum, ahf_file_type)[source]¶ Get the filepath for a specified type of AHF file.
Parameters: Returns: The filepath to the specified file.
Return type: ahf_filepath (str)
-
get_halos
(snum, force_reload=False)[source]¶ Get *.AHF_halos file for a particular snapshot.
Parameters: - Modifies:
- self.halos (pd.DataFrame): Dataframe containing the requested data.
-
get_halos_add
(snum, force_reload=False)[source]¶ Get *.AHF_halos_add file for a particular snapshot.
Parameters: - Modifies:
- self.halos_add (pd.DataFrame): Dataframe containing the requested data.
-
get_mtree_halo_quantity
(quantity, indice, index=None, tag=None)[source]¶ Get a desired quantity for all merger tree halos at a particular snapshot.
Parameters: - quantity (str) – mtree_halo key to load in the dataset
- indice (int) – Indice of the quantity to load, as indicated by the index.
- index (str or int) – What type of index to use. Defaults to None, which raises an exception. You must choose an index, to avoid easy mistakes. See get_mtree_halos() for a full description.
- tag (str) – Additional identifying tag for the files, e.g. ‘smooth’, means this function will look for ‘halo_00000_smooth.dat’, etc.
Returns: The ith index is the requested quantity for ith MT halo.
Return type: mtree_halo_quantity (np.array)
-
get_mtree_halos
(index=None, tag=None, adjust_default_labels=<object object>)[source]¶ Get halo files (e.g. halo_00000.dat) in a dictionary of pandas DataFrames.
Parameters: - index (str or int) –
What type of index to use. Defaults to None, which raises an exception. You must choose an index, to avoid easy mistakes. Options are… ‘snum’ : Indexes by snapshot number, starting at 600 and counting down. Only viable with snapshot steps of 1!!
Identical to passing the integer 600. (See below.)’range’ : Index by an increasing range. int : If an integer, then this integer should be the final snapshot number for the simulation.
In this case, indexes by snapshot number, starting at the final snapshot number and counting down. Only viable with snapshot steps of 1!! - tag (str) – Additional identifying tag for the files, e.g. ‘smooth’, means this function will look for ‘halo_00000_smooth.dat’, etc.
- adjust_default_label (bool) – Whether or not to adjust the column headings, etc. Defaults to True if tag is None.
- Modifies:
- self.mtree_halos (dict of pd.DataFrames) :
- DataFrames containing the requested data. The key for a given dataframe is that dataframe’s Merger Tree Halo ID
- self.mtree_halo_filepaths (dict of strs) :
- What files the data was loaded from.
- self.index (str) :
- The users value for the index.
- self.tag (str) :
- What tag was used for the files.
- index (str or int) –
-
get_mtree_idx
(snum)[source]¶ Get *.AHF_mtree_idx file for a particular snapshot.
Parameters: snum (int) – Snapshot number to load. - Modifies:
- self.ahf_mtree_idx (pd.DataFrame): Dataframe containing the requested data.
-
get_pos_or_vel
(pos_or_vel, halo_id, inds, type_of_halo_id='merger_tree')[source]¶ Get the position or velocity of a mt halo (three dimensional).
Parameters: - pos_or_vel (str) – Get position (‘pos’) or velocity (‘vel’).
- halo_id (int) – Merger tree halo ID for the position or velocity you want.
- inds (int or np.array of ints) – Indices you want the position or velocity for. If type_of_halo_id == ‘merger_tree’, uses same index as mtree_halos. Elif type_of_halo_id == ‘halos’, can only be a single int, which should be the snapshot number.
- type_of_halo_id (str) – ‘merger_tree’ if the halo id is a merger tree halo id. ‘halos’ if the halo id is a *.AHF_halos halo id.
Returns: Position or velocity for the specified inds.
Return type: p_or_v ( [len(inds), 3] np.array )
-