Mushrooms (P. cubensis)
This happened to a close friend of mine (seriously, it wasn't me), Iíll call him F. You also must understand that finding mushrooms in our area is about as difficult as performing open heart surgery on yourself.
After F's second experience with mushrooms (the two were spaced roughly 3 months apart) F decided that he desired to explore the effects of mushrooms much more frequently then the availability in our small community would allow. Being an educated individual, he researched mushroom cultivation thoroughly and decided on using the PF-Tek method of cultivation. After ordering the proper materials required for the project he set out to grow his own personal crop.
You must also understand that F does not live alone, still in school he lives in a common household with several other individuals. There is S who was informed of the plan from the start because S is F's roommate. The other occupants B and M, were not informed of F's activities.
Well, time passed slowly and F's project yielded its first flush, a healthy one, approximately 30g dried. A few days after his first 5g dose (plus three test doses of 1/2g, 1g and 1 1/2g to insure safety and strength) he was left with 22g of suprisingly potent mushrooms.
F being a generous caring fellow offered these dried mushrooms to B and M. B and M did not appreciate the idea of mushrooms being cultivated in their household and threatened F that, if all 22g plus the terrarium were not gone in 24 hrs. they would call the police and have him charged.
So all of F's work and money was wasted as he burnt the 22gs in the fireplace along with all six of his substrate cakes.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


Boston’s Mayor’s Office of New Urban Mechanics (MONUM) serves as Mayor Martin J. Walsh’s civic innovation group.
Boston’s MONUM focuses on four major issue areas: Education, Engagement, the Streetscape, and Economic Development. To design, conduct and evaluate pilot projects in these areas, MONUM builds partnerships between constituents, academics, entrepreneurs, non-profits and City staff


{% extends "content_base.html" %} {% load i18n %} {% block head_title %}{% trans "Sprints" %}{% endblock %} {% block excerpt %}
{% blocktrans %}Monday, August 12th and Tuesday, August 13th, 2013.{% endblocktrans %}
{% trans "SPRINT_WHAT" %}{% blocktrans %}The sprints will be held at the conference venue, in the Terrace room (3rd floor). Show up any time, and leave any time—it's up to you!{% endblocktrans %}
{% trans "You!" %}
{% blocktrans %}All experience levels are welcome; sprints are a great opportunity to get connected with, and start contributing to your favorite Python project. Many people have made their first open-source contribution at sprints.{% endblocktrans %}
{% blocktrans %}Participation in the sprints is free!{% endblocktrans %}
{% blocktrans %}It's easy—just head over to the sprint wiki and write your name under the project you're interested in. If you just want to attend sprints in general, there's a section for that too! There will be people on hand to help you find something to work on.{% endblocktrans %}
{% blocktrans %}Not sure what to sprint on? Want to advertise your project? Head over to the sprint wiki to see (and add to) the list of projects which will have people sprinting.{% endblocktrans %}
{% endblock %}


Abdulmohsen Alsamin
CIS-255, Fall 2015
This web page is a template for students in CIS-255.
Programs
Prog01
Prog02
Prog03
Prog04
Prog05
Prog06
Exercises
Exercise01
Exercise02
Exercise03
Exercise04
Exercise05
Exercise06
Extra credit


Name:
Description:
Consumer Tasks/Capabilities:
Implementation
Qualities
Logic
Data
Dependencies
Service Dependencies
Events Subscriptions
Interface
Queries
Commands
Events Published


Since the early 1970s eyewitness testimony researchers have recognised the importance of estimating properties such as lineup bias (is the lineup biased against the suspect, leading to a rate of choosing higher than one would expect by chance?), and lineup size (how many reasonable choices are in fact available to the witness? A lineup is supposed to consist of a suspect and a number of additional members, or foils, whom a poor-quality witness might mistake for the perpetrator). Lineup measures are descriptive, in the first instance, but since the earliest articles in the literature researchers have recognised the importance of reasoning inferentially about them. This package contains functions to compute various properties of laboratory or police lineups, and is intended for use by researchers in forensic psychology and/or eyewitness testimony research. Among others, the r4lineups package includes functions for calculating lineup proportion, functional size, various estimates of effective size, diagnosticity ratio, homogeneity of the diagnosticity ratio, ROC curves for confidence x accuracy data and the degree of similarity of faces in a lineup.
| Version: | 0.1.1 |
| Depends: | R (≥ 3.4.0) |
| Imports: | boot, dplyr, ggplot2, ggrepel, here, magick, magrittr, pROC, psych, purrr, stats, utils |
| Suggests: | knitr, rmarkdown, pander |
| Published: | 2018-07-18 |
| Author: | Colin Tredoux [aut, cre], Tamsyn Naylor [aut] |
| Maintainer: | Colin Tredoux <colin.tredoux at uct.ac.za> |
| License: | CC0 |
| NeedsCompilation: | no |
| CRAN checks: | r4lineups results |
| Reference manual: | r4lineups.pdf |
| Vignettes: |
r4lineups: Statistical Inference on Lineup Fairness |
| Package source: | r4lineups_0.1.1.tar.gz |
| Windows binaries: | r-devel: r4lineups_0.1.1.zip, r-release: r4lineups_0.1.1.zip, r-oldrel: r4lineups_0.1.1.zip |
| OS X binaries: | r-release: r4lineups_0.1.1.tgz, r-oldrel: r4lineups_0.1.1.tgz |
Please use the canonical form https://CRAN.R-project.org/package=r4lineups to link to this page.


endclip()
The endclip() command is the companion to beginclip() and may only be called after the latter. When endclip() is called, subsequent shapes, paths, texts and images are no longer clipped to the path supplied to beginclip().


Hong Kong restaurant owner banned from Singapore for organising public assembly without permit
SINGAPORE: A Hong Kong restaurant owner has been repatriated and banned from Singapore after he organised a public assembly without a permit.
Mr Alex Yeung will not be allowed to enter Singapore again without prior permission from the authorities, the police said on Wednesday (Nov 20).
READ: Hong Kong restaurant owner assisting police with investigation on Singapore event related to protests
Mr Yeung, a Hong Kong resident, is said to have organised a gathering on Oct 11 "for interested persons to share their views on the current protests in Hong Kong".
The Singapore Police Force (SPF) said on Nov 7 that Mr Yeung's passport had been impounded while he was assisting with its investigation into the event.
On Wednesday, the police said it has issued a "stern warning" to Mr Yeung for organising a public assembly without the requisite police permit, an offence under the Public Order Act.
A similar warning was issued to a 55-year-old naturalised Singaporean for facilitating the public assembly.
The police said “there have been calls" for Singapore to release Mr Yeung and take no further action against him.
"Singapore has always been clear that foreigners should not advocate their political causes in Singapore, through public assemblies, and other prohibited means," SPF said.
"The police investigated Yeung’s case in accordance with our usual processes and in accordance with our laws.”
READ: Our coverage of the Hong Kong protests
The Chinese-ruled city of Hong Kong has been embroiled in anti-government unrest for nearly six months, after what started as rallies against a now-dead extradition Bill erupted into a wider movement calling for greater freedoms and police accountability.
Mr Yeung said in a YouTube video posted in early November he had planned to stay in Singapore from Oct 10 to 12 to seek business opportunities.
Follow us on Telegram for the latest on Hong Kong: https://cna.asia/telegram


Internal alpha release log of the Genetic Code Analysis Toolkit 1.0 to 1.9, developed internally at the University of Applied Sciences Mannheim.
- Basic nucleic model
- General set-up of the editor structure, text input, etc.
- Dialog to search & replace
- About dialog
- Differentiation into transformations, tests, analysis and splits
- Transformations "remove duplicates", "replace", etc.
- Splits like "pick", "split by regex", etc.
- Tests moved from the old tool e.g. comma-free?
- Undo / Redo functionality
- GenBatch tool
- Binary dichromatic algorithm (BDA) editor
- GenBank connection / search
- Use of Maven
- Unit Tests for operations
- Graph / compound display
- Set / sequence mode
- DNA / RNA mode
- Common substitutions
- Codon usage analysis
- Graphical codon wheel / codon table for input


Input the size of your tasting drink in ounces. In the case of spirits, the tasting size is fixed and cannot be adjusted.
Note: if the number of standard drinks is showing zero, you may have to increase the number of tastings until a whole number is calculated by the tool.
Input the number of tastings you would like to calculate for. The number of standard drinks will be calculated in the text box automatically.
Input the price per tasting drink you would like to calculate. The price per standard sized drink will be calculated in the next box automatically.
Press the "Clear" button to reset the entered values if you would like to use the tool again.


way of working
Learn about how novio works
Lorem ipsum dolor sit amet nsectetur cing elit. Suspe ndisse suscipit sagittis leo sit met entum estibu dignissim posuere cubilia durae. Leo sit met entum cubilia crae onec fringilla justo quam sodales a vehicula ipsum.
- Protect and enhance environment for future generations.
- Healthy tropical ecosystems are imperative to maintaining a healthy planet
8,000
Satisfied CustomersRecycling
Volunteer
Projects
Comunity
testimonials
What customers says
This is due to their excellent service, competitive pricing and customer support. It’s throughly refresing to get such a personal touch. Novio in my opinion deserves support for its projects.
john smith
This is due to their excellent service, competitive pricing and customer support. It’s throughly refresing to get such a personal touch. Novio in my opinion deserves support for its projects.
allen stwart
This is due to their excellent service, competitive pricing and customer support. It’s throughly refresing to get such a personal touch. Novio in my opinion deserves support for its projects.
maria dove


137th Battle of the Blues Cricket encounter |
Developed by,
Suresh Michael Peiris.
Concept design & score updates,
K. C. Bhareti
D. D. U. De Silva
Commentary,
STC Media Unit
Compiling for iOS,
J. C. Gurusinghe
Sponsored by,
ASUS Sri Lanka.
Powered by the ICT Society of S. Thomas' College Mount Lavinia.


I'm a Software Engineer and Full-Stack Developer with a passion for creating innovative programs. I love designing intuitive and modern interfaces that give users a great experience, but my specialty is cultivating big data through fast and efficient back-end architecture. I also have skills in other fields like marketing, logo design, professional video editing, professional photography, professional music production, and web development.
Code Fellows | Seattle, WA
1 Year Course
Bellevue College | Bellevue, WA
1 Year Course
Highline Community College | Des Moines, WA
Running Start Program | 4 Year Course
TRON Communication LLC ©
REVIEW IMPROVE
TRON COMMUNICATION WEBSITE
ALEXA ADVENTURES


Preparation time
30 mins to 1 hour
Cooking time
10 to 30 mins
Serves
Serves 4
Rich lamb works perfectly with fresh, crisp lettuce and sweet stir-fried vegetables.
Place the lamb pieces into a non-metallic bowl. Add the marinade ingredients. Mix well, cover and leave to marinate in the fridge for at least 20 minutes.
Remove the lamb from the marinade, dust with potato flour and then the ground tapioca granules.
Heat a saucepan or wok over a medium heat, half fill with groundnut oil and heat to 180C/350F or until a piece of bread turns golden brown in 15 seconds (Caution: Hot oil can be dangerous. Do not leave unattended). Place the lamb strips onto a metal slotted spoon and gently lower into the oil and cook for 30 seconds or until the lamb turns golden-brown and crisp. Remove, drain on kitchen paper and set aside.
For the stir-fry, mix together the orange juice, runny honey and light soy sauce.
Heat a wok over high heat, add the groundnut oil and garlic and fry for a few seconds to release the aroma. Add the courgettes and peppers and cook stirring constantly for a few seconds. Then add the cashew nuts, and the orange soy honey mixture. Give it one final stir take it off the heat.
To serve, remove the lettuce cups from the fridge, place onto a serving plate. Spoon the stir-fried vegetables into each parcel (holding back any liquid), top with the crispy Mongolian lamb pieces and dress with kumquat slices, edible flowers if using and coriander leaves.


The following table describes the OrderType
enumeration members:
| Member | Value | Description |
|---|---|---|
| Market | 0 | Market Order Type (0) |
| Limit | 1 | Limit Order Type (1) |
| StopMarket | 2 | Stop Market Order Type - Fill at market price when break target price (2) |
| StopLimit | 3 | Stop limit order type - trigger fill once pass the stop price; but limit fill to limit price (3) |
| MarketOnOpen | 4 | Market on open type - executed on exchange open (4) |
| MarketOnClose | 5 | Market on close type - executed on exchange close (5) |
| OptionExercise | 6 | Option Exercise Order Type (6) |
| LimitIfTouched | 7 | Limit if Touched Order Type - a limit order to be placed after first reaching a trigger value (7) |
| ComboMarket | 8 | Combo Market Order Type - (8) |
| ComboLimit | 9 | Combo Limit Order Type - (9) |
| ComboLegLimit | 10 | Combo Leg Limit Order Type - (10) |
| TrailingStop | 11 | Trailing Stop Order Type - (11) |


[Archives] From The Evidence Locker 2014 - 2017
Locker # 1
App Reveiws
Leo’s 5 essential apps!
January 7, 2017
Stock apps aren’t always the best option...
Continue readingStock apps aren’t always the best option...
Continue reading


I am a developer currently living in San Francisco and working for Unity Technologies.
I use this blog to share my thoughts and interests.


Registration Successful!
Your have successfully registered for Evaluation Portal!
Go to Evaluation Portal


Unity incorporates a tool called UnityYAMLMerge that can merge scene and prefab files in a semantically correct way. The tool can be accessed from the command line and is also available to third party version control software.
In the Editor Settings (menu: Edit > Project Settings > Editor), you have the option to select a third party version control tool (Perforce or PlasticSCM, for example). When one of these tools is enabled, you will see a Smart Merge menu under the Version Control heading. The menu has four options:
The UnityYAMLMerge tool is shipped with the Unity editor; assuming Unity is installed in the standard location, the path to UnityYAMLMerge will be:
C:\Program Files\Unity\Editor\Data\Tools\UnityYAMLMerge.exe
or
C:\Program Files (x86)\Unity\Editor\Data\Tools\UnityYAMLMerge.exe
…on Windows and
/Applications/Unity/Unity.app/Contents/Tools/UnityYAMLMerge
…on Mac OSX (use the Show Package Contents command from the Finder to access this folder).
UnityYAMLMerge is shipped with a default fallback file (called mergespecfile.txt, also in the Tools folder) that specifies how it should proceed with unresolved conflicts or unknown files. This also allows you to use it as the main merge tool for version control systems (such as git) that don’t automatically select merge tools based on file extensions. The most common tools are already listed by default in mergespecfile.txt but you can edit this file to add new tools or change options.
You can run UnityYAMLMerge as a standalone tool from the command line (you can see full usage instructions by running it without any arguments). Set-up instructions for common version control systems are given below.
.unity
.merge -p %b %1 %2 %r
Then, follow the same procedure to add the .prefab
extension.
Add the following text to your .git
or .gitconfig
file:
[merge]
tool = unityyamlmerge
[mergetool "unityyamlmerge"]
trustExitCode = false
cmd = '<path to UnityYAMLMerge>' merge -p "$BASE" "$REMOTE" "$LOCAL" "$MERGED"
Add the following text to your .hgrc
file:
[merge-patterns]
**.unity = unityyamlmerge
**.prefab = unityyamlmerge
[merge-tools]
unityyamlmerge.executable = <path to UnityYAMLMerge>
unityyamlmerge.args = merge -p --force $base $other $local $output
unityyamlmerge.checkprompt = True
unityyamlmerge.premerge = False
unityyamlmerge.binary = False
Add the following to your ~/.subversion/config
file:
[helpers]
merge-tool-cmd = <path to UnityYAMLMerge>
.unity
in the extension field. <path to UnityYAMLMerge> merge -p %base %theirs %mine %merged
Then, follow the same procedure to add the .prefab
extension.
.unity
extension. <path to UnityYAMLMerge> merge -p "@basefile" "@sourcefile" "@destinationfile" "@output"
Then, follow the same procedure to add the .prefab
extension.
merge -p $BASE $REMOTE $LOCAL $MERGED
in the Arguments text field.


We are a team of 7 students currently attending Lambda school. We have assimilated to craft this product and are driven to make it as clean and user-friendly as possible.
Lyndsi is currently a student at Lambda School, acquiring the knowledge to become a full stack web developer. Programming is her passion and that shows in her late-night adventures getting lost in her latest project. She ensures sustainable working practices through investing in breaks that typically involve video games or crafts (currently crochet). The Pomodoro technique will save your life in this career!
Learn MoreWalter is currently a student at Lambda School, acquiring the knowledge to become a full stack web developer. He is described as: Introvert. Bacon evangelist. Extreme gamer. Internet aficionado. Travel scholar. Lifelong problem solver.
Learn MoreVanessa is a front end developer working on the Web React I content. She loves to learn new things and teach everyone. When she is not nerding out on her laptop, she can be found reading, or baking or gardening.
Learn MoreAmberly is a front end developer working on the Web React II content. She loves coding and is thrilled that she gets to do it as her job. In her free time she likes to travel, cook, and play with animals of all kinds.
Learn MoreEric is a front end developer working on the Web React II content. He loves solving problems and writing software while listening to music. He also loves contributing to Open Source and spends a good amount of time trying to improve the JavaScript landscape. When he is not writing code he is probably building or flying drones, BBQing, or watching Netflix.
Learn MoreDevin is a back end developer taking care of all the back end content. He's an advocate of high quality comprehensive code. In his free time, you can usually find Devin reading a book, watching a movie, playing video games, or cooking. Possibly all at the same time.
Learn MoreCam is our project leader! He began making websites during the days of tables and Flash. He then moved from the front-end to more full-stack roles with a focus on functional programming, containers, and accessibility. In his free time Cam can be found obsessing over movies & music and hanging out with his cats.
Learn More


OCAPI Proxy Tester
This is a very basic testing UI. Ex: For customer auth you would use customer/auth as the proxy will already be configured for the rest of the url.
URL
Method
POST
GET
PUT
PATCH
DELETE
Proxy Path
Headers
OCAPI-Proxy for Salesforce Commerce Cloud
Request
{ "type" : "guest"}
Response
Send Proxy Request


Try out our Premium Member services: Virtual Legal Assistant, Query Alert Service and an ad-free experience. Free for one month and pay only if you like it.
1 IN THE HIGH COURT OF KARNATAKA AT BENGALURU DATED THIS THE 23RD DAY OF AUGUST 2016 BEFORE THE HON'BLE MR. JUSTICE ANAND BYRAREDDY CRIMINAL PETITION No.2178 OF 2015 CONNECTED WITH CRIMINAL PETITION No.5653 OF 2014 CRIMINAL PETITION No.5654 OF 2014 CRIMINAL PETITION No.5655 OF 2014 CRIMINAL PETITION No.5657 OF 2014 IN CRL.P 2178/2015 BETWEEN: V.S.Badari, Son of Sri. Somappa Bidari, Aged 59 years, Occupation: Executive Engineer BESCOM., C&OM Division, Hebbal, Bangalore, Now Working as (Now retired as 2 Executive Engineer) Bangalore Rural Circle Office, Kengeri, Bangalore. Residing at No.103/B, 3rd Main, 6th Cross, Ganganagar, Bangalore - 560 032. ...PETITIONER (By Shri Prasanna Kumar P., Advocate) AND: Karnataka State Pollution Control Board, Represented by its Deputy Environmental Officer, Ms. P. Sunitha, Aged 40 years, Regional Office, Hoskote, Nisarga Bhavan, Ground Floor, Thimmaiah Main, 7th 'D' Cross, Shivanagar, Bangalore - 560 010. ...RESPONDENT (By Shri M.N.Madhusudhan, Advocate) ***** This Criminal Petition filed under Section 482 code of Criminal Procedure, 1973, praying to quash the order dated 20.9.2013 passed by the Civil Judge and Judicial Magistrate First Class, Devanahalli in C.C.No.4978/2013 thereby taking cognizance against the petitioner herein and ordering to register 3 case and issue summons in so far as the same relates to the petitioner/accused No.2 herein. IN CRL.P.Nos.5653, 5654, 5655 and 5657/2014 BETWEEN: V.S.Badari, Son of Sri. Somappa Bidari, Aged 59 years, Occupation: Executive Engineer BESCOM., C&OM Division, Hebbal, Bangalore, Now Working as Executive Engineer, Bangalore Rural Circle Office, Kengeri, Bangalore. Residing at No.103/B, 3rd Main, 6th Cross, Ganganagar, Bangalore - 560 032. ...PETITIONER COMMON (By Shri Prasanna Kumar P., Advocate) AND: Karnataka State Pollution Control Board, Represented by its Deputy Environmental Officer, Ms. P. Sunitha, Aged 40 years, 4 Regional Office, Hoskote, Nisarga Bhavan, Ground Floor, Thimmaiah Main, 7th 'D' Cross, Shivanagar, Bangalore - 560 010. ...RESPONDENT COMMON (By Shri M.N.Madhusudhan, Advocate) IN CRL.P.5653/2014 This Criminal Petition filed under Section 482 code of Criminal Procedure, 1973, praying to quash the order dated 20.9.2013 passed by the Civil Judge and Judicial Magistrate First Class, Devanahalli in C.C.No.176/2014 thereby taking cognizance against the petitioner herein and ordering to register case and issue summons in so far as the same relates to the petitioner/accused No.2 herein. IN CRL.P 5654/2014 This Criminal Petition filed under Section 482 code of Criminal Procedure, 1973, praying to quash the order dated 20.9.2013 passed by the Civil Judge and Judicial Magistrate First Class, Devanahalli in C.C.No.5163/2013 thereby taking cognizance against the petitioner herein and ordering to register case and issue summons in so far as the same relates to the petitioner/accused No.2 herein. IN CRL.P 5655/2014 This Criminal Petition filed under Section 482 code of Criminal Procedure, 1973, praying to quash the order dated 5 20.9.2013 passed by the Civil Judge and Judicial Magistrate First Class, Devanahalli in C.C.No.24/2014 thereby taking cognizance against the petitioner herein and ordering to register case and issue summons in so far as the same relates to the petitioner/accused No.2 herein. IN CRL.P.No.5657/2014 This Criminal Petition filed under Section 482 code of Criminal Procedure, 1973, praying to quash the order dated 20.9.2013 passed by the Civil Judge and Judicial Magistrate First Class, Devanahalli in C.C.No.26/2014 thereby taking cognizance against the petitioner herein and ordering to register case and issue summons in so far as the same relates to the petitioner/accused No.2 herein. These Criminal Petitions coming on for Admission this day, the court made the following: ORDER
Heard the learned counsel for the petitioner. These petitions are disposed of by this common order.
2. The petitioner was an Executive Engineer of the Bangalore Electricity Supply Company (BESCOM) and he was stationed at Hebbal at Bangalore. It transpires that Accused No.1 who had been granted a quarrying licence, was carrying on quarrying activities and even after expiry of the licence, he 6 was carrying such activity beyond six months of the expiry of the licence. The Pollution Control Board having come to know of such illegal quarrying activity being carried on, had instructed the BESCOM to stop supply of electricity supply to the quarry. It further transpires that there was delay in disconnection and on that count, a complaint has been lodged for an offence punishable under Section 31-A of the Air (Prevention and Control of Pollution) Act, 1981. It is in that background the court below having taken cognizance by a one line order, the petitioner is before this court.
3. The petitioner is common in all these cases and the complaint is also a similar complaint in respect of inaction on the part of the present petitioner - Accused No.2. It is pointed out that the petitioner was stationed at Hebbal at Bangalore and had nothing to do with the quarry or the supply of electricity to the quarry, which was said to be situated at Devanahalli and was certainly not within his jurisdiction. Hence, the allegation that the petitioner had been notified to disconnect the electricity 7 even if true, would not enable him to carry out such disconnection. Hence, this glaring circumstance has been over- looked in the court below not having applied its mind and having ascertained as to the manner in which the petitioner could be named as an accused. In the absence of any material to indicate that there was any infraction committed by the petitioner, no fault can be said to have been committed by the petitioner. Hence, the counsel seeks that the proceedings against the petitioner be quashed.
4. However, the case is being tried as a summons case and there is no provision under which the court could close the proceedings. Even if it was possible for the court to examine the matter as to the contention now taken up, there is no choice but for the petitioner to stand trial. It is unfortunate that the petitioner who has been retired from service has to go through this process of criminal trial, notwithstanding his serious complaint that he is not at all concerned with the alleged offence and it is some other who ought to be prosecuted and the 8 entire proceedings also would be an exercise in futility if ultimately it is found that the petitioner was not the actual accused.
5. There is no provision under which the court could examine whether in fact the complaint is lodged against the proper person and the entire proceedings may result in futility if indeed the petitioner was not the concerned accused. Since there is no provision under which the petitioner could be compensated if it is ultimately found that he has been wrongly named as the accused and wrongly prosecuted, in exercise of power under Section 482 Cr.P.C., this court directs that if ultimately it is found that the petitioner has been wrongly prosecuted, he shall be compensated at the rate of Rs.500/- for every date of hearing he has been present and has attended the court. Further, in respect of each individual case, he shall be awarded the said compensation, which shall be collected from the complainant, if it is ultimately found that petitioner has been wrongly prosecuted. The petitions are disposed of. 9
Since the cases are being tried as summons cases, the court below shall expedite the proceedings and complete the same at the earliest.
Sd/-
JUDGE KS


For this element, the style and the image
associated are retrieved directly from the classpath.
This HTML image use a generated path which force the caching for the browser.
The CSS image is retrieved from the
webapp, which is a classic case.
The CSS image is retrieved from the
classpath. The CSS used here is defined in the webapp under the "css"
folder. This mean that you could reference a CSS image in
the classpath from a standard CSS define in a bundle.
This input image use a generated path which force the caching for the browser.


As a Computer Science graduate from Bloomsburg University of Pennsylvania, I am experienced and passionate about learning and using technology for social good. I received my Associate's degree from The Pennsylvania State University (Berks) and then transferred to Bloomsburg University of Pennsylvania to complete my degree. I am a self-motivated and dedicated student with diversified domain experiences such as Health Service, Banking, Utility, and Education.
I have completed various internships such as Software Developer with Bank of America Merrill Lynch in New York, Information Technology (IT) intern at the Behavioral Specialist Inc. and a Information Technology (IT) strategy intern at NiSource. While I believe that hard work is the foundation for creating value and success, I also believe that it should be balanced with a passion for other parts of life including family and recreation. I enjoy playing sports such as Tennis, Ping Pong, Soccer, Basketball, and Football. I also love watching movies and hanging out with friends.
August 2015 - December 2018 (Expected)
August 2013 - May 2015
August 2010 - June 2013
• Built and designed the operations dashboard user interface for the system DBAs, providing critical performance information analytics on their individually supported systems in order to change system behavior and drive incremental, continuous improvements. • Populated the Wiki by Confluence internal website that all system DBAs use on the daily basis for the operations team with information on how to address critical issues.
• Researched and documented the capabilities of 600+ applications to import into NiSource’s application portfolio catalog, Software AG Planning IT, to streamline the application rationalization process. Collaborated with IT Strategy & Enterprise Architecture to develop standard capabilities to improve consistency and communication. • During the PlanningIT Upgrade, implemented 15 User Acceptance Testing (UAT) test cases and identified 15 fixes.
• Onboarding and presenting to ~1600 students to fully equip them to be successful college students and transition to living in the campus residence halls. • Recruiting prospective students by educating them about Bloomsburg’s history and facilitating campus tours.
• Created the organization’s online presence by developing a website (https://www.bsikids.com/). • Trained 30 staff members about the fundamentals of computing which increased staff productivity by 15%. • Provided technical support to about 30 staff members which significantly minimized staff classroom downtime.


--- layout: post title: My Git Workflow published: true meta: posterous_60e8ef2b7d9ddd23e14a941a8878b49c_post_id: "25412220" posterous_60e8ef2b7d9ddd23e14a941a8878b49c_permalink: http://maxlynchmadison.posterous.com/my-git-workflow tags: [] type: post status: publish ---
I've recently settled on a Git workflow that works pretty well for me:
For initial project creation:
git --bare init
mkdir
for project. Ex: mkdir myproject
cd
into that directory.  I tend to work like this:
git checkout -b mybranch
git push origin mybranch
Right now I have three "stages" of GoBuzz deployment: dev, stage and prod. I'll commit changes in dev, go to stage, and run git pull origin dev
, fixing any merge conflicts if necessary.
Grabbing the code on another machine is easy by doing git clone ssh://me@myserver.com:SSHPORT/path/to/myproject.git
and then git checkout -b mybranch
and git reset --hard origin/mybranch
to sync the local branch with the master branch.


This site will be constantly changing over the next few months as I add too it and apply the news skills and techniques I am learning.
To see the most recent update of this page click the button below.
View NowWork being done by KEELAN WALKER
More footer info here


Hi,
For my gas and water monitoring, which is pulse-counting based, I use the (new) kwh-to-kwh/d operator after the accumulator operator. With the upgrade to v8, the daily value no longer updates. I still use a combination of mysql to store daily stats and tilmestore for realtime data, so no redis yet.
After inspecting the code, I see in line 245 of the file process_model.php "if (!redis) return $value", so I'm not expecting much to happen. Is this a bug or is the use of mysql for daily stats no longer supported (i see the default engine is now phpfina) ?
Re: v8.0 - kwh_to_kwhd not working
Just in case - if you're using rfm12bpiphp, have you restarted it?
I had some weird behaviour with my feeds because I failed to do this.
I have a daily value (using MYSQL) which is still updating fine under v8, for what it's worth.
Re: v8.0 - kwh_to_kwhd not working
no, I swithed to the oemgateway before upgrading to v8. I have other daily stats (eg power to kwhd) that still work, it's only the kwh_to_kwhd operator that i'm having problems with.


Jefferd Kurt Cosme is raised in Lasong, Tadiangan, Tuba, Benguet in the year 1998, 19th day of December. He attended school at the school around in Baguio and luckily passed all his subject without failing at least one of them.
He is the laziest in the room when he was in high school. He never do things that seems tiring. Examples of this games are basketball and volleyball. He doesn't even play with his balls. Why should he play other's balls?


"x" "1" "WAKISAKA,Y AND NISHIMOTO,Y, MUTAGENICITY STUDY ON A NEW SLEEP INDUCER,A 1H-1,2,4-TRIAZOLYLBENZOPHENONE DERIVATIVE (450191-S), AND ITS METABOLITE INBACTERIA, IYAKUHIN KENKYU 18(1):12-20, 1987"


One night, Recep, Hikmet, Ömer and me went to Irlamaz Promenade for playing Tabu. My teammate is Hikmet so i was telling the "Ostirch" words. Hikmet's mission is my understand what I'm told. While telling the word i said this sentence; "It can fly but can't fly." To be continued...
Recep has orange hair and beard. He is living Istanbul but he was born Zonguldak. Recep is mid level web developer. Recep will make 2800€ so he will order whiskey to we.
Hikmet has long hair and he is small than everyone. He loves sports and Hatay Dürüm. He is living in Antakya so he don't like many foods in the Turgutlu.
READ MORE >>Hikmet Gezmen
26 Septemper, 2021
He is my roommate and first deskmate in university. He knows all memes on the Instagram and Youtube.


Module xomo.cocomo
Effort and rist estimation
For moldes defined in risk.lua
and coc.lua
.
Functions
| new (self, coc) | Define the internal cocomo data structure:
x slots (for business-level decisions) and
y slots (for things derived from those decisions,
like self.effort and `self.risk') |
| set (self, t) | Change the keys x1,x2...
in a model, (and wipe anyting computed from x ). |
| effort (self, coc) | Compute effort |
| risks (self, coc) | Compute risk |
| y (w, x) | Return a y value from x |
| ready (self, coc, risk) | Mutatble objects, pairs of {x,y}
Ensures that y is up to date with the x variables. |
Functions
- new (self, coc)
-
Define the internal cocomo data structure:
x
slots (for business-level decisions) and y slots (for things derived from those decisions, likeself.effort
and `self.risk')Parameters:
- self
- coc
- set (self, t)
-
Change the keys
x1,x2...
in a model, (and wipe anyting computed fromx
).Parameters:
- self tab : a cocomo table
- t tab : a list of key,value pairs that we will update.
Returns:
-
tab : an updated cocomo table
- effort (self, coc)
-
Compute effort
Parameters:
- self tab : what we know about a project
- coc
tab
: background knowledge about
self
Returns:
-
number : the effort
- risks (self, coc)
-
Compute risk
Parameters:
- self tab : what we know about a project
- coc
tab
: background knowledge about
self
Returns:
-
number : the risk
- y (w, x)
-
Return a y value from
x
Parameters:
- w tab : type of column (*,+,-,1)
- x number
Returns:
-
number
- ready (self, coc, risk)
-
Mutatble objects, pairs of
{x,y}
Ensures that y is up to date with thex
variables.Parameters:
- self
- coc
- risk


Adding the data-inset="true" attribute to the list (ul or ol), applies the inset appearance which is useful for mixing a listview with other content on a page.
data-inset="true"


--- layout: archive title: Zulip Chat Archive permalink: /stream/113488-general/topic/LiveShare.html ---
Has anyone got LiveShare working with Lean and mathlib? I just tried it with @Anca Ciobanu ; firstly she shared a session but had a .gitignore file containing things like _target, and when the session was shared her code compiled for her but not for me -- all the imports failed. We renamed her .gitignore and tried again, and this time I see her _target and also her leanpkg.path, all of which looks perfect (coincidentally, she is on a different OS so it couild have been random) but still my VS Code cannot pick up the imports. What are we doing wrong?
The sharing is working, it's just that her code compiles for her and not for me.
@Kevin Buzzard, LiveShare doesn't work.
I mean, you can both edit the same file, but the client will not see any meaningful feedback from the server
The problem is just that in VS Code, it shows you those files that exist on the hosts machine
but they do not actually exist on your computer anywhere in the filesystem
so the external Lean command has nothing to work on
{% endraw %}Last updated: Apr 24 2020 at 19:02 UTC


How Snails Work
Who am I? What's going on & why?
making dating profiles for snails
Hidden Talents!
My Process
- Observe snails up close
- Find hidden talent
- Hypothesize how hidden talents may work
- Sketch idea for how they could work
- Make this into a snail dating profile
Norms for holding 🐌
- be gentle (don't squeeze shell!)
- spray hand to be moist!
-
if you get scared put snail in bin or call me over — no flicking
Snail dating profile based on "hidden talent!"
How do they:
- Move forward?
- Stay upside-down without falling?
- Retract eyes?
- Push out eyes?
- Retract or emerge from shell?
- Climb over razor blade?
Hidden Talent Mechanism
How does it work? (Be specific and detailed!)
- pulleys?
- gears?
- water pressure?
- changing liquid viscosity?
- exerting some kind of force somehow?
How is this kind of stuff used?


Portfolio VAX TRACK Repository Eat-Da-Burger Repository Cycle-ology Repository Weather Dashboard Repository Work Day Scheduler Repository JavaScript Quiz Repository Password Generator Repository Code Refactor Repository
VAX TRACK Repository Eat-Da-Burger Repository Cycle-ology Repository Weather Dashboard Repository Work Day Scheduler Repository JavaScript Quiz Repository Password Generator Repository Code Refactor Repository


T.P.L. sample
Tip: Use
window.TPL
to accesss the TPL module root in debugger console.
yielded
delay
sendRequest
Tip: You may throttle the network request via "Network" tab in F12 developer tool.
The first request has a timeout of 2 sec.


|
QuantLib: a free/open-source library for quantitative finance
Fully annotated sources - version 1.30
|
Global boostrapper, with additional restrictions. More...
#include <ql/termstructures/globalbootstrap.hpp>
Public Member Functions | |
| GlobalBootstrap (Real accuracy=Null< Real >()) | |
| GlobalBootstrap (std::vector< ext::shared_ptr< typename Traits::helper > > additionalHelpers, ext::function< std::vector< Date >()> additionalDates, ext::function< Array()> additionalErrors, Real accuracy=Null< Real >()) | |
| void | setup (Curve *ts) |
| void | calculate () const |
Private Types | |
| typedef Curve::traits_type | Traits |
| typedef Curve::interpolator_type | Interpolator |
Private Member Functions | |
| void | initialize () const |
Private Attributes | |
| Curve * | ts_ |
| Real | accuracy_ |
| std::vector< ext::shared_ptr< typename Traits::helper > > | additionalHelpers_ |
| ext::function< std::vector< Date >()> | additionalDates_ |
| ext::function< Array()> | additionalErrors_ |
| bool | initialized_ = false |
| bool | validCurve_ = false |
| Size | firstHelper_ |
| Size | numberHelpers_ |
| Size | firstAdditionalHelper_ |
| Size | numberAdditionalHelpers_ |
| Size | firstAdditionalDate_ |
| Size | numberAdditionalDates_ |
| std::vector< Real > | lowerBounds_ |
| std::vector< Real > | upperBounds_ |
Global boostrapper, with additional restrictions.
Definition at line 39 of file globalbootstrap.hpp.
|
private |
Definition at line 40 of file globalbootstrap.hpp.
|
private |
Definition at line 41 of file globalbootstrap.hpp.
| GlobalBootstrap | ( | Real | accuracy = Null<Real>() | ) |
Definition at line 85 of file globalbootstrap.hpp.
| GlobalBootstrap | ( | std::vector< ext::shared_ptr< typename Traits::helper > > | additionalHelpers, |
| ext::function< std::vector< Date >()> | additionalDates, | ||
| ext::function< Array()> | additionalErrors, | ||
| Real | accuracy = Null<Real>() |
||
| ) |
The set of (alive) additional dates is added to the interpolation grid. The set of additional dates must only depend on the current global evaluation date. The additionalErrors functor must yield at least as many values such that
number of (usual, alive) rate helpers + number of (alive) additional values >= number of data points - 1
(note that the data points contain t=0). These values are treated as additional error terms in the optimization, the usual rate helpers return marketQuote - impliedQuote here. All error terms are equally weighted in the optimisation.
The additional helpers are treated like the usual rate helpers, but no standard pillar dates are added for them.
WARNING: This class is known to work with Traits Discount, ZeroYield, Forward (i.e. the usual traits for IR curves in QL), it might fail for other traits - check the usage of Traits::updateGuess(), Traits::guess(), Traits::minValueAfter(), Traits::maxValueAfter() in this class against them.
Definition at line 88 of file globalbootstrap.hpp.
| void setup | ( | Curve * | ts | ) |
Definition at line 96 of file globalbootstrap.hpp.
| void calculate |
|
private |
Definition at line 107 of file globalbootstrap.hpp.
|
private |
Definition at line 70 of file globalbootstrap.hpp.
|
private |
Definition at line 71 of file globalbootstrap.hpp.
|
mutableprivate |
Definition at line 72 of file globalbootstrap.hpp.
|
private |
Definition at line 73 of file globalbootstrap.hpp.
|
private |
Definition at line 74 of file globalbootstrap.hpp.
|
mutableprivate |
Definition at line 75 of file globalbootstrap.hpp.
|
private |
Definition at line 75 of file globalbootstrap.hpp.
|
mutableprivate |
Definition at line 76 of file globalbootstrap.hpp.
|
private |
Definition at line 76 of file globalbootstrap.hpp.
|
mutableprivate |
Definition at line 77 of file globalbootstrap.hpp.
|
private |
Definition at line 77 of file globalbootstrap.hpp.
|
mutableprivate |
Definition at line 78 of file globalbootstrap.hpp.
|
private |
Definition at line 78 of file globalbootstrap.hpp.
|
mutableprivate |
Definition at line 79 of file globalbootstrap.hpp.
|
private |
Definition at line 79 of file globalbootstrap.hpp.


---
layout: default
title: Roadmap
permalink: /docs/roadmap
---
Sterling Roadmap
Big Picture
- Custom View
- Matrix View
- Mesh View
General Features
- Configurable Default Settings
- Geometric Zooming — The Sterling graph view uses semantic zooming, in which the nodes of the graph are repositioned but not scaled in size, resulting in a sort of "spreading" action. This is useful when a graph is crowded and the user needs to focus in on a specific portion of the graph, but is less useful as the user zooms out. Geometric zooming, on the other hand, repositions and scales the nodes. This is less useful when zooming in, as the nodes simply get bigger and any sort of node crowding remains unchanged. For very large graphs, however, the ability to zoom out and scale nodes accordingly may provide additional context in, e.g., graphs that are too large to fit on the screen at a readable zoom level. It would be useful, then, to include a way to easily toggle between semantic and geometric zooming.


For a client, the process of establishing a TCP connection is a two-step process that includes the creation of the socket object and a call to connect() to establish a connection to the server. For a server, the process requires the following four steps:
Example of these steps:
host = ’’ # Bind to all interfaces
port = 51423
# Step 1 (Create the socket object)
s = socket. socket(socket.AF_INET, socket.SOCK_STREAM)
# Step 2 (Set the socket options)
s.setsockopt(socket.SOL_SOCKET, socket.SOREUSEADDR, l)
# Step 3 (Bind to a port and interface)
s.bind((host, port))
# Step 4 (Listen for connections)
s.listen(5)
Setting and Getting Socket Options
There are many different options that can be set for a socket. For
general-purpose servers, the socket option of greatest interest is
called SOREUSEADDR. Normally, after a server process terminates, the
operating system reserves its port for a few minutes, thereby preventing
any other process (even another instance of your server itself) from
opening it until the timeout expires. If you set the SOREUSEADDR flag to
true, the operating system releases the server port as soon as the
server socket is closed or the server process terminates.This is done
through:
s.setsockopt(socket.SOL_SOCKET, socket.SOJEUSEADDR, l)
Binding the Socket
The next step is to claim a port number for the server. This process is
called binding. To bind to a port, you call:
s.bind((‘’, 111))
The first argument to bind() specifies the IP address to bind to it. It’s generally left blank, which means “bind to all interfaces and addresses.”
Listening for Connections
The last step before actually accepting client connections is to call
listen(). This call tells the operating system to prepare to receive
connections. It takes a single parameter, which indicates how many
pending connections the operating system should allow to remain in queue
before the server actually gets around to processing them.
Accepting Connections
Most servers designed to run indefinitely and service multiple connections, this is usually done with a carefully designed infinite loop. Example:
import socket
host = ’’ # Bind to all interfaces
port = 51423
s = socket.socket(socket.AF_INET, socket.SOCKJTREAM)
s.setsockopt(socket.SOL_SOCKET, socket.SO_REUSEADDR, l)
s.bind((host, port))
print “Waiting for connections…”
s.listen(l)
while l:
clientsock, clientaddr = s.acceptQ
print “Got connection from”, clientsock.getpeername()
clientsock.close()
Using User Datagram Protocol
To use UDP on the server, you create a socket, set the options, and bind
() just like with TCP However, there’s no need for listen () or accept
()—just use recvf rom().
This function actually returns two pieces of information: the received
data, and the address and port number of the program that sent the data.
Because UDP is connectionless, this is all you need to be able to send
back a reply. Example, echo server:
import socket, traceback
host = ’’ # Bind to all interfaces
port = 51423
s = socket.socket(socket.AF_INET, socket.SOCK_DCRAM)
s. setsockopt(socket.SOL_SOCKET, socket.SO_REUSEADDR, l)
s.bind((host, port))
while l:
try:
message, address = s.recvfrom(8l92)
print “Cot data from”, address
s.sendto(message, address) #Echo it back
except (Keyboardlnterrupt, SystemExit):
raise
except:
traceback.print_exc()
In this post we have clarified some points in network servers.


About Me
Current Projects
My Setup
Contact
Tom Richardson's personal website, here you'll find contact information as well as whatever I happen to be working on at the current time. Feel free to get in touch with me if there's anything you'd like to ask!
Socialise
Contact me!
Use the form below and I'll get back ASAP!
Name
*
Email address
*
Message
*
Type the word
*
Send


| 1063 | (A) | than sayde that worthiliche wyfe in ane wode hungre |
| 1067 | (C) | ¶ And þanne sayde þat wofułł wyfe . in a wode hongur |
| 1050 | (D) | Than seyd this wif in þat wood hungur |
| 1030 | (E) | ¶ Thanne seyde wyf . in her wood hunger |
| (Ex) | ---- no text ---- | |
| 1088 | (L) | þan saiþ þat worþi wif in a wode hunger |
| 1002 | (P) | ? ?? ????? ???? ????? ??? in a wode ??ng?? |
| 1039 | (U) | Then saiden the wyf / in a wode hunger |
| 128 | (V) | þanne said þe worthy wif in woode hungre |


Records
A record is a Sigma type with named projections. The basic syntax looks like this:
\record R (p_1 : A_1) ... (p_n : A_n) {
| f_1 : B_1
...
| f_k : B_k
}
where f_1, … f_k and p_1, … p_n are fields of R. Note that records do not have parameters and p_1, … p_n are also fields of R. The only difference between p_i and f_j is that f_j are visible in the scope of R and p_i are not:
\func test1 => f_1
\func test2 => R.f_1
\func test3 => R.p_1
-- p_1 is not in scope in the following function:
-- \func test4 => p_1
It is also possible to write \field f_i : B_i instead of | f_i : B_i, but there is a difference between these notations, which is discussed below.
Fields can be accessed using projection functions:
\func test5 (x : R) => R.p_1 {x}
\func test6 (x : R) => f_1 {x}
An alternative way to access fields is provided by the following syntax:
\func test5' (x : R) => x.p_1
\func test6' (x : R) => x.f_1
This syntax is allowed only when the expression before . is a variable with an explicitly specified type which is a record. If x : R and f is a field of R, then x.f is equivalent to R.f {x}.
The type A_i can depend on variables p_1, … p_{i-1}. The type B_i can depend on variables p_1, … p_n and f_1, … f_{i-1}.
Records are essentially Sigma types. For example, the record R above is equivalent to the Sigma type \Sigma (p_1 : A_1) … (p_n : A_n) (f_1 : B_1) … (f_k : B_k).
Instances of type R can be created using new expression. Any of the variants of the syntax listed below can be used, they are all equivalent. See Class extensions for more information about new expressions and related constructions.
\func r1 => \new R a_1 ... a_n { | f_1 => b_1 ... | f_k => b_k }
\func r2 => \new R { | p_1 => a_1 ... | p_n => a_n | f_1 => b_1 ... | f_k => b_k }
\func r3 => \new R a_1 ... a_n b_1 ... b_k
\func r4 => \new R a_1 ... a_i { | p_{i+1} => a_{i+1} ... | p_n => a_n | f_1 => b_1 ... | f_k => b_k }
\func r5 => \new R a_1 ... a_n b_1 ... b_i { | f_{i+1} => b_{i+1} ... | f_k => b_k }
The same function can also be defined using copattern matching:
\func r6 : R \cowith
| p_1 => a_1
...
| p_n => a_n
| f_1 => b_1
...
| f_k => b_k
Records satisfy the eta rule. This means that the expression \new R r.p_1 … r.p_n r.f_1 … r.f_k is equivalent to r.
Properties
Some fields can be marked as a property. This is done by using the keyword \property instead of \field:
\record NegativeInt {
\field x : Int
\property isNeg : x < 0
}
The type of a property must be a proposition, otherwise the definition does not typecheck.
If A is a proposition, then | f : A is also marked as a property. In this case, f can be defined as a normal field, which is not a property, by writing \field f : A.
Properties do not evaluate. Thus, they are related to fields in the same way as lemmas are related to functions. For example, consider the following function:
\func test (x : Int) (p : x < 0) => isNeg {\new NegativeInt x p}
Then test x p evaluates to p if isNeg is not a property and does not evaluate if it is.
Extensions
An extension S of a record R is another record which adds some fields to R and implements some of the fields of R. The record R is called a super class of S and S is called a subclass of R. If R is the definition of a record from the beginning of this page, then an extension S of R can be defined as follows:
\record S (r_1 : D_1) ... (r_t : D_t) \extends R {
| g_1 : C_1
...
| g_m : C_m
| p_{i_1} => a_{i_1}
...
| p_{i_q} => a_{i_q}
| f_{j_1} => b_{j_1}
...
| f_{j_s} => b_{j_s}
}
Here expressions a_i and b_j have types A_i and B_j respectively. Expressions a_i and b_j may refer to any field of S, but implementations must not form a cycle.
The type S is a subtype of R. That is, every expression of type S is also of type R.
A record is equivalent to the Sigma type, consisting of all of its unimplemented fields. For example, consider the following records:
\record C (x y : Nat) {
| x<=y : x <= y
| y<=0 : y <= 0
}
\record D \extends C {
| y => x
| x<=y => <=-reflexive x
}
Then D is equivalent to \Sigma (x : Nat) (x <= 0):
\func fromD (d : D) : \Sigma (x : Nat) (x <= 0) => (d.x, d.y<=0)
\func toD (p : \Sigma (x : Nat) (x <= 0)) => \new D p.1 p.2
\func fromToD (d : D) : toD (fromD d) = d => idp
\func toFromD (p : \Sigma (x : Nat) (x <= 0)) : fromD (toD p) = p => idp
where idp is the proof by reflexivity. This works since both records and Sigma types satisfy eta rules.
A record can extend several records. If these records extend some base record themselves, then the fields of this base record will not be repeated in the final record. For example, consider the following records:
\record A (x : Nat)
\record B \extends A
\record C \extends A
\record D \extends B,C
Then D has a single field x. If super classes have fields with the same name which are not defined in some common super class, then the final record will have several different fields with the same name. In order to access these fields, fully qualified names should be used:
\record B (x : Nat)
\record C (x : Nat)
\record D \extends B,C
\func fromD (d : D) : \Sigma Nat Nat => (B.x {d}, C.x {d})
\func toD (p : \Sigma Nat Nat) => \new D p.1 p.2
\func fromToD (d : D) : toD (fromD d) = d => idp
\func toFromD (p : \Sigma Nat Nat) : fromD (toD p) = p => idp
This
Every field of a record R has additional implicit parameter of type R, which can be referred to with the keyword \this:
\record R (X : \Type) (t : X -> X)
\func f (r : R) => r.t
\record S \extends R {
| x : X
| p : f \this x = x
}
The keyword \this can appear only in arguments of definitions and only in those arguments, which in turn satisfy this condition.
Dynamic definitions
A function or a data type can be put inside a record definition:
\record R {
| n : Nat
\func f (x : Nat) => x Nat.+ n
}
Such a definition will have an addition implicit parameter of type R. Thus, the code above is equivalent to the following one:
\record R {
| n : Nat
} \where {
\func f {this : R} (x : Nat) => x Nat.+ this.n
}
Such functions and data types are called dynamic and can be accessed with the dot-syntax:
\func g (r : R) : Nat => r.f 1
Override
The type of a field or a property can be overridden with a subtype in a subclass using keyword \override:
\record R
\record S \extends R
\record A {
| f : R
}
\record B \extends A {
\override f : S
}
\default
A default implementation does not modify the record, but it will be used when a new instance is created if the implementation is not specified. Default implementations are defined with the \default keyword:
\record R
| f : Nat
| g : Nat
\record S \extends R {
\default f => 0
}
In this example, the type S is equivalent to R. An instance of S can be created as usual or the implementation of f can be omitted:
\func inst1 : S \cowith
| f => 1
| g => 2
\func inst2 : S \cowith
| g => 2
\func test1 : inst1.f = 1 => idp
\func test2 : inst2.f = 0 => idp
Defaullt implementations can be defined by pattern matching as usual:
\record R
| f : Nat -> Nat
\record S \extends R {
\default f (n : Nat) : Nat \with {
| 0 => 0
| suc n => n
}
}
In this case, a function with the same name as the field will be created in the namespace of the record. The name of the function can be changed with the \as keyword:
\record S' \extends R {
\default f \as fImpl (n : Nat) : Nat \with {
| 0 => 0
| suc n => n
}
}
Default implementations do not see each other by default. For example, the following code does not work:
\record R
| x : Nat
| p : x = 0
\record S \extends R {
\default x => 0
\default p => idp -- does not work
}
To fix this, the first default implementation must be given a name and in the second one its type must be explicitly specified:
\record S' \extends R {
\default x \as x' => 0
\default p : x' = 0 => idp
}
Default implementations can also be implemented in terms of each other:
\record R
| x : Nat
| y : Nat
\record S \extends R {
\default x => y
\default y => x
}
To define an instance of S, you need to specify one of the fields (or both):
\func test1 : S \cowith
| x => 0
\func test2 : S \cowith
| y => 1
\func test3 : S \cowith
| x => 2
| y => 3
Levels
It is possible to specify levels of a super class:
\record R
| A : \Type
| B : \1-Type
| C : \Type1
\record S \extends R (0,0)
Now, if we have s : S, then s.A : \Set0, s.B : \1-Type0, and s.C : \Set1.


{% extends "base.html" %}
{% block css %}
{{ block.super }}
{% endblock css %}
{% block content %}
{# ~~~~~~~~~~~~~~~~~~ WELCOME ~~~~~~~~~~~~~~~~~~~~ #}
Analyze spoken recordings for sentiment and topic, at scale.
Interacting with audio has
never been easier.
{# Subtitle #}


Your tweet was added
{% endif %}
{% if session['hasErrors'] == 'true' %}
Encountered Error. Couldn't add your tweet.
{% endif %}
| Tweeted at | Tweet text |
|---|---|
| {{ status.created_at }} | {{ status.text}} |
{% block body %}
| Tweeted at | Tweet text |
|---|---|
| {{ status.created_at }} | {{ status.text}} |
Sign in with twitter.
Sign IN {% endif %} {% endblock %}


QRef Server API Documentation
Alphabetic Index
Extra File Listing
Class Listing A-Z
- a
- AjaxRequest
- AjaxResponse
- AircraftChecklistFilter
- AircraftProductAuthorizationAttemptSchemaInternal
- AircraftChecklistItemSchemaInternal
- AircraftChecklistSectionSchemaInternal
- AircraftManufacturerSchemaInternal
- AircraftChecklistSchemaInternal
- AuthTokenSchemaInternal
- AircraftModelSchemaInternal
- AircraftModelsByManufacturerRoute
- AircraftChecklistsRoute
- AircraftChecklistRoute
- AircraftChecklistsByModelRoute
- AircraftManufacturersRoute
- AircraftModelsRoute
- AuthorizeAppleAircraftProductRoute
- AjaxRoute
- AuthorizeAppleProductRequest
- c
- p
- r
File Listing A-Z
- a
- AjaxResponse.coffee (serialization)
- AircraftChecklistFilter.coffee (security/filters)
- AircraftProductAuthorizationAttemptSchema.coffee (schema)
- AircraftChecklistItemSchema.coffee (schema)
- AircraftChecklistSectionSchema.coffee (schema)
- AircraftManufacturerSchema.coffee (schema)
- AircraftChecklistSchema.coffee (schema)
- AuthTokenSchema.coffee (schema)
- AircraftModelSchema.coffee (schema)
- AjaxRoute.coffee (router)
- c
- ChecklistManager.coffee (db/manager)
- CreateAircraftProductAjaxRequest.coffee (specification/request/ajax)
- CreateAircraftModelAjaxRequest.coffee (specification/request/ajax)
- CreateAircraftChecklistAjaxRequest.coffee (specification/request/ajax)
- CreateAircraftManufacturerAjaxRequest.coffee (specification/request/ajax)
- Callbacks.coffee (specification)
- d
- Dictionary.coffee (collections)
- l
- LoginRpcRequest.coffee (specification/request/rpc)
- p
- ProductManager.coffee (db/manager)
- ProductSchema.coffee (schema)
- ProductImageRpcRequest.coffee (specification/request/rpc)
- r
- RpcResponse.coffee (serialization)
- RestfulResponse.coffee (serialization)
- RecordFilter.coffee (security)
- RecoveryQuestionSchema.coffee (schema)
- RoleSchema.coffee (schema)
- Route.coffee (router)
- Router.coffee (router)
- RpcRoute.coffee (router)
- RegisterAccountRpcRequest.coffee (specification/request/rpc)
- RefreshTokenRpcRequest.coffee (specification/request/rpc)
- RouteMethod.coffee (specification)
- u
- UserAuth.coffee (security)
- UserProductSchema.coffee (schema)
- UserSchema.coffee (schema)
- UpdateAircraftChecklistAjaxRequest.coffee (specification/request/ajax)
- UpdateAircraftProductAjaxRequest.coffee (specification/request/ajax)
- UserRolesRpcRequest.coffee (specification/request/rpc)


Current textures
Current uniforms
Uniform details:
Name:Type:
Size:
Value:
Auto bound by game engine
Type of mesh
Camera
Rotate mesh
Directional Light
Rotation (Euler):Ambient light (RGB)
Shader name:
About:
About:


Navigator
To cash register
To main page (for authorized)
Work order ID
Product
Quantity
Back to kitchen
Ready to Leave?
×
Select "Logout" below if you are ready to end your current session.


{{ .Page.Scratch.Add "count_thm_proof" 1 }} {{ $label := printf "thm-proof-%d" (.Page.Scratch.Get "count_thm_proof") }}
Proof.


Enter Ingredients
Email address
This will be used to contact you regarding expiration.
Name
Ingredient Name
Expiration Date
Submit
Save Successful
×
Enter Email to View Current Ingredients
Email
Submit
Name
Ingredient Name
Email
Expiration Date
Delete
No Ingredients Entered
Name
Ingredient Name
Email
Expiration Date
Delete
Delete Successful
×


--- layout: post title: LeetCode Weekly Contest 174 (1337~1340) link: https://programcz.github.io/2020/02/06/LeetCode-Weekly-Contest-174-(1337-1340).html date: 2020-02-06 10:24:00 category: 个人博客 source: ProgramCZ's Blog description: LeetCode周赛专题每周日更新，点击标签CAT - LeetCode Weekly Contest查看更多。 1337. The K Weakest Rows in a Matrix #Easy 题目描述 Given a m * n matrix mat of ones (representi ---
LeetCode周赛专题每周日更新，点击标签CAT - LeetCode Weekly Contest
查看更多。
Given a m * n
matrix mat
of ones (representing soldiers) and zeros (representing civilians), return the indexes of the k
weakest rows in the matrix ordered from the weakest to the strongest.
A row i is weaker than row j, if the number of soldiers in row i is less than the number of soldiers in row j, or they have the same number of soldiers but i is less than j. Soldiers are always stand in the frontier of a row, that is, always ones may appear first and then zeros.
Example 1:
Input: mat =
[[1,1,0,0,0],
[1,1,1,1,0],
[1,0,0,0,0],
[1,1,0,0,0],
[1,1,1,1,1]],
k = 3
Output: [2,0,3]
Explanation:
The number of soldiers for each row is:
row 0 -> 2
row 1 -> 4
row 2 -> 1
row 3 -> 2
row 4 -> 5
Rows ordered from the weakest to the strongest are [2,0,3,1,4]
Example 2:
Input: mat =
[[1,0,0,0],
[1,1,1,1],
[1,0,0,0],
[1,0,0,0]],
k = 2
Output: [0,2]
Explanation:
The number of soldiers for each row is:
row 0 -> 1
row 1 -> 4
row 2 -> 1
row 3 -> 1
Rows ordered from the weakest to the strongest are [0,2,3,1]
Constraints:
m == mat.length
n == mat[i].length
2 <= n, m <= 100
1 <= k <= m
matrix[i][j]
is either 0 or 1.首先按行遍历mat
，统计第i
行中1
的个数cnt
，将cnt
和i
以pair<int, int>
的形式存放到优先队列pq
中，同时保证pq
的大小不超过k
，从而始终保存前k
个最弱的行，最后将pq
中的行号提取出来即可。
class Solution {
public:
using pii = pair<int, int>;
vector<int> kWeakestRows(vector<vector<int>>& mat, int k) {
int m = mat.size(), n = mat[0].size();
priority_queue<pii> pq;
for (int i = 0; i < m; ++i) {
int cnt = 0, j = 0;
while (j < n && mat[i][j++] != 0) ++cnt;
pq.push({cnt, i});
if (pq.size() > k) pq.pop();
}
vector<int> res;
for (int i = 0; i < k; ++i) {
pii p = pq.top(); pq.pop();
res.push_back(p.second);
}
reverse(res.begin(), res.end());
return res;
}
};
Given an array arr
. You can choose a set of integers and remove all the occurrences of these integers in the array.
Return the minimum size of the set so that at least half of the integers of the array are removed.
Example 1:
Input: arr = [3,3,3,3,5,5,5,2,2,7]
Output: 2
Explanation: Choosing {3,7} will make the new array [5,5,5,2,2] which has size 5 (i.e equal to half of the size of the old array).
Possible sets of size 2 are {3,5},{3,2},{5,2}.
Choosing set {2,7} is not possible as it will make the new array [3,3,3,3,5,5,5] which has size greater than half of the size of the old array.
Example 2:
Input: arr = [7,7,7,7,7,7]
Output: 1
Explanation: The only possible set you can choose is {7}. This will make the new array empty.
Example 3:
Input: arr = [1,9]
Output: 1
Example 4:
Input: arr = [1000,1000,3,7]
Output: 1
Example 5:
Input: arr = [1,2,3,4,5,6,7,8,9,10]
Output: 5
Constraints:
1 <= arr.length <= 10^5
arr.length
is even.1 <= arr[i] <= 10^5
首先声明unordered_map
类型的m
，用于存放数组arr
中每个数组出现的次数，然后将m
中的行号提取出来存放到数组cnt
中，将cnt
从大到小进行排序并遍历求和，在此过程中统计个数存放到res
中，直到sum
超过arr
大小的一半。
class Solution {
public:
int minSetSize(vector<int>& arr) {
if (arr.size() < 2) return 1;
unordered_map<int, int> m;
for (auto num : arr)
++m[num];
vector<int> cnt;
for (auto p : m)
cnt.push_back(p.second);
sort(cnt.rbegin(), cnt.rend());
int res = 0, sum = 0, j = 0;
while (j < cnt.size() && sum < arr.size()/2) {
sum += cnt[j++];
++res;
}
return res;
}
};
Given a binary tree root
. Split the binary tree into two subtrees by removing 1 edge such that the product of the sums of the subtrees are maximized.
Since the answer may be too large, return it modulo 10^9 + 7.
Example 1:
Input: root = [1,2,3,4,5,6]
Output: 110
Explanation: Remove the red edge and get 2 binary trees with sum 11 and 10. Their product is 110 (11*10)
Example 2:
Input: root = [1,null,2,3,4,null,null,5,6]
Output: 90
Explanation: Remove the red edge and get 2 binary trees with sum 15 and 6.Their product is 90 (15*6)
Example 3:
Input: root = [2,3,9,10,7,8,6,5,4,11,1]
Output: 1025
Example 4:
Input: root = [1,1]
Output: 1
Constraints:
50000
nodes and at least 2
nodes.[1, 10000]
.首先，第一次递归遍历二叉树，在此过程中将每个节点的值更改为以该节点为根节点的树的和；其次，第二次递归遍历二叉树，在此过程中将每个节点作为分割点，计算两个子树的和的积，即node->val
和sum-node->val
的积，将最大值存入res
中；最后，返回res
即可。
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
const long long MOD = 1e9 + 7;
int maxProduct(TreeNode* root) {
helper1(root);
long long sum = root->val, res = 0;
helper2(root, sum, res);
return res % MOD;
}
void helper1(TreeNode *node) {
if (!node->left && !node->right) return;
if (node->left) {
helper1(node->left);
node->val += node->left->val;
}
if (node->right) {
helper1(node->right);
node->val += node->right->val;
}
}
void helper2(TreeNode *node, int sum, long long &res) {
if (!node) return;
long long u = node->val, v = sum - u;
res = max(res, u*v);
if (node->left) helper2(node->left, sum, res);
if (node->right) helper2(node->right, sum, res);
}
};
Given an array of integers arr
and an integer d
. In one step you can jump from index i
to index:
i + x
where: i + x < arr.length
and 0 < x <= d
.i - x
where: i - x >= 0
and 0 < x <= d
.In addition, you can only jump from index i
to index j
if arr[i] > arr[j]
and arr[i] > arr[k]
for all indices k
between i
and j
(More formally min(i, j) < k < max(i, j)
).
You can choose any index of the array and start jumping. Return the maximum number of indices
you can visit.
Notice that you can not jump outside of the array at any time.
Example 1:
Input: arr = [6,4,14,6,8,13,9,7,10,6,12], d = 2
Output: 4
Explanation: You can start at index 10. You can jump 10 --> 8 --> 6 --> 7 as shown.
Note that if you start at index 6 you can only jump to index 7. You cannot jump to index 5 because 13 > 9. You cannot jump to index 4 because index 5 is between index 4 and 6 and 13 > 9.
Similarly You cannot jump from index 3 to index 2 or index 1.
Example 2:
Input: arr = [3,3,3,3,3], d = 3
Output: 1
Explanation: You can start at any index. You always cannot jump to any index.
Example 3:
Input: arr = [7,6,5,4,3,2,1], d = 1
Output: 7
Explanation: Start at index 0. You can visit all the indicies.
Example 4:
Input: arr = [7,1,7,1,7,1], d = 2
Output: 2
Example 5:
Input: arr = [66], d = 1
Output: 1
Constraints:
1 <= arr.length <= 1000
1 <= arr[i] <= 10^5
1 <= d <= arr.length
首先，维护数组dp
，其中第i
个值表示从i
开始能跳的最大次数；其次，使用递归函数helper
：
如果dp[idx]
不为初始值-1
，则说明之前维护过，可以直接返回其值。
将dp[idx]
赋值为1
，因为每个柱子都会作为起点至少跳一次。
分别向右侧和左侧遍历，不断维护dp[idx]
的值。
最后，返回dp
中的最大值即可。
class Solution {
public:
int maxJumps(vector<int>& arr, int d) {
array<int, 1000> dp;
fill(dp.begin(), dp.end(), -1);
int res = INT_MIN;
for (int i = 0; i < arr.size(); ++i)
res = max(res, helper(arr, dp, i, d));
return res;
}
int helper(const vector<int> &arr, array<int, 1000> &dp, int idx, int d) {
if (dp[idx] != -1) return dp[idx];
dp[idx] = 1;
for (int i = idx+1; i < arr.size() && i <= idx+d && arr[i] < arr[idx]; ++i)
dp[idx] = max(dp[idx], 1+helper(arr, dp, i, d));
for (int i = idx-1; i >= 0 && i >= idx-d && arr[i] < arr[idx]; --i)
dp[idx] = max(dp[idx], 1+helper(arr, dp, i, d));
return dp[idx];
}
};


Save time, be on the move Download it on Google Play, sign up and tap on the map to show your location, enter your destination and you're ready to go.


A function type that creates a Template from a TemplateResult.
This is a hook into the template-creation process for rendering that requires some modification of templates before they're used, like ShadyCSS, which must add classes to elements and remove styles.
Templates should be cached as aggressively as possible, so that many TemplateResults produced from the same expression only do the work of creating the Template the first time.
Templates are usually cached by TemplateResult.strings and TemplateResult.type, but may be cached by other keys if this function modifies the template.
Note that currently TemplateFactories must not add, remove, or reorder expressions, because there is no way to describe such a modification to render() so that values are interpolated to the correct place in the template instances.
A placeholder for a dynamic expression in an HTML template.
There are two built-in part types: AttributePart and NodePart. NodeParts always represent a single dynamic expression, while AttributeParts may represent as many expressions are contained in the attribute.
A Template's parts are mutable, so parts can be replaced or modified
(possibly to implement different template semantics). The contract is that
parts can only be replaced, not removed, added or reordered, and parts must
always consume the correct number of values in their update()
method.
TODO(justinfagnani): That requirement is a little fragile. A TemplateInstance could instead be more careful about which values it gives to Part.update().
The first argument to JS template tags retain identity across multiple calls to a tag for the same literal, so we can cache work done per literal in a Map.
Safari currently has a bug which occasionally breaks this behaviour, so we need to cache the Template at two levels. We first cache the TemplateStringsArray, and if that fails, we cache a key constructed by joining the strings array.
Suffix appended to all bound attribute names.
True if the custom elements polyfill is in use.
This regex extracts the attribute name preceding an attribute-position expression. It does this by matching the syntax allowed for attributes against the string literal directly preceding the expression, assuming that the expression is in an attribute-value position.
See attributes in the HTML spec: https://www.w3.org/TR/html5/syntax.html#attributes-0
"\0-\x1F\x7F-\x9F" are Unicode control characters
" \x09\x0a\x0c\x0d" are HTML space characters: https://www.w3.org/TR/html5/infrastructure.html#space-character
So an attribute is:
An expression marker with embedded unique key to avoid collision with possible text in templates.
A sentinel value that signals that a value was handled by a directive and should not be written to the DOM.
An expression marker used text-positions, multi-binding attributes, and attributes with markup-like text values.
A sentinel value that signals a NodePart to fully clear its content.
Brands a function as a directive factory function so that lit-html will call the function during template rendering, rather than passing as a value.
A directive is a function that takes a Part as an argument. It has the
signature: (part: Part) => void
.
A directive factory is a function that takes arguments for data and configuration and returns a directive. Users of directive usually refer to the directive factory as the directive. For example, "The repeat directive".
Usually a template author will invoke a directive factory in their template with relevant arguments, which will then return a directive function.
Here's an example of using the repeat()
directive factory that takes an
array and a function to render an item:
html`<ul><${repeat(items, (item) => html`<li>${item}</li>`)}</ul>`
When repeat
is invoked, it returns a directive function that closes over
items
and the template function. When the outer template is rendered, the
return directive function is called with the Part for the expression.
repeat
then performs it's custom logic to render multiple items.
The directive factory function. Must be a function that returns a
function of the signature (part: Part) => void
. The returned function will
be called with the part object.
Interprets a template literal as an HTML template that can efficiently render to and update a container.
Removes nodes, starting from start
(inclusive) to end
(exclusive), from
container
.
Renders a template to a container.
To update a container with new values, reevaluate the template literal and
call render
with the new result.
a TemplateResult created by evaluating a template tag like
html
or svg
.
A DOM parent to render to. The entire contents are either replaced, or efficiently updated if the same result type was previous rendered there.
RenderOptions for the entire render tree rendered to this container. Render options must not change between renders to the same container, as those changes will not effect previously rendered DOM.
Reparents nodes, starting from start
(inclusive) to end
(exclusive),
into another container (could be the same container), before before
. If
before
is null, it appends the nodes to the container.
Interprets a template literal as an SVG template that can efficiently render to and update a container.
The default TemplateFactory which caches Templates keyed on result.type and result.strings.
Generated using TypeDoc
Main lit-html module.
Main exports:


TradTuneDb has been developed by Bayswater Software.
You may like to add further music genres, or perhaps you have other suggestions for improvement or new features. Please contact us and your request will be considered.
@(message: String)(implicit lang: Lang, userName: Option[String]) @import snippets._ @main("contact us", None, userName, navigation("home")(userName)) {
TradTuneDb has been developed by Bayswater Software.
You may like to add further music genres, or perhaps you have other suggestions for improvement or new features. Please contact us and your request will be considered.


The stream of data available from agricultural fields include data collected from farm machinery during normal farm operations such as seeding, spraying, and harvesting. Additionally, there is a vast amount of data available from remotely sensed satellite or sensor data. See the OFPE package documentation for details on specific classes, functions, and processes.
The OFPE project focuses on winter wheat yield and protein as response variables and nitrogen fertilizer or seed rates as explanatory variables, depending on whether the field is farmed conventionally or organically, respectively. These data are collected from the farm machinery as ESRI Shapefiles, barring CropScan protein data that is gathered as a comma-separated values file. These .csv files can be visualized using this web application. These data can be batch uploaded to the database through a script that automatically identifies and organizes each upload. The data is first queried against the boundaries of the farms to identify the farmer, after which the field and year the data was gathered is searched for within the data. The type of data is then identified to determine what table within the farmer’s schema the data will stored.
The process for importing on-farm data to the database is outlined in the activity diagram below (Figure 1), and covers the pre-processing to the data upload steps.
Remote sensing data is collected from Google Earth Engine and includes data temporally variable data such as weather and static data such as topogrophy. The user is responsible for running the Google Earth Engine Javascript code to download data for each year required. See this tutorial for adding farm boundaries to GEE as asset and this tutorial for editing and using Javascript code.
This data is downloaded to Google Drive, where the data can be batch uploaded to the database. See this tutorial for setting up Google Drive to receive your data from Google Earth Engine.
The process for importing Google Earth Engine data to the database is outlined in the activity diagram below (Figure 3), and requires the external step of running the script in Google Earth Engine.
A component diagram outlining the R6 classes used and the inputs required for the import of data from farms and from Google Earth Engine is represented below in Figure 4. Each class is represented by a table with the title of the class as the header, with the first row showing inputs, the second row showing public methods, the third row showing private methods, and an optional fourth row showing any tangible outputs from the class. Most methods have nothing to return as their functions modify the OFPE database.


They are ill discoverers that think
there is no land, when they can see
nothing but sea.
there is no land, when they can see
nothing but sea.
Hello.
I am Harbour, a super-cool Tumblr theme for writers
who like to share their musings with the world.
I am Harbour, a super-cool Tumblr theme for writers
who like to share their musings with the world.
rocking horse
Do you remember the rocking horse
We played on as children? I do.
Its body was a plastic hollow,
Sturdy enough to carry the weight
Of our tiny frames. We would lock
In our trusting feet to its metal stirrups,
And away we would go, up and down,
On the spot, into the far off distance
In our heads. And ever since,
So it seems, I have been riding
The same old rocking horse, going
Nowhere, really, fixed in the same
Old motion, up and down, up and down,
Galloping across the vast
Expanse of my imagination to nowhere.
We played on as children? I do.
Its body was a plastic hollow,
Sturdy enough to carry the weight
Of our tiny frames. We would lock
In our trusting feet to its metal stirrups,
And away we would go, up and down,
On the spot, into the far off distance
In our heads. And ever since,
So it seems, I have been riding
The same old rocking horse, going
Nowhere, really, fixed in the same
Old motion, up and down, up and down,
Galloping across the vast
Expanse of my imagination to nowhere.
"Our love is in a coma, being kept alive artificially, by a ventilator of memories."


Dear {{ user.username }},
Welcome to Flask!
To confirm your account please click on the following link:
{{ url_for('auth.change_email', token=token, _external=True) }}
Sincerely,
The Flask Team
Note: replies to this email address are not monitored.


To view this video please enable JavaScript, and consider upgrading to a web browser that supports HTML5 video


Jeanne M. Liedtka, Timothy Ogilvie,
Unread
Technical note, through Darden Business Publishing, from the University of Virginia, detailing different design tools for growth and innovation.


Accepting a JSON Request Body¶
A common need when building a restful API is the ability to accept a JSON encoded entity from the request body.
An example for such an API could be a blog post creation.
Example API¶
In this example we will create an API for creating a blog post. The following is a spec of how we want it to work.
Request¶
In the request we send the data for the blog post as a JSON object. We also
indicate that using the Content-Type
header:
POST /blog/posts
Accept: application/json
Content-Type: application/json
Content-Length: 57
{"title":"Hello World!","body":"This is my first post!"}
Response¶
The server responds with a 201 status code, telling us that the post was
created. It tells us the Content-Type
of the response, which is also
JSON:
HTTP/1.1 201 Created
Content-Type: application/json
Content-Length: 65
Connection: close
{"id":"1","title":"Hello World!","body":"This is my first post!"}
Parsing the request body¶
The request body should only be parsed as JSON if the Content-Type
header
begins with application/json
. Since we want to do this for every request,
the easiest solution is to use an application before middleware.
We simply use json_decode
to parse the content of the request and then
replace the request data on the $request
object:
use Symfony\Component\HttpFoundation\Request;
use Symfony\Component\HttpFoundation\ParameterBag;
$app->before(function (Request $request) {
if (0 === strpos($request->headers->get('Content-Type'), 'application/json')) {
$data = json_decode($request->getContent(), true);
$request->request->replace(is_array($data) ? $data : array());
}
});
Controller implementation¶
Our controller will create a new blog post from the data provided and will
return the post object, including its id
, as JSON:
use Symfony\Component\HttpFoundation\Request;
use Symfony\Component\HttpFoundation\Response;
$app->post('/blog/posts', function (Request $request) use ($app) {
$post = array(
'title' => $request->request->get('title'),
'body' => $request->request->get('body'),
);
$post['id'] = createPost($post);
return $app->json($post, 201);
});
Manual testing¶
In order to manually test our API, we can use the curl
command line
utility, which allows sending HTTP requests:
$ curl http://blog.lo/blog/posts -d '{"title":"Hello World!","body":"This is my first post!"}' -H 'Content-Type: application/json'
{"id":"1","title":"Hello World!","body":"This is my first post!"}


Interest in React has been exploding recently, so it's a good time to explore some great recent tutorials and videos that cover getting started.
Ryan Clark provides a great overview of the basics of React with the goal of building a really simple dropdown nav.
Formidable Labs and Seattle JS recently hosted a series of React, Flux, and Flow workshops, and the first part is available to watch online:
AEFlash writes up some best practices and tips to help you avoid potential pitfalls when developing with React.
Black Mutt Media takes us through their usage of React and Ruby to build an autocomplete field, and some of the pitfalls they encountered along the way.
Our own Sebastian Markbåge was on the Web Platform Podcast to have a chat about all aspects of React.
Formidable Labs have been busy, as they've alsojust launched Radium, a React component that provides you with the ability to use inline styles instead of CSS. They're also looking for some help contributing to a Radium Bootstrap implementation.
Reactiflux.com is a new Slack community based around (you guessed it!) React, and Flux.
React Week is a week-long learning workshop, happening next week, for React, Flux, and other related technologies, run by Ryan Florence.
Babel-sublime is a new package which provides Sublime with language definitions for ES6 JavaScript with React JSX syntax extensions.
react-meteor, a package that replaces the default templating system of the Meteor platform with React, recently received a big update.
Rich Manalang from Atlassian explains why they rebuilt their HipChat web client from scratch using React, and how they're already using it to rebuild their native desktop clients.
Andrew Hillel of the BBC gives an excellent and thorough breakdown of the stack they used to rebuild their homepage, with React as an integral part of the front-end.
A team from New Zealand called Atomic is building web and mobile prototyping and design tools entirely in-browser, and as co-founder Darryl Gray says, "React.js "totally changed" the fact that browser performance often wasn't good enough for complex tools like this.".
Polarr have rebuilt their browser-based photo editor with React.
F8 2015 is just around the corner, and you can sign up for the video streams in advance because we're sure to be covering all things React.
|
|
|
|


Hey guys! I'm excited to start learning coding, but here are some other things I also like to do to fill up by free time in quarantine!
I am much more of a hardware than a software guy, and one of the things I love to do is work on assembling, troubleshooting, and benchmarking custom PCs (I run a 5820k, 980Ti, 16gb ram, and 2 NVME SSDs!) Hit me up for some BF4 or CS:GO!
Here are some essential parts of every computer!
One of the things I like to do on my custom PC is modeling up parts to 3D print with Fusion 360 (or maybe nabbing a good one off thingiverse!) I use a Prusa MK3S (pretty proud of assembling it myself!)
Many people are confused on how the printer works, so here are the five basic steps of printing:
P.S. If someone else with a printer sees this, check out this cool site that converts 2D objects to STL files!
Another thing I do on my computer is graphic design with Photoshop - mostly personal stuff like stickers that I print out on sticker paper, but also things like club shirt designs every now and then.
Something I picked up over quarantine was riding a Onewheel! It's very fun and gets me outside (away from my PC ( ͡° ͜ʖ ͡°)). It's like an electric skateboard, but it has only one go-kart wheel in the middle (so you look like you're "floating" ) which allows it to go offroad and be more maneuverable.
 so I made a table comparing the advantages of both:
| Onewheel | Quieter | Cheaper | Smaller | Goes on sidewalks | A lot more fun! |
|---|---|---|---|---|---|
| Car | Wayyy Faster | More range | More storage capacity | You can leave it unattended easily | You can bring friends! |
Here, I present some of my most innovative, most complex coding operations! I present: buttons & canvases!
Foreground: Background:


Subject ID: {{information.id}}
Full Name: {{information.title}} {{information.firstname}} {{information.middlename}} {{information.lastname}} {{information.suffix}}
Reader ID: {{information.readerID}}
Start Date: {{information.start}}
End Date: {{information.end}}
Gender: {{information.gender}}
Age: {{information.age}}
Height: {{information.height}}
Weight: {{information.weight}}
Address:
{{information.address.street1}}
{{information.address.street2}}
{{information.address.city}} , {{information.address.state}}. {{information.address.zip}}
Primary Phone: {{information.phone1.areacode}} {{information.phone1.phone}}
Secondary Phone: {{information.phone2.areacode}} {{information.phone2.phone}}
Primary email: {{information.email1}}
Secondary email: {{information.email2}}
Name: {{information.contact1.firstname}} {{information.contact1middlename}} {{information.contact1lastname}}
Relationship: {{information.contact1.relationship}}
Phone: {{information.contact1.areacode}}-{{information.contact1.phone}}
Name: {{information.contact2.firstname}} {{information.contact2.middlename}} {{information.contact2.lastname}}
Relationship: {{information.contact2.relationship}}
Phone: {{information.contact2.areacode}}-{{information.contact2.phone}}
An interactive pie chart goes here
A line graph goes here
Subject ID:
First Name:
Middle Initial:
Last Name:
Reader:
Start Date:
End Date:
Age:
Height:
Weight:
Phone:
Phone2:
Address:
Address 2:
City:
State:
Zip Code:
First Name:
First Name:
M.I.:
M.I.:
Last Name:
Last Name:
Relationship:
Relationship:
Phone:
Phone:


sealed class StableStatus<out T : Any> : LoadStatus<T>
Statuses where there's no pending action in the store or cache
| lastStableStatus |
open val lastStableStatus: StableStatus<T>
The latest stable status of the cache or store |
| Empty |
object Empty : StableStatus<Nothing>
The status when a cache or store has nothing in it |
| Loaded |
data class Loaded<out T : Any> : StableStatus<T>
The status when the cache or store has something in it |