| 1 |
Pan_H_2014 |
Comparison of the Effects of Air Pollution on Outpatient and Inpatient Visits for Asthma: A Population-Based Study in Taiwan |
Pan, Hui-Hsien; Chen, Chun-Tzu; Sun, Hai-Lun; Ku, Min-Sho; Liao, Pei-Fen; Lu, Ko-Hsiu; Sheu, Ji-Nan; Huang, Jing-Yang; Pai, Jar-Yuan; Lue, Ko-Huang |
2014 |
2014-05-01 |
COMM-USE |
N |
PMC4006842 |
24789041.0 |
10.1371/journal.pone.0096190 |
rtn2tr7t |
0.903986 |
|
Yap_J_2019 |
| 2 |
Zhang_2007 |
A health-based assessment of particulate air pollution in urban areas of Beijing in 2000–2004 |
Zhang, Minsi; Song, Yu; Cai, Xuhui |
2007 |
2007-04-15 |
PMC |
N |
PMC7119316 |
17316765.0 |
10.1016/j.scitotenv.2007.01.085 |
bjv6xnqp |
0.810871 |
|
Yap_J_2019, Hu_W_2018, Amoatey_2018, Wang_2020 |
| 3 |
Cui_Y_2003 |
Air pollution and case fatality of SARS in the People's Republic of China: an ecologic study |
Cui, Yan; Zhang, Zuo-Feng; Froines, John; Zhao, Jinkou; Wang, Hua; Yu, Shun-Zhang; Detels, Roger |
2003 |
2003-11-20 |
PMC |
N |
PMC293432 |
14629774.0 |
10.1186/1476-069x-2-15 |
1ul8owic |
0.798204 |
|
Hu_W_2018 |
| 4 |
Burr_2018 |
The Oakville Oil Refinery Closure and Its Influence on Local Hospitalizations: A Natural Experiment on Sulfur Dioxide |
Burr, Wesley S.; Dales, Robert; Liu, Ling; Stieb, Dave; Smith-Doiron, Marc; Jovic, Branka; Kauri, Lisa Marie; Shin, Hwashin Hyun |
2018 |
2018-09-17 |
COMM-USE |
N |
PMC6163796 |
30227660.0 |
10.3390/ijerph15092029 |
cczok8ze |
0.779194 |
|
Nenna_2017, Yap_J_2019 |
| 5 |
Kim_H_2017 |
Recent increase of surface particulate matter concentrations in the Seoul Metropolitan Area, Korea |
Kim, Hyun Cheol; Kim, Soontae; Kim, Byeong-Uk; Jin, Chun-Sil; Hong, Songyou; Park, Rokjin; Son, Seok-Woo; Bae, Changhan; Bae, MinAh; Song, Chang-Keun; Stein, Ariel |
2017 |
2017-07-05 |
COMM-USE |
N |
PMC5498658 |
28680054.0 |
10.1038/s41598-017-05092-8 |
f14wccj3 |
0.776859 |
|
Hu_W_2018, Zhang_2007, To_W_2014 |
| 6 |
Liao_2011 |
Fluctuation analysis-based risk assessment for respiratory virus activity and air pollution associated asthma incidence |
Liao, Chung-Min; Hsieh, Nan-Hung; Chio, Chia-Pin |
2011 |
2011-08-15 |
PMC |
N |
PMC7112072 |
21663946.0 |
10.1016/j.scitotenv.2011.04.056 |
069keqh8 |
0.732401 |
Chen_2017, Amoatey_2018 |
Nenna_2017 |
| 7 |
Yap_J_2019 |
Particulate air pollution on cardiovascular mortality in the tropics: impact on the elderly |
Yap, Jonathan; Ng, Yixiang; Yeo, Khung Keong; Sahlén, Anders; Lam, Carolyn Su Ping; Lee, Vernon; Ma, Stefan |
2019 |
2019-04-18 |
COMM-USE |
N |
PMC6471752 |
30999903.0 |
10.1186/s12940-019-0476-4 |
k86b1fli |
0.720874 |
|
Nenna_2017, Chen_2017, Leitte_2010 |
| 8 |
Thach_2010 |
Daily visibility and mortality: Assessment of health benefits from improved visibility in Hong Kong |
Thach, Thuan-Quoc; Wong, Chit-Ming; Chan, King-Pan; Chau, Yuen-Kwan; Chung, Yat-Nork; Ou, Chun-Quan; Yang, Lin; Hedley, Anthony J. |
2010 |
2010-08-31 |
None |
N |
PMC7094411 |
20627276.0 |
10.1016/j.envres.2010.05.005 |
dwm15txy |
0.688836 |
|
To_W_2014, Yap_J_2019 |
| 9 |
Sasidharan_2020 |
A vulnerability-based approach to human-mobility reduction for countering COVID-19 transmission in London while considering local air quality |
Manu Sasidharan; Ajit Singh; Mehran Eskandari Torbaghan; Ajith Kumar Parlikad |
2020 |
2020-04-17 |
BioRxiv |
Y |
|
|
10.1101/2<IP_ADDRESS>60798 |
i4o134ok |
0.670242 |
|
|
| 10 |
Masiol_2016 |
Source apportionment of wide range particle size spectra and black carbon collected at the airport of Venice (Italy) |
Masiol, Mauro; Vu, Tuan V.; Beddows, David C.S.; Harrison, Roy M. |
2016 |
2016-08-31 |
PMC |
N |
PMC7108445 |
|
10.1016/j.atmosenv.2016.05.018 |
qonybbux |
0.635897 |
|
Leitte_2010, Madhwal_2020, Liu_X_2011, Uk_Lee_2004 |
| 11 |
Wang_2020 |
Severe air pollution events not avoided by reduced anthropogenic activities during COVID-19 outbreak |
Wang, Pengfei; Chen, Kaiyu; Zhu, Shengqiang; Wang, Peng; Zhang, Hongliang |
2020 |
2020-07-31 |
PMC |
N |
PMC7151380 |
|
10.1016/j.resconrec.2020.104814 |
ubm8j1xe |
0.624286 |
|
|
| 12 |
Ogen_2020 |
Assessing nitrogen dioxide (NO2) levels as a contributing factor to coronavirus (COVID-19) fatality |
Ogen, Yaron |
2020 |
2020-07-15 |
PMC |
Y |
|
|
10.1016/j.scitotenv.2020.138605 |
u4doukk7 |
0.603581 |
|
|
| 13 |
Farhat_2013 |
Ozone Is Associated With an Increased Risk of Respiratory Exacerbations in Patients With Cystic Fibrosis |
Farhat, Sylvia C.L.; Almeida, Marina B.; Silva-Filho, Luiz Vicente. R.F.; Farhat, Juliana; Rodrigues, Joaquim C.; Braga, Alfésio L.F. |
2013 |
2013-10-31 |
PMC |
N |
|
|
10.1378/chest.12-2414 |
avi9lqd9 |
0.589467 |
Liao_2011 |
|
| 14 |
Leitte_2010 |
Size-Segregated Particle Number Concentrations and Respiratory Emergency Room Visits in Beijing, China |
Leitte, Arne Marian; Schlink, Uwe; Herbarth, Olf; Wiedensohler, Alfred; Pan, Xiao-Chuan; Hu, Min; Richter, Matthia; Wehner, Birgit; Tuch, Thomas; Wu, Zhijun; Yang, Minjuan; Liu, Liqun; Breitner, Susanne; Cyrys, Josef; Peters, Annette; Wichmann, H.-Erich; Franck, Ulrich |
2010 |
2010-11-30 |
COMM-USE |
N |
PMC3080933 |
21118783.0 |
10.1289/ehp.1002203 |
kgaglp72 |
0.569062 |
Chen_2017, Liao_2011, Amoatey_2018 |
Yap_J_2019, Chen_2017, Nenna_2017, Xia_T_2016 |
| 15 |
Nenna_2017 |
Respiratory syncytial virus bronchiolitis, weather conditions and air pollution in an Italian urban area: An observational study |
Nenna, Raffaella; Evangelisti, Melania; Frassanito, Antonella; Scagnolari, Carolina; Pierangeli, Alessandra; Antonelli, Guido; Nicolai, Ambra; Arima, Serena; Moretti, Corrado; Papoff, Paola; Villa, Maria Pia; Midulla, Fabio |
2017 |
2017-10-31 |
PMC |
N |
PMC7125886 |
28647513.0 |
10.1016/j.envres.2017.06.014 |
ttfmm946 |
0.536474 |
Liao_2011 |
|
| 16 |
Tobías_2020 |
Changes in air quality during the lockdown in Barcelona (Spain) one month into the SARS-CoV-2 epidemic |
Tobías, Aurelio; Carnerero, Cristina; Reche, Cristina; Massagué, Jordi; Via, Marta; Minguillón, María Cruz; Alastuey, Andrés; Querol, Xavier |
2020 |
2020-04-11 |
PMC |
Y |
|
|
10.1016/j.scitotenv.2020.138540 |
9f2kv1so |
0.519015 |
Hao_J_2014, Masiol_2014 |
Wang_2020, Masiol_2014 |
| 17 |
To_W_2014 |
Association between energy use and poor visibility in Hong Kong SAR, China |
To, W.M. |
2014 |
2014-04-15 |
PMC |
N |
PMC7117059 |
|
10.1016/j.energy.2014.02.062 |
34vgo3q5 |
0.500052 |
Hao_J_2014, Amoatey_2018, Masiol_2014 |
Yuan_2014 |
| 18 |
Bailey_2018 |
Molecular surveillance of respiratory viruses with bioaerosol sampling in an airport |
Bailey, Emily S.; Choi, Jessica Y.; Zemke, Juliana; Yondon, Myagmarsukh; Gray, Gregory C. |
2018 |
2018-09-17 |
COMM-USE |
N |
PMC6142699 |
30237898.0 |
10.1186/s40794-018-0071-7 |
aml84iv1 |
0.461638 |
|
|
| 19 |
Lin_Y_2013 |
Comparing ozone metrics on associations with outpatient visits for respiratory diseases in Taipei Metropolitan area |
Lin, Yu-Kai; Chang, Shuenn-Chin; Lin, ChitSan; Chen, Yi-Chun; Wang, Yu-Chun |
2013 |
2013-06-30 |
None |
N |
PMC7127381 |
23333210.0 |
10.1016/j.envpol.2012.12.010 |
frrl6hs6 |
0.453863 |
|
Pan_H_2014, Yap_J_2019 |
| 20 |
Pansini_2020 |
Initial evidence of higher morbidity and mortality due to SARS-CoV-2 in regions with lower air quality |
Riccardo Pansini; Davide Fornacca |
2020 |
2020-04-07 |
BioRxiv |
Y |
|
|
10.1101/2<IP_ADDRESS>53595 |
7edmbp1o |
0.420596 |
|
|
| 21 |
Ling_2013 |
Establishing a conceptual model for photochemical ozone pollution in subtropical Hong Kong |
Ling, Z.H.; Guo, H.; Zheng, J.Y.; Louie, P.K.K.; Cheng, H.R.; Jiang, F.; Cheung, K.; Wong, L.C.; Feng, X.Q. |
2013 |
2013-09-30 |
PMC |
N |
|
|
10.1016/j.atmosenv.2012.09.051 |
2ensoxl9 |
0.384169 |
Hao_J_2014, Chandrappa_2015 |
Zhang_2015 |
| 22 |
Madhwal_2020 |
Ambient bioaerosol distribution and associated health risks at a high traffic density junction at Dehradun city, India |
Madhwal, Sandeep; Prabhu, Vignesh; Sundriyal, Sangeeta; Shridhar, Vijay |
2020 |
2020-02-22 |
PMC |
N |
PMC7087893 |
32086610.0 |
10.1007/s10661-020-8158-9 |
y47p1c15 |
0.373141 |
Hao_J_2014, Amoatey_2018, Heo_K_2017, Moon_2013 |
Van_Leuken_2016, Saini_2011 |
| 23 |
Xia_T_2016 |
Pulmonary diseases induced by ambient ultrafine and engineered nanoparticles in twenty-first century |
Xia, Tian; Zhu, Yifang; Mu, Lina; Zhang, Zuo-Feng; Liu, Sijin |
2016 |
2016-10-08 |
COMM-USE |
N |
PMC5473351 |
28649460.0 |
10.1093/nsr/nww064 |
bbjxd86y |
0.362531 |
|
|
| 24 |
Asikainen_2016 |
Reducing burden of disease from residential indoor air exposures in Europe (HEALTHVENT project) |
Asikainen, Arja; Carrer, Paolo; Kephalopoulos, Stylianos; Fernandes, Eduardo de Oliveira; Wargocki, Pawel; Hänninen, Otto |
2016 |
2016-03-08 |
None |
N |
PMC4895703 |
26961383.0 |
10.1186/s12940-016-0101-8 |
b78pccz5 |
0.305427 |
Hao_J_2014 |
Amoatey_2018, Yap_J_2019, Norbäck_2019 |


| sass_file_cache {sass} | R Documentation |
This creates a file cache which is to be used by sass for caching generated .css files.
sass_file_cache(dir, max_size = 40 * 1024^2, max_age = Inf)
dir |
The directory in which to store the cached files. |
max_size |
The maximum size of the cache, in bytes. If the cache grows past this size, the least-recently-used objects will be removed until it fits within this size. |
max_age |
The maximum age of objects in the cache, in seconds. The default is one week. |
A FileCache object.
sass_cache_get()
, sass_cache_context_dir()
, FileCache
## Not run: # Create a cache with the default settings cache <- sass_file_cache(sass_cache_context_dir()) # Clear the cache cache$reset() ## End(Not run)


Three TV Movies Film reviews by Chuck Dowling Copyright 1996 Chuck Dowling
All three of these films are available on home video.
Blind Vengeance (TV-1990) **** - C:Gerald McRaney, Lane Smith, Marg Helgenberger.
An intelligent made for TV movie? Not possible you say? Well, it's true. "Blind Vengeance" is a smart and original TV flick. At first you're led to believe otherwise. Two boys are killed in a small town for unknown reasons by three locals led by Lane Smith. But the three men are found not-guilty because of a legal technicality. One of the boys' fathers (McRaney) come to town to seek revenge on those who murdered his boy. You're thinking that it's just going to be another "Death Wish" clone where the father hunts down and kills the bad guys, but that isn't so. What he does instead is he starts to slowly torment the killers, within the confines of the law, in hopes to get them to turn against each other. The film's only flaw is a completely unnecessary romantic sub-plot. "Blind Vengeance" is well worth watching.
The Great American Traffic Jam (TV-1980) 1/2 - C:Desi Arnaz Jr., Michael Lerner, Rue McClanahan, Ed McMahon, Al Morinaro, Vic Tayback, Abe Vigoda, Lyle Waggoner, Charles Napier, Howard Hesseman.
Absolutely dreadful TV movie with one of the most ridiculous and completely boring stories ever written.  Tense! Gripping! Exciting!  The characters in the Traffic Control Center keep acting like this traffic jam is the worst catastrophy in human history. This might have been meant to be a parody of the disaster films from the period ("Earthquake," "The Towering Inferno," etc.), but I just can't give a TV movie that much credit. As a comedy it doesn't work, as satire it doesn't work, and it's a complete waste of 100 minutes of your life. Also known as "Gridlock" but who cares.
Not My Kid (TV-1984) **1/2 - C:George Segal, Stockard Channing, Andrew Robinson.
Typical TV movie about the effects of a teenage drug addict on a normal family. After an entertaining first half, the film becomes a series of tearful confessions by teenages in a drug rehab facility. Somehow it ends up being the fault of the father (Segal) and he has to be the one to make the final confession. (!) Be sure to applaud when Segal says the film's title. Irritating music score and a laughable ending.
Have A Question Or Comment? Email Me At<EMAIL_ADDRESS>-- Chuck Dowling
Visit Chuck's Movie Reviews at http://users.southeast.net/~chuckd21/ Over 1,500 movies rated and/or reviewed! Movie news, box office reports, film related links, and reader's polls and reviews.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


As a rookie to databases I have done some researching into SQL and NoSQL. There have been numerous articles and opinions to sift through and learn from. Reflecting on a few articles and opinions, the only definitive conclusion is that both SQL and NoSQL are beneficial databases.
Not that SQL and NoSQL are polar opposites, but they play the database game very differently.
SQL databases are relational databases, meaning that they store information about both the data and how it is related. These databases are table based, like a spreadsheet. NoSQL databases are codument based, and unlike SQL, are horizontally scalable.
Schema is the predefined acceptance and linking of data structures, allowing the access or joining of data amongst multiple tables. This is only used in SQL.
As stated in the article from news.dice by Jeff Cogswell, some argue that the joining of multiple relational databases can slow the system down when exponential data and users. He exemplifies Amazon and Google, which compile massive amounts of data and have multitude of users and now use non-relational systems to suit their needs. Additionally he offers the argument that relational databases does not map well to typical structures of complex datatypes or hierarchal data which can be problematic or difficult to manage.
Although there is a growing use of NoSQL, there is predominately more resources and support for all SQL databases and their vendors.
In reading an article and overviewing the properties of both databases, it appears that SQL databases are more stable and better suited for 'heavy duty transactional type applications.' As stated by Luke P Issac, "While you can use NoSQL for transactions purpose, it is still not comparable and stable enough in high load and for complex transactional applications." NoSQL is ideal for large amounts of data, while it appears that for the relations model for databases like SQL are the popular choice for data reliability, security, and, for the most part, efficiency.


"When your Ops folks start thinking about development and your Dev folks starting thinking about Operations, you have a single team that works together with continuous development, continuous testing and continuous deployments".Newrelic
Companies that embrace the DevOps have more frequent deploys, which allows them to introduce new features more often in a more stable environment. The typical tension between Development and Operations is gone and everyone is more effective.
The phrase continuous integration (CI) came out of the Extreme Programming process and was one of its original guidelines. Essentially, developers integrate their code into the code repository at least once a day (and preferably more often). Without continuous integration, the odds of one developer’s changes conflicting with another developer’s changes are very high.
Continuous deployment is the next step of continuous delivery: Every change that passes the automated tests is deployed to production automatically. Continuous deployment should be the goal of most companies that are not constrained by regulatory or other requirements.


3D Print Co. is a 3D printing company. We can 3D print almost anything. The purpose of this site is for our customers, you, to view our pre-designed products that are ready to be printed. Here you can view our pre-designs and their prices and even rate products that you have already purchased, however, you will need to visit us in store to make a purchase. You can get in touch here to request a custom print and ask any questions you might have.
Our CEO, Quentin Robertson is the brains and muscle behind the operation. A loving family man with an appetite for 3D printing and dad jokes. "Why can't a nose be 12 inches long? Because then it would be a foot"
Angelina Jolie is a retired bounty hunter on the run from the Colombian Government who has a love for 3D printing. Opposite to Quentin, Angelina has a love for mum jokes. "Your mum's so old she knew Burger King when he was a prince".
Snoop Dogg is not a dog, but actually a man. A man that loves 3D printing. Running with the theme of great jokes, Snoop loves christmas cracker jokes. "What do you call a line of men waiting for a haircut? A barberque."


Some ML Techniques - Tutorials¶
Classification¶
Learn how to prepare the data for modeling, create a classification model, tune hyperparameters of a model, analyze the performance, and consume the model for predictions.
Regression¶
Learn how to prepare the data for modeling, create a regression model, tune hyperparameters of a model, evaluate model errors, and consume the model for predictions.
Clustering¶
Learn how to prepare the data for modeling, create a K-Means clustering model, assign the labels, analyze results, and consume a trained model for predictions on unseen data.
Anomaly Detection¶
Learn how to prepare the data for modeling, create an unsupervised anomaly detector, evaluate the results of the trained model, and consume the model for predictions on unseen data.


Games lessons play a major part in school life.
Sport is an important part of the school day at Chinthurst. Children are given the opportunity to experience a wide range of activities and sports and teachers work hard to find a sport that each child enjoys. All children in the Upper School receive a weekly PE lesson and have games twice per week. The Lower School children also have a weekly PE lesson; one games lesson per week and a weekly swimming lesson, all of which are taught by specialist staff.
The major sports are:
Autumn - Football, Rugby, Netball
Spring - Rugby, Hockey
Summer - Cricket, Athletics
Topics covered in PE lessons include - Throwing & Catching, Striking skills, Invasion Games, Gymnastics, Swimming, Short Tennis and Basketball.
Matches are regularly played against local schools and it is always our aim to put as many teams out as possible so that all children get a chance to represent the school. Teams will also be entered into competitions, both locally and nationally. Our extra-curricular programme is very extensive with many sporting activities taking place. We also have a coaching session on Saturday mornings, from 9 to 10 am, where all children from reception to year 6 may attend for a coaching session in the major sport for that term.


Emergent Interaction:
Committee
Our organising committee brings together a broad international group with backgrounds in HCI, control theory, enactivist cognitive science, linguistics and computational interaction.
Daniel Bennett is a PhD researcher at Bristol Interaction Group with Oussama Metatla and Anne Roudaut. His PhD work focuses on applying dynamical-systems methods from 4E cognitive science to understand technology use. He is also interested in generative dynamical systems models for musical interaction.
Feng Feng is a Research Associate at University of Eastern Finland and Microsurgery centre in Kuopio University Hospital. She has a background in both Industrial Design and Cognitive Science. Her interests include embodied cognition, multi-sensory perception, Human-Computer-Interaction and Human-Robot-Interaction, and the development of multi-sensory technologies.
Alan Dix is an author, researcher, and university professor, specialising in human–computer interaction. Dix is currently the Director of the Computational Foundry at Swansea University, Wales. A mathematician by training, his work has included applying formal methods and statistics in HCI as well as many other areas including creativity and physical design. His research methods can be eclectic including walking a thousand miles around Wales to understand mobile connectivity and community technology.
Parisa Eslambolchilar is currently a Reader in Human–Computer Interaction (HCI) at Cardiff University and leads the Complex Systems Research Group and the Human Factors Technology Research Priority Area at the School. Her research interests include HCI, ubiquitous computing, and designing interactive systems to support self-reflection, self-monitoring, feedback (audio, haptic, visual, and soma), persuasion, immersion, and navigation. Her work exploits the Internet of things, wearables, smartphones, augmented reality, and virtual reality.
Tom Froese is head of Head of Okinawa’s Embodied Cognitive Science Unit. A cognitive scientist with a background in computer science and complex systems, he applies diverse methods to investigate the interactive basis of life and mind. He is particularly known for his contributions in artificial life and the enactive approach to cognitive science.
Vassilis Kostakos is Professor of Human-Computer Interaction at University of Melbourne. His research interests include ubiquitous computing (Ubicomp), human-computer interaction (HCI), social computing, Internet of Things.
Sébastien Lerique is a Postdoctoral Scholar in cognitive science at Okinawa’s Embodied Cognitive Science Unit, with interests in the role of embodiment in interactions, complex systems, and the emergence of language.
Niels van Berkel is an Assistant Professor at the Human-Centered Computing Group (HCC) at Aalborg University. His research interests lay in Human-Computer Interaction, Social Computing, and Ubiquitous Computing. In particular, he has focused on self-report studies, crowdsourcing, and Human-AI interaction.


Official Scoring Summary
{{round.nomen}}
{{round.location}}; {{round.date|date:"F j, Y"}}
| Group | Songs | MUS | PER | SNG | Total |
|---|---|---|---|---|---|
|
{{public.tot_rank|default:""}}.
{{public.name}} {% if round.get_session_kind_display == 'Chorus' %} {{public.display_area|default:"(Unknown)"}} ({{public.contesting_patched|default:"None"}}) Dir(s): {{public.participants_patched|default:"(No Director Specified)"}}; OnStage: {{public.pos_patched}} {% else %} {{public.display_area|default:"(Unknown)"}} ({{public.contesting_patched|default:"None"}}) {{public.participants_patched|default:"(No Members Specified)"}} {% endif %} |
Total: {{public.stats.tot_points|floatformat:0}} Points {% for appearance in public.appearances_patched %} {% if round.num != 1 %}{{appearance.round.get_kind_display}}: {% if appearance.status != -20%}{{appearance.tot_points|floatformat:0}} Points{% else %}Performer Scratched{% endif %} {% endif %} {% for song in appearance.songs_patched %} {{song.chart_patched|truncatechars_html:70|safe|default:"(Song not in Group's Repertory)▴"}} {{song.penalties_patched|safe}} {% endfor %} {% endfor %} |
{{public.stats.mus_score|floatformat:1}} {% for appearance in public.appearances_patched %} {% if round.num != 1 %}{{appearance.mus_score|floatformat:1}} {% endif %} {% for song in appearance.songs_patched %} {{song.mus_score|floatformat:1}} {% endfor %} {% endfor %} |
{{public.stats.per_score|floatformat:1}} {% for appearance in public.appearances_patched %} {% if round.num != 1 %}{{appearance.per_score|floatformat:1}} {% endif %} {% for song in appearance.songs_patched %} {{song.per_score|floatformat:1}} {% endfor %} {% endfor %} |
{{public.stats.sng_score|floatformat:1}} {% for appearance in public.appearances_patched %} {% if round.num != 1 %}{{appearance.sng_score|floatformat:1}} {% endif %} {% for song in appearance.songs_patched %} {{song.sng_score|floatformat:1}} {% endfor %} {% endfor %} |
{{public.tot_score_avg|floatformat:1}} {% for appearance in public.appearances_patched %} {% if round.num != 1 %}{{appearance.tot_score|floatformat:1}} {% endif %} {% for song in appearance.songs_patched %} {{song.tot_score|floatformat:1}} {% endfor %} {% endfor %} |
{% if round.kind == 1 %}
{% if round.get_district_display == 'BHS' %}
Groups are ranked above in accordance with Article VII of the BHS Contest Rules.
{% else %}
Groups are listed above by total points and in accordance with Article VII of the BHS Contest Rules.
{% endif %}
{% else %}
{% if round.get_district_display == 'BHS' %}
Groups not advancing are ranked above in accordance with Article VII of the BHS Contest Rules.
{% else %}
Groups not advancing and/or competing only for single-round awards are listed above by total points and in accordance with Article VII of the BHS Contest Rules.
{% endif %}
{% endif %}
{% if round.get_district_display != 'BHS' %}
{% if privates %}
The following groups performed for evaluation score only: {{privates|join:", "}}
{% endif %}
{% endif %}
{% if disqualifications %}
The following groups were disqualified for violation of the BHS Contest Rules: {{disqualifications|join:", "}}
{% endif %}
Official Panel
{% if panelists %}-
{% for category, person in panelists %}
- {{category}}: {{person}} {% endfor %}
Awards
-
{% for award, winner in outcomes %}
- {{award}}:{% if round.get_district_display == 'BHS' %}
{% endif %} {{winner|safe}}
{% endfor %}
Footnotes
{% if round.footnotes %}
{{round.footnotes|linebreaks}}
{% endif %}
{% for penalty in penalties %}
{{penalty|safe}}
{% endfor %}
{% if is_missing %}
▴ The Group is responsible for validating any performed chart to the DRCJ within 30 days.
{% endif %}
{% if round.revision_number > 0 %}
Revision: {{ round.revision_date }} - {{ round.revision_reason }}
{% endif %}
Draw
{% for draw, group in advancers %} {{draw}}: {{group}} {% endfor %}


|
|||||||||||
| PREV NEXT | FRAMES NO FRAMES |
| Packages that use org.apache.bcel.generic | |
| org.apache.bcel.classfile | This package contains the classes that describe the structure of a Java class file and a class file parser. |
| org.apache.bcel.generic | This package contains the "generic" part of the Byte Code Engineering Library, i.e., classes to dynamically modify class objects and byte code instructions. |
| org.apache.bcel.util | This package contains utility classes for the Byte Code Engineering Library, namely: Collection classes for JavaClass objects A converter for class files to HTML A tool to find instructions patterns via regular expressions A class to find classes as defined in the CLASSPATH A class loader that allows to create clases at run time |
| org.apache.bcel.verifier.statics | Provides PassVerifier classes used internally by JustIce. |
| org.apache.bcel.verifier.structurals | Provides a PassVerifier class mostly used internally by JustIce, yielding a control flow graph for public use as a nice side effect. |
Classes in org.apache.bcel.generic used by org.apache.bcel.classfile| Type
|
Abstract super class for all possible java types, namely basic types such as int, object types like String and array types, e.g. int[] |
Classes in org.apache.bcel.generic used by org.apache.bcel.generic| AALOAD
|
AALOAD - Load reference from array Stack: ..., arrayref, index -> value AASTORE
|
AASTORE - Store into reference array Stack: ..., arrayref, index, value -> ... ACONST_NULL
|
ACONST_NULL - Push null reference Stack: ... AllocationInstruction
|
Denote family of instructions that allocates space in the heap. ALOAD
|
ALOAD - Load reference from local variable Stack: ... ANEWARRAY
|
ANEWARRAY - Create new array of references Stack: ..., count -> ..., arrayref ARETURN
|
ARETURN - Return reference from method Stack: ..., objectref -> <empty> ArithmeticInstruction
|
Super class for the family of arithmetic instructions. ArrayInstruction
|
Super class for instructions dealing with array access such as IALOAD. ARRAYLENGTH
|
ARRAYLENGTH - Get length of array Stack: ..., arrayref -> ..., length ArrayType
|
Denotes array type, such as int[][] ASTORE
|
ASTORE - Store reference into local variable Stack ..., objectref -> ... ATHROW
|
ATHROW - Throw exception Stack: ..., objectref -> objectref BALOAD
|
BALOAD - Load byte or boolean from array Stack: ..., arrayref, index -> ..., value BasicType
|
Denotes basic type such as int. BASTORE
|
BASTORE - Store into byte or boolean array Stack: ..., arrayref, index, value -> ... BIPUSH
|
BIPUSH - Push byte on stack Stack: ... BranchHandle
|
BranchHandle is returned by specialized InstructionList.append() whenever a BranchInstruction is appended. BranchInstruction
|
Abstract super class for branching instructions like GOTO, IFEQ, etc.. BREAKPOINT
|
BREAKPOINT, JVM dependent, ignored by default CALOAD
|
CALOAD - Load char from array Stack: ..., arrayref, index -> ..., value CASTORE
|
CASTORE - Store into char array Stack: ..., arrayref, index, value -> ... CHECKCAST
|
CHECKCAST - Check whether object is of given type Stack: ..., objectref -> ..., objectref ClassGen
|
Template class for building up a java class. ClassObserver
|
Implement this interface if you're interested in changes to a ClassGen object and register yourself with addObserver(). CodeExceptionGen
|
This class represents an exception handler, i.e., specifies the region where a handler is active and an instruction where the actual handling is done. CompoundInstruction
|
Wrapper class for `compound' operations, virtual instructions that don't exist as byte code, but give a useful meaning. ConstantPoolGen
|
This class is used to build up a constant pool. ConstantPushInstruction
|
Denotes a push instruction that produces a literal on the stack such as SIPUSH, BIPUSH, ICONST, etc. ConversionInstruction
|
Super class for the x2y family of instructions. CPInstruction
|
Abstract super class for instructions that use an index into the constant pool such as LDC, INVOKEVIRTUAL, etc. D2F
|
D2F - Convert double to float Stack: ..., value.word1, value.word2 -> ..., result D2I
|
D2I - Convert double to int Stack: ..., value.word1, value.word2 -> ..., result D2L
|
D2L - Convert double to long Stack: ..., value.word1, value.word2 -> ..., result.word1, result.word2 DADD
|
DADD - Add doubles Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result.word1, result1.word2 DALOAD
|
DALOAD - Load double from array Stack: ..., arrayref, index -> ..., result.word1, result.word2 DASTORE
|
DASTORE - Store into double array Stack: ..., arrayref, index, value.word1, value.word2 -> ... DCMPG
|
DCMPG - Compare doubles: value1 > value2 Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result DCMPL
|
DCMPL - Compare doubles: value1 < value2 Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result DCONST
|
DCONST - Push 0.0 or 1.0, other values cause an exception Stack: ... DDIV
|
DDIV - Divide doubles Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result.word1, result.word2 DLOAD
|
DLOAD - Load double from local variable Stack ... DMUL
|
DMUL - Multiply doubles Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result.word1, result.word2 DNEG
|
DNEG - Negate double Stack: ..., value.word1, value.word2 -> ..., result.word1, result.word2 DREM
|
DREM - Remainder of doubles Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result.word1, result.word2 DRETURN
|
DRETURN - Return double from method Stack: ..., value.word1, value.word2 -> <empty> DSTORE
|
DSTORE - Store double into local variable Stack: ..., value.word1, value.word2 -> ... DSUB
|
DSUB - Substract doubles Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result.word1, result.word2 DUP
|
DUP - Duplicate top operand stack word Stack: ..., word -> ..., word, word DUP_X1
|
DUP_X1 - Duplicate top operand stack word and put two down Stack: ..., word2, word1 -> ..., word1, word2, word1 DUP_X2
|
DUP_X2 - Duplicate top operand stack word and put three down Stack: ..., word3, word2, word1 -> ..., word1, word3, word2, word1 DUP2
|
DUP2 - Duplicate two top operand stack words Stack: ..., word2, word1 -> ..., word2, word1, word2, word1 DUP2_X1
|
DUP2_X1 - Duplicate two top operand stack words and put three down Stack: ..., word3, word2, word1 -> ..., word2, word1, word3, word2, word1 DUP2_X2
|
DUP2_X2 - Duplicate two top operand stack words and put four down Stack: ..., word4, word3, word2, word1 -> ..., word2, word1, word4, word3, word2, word1 ExceptionThrower
|
Denote an instruction that may throw a run-time or a linking exception (or both) during execution. F2D
|
F2D - Convert float to double Stack: ..., value -> ..., result.word1, result.word2 F2I
|
F2I - Convert float to int Stack: ..., value -> ..., result F2L
|
F2L - Convert float to long Stack: ..., value -> ..., result.word1, result.word2 FADD
|
FADD - Add floats Stack: ..., value1, value2 -> result FALOAD
|
FALOAD - Load float from array Stack: ..., arrayref, index -> ..., value FASTORE
|
FASTORE - Store into float array Stack: ..., arrayref, index, value -> ... FCMPG
|
FCMPG - Compare floats: value1 > value2 Stack: ..., value1, value2 -> ..., result FCMPL
|
FCMPL - Compare floats: value1 < value2 Stack: ..., value1, value2 -> ..., result FCONST
|
FCONST - Push 0.0, 1.0 or 2.0, other values cause an exception Stack: ... FDIV
|
FDIV - Divide floats Stack: ..., value1, value2 -> result FieldGen
|
Template class for building up a field. FieldGenOrMethodGen
|
Super class for FieldGen and MethodGen objects, since they have some methods in common! FieldInstruction
|
Super class for the GET/PUTxxx family of instructions. FieldObserver
|
Imnplement this interface if you're interested in changes to a FieldGen object and register yourself with addObserver(). FieldOrMethod
|
Super class for InvokeInstruction and FieldInstruction, since they have some methods in common! FLOAD
|
FLOAD - Load float from local variable Stack ... FMUL
|
FMUL - Multiply floats Stack: ..., value1, value2 -> result FNEG
|
FNEG - Negate float Stack: ..., value -> ..., result FREM
|
FREM - Remainder of floats Stack: ..., value1, value2 -> result FRETURN
|
FRETURN - Return float from method Stack: ..., value -> <empty> FSTORE
|
FSTORE - Store float into local variable Stack: ..., value -> ... FSUB
|
FSUB - Substract floats Stack: ..., value1, value2 -> result GETFIELD
|
GETFIELD - Fetch field from object Stack: ..., objectref -> ..., value OR Stack: ..., objectref -> ..., value.word1, value.word2 GETSTATIC
|
GETSTATIC - Fetch static field from class Stack: ..., -> ..., value OR Stack: ..., -> ..., value.word1, value.word2 GOTO
|
GOTO - Branch always (to relative offset, not absolute address) GOTO_W
|
GOTO_W - Branch always (to relative offset, not absolute address) GotoInstruction
|
Super class for GOTO I2B
|
I2B - Convert int to byte Stack: ..., value -> ..., result I2C
|
I2C - Convert int to char Stack: ..., value -> ..., result I2D
|
I2D - Convert int to double Stack: ..., value -> ..., result.word1, result.word2 I2F
|
I2F - Convert int to float Stack: ..., value -> ..., result I2L
|
I2L - Convert int to long Stack: ..., value -> ..., result.word1, result.word2 I2S
|
I2S - Convert int to short Stack: ..., value -> ..., result IADD
|
IADD - Add ints Stack: ..., value1, value2 -> result IALOAD
|
IALOAD - Load int from array Stack: ..., arrayref, index -> ..., value IAND
|
IAND - Bitwise AND int Stack: ..., value1, value2 -> ..., result IASTORE
|
IASTORE - Store into int array Stack: ..., arrayref, index, value -> ... ICONST
|
ICONST - Push value between -1, ..., 5, other values cause an exception Stack: ... IDIV
|
IDIV - Divide ints Stack: ..., value1, value2 -> result IF_ACMPEQ
|
IF_ACMPEQ - Branch if reference comparison succeeds Stack: ..., value1, value2 -> ... IF_ACMPNE
|
IF_ACMPNE - Branch if reference comparison doesn't succeed Stack: ..., value1, value2 -> ... IF_ICMPEQ
|
IF_ICMPEQ - Branch if int comparison succeeds Stack: ..., value1, value2 -> ... IF_ICMPGE
|
IF_ICMPGE - Branch if int comparison succeeds Stack: ..., value1, value2 -> ... IF_ICMPGT
|
IF_ICMPGT - Branch if int comparison succeeds Stack: ..., value1, value2 -> ... IF_ICMPLE
|
IF_ICMPLE - Branch if int comparison succeeds Stack: ..., value1, value2 -> ... IF_ICMPLT
|
IF_ICMPLT - Branch if int comparison succeeds Stack: ..., value1, value2 -> ... IF_ICMPNE
|
IF_ICMPNE - Branch if int comparison doesn't succeed Stack: ..., value1, value2 -> ... IFEQ
|
IFEQ - Branch if int comparison with zero succeeds Stack: ..., value -> ... IFGE
|
IFGE - Branch if int comparison with zero succeeds Stack: ..., value -> ... IFGT
|
IFGT - Branch if int comparison with zero succeeds Stack: ..., value -> ... IfInstruction
|
Super class for the IFxxx family of instructions. IFLE
|
IFLE - Branch if int comparison with zero succeeds Stack: ..., value -> ... IFLT
|
IFLT - Branch if int comparison with zero succeeds Stack: ..., value -> ... IFNE
|
IFNE - Branch if int comparison with zero succeeds Stack: ..., value -> ... IFNONNULL
|
IFNONNULL - Branch if reference is not null Stack: ..., reference -> ... IFNULL
|
IFNULL - Branch if reference is not null Stack: ..., reference -> ... IINC
|
IINC - Increment local variable by constant ILOAD
|
ILOAD - Load int from local variable onto stack Stack: ... IMPDEP1
|
IMPDEP1 - Implementation dependent IMPDEP2
|
IMPDEP2 - Implementation dependent IMUL
|
IMUL - Multiply ints Stack: ..., value1, value2 -> result IndexedInstruction
|
Denote entity that refers to an index, e.g. local variable instructions, RET, CPInstruction, etc. INEG
|
INEG - Negate int Stack: ..., value -> ..., result INSTANCEOF
|
INSTANCEOF - Determine if object is of given type Stack: ..., objectref -> ..., result Instruction
|
Abstract super class for all Java byte codes. InstructionComparator
|
Equality of instructions isn't clearly to be defined. InstructionConstants
|
This interface contains shareable instruction objects. InstructionConstants.Clinit
|
InstructionHandle
|
Instances of this class give users a handle to the instructions contained in an InstructionList. InstructionList
|
This class is a container for a list of Instruction objects. InstructionListObserver
|
Implement this interface if you're interested in changes to an InstructionList object and register yourself with addObserver(). InstructionTargeter
|
Denote that a class targets InstructionHandles within an InstructionList. InvokeInstruction
|
Super class for the INVOKExxx family of instructions. INVOKEINTERFACE
|
INVOKEINTERFACE - Invoke interface method Stack: ..., objectref, [arg1, [arg2 ...]] INVOKESPECIAL
|
INVOKESPECIAL - Invoke instance method; special handling for superclass, private and instance initialization method invocations Stack: ..., objectref, [arg1, [arg2 ...]] INVOKESTATIC
|
INVOKESTATIC - Invoke a class (static) method Stack: ..., [arg1, [arg2 ...]] INVOKEVIRTUAL
|
INVOKEVIRTUAL - Invoke instance method; dispatch based on class Stack: ..., objectref, [arg1, [arg2 ...]] IOR
|
IOR - Bitwise OR int Stack: ..., value1, value2 -> ..., result IREM
|
IREM - Remainder of int Stack: ..., value1, value2 -> result IRETURN
|
IRETURN - Return int from method Stack: ..., value -> <empty> ISHL
|
ISHL - Arithmetic shift left int Stack: ..., value1, value2 -> ..., result ISHR
|
ISHR - Arithmetic shift right int Stack: ..., value1, value2 -> ..., result ISTORE
|
ISTORE - Store int from stack into local variable Stack: ..., value -> ... ISUB
|
ISUB - Substract ints Stack: ..., value1, value2 -> result IUSHR
|
IUSHR - Logical shift right int Stack: ..., value1, value2 -> ..., result IXOR
|
IXOR - Bitwise XOR int Stack: ..., value1, value2 -> ..., result JSR
|
JSR - Jump to subroutine JSR_W
|
JSR_W - Jump to subroutine JsrInstruction
|
Super class for JSR - Jump to subroutine L2D
|
L2D - Convert long to double Stack: ..., value.word1, value.word2 -> ..., result.word1, result.word2 L2F
|
L2F - Convert long to float Stack: ..., value.word1, value.word2 -> ..., result L2I
|
L2I - Convert long to int Stack: ..., value.word1, value.word2 -> ..., result LADD
|
LADD - Add longs Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result.word1, result.word2 LALOAD
|
LALOAD - Load long from array Stack: ..., arrayref, index -> ..., value1, value2 LAND
|
LAND - Bitwise AND longs Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result.word1, result.word2 LASTORE
|
LASTORE - Store into long array Stack: ..., arrayref, index, value.word1, value.word2 -> ... LCMP
|
LCMP - Compare longs: Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result <= -1, 0, 1> LCONST
|
LCONST - Push 0 or 1, other values cause an exception Stack: ... LDC
|
LDC - Push item from constant pool. LDC2_W
|
LDC2_W - Push long or double from constant pool Stack: ... LDIV
|
LDIV - Divide longs Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result.word1, result.word2 LineNumberGen
|
This class represents a line number within a method, i.e., give an instruction a line number corresponding to the source code line. LLOAD
|
LLOAD - Load long from local variable Stack ... LMUL
|
LMUL - Multiply longs Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result.word1, result.word2 LNEG
|
LNEG - Negate long Stack: ..., value.word1, value.word2 -> ..., result.word1, result.word2 LoadClass
|
Denotes that an instruction may start the process of loading and resolving the referenced class in the Virtual Machine. LoadInstruction
|
Denotes an unparameterized instruction to load a value from a local variable, e.g. LocalVariableGen
|
This class represents a local variable within a method. LocalVariableInstruction
|
Abstract super class for instructions dealing with local variables. LOOKUPSWITCH
|
LOOKUPSWITCH - Switch with unordered set of values LOR
|
LOR - Bitwise OR long Stack: ..., value1, value2 -> ..., result LREM
|
LREM - Remainder of long Stack: ..., value1, value2 -> result LRETURN
|
LRETURN - Return long from method Stack: ..., value.word1, value.word2 -> <empty> LSHL
|
LSHL - Arithmetic shift left long Stack: ..., value1.word1, value1.word2, value2 -> ..., result.word1, result.word2 LSHR
|
LSHR - Arithmetic shift right long Stack: ..., value1.word1, value1.word2, value2 -> ..., result.word1, result.word2 LSTORE
|
LSTORE - Store long into local variable Stack: ..., value.word1, value.word2 -> ... LSUB
|
LSUB - Substract longs Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result.word1, result.word2 LUSHR
|
LUSHR - Logical shift right long Stack: ..., value1, value2 -> ..., result LXOR
|
LXOR - Bitwise XOR long Stack: ..., value1, value2 -> ..., result MethodGen
|
Template class for building up a method. MethodObserver
|
Implement this interface if you're interested in changes to a MethodGen object and register yourself with addObserver(). MONITORENTER
|
MONITORENTER - Enter monitor for object Stack: ..., objectref -> ... MONITOREXIT
|
MONITOREXIT - Exit monitor for object Stack: ..., objectref -> ... MULTIANEWARRAY
|
MULTIANEWARRAY - Create new mutidimensional array of references Stack: ..., count1, [count2, ...] NamedAndTyped
|
Denote entity that has both name and type. NEW
|
NEW - Create new object Stack: ... NEWARRAY
|
NEWARRAY - Create new array of basic type (int, short, ...) NOP
|
NOP - Do nothing ObjectType
|
Denotes reference such as java.lang.String. POP
|
POP - Pop top operand stack word Stack: ..., word -> ... POP2
|
POP2 - Pop two top operand stack words Stack: ..., word2, word1 -> ... PopInstruction
|
Denotes an unparameterized instruction to pop a value on top from the stack, such as ISTORE, POP, PUTSTATIC. PushInstruction
|
Denotes an unparameterized instruction to produce a value on top of the stack, such as ILOAD, LDC, SIPUSH, DUP, ICONST, etc. PUTFIELD
|
PUTFIELD - Put field in object Stack: ..., objectref, value -> ... PUTSTATIC
|
PUTSTATIC - Put static field in class Stack: ..., value -> ... ReferenceType
|
Super class for object and array types. RET
|
RET - Return from subroutine Stack: ..., -> ..., address RETURN
|
RETURN - Return from void method Stack: ... ReturnaddressType
|
Returnaddress, the type JSR or JSR_W instructions push upon the stack. ReturnInstruction
|
Super class for the xRETURN family of instructions. SALOAD
|
SALOAD - Load short from array Stack: ..., arrayref, index -> ..., value SASTORE
|
SASTORE - Store into short array Stack: ..., arrayref, index, value -> ... Select
|
Select - Abstract super class for LOOKUPSWITCH and TABLESWITCH instructions. SIPUSH
|
SIPUSH - Push short Stack: ... StackConsumer
|
Denote an instruction that may consume a value from the stack. StackInstruction
|
Super class for stack operations like DUP and POP. StackProducer
|
Denote an instruction that may produce a value on top of the stack (this excludes DUP_X1, e.g.) StoreInstruction
|
Denotes an unparameterized instruction to store a value into a local variable, e.g. SWAP
|
SWAP - Swa top operand stack word Stack: ..., word2, word1 -> ..., word1, word2 TABLESWITCH
|
TABLESWITCH - Switch within given range of values, i.e., low..high TargetLostException
|
Thrown by InstructionList.remove() when one or multiple disposed instruction are still being referenced by a InstructionTargeter object. Type
|
Abstract super class for all possible java types, namely basic types such as int, object types like String and array types, e.g. int[] TypedInstruction
|
Get the type associated with an instruction, int for ILOAD, or the type of the field of a PUTFIELD instruction, e.g.. UnconditionalBranch
|
Denotes an instruction to perform an unconditional branch, i.e., GOTO, JSR. VariableLengthInstruction
|
Denotes an instruction to be a variable length instruction, such as GOTO, JSR, LOOKUPSWITCH and TABLESWITCH. Visitor
|
Interface implementing the Visitor pattern programming style. |
Classes in org.apache.bcel.generic used by org.apache.bcel.util| InstructionHandle
|
Instances of this class give users a handle to the instructions contained in an InstructionList. InstructionList
|
This class is a container for a list of Instruction objects. |
Classes in org.apache.bcel.generic used by org.apache.bcel.verifier.statics| Type
|
Abstract super class for all possible java types, namely basic types such as int, object types like String and array types, e.g. int[] |
Classes in org.apache.bcel.generic used by org.apache.bcel.verifier.structurals| AALOAD
|
AALOAD - Load reference from array Stack: ..., arrayref, index -> value AASTORE
|
AASTORE - Store into reference array Stack: ..., arrayref, index, value -> ... ACONST_NULL
|
ACONST_NULL - Push null reference Stack: ... ALOAD
|
ALOAD - Load reference from local variable Stack: ... ANEWARRAY
|
ANEWARRAY - Create new array of references Stack: ..., count -> ..., arrayref ARETURN
|
ARETURN - Return reference from method Stack: ..., objectref -> <empty> ARRAYLENGTH
|
ARRAYLENGTH - Get length of array Stack: ..., arrayref -> ..., length ASTORE
|
ASTORE - Store reference into local variable Stack ..., objectref -> ... ATHROW
|
ATHROW - Throw exception Stack: ..., objectref -> objectref BALOAD
|
BALOAD - Load byte or boolean from array Stack: ..., arrayref, index -> ..., value BASTORE
|
BASTORE - Store into byte or boolean array Stack: ..., arrayref, index, value -> ... BIPUSH
|
BIPUSH - Push byte on stack Stack: ... BREAKPOINT
|
BREAKPOINT, JVM dependent, ignored by default CALOAD
|
CALOAD - Load char from array Stack: ..., arrayref, index -> ..., value CASTORE
|
CASTORE - Store into char array Stack: ..., arrayref, index, value -> ... CHECKCAST
|
CHECKCAST - Check whether object is of given type Stack: ..., objectref -> ..., objectref ConstantPoolGen
|
This class is used to build up a constant pool. CPInstruction
|
Abstract super class for instructions that use an index into the constant pool such as LDC, INVOKEVIRTUAL, etc. D2F
|
D2F - Convert double to float Stack: ..., value.word1, value.word2 -> ..., result D2I
|
D2I - Convert double to int Stack: ..., value.word1, value.word2 -> ..., result D2L
|
D2L - Convert double to long Stack: ..., value.word1, value.word2 -> ..., result.word1, result.word2 DADD
|
DADD - Add doubles Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result.word1, result1.word2 DALOAD
|
DALOAD - Load double from array Stack: ..., arrayref, index -> ..., result.word1, result.word2 DASTORE
|
DASTORE - Store into double array Stack: ..., arrayref, index, value.word1, value.word2 -> ... DCMPG
|
DCMPG - Compare doubles: value1 > value2 Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result DCMPL
|
DCMPL - Compare doubles: value1 < value2 Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result DCONST
|
DCONST - Push 0.0 or 1.0, other values cause an exception Stack: ... DDIV
|
DDIV - Divide doubles Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result.word1, result.word2 DLOAD
|
DLOAD - Load double from local variable Stack ... DMUL
|
DMUL - Multiply doubles Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result.word1, result.word2 DNEG
|
DNEG - Negate double Stack: ..., value.word1, value.word2 -> ..., result.word1, result.word2 DREM
|
DREM - Remainder of doubles Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result.word1, result.word2 DRETURN
|
DRETURN - Return double from method Stack: ..., value.word1, value.word2 -> <empty> DSTORE
|
DSTORE - Store double into local variable Stack: ..., value.word1, value.word2 -> ... DSUB
|
DSUB - Substract doubles Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result.word1, result.word2 DUP
|
DUP - Duplicate top operand stack word Stack: ..., word -> ..., word, word DUP_X1
|
DUP_X1 - Duplicate top operand stack word and put two down Stack: ..., word2, word1 -> ..., word1, word2, word1 DUP_X2
|
DUP_X2 - Duplicate top operand stack word and put three down Stack: ..., word3, word2, word1 -> ..., word1, word3, word2, word1 DUP2
|
DUP2 - Duplicate two top operand stack words Stack: ..., word2, word1 -> ..., word2, word1, word2, word1 DUP2_X1
|
DUP2_X1 - Duplicate two top operand stack words and put three down Stack: ..., word3, word2, word1 -> ..., word2, word1, word3, word2, word1 DUP2_X2
|
DUP2_X2 - Duplicate two top operand stack words and put four down Stack: ..., word4, word3, word2, word1 -> ..., word2, word1, word4, word3, word2, word1 EmptyVisitor
|
Supplies empty method bodies to be overridden by subclasses. F2D
|
F2D - Convert float to double Stack: ..., value -> ..., result.word1, result.word2 F2I
|
F2I - Convert float to int Stack: ..., value -> ..., result F2L
|
F2L - Convert float to long Stack: ..., value -> ..., result.word1, result.word2 FADD
|
FADD - Add floats Stack: ..., value1, value2 -> result FALOAD
|
FALOAD - Load float from array Stack: ..., arrayref, index -> ..., value FASTORE
|
FASTORE - Store into float array Stack: ..., arrayref, index, value -> ... FCMPG
|
FCMPG - Compare floats: value1 > value2 Stack: ..., value1, value2 -> ..., result FCMPL
|
FCMPL - Compare floats: value1 < value2 Stack: ..., value1, value2 -> ..., result FCONST
|
FCONST - Push 0.0, 1.0 or 2.0, other values cause an exception Stack: ... FDIV
|
FDIV - Divide floats Stack: ..., value1, value2 -> result FieldInstruction
|
Super class for the GET/PUTxxx family of instructions. FLOAD
|
FLOAD - Load float from local variable Stack ... FMUL
|
FMUL - Multiply floats Stack: ..., value1, value2 -> result FNEG
|
FNEG - Negate float Stack: ..., value -> ..., result FREM
|
FREM - Remainder of floats Stack: ..., value1, value2 -> result FRETURN
|
FRETURN - Return float from method Stack: ..., value -> <empty> FSTORE
|
FSTORE - Store float into local variable Stack: ..., value -> ... FSUB
|
FSUB - Substract floats Stack: ..., value1, value2 -> result GETFIELD
|
GETFIELD - Fetch field from object Stack: ..., objectref -> ..., value OR Stack: ..., objectref -> ..., value.word1, value.word2 GETSTATIC
|
GETSTATIC - Fetch static field from class Stack: ..., -> ..., value OR Stack: ..., -> ..., value.word1, value.word2 GOTO
|
GOTO - Branch always (to relative offset, not absolute address) GOTO_W
|
GOTO_W - Branch always (to relative offset, not absolute address) I2B
|
I2B - Convert int to byte Stack: ..., value -> ..., result I2C
|
I2C - Convert int to char Stack: ..., value -> ..., result I2D
|
I2D - Convert int to double Stack: ..., value -> ..., result.word1, result.word2 I2F
|
I2F - Convert int to float Stack: ..., value -> ..., result I2L
|
I2L - Convert int to long Stack: ..., value -> ..., result.word1, result.word2 I2S
|
I2S - Convert int to short Stack: ..., value -> ..., result IADD
|
IADD - Add ints Stack: ..., value1, value2 -> result IALOAD
|
IALOAD - Load int from array Stack: ..., arrayref, index -> ..., value IAND
|
IAND - Bitwise AND int Stack: ..., value1, value2 -> ..., result IASTORE
|
IASTORE - Store into int array Stack: ..., arrayref, index, value -> ... ICONST
|
ICONST - Push value between -1, ..., 5, other values cause an exception Stack: ... IDIV
|
IDIV - Divide ints Stack: ..., value1, value2 -> result IF_ACMPEQ
|
IF_ACMPEQ - Branch if reference comparison succeeds Stack: ..., value1, value2 -> ... IF_ACMPNE
|
IF_ACMPNE - Branch if reference comparison doesn't succeed Stack: ..., value1, value2 -> ... IF_ICMPEQ
|
IF_ICMPEQ - Branch if int comparison succeeds Stack: ..., value1, value2 -> ... IF_ICMPGE
|
IF_ICMPGE - Branch if int comparison succeeds Stack: ..., value1, value2 -> ... IF_ICMPGT
|
IF_ICMPGT - Branch if int comparison succeeds Stack: ..., value1, value2 -> ... IF_ICMPLE
|
IF_ICMPLE - Branch if int comparison succeeds Stack: ..., value1, value2 -> ... IF_ICMPLT
|
IF_ICMPLT - Branch if int comparison succeeds Stack: ..., value1, value2 -> ... IF_ICMPNE
|
IF_ICMPNE - Branch if int comparison doesn't succeed Stack: ..., value1, value2 -> ... IFEQ
|
IFEQ - Branch if int comparison with zero succeeds Stack: ..., value -> ... IFGE
|
IFGE - Branch if int comparison with zero succeeds Stack: ..., value -> ... IFGT
|
IFGT - Branch if int comparison with zero succeeds Stack: ..., value -> ... IFLE
|
IFLE - Branch if int comparison with zero succeeds Stack: ..., value -> ... IFLT
|
IFLT - Branch if int comparison with zero succeeds Stack: ..., value -> ... IFNE
|
IFNE - Branch if int comparison with zero succeeds Stack: ..., value -> ... IFNONNULL
|
IFNONNULL - Branch if reference is not null Stack: ..., reference -> ... IFNULL
|
IFNULL - Branch if reference is not null Stack: ..., reference -> ... IINC
|
IINC - Increment local variable by constant ILOAD
|
ILOAD - Load int from local variable onto stack Stack: ... IMPDEP1
|
IMPDEP1 - Implementation dependent IMPDEP2
|
IMPDEP2 - Implementation dependent IMUL
|
IMUL - Multiply ints Stack: ..., value1, value2 -> result INEG
|
INEG - Negate int Stack: ..., value -> ..., result INSTANCEOF
|
INSTANCEOF - Determine if object is of given type Stack: ..., objectref -> ..., result InstructionHandle
|
Instances of this class give users a handle to the instructions contained in an InstructionList. InvokeInstruction
|
Super class for the INVOKExxx family of instructions. INVOKEINTERFACE
|
INVOKEINTERFACE - Invoke interface method Stack: ..., objectref, [arg1, [arg2 ...]] INVOKESPECIAL
|
INVOKESPECIAL - Invoke instance method; special handling for superclass, private and instance initialization method invocations Stack: ..., objectref, [arg1, [arg2 ...]] INVOKESTATIC
|
INVOKESTATIC - Invoke a class (static) method Stack: ..., [arg1, [arg2 ...]] INVOKEVIRTUAL
|
INVOKEVIRTUAL - Invoke instance method; dispatch based on class Stack: ..., objectref, [arg1, [arg2 ...]] IOR
|
IOR - Bitwise OR int Stack: ..., value1, value2 -> ..., result IREM
|
IREM - Remainder of int Stack: ..., value1, value2 -> result IRETURN
|
IRETURN - Return int from method Stack: ..., value -> <empty> ISHL
|
ISHL - Arithmetic shift left int Stack: ..., value1, value2 -> ..., result ISHR
|
ISHR - Arithmetic shift right int Stack: ..., value1, value2 -> ..., result ISTORE
|
ISTORE - Store int from stack into local variable Stack: ..., value -> ... ISUB
|
ISUB - Substract ints Stack: ..., value1, value2 -> result IUSHR
|
IUSHR - Logical shift right int Stack: ..., value1, value2 -> ..., result IXOR
|
IXOR - Bitwise XOR int Stack: ..., value1, value2 -> ..., result JSR
|
JSR - Jump to subroutine JSR_W
|
JSR_W - Jump to subroutine L2D
|
L2D - Convert long to double Stack: ..., value.word1, value.word2 -> ..., result.word1, result.word2 L2F
|
L2F - Convert long to float Stack: ..., value.word1, value.word2 -> ..., result L2I
|
L2I - Convert long to int Stack: ..., value.word1, value.word2 -> ..., result LADD
|
LADD - Add longs Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result.word1, result.word2 LALOAD
|
LALOAD - Load long from array Stack: ..., arrayref, index -> ..., value1, value2 LAND
|
LAND - Bitwise AND longs Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result.word1, result.word2 LASTORE
|
LASTORE - Store into long array Stack: ..., arrayref, index, value.word1, value.word2 -> ... LCMP
|
LCMP - Compare longs: Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result <= -1, 0, 1> LCONST
|
LCONST - Push 0 or 1, other values cause an exception Stack: ... LDC
|
LDC - Push item from constant pool. LDC_W
|
LDC_W - Push item from constant pool (wide index) Stack: ... LDC2_W
|
LDC2_W - Push long or double from constant pool Stack: ... LDIV
|
LDIV - Divide longs Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result.word1, result.word2 LLOAD
|
LLOAD - Load long from local variable Stack ... LMUL
|
LMUL - Multiply longs Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result.word1, result.word2 LNEG
|
LNEG - Negate long Stack: ..., value.word1, value.word2 -> ..., result.word1, result.word2 LoadClass
|
Denotes that an instruction may start the process of loading and resolving the referenced class in the Virtual Machine. LoadInstruction
|
Denotes an unparameterized instruction to load a value from a local variable, e.g. LocalVariableInstruction
|
Abstract super class for instructions dealing with local variables. LOOKUPSWITCH
|
LOOKUPSWITCH - Switch with unordered set of values LOR
|
LOR - Bitwise OR long Stack: ..., value1, value2 -> ..., result LREM
|
LREM - Remainder of long Stack: ..., value1, value2 -> result LRETURN
|
LRETURN - Return long from method Stack: ..., value.word1, value.word2 -> <empty> LSHL
|
LSHL - Arithmetic shift left long Stack: ..., value1.word1, value1.word2, value2 -> ..., result.word1, result.word2 LSHR
|
LSHR - Arithmetic shift right long Stack: ..., value1.word1, value1.word2, value2 -> ..., result.word1, result.word2 LSTORE
|
LSTORE - Store long into local variable Stack: ..., value.word1, value.word2 -> ... LSUB
|
LSUB - Substract longs Stack: ..., value1.word1, value1.word2, value2.word1, value2.word2 -> ..., result.word1, result.word2 LUSHR
|
LUSHR - Logical shift right long Stack: ..., value1, value2 -> ..., result LXOR
|
LXOR - Bitwise XOR long Stack: ..., value1, value2 -> ..., result MethodGen
|
Template class for building up a method. MONITORENTER
|
MONITORENTER - Enter monitor for object Stack: ..., objectref -> ... MONITOREXIT
|
MONITOREXIT - Exit monitor for object Stack: ..., objectref -> ... MULTIANEWARRAY
|
MULTIANEWARRAY - Create new mutidimensional array of references Stack: ..., count1, [count2, ...] NEW
|
NEW - Create new object Stack: ... NEWARRAY
|
NEWARRAY - Create new array of basic type (int, short, ...) NOP
|
NOP - Do nothing ObjectType
|
Denotes reference such as java.lang.String. POP
|
POP - Pop top operand stack word Stack: ..., word -> ... POP2
|
POP2 - Pop two top operand stack words Stack: ..., word2, word1 -> ... PUTFIELD
|
PUTFIELD - Put field in object Stack: ..., objectref, value -> ... PUTSTATIC
|
PUTSTATIC - Put static field in class Stack: ..., value -> ... ReferenceType
|
Super class for object and array types. RET
|
RET - Return from subroutine Stack: ..., -> ..., address RETURN
|
RETURN - Return from void method Stack: ... ReturnInstruction
|
Super class for the xRETURN family of instructions. SALOAD
|
SALOAD - Load short from array Stack: ..., arrayref, index -> ..., value SASTORE
|
SASTORE - Store into short array Stack: ..., arrayref, index, value -> ... SIPUSH
|
SIPUSH - Push short Stack: ... StackConsumer
|
Denote an instruction that may consume a value from the stack. StackInstruction
|
Super class for stack operations like DUP and POP. StackProducer
|
Denote an instruction that may produce a value on top of the stack (this excludes DUP_X1, e.g.) StoreInstruction
|
Denotes an unparameterized instruction to store a value into a local variable, e.g. SWAP
|
SWAP - Swa top operand stack word Stack: ..., word2, word1 -> ..., word1, word2 TABLESWITCH
|
TABLESWITCH - Switch within given range of values, i.e., low..high Type
|
Abstract super class for all possible java types, namely basic types such as int, object types like String and array types, e.g. int[] Visitor
|
Interface implementing the Visitor pattern programming style. |
|
|||||||||||
| PREV NEXT | FRAMES NO FRAMES |


Choosing the Right .NET For You on the Server¶
By Daniel Roth
ASP.NET 5 is based on the .NET Execution Environment (DNX), which supports running cross-platform on Windows, Mac and Linux. When selecting a DNX to use you also have a choice of .NET flavors to pick from: .NET Framework (CLR), .NET Core (CoreCLR) or Mono. Which .NET flavor should you choose? Let’s look at the pros and cons of each one.
.NET Framework¶
The .NET Framework is the most well known and mature of the three options. The .NET Framework is a mature and fully featured framework that ships with Windows. The .NET Framework ecosystem is well established and has been around for well over a decade. The .NET Framework is production ready today and provides the highest level of compatibility for your existing applications and libraries.
The .NET Framework runs on Windows only. It is also a monolithic component with a large API surface area and a slower release cycle. While the code for the .NET Framework is available for reference it is not an active open source project.
.NET Core¶
.NET Core 5 is a modular runtime and library implementation that includes a subset of the .NET Framework. Currently it is feature complete on Windows, and in-progress builds exist for both Linux and OS X. .NET Core consists of a set of libraries, called “CoreFX”, and a small, optimized runtime, called “CoreCLR”. .NET Core is open-source, so you can follow progress on the project and contribute to it on GitHub.
The CoreCLR runtime (Microsoft.CoreCLR) and CoreFX libraries are distributed via NuGet. Because .NET Core has been built as a componentized set of libraries you can limit the API surface area your application uses to just the pieces you need. You can also run .NET Core based applications on much more constrained environments (ex. Windows Server Nano).
The API factoring in .NET Core was updated to enable better componentization. This means that existing libraries built for the .NET Framework generally need to be recompiled to run on .NET Core. The .NET Core ecosystem is relatively new, but it is rapidly growing with the support of popular .NET packages like JSON.NET, AutoFac, xUnit.net and many others.
Developing on .NET Core allows you to target a single consistent platform that can run on multiple platforms. However, the .NET Core support for Mac and Linux is still very new and not ready for production workloads.
Please see Introducing .NET Core for more details on what .NET Core has to offer.
Mono¶
Mono is a port of the .NET Framework built primarily for non-Windows platforms. Mono is open source and cross-platform. It also shares a similar API factoring to the .NET Framework, so many existing managed libraries work on Mono today. Mono is not a supported platform by Microsoft. It is however a good proving ground for cross-platform development while cross-platform support in .NET Core matures.
Summary¶
The .NET Execution Environment (DNX) and .NET Core make .NET development available to more scenarios than ever before. DNX also gives you the option to target your application at existing available .NET platforms. Which .NET flavor you pick will depend on your specific scenarios, timelines, feature requirements and compatibility requirements.


hihocoder 1288 — font size
18 Oct 20161 描述
Steven loves reading book on his phone. The book he reads now consists of N paragraphs and the i-th paragraph contains ai characters.
Steven wants to make the characters easier to read, so he decides to increase the font size of characters. But the size of Steven’s phone screen is limited. Its width is W and height is H. As a result, if the font size of characters is S then it can only show ⌊W / S⌋ characters in a line and ⌊H / S⌋ lines in a page. (⌊x⌋ is the largest integer no more than x)
So here’s the question, if Steven wants to control the number of pages no more than P, what’s the maximum font size he can set? Note that paragraphs must start in a new line and there is no empty line between paragraphs.
2 输入
Input may contain multiple test cases.
The first line is an integer TASKS, representing the number of test cases.
For each test case, the first line contains four integers N, P, W and H, as described above.
The second line contains N integers a1, a2, … aN, indicating the number of characters in each paragraph.
For all test cases,
1 <= N <= 10^3,
1 <= W, H, ai <= 10^3,
1 <= P <= 10^6,
There is always a way to control the number of pages no more than P.
3 输出
For each testcase, output a line with an integer Ans, indicating the maximum font size Steven can set.
样例输入
2
1 10 4 3
10
2 10 4 3
10 10
样例输出
3
2
4 实现
4.1 暴力
from math import *
while True:
try:
T = int(raw_input().strip())
for i in xrange(T):
max_S = 0
[N, P, W, H] = [int(x) for x in raw_input().strip().split()]
a = [int(arg) for arg in raw_input().strip().split()]
for S in xrange(min(W, H), 0, -1):
cols = floor(W / S)
row = floor(H / S)
lines = [ceil(ai / cols) for ai in a]
rows = sum(lines)
pages = int(ceil(rows / row))
if pages <= P and S > max_S:
max_S = S
print max_S
except EOFError:
break
4.2 二分
from math import *
while True:
try:
T = int(raw_input().strip())
for i in xrange(T):
[N, P, W, H] = [int(x) for x in raw_input().strip().split()]
A = [int(arg) for arg in raw_input().strip().split()]
def F(s, w=W, h=H, a=A):
cols = floor(w / s) # 屏幕的宽最多能容纳的字符个数(即屏幕的最多列数)
row = floor(h / s) # 屏幕的高最多能容纳的字符个数(即屏幕的最多行数)
lines = []
for ai in a:
lines.append(ceil(ai / cols)) # 各段需要的行数
rows = sum(lines) # 需要的总行数
pages = ceil(rows / row) # 需要的页数
return int(pages)
l_S = 1
r_S = min(W, H)
l_P = F(l_S)
r_P = F(r_S)
if l_P > P:
print 0
else:
while r_P > P and (l_S + 1) < r_S:
mid_S = int(floor((l_S + r_S) / 2))
mid_P = F(mid_S)
if mid_P < P:
l_S = mid_S
l_P = mid_P
else:
r_S = mid_S
r_P = mid_P
if r_P <= P:
print r_S
else:
print l_S
except EOFError:
break
总结
- 为了快速AC，应该先尝试下暴力算法，这一题给的
P
的范围不超过10^6
,并不大，所以能暴力则暴力，考试不是项目，没必要给出最优解！ - 在二分的时候，没必要设计得特别精巧，把所有情况考虑完全了，可以多写点逻辑流程。思考最精巧的逻辑循环判断是完全浪费时间，考试就是为了能快速实现！


Canvas background
In some use cases you would want a background image or color over the whole canvas. There is no built-in support for this, the way you can achieve this is by writing a custom plugin.
In the two example plugins underneath here you can see how you can draw a color or image to the canvas as background. This way of giving the chart a background is only necessary if you want to export the chart with that specific background. For normal use you can set the background more easily with CSS.
::: tab Color
```js chart-editor // const data = { labels: [“Red”, “Blue”, “Yellow”], datasets: [ { label: “My First Dataset”, data: [300, 50, 100], backgroundColor: [ “rgb(255, 99, 132)”, “rgb(54, 162, 235)”, “rgb(255, 205, 86)”, ], hoverOffset: 4, }, ], }; //
// // Note: changes to the plugin code is not reflected to the chart, because the plugin is loaded at chart construction time and editor changes only trigger an chart.update(). const plugin = { id: “custom_canvas_background_color”, beforeDraw: (chart) => { const ctx = chart.canvas.getContext(“2d”); ctx.save(); ctx.globalCompositeOperation = “destination-over”; ctx.fillStyle = “lightGreen”; ctx.fillRect(0, 0, chart.width, chart.height); ctx.restore(); }, }; //
// const config = { type: “doughnut”, data: data, plugins: [plugin], }; //
module.exports = { actions: [], config: config, }; ```
::: tab Image
```js chart-editor // const data = { labels: [“Red”, “Blue”, “Yellow”], datasets: [ { label: “My First Dataset”, data: [300, 50, 100], backgroundColor: [ “rgb(255, 99, 132)”, “rgb(54, 162, 235)”, “rgb(255, 205, 86)”, ], hoverOffset: 4, }, ], }; //
// // Note: changes to the plugin code is not reflected to the chart, because the plugin is loaded at chart construction time and editor changes only trigger an chart.update(). const image = new Image(); image.src = “https://www.chartjs.org/img/chartjs-logo.svg”;
const plugin = { id: “custom_canvas_background_image”, beforeDraw: (chart) => { if (image.complete) { const ctx = chart.ctx; const { top, left, width, height } = chart.chartArea; const x = left + width / 2 - image.width / 2; const y = top + height / 2 - image.height / 2; ctx.drawImage(image, x, y); } else { image.onload = () => chart.draw(); } }, }; //
// const config = { type: “doughnut”, data: data, plugins: [plugin], }; //
module.exports = { actions: [], config: config, }; ```
:::
::::


% include ./partials/head %>
SignIn
Full Name
Author
Publisher
User
Account Type
Email
Mobile
Password
SignIn
SignUp


{# Copyright (C) 2011 University of Southampton #} {% extends "base_nav.html" %} {% load url from future %} {% block title %}PROVServer: Search Help{% endblock %} {% block header %}
The PROV-JSON API provides a RESTfull web service for storage and access of provenance bundles in JSON format as specified here for the W3C's Provenance Data Model. Trough the API any client can manipulate bundles stored on a server and explore and retrieve information from other clients.
The PROV Server supports searching capabilities both on the webUI and on trough the API. All the searches would always give back bundles you have permissions at least to view. There are five types of different searches that are supported: By Name, By Identifier, By prov:type, In Timeframe and searching in for any text field. Searching on the webUI is done by going to the search page and inputting any parameters required for the search. You can select the type of search to execute via the drop down list. On the API search is supported ONLY via 'GET' method. When you execute such method you should append the parameter 'search_type' with five possible values: 'Name', 'Identifier', 'prov_type', 'Timeframe' or 'Any' - representing each of the supported search types. After this parameter you should append any relevant to the search parameters(for all except 'Timeframe' this is just a variable 'q_str' representation the query string, and for 'Timeframe' there are 2 variables - 'start' and 'end' where you could omit one of them if needed, but at least one must be provided). Do not forget to add your authentication header when requesting a search or you might be treated as anonymous user. An example request to the API for searching would look like this:
type: 'GET', url: 'https://www.example.com/api/v0/bundle/?format=json&search_type=Name&q_str=test', contentType: 'application/json', headers: [('Authorization' : auth)]
For the following examples assume that we have stored in the database the following JSON bundle with record_ID 'test_bundle':
{ "wasAttributedTo": { "_:id4": { "prov:entity": "alice:bundle2", "prov:agent": "ex:Alice" }, "_:id2": { "prov:entity": "bob:bundle1", "prov:agent": "ex:Bob" } }, "bundle": { "bob:bundle1": { "wasGeneratedBy": { "_:id5": { "prov:time": "2012-05-24T10:00:01", "prov:entity": "ex:report1" } }, "entity": { "ex:report1": { "prov:type": "report", "ex:version": 1 } } }, "alice:bundle2": { "wasDerivedFrom": { "_:id7": { "prov:usedEntity": "ex:report1", "prov:generatedEntity": "ex:report2" } }, "wasGeneratedBy": { "_:id6": { "prov:time": "2012-05-25T11:00:01", "prov:entity": "ex:report2" } }, "entity": { "ex:report1": {}, "ex:report2": { "prov:type": "report", "ex:version": 2 } } } }, "entity": { "bob:bundle1": { "prov:type": "\"prov:Bundle\"^^xsd:QName" }, "alice:bundle2": { "prov:type": "\"prov:Bundle\"^^xsd:QName" } }, "prefix": { "bob": "http://example.org/bob/", "ex": "http://www.example.com/", "alice": "http://example.org/alice/" }, "agent": { "ex:Bob": {}, "ex:Alice": {} }, "wasGeneratedBy": { "_:id1": { "prov:time": "2012-05-24T10:30:00", "prov:entity": "bob:bundle1" }, "_:id3": { "prov:time": "2012-05-25T11:15:00", "prov:entity": "alice:bundle2" } } }
Searching by name would find out all the Top-level bundles which names contains the string provided. For the example above searching for "bob:bundle" would not retrieve the bundle as it is not the top level one. Search for "test", "bundle" on the other hand would give back the bundle.
Searching by ID would retrieve all the bundles with records whose names contain the string. For the example above if we search for "bob" that would retrieve the bundle as the inner one is by it self a record. Do not forget that not only bundles are records. For instance searching for the keyword 'report' would yield a result containing the example bundle as the entity 'report1' is yet another record.
Searching by prov:type is quite straight forward - it would retrieve any bundles which contain records with the given prov:type. In our example searching by prov:type with keywords 'report' or 'prov:Bundle' would retrieve the 'test_bundle', or any strings contained in these two.
Searching in a time frame is a bit different from the rest search options. Given a times in the format 'yyyy-mm-dd hh:mm:ss'(yyyy-mm-ddThh:mm:ss for the API) for a start and end of the interval this would retrieve any bundles which contain any kind of information in that time interval. In our example if we search in the interval[2012-05-24 : 2012-05-25] would retrieve the bundle. The search can accept and only one argument, either start or end, and would retrieve all bundles with information after that date(for start) or before that date(for end). Searching with start = '2012-05-24T10:00:00' would give back the example bundle, but searching with end = '2012-05-24T06:30:00' would not give the bundle as all the information in the bundle at it's earliest at 2012-05-24T10:30:00.
Searching for a string in any text field would return all the bundles which contain any information that would match the given string, no matter record ID, type, direct names of entities etc.
{% endblock %} {% block sidebar %}


AUX
: auxiliary verb
This document is a placeholder for the language-specific documentation
for AUX
.
Treebank Statistics (UD_Latin-ITTB)
There are 63 AUX
lemmas (2%), 195 AUX
types (1%) and 11190 AUX
tokens (4%).
Out of 15 observed tags, the rank of AUX
is: 6 in number of lemmas, 7 in number of types and 10 in number of tokens.
The 10 most frequent AUX
lemmas: sum, dico, facio, video, invenio, pono, existo, efficio, significo, remaneo
The 10 most frequent AUX
types: est, sit, esse, sunt, sint, esset, dicitur, erit, fit, dicuntur
The 10 most frequent ambiguous lemmas: sum (AUX 10364, VERB 5214), dico (VERB 2234, AUX 299), facio (VERB 979, AUX 152), video (VERB 672, AUX 52), invenio (VERB 254, AUX 47), pono (VERB 521, AUX 33), existo (VERB 224, AUX 29), efficio (VERB 34, AUX 28), significo (VERB 182, AUX 19), remaneo (VERB 111, AUX 15)
The 10 most frequent ambiguous types: est (AUX 6340, VERB 2498), sit (AUX 1219, VERB 419), esse (NOUN 1121, AUX 1069, VERB 971), sunt (AUX 986, VERB 612), sint (AUX 181, VERB 97), esset (AUX 178, VERB 141), dicitur (VERB 461, AUX 173), erit (AUX 126, VERB 87), fit (VERB 199, AUX 68), dicuntur (VERB 79, AUX 52)
- est
- sit
- esse
- sunt
- sint
- esset
- dicitur
- erit
- fit
- dicuntur
Morphology
The form / lemma ratio of AUX
is 3.095238 (the average of all parts of speech is 3.636929).
The 1st highest number of forms (31) was observed with the lemma “sum”: erant, erat, erimus, erit, ero, erunt, es, esse, essendi, essent, esset, est, estis, esto, fore, foret, fuerant, fuerat, fuerint, fuerit, fuerunt, fuisse, fuissent, fuisset, fuit, simus, sint, sit, sum, sumus, sunt.
The 2nd highest number of forms (16) was observed with the lemma “facio”: faciat, facit, facta, factae, factas, facti, factum, factus, fiant, fiat, fient, fieret, fieri, fiet, fit, fiunt.
The 3rd highest number of forms (11) was observed with the lemma “dico”: dicantur, dicatur, dicentur, dicerentur, diceretur, dicetur, dici, dicimur, dicitur, dicta, dicuntur.
AUX
occurs with 10 features: la-feat/VerbForm (11190; 100% instances), la-feat/Voice (11190; 100% instances), la-feat/Tense (11186; 100% instances), la-feat/Number (10022; 90% instances), la-feat/Mood (9967; 89% instances), la-feat/Person (9967; 89% instances), la-feat/Aspect (445; 4% instances), la-feat/Case (55; 0% instances), la-feat/Degree (55; 0% instances), la-feat/Gender (54; 0% instances)
AUX
occurs with 30 feature-value pairs: Aspect=Imp
, Aspect=Perf
, Case=Abl
, Case=Acc
, Case=Gen
, Case=Nom
, Degree=Pos
, Gender=Fem
, Gender=Masc
, Gender=Neut
, Mood=Imp
, Mood=Ind
, Mood=Sub
, Number=Plur
, Number=Sing
, Person=1
, Person=2
, Person=3
, Tense=Fut
, Tense=Imp
, Tense=Past
, Tense=Pqp
, Tense=Pres
, VerbForm=Fin
, VerbForm=Gdv
, VerbForm=Ger
, VerbForm=Inf
, VerbForm=Part
, Voice=Act
, Voice=Pass
AUX
occurs with 63 feature combinations.
The most frequent feature combination is Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin|Voice=Act
(6372 tokens).
Examples: est, manet, apparet, remanet, redit, caret, existit, facit, nominat, oportet
Relations
AUX
nodes are attached to their parents using 4 different relations: la-dep/cop (9853; 88% instances), la-dep/aux:pass (1317; 12% instances), la-dep/aux (18; 0% instances), la-dep/conj (2; 0% instances)
Parents of AUX
nodes belong to 11 different parts of speech: NOUN (4343; 39% instances), ADJ (3478; 31% instances), VERB (2365; 21% instances), PRON (704; 6% instances), NUM (175; 2% instances), PROPN (78; 1% instances), ADV (27; 0% instances), DET (15; 0% instances), AUX (2; 0% instances), X (2; 0% instances), PUNCT (1; 0% instances)
11169 (100%) AUX
nodes are leaves.
9 (0%) AUX
nodes have one child.
4 (0%) AUX
nodes have two children.
8 (0%) AUX
nodes have three or more children.
The highest child degree of a AUX
node is 5.
Children of AUX
nodes are attached using 7 different relations: la-dep/conj (12; 28% instances), la-dep/cc (9; 21% instances), la-dep/obl (9; 21% instances), la-dep/advcl (4; 9% instances), la-dep/advmod (4; 9% instances), la-dep/nsubj (3; 7% instances), la-dep/obj (2; 5% instances)
Children of AUX
nodes belong to 7 different parts of speech: NOUN (12; 28% instances), CCONJ (9; 21% instances), VERB (7; 16% instances), ADV (6; 14% instances), PRON (4; 9% instances), ADJ (3; 7% instances), AUX (2; 5% instances)
Treebank Statistics (UD_Latin-PROIEL)
There are 1 AUX
lemmas (0%), 63 AUX
types (0%) and 6218 AUX
tokens (4%).
Out of 14 observed tags, the rank of AUX
is: 14 in number of lemmas, 10 in number of types and 8 in number of tokens.
The 10 most frequent AUX
lemmas: sum
The 10 most frequent AUX
types: est, sunt, esse, erat, sum, esset, erant, sit, fuit, erit
The 10 most frequent ambiguous lemmas:
The 10 most frequent ambiguous types: futurum (AUX 15, ADJ 1), futuram (AUX 6, ADJ 1), futura (AUX 5, ADJ 3), futurorum (AUX 2, ADJ 1)
- futurum
- futuram
- futura
- futurorum
Morphology
The form / lemma ratio of AUX
is 63.000000 (the average of all parts of speech is 3.260792).
The 1st highest number of forms (63) was observed with the lemma “sum”: eram, eramus, erant, eras, erat, eratis, erimus, eris, erit, eritis, ero, erunt, es, esse, essem, essemus, essent, esses, esset, essetis, est, estis, esto, estote, fore, fueramus, fuerant, fuerat, fuerim, fuerimus, fuerint, fueris, fuerit, fueritis, fuero, fuerunt, fui, fuimus, fuisse, fuissem, fuissemus, fuissent, fuisses, fuisset, fuissetis, fuisti, fuistis, fuit, futura, futuram, futurorum, futuros, futurum, futurus, sim, simus, sint, sis, sit, sitis, sum, sumus, sunt.
AUX
occurs with 9 features: la-feat/Tense (6218; 100% instances), la-feat/VerbForm (6218; 100% instances), la-feat/Voice (6218; 100% instances), la-feat/Number (5617; 90% instances), la-feat/Mood (5576; 90% instances), la-feat/Person (5576; 90% instances), la-feat/Aspect (1413; 23% instances), la-feat/Case (41; 1% instances), la-feat/Gender (41; 1% instances)
AUX
occurs with 25 feature-value pairs: Aspect=Imp
, Aspect=Perf
, Case=Acc
, Case=Gen
, Case=Nom
, Gender=Fem
, Gender=Masc
, Gender=Masc,Neut
, Gender=Neut
, Mood=Imp
, Mood=Ind
, Mood=Sub
, Number=Plur
, Number=Sing
, Person=1
, Person=2
, Person=3
, Tense=Fut
, Tense=Past
, Tense=Pqp
, Tense=Pres
, VerbForm=Fin
, VerbForm=Inf
, VerbForm=Part
, Voice=Act
AUX
occurs with 69 feature combinations.
The most frequent feature combination is Mood=Ind|Number=Sing|Person=3|Tense=Pres|VerbForm=Fin|Voice=Act
(2150 tokens).
Examples: est
Relations
AUX
nodes are attached to their parents using 16 different relations: la-dep/cop (3468; 56% instances), la-dep/aux:pass (1509; 24% instances), la-dep/aux (642; 10% instances), la-dep/root (273; 4% instances), la-dep/advcl (95; 2% instances), la-dep/ccomp (83; 1% instances), la-dep/acl (58; 1% instances), la-dep/conj (51; 1% instances), la-dep/xcomp (10; 0% instances), la-dep/obj:dir (9; 0% instances), la-dep/parataxis (8; 0% instances), la-dep/csubj:pass (5; 0% instances), la-dep/nsubj (3; 0% instances), la-dep/nsubj:pass (2; 0% instances), la-dep/orphan (1; 0% instances), la-dep/vocative (1; 0% instances)
Parents of AUX
nodes belong to 13 different parts of speech: VERB (2600; 42% instances), NOUN (1228; 20% instances), ADJ (1122; 18% instances), PRON (319; 5% instances), ADV (292; 5% instances), PROPN (279; 4% instances), ROOT (273; 4% instances), AUX (40; 1% instances), NUM (39; 1% instances), X (15; 0% instances), DET (6; 0% instances), ADP (3; 0% instances), SCONJ (2; 0% instances)
5643 (91%) AUX
nodes are leaves.
105 (2%) AUX
nodes have one child.
231 (4%) AUX
nodes have two children.
239 (4%) AUX
nodes have three or more children.
The highest child degree of a AUX
node is 8.


Company
问题描述 :
You are asked to write a program that computes the hourly wage for every job type using the data collected a period of time (one or several weeks). The number of job types is limited to 200 and the number of weeks in one data set is limited to 50.
The input contains several data sets in text format.
The format for the data set is:
The number of lines for the data set;
information_for__one_or_more_weeks
The format of the information for a week is the following:
job_type1 number_of _hours1
job_type2 number_of _hours2
job_type3 number_of _hours3
~{!-!-~}
. total_paid ( the dot marks the ending of info for a week)
The job type is represented as a string of characters (limited to 20). The number of hours is a positive integer (smaller than 1E5). The total paid is a positive integer (smaller than 2E10).
The program should write to standard output (for every job type involved in the data set) a line containing the job type and the hourly wage. The output for a data set ends with a line containing a dot.
If the program cannot compute a unique hourly wage for every job type it will print "Incomplete data" and if it cannot compute an integer hourly wage it will print "Inconsistent data"
An example is given in the following table:
样例输入:
5 job1 6 job2 5 job8 4 job10 3 . 100 13 job3 1 job2 2 . 40 job1 3 job2 1 . 100 job1 1 job3 2 job2 3 . 100 job1 1 job2 5 . 80
样例输出:
Incomplete data . job3 20 job2 10 job1 30 .
5.1处，反了；“上一个操作符的优先级比操作符ch的优先级大，或栈是空的就入栈。”如代码所述，应为“上一个操作符的优先级比操作符ch的优先级小，或栈是空的就入栈。”
全是智力分析的题
最长回文子串可以使用manacher算法，将时间复杂度降到O(n)。
“可以发现,树将是满二叉树,”这句话不对吧，构造的树应该是“完全二叉树”，而非“满二叉树”。
good !
注释很详细，多谢分享！
厉害啊，我遇见数学问题就头疼！
这是往年的笔试题，非在线，主要考察基础，Java会在面试时问到
很有意思，可惜我很菜啊
非常好，初学者就应该先理解递归
还是有些难度的！
赞！！~~大赞！！~
很有用，收藏了


{% extends "layout.html" %} {% block title %} Edit Record {% endblock %} {% block css %} {% endblock %} {% block main %}
Please verify the information to the right for correctness.
Make any changes as necessary or desired.
You will not be able to edit this information later.


| LISTEN(2) | Linux Programmer's Manual | LISTEN(2) |
#include <sys/types.h> /* See NOTES */ #include <sys/socket.h>
int listen(int sockfd, int backlog);
The sockfd argument is a file descriptor that refers to a socket of type SOCK_STREAM or SOCK_SEQPACKET.
The backlog argument defines the maximum length to which the queue of pending connections for sockfd may grow. If a connection request arrives when the queue is full, the client may receive an error with an indication of ECONNREFUSED or, if the underlying protocol supports retransmission, the request may be ignored so that a later reattempt at connection succeeds.
POSIX.1 does not require the inclusion of <sys/types.h>, and this header file is not required on Linux. However, some historical (BSD) implementations required this header file, and portable applications are probably wise to include it.
The behavior of the backlog argument on TCP sockets changed with Linux 2.2. Now it specifies the queue length for completely established sockets waiting to be accepted, instead of the number of incomplete connection requests. The maximum length of the queue for incomplete sockets can be set using /proc/sys/net/ipv4/tcp_max_syn_backlog. When syncookies are enabled there is no logical maximum length and this setting is ignored. See tcp(7) for more information.
If the backlog argument is greater than the value in /proc/sys/net/core/somaxconn, then it is silently truncated to that value. Since Linux 5.4, the default in this file is 4096; in earlier kernels, the default value is 128. In kernels before 2.4.25, this limit was a hard coded value, SOMAXCONN, with the value 128.
| 2020-02-09 | Linux |


{% extends 'base.html' %} {% block content %}
Math Contest Rules
On the contest date (February 27th), go to the contests page and you should see each round of the math contest, with the divisions that you selected. When a round begins, click the blue 'Join' button. You'll see a list of problems, and can submit answers on the same page.
This is a 90 minute test with 3 problems to be completed as a team. You can talk to your teammates over zoom, but no external tool is allowed.
This is a 60 minute test with 15 problems to be completed as a team. You can talk to your teammates over zoom, but no external tool is allowed.
During the 5-minute submission window at the end of the contest:
There are three different rounds: Algebra and Number Theory, Combinatorics and Computer Science, and Geometry.
Each round has 8 problems which need to be solved in 60 minutes.
During the round NO communication with anyone will be allowed.
Divisions and ScoringFor all short-answer tests (Team Round and Individual Rounds), you will be able to submit an arbitrary math expression as your answer. Try it out here!
Submit an answer below
Some common expressions you might need:
| Example | What to type |
|---|---|
| $a+b,\ a-b,\ a \cdot b,\ \dfrac{a}{b},\ a^b$ | Addition: a+b , Subtraction: a-b , Multiplication: a*b , Division: a/b , Exponentiation: a^b |
| $\sqrt{x},\ \sqrt[n]{x}$ | Square roots: sqrt x , $n^\text{th}$ roots: nthroot n x |
| $\ln x,\ \log x,\ \log_n x$ | Natural (base $e$) logarithm: ln x , Base $10$ logarithm: log x , Base $n$ logarithm: log_n x |
| $\sin x,\ \cos x,\ \tan x$, $\csc x,\ \sec x,\ \cot x$ |
Trig functions: sin x , cos x , tan x , csc x , sec x , cot x |
| $\dbinom{n}{k},\ n!$ | Binomial coefficients: binom n k , Factorials: n! |
| $|x|$ | Absolute value: |x| |
| $\pi,\ e$ | Constants: pi , e |
Your submitted answers will be automatically graded by a computer. In general, submissions that are mathematically equivalent to the correct answer will be considered correct. This means that for the following example problem:
Evaluate the sum $\displaystyle \sum_{i=0}^5 \binom{7}{i} \binom{8}{5-i}$.
answers such as $\binom{15}{5}$, $\frac{15!}{5! \cdot 10!}$, and $3003$ will all be considered correct.
All answers must be closed-form expressions, and there is a maximum submission length. This means that answers such as $\sum\limits_{i=0}^5 \binom{7}{i} \binom{8}{5-i}$ and $\binom{7}{0} \binom{8}{5} + \binom{7}{1} \binom{8}{4} + \binom{7}{2} \binom{8}{3} + \binom{7}{3} \binom{8}{2} + \binom{7}{4} \binom{8}{1} + \binom{7}{5} \binom{8}{0}$ will be marked as incorrect (the former is not closed-form, and the latter is too long).
You should try to simplify your answers as much as possible, but you don't need to worry about trivial simplifications like $\frac{1}{\sqrt{3}}$ vs $\frac{\sqrt{3}}{3}$. All reasonably simplified answers will be below the maximum submission length. If you believe that your submission was graded incorrectly, ask a CMIMC organizer on Slack and we will manually grade it.


Written by: Antonius Torode - 1/8/2021
Before beginning: Make sure you have a healthy snack! A bowl of some fresh nuts or cut up vegetables is great to have while working. That way you can stay focused and the urge of hunger does not creep up on you. That, and healthy snacks can help you think and concentrate! I would also recommend some non-distracting music to play in the background. One of my favorites for things like this can be found at this link: super cool coding music (the music changes for each article!).
In the last tutorial, we covered setting up an account on github to manage and store your files. You technically can simple stick to using that method, updating through the website, and even dragging and dropping new files to upload them directly. Although possible, I believe (once set up) that being able to work locally on your computer is significantly more productive and allows you to have much more control and power over what you are creating. For this purpose, this page will walk through the steps of setting up git locally so you can use the tools you desire for creating your website (such as CLion, Dreamweaver, Notepad++, etc) easily. You will essentially have all the files on your computer, and when you are happy with them, then you can push them to the github server for the public to see.
As stated on their website, "Git is a free and open source distributed version control system designed to handle everything from small to very large projects with speed and efficiency." Git allows you to take files you are working on, have multiple versions, revert to older versions, manage current versions, and keep consistent files across all of your workspaces and machines. For the purposes of our need, git is easily integrated to use with github, and allows us to update a github.io webpage with ease! You can visit the git website to learn more about it, view documentation, and more on the official git website https://git-scm.com/. Git is a powerful industry tool that is capable of many things. Although at times it can seem overwhelming or challenging, it is very simple to use for the purposes I will outline. Do not be overwhelmed.
This page is set up in parts for various operating systems. When following this tutorial, ensure that you are looking at the sections with the heading of the operating system you are using (i.e. Linux, Windows, Mac, etc).
Head over the the git homepage located at https://git-scm.com/. Press the "Download for Windows" button.
A download window will appear. Select "Save File".
Run the executable that appears and follow through the setup windows. You can leave all options as they are by default or change them if desired. Once this completes, that is it, you now have git installed on your computer!
Congratulations, you have successfully installed git on Windows (assuming you followed all above steps)!
Open a terminal window and enter the following commands (pressing enter after each one to run it).
$ sudo apt-get update
$ sudo apt-get install git
Verify that git is installed by checking to see if it can tell you the git version number with the following command.
$ git --version
Configure your git username and email using the following commands. Fill in your actual username and email in the below commands accordingly.
$ git config --global user.name "Username"
$ git config --global user.email<EMAIL_ADDRESS>Congratulations, you have successfully installed git on Linux (assuming you followed all above steps)!
If you have a Mac, you can install git using the steps on the following page. I do not own or have access to a Mac and can therefore not provide a sufficient tutorial write up on the process. https://git-scm.com/download/mac
There are many different ways to use git. These range from using terminal commands, using a GUI client, or using an IDA that supports version control integration (such as CLion). Personally (when using Windows) I use git through the Cygwin terminal (a large collection of tools which provide functionality similar to a Linux distribution on Windows) and through integration with CLion (A Cross-Platform IDE for C and C++ by JetBrains which contains support for HTML, python, Javascript, and other languages/scripts). Both of which are completely free for open source projects (which a github.io site typically is). The way you use git is largely dependant on the other programs and system you use, however for the purpose of this tutorial, we will cover using Sourcetree (a free Git GUI client that works on both Windows or Mac). If you want to use a different method, feel free to do so, though this page may not help you much.
First, head over to https://www.sourcetreeapp.com/, download Sourcetree, and then install Sourcetree. You will need to create a Bitbucket account in order to use Sourcetree. This is a free account similar to the github account created in the last tutorial. Upon running the Sourcetree installer, you will need to link your Bitbucket account.
Then, uncheck the Mercurial option in the next step and enter your github username and email when asked for name and email, then finish the installation.
There is also a nice tutorial on setting up Sourcetree on the github website which can be found here if you need more information: https://github.com/gsoft-inc/dynamite/wiki/Getting-started-with-SourceTree,-Git-and-git-flow
After installation, the Sourcetree program should open. Under the remote repositories tab, you will need to click "Add an account...". A window will open and then you will need to select Github for the "hosting service", HTTPS for the "preferred protocol". Then, select OAuth for the "Authentication" and press the "Refresh OAuth Token" button. A browser will open Github and it will ask if you would like to allow this app to be authorize. Press "Authorize atlassian". Then, a green checkmark icon and an "Authentication OK" message will appear in your Sourcetree window (as shown in the image below).
Your Github repository should onw appear in the remove repositories list. Select in and start to type the name of your repository in the search bar. It should appear. Select your repository and press the small "clone" button in the bottom right hand corner.
A window will appear that allows you to edit the information for this repository. The first box is the address of the repository, which should be automatically filled in correctly for you. The second box is the folder on your computer that you want the files to get copied to. This should end if your complete repository name, which will be the folder the files will be placed into (see image below). You can ignore any advanced options if you are a beginner.
Finally, click clone. Once finished cloning, you should see all of the files from your repository on github appear in the folder you entered in the previous steps. You should be able ot see your history of things you have committed as well, including adding our index.html file if you followed the steps in the previous article. An example of what it should look like can be seen in the image below.
Congratulations,you have completed setting up SourceTree for use (assuming you followed the above steps)! Now we will discuss the basics of how to use SourceTree.
Sourcetree does support the Linux operating system. I have never used a git gui for Linux either other than integration through CLion. Typically, linux users are familiar with basic terminal usage and thus should be okay with using at least the basic commands for git through a terminal. I will explain some of these commands in the next section.
The basic principles of git are as follows.
Now that you have Sourcetree installed, you can use this to update any website files in your repository folder. Go ahead and make a small change in your index.html file for testing purposes. Once a file is modified or added to your repository folder, it will appear in the Sourcetree window. You can move the modified files to the staging area to prepare them for a commit. The preview window to the right will show you the staged changes.
After committing changes, the "Push" button will show that it has pushes it can send to the server.Press the push button. It should prompt you for your github username and password. Enter these and then click push. If everything works, it will return to the main window. If an error occurs, you may have to fiddle with the settings in Tools > Authentication to get it to work.
Assuming all worked properly, congratulations, you now have all the tools necessary to edit files in your repository and then update your live website!
This will cover how to push changes from your repository via command line (terminal). Open a terminal window and navigate to the project repository. After making a change, you can utilize the following commands.
git status
- to display all the files that have changed.git add -A
- This will add all files to the staging area. If you don't use "-A", you can specify only desired files.git commit -m "message"
- This will commit the staged files with the commit message specified in the quotation marks.git push
- This will push all committed changes to the server.For a more comprehensive list of git commands and what they do, you can download the free resource below.
That is all it takes to update files from your repository to your website!


Bomara Crawler
Selected crawler:
APC
Select a crawler
Clear
Clear Output Folder
Breadcrumbs ----------------------------
(A link to the vendor's index page is automatically added)