Datasets:

caffeinism

/

tiny-pajama-parquet

like 0

CBA legal challenge heads to B.C. Court of Appeal By David Weir|June 26th, 2020|Advocacy, Community Benefits Agreement| The construction industry partners challenging B.C.'s Community Benefits Agreement (CBA) will be in court July 16 and 17 to appeal the B.C. Supreme Court ruling that stalled the judicial review last February. The B.C. Court of Appeal will be asked to overturn Supreme Court Justice Christopher Giaschi's decision striking portions of the petition for [...] CBA update – BCIB publishes updated FAQ By David Weir|March 2nd, 2020|Advocacy, Community Benefits Agreement, In The News| Contractors wanting to understand how B.C.'s Community Benefit Agreement (CBA) will be applied may find the answers they need in an updated Contractor & Subcontractor Q and A document produced by B.C. Infrastructure Benefits Inc. (BCIB). The updated Q&A, which was posted recently to a redesigned BCIB website, provides answers to several questions VRCA [...] VRCA attends rally demanding government stops the CBA roll-out By David Weir|November 22nd, 2019|Advocacy, Community Benefits Agreement, In The News| The Vancouver Regional Construction Association (VRCA) joined industry representatives and progressive labour unions at the B.C. legislature on November 19 to demand the provincial government stop the roll-out of its prescriptive and regressive Community Benefits Agreement (CBA), introduced in July 2018. "Our industry is deeply offended at the lack of industry engagement that took [...] Community Benefits Agreement and regional advocacy the focus at November Division meetings By David Weir|October 21st, 2019|Advocacy, Community Benefits Agreement, General Contractors, Manufacturers & Suppliers, Trade Contractors| The provincial government policy requiring key infrastructure projects to be built using the Community Benefits Agreement (CBA) framework continues to be one of the top issues worrying B.C.'s construction industry. Join us at Division meetings in November to get an update on: The legal challenge to the CBA brought by VRCA and its industry [...] Separating fact from fake on the B.C government's infrastructure deal By David Weir|January 21st, 2019|Advocacy, Community Benefits Agreement, In The News| Do you support forcing the Canucks to play with half of their own players while having the other half assigned to them at game time? We suspect few would agree to such a proposal, yet that's exactly what the B.C. Government is asking construction companies to do under its Community Benefits Agreement (CBA). Paul [...] BCCA shares BCIB's responses regarding the Community Benefits Agreement By David Weir|November 19th, 2018|Advocacy, Community Benefits Agreement| There are many questions about the Community Benefits Agreement that can't be answered by reading the agreement itself. Some, but not all, of the questions were answered during a recent meeting between the B.C. Construction Association (BCCA) and BC Infrastructure Benefits (BCIB). Based on member feedback at the Oct. 17 Division meeting, VRCA compiled [...] Who really benefits from community benefits agreements? By David Weir|October 22nd, 2018|Advocacy, Community Benefits Agreement, Events, In The News| VRCA and Mierau Contractors Ltd. are co-sponsoring the Abbotsford Chamber of Commerce November luncheon Nov. 1. The topic is: "Who really benefits from community benefits agreements?" The guest speaker will be Ken Baerg, executive director of Canada Works. Baerg is a seasoned labour relations strategist and practitioner who is passionate about supporting sustainable and [...] VRCA launches advocacy section on its website By David Weir|October 1st, 2018|Advocacy, Community Benefits Agreement, In The News| As British Columbia's oldest and largest regional construction association, the Vancouver Regional Construction Association (VRCA) represents the general and trade contractors, manufacturers, suppliers and various professional services providers who operate in the industrial, commercial and institutional construction industry in the Lower Mainland. As such, VRCA publicly takes positions and speaks out on business issues [...] Community Benefits Town Hall Meeting By Fiona Famulak|September 17th, 2018|Advocacy, Community Benefits Agreement, In The News| Dear member, Please join us for an important members-only town hall meeting to discuss industry's response to the new Community Benefits Agreement (CBA) that: forces construction workers to join and pay dues to the Building Trades Unions as a condition of working on certain public construction projects where the CBA will be used, which [...] BCCA launches letter campaign to fight Community Benefits Agreement By David Weir|August 13th, 2018|Advocacy, Community Benefits Agreement, In The News| The BC Construction Association (BCCA), on behalf of the four regional construction associations, has launched a letter-writing campaign against the Community Benefits Agreement for key infrastructure projects in B.C. Trades people and owners of construction companies are encouraged to sign a pre-drafted letter that will be sent to B.C. Premier John Horgan explaining why [...]

A Tribute to Late Professor Mahlagha Ghorbanli This edition of IJPP celebrates ten years of steady publication of Iranian Journal of Plant Physiology. The story of IJPP is that of a journey that started from a local forum where the researchers and scholars mainly from the Islamic Azad University could share findings of their studies, gradually developing into an international peer-reviewed journal indexed by Islamic World Science Citation Center (https://isc.gov.ir/en) and SCImago Journal & Country Rank (www.scimagojr.com). We heartily appreciate numerous authors, both local and international, whose contributions have led us reach this far and look forward to more original research reports to move even further. This edition is dedicated to late Mahlagha Ghorbanli, the emerita full professor of plant physiology in Kharazmi University, the first institution for teacher education in Iran. With her broad range of expertise and comprehensive knowledge of various research avenues in the field of plant physiology combined with a warm, caring, and supportive personality, professor Ghorbanli was the first Editor-in-Chief of IJPP, a prominent figure who was able to lead the editorial board of IJPP through the challenges inherent in starting a scientific journal. We owe much of what we have achieved to her scholarship and visions. May her soul rest in peace! Iranian Journal of Plant Physiology (2020). A Tribute to Late Professor Mahlagha Ghorbanli. Iranian Journal of Plant Physiology, 11(1), -. . "A Tribute to Late Professor Mahlagha Ghorbanli". Iranian Journal of Plant Physiology, 11, 1, 2020, -. (2020). 'A Tribute to Late Professor Mahlagha Ghorbanli', Iranian Journal of Plant Physiology, 11(1), pp. -. A Tribute to Late Professor Mahlagha Ghorbanli. Iranian Journal of Plant Physiology, 2020; 11(1): -.

Calciatore dell'anno (Futbollisti Shqiptar i Vitit) – premio calcistico dell'Albania, assegnato dalla Federazione calcistica dell'Albania Calciatore dell'anno (Futbolista Argentino del Año) – premio calcistico dell'Argentina, organizzato dall'Associazione dei Giornalisti Sportivi argentini (Círculo de Periodistas Deportivos, CPD) Calciatore dell'anno – premio calcistico dell'Armenia, assegnato dalla Federazione calcistica dell'Armenia Calciatore dell'anno (APA-Fußballerwahl) – premio calcistico dell'Austria, assegnato dagli allenatori della Bundesliga austriaca Calciatore dell'anno – premio calcistico del Belgio, assegnato dal quotidiano Het Laatste Nieuws Calciatore dell'anno (футбаліст года Беларусі) – premio calcistico della Bielorussia, assegnato dal quotidiano Прессбол (Pressbol) Calciatore dell'anno (Футболист №1 на България) – premio calcistico della Bulgaria, assegnato congiuntamente da vari giornali Calciatore dell'anno – premio calcistico della Cecoslovacchia, assegnato dal giornale sportivo Stadion fino al 1992 Calciatore dell'anno – premio calcistico del Cile, assegnato dal Círculo de Periodistas de Chile Calciatore dell'anno – premio calcistico della Croazia, assegnato dalla Federazione calcistica croata Calciatore dell'anno (Årets Fodboldspiller i Danmark) – premio calcistico della Danimarca assegnato dalla Spillerforeningen, l'associazione dei calciatori danesi Calciatore dell'anno (Aasta parim jalgpallur) – premio calcistico dell'Estonia Calciatore dell'anno – premio calcistico delle Fær Øer Calciatore dell'anno (Vuoden jalkapalloilija) – premio calcistico della Finlandia, assegnato dalla Federazione finlandese Calciatore dell'anno (Joueur français de l'année) – premio calcistico della Francia, assegnato dal quotidiano France Football Calciatore dell'anno – premio calcistico della Georgia Calciatore dell'anno – premio calcistico della Germania, assegnato dal quotidiano sportivo Kicker e dall'Associazione dei giornalisti sportivi tedeschi (Verband der Deutschen Sportjournalisten) Calciatore dell'anno – premio calcistico della Ghana, assegnato dalla Federazione calcistica del Ghana Calciatore dell'anno – premio calcistico della Grecia Calciatore dell'anno (Ireland of North Football Writers' Association Player of the Year) – premio calcistico dell'Irlanda del Nord, assegnato dalla Federcalcio dell'Irlanda del Nord Calciatore dell'anno – premio calcistico dell'Islanda, assegnato dalla Federazione calcistica islandese Calciatore dell'anno – premio calcistico di Israele, assegnato dal quotidiano israeliano Maariv Calciatore dell'anno – premio calcistico della Jugoslavia Calciatore dell'anno – premio calcistico del Kazakistan Calciatore dell'anno – premio calcistico della Lettonia, assegnato a partire dalla Federazione calcistica della Lettonia Calciatore dell'anno – premio calcistico della Lituania Calciatore dell'anno – premio calcistico del Lussemburgo, assegnato dal giornale Luxemburger Wort Calciatore dell'anno – premio calcistico della Macedonia del Nord, assegnato dalla Federazione calcistica della Macedonia del Nord Calciatore dell'anno – premio calcistico di Malta, assegnato dalla Federazione calcistica di Malta Calciatore dell'anno – premio calcistico della Moldavia, assegnato dalla Federazione calcistica della Moldavia Calciatore dell'anno – premio calcistico del Montenegro, assegnato dalla Federazione calcistica del Montenegro Calciatore dell'anno – premio calcistico dei Paesi Bassi, assegnato dai calciatori che militano in Eredivisie e Eerste Divisie Calciatore dell'anno – premio calcistico del Paraguay, assegnato dal giornale ABC Color Calciatore dell'anno (PFA Players' Player of the Year) – premio calcistico assegnato da giocatori della Premier League Calciatore dell'anno (PFAI Players' Player of the Year) – premio calcistico assegnato dai membri della Professional Footballers' Association of Ireland Calciatore dell'anno (Plebiscyt Piłki Nożnej) – premio calcistico della Polonia, assegnato dal quotidiano Piłka Nożna Calciatore dell'anno (Futebolista do Ano em Portugal) – premio calcistico del Portogallo, assegnato da vari giornali Calciatore dell'anno (FWA Footballer of the Year) – premio calcistico del Regno Unito, assegnato dai membri della Football Writers' Association Calciatore dell'anno – premio calcistico della Repubblica Ceca, assegnato dalla Federcalcio ceca Calciatore dell'anno (Fotbalistul român al anului) – premio calcistico della Romania, assegnato dal quotidiano Gazeta Sporturilor Calciatore dell'anno – premio calcistico della Russia, assegnato dal quotidiano russo Sport-Express Calciatore dell'anno (SPFA Players' Player of the Year) – premio calcistico della Scozia, assegnato dai giocatori della Scottish Premier League Calciatore dell'anno (SFWA Footballer of the Year) – premio calcistico della Scozia, assegnato dai membri della Scottish Football Writers' Association Calciatore dell'anno – premio calcistico della Serbia, assegnato dalla Federazione calcistica della Serbia Calciatore dell'anno – premio calcistico della Slovacchia Calciatore dell'anno – premio calcistico della Slovenia, assegnato dalla Federazione calcistica della Slovenia Calciatore dell'anno – premio calcistico della Svizzera, assegnato dal quotidiano Sport e poi dalla federazione calcistica della Svizzera Calciatore dell'anno – premio calcistico della Svizzera, assegnato dalla federazione calcistica della Svizzera Calciatore dell'anno – premio calcistico della Ucraina, assegnato da diversi giornali sportivi Calciatore dell'anno (Magyar Aranylabda) – premio calcistico della Ungheria, assegnato dalla Federazione calcistica dell'Ungheria Calciatore dell'anno – premio calcistico della Unione Sovietica, assegnato dal giornale sportivo Futbol. Chokkej Pagine correlate Calciatrice dell'anno

Q: Limit on symbol table? I've been looking into some corner cases for loading python (2.7 on osx) files as configuration files. I wanted to see what the behavior was if I circularly ran execfile. I expected a out of memory error or a lot of swapping to occur, but I was rather surprised when I got a different result. I setup a test scenario as follows: 'd' python script with: #!/usr/bin/python x = 0 execfile("d1") 'd1' python script with: #!/usr/bin/python x += 1 print "x = %d" % x execfile("d2") 'd2' python script with: #!/usr/bin/python x += 1 print "x = %d" % x execfile("d1") The result: $ ./d x = 1 x = 2 x = 3 ... removed for brevity ... x = 997 x = 998 x = 999 Traceback (most recent call last): File "./d", line 5, in <module> execfile("d1") File "d1", line 5, in <module> execfile("d2") File "d2", line 5, in <module> execfile("d1") ... removed for brevity ... File "d1", line 5, in <module> execfile("d2") File "d2", line 5, in <module> execfile("d1") File "d1", line 5, in <module> execfile("d2") KeyError: 'unknown symbol table entry' I was just curious if there was someone who could explain what is happening here? Why does it stop after executing execfile ~1000 times? A: From the Python source code, Objects/dictobject.c: /* Note that, for historical reasons, PyDict_GetItem() suppresses all errors * that may occur (originally dicts supported only string keys, and exceptions * weren't possible). So, while the original intent was that a NULL return * meant the key wasn't present, in reality it can mean that, or that an error * (suppressed) occurred while computing the key's hash, or that some error * (suppressed) occurred when comparing keys in the dict's internal probe * sequence. A nasty example of the latter is when a Python-coded comparison * function hits a stack-depth error, which can cause this to return NULL * even if the key is present. */ So, PyDict_GetItem() does not always report errors correctly. Interesting... so in the following code in Python/symtable.c, v = PyDict_GetItem(st->st_blocks, k); if (v) { assert(PySTEntry_Check(v)); Py_INCREF(v); } else { PyErr_SetString(PyExc_KeyError, "unknown symbol table entry"); } Any error that occurs when looking up a symbol (including out-of-memory errors) will be turned into a KeyError. This is probably a bug.

Niels Jacobsen (14 September 1865 - 31 January 1935) was a Danish architect and politician who worked primarily in Odense. He was also the Chairman of The Lego Group until his death. Biography Born in Aabenraa, Jacobsen was the son of shipbuilder Niels Jacobsen and Marie Kjaer. Jacobsen initially trained as a bricklayer. In September 1884, he began his studies at the Royal Danish Academy of Fine Arts in Copenhagen, where he studied under Hans Jørgen Holm. Graduating in 1890, he was subsequently employed by Johan Daniel Herholdt, Ferdinand Meldahl, and Martin Nyrop. He opened his own design studio in Odense in 1893. From 1894 to 1908, he taught at Odense Technical College, served on the Board of Directors 1909-25, and participated in architectural competitions as a judge. Jacobsen was a member of the Odense City Council 1909-25, and chairman from 1911. He was honored as a Knight of the Dannebrog. Jacobsen was in Italy in 1891. He exhibited at Charlottenborg Spring Exhibition in 1898, the World Exhibition in Paris in 1900, the City Hall exhibition in Copenhagen in 1901, as well as the Kunstgewerbemuseum Berlin in 1910. On August 11, 1893, he married Christiane Sophie Magdalene Bertram Petersen Møller (born 1872, Gråsten). He died in 1935 and is buried in Odense. Selected works Odense Grand Hotel, Jernbanegade 18 (1896–97, extended 1911 by Jacobsen) Telephone exchange, Jernbanegade 16 (1897) Extension of Funen Art Museum, Jernbanegade 13 (1897–98) Odense Technical College, Hunderupvej 15 (1898, 1921) Fyens Forsamlinghus, Kongensgade 64-68 (1900, 1910) Handelsbanken, Vestergade 12-14 (1900, partially preserved) Ansgars Church (1902) Restoration of Sankt Hans Rectory, Odense (1906) Fyns Tidenes building, Fisketorvet (1907) Electricity Power Station, Klosterbakken (the original part 1908) University Society Building, Slotsvæget (1909) Gråbrødreplads 6-7 (1910–11) Odense Vinkompagni, Klostervej 5-13 (1911–12, 1917) Odense Theatre, Jernbanegade 21 (1913–14) PC Rasmussen's Department Store, Vestergade 16 (1914) Bispegården, Klaregade 17 (1916) Det Borgerlige Byggeselskab, tradesman field (1917) Foundation Eilschous Boliger, Lahnsgade (1919–20) Odense Courthouse, Albanigade 28 (1919–21) Expansion of the Odense County and City Hospotal (1926–28); Hans Christian Andersen Museum (1929–30) Elsewhere Ommel Church, Æro (1892–94) Chapel in Glorup Park (limestone, 1898) St. George Church near Aabenraa (1903–04) Nordslesvigske Folkebank, Aabenraa (1911–12) Tower of Marstal Church (1920) References External links Niels Jacobsen at Kunstindeks Danmark/Weilbachs Kunstnerleksikon 1865 births 1935 deaths People from Aabenraa Municipality People from Odense Danish architects

Cookies are small files placed on your device or held in your browser memory, when you visit our website. The cookies that we use do not store any personal or confidential information about you. Disabling these cookies may prevent you from using certain parts of this website.

The Steel City Cup is a greyhound racing competition held annually at Owlerton Stadium in Sheffield. It was inaugurated in 1970. Past winners Venues & Distances 1970-present (Sheffield 500m) Sponsors 1994–2009 (William Hill) 2010–2010 (Betfair) 2011–2017 (Betfred) 2018–2018 (Greyhound Media Group) 2019–2019 (Racing Post Greyhound TV) 2021–2022 (BresBet) References Greyhound racing competitions in the United Kingdom Sports competitions in Sheffield Sport in Sheffield Recurring sporting events established in 1970

package com.basho.riak.client.itest; import static org.junit.Assert.*; import org.apache.commons.httpclient.URIException; import com.basho.riak.client.request.RequestMeta; import com.basho.riak.client.response.HttpResponse; public class Utils { public static RequestMeta WRITE_3_REPLICAS() { return RequestMeta.writeParams(3, 3); } public static void assertSuccess(HttpResponse response) { if (!response.isSuccess()) { StringBuilder msg = new StringBuilder("Failed "); msg.append(response.getHttpMethod().getName()).append(" "); try { msg.append(response.getHttpMethod().getURI().toString()); } catch (URIException e) { msg.append(response.getHttpMethod().getPath()); } msg.append(" -- ") .append(response.getHttpMethod().getStatusLine()).append("; ") .append("Response headers: ").append(response.getHttpHeaders().toString()).append("; ") .append("Response body: ").append(response.getBody()); fail(msg.toString()); } } }

Q: Execute shell script on cygwin from Python I want to execute a shell script, on cygwin from Python. The shell script is creating a file as an output. I tried import os import subprocess os.chdir(r"C:\\cygwin64\\bin\\ ") cmd = ["bash", "-c", 'cd /<path for the script>; ./test.sh'] subprocess.call(cmd) A: This works: import os, subprocess os.chdir(r"C:\cygwin64\bin") cmd = ["bash", "-c", "cd $HOME; pwd; exit"] ret = subprocess.call(cmd)

Q: cannot resolve method getText() I'm new to Android developing and I'm trying to create a TODO list similar to an online tutorial I'm following. Everything but "todoText.setText(todoList.get(position).getText());" compiles correctly. With that line, I get the following error message: "cannot resolve method getText()." This is part of a class responsible for displaying each list row in a TODO checklist: @Override public View getView(int position, View convertView, ViewGroup parent) { LayoutInflater inflater = (LayoutInflater) context.getSystemService(Context.LAYOUT_INFLATER_SERVICE); View rowView = inflater.inflate(R.layout.activity_main, parent, false); TextView todoText = (TextView) rowView.findViewById(R.id.todoText); todoText.setText(todoList.get(position).getText()); return rowView; } I have no idea how to fix this. Any help would be greatly appreciated. Thank you. A: Hard to say without seeing todoList declaration, but chances are that todoList is a List of Strings (or something else but a TextView). If that's the case, you may just need to do.- todoText.setText(todoList.get(position)); A: I have no idea about the contents of your todoList but you can do a workaround if the content is not a String by using .toString() Try to change the code into - todoText.setText(todoList.get(position).toString()); hope it works.

IBM Retirement Fund decreased its holdings in shares of IAC/InterActiveCorp (NASDAQ:IAC) by 7.8% during the 4th quarter, according to its most recent 13F filing with the Securities and Exchange Commission. The firm owned 1,119 shares of the company's stock after selling 95 shares during the period. IBM Retirement Fund's holdings in IAC/InterActiveCorp were worth $205,000 at the end of the most recent reporting period. Other hedge funds and other institutional investors have also added to or reduced their stakes in the company. Toronto Dominion Bank increased its position in IAC/InterActiveCorp by 23.2% during the 4th quarter. Toronto Dominion Bank now owns 10,427 shares of the company's stock worth $1,908,000 after purchasing an additional 1,965 shares during the period. Nordea Investment Management AB increased its position in IAC/InterActiveCorp by 29.0% during the 3rd quarter. Nordea Investment Management AB now owns 3,014 shares of the company's stock worth $653,000 after purchasing an additional 678 shares during the period. Westpac Banking Corp increased its position in IAC/InterActiveCorp by 51.0% during the 4th quarter. Westpac Banking Corp now owns 12,652 shares of the company's stock worth $2,316,000 after purchasing an additional 4,272 shares during the period. Morgan Stanley increased its position in IAC/InterActiveCorp by 153.4% during the 3rd quarter. Morgan Stanley now owns 1,471,397 shares of the company's stock worth $318,880,000 after purchasing an additional 890,730 shares during the period. Finally, DekaBank Deutsche Girozentrale boosted its stake in shares of IAC/InterActiveCorp by 9.3% during the 3rd quarter. DekaBank Deutsche Girozentrale now owns 4,103 shares of the company's stock worth $879,000 after acquiring an additional 350 shares in the last quarter. Institutional investors own 88.19% of the company's stock. Shares of IAC/InterActiveCorp stock opened at $224.00 on Friday. IAC/InterActiveCorp has a fifty-two week low of $128.80 and a fifty-two week high of $224.40. The firm has a market cap of $18.34 billion, a price-to-earnings ratio of 40.07, a price-to-earnings-growth ratio of 2.38 and a beta of 1.09. The company has a debt-to-equity ratio of 0.63, a quick ratio of 3.13 and a current ratio of 3.13. IAC/InterActiveCorp (NASDAQ:IAC) last issued its quarterly earnings results on Thursday, February 7th. The company reported $2.04 earnings per share for the quarter, topping analysts' consensus estimates of $0.99 by $1.05. IAC/InterActiveCorp had a return on equity of 16.11% and a net margin of 14.71%. The company had revenue of $1.10 billion for the quarter, compared to analyst estimates of $1.07 billion. During the same quarter in the prior year, the company posted $0.37 EPS. The business's revenue for the quarter was up 16.1% compared to the same quarter last year. Analysts expect that IAC/InterActiveCorp will post 4.5 earnings per share for the current fiscal year. In related news, CFO Glenn Schiffman sold 2,000 shares of the stock in a transaction on Friday, March 1st. The stock was sold at an average price of $213.68, for a total value of $427,360.00. The sale was disclosed in a filing with the Securities & Exchange Commission, which is available through this link. Also, Director David S. Rosenblatt sold 4,528 shares of the stock in a transaction on Tuesday, February 12th. The shares were sold at an average price of $220.64, for a total value of $999,057.92. The disclosure for this sale can be found here. Over the last 90 days, insiders have sold 10,528 shares of company stock valued at $2,222,948. Insiders own 10.90% of the company's stock. Several equities research analysts have recently commented on IAC shares. Zacks Investment Research raised IAC/InterActiveCorp from a "sell" rating to a "hold" rating in a research note on Thursday, February 14th. BidaskClub lowered IAC/InterActiveCorp from a "buy" rating to a "hold" rating in a research note on Thursday, February 28th. ValuEngine raised IAC/InterActiveCorp from a "buy" rating to a "strong-buy" rating in a research note on Tuesday, January 29th. Goldman Sachs Group started coverage on IAC/InterActiveCorp in a research note on Monday, February 4th. They issued a "neutral" rating and a $226.00 target price on the stock. Finally, Aegis reaffirmed a "buy" rating and issued a $250.00 target price on shares of IAC/InterActiveCorp in a research note on Thursday, November 22nd. One investment analyst has rated the stock with a sell rating, three have given a hold rating, eighteen have given a buy rating and one has issued a strong buy rating to the company. IAC/InterActiveCorp currently has a consensus rating of "Buy" and a consensus price target of $240.83. TRADEMARK VIOLATION WARNING: This report was originally published by Highlight Press and is owned by of Highlight Press. If you are reading this report on another site, it was illegally stolen and republished in violation of United States and international copyright laws. The original version of this report can be read at https://highlightpress.com/2019/03/22/iac-interactivecorp-iac-holdings-cut-by-ibm-retirement-fund.html. Want to see what other hedge funds are holding IAC? Visit HoldingsChannel.com to get the latest 13F filings and insider trades for IAC/InterActiveCorp (NASDAQ:IAC).

Planet of Birds Source to all birds on the Planet Folklore Tales New Species Greater Yellow-headed Vulture (Cathartes melambrotus) Cathartidae, Falconiformes, South America [order] FALCONIFORMES | [family] Cathartidae | [latin] Cathartes melambrotus | [authority] Wetmore, 1964 | [UK] Greater Yellow-headed Vulture | [FR] Grand Urubu | [DE] Grosser Gelbkopfgeier | [ES] Aura Selvatica | [NL] Grote Geelkopgier Monotypic species The genus Cathartes includes medium-sized to large carrion-feeding birds in the New World vulture (Cathartidae) family. The three species currently classified in this genus occur widely in the Americas. Physical charateristics The adult is a very deep black overall, with green and purple sheen. Its eyes are red, its feet black and its beak id flesh coloured. The throat and the sides of the head vary from deep yellow to pale orange, with a blue crown and a blue spot in front of the eyes. wingspan min.: 165 cm wingspan max.: 178 cm size min.: 74 cm size max.: 81 cm incubation min.: 32 days incubation max.: 40 days fledging min.: 70 days fledging max.: 85 days broods: 1 eggs min.: 1 eggs max.: 3 South America : Amazonia Typically low tropical forest and less inclined to use open or disturbed forest. The Greater Yellow-headed Vulture roosts on high, exposed dead trees to observe surrounding terrain. When flying, it travels in pairs or alone and is rarely found in groups. Flight is heavy and steady. It flies with its wings held flat or very slightly above horizontal, in what is called the dihedral position. The flight of the Greater Yellow-Headed is an example of static soaring flight, which uses thermals to maintain altitude without the need to flap its wings. The Greater Yellow-headed Vulture also has the unusual habit of urohydrosis, in which it urinates or defecates on its legs to cool them evaporatively. This behavior is exhibited by storks and New World vultures. Greater Yellow-headed Vultures do not build nests, but rather lay their eggs directly on cliffs, the floors of caves, the ground, or in the hollows of stumps. Eggs are cream-colored and blotched with brown spots, particularly around the larger end. Clutch size ranges from one to three, though two is the norm. The chicks are altricial?blind, naked and relatively immobile upon hatching, and grow down feathers later. The parents feed their young by regurgitating pre-digested food into their beak, where the chicks then drink it. Young fledge after two to three months; eggs are incuated for about five to seven weeks. Feeding habits The primary staple of this vulture's diet is carrion, though it is very fond of fish, and may occasionally take them alive. Relies heavily on olfactoin (smell) to detect prey. The Greater Yellow-headed Vulture is a scavenger and subsists entirely on carrion. It will eat roadkill or other animal carcasses. It prefers fresh meat, but often cannot make the first cut into the carcass of a larger animal as its beak is not strong enough to tear into the tough hide. After a few days, the Greater Yellow-headed Vulture will no longer feed on a piece of carrion, as the meat will begin to decay and become contaminated with microbial toxins. It will drink water from a pool, pond, or any receptacle provided. Like other vultures, they play an important role in the ecosystem by disposing off carrion which could otherwise be a breeding ground for disease. The Greater Yellow-headed Vulture forages using its keen eyesight to locate carrion on the ground, but also uses its sense of smell, an ability which is uncommon in the avian world. It locates carrion by detecting the scent of ethyl mercaptan, a gas produced by the beginnings of decay in dead animals. The olfactory lobe of its brain responsible for processing smells is particularly large compared to other animals. This characteristic of New World Vultures has been used by humans: ethyl mercaptan is injected into pipelines, and engineers looking for leaks then follow the vultures. King Vultures, which lack the ability to smell carrion, follow the Greater Yellow-headed Vultures to carcasses, where the King Vulture tears open the skin of the dead animal. This allows the smaller Greater Yellow-headed Vulture access to food, as it does not have a bill strong enough to tear the hide of larger animals. This is an example of mutual dependence between species. It is generally displaced from carcasses by both Turkey Vultures and King Vultures, due to their larger size. Video Greater Yellow-headed Vulture httpv://www.youtube.com/watch?v=QTrjd1H-Zao copyright: J. del Hoyo This species has an extremely large range, and hence does not approach the thresholds for Vulnerable under the range size criterion (Extent of Occurrence <20,000 km2 combined with a declining or fluctuating range size, habitat extent/quality, or population size and a small number of locations or severe fragmentation). Despite the fact that the population trend appears to be decreasing, the decline is not believed to be sufficiently rapid to approach the thresholds for Vulnerable under the population trend criterion (>30% decline over ten years or three generations). The population size is very large, and hence does not approach the thresholds for Vulnerable under the population size criterion (<10,000 mature individuals with a continuing decline estimated to be >10% in ten years or three generations, or with a specified population structure). For these reasons the species is evaluated as Least Concern. The Greater Yellow-Headed Vulture inhabits savannas, Grasslands, and Marshes in South America. It ranges from Argentina and Urugay, as far north as Mexico. In Surinam widely spread in the interior, much less common in the coastal planes. Identification of species uncertain due to overlapping range with Lesser Yellow-headed Vulture. Irruptive or local migrant Tags: all of Cathartes, Cathartes melambrotus, Greater Yellow-headed Vulture, New World vultures Planet of Birds © 2020 Frontier Theme

Stardrifter is a novel by Dale Aycock published in 1981. Plot summary Stardrifter is a novel in which the owner of an interstellar trading company gets caught up in a conspiracy that is looking to rule the galaxy. Reception Greg Costikyan reviewed Star Drifter in Ares Magazine #10 and commented that "The importance is not the plot, which is typical space opera, but Aycock's ability to flesh out characters despite slam-bang action and to turn a pretty phrase or two. Star Drifter is fun reading." The book also received reviews from Voice of Youth Advocates and Gene DeWeese of Science Fiction Review. Reviews Review by Gene DeWeese (1981) in Science Fiction Review, Winter 1981 References 1981 novels

לצפייה: הרצאות שניתנו ביום עיון ב-10 בפברואר 2019, בנושא "הרפובליקה האסלאמית בפרספקטיבה של ארבעה עשורים". On September 3, 2018, the Begin-Sadat Center for Strategic Studies convened a conference on "The Oslo Process 25 Years On". Videos from the February 22 international conference on Strategic Challenges in Saudi Arabia, Iran, and the Gulf, convened by the BESA Center and B'nai B'rith International. On November 1, 2017, the Begin-Sadat Center for Strategic Studies, the Australian Strategic Policy Institute and Bar-Ilan Univeristy co-hosted the "Be'er Sheva Dialogue" at the Renaissance Tel Aviv Hotel. The Hon Malcolm Turnbull MP, Prime Minister of Australia, was in attendance. On June 26, 2017, Minister Zeev Elkin, Dr. Yossi Beilin, and Prof. Ruth Gavison debated Maj. Gen. (res.) Yaakov Amidror's new study, which takes a fresh look at Israel's options in Judea and Samaria and seeks to chart a path forward that will secure its national security while leaving the door open to peace. לצפייה: נאומים שניתנו בכנס מרכז בגין-סאדאת למחקרים אסטרטגיים ומרכז מורשת מנחם בגין בנושא "ארבעים שנה למהפך 1977". הכנס התקיים ביום חמישי, ח' באייר תשע"ז, 4 במאי 2017. On February 21, 2017, for the second consecutive year, the Begin-Sadat Center for Strategic Studies and B'nai B'rith International jointly held an international conference on Strategic Challenges in the Eastern Mediterranean. The event, which took place at the Begin-Sadat Center, involved the participation of experts from Greece, Russia, Britain, Turkey, Albania, the US, and Israel. Shortly after the US presidential election in November, experts met the BESA Center to analyze the reasons for, and international implications of, Donald Trump's triumph, and to dissect the "Yom Kippur" of the liberal elite and media. In June, experts from Belgium, Bahrain, France, Germany, India, the UK, US and Israel convened at the BESA Center and at Haifa's National Security Studies Center for a two-day international conference to study developments in Saudi Arabia and the Gulf.

Q: If $\sum_{n=1}^\infty E(X_n-X_{n-1})^2/b_n^2 < \infty$, then $X_n/b_n \rightarrow 0$ a.s. This is Durrett Exercise 5.4.9. I'm trying to show that if $X_n$ is a martingale, and $b_m \uparrow \infty$, $\sum_{n=1}^\infty E(X_n-X_{n-1})^2/b_n^2 < \infty$, then $X_n/b_n \rightarrow 0$ a.s.. If $X_n \in L^2$, I can show that this reduces to Durrett Exercise 5.4.8, which I have solved, since the above also gives us that the the sum of $\sum_{n=1}^\infty E\left(\frac{X_n}{b_n}-\frac{X_{n-1}}{b_{n-1}}\right)^2<\infty$, and then I can use orthogonality of martingale increments, and $L^p$ convergence theorem to conclude that it converges in almost surely and in $L^2$, although I'm not sure that I can show it converges to 0. But, in this case, I am stuck and unable to proceed A: Hints: Since $b_n \uparrow \infty$ we may assume without loss of generality that $b_n>1$ for all $n \geq 1$. Let's first assume additionally that $(X_n)_{n \in \mathbb{N}}$ is square integrable and $X_0 = 0$. * *Set $$Y_n := \sum_{i=1}^n \frac{X_i-X_{i-1}}{b_i}.$$ Show that $(Y_n)_{n \in \mathbb{N}}$ is a squre-integrable martingale with $$\mathbb{E}(Y_n^2) = \sum_{i=1}^n \frac{\mathbb{E}((X_i-X_{i-1})^2)}{b_i^2}.$$ *It follows from Step 1 and the assumptions on $(X_n)_{n \in \mathbb{N}}$ that $(Y_n)_{n \in \mathbb{N}}$ is an $L^2$-bounded martingale. The martingale convergence thorem yields that $Y_n$ converges almost surely, i.e. $$\sum_{i=1}^{\infty} \frac{X_i-X_{i-1}}{b_i}$$ converges with probability $1$. *Apply Kronecker's lemma to deduce that $$\lim_{n \to \infty} \frac{X_n}{b_n} = 0 \quad \text{a.s.}$$ For the general case: Define $\tilde{X}_n := X_n-X_0$. * *Check that $\sum_n \mathbb{E}((X_n-X_{n-1})^2)/b_n^2 < \infty$ implies $\sum_n \mathbb{E}((\tilde{X}_n-\tilde{X}_{n-1})^2)/b_n^2 < \infty$. *Deduce from $\mathbb{E}((\tilde{X}_n-\tilde{X}_{n-1})^2)< \infty$, $n \in \mathbb{N}$, and $\tilde{X}_0 =0 \in L^2(\mathbb{P})$ that $\tilde{X}_n \in L^2(\mathbb{P})$ for all $n \geq 1$. *Apply the first part of this answer to $\tilde{X}_n$.

Q: How to correct the parse error for the below code Html code is: <div ng-controller="myController"> <input type="input" ng-model="title" /> <br/> <p class="jm-find" title1="title" title2="spell('fe')"></p> </div> Javascript code: var app = angular.module('app', []); app.controller("myController", function ($scope) { $scope.title = "binding"; $scope.spell = function(ele){ console.log("me "+ele); } }); app.directive("jmFind", function () { return { replace: true, restrict: 'C', transclue: true, scope: { title1: "=", title2: "&" }, template: "<div><button ng-click={{title2}}>{{title1}}</button></div>" }; }); I am trying to understand "&" usage in Angularjs custom directive. I have followed few examples but missing on proper syntax to call the spell function. JSFiddle Link: http://jsfiddle.net/k03ozLts/ A: Invoke AngularJS expressions bound with expression (&) binding: app.directive("jmFind", function () { return { scope: { title1: "=", title2: "&" }, ̶t̶e̶m̶p̶l̶a̶t̶e̶:̶ ̶"̶<̶d̶i̶v̶>̶<̶b̶u̶t̶t̶o̶n̶ ̶n̶g̶-̶c̶l̶i̶c̶k̶=̶{̶{̶t̶i̶t̶l̶e̶2̶}̶}̶>̶{̶{̶t̶i̶t̶l̶e̶1̶}̶}̶<̶/̶b̶u̶t̶t̶o̶n̶>̶<̶/̶d̶i̶v̶>̶"̶ template: "<div><button ng-click='title2()'>{{title1}}</button></div>" }; });

This is a placeholder page for Elva Manfredi, which means this person is not currently on this site. We do suggest using the tools below to find Elva Manfredi. You are visiting the placeholder page for Elva Manfredi. This page is here because someone used our placeholder utility to look for Elva Manfredi. We created this page automatically in hopes Elva Manfredi would find it. If you are not Elva Manfredi, but are an alumni of Ogden High School Ogden, UT, register on this site for free now.

// File Name: createEventMessage.c // // Written By: Danny Kent (jaus AT dannykent DOT com), Tom Galluzzo (galluzzo AT gmail DOT com) // // Version: 3.3.0b // // Date: 09/08/09 // // Description: This file defines the functionality of a CreateEventMessage #include <stdio.h> #include <stdlib.h> #include <string.h> #include "jaus.h" static const int commandCode = JAUS_CREATE_EVENT; static const int maxDataSizeBytes = 512000; // Max Message size: 500K static JausBoolean headerFromBuffer(CreateEventMessage message, unsigned char *buffer, unsigned int bufferSizeBytes); static JausBoolean headerToBuffer(CreateEventMessage message, unsigned char *buffer, unsigned int bufferSizeBytes); static int headerToString(CreateEventMessage message, char **buf); static JausBoolean dataFromBuffer(CreateEventMessage message, unsigned char *buffer, unsigned int bufferSizeBytes); static int dataToBuffer(CreateEventMessage message, unsigned char *buffer, unsigned int bufferSizeBytes); static void dataInitialize(CreateEventMessage message); static void dataDestroy(CreateEventMessage message); static unsigned int dataSize(CreateEventMessage message); // ************************************************************************************************************** // // USER CONFIGURED FUNCTIONS // ************************************************************************************************************** // // Initializes the message-specific fields static void dataInitialize(CreateEventMessage message) { // Set initial values of message fields message->presenceVector = newJausByte(JAUS_BYTE_PRESENCE_VECTOR_ALL_ON); // 1: Presence Vector message->requestId = newJausByte(0); // Local request ID for use in confirm event message->reportMessageCode = newJausUnsignedShort(0); // Command Code of the resulting report message->eventType = newJausByte(0); // Enumeration of Event types message->eventBoundary = newJausByte(0); // Enumeration of Event Boundary Conditions message->limitDataField = newJausByte(0); // Field from Report for Limit Trigger message->lowerLimit = jausEventLimitCreate(); // Lower Event Limit message->lowerLimit->dataType = EVENT_LIMIT_BYTE_TYPE; message->upperLimit = jausEventLimitCreate(); // Upper Event Limit message->upperLimit->dataType = EVENT_LIMIT_BYTE_TYPE; message->stateLimit = jausEventLimitCreate(); // State Event Limit used for Equal Boundary message->stateLimit->dataType = EVENT_LIMIT_BYTE_TYPE; message->requestedMinimumRate = newJausDouble(0.0); // For Periodic Events for unchanging value, Scaled UnsignedShort (0, 1092) message->requestedUpdateRate = newJausDouble(0.0); // For Periodic Events, Scaled UnsignedShort (0, 1092) message->queryMessage = NULL; // Query Message (not including header) to use for response } // Destructs the message-specific fields static void dataDestroy(CreateEventMessage message) { // Free message fields if(message->queryMessage) jausMessageDestroy(message->queryMessage); if(message->lowerLimit) jausEventLimitDestroy(message->lowerLimit); if(message->upperLimit) jausEventLimitDestroy(message->upperLimit); if(message->stateLimit) jausEventLimitDestroy(message->stateLimit); } // Return boolean of success static JausBoolean dataFromBuffer(CreateEventMessage message, unsigned char *buffer, unsigned int bufferSizeBytes) { int index = 0; JausUnsignedShort tempUShort; JausUnsignedInteger queryMessageSize; if(bufferSizeBytes == message->dataSize) { // Unpack Message Fields from Buffer // Presence Vector if(!jausByteFromBuffer(&message->presenceVector, buffer+index, bufferSizeBytes-index)) return JAUS_FALSE; index += JAUS_BYTE_SIZE_BYTES; // Request ID if(!jausByteFromBuffer(&message->requestId, buffer+index, bufferSizeBytes-index)) return JAUS_FALSE; index += JAUS_BYTE_SIZE_BYTES; // Report Message Code if(!jausUnsignedShortFromBuffer(&message->reportMessageCode, buffer+index, bufferSizeBytes-index)) return JAUS_FALSE; index += JAUS_UNSIGNED_SHORT_SIZE_BYTES; // Event Type if(!jausByteFromBuffer(&message->eventType, buffer+index, bufferSizeBytes-index)) return JAUS_FALSE; index += JAUS_BYTE_SIZE_BYTES; if(jausByteIsBitSet(message->presenceVector, CREATE_EVENT_PV_BOUNDARY_BIT)) { // Event Boundary if(!jausByteFromBuffer(&message->eventBoundary, buffer+index, bufferSizeBytes-index)) return JAUS_FALSE; index += JAUS_BYTE_SIZE_BYTES; } if(jausByteIsBitSet(message->presenceVector, CREATE_EVENT_PV_DATA_FIELD_BIT)) { // Limit Data Field if(!jausByteFromBuffer(&message->limitDataField, buffer+index, bufferSizeBytes-index)) return JAUS_FALSE; index += JAUS_BYTE_SIZE_BYTES; } if(jausByteIsBitSet(message->presenceVector, CREATE_EVENT_PV_LOWER_LIMIT_BIT)) { // Lower Limit if(!jausEventLimitFromBuffer(&message->lowerLimit, buffer+index, bufferSizeBytes-index)) return JAUS_FALSE; index += jausEventLimitSize(message->lowerLimit); } else { message->lowerLimit = NULL; } if(jausByteIsBitSet(message->presenceVector, CREATE_EVENT_PV_UPPER_LIMIT_BIT)) { // Upper Limit if(!jausEventLimitFromBuffer(&message->upperLimit, buffer+index, bufferSizeBytes-index)) return JAUS_FALSE; index += jausEventLimitSize(message->upperLimit); } else { message->upperLimit = NULL; } if(jausByteIsBitSet(message->presenceVector, CREATE_EVENT_PV_STATE_LIMIT_BIT)) { // State Limit if(!jausEventLimitFromBuffer(&message->stateLimit, buffer+index, bufferSizeBytes-index)) return JAUS_FALSE; index += jausEventLimitSize(message->stateLimit); } else { message->stateLimit = NULL; } if(jausByteIsBitSet(message->presenceVector, CREATE_EVENT_PV_MINIMUM_RATE_BIT)) { // Minimum Periodic Rate if(!jausUnsignedShortFromBuffer(&tempUShort, buffer+index, bufferSizeBytes-index)) return JAUS_FALSE; index += JAUS_UNSIGNED_SHORT_SIZE_BYTES; // Scaled Int (0, 1092); message->requestedMinimumRate = jausUnsignedShortToDouble(tempUShort, 0, 1092); } if(jausByteIsBitSet(message->presenceVector, CREATE_EVENT_PV_REQUESTED_RATE_BIT)) { // Periodic Rate if(!jausUnsignedShortFromBuffer(&tempUShort, buffer+index, bufferSizeBytes-index)) return JAUS_FALSE; index += JAUS_UNSIGNED_SHORT_SIZE_BYTES; // Scaled Int (0, 1092); message->requestedUpdateRate = jausUnsignedShortToDouble(tempUShort, 0, 1092); } if(jausByteIsBitSet(message->presenceVector, CREATE_EVENT_PV_QUERY_MESSAGE_BIT)) { // Query Message Size if(!jausUnsignedIntegerFromBuffer(&queryMessageSize, buffer+index, bufferSizeBytes-index)) return JAUS_FALSE; index += JAUS_UNSIGNED_INTEGER_SIZE_BYTES; // Query Message Body if(bufferSizeBytes-index < queryMessageSize) return JAUS_FALSE; // Setup our Query Message message->queryMessage = jausMessageCreate(); if(!message->queryMessage) return JAUS_FALSE; message->queryMessage->dataSize = queryMessageSize; jausAddressCopy(message->queryMessage->source, message->source); jausAddressCopy(message->queryMessage->destination, message->destination); message->queryMessage->commandCode = jausMessageGetComplementaryCommandCode(message->reportMessageCode); // Allocate Memory message->queryMessage->data = (unsigned char *) malloc(queryMessageSize); // Copy query message body to the data member memcpy(message->queryMessage->data, buffer+index, queryMessageSize); index += queryMessageSize; } return JAUS_TRUE; } else { return JAUS_FALSE; } } // Returns number of bytes put into the buffer static int dataToBuffer(CreateEventMessage message, unsigned char *buffer, unsigned int bufferSizeBytes) { int index = 0; JausUnsignedShort tempUShort; if(bufferSizeBytes >= dataSize(message)) { // Unpack Message Fields from Buffer // Presence Vector if(!jausByteToBuffer(message->presenceVector, buffer+index, bufferSizeBytes-index)) return JAUS_FALSE; index += JAUS_BYTE_SIZE_BYTES; // Request Id if(!jausByteToBuffer(message->requestId, buffer+index, bufferSizeBytes-index)) return JAUS_FALSE; index += JAUS_BYTE_SIZE_BYTES; // Message Code if(!jausUnsignedShortToBuffer(message->reportMessageCode, buffer+index, bufferSizeBytes-index)) return JAUS_FALSE; index += JAUS_UNSIGNED_SHORT_SIZE_BYTES; // Event Type if(!jausByteToBuffer(message->eventType, buffer+index, bufferSizeBytes-index)) return JAUS_FALSE; index += JAUS_BYTE_SIZE_BYTES; if(jausByteIsBitSet(message->presenceVector, CREATE_EVENT_PV_BOUNDARY_BIT)) { // Event Boundary if(!jausByteToBuffer(message->eventBoundary, buffer+index, bufferSizeBytes-index)) return JAUS_FALSE; index += JAUS_BYTE_SIZE_BYTES; } if(jausByteIsBitSet(message->presenceVector, CREATE_EVENT_PV_DATA_FIELD_BIT)) { // Data Field if(!jausByteToBuffer(message->limitDataField, buffer+index, bufferSizeBytes-index)) return JAUS_FALSE; index += JAUS_BYTE_SIZE_BYTES; } if(jausByteIsBitSet(message->presenceVector, CREATE_EVENT_PV_LOWER_LIMIT_BIT)) { // Lower Limit if(!jausEventLimitToBuffer(message->lowerLimit, buffer+index, bufferSizeBytes-index)) return JAUS_FALSE; index += jausEventLimitSize(message->lowerLimit); } if(jausByteIsBitSet(message->presenceVector, CREATE_EVENT_PV_UPPER_LIMIT_BIT)) { // Upper Limit if(!jausEventLimitToBuffer(message->upperLimit, buffer+index, bufferSizeBytes-index)) return JAUS_FALSE; index += jausEventLimitSize(message->upperLimit); } if(jausByteIsBitSet(message->presenceVector, CREATE_EVENT_PV_STATE_LIMIT_BIT)) { // State Limit if(!jausEventLimitToBuffer(message->stateLimit, buffer+index, bufferSizeBytes-index)) return JAUS_FALSE; index += jausEventLimitSize(message->stateLimit); } if(jausByteIsBitSet(message->presenceVector, CREATE_EVENT_PV_MINIMUM_RATE_BIT)) { // Scaled Int (0, 1092); tempUShort = jausUnsignedShortFromDouble(message->requestedMinimumRate, 0, 1092); // Minimum Periodic Rate if(!jausUnsignedShortToBuffer(tempUShort, buffer+index, bufferSizeBytes-index)) return JAUS_FALSE; index += JAUS_UNSIGNED_SHORT_SIZE_BYTES; } if(jausByteIsBitSet(message->presenceVector, CREATE_EVENT_PV_REQUESTED_RATE_BIT)) { // Scaled Int (0, 1092); tempUShort = jausUnsignedShortFromDouble(message->requestedUpdateRate, 0, 1092); // Minimum Periodic Rate if(!jausUnsignedShortToBuffer(tempUShort, buffer+index, bufferSizeBytes-index)) return JAUS_FALSE; index += JAUS_UNSIGNED_SHORT_SIZE_BYTES; } if(jausByteIsBitSet(message->presenceVector, CREATE_EVENT_PV_QUERY_MESSAGE_BIT)) { //Query Message Size if(message->queryMessage) { if(!jausUnsignedIntegerToBuffer(message->queryMessage->dataSize, buffer+index, bufferSizeBytes-index)) return JAUS_FALSE; index += JAUS_UNSIGNED_INTEGER_SIZE_BYTES; // Query Message Body if(bufferSizeBytes-index < message->queryMessage->dataSize) return JAUS_FALSE; memcpy(buffer+index, message->queryMessage->data, message->queryMessage->dataSize); index += message->queryMessage->dataSize; } else { if(!jausUnsignedIntegerToBuffer(0, buffer+index, bufferSizeBytes-index)) return JAUS_FALSE; index += JAUS_UNSIGNED_INTEGER_SIZE_BYTES; } } } return index; } static int dataToString(CreateEventMessage message, char **buf) { //message already verified //Setup temporary string buffer unsigned int bufSize = 1000; char* lowerLimitStr = NULL; char* upperLimitStr = NULL; char* stateLimitStr = NULL; char* msgString = NULL; (*buf) = (char*)malloc(sizeof(char)*bufSize); strcpy((*buf), "\nPresence Vector: " ); jausByteToHexString(message->presenceVector, (*buf)+strlen(*buf)); strcat((*buf), "\nRequest Id: " ); jausByteToString(message->requestId, (*buf)+strlen(*buf)); strcat((*buf), "\nMessage Code: " ); jausUnsignedShortToString(message->reportMessageCode, (*buf)+strlen(*buf)); strcat((*buf), "\nEvent Type: " ); jausByteToString(message->eventType, (*buf)+strlen(*buf)); switch(message->eventType) { case EVENT_PERIODIC_TYPE: strcat((*buf), " Periodic(SC)"); break; case EVENT_EVERY_CHANGE_TYPE: strcat((*buf), " Every Change"); break; case EVENT_FIRST_CHANGE_TYPE: strcat((*buf), " First Change"); break; case EVENT_FIRST_CHANGE_IN_AND_OUT_TYPE: strcat((*buf), " First change in and out of boundary"); break; case EVENT_PERIODIC_NO_REPEAT_TYPE: strcat((*buf), " Periodic w/o replacement"); break; case EVENT_ONE_TIME_ON_DEMAND_TYPE: strcat((*buf), " One time, on demand"); break; } if(jausByteIsBitSet(message->presenceVector, UPDATE_EVENT_PV_BOUNDARY_BIT)) { strcat((*buf), "\nEvent Boundary: " ); jausByteToString(message->eventBoundary, (*buf)+strlen(*buf)); switch(message->eventBoundary) { case EQUAL_BOUNDARY: strcat((*buf), " Equal"); break; case NOT_EQUAL_BOUNDARY: strcat((*buf), " Not Equal"); break; case INSIDE_INCLUSIVE_BOUNDARY: strcat((*buf), " Inside Inclusive"); break; case INSIDE_EXCLUSIVE_BOUNDARY: strcat((*buf), " Inside Exclusive"); break; case OUTSIDE_INCLUSIVE_BOUNDARY: strcat((*buf), " Outside Inclusive"); break; case OUTSIDE_EXCLUSIVE_BOUNDARY: strcat((*buf), " Outside Exclusive"); break; case GREATER_THAN_OR_EQUAL_BOUNDARY: strcat((*buf), " Greater than or Equal"); break; case GREATER_THAN_BOUNDARY: strcat((*buf), " Strictly Greater than"); break; case LESS_THAN_OR_EQUAL_BOUNDARY: strcat((*buf), " Less than or Equal"); break; case LESS_THAN_BOUNDARY: strcat((*buf), " Strictly Less than"); break; } } if(jausByteIsBitSet(message->presenceVector, UPDATE_EVENT_PV_DATA_FIELD_BIT)) { strcat((*buf), "\nLimit Data Field: " ); jausByteToString(message->limitDataField, (*buf)+strlen(*buf)); } if(jausByteIsBitSet(message->presenceVector, UPDATE_EVENT_PV_LOWER_LIMIT_BIT)) { strcat((*buf), "\nLower Limit\n" ); lowerLimitStr = jausEventLimitToString(message->lowerLimit); strcat((*buf), lowerLimitStr); free(lowerLimitStr); } if(jausByteIsBitSet(message->presenceVector, UPDATE_EVENT_PV_UPPER_LIMIT_BIT)) { strcat((*buf), "\nUpper Limit\n" ); upperLimitStr = jausEventLimitToString(message->upperLimit); strcat((*buf), upperLimitStr); free(upperLimitStr); } if(jausByteIsBitSet(message->presenceVector, UPDATE_EVENT_PV_STATE_LIMIT_BIT)) { strcat((*buf), "\nState Limit\n" ); stateLimitStr = jausEventLimitToString(message->stateLimit); strcat((*buf), stateLimitStr); free(stateLimitStr); } if(jausByteIsBitSet(message->presenceVector, UPDATE_EVENT_PV_MINIMUM_RATE_BIT)) { strcat((*buf), "\nRequested Minimum Periodic Rate(Hz): " ); jausDoubleToString(message->requestedMinimumRate, (*buf)+strlen(*buf)); } if(jausByteIsBitSet(message->presenceVector, UPDATE_EVENT_PV_REQUESTED_RATE_BIT)) { strcat((*buf), "\nRequested Periodic Update Rate(Hz): " ); jausDoubleToString(message->requestedUpdateRate, (*buf)+strlen(*buf)); } if(jausByteIsBitSet(message->presenceVector, UPDATE_EVENT_PV_QUERY_MESSAGE_BIT)) { strcat((*buf), "\nQuery Message" ); msgString = jausMessageToString(message->queryMessage); strcat((*buf), msgString); free(msgString); } return (int)strlen(*buf); } // Returns number of bytes put into the buffer static unsigned int dataSize(CreateEventMessage message) { int index = 0; // Presence Vector index += JAUS_BYTE_SIZE_BYTES; // Request ID index += JAUS_BYTE_SIZE_BYTES; // Message Code index += JAUS_UNSIGNED_SHORT_SIZE_BYTES; // Event Type index += JAUS_BYTE_SIZE_BYTES; if(jausByteIsBitSet(message->presenceVector, CREATE_EVENT_PV_BOUNDARY_BIT)) { index += JAUS_BYTE_SIZE_BYTES; } if(jausByteIsBitSet(message->presenceVector, CREATE_EVENT_PV_DATA_FIELD_BIT)) { index += JAUS_BYTE_SIZE_BYTES; } if(jausByteIsBitSet(message->presenceVector, CREATE_EVENT_PV_LOWER_LIMIT_BIT)) { index += jausEventLimitSize(message->lowerLimit); } if(jausByteIsBitSet(message->presenceVector, CREATE_EVENT_PV_UPPER_LIMIT_BIT)) { index += jausEventLimitSize(message->upperLimit); } if(jausByteIsBitSet(message->presenceVector, CREATE_EVENT_PV_STATE_LIMIT_BIT)) { index += jausEventLimitSize(message->stateLimit); } if(jausByteIsBitSet(message->presenceVector, CREATE_EVENT_PV_MINIMUM_RATE_BIT)) { index += JAUS_UNSIGNED_SHORT_SIZE_BYTES; } if(jausByteIsBitSet(message->presenceVector, CREATE_EVENT_PV_REQUESTED_RATE_BIT)) { index += JAUS_UNSIGNED_SHORT_SIZE_BYTES; } if(jausByteIsBitSet(message->presenceVector, CREATE_EVENT_PV_QUERY_MESSAGE_BIT)) { index += JAUS_UNSIGNED_INTEGER_SIZE_BYTES; // Jaus Message if(message->queryMessage) index += message->queryMessage->dataSize; } return index; } // ************************************************************************************************************** // // NON-USER CONFIGURED FUNCTIONS // ************************************************************************************************************** // CreateEventMessage createEventMessageCreate(void) { CreateEventMessage message; message = (CreateEventMessage)malloc( sizeof(CreateEventMessageStruct) ); if(message == NULL) { return NULL; } // Initialize Values message->properties.priority = JAUS_DEFAULT_PRIORITY; message->properties.ackNak = JAUS_ACK_NAK_NOT_REQUIRED; message->properties.scFlag = JAUS_NOT_SERVICE_CONNECTION_MESSAGE; message->properties.expFlag = JAUS_NOT_EXPERIMENTAL_MESSAGE; message->properties.version = JAUS_VERSION_3_3; message->properties.reserved = 0; message->commandCode = commandCode; message->destination = jausAddressCreate(); message->source = jausAddressCreate(); message->dataFlag = JAUS_SINGLE_DATA_PACKET; message->dataSize = maxDataSizeBytes; message->sequenceNumber = 0; dataInitialize(message); message->dataSize = dataSize(message); return message; } void createEventMessageDestroy(CreateEventMessage message) { dataDestroy(message); jausAddressDestroy(message->source); jausAddressDestroy(message->destination); free(message); message = NULL; } JausBoolean createEventMessageFromBuffer(CreateEventMessage message, unsigned char* buffer, unsigned int bufferSizeBytes) { int index = 0; if(headerFromBuffer(message, buffer+index, bufferSizeBytes-index)) { index += JAUS_HEADER_SIZE_BYTES; if(dataFromBuffer(message, buffer+index, bufferSizeBytes-index)) { return JAUS_TRUE; } else { return JAUS_FALSE; } } else { return JAUS_FALSE; } } JausBoolean createEventMessageToBuffer(CreateEventMessage message, unsigned char *buffer, unsigned int bufferSizeBytes) { if(bufferSizeBytes < createEventMessageSize(message)) { return JAUS_FALSE; //improper size } else { message->dataSize = dataToBuffer(message, buffer+JAUS_HEADER_SIZE_BYTES, bufferSizeBytes - JAUS_HEADER_SIZE_BYTES); if(headerToBuffer(message, buffer, bufferSizeBytes)) { return JAUS_TRUE; } else { return JAUS_FALSE; // headerToCreateEventBuffer failed } } } CreateEventMessage createEventMessageFromJausMessage(JausMessage jausMessage) { CreateEventMessage message; if(jausMessage->commandCode != commandCode) { return NULL; // Wrong message type } else { message = (CreateEventMessage)malloc( sizeof(CreateEventMessageStruct) ); if(message == NULL) { return NULL; } message->properties.priority = jausMessage->properties.priority; message->properties.ackNak = jausMessage->properties.ackNak; message->properties.scFlag = jausMessage->properties.scFlag; message->properties.expFlag = jausMessage->properties.expFlag; message->properties.version = jausMessage->properties.version; message->properties.reserved = jausMessage->properties.reserved; message->commandCode = jausMessage->commandCode; message->destination = jausAddressCreate(); *message->destination = *jausMessage->destination; message->source = jausAddressCreate(); *message->source = *jausMessage->source; message->dataSize = jausMessage->dataSize; message->dataFlag = jausMessage->dataFlag; message->sequenceNumber = jausMessage->sequenceNumber; // Unpack jausMessage->data if(dataFromBuffer(message, jausMessage->data, jausMessage->dataSize)) { return message; } else { return NULL; } } } JausMessage createEventMessageToJausMessage(CreateEventMessage message) { JausMessage jausMessage; jausMessage = (JausMessage)malloc( sizeof(struct JausMessageStruct) ); if(jausMessage == NULL) { return NULL; } jausMessage->properties.priority = message->properties.priority; jausMessage->properties.ackNak = message->properties.ackNak; jausMessage->properties.scFlag = message->properties.scFlag; jausMessage->properties.expFlag = message->properties.expFlag; jausMessage->properties.version = message->properties.version; jausMessage->properties.reserved = message->properties.reserved; jausMessage->commandCode = message->commandCode; jausMessage->destination = jausAddressCreate(); *jausMessage->destination = *message->destination; jausMessage->source = jausAddressCreate(); *jausMessage->source = *message->source; jausMessage->dataSize = dataSize(message); jausMessage->dataFlag = message->dataFlag; jausMessage->sequenceNumber = message->sequenceNumber; jausMessage->data = (unsigned char *)malloc(jausMessage->dataSize); jausMessage->dataSize = dataToBuffer(message, jausMessage->data, jausMessage->dataSize); return jausMessage; } unsigned int createEventMessageSize(CreateEventMessage message) { return (unsigned int)(dataSize(message) + JAUS_HEADER_SIZE_BYTES); } char* createEventMessageToString(CreateEventMessage message) { if(message) { char* buf1 = NULL; char* buf2 = NULL; char* buf = NULL; int returnVal; //Print the message header to the string buffer returnVal = headerToString(message, &buf1); //Print the message data fields to the string buffer returnVal += dataToString(message, &buf2); buf = (char*)malloc(strlen(buf1)+strlen(buf2)+1); strcpy(buf, buf1); strcat(buf, buf2); free(buf1); free(buf2); return buf; } else { char* buf = "Invalid CreateEvent Message"; char* msg = (char*)malloc(strlen(buf)+1); strcpy(msg, buf); return msg; } } //********************* PRIVATE HEADER FUNCTIONS **********************// static JausBoolean headerFromBuffer(CreateEventMessage message, unsigned char *buffer, unsigned int bufferSizeBytes) { if(bufferSizeBytes < JAUS_HEADER_SIZE_BYTES) { return JAUS_FALSE; } else { // unpack header message->properties.priority = (buffer[0] & 0x0F); message->properties.ackNak = ((buffer[0] >> 4) & 0x03); message->properties.scFlag = ((buffer[0] >> 6) & 0x01); message->properties.expFlag = ((buffer[0] >> 7) & 0x01); message->properties.version = (buffer[1] & 0x3F); message->properties.reserved = ((buffer[1] >> 6) & 0x03); message->commandCode = buffer[2] + (buffer[3] << 8); message->destination->instance = buffer[4]; message->destination->component = buffer[5]; message->destination->node = buffer[6]; message->destination->subsystem = buffer[7]; message->source->instance = buffer[8]; message->source->component = buffer[9]; message->source->node = buffer[10]; message->source->subsystem = buffer[11]; message->dataSize = buffer[12] + ((buffer[13] & 0x0F) << 8); message->dataFlag = ((buffer[13] >> 4) & 0x0F); message->sequenceNumber = buffer[14] + (buffer[15] << 8); return JAUS_TRUE; } } static JausBoolean headerToBuffer(CreateEventMessage message, unsigned char *buffer, unsigned int bufferSizeBytes) { JausUnsignedShort *propertiesPtr = (JausUnsignedShort*)&message->properties; if(bufferSizeBytes < JAUS_HEADER_SIZE_BYTES) { return JAUS_FALSE; } else { buffer[0] = (unsigned char)(*propertiesPtr & 0xFF); buffer[1] = (unsigned char)((*propertiesPtr & 0xFF00) >> 8); buffer[2] = (unsigned char)(message->commandCode & 0xFF); buffer[3] = (unsigned char)((message->commandCode & 0xFF00) >> 8); buffer[4] = (unsigned char)(message->destination->instance & 0xFF); buffer[5] = (unsigned char)(message->destination->component & 0xFF); buffer[6] = (unsigned char)(message->destination->node & 0xFF); buffer[7] = (unsigned char)(message->destination->subsystem & 0xFF); buffer[8] = (unsigned char)(message->source->instance & 0xFF); buffer[9] = (unsigned char)(message->source->component & 0xFF); buffer[10] = (unsigned char)(message->source->node & 0xFF); buffer[11] = (unsigned char)(message->source->subsystem & 0xFF); buffer[12] = (unsigned char)(message->dataSize & 0xFF); buffer[13] = (unsigned char)((message->dataFlag & 0xFF) << 4) | (unsigned char)((message->dataSize & 0x0F00) >> 8); buffer[14] = (unsigned char)(message->sequenceNumber & 0xFF); buffer[15] = (unsigned char)((message->sequenceNumber & 0xFF00) >> 8); return JAUS_TRUE; } } static int headerToString(CreateEventMessage message, char **buf) { //message existance already verified //Setup temporary string buffer unsigned int bufSize = 500; (*buf) = (char*)malloc(sizeof(char)*bufSize); strcpy((*buf), jausCommandCodeString(message->commandCode) ); strcat((*buf), " (0x"); sprintf((*buf)+strlen(*buf), "%04X", message->commandCode); strcat((*buf), ")\nReserved: "); jausUnsignedShortToString(message->properties.reserved, (*buf)+strlen(*buf)); strcat((*buf), "\nVersion: "); switch(message->properties.version) { case 0: strcat((*buf), "2.0 and 2.1 compatible"); break; case 1: strcat((*buf), "3.0 through 3.1 compatible"); break; case 2: strcat((*buf), "3.2 and 3.3 compatible"); break; default: strcat((*buf), "Reserved for Future: "); jausUnsignedShortToString(message->properties.version, (*buf)+strlen(*buf)); break; } strcat((*buf), "\nExp. Flag: "); if(message->properties.expFlag == 0) strcat((*buf), "Not Experimental"); else strcat((*buf), "Experimental"); strcat((*buf), "\nSC Flag: "); if(message->properties.scFlag == 1) strcat((*buf), "Service Connection"); else strcat((*buf), "Not Service Connection"); strcat((*buf), "\nACK/NAK: "); switch(message->properties.ackNak) { case 0: strcat((*buf), "None"); break; case 1: strcat((*buf), "Request ack/nak"); break; case 2: strcat((*buf), "nak response"); break; case 3: strcat((*buf), "ack response"); break; default: break; } strcat((*buf), "\nPriority: "); if(message->properties.priority < 12) { strcat((*buf), "Normal Priority "); jausUnsignedShortToString(message->properties.priority, (*buf)+strlen(*buf)); } else { strcat((*buf), "Safety Critical Priority "); jausUnsignedShortToString(message->properties.priority, (*buf)+strlen(*buf)); } strcat((*buf), "\nSource: "); jausAddressToString(message->source, (*buf)+strlen(*buf)); strcat((*buf), "\nDestination: "); jausAddressToString(message->destination, (*buf)+strlen(*buf)); strcat((*buf), "\nData Size: "); jausUnsignedIntegerToString(message->dataSize, (*buf)+strlen(*buf)); strcat((*buf), "\nData Flag: "); jausUnsignedIntegerToString(message->dataFlag, (*buf)+strlen(*buf)); switch(message->dataFlag) { case 0: strcat((*buf), " Only data packet in single-packet stream"); break; case 1: strcat((*buf), " First data packet in muti-packet stream"); break; case 2: strcat((*buf), " Normal data packet"); break; case 4: strcat((*buf), " Retransmitted data packet"); break; case 8: strcat((*buf), " Last data packet in stream"); break; default: strcat((*buf), " Unrecognized data flag code"); break; } strcat((*buf), "\nSequence Number: "); jausUnsignedShortToString(message->sequenceNumber, (*buf)+strlen(*buf)); return (int)strlen(*buf); }

Johnson Controls, Inc. (JCI) Is Going Nowhere. Here's Why. Sales at America's automakers have been going great guns these past few quarters, and you'd think that would be great news for the companies that make parts for all these shiny new autos. In some cases, you'd be right to think that. But in at least one case — the case of Johnson Controls, Inc. (NYSE:JCI) stock — you'd be very, very wrong. Shares of auto-parts makers such as Lear (NYSE:LEA) and Magna International (NYSE:MGA) have rocketed this past year, outperforming the S&P 500 with 46% and 56% returns, respectively. Yet Johnson Controls, Inc. (NYSE:JCI) stock has lagged the market average by more than five points. Why? Three reasons. Johnson Controls stock is worse than average Turns out that when you stack up Johnson Controls, Inc. (NYSE:JCI) stock against its two smaller rivals, there's precious little to recommend it. Johnson Controls' P/E ratio of 27.8 is no bargain. It's more than twice the cost of a share of Magna (which costs 10.5 times earnings), and nearly six times the cost of Lear, which sells for only 4.7 times earnings. Worse, when you lay the three companies side-by-side, you can plainly see that Johnson Controls, Inc. (NYSE:JCI) generates far less real cash profit than its rivals do. Its free cash flow yield is the worst of the bunch: JCI Free Cash Flow Yield data by YCharts Johnson Controls grows too slow Johnson Controls, Inc. (NYSE:JCI) stock is no great shakes when valued on more traditional "GAAP" earnings, either. Fact is, over the past five years Johnson Controls stock is the only one of the three that has seen earnings actually decline: Johnson Controls stock is going nowhere Of course, there's still the old investing truism to consider — that investing isn't about what a stock has done in the past, but what it might do in the future. Problem is, despite the shrinking earnings that are giving it a smaller earnings base to grow from in the future, Johnson Controls stock is still expected to be the slowest grower of the group: So once again, we find Johnson Controls, Inc. (NYSE:JCI) stock occupying last place in a losing race. Johnson Controls Inc (JCI)Lear Corp (LEA)Magna International Inc (MGA)NYSE:JCINYSE:LEANYSE:MGAShow more...Show less Johnson Controls, Inc. (JCI), Duke Energy Corp (DUK): Who Benefits From a Better... Lear Corporation (LEA), Corrections Corp Of America (CXW): Shorts Are Piling... Delphi Automotive PLC (DLPH): Are Hedge Funds Right About This Stock? This Metric Says You Are Smart to Sell Lear Corporation (LEA) American Axle & Manufact. Holdings, Inc. (AXL), General Motors Company... Ameresco Inc (AMRC), Johnson Controls, Inc. (JCI): The Cheapest Megawatt

Reflexology is based on the principle that reflex points on the soles, tops, and sides of the feet correspond to different areas of the body. In this way, the feet can be seen as a 'map' of the body. By applying specialised massage techniques to specific reflex points – using the thumbs, fingers and knuckles – the aim of a reflexology treatment is to help restore balance to the body naturally, and improve the client's general well-being. We start with a full consultation, asking various questions about your health and lifestyle, to ensure reflexology is right for you. For the treatment itself you will remain fully clothed, simply removing your shoes and socks. You'll be invited to relax on a reclining chair or treatment couch, or to put your feet up on a footstool. We will gently clean your feet before applying a fine powder, cream of oil, to help provide a free-flowing treatment, and then start gently massaging and stretching your feet and ankles. As the treatment progresses, a variety of different reflexology techniques will be used to 'work' the reflex points on each foot, including a caterpillar-like movement called 'thumb walking'. The areas treated and pressure applied will be adapted to suit your individual needs. Treatment generally lasts for 45 minutes to an hour, though shorter reflexology sessions may be more appropriate in some instances.

In a few days, US President Donald J. Trump will meet with his fellow heads of state and government from across the NATO alliance in Brussels, Belgium, and there is widespread concern that it will once again be a meeting where the United States is scornful of its allies and partners. Some even fear that this may be the beginning of the end of NATO and the bond between the United States and Europe. The flames have been fanned further by the recent G-7 meeting which ended in acrimony between the US president and the other leaders, the announced Trump-Putin summit in Helsinki a few days after the NATO summit, and whispers that the United States may pull its troops out of Germany in the coming years. Trump has, going back to when he was a Republican primary candidate, criticized NATO's members for not doing their fair share in terms of spending on defense, and stated that the Europeans get more out of NATO than the United States does. The president does indeed have a point when it comes to European defense spending, which has been in decline since the early 1990s, although it is again on the rise since 2014. And the uptick in European defense spending is something that the president could arguably take partial credit for, if he wished. But NATO is not about the United States doing Europe favors. It is an alliance created by the United States, and which has proven remarkably effective in transforming to, in great part, advancing American national security objectives. During the Cold War NATO stood as the bulwark against the Soviet Union in Europe during the multi-decade struggle between communism and the free world led by the United States. After the Cold War, NATO helped advance the vision set out by US President George H.W. Bush of a Europe whole, free, and at peace by inviting newly free countries of Eastern Europe to join the Alliance. And after the 9/11 attacks in the United States, NATO transformed again to take on the tough mission in Afghanistan alongside the United States. Well over a thousand non-US NATO soldiers lost their lives in that campaign. As a proportion of deployed forces, four NATO nations—Canada, the United Kingdom, Estonia, and Denmark—sustained higher casualty rates in Afghanistan than the United States did. NATO is also useful to the United States, even when the Alliance itself is not centrally involved in an operation. The US-led campaign against the Islamic State of Iraq and al-Sham (ISIS) includes contributions from a range of NATO allies. Over a third of the air strikes against ISIS in Iraq and Libya have been flown by NATO partner countries, something that is made possible by the habits of cooperation established and practiced inside NATO. The United States' European allies certainly do need to spend more on defense, and the president should push them to do it. But that is not to say that NATO is a burden for the United States. It has proven itself key to American national security objectives since the late 1940s. It is, after all, the United States' alliance. Magnus Nordenman is director of the Transatlantic Security Initiative at the Atlantic Council's Scowcroft Center for Strategy and Security. Follow him on Twitter @MNordenman. The Atlantic Council is supporting the #StrongerWithAllies campaign, promoting the idea that the United States is stronger and safer with friends abroad. Please join our effort by visiting StrongerWithAllies.org and using our social media toolkit to share your own content about why we're #StrongerWithAllies.

Q: All data in a row. Move observations under each other I have the following data: data <- list(list(eventId = 8, subEventName = "Simple pass", tags = list( list(id = 1801)), playerId = 122671, positions = list(list( y = 50, x = 50), list(y = 53, x = 35)), matchId = 2057954, eventName = "Pass", teamId = 16521, matchPeriod = "1H", eventSec = 1.656214, subEventId = 85, id = 258612104), list(eventId = 8, subEventName = "High pass", tags = list(list(id = 1801)), playerId = 139393, positions = list( list(y = 53, x = 35), list(y = 19, x = 75)), matchId = 2057954, eventName = "Pass", teamId = 16521, matchPeriod = "1H", eventSec = 4.487814, subEventId = 83, id = 258612106)) I want to create a data frame out of this list. I use unlist(data), which creates a row with repeated variables. > unlist(data) eventId subEventName tags.id playerId positions.y positions.x positions.y "8" "Simple pass" "1801" "122671" "50" "50" "53" positions.x matchId eventName teamId matchPeriod eventSec subEventId "35" "2057954" "Pass" "16521" "1H" "1.656214" "85" id eventId subEventName tags.id playerId positions.y positions.x "258612104" "8" "High pass" "1801" "139393" "53" "35" positions.y positions.x matchId eventName teamId matchPeriod eventSec "19" "75" "2057954" "Pass" "16521" "1H" "4.487814" subEventId id "83" "258612106" Each observation starts with the eventId variable. So, basically I have to split the data into dataframes starting with eventId, and then moving those dataframes one under the other. I.e. having two observations in this case. Do you have any idea? thanks in advance A: Try tibblify-- library(tibblify) tibblify(data) ## A tibble: 2 x 12 # eventId subEventName tags playerId positions matchId eventName teamId matchPeriod eventSec subEventId id # <dbl> <chr> <list<tbl_df[,1]>> <dbl> <list<tbl_df[,2]>> <dbl> <chr> <dbl> <chr> <dbl> <dbl> <dbl> #1 8 Simple pass [1 x 1] 122671 [2 x 2] 2057954 Pass 16521 1H 1.66 85 258612104 #2 8 High pass [1 x 1] 139393 [2 x 2] 2057954 Pass 16521 1H 4.49 83 258612106 A: You can use rbindlist from data.table : result <- data.table::rbindlist(data) result # eventId subEventName tags playerId positions matchId eventName teamId matchPeriod eventSec subEventId id #1: 8 Simple pass <list[1]> 122671 <list[2]> 2057954 Pass 16521 1H 1.66 85 2.59e+08 #2: 8 Simple pass <list[1]> 122671 <list[2]> 2057954 Pass 16521 1H 1.66 85 2.59e+08 #3: 8 High pass <list[1]> 139393 <list[2]> 2057954 Pass 16521 1H 4.49 83 2.59e+08 #4: 8 High pass <list[1]> 139393 <list[2]> 2057954 Pass 16521 1H 4.49 83 2.59e+08 A: Does this help solve your problem? df <- data.frame(matrix(unlist(data), nrow=length(data), byrow=T))

Check your Basic general knowledge and improve it. From the following, choose the set in which names of Secretary-Generals of the UNO are arranged in correct chronological order? ? U Thant, Kurt Waldheim, Dag Hammarskjoeld, Trygve Lie. ? Trygve Lie, Dag Hammarskjoeld, U Thant, Kurt Waldheim. ? Trygve Lie, U Thant , Dag Hammarskjoeld, Kurt Waldheim. ? U Thant, Dag Hammarskjoeld, Trygve Lie, Kurt Waldheim.

<?xml version="1.0"?> <arquillian xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://jboss.org/schema/arquillian" xsi:schemaLocation="http://jboss.org/schema/arquillian http://jboss.org/schema/arquillian/arquillian_1_0.xsd"> <!-- We have to bind the docker hostname and port, otherwise RMI will choose a random port, which we can't forward to the docker host. RMI is a difficult protocol to configure :(. --> <extension qualifier="docker"> <property name="serverVersion">${docker.api.version}</property> <property name="serverUri">${docker.api.url}</property> <property name="definitionFormat">COMPOSE</property> <property name="dockerContainersFile">docker-compose.yml</property> </extension> <container qualifier="tomcat"> <configuration> <property name="user">admin</property> <property name="pass">mypass</property> </configuration> </container> </arquillian>

Епи́скоп Фо́тий Хадзиантони́у (; ) — архиерей Александрийской православной церкви, епископ Малавийский (с 2018). Биография Родился 23 июля 1954 года в Никее, в Аттике, в Греции. После завершения обучения в средней школе окончил философский факультет и Богословский институт Афинского университета. Также имеет диплом Школы духовной византийской музыки Никейской митрополии. 22 июля 1980 года рукоположён во иеродиакона, а 9 сентября того же года рукоположён во иеромонаха и возведён в сан архимандрита митрополитом Кассандрийским Синесием (Висвинисом). В 2002 году познакомился с миссионерскими усилиями Александрийского патриархата и перешёл в клир этой церкви. Служил в Камерунской митрополии, а с 2010 по 2016 год являлся протосингелом Иринопольской митрополии. В октябре 2016 года патриарх Александрийский Феодор II пригласил его в Александрию и назначил игуменом и духовником патриаршего монастыря Святого Саввы. 26 ноября 2018 года Синодом Александрийского Патриархата был избран на новообразованную Малавийскую кафедру. 23 декабря того же года последовала его епископская хиротония, которую совершили Папа и Патриарх Александрийский Феодор II, митрополит Мемфисский Никодим (Приангелос), митрополит Пелусийский Нифон (Цаварис), митрополит Акумский Даниил (Биазис), митрополит Бурундийский Иннокентий (Бьякатонда), епископ Гулуский Сильвестр (Киситу) и епископ Вавилонский Феодор (Дридакис) Примечания Выпускники философского факультета Афинского университета Выпускники богословского института Афинского университета Епископы Александрийской православной церкви

The 172279th positive integer is an odd prime number that follows the number 172278 and comes before 172280. One hundred seventy-two thousand two hundred seventy-nine is 6 digits long. Q: Is 172279 a prime number? Q: What is the negative number for 172279? Q: What is half of 172279? Q: What is a third of 172279? Q: What is a quarter of 172279? Q: What is the square root of 172279? Q: What is 172279 times Pi? Q: What is 172279 divided by Pi? Q: What is the scientific notation for 172279? Q: What are the divisors for 172279? Q: What is the factorization of 172279? Q: What is the sum of divisors of 172279, including itself? Q: What is the sum of divisors of 172279, excluding itself? The spelling of 172279 in different languages. Q: What is the roman numeral for 172279? Q: What is the digital capacity for 172279? The number 172279 represented in different base number systems. List the frequency of characters that make up the number 172279. List of hash code values for 172279.

Exhibit 10.74 EMPLOYMENT AGREEMENT THIS EMPLOYMENT AGREEMENT is entered into as of the 1 day of October 1997, by and between Meadow Valley Corporation, a Nevada corporation (the "Employer"), and Paul R. Lewis (the "Employee"). The Employer hereby... Filed: March 17th, 1998 Contract Type Employment Agreement Jurisdiction Arizona Industry Water, sewer, pipeline, comm & power line construction Company Meadow Valley Corp SEC Filing Type 10-k405 1. EMPLOYMENT 2. TERM 3. COMPENSATION 3. CONTINUATION OF INDEMNITY 4. NOTIFICATION AND DEFENSE OF CLAIM 5. REPAYMENT OF EXPENSES 9. ADDITIONAL RIGHTS 2. LIMITATIONS ON INDEMNITY Employer and Meadow Valley Contractors 16. ASSIGNMENT OF AGREEMENT 17. SURVIVAL OF REPRESENTATIONS, WARRANTIES AND COVENANTS 18. FURTHER INSTRUMENTS 22. SPECIAL RIGHT OF EMPLOYEE UNDER CERTAIN CIRCUMSTANCES 4. OPTIONS TO ACQUIRE COMMON STOCK 5. EMPLOYEE BENEFITS 6. MOVING EXPENSES AND SUBSISTENCE 7. HOLIDAYS AND VACATION 8. RESPONSIBILITIES OF EMPLOYEE 9. WORKING FACILITIES 10. EXPENSES 11. DISABILITY A) WITHOUT CAUSE C) TERMINATION BY EMPLOYER FOR REASONABLE CAUSE B) VOLUNTARY TERMINATION BY EMPLOYEE WITHOUT CAUSE THIS EMPLOYMENT AGREEMENT is entered into as of the 1 day of October 1997, by and between Meadow Valley Corporation, a Nevada corporation (the "Employer"), and Xxxx X. Xxxxx (the "Employee"). The Employer hereby employs the Employee on a full-time basis, and the Employee hereby accepts such full-time employment on the terms condition hereinafter set forth. 1. EMPLOYMENT. Employee is employed as the Chief Operating Officer for the Employer. Employee shall perform all duties as outlined herein and as may be assigned by the Employer and shall devote full time, attention and loyalty to the affairs of the Employer. The duties of the Employee shall specifically be: A) Oversee all operating entities of the Employer. Reporting to Xxx Xxxxx will be each Area Manager for the Nevada, Arizona, AKR and Utah Areas, and the Presidents of Prestressed Products Incorporated and Ready Mix, Inc., and the Manager for the Rock & Sand Operations. B) Assist operating units in decision-making relative to work bidding, margins bid, and preparation and submission of estimates. C) Assist operating units to maximize profitability by active participation in project planning, problem-solving, partnering, and claims/litigation preparation. D) Assist and oversee operating budgets, capital expenditure budgets and approve project specific budgets for use in the Company's Budget Bonus Incentive Program. E) Oversee and delegate as necessary administration of the Company's equipment and other resources. The COO is responsible for decision-making regarding the types of equipment acquired in capital purchases and leases. F) Assist in selection and evaluation of merger and/or acquisition opportunities of the Company. G) Assist in formulating and executing strategic plans. H) Any other area specifically assigned by the Chief Executive Officer or the Board of Directors. 2. TERM. Subject to the provisions of termination provided in paragraph 12, the initial term of this Agreement shall commence on October 1, 1997 and terminate on September 30, 2002. This Agreement may be extended by the mutual written agreement of the Employee and the Employer. 3. COMPENSATION. Employee shall receive a base salary of One Hundred Ten Thousand Dollars ($110,000.00) per year, payable in accordance with the regular payroll practices of Employer, and subject to applicable deductions of withholding taxes and other customary employment taxes. The Chief Executive Officer of Employer shall review Employee's salary at a minimum annually and may adjust Employee's salary of 1934 and amendments thereto or similar provisions of any federal, state or local law; or (d) On account of Indemnified Party's conduct which is finally determined to have been knowingly fraudulent, deliberately dishonest or willfully in violation of applicable law for which the corporation suffered actual financial damages; or (e) If a final decision by a court having jurisdiction in the matter shall determine that such indemnification is not lawful. 3. CONTINUATION OF INDEMNITY. All agreements and obligations of the Corporation contained herein shall continue during the period Indemnified Party is an officer or director of the Corporation or a subsidiary and thereafter so long as Indemnified Party shall be subject to any possible claim or threatened, pending or completed action, suit or proceeding, whether civil, criminal or investigate, by reason of the fact that Indemnified party was an officer or a director of the Corporation or any subsidiary. 4. NOTIFICATION AND DEFENSE OF CLAIM. Within 30 days after receipt by Indemnified Party of notice of any claim or any threatened, pending or completed action, suit or proceeding, whether civil, criminal, administrative or investigative, in which Indemnification Party has a right to Indemnification hereunder, Indemnified Party will notify the Corporation of the commencement thereof. With respect to any such action, suit or proceeding as to which Indemnified Party notifies the Corporation of the commencement thereof: (a) The Corporation will be entitled to participate therein at its own expense; and (b) Except as otherwise provided below, to the extent that it may wish, the Corporation jointly with any other indemnifying party will be entitled to assume the defense thereof, with counsel satisfactory to Indemnified Party. After notice from the Corporation to Indemnified Party of its election to assume the defense thereof, the Corporation will not be liable to Indemnified Party under this Agreement for any legal or other expenses subsequently incurred by Indemnified Party in connection with the defense thereof other than reasonable costs of investigation or as otherwise provided below. Indemnified Party shall have the right to employ counsel in such action, suit or proceeding, but the fees and expenses of such counsel incurred after notice from the Corporation of its assumption of the defense thereof shall be at the expense of Indemnified Party, unless (i) the employment of counsel by Indemnified Party has been authorized by the Corporation, (ii) Indemnified Party shall have reasonably concluded that there may be a conflict of interest between the Corporation and Indemnified Party in the conduct of the defense of such action, (iii) the Corporation shall not in fact have employed counsel to assume the defense of such action, in each of which cases the fees and expenses of counsel shall be at the expense of the Corporation, or (iv) unless the Indemnified Party reasonably and in good faith asserts defenses and theories of defense not asserted by the Corporation. The Corporation shall not be entitled to assume the defense of any action, suit or proceeding brought by or on behalf of the Corporation or as to which Indemnified Party shall have made the conclusion provided for in (ii) or (iv) (c) The Corporation shall not be liable to indemnify Indemnified Party under this Agreement for any amounts paid in settlement of any action or claim effected without the Corporation's written consent. The Corporation shall not settle any action or claim in any manner which would impose any penalty or limitation on Indemnified Party without Indemnified Party's written consent. Neither the Corporation or Indemnified Party will unreasonably withhold their consent to any proposed settlement. 5. REPAYMENT OF EXPENSES. Indemnified Party agrees that Indemnified Party will reimburse the Corporation for all reasonable expenses paid by the Corporation in defending any civil or criminal action, suit or proceeding against Indemnified Party in the event and only to the extent that Indemnified Party is finally determined that Indemnified Party is not entitled to be indemnified by the Corporation for such expenses under the Corporation's charter or bylaws, this Agreement or under applicable law. 6. ENFORCEMENT. (a) The Corporation expressly confirms and agrees that it has entered into this Agreement and assumed the obligations imposed on the Corporation hereby in order to induce Indemnified Party to serve as an officer and/or director of the Corporation or any subsidiary thereof, and acknowledges that Indemnified Party is relying upon this Agreement as part of the consideration for so acting. (b) In the event Indemnified Party is requiring to bring any action to enforce rights on to collect moneys due under this Agreement and is successful in such action, the Corporation shall reimburse Indemnified Party for all of Indemnified Party's reasonable attorneys' and other fees and expenses in bringing and pursuing such action. 7. SEVERABILITY. Each of the provisions of this Agreement in a separate and distinct agreement and independent of the others, so that if any provision hereof shall be held to be invalid or unenforceable for any reason, such invalidity or unenforceability shall not affect the validity or enforceability of the other provisions hereof. 8. GOVERNING LAW: BINDING EFFECT: AMENDMENT AND TERMINATION. (a) This Agreement shall be interpreted and enforced in accordance with the laws of the State of Arizona. (b) This Agreement shall be binding upon Indemnified Party and upon the Corporation, its successors and assigns, and shall inure to the benefit of Indemnified Party, his heirs, personal representatives and assigns and to the benefit of the Corporation, its successors and assigns. (c) No amendment, modification, termination or change of this Agreement shall be effective unless it is signed by both parties hereto. 9. ADDITIONAL RIGHTS. This Agreement is in addition to, and not in lieu of, any other right to indemnification under the Corporation's corporate charter, bylaws, insurance contracts or otherwise at law or in equity. IN WITNESS WHEREOF, the parties hereto have executed this Agreement on and as of the day and year first above written. MEADOW VALLEY CORPORATION AND MEADOW VALLEY CONTRACTORS, INC. By: /s/ Xxxxxxx X. Xxxxxx Xxxxxxx X. Xxxxxx, President and Chief Executive Indemnified Party: /s/ Xxxx X. Xxxxx Xxxx X. Xxxxx Agreement by Employer or (ii) failure of Employer to pay any amount owed Employee hereunder at the time and in the amount due or (iii) failure of Employer to follow applicable law, especially with respect to SEC filings and compliance over the objection of Employee or contrary to the reasonable advice of Employee or (iv) egregiously improper conduct with respect to dealing with Employee or in a manner which brings discredit to Employee. 13. CONFIDENTIALITY. Employee agrees not to disclose any confidential, proprietary competitively sensitive information to persons who are not employees, directors, lenders, bonding agents, insurance companies or advisors of the Employer, except as required by law, without prior consent of the Employer, provided however, any disclosure involving this paragraph shall not result in a breach of this Agreement unless the disclosure has a materially adverse effect on the Employer. 14. INDEMNIFICATION. Employer and Meadow Valley Contractors, Inc. shall provide Employee with an Officer Indemnification Agreement in the form attached hereto. 15. NOTICES. All notices, demands, and communications given under this Agreement ("Notice") shall be in writing and delivered personally or sent by registered or certified mail, return receipt requested, in the United States mail, postage prepaid, addressed as follows: If to Employer: Meadow Valley Corporation X.X. Xxx 00000 Xxxxxxx, XX 00000-0000 If to Employee: X.X. Xxx 00 Xxxxx, XX 00000 or at such other address as a party may from time to time designate by Notice hereunder. Notice shall be effective upon delivery in person, or if mailed, at midnight on the third business day after the date of mailing. 16. ASSIGNMENT OF AGREEMENT. Neither party may assign or otherwise transfer this Agreement or any of its rights or obligations hereunder without the prior written consent to such assignment or transfer by the other party hereto; and all the provisions of this Agreement shall be binding upon the respective employees, successors, heirs and assigns of the parties; provided, however, the benefits payable to Employee hereunder in the event of disability or death or incapacity are payable to Employee's spouse or personal representative. 17. SURVIVAL OF REPRESENTATIONS, WARRANTIES AND COVENANTS. This Agreement and the representations, warranties, covenants and other agreements (however characterized or described) by both parties and contained herein or made pursuant to the provisions hereof shall survive the execution and delivery of this Agreement. 18. FURTHER INSTRUMENTS. The parties shall execute and deliver any and all such other instruments in reasonable mutually acceptable form and substance and shall take any and all such other actions as may be reasonably necessary to carry the intent of the Agreement into full force and effect. 19. SEVERABILITY. If any provision of this Agreement shall be held, declared or pronounced void, voidable, invalid, unenforceable or inoperative for any reason by any court of competent jurisdiction, governmental authority or otherwise, such holding, declaration or pronouncement shall not affect adversely any other provision of this Agreement, which shall otherwise remain in full force and effect and be enforced in accordance with its terms, and the effect of such holding, declaration or pronouncement shall be limited to the territory of jurisdiction in which made. 20. WAIVER. All the rights and remedies of either party under this Agreement are cumulative and not exclusive of any other rights and remedies provided by law. No delay or failure on the part of either party in the exercise of any right or remedy arising from a breach of this Agreement shall operate as a waiver of any subsequent right or remedy arising from a subsequent breach of this Agreement. The consent of any party where required hereunder to any act or occurrence shall not be deemed to be a consent to any other act or occurrence. 21. GENERAL PROVISIONS. This Agreement shall be construed and enforced in accordance with, and governed by, the laws of the state of Arizona. Except as otherwise expressly stated herein, time is of the essence in performing under this Agreement. This Agreement embodies the entire agreement and understanding between the parties and supersedes all prior agreements and understandings relating to the subject matter of this Agreement as it relates to the parties' duties and obligations from and after April 1, 1997, and this Agreement may not be modified or amended or any term or provision hereof waived or discharged except in writing signed by the party against whom such amendment, modification, waiver or discharge is sought to be enforced. The headings of this Agreement are for convenience in reference only and shall not limit or otherwise affect the meaning thereof. This Agreement may be executed in any number of counterparts, each of which shall be deemed an original but all of which taken together shall constitute one and the same instrument. 22. SPECIAL RIGHT OF EMPLOYEE UNDER CERTAIN CIRCUMSTANCES. During the term of this Agreement, if (i) Employer is involved in a merger, consolidation or other business combination in which Employer is not the surviving and controlling entity; or (ii) all or substantially all the assets of Employer or principal subsidiary are sold; or (iii) in the event Employee is required to relocate outside the Moapa, Nevada area in a manner not mutually acceptable to Employee and Employer, then Employee shall have the following rights: A) To terminate this Agreement with 30 days prior notice, in which event Employer shall pay Employee as if there were a termination without cause by the Employer; and B) All options granted shall, to the extent not specifically prohibited by the stock option plan then in effect, vest immediately and be exercisable within one year of the occurring of one of the events set forth in (i), (ii) or (iii) above. IN WITNESS WHEREOF, the parties have executed this Agreement on the day and year first above written. /s/ Xxxx X. Xxxxx By /s/ Xxxxxxx X. Xxxxxx ----------------------------- --------------------------------- Employee President/CEO XXXXXX XXXXXX XXXXXXXXXXX XXX XXXXXX XXXXXX CONTRACTORS, INC. OFFICER/DIRECTOR INDEMNIFICATION AGREEMENT THIS AGREEMENT ("Agreement") is entered into and effective this __ day of _______, 19__, by and between Meadow Valley Corporation and Meadow Valley Contractors, Inc., Nevada corporations ("Corporation"), and Xxxx X. Xxxxx ("Indemnified Party"). WHEREAS, the Board of Directors has determined that it is in the best interest of the Corporation and its shareholders to agree to indemnify Indemnified Party (who is a Director and/or Officer of the Corporation) from and against certain liabilities for actions taken by him during the performance of his tasks for the Corporation. NOW, THEREFORE, in consideration of the premises and for other good and valuable consideration, the receipt, adequacy and sufficiency of which is hereby acknowledged, the parties hereto agree as follows: 1. INDEMNIFICATION. The Corporation hereby agrees to indemnify and hold harmless Indemnified Party to the maximum extent possible under all applicable laws against any and all claims, demands, debts, duties, liabilities, judgments, fines and amounts paid in settlement and expenses (including attorneys' fees and expenses) actually and reasonably incurred by Indemnified Party in connection with the investigation, defense, negotiation and settlement of any such claim or any threatened, pending or completed action, suit or proceeding, whether civil, criminal, administrative or investigative (including an action by or in the right of the Corporation) to which Indemnified Party is or becomes a party, or is threatened to be made a party, by reason of the fact that Indemnified Party is an officer or a director of the Corporation or any of its subsidiaries. 2. LIMITATIONS ON INDEMNITY. No indemnity pursuant to this Agreement shall be made by the Corporation: (a) For the amount of such losses for which the Indemnified Party is indemnified pursuant to any insurance purchased and maintained by the Corporation; or (b) In respect to remuneration paid to Indemnified Party if it shall be determined by a final judgment or other final adjudication that such remuneration was in violation of law; or (c) On account of any suit in which judgment is rendered against Indemnified Party for an accounting of profits made (i) for an improper personal profit without full and fair disclosure to the Corporation of all material conflicts of interest and not approved thereof by a majority of the disinterested members of the Board of Directors of the Corporation; or (ii) from the purchase or sale by Indemnified Party of securities of the Corporation pursuant to the provisions of Section 16(b) of the Securities Exchange Act upward to recognize improvement, achievement or expansion of Employee's responsibilities subject to approval of the Board Compensation Committee. Employee shall participate as a member of senior management in cash incentive plans as currently existing or as amended or adopted in the future by the Compensation Committee of Employer's Board of Directors. Cash bonus plans are subject to annual review and/or change as recommended by the Compensation Committee and approved by the Board of Directors. 4. OPTIONS TO ACQUIRE COMMON STOCK. Employee is eligible to participate in the Meadow Valley Corporation 1994 Stock Option Plan. Future grants of stock options shall be subject to the discretion of Meadow Valley Corporation's board of directors. 5. EMPLOYEE BENEFITS. Employer shall provide to Employee, and to the Employee's dependents, a comprehensive major medical, health, and dental insurance program comparable to the programs normally provided by other employers in the same industry and marketplace, and the Employer shall pay the cost of the Employee's portion of the premium. Should, at any time, the Employee opt to maintain a personal major medical and health insurance policy for himself and for his dependents and not participate in the Employer's group plan, then Employer shall reimburse Employee the lesser of the amount Employee pays for said personal policy, as evidenced by adequate documentation, or what Employer would otherwise be paying were Employee participating in the Employer's group plan. Should the Employee opt to maintain his own coverage, neither he nor his dependents shall be precluded from later participating in the Employer's group plan so long as they otherwise qualify for enrollment. At Employer's cost, Employer will maintain a life insurance policy covering Employee, with at least $250,000 of death benefits being payable, in a manner that is free of income tax, to Employee's estate or other beneficiaries designated by Employee. Employer agrees to provide Employee with an automobile for business-related use. In addition to the cost of the vehicle itself, Employer shall pay, directly or by reimbursement to Employee, for all maintenance, fuel, repairs, insurance, operating and other costs incidental thereto. Employer shall pay for, or reimburse Employee for, dues for his membership in industry related associations perceived as beneficial to Employer and as approved by the Chief Executive Officer. So long as it is within the guidelines of the respective plan, Employee shall be given the opportunity to participate in Employer's 401(k) and any other plans made available to other members of executive management. Employee shall be entitled to receive all other employee benefits for senior management personnel upon the terms and conditions then in effect. 6. MOVING EXPENSES AND SUBSISTENCE. In the event the Employer requires the Employee to relocate, the Employer shall pay for all moving costs of reasonable and normal household effects, including up to six months storage of such household effects while Employee obtains a permanent residence in the relocation area. Employee shall obtain a minimum of two moving and storage quotes from reputable movers and Employer shall pay the most competitive rate. Employer shall provide Employee a subsistence allowance of Two Thousand Dollars ($2,000.00) per month for the lesser of nine months from the date of reassignment in a new location or until such time as the relocation of Employee and his/her spouse to the relocation area is complete. In addition, costs for one round-trip airline ticket per week between the Employee's previous location and the relocation area will be reimbursed by Employer to Employee during the same nine-month period, or less if relocation is completed earlier. Such tickets may be used either by Employee or by his/her spouse. 7. HOLIDAYS AND VACATION. A) Employee shall be paid for the following seven (7) holidays: New Year's Day, Memorial Day, Independence Day, Labor Day, Thanksgiving Day and the day after Thanksgiving, and Christmas Day and all other holidays for Employees of the Company as approved by the Chief Executive Officer or Board of Directors. B) Employee is entitled to four weeks vacation during the first year of employment and for each year thereafter. Unused vacation in any given year shall accrue to following years up to a maximum of eight weeks in any one year. 8. RESPONSIBILITIES OF EMPLOYEE. The Employee shall devote such reasonable time as is necessary or is deemed reasonably necessary by the Employer to carry out all required duties and will devote full time to the Employer during normal business hours. The Employee shall at all times faithfully, with diligence and to the Employee's best good faith ability, experience and talents, perform all the duties that may be required pursuant to the express terms hereof to the reasonable satisfaction of the Employer, in accordance with customary professional standards. 9. WORKING FACILITIES. The Employee shall be furnished with all facilities and services suitable to Employee's position and adequate for the performance of Employee's duties. 10. EXPENSES. The Employee is authorized to incur reasonable expenses for promoting business of the Employer, including expenses for entertainment, travel and similar items. The Employer shall reimburse the Employee for all such expenses on the presentation by the Employee of itemized and adequately documented accounts of such expenditures. 11. DISABILITY. If unable to perform duties under the terms of this Agreement by reason of illness or incapacity for a period of four weeks, Employee shall, commencing at the end of such four week period, be entitled to receive Employee's compensation hereunder for a period of up to and including a maximum of one year or until he is no longer disabled, whichever occurs first. After one year of disability at full salary, the Employee, or his designated beneficiary, shall be provided with a disability insurance policy, if available, at no cost to Employee. The disability income policy would provide for monthly income benefits at the rate of sixty percent (60%) of the Employee's base salary at the time the disability occurred. The Company will attempt to procure a disability income policy that would provide monthly benefits until the Employee reaches 65 years of age or is no longer disabled whichever occurs first. If such a policy is unavailable, the Company will attempt to provide the best policy available. If no policy is available, no other disability income benefits will be provided. 12. TERMINATION. This Employment Agreement may be terminated under the following circumstances. A) WITHOUT CAUSE. Employer may terminate this Agreement at any time upon thirty (30) days written notice to Employee, but Employer shall be obligated to pay to Employee compensation in a lump sum for the balance of the term of this Agreement within 30 days of termination, unless Employee agrees to other payment terms. B) VOLUNTARY TERMINATION BY EMPLOYEE WITHOUT CAUSE. Employee may terminate this Agreement at any time upon thirty (30) days written notice to Employer and Employer shall be obligated, in that event, to pay Employee compensation up to the date of the termination only. All accrued but unpaid compensation and Employee benefits shall be paid in cash within 30 days of termination, unless Employee agrees to other payment terms. C) TERMINATION BY EMPLOYER FOR REASONABLE CAUSE. The Employer may terminate this Agreement for reasonable cause upon the unanimous vote of the Board of Directors and by thirty (30) days written notice to the Employee and Employer shall be obligated, in that event, to pay Employee compensation up to the date of termination only. For purposes hereof, "cause" shall be defined as meaning (i) such conduct by the Employee which constitutes material breach of this Agreement which is not cured within ninety (90) days of written notice to the Employee of said alleged breach or (ii) a material failure to competently perform Employee's duties as stated in paragraph 1 in accordance with applicable professional standards as stated in paragraphs 1 and 8 hereof provided that Employer has previously given Employee written notice and a reasonable opportunity to remedy such failure and such failure has a materially adverse effect on the business or financial condition of Employer or (iii) material breach of Employee's fiduciary duty and such breach has a material adverse effect on the business or financial condition of Employer to (iv) egregiously improper or illegal conduct of the Employee which, based upon a unanimous good faith determination of the Board of Directors of the Employer, has a material adverse affect on Employer. D) TERMINATION BY EMPLOYEE FOR REASONABLE CAUSE. Employee may terminate this Agreement for cause. In such event, Employer shall be obligated to pay Employee compensation in lump sum for the balance of the term of this Agreement within 30 days of termination or as Employee shall agree, plus damages suffered and expenses incurred by reason thereof. For this purpose "cause" shall mean (i) a material breach of this

Q: Cannot read property 'map' of undefined on useState value I'm new to react, I'm getting this error constantly and after google some I can't find the reason why the useState value can't be read as array :( ... this the error I'm getting: 'TypeError: team.map is not a function' import React, { useEffect, useState } from "react"; const SportTeams = () => { const [team, setTeam] = useState([]); useEffect(() => { const getSports = async () => { const response = await fetch("https://www.thesportsdb.com/api/v1/json/1/all_sports.php"); const data = await response.json(); setTeam(data); console.log(data); } getSports(); }, []); return ( <div className="myClass"> <ul> {team.map((sport, index) => { return <li key={`${sport.strSport}-${index}`}>{sport.strSport}</li> })} </ul> </div> ); }; export default SportTeams; A: Just update setTeam like following, your error will be resolved. setTeam(data.sports); A: It is because you are setting the team state with the data without checking if its undefined. If the data is undefined your state team become undefined as well. So make sure to check the data. import React, { useEffect, useState } from "react"; const SportTeams = () => { const [team, setTeam] = useState([]); useEffect(() => { const getSports = async () => { const response = await fetch("https://www.thesportsdb.com/api/v1/json/1/all_sports.php"); if (response) { const data = await response.json(); if (data) { setTeam(data); } } console.log(data); } getSports(); }, []); return ( <div className="myClass"> <ul> {team.map((sport, index) => { return <li key={`${sport.strSport}-${index}`}>{sport.strSport}</li> })} </ul> </div> ); }; export default SportTeams; There might also be the chance that your response is not what you expected and the actual data might be inside your response. In that case you need check what your response first then proceed to set the data. A: As I said in my comment. the value you are setting to teams isn't an array. const data = await response.json(); setTeam(data.sports);

//------------------------------------------------------------------------------ // <auto-generated> // This code was generated by a tool. // // Changes to this file may cause incorrect behavior and will be lost if // the code is regenerated. // </auto-generated> //------------------------------------------------------------------------------ namespace Scada.Web { public partial class WFrmEvents { /// <summary> /// EventsForm control. /// </summary> /// <remarks> /// Auto-generated field. /// To modify move field declaration from designer file to code-behind file. /// </remarks> protected global::System.Web.UI.HtmlControls.HtmlForm EventsForm; /// <summary> /// lblEvents control. /// </summary> /// <remarks> /// Auto-generated field. /// To modify move field declaration from designer file to code-behind file. /// </remarks> protected global::System.Web.UI.WebControls.Label lblEvents; /// <summary> /// rbEvAll control. /// </summary> /// <remarks> /// Auto-generated field. /// To modify move field declaration from designer file to code-behind file. /// </remarks> protected global::System.Web.UI.WebControls.RadioButton rbEvAll; /// <summary> /// rbEvView control. /// </summary> /// <remarks> /// Auto-generated field. /// To modify move field declaration from designer file to code-behind file. /// </remarks> protected global::System.Web.UI.WebControls.RadioButton rbEvView; /// <summary> /// chkEvPause control. /// </summary> /// <remarks> /// Auto-generated field. /// To modify move field declaration from designer file to code-behind file. /// </remarks> protected global::System.Web.UI.WebControls.CheckBox chkEvPause; /// <summary> /// lblEvPause control. /// </summary> /// <remarks> /// Auto-generated field. /// To modify move field declaration from designer file to code-behind file. /// </remarks> protected global::System.Web.UI.WebControls.Label lblEvPause; } }

Q: How to use listing, tikz and tikzmark packages together to annotate source code listing? I'd like to annotate code listing something like this: Below is what I've attempted so far. I am a little worried about having to use raisebox so that the arrow tip doesn't point to the base of the line. How can I avoid this hardcoding? I would also appreciate any advice on improvements so that it's easier to handle a few varieties of annotations as seen in the screenshot. It would be nice, to get the desired results, if I can just specify the following: * *the distance between the end of source line and the arrow tip *the length of the horizontal line and the length of the vertical line of the arrow (and whether the vertical line goes upwards or downwards) *and the position of the text node (whether right or left of the vertical line and vertical alignment of text node with the top or bottom. \documentclass[twoside, openright, 10pt]{book} \usepackage{listings} \usepackage{tikz} \usetikzlibrary{arrows.meta, tikzmark} \begin{document} \chapter{TiKz} \begin{lstlisting}[caption={[MeetKarel]{MeetKarel}}, label={lst:meet_karel}, escapechar=ß] import stanford.karel.Karel; public class MeetKarel extends Karel { public void run() { move(); move(); move(); ß\tikzmark{b}ßpickBeeper();ß\raisebox{2.6pt}{\tikzmark{a}}ß turnLeft(); move(); move(); turnLeft(); turnLeft(); turnLeft();ß\raisebox{2.6pt}{\tikzmark{c}}ß move(); putBeeper(); move(); } } \end{lstlisting} \begin{tikzpicture}[remember picture,overlay] \draw([shift={(12ex,10ex)}] pic cs:a) ++ (0.05, 0) % shift just a little to the right % set inner and outer to 0 so that text is alighed with the beginning of the vertical line node[inner sep=0,outer sep=0, fill=yellow!80!black,text width=5cm, anchor= north west] {Shifted a little above so that the arrow head points to the middle of the line.}; \draw[thin, gray, arrows = {-Stealth[inset=0pt, angle=45:7pt]}] ([shift={(12ex,10ex)}] pic cs:a) -- ([shift={(12ex,0ex)}] pic cs:a) -- ([shift={(0ex,0ex)}] pic cs:a); \draw([shift={(12ex,-10ex)}] pic cs:c) ++ (0.05, -0.05) % shift just a little to the right and down % set inner and outer to 0 so that text is alighed with the beginning of the vertical line node[inner sep=0,outer sep=0, fill=yellow!80!black,text width=5cm, anchor= south west] {I want to align base line of this text to the `c` node nicely. }; \draw[thin, gray, arrows = {-Stealth[inset=0pt, angle=45:7pt]}] ([shift={(12ex,-10ex)}] pic cs:c) -- ([shift={(12ex,0ex)}] pic cs:c) -- ([shift={(0ex,0ex)}] pic cs:c); \end{tikzpicture} \end{document} Result: A: Here's a slightly simplified version of your code. * *By using the tikzmark special listings library then you don't need to specify tikzmarks in your code, they are all provided for you. *The arrows start at (0.5,.5ex) away from the corresponding tikzmarks. The .5ex is half the height of an x, and looks a good vertical height to me. *The lines and nodes are drawn together and the -| path construction is used to make the line bend nicely. *A little bit is added to the outer xsep of the label nodes to move them away from the joining line. Other ways of achieving the same effect do seem to cause issues with the arrow placement. All of this contrives to make the code much shorter. Various numbers could be hard-coded into a style to make it even more simple and a bit more flexible. \documentclass[twoside, openright, 10pt]{book} %\url{https://tex.stackexchange.com/q/657375/86} \usepackage{listings} \usepackage{tikz} \usetikzlibrary{ arrows.meta, tikzmark, calc, positioning } \usetikzmarklibrary{listings} \begin{document} \chapter{Ti\emph{k}Z} \begin{lstlisting}[ caption={[MeetKarel]{MeetKarel}}, label={lst:meet_karel}, name=karel, escapechar=ß ] import stanford.karel.Karel; public class MeetKarel extends Karel { public void run() { move(); move(); move(); pickBeeper(); turnLeft(); move(); move(); turnLeft(); turnLeft(); turnLeft(); move(); putBeeper(); move(); } } \end{lstlisting} \begin{tikzpicture}[ remember picture, overlay, annotation/.style={ inner sep=0pt, outer sep=0pt, outer xsep=1mm, fill=yellow!80!black, text width=5cm }, >={Stealth[inset=0pt, angle=45:7pt]} ] \draw[<-] (pic cs:line-karel-7-end) ++(.5,.5ex) -| ++(2,1.5) node[annotation, below right] {Shifted a little above so that the arrow head points to the middle of the line.}; \draw[<-] (pic cs:line-karel-13-end) ++(0.5,.5ex) -| ++(2,-1) node[annotation, above right] {I want to align base line of this text to the `c` node nicely. }; \end{tikzpicture} \end{document}

Q: How to get number of matching colums count in the same table as another column? I have a table like below. +----+----------+---------+--------+----------+---------+---------------------+ | id | box_name | diIndex | diMode | diStatus | status | last_updated | +----+----------+---------+--------+----------+---------+---------------------+ | 7 | boxa | 0 | 0 | 0 | 1 | 2017-03-02 10:49:35 | | 8 | boxa | 1 | 0 | 1 | 0 | 2017-03-02 10:49:35 | | 9 | boxa | 2 | 0 | 0 | 1 | 2017-03-02 10:49:36 | | 10 | boxa | 3 | 0 | 0 | 1 | 2017-03-02 10:49:36 | | 11 | boxa | 4 | 0 | 0 | 0 | 2017-03-02 10:49:36 | | 12 | boxa | 5 | 0 | 0 | 2 | 2017-03-02 10:49:36 | | 13 | boxa | 6 | 0 | 0 | 2 | 2017-03-02 10:49:36 | | 14 | boxa | 7 | 0 | 0 | 3 | 2017-03-02 10:49:36 | +----+----------+---------+--------+----------+---------+---------------------+ Now I want to add a new column in the table which will get me the total number of each matching record of status column like below. +----+----------+---------+--------+----------+---------+---------------+---------------------+ | id | box_name | diIndex | diMode | diStatus | status | status count | last_updated | +----+----------+---------+--------+----------+---------+---------------+---------------------+ | 7 | boxa | 0 | 0 | 0 | 1 | 3 | 2017-03-02 10:49:35 | | 8 | boxa | 1 | 0 | 1 | 0 | 2 | 2017-03-02 10:49:35 | | 9 | boxa | 2 | 0 | 0 | 1 | 3 | 2017-03-02 10:49:36 | | 10 | boxa | 3 | 0 | 0 | 1 | 3 | 2017-03-02 10:49:36 | | 11 | boxa | 4 | 0 | 0 | 0 | 2 | 2017-03-02 10:49:36 | | 12 | boxa | 5 | 0 | 0 | 2 | 2 | 2017-03-02 10:49:36 | | 13 | boxa | 6 | 0 | 0 | 2 | 2 | 2017-03-02 10:49:36 | | 14 | boxa | 7 | 0 | 0 | 3 | 1 | 2017-03-02 10:49:36 | +----+----------+---------+--------+----------+---------++--------------+---------------------+ Here you can see that for status value 1 there are 3 records so value for status_count for columns having status as 1 will be 3 and so on.. How can I achieve this? A: With window functions, this would be almost trivial to add as a column in a query: COUNT(*) OVER (PARTITION BY status) AS status_count Since MySQL hasn't implemented them (you'll have to wait, they may be in the next version), you'll need something more complex now. It can be done with a derived table - to calculate these counts - and then join to the base table: SELECT t.id, t.box_name, t.diIndex, t.diMode, t.diStatus, t.status, g.status_count, t.last_updated FROM tableX AS t JOIN ( SELECT status, COUNT(*) AS status_count FROM tableX GROUP BY status ) AS g ON t.status = g.status ;

\section{Introduction} \noindent The vertical dynamics of a free falling ball on a moving racket is considered. The racket is supposed to move periodically in the vertical direction according to a regular periodic function $f(t)$ and the ball is reflected according to the law of elastic bouncing when hitting the racket. The only force acting on the ball is the gravity $g$. Moreover, the mass of the racket is assumed to be large with respect to the mass of the ball so that the impacts do not affect the motion of the racket. \noindent This model has inspired many authors as it represents a simple model exhibiting complex dynamics, depending on the properties of the function $f$. The first results were given by Pustyl'nikov in \cite{pust} who studied the possibility of having motions with velocity tending to infinity, for $\df$ large enough. On the other hand, KAM theory implies that if the $C^k$ norm, for $k$ large, of $\df$ is small then all motions are bounded. On these lines some recent results are given in \cite{ma_xu,maro4,maro6}. Bounded motions can be regular (periodic and quasiperiodic, see \cite{maro3}) and chaotic (see \cite{maro5,maro2,ruiztorres}). Moreover, the non periodic case is studied in \cite{kunzeortega2,ortegakunze}, the case of different potentials is considered in \cite{dolgo} and recent results on ergodic properties are present in \cite{studolgo}. In this paper we are concerned with $(p,q)$-periodic motions understood as $p$-periodic with $q$ bounces in each period. Here $p,q$ are supposed to be positive coprime integers. In \cite{maro3} it is proved that if $p/q$ is sufficiently large, then there exists at least one $(p,q)$-periodic motion. This result comes from an application of Aubry-Mather theory as presented in \cite{bangert}. Actually, the bouncing motions correspond to the orbits of an exact symplectic twist map of the cylinder. The orbits of such maps can be found as critical points of an action functional and the $(p,q)$-periodic orbits found in \cite{maro3} correspond to minima. Here we first note that a refined version of Aubry-Mather theory (see \cite{katok_hass}) gives, for each couple of coprime $p,q$ such that $p/q$ is large, the existence of another $(p,q)$-periodic orbit that is not a minimum, since it is found via a minimax argument. This gives the existence of two different $(p,q)$-periodic motions for fixed values of $p,q$, with $p/q$ large. We are first interested in the stability in the sense of Lyapunov of such periodic motions. This is related to the structure of the $(p,q)$-periodic orbits of the corresponding exact symplectic twist map, for fixed $p,q$. It comes from Aubry-Mather theory that the $(p,q)$-periodic orbits that are minima can be ordered and if there are two with no other in the middle then they are connected by heteroclinic orbits. In this case they are unstable. On the other hand, $(p,q)$-periodic orbits can form an invariant curve. In this case they are all minima but their stability cannot be determined as before since we are in a degenerate scenario. However, if we suppose to be in the real analytic case, a topological argument (see \cite{ortega_fp,ortega_book}) can be used to deduce instability. More precisely we will use the fact that for a real analytic area and orientation preserving embedding of the plane that is not the identity, every stable fixed point is isolated. Therefore, the hypothesis of $f$ being real analytic comes here into play. Concerning the structure of the set of $(p,q)$-periodic motions we prove that in the real analytic case they can only be either isolated or in a degenerate case, in the sense that the corresponding orbits form an invariant curve that is the graph of a real analytic function. As before, in the isolated case at least one is unstable and in the degenerate case they all are minima and unstable. Note that this result differs from Aubry-Mather theory since we are not requiring the orbits to be minima of a functional. To prove this result we need the $q$-th iterate of the map to be twist. For $q=1$ this is true for every real analytic $f$, while for the general case $q>1$ we need to restrict to $\norm{\ddf}$ being small. The paper is organized as follows. In Section \ref{sec:theory} we recall some known facts about exact symplectic twist maps together with the results for the analytic case. In Section \ref{sec:tennis} we introduce the bouncing ball map and describe its main properties. Finally, the results on the existence of two $(p,q)$-periodic motions, the instability and the structure of the set are given in Section \ref{sec:per}. \section{Some results on periodic orbits of exact symplectic twist maps}\label{sec:theory} Let us denote by $\Sigma=\RR\times(a,b)$ with $-\infty\leq a<b\leq +\infty$ a possibly unbounded strip of $\RR^2$. We will deal with $C^k$ ($k\geq 1$) or real analytic embeddings $\tilde{S}:\Sigma \rightarrow \RR^2$ such that \begin{equation}\label{def_cyl} \tilde{S}\circ\sigma=\sigma\circ \tilde{S} \end{equation} where $\sigma:\RR^2\rightarrow\RR^2$ and $\sigma(x,y)=(x+1,y)$. By this latter property, $\tilde{S}$ can be seen as the lift of an embedding $S:\Sigma\rightarrow\AA$ where $\AA = \TT\times \RR$ with $\TT = \RR/\ZZ$ and $\Sigma$ is now understood as the corresponding strip of the cylinder. We denote $\tilde{S}(x,y)=(\bar{x},\bar{y})$ and the corresponding orbit by $(x_n,y_n)_{n\in\ZZ}$. We say that $\tilde{S}$ is exact symplectic if there exists a $C^1$ function $V:\Sigma\rightarrow \RR$ such that $V\circ\sigma=V$ and \[ \bar{y} d \bar{x} -y dx = dV(x,y) \quad\mbox{in }\Sigma. \] Moreover, by the (positive) twist condition we understand \[ \frac{\partial \bar{x}}{\partial y} >0 \quad\mbox{in }\Sigma. \] A negative twist condition would give analogous results. The exact symplectic condition implies that $\tilde{S}$ preserves the two-form $dy\wedge dx$ so that it is area and orientation preserving. An equivalent characterization is the existence of a generating function, i.e. a $C^2$ function $h:\Omega\subset \RR^2\rightarrow \RR$ such that $h(x+1,\bar{x}+1) = h(x,\bar{x})$ and $h_{12}(x,\bar{x}) <0$ in $\Omega$ and for $(x,y)\in\Sigma$ we have $\tilde{S}(x,y) = (\bar{x},\bar{y})$ if and only if \[ \left\{ \begin{split} h_1(x,\bar{x})&=-y \\ h_2(x,\bar{x})&=\bar{y}. \end{split} \right. \] Moreover, $\tilde{S}$ preserves the ends of the cylinder if, uniformly in $x$, \[ \bar{y}(x,y) \rightarrow \pm\infty \quad\mbox{as }y\rightarrow \pm\infty \] and twists each end infinitely if, uniformly in $x$, \[ \bar{x}(x,y)-x \rightarrow \pm\infty \quad\mbox{as }y\rightarrow \pm\infty. \] Finally we will say that an embedding of the cylinder $S:\Sigma\rightarrow\AA$ satisfies any of these properties if so does its corresponding lift. These maps enjoy several properties and many interesting orbits are proved to exist. Here we recall some results concerning periodic orbits. We start with the following \begin{definition} Fix two coprime integers $p,q$ with $q\neq 0$. An orbit $(x_n,y_n)_{n\in\ZZ}$ of $\tilde{S}$ is said $(p,q)$-periodic if $(x_{n+q},y_{n+q})=(x_n+p,y_n)$ for every $n\in\ZZ$. Moreover, we say that it is stable (in the sense of Lyapunov) if for every $\varepsilon>0$ there exists $\delta>0$ such that for every $(\hat{x}_0,\hat{y}_0)$ satisfying $|(x_0,y_0)-(\hat{x}_0,\hat{y}_0)|<\delta$ we have $|\tilde{S}^n(\hat{x}_0,\hat{y}_0)-({x}_n,{y}_n)|<\varepsilon$ for every $n\in\ZZ$. \end{definition} \begin{remark}\label{rem_periodic} Note that $(q,p)$-periodic orbits correspond to fixed points of the map $\sigma^{-p}\circ \tilde{S}^q$. This follows from the fact that $\tilde{S}$ is a diffeomorphism defined on the cylinder. Each point of the orbit is a fixed point of $\sigma^{-p}\circ\tilde{S}^q$ and a fixed point of $\sigma^{-p}\circ\tilde{S}^q$ is the initial condition of a $(p,q)$-periodic orbit. Note that different fixed points may correspond to the same orbit but not viceversa. Moreover, if an orbit is $(q,p)$-periodic then it cannot be also $(q',p')$-periodic unless $p/q=p'/q'$. Actually, let $\xi=(x,y)$ and suppose that $\xi=\sigma^{-p}\circ\Phi^q(\xi)=\sigma^{-p'}\circ \Phi^{q'}(\xi)$. Then $\sigma^{p}(\xi)=\Phi^q(\xi)$ and $\sigma^{p'}(\xi)=\Phi^{q'}(\xi)$ from which $\Phi^{qq'}(\xi)=\sigma^{pq'}(\xi)=\sigma^{p'q}(\xi)$ and $pq'=p'q$. Finally, the stability of a $(q,p)$-periodic orbit corresponds to the stability in the sense of Lyapunov of the corresponding fixed point of the map $\sigma^{-p}\circ\tilde{S}^q$. \end{remark} A particular class of periodic orbits are the so called Birkhoff periodic orbits. \begin{definition} Fix two coprime integers $p,q$ with $q\neq 0$. An orbit $(x_n,y_n)_{n\in\ZZ}$ of $\tilde{S}$ is said a Birkhoff $(p,q)$-periodic orbit if there exists a sequence $(s_n,u_n)_{n\in\ZZ}$ such that \begin{itemize} \item $(s_0,u_0)=(x_0,y_0)$ \item $s_{n+1}>s_n$ \item $(s_{n+q},u_{n+q})=(s_{n}+1,u_{n})$ \item $(s_{n+p},u_{n+p})=\tilde{S}(s_{n},u_{n})$ \end{itemize} \end{definition} \begin{remark} Note that a Birkhoff $(p,q)$-periodic orbit is a $(p,q)$-periodic orbit since \[ (x_{n+q},y_{n+q})=(s_{np+qp},u_{np+qp})=(s_{np}+p,u_{np})=\tilde{S}^n(s_0,u_0)+(p,0)=(x_{n}+p,y_{n}). \] \end{remark} The existence of Birkhoff $(p,q)$-periodic orbits comes from Aubry-Mather theory. Here we give a related result \cite[Th. 9.3.7]{katok_hass} \begin{theorem}\label{birk_orbits} Let $S:\AA\rightarrow\AA$ be an exact symplectic twist diffeomorphism that preserves and twists the ends infinitely and let $p,q$ be two coprime integers. Then there exist at least two Birkhoff $(p,q)$-periodic orbits for $S$. \end{theorem} \begin{remark} The Theorem is proved via variational techniques. The periodic orbits correspond to critical points of an action defined in terms of the generating function. One of this point is a minimum and the other is a minimax if the critical points are isolated. \end{remark} In the analytic case, something more can be said on the topology of these orbits. \begin{proposition}\label{unstable} Let $\tilde{S}:\Sigma\rightarrow\RR^2$ be an exact symplectic twist embedding satisfying condition \eqref{def_cyl} and admitting a $(p,q)$-periodic orbit. Then there exists at least one $(p,q)$-periodic orbit that is unstable. \end{proposition} \begin{proof} The proof is essentially given in \cite{maroTMNA,ortega_fp,ortega_book}. We give here a sketch. It is enough to prove that there exists at least one unstable fixed point of the area and orientation preserving 1-1 real analytic map $\sigma^{-p}\circ \tilde{S}^q$. Let us first note that since $\tilde{S}$ is twist, the map $\sigma^{-p}\circ \tilde{S}^q$ is not the identity. Actually, it is known (see for example \cite{herman})) that if $\tilde{S}$ is twist, then the image of a vertical line under $\tilde{S}^q$ is a positive path, i.e. a curve such that the angle between the tangent vector and the vertical is always positive. This implies that $\tilde{S}^q$ cannot be a horizontal translation.\\ By hypothesis the set of fixed points of $\sigma^{-p}\circ \tilde{S}^q$ is not empty so that applying \cite[Chapter 4.9, Theorem 15]{ortega_book} we deduce that every stable fixed point is an isolated fixed point.\\ Hence, if there exists some non isolated fixed point, it must be unstable. Finally, suppose that we only have isolated fixed points that are all stable. From \cite[Chapter 4.5, Theorem 12]{ortega_book} they must all have index $1$. On the other hand, the Euler characteristic of the cylinder is null, and by the Poincar\'e-Hopf index formula we have a contradiction. Hence, there must exists at least one fixed point that is unstable. \end{proof} \begin{corollary} In the conditions of Theorem \ref{birk_orbits}, if $S$ is real analytic then there exists at least one unstable $(p,q)$-periodic orbit. \end{corollary} In the analytic case, the twist condition gives information on the structure of the set of $(p,q)$-periodic orbits. Actually the following result has been proved in \cite{maroTMNA,ortega_pb} \begin{theorem}\label{maro_teo} Consider a $C^1$-embedding $\tilde{S}:\Sigma\rightarrow\RR$ satisfying property \eqref{def_cyl} and suppose it is exact symplectic and twist. Fix a positive integer $p$ and assume that for every $x\in\RR$ there exists $y\in (a,b)$ such that \begin{equation}\label{maro_cond} \bar{x}(x,a)<x+p<\bar{x}(x,y). \end{equation} Then the map $\sigma^{-p}\circ\tilde{S}$ has at least two fixed points in $[0,1)\times (a,b)$. Moreover, if $\tilde{S}$ is real analytic then the set of fixed points is finite or the graph of a real analytic $1$-periodic function. In the first case the index of such fixed points is either $-1$, $0$, $1$ and at least one is unstable. In the second case, all the fixed points are unstable. \end{theorem} \begin{remark} Aubry-Mather theory gives a description, for fixed $p,q$ of those $(p,q)$-periodic orbits that are global minimizers. They can be ordered and if two of them are neighbouring, in the sense that there is no other minimal $(p,q)$-periodic orbit in the middle, then there are heteroclinic connections between them (\cite{bangert,katok_hass}). In this case, the $(p,q)$-periodic orbits are unstable. On the other hand, they can form an invariant curve. We stress that in the analytic case Theorem \ref{maro_teo} gives the description of the set of all $(p,q)$-periodic orbits, not only those that are action minimizing. \end{remark} \section{The bouncing ball map and its properties}\label{sec:tennis} Consider the motion of a bouncing ball on a vertically moving racket. We assume that the impacts do not affect the racket whose vertical position is described by a $1$-periodic $C^k$, $k\geq 2$, or real analytic function $f:\RR\rightarrow\RR$. Let us start getting the equations of motion, following \cite{maro5}. In an inertial frame, denote by $(\to,w)$ the time of impact and the corresponding velocity just after the bounce, and by $(\Pto,\bar w)$ the corresponding values at the subsequent bounce. From the free falling condition we have \begin{equation}\label{timeeq} f(t) + w(\Pto-\to) - \frac{g}{2}(\Pto -\to)^2 = f(\Pto) \,, \end{equation} where $g$ stands for the standard acceleration due to gravity. Noting that the velocity just before the impact at time $\Pto$ is $w-g(\Pto-\to)$, using the elastic impact condition and recalling that the racket is not affected by the ball, we obtain \begin{equation} \label{veleq} \bar{w}+w-g(\Pto-\to) = 2\dot{f}(\Pto)\,, \end{equation} where $\dot{}$ stands for the derivative with respect to time. From conditions (\ref{timeeq}-\ref{veleq}) we can define a bouncing motion given an initial condition $(t,w)$ in the following way. If $w\leq\df(t)$ then we set $\bar{t}=t$ and $\bar{w}=w$. If $w>\df(t)$, we claim that we can choose $\bar{t}$ to be the smallest solution $\bar{t}> t$ of \eqref{timeeq}. Bolzano theorem gives the existence of a solution of \eqref{timeeq} considering \[ F_t(\bar{t})=f(t)-f(\Pto) + w(\Pto-\to) - \frac{g}{2}(\Pto -\to)^2 \] and noting that $F_t(\bar{t})<0$ for $\Pto-\to$ large and $F_t(\bar{t})>0$ for $\Pto-\to\rightarrow 0^+$. Moreover, the infimum $\bar{t}$ of all these solutions is strictly larger than $t$ since if there exists a sequence $\bar{t}_n\rightarrow t$ satisfying \eqref{timeeq} then, \[ w - \frac{g}{2}(\Pto_n -\to) = (f(\Pto_n)- f(t)) /(\Pto_n-\to) \] that contradicts $w>\df(t)$ using the mean value theorem. For this value of $\bar{t}$, condition \eqref{veleq} gives the updated velocity $\bar{w}$. For $\Pto-\to>0$, we introduce the notation \[ f[\to,\Pto]=\frac{f(\Pto)-f(\to)}{\Pto-\to}, \] and write \begin{equation} \label{w1} \Pto = \to + \frac 2g w -\frac 2g f[\to,\Pto]\,, \end{equation} that also gives \begin{equation} \label{w2} \bar{w}= w -2f [\to,\Pto] + 2\dot{f}(\Pto). \end{equation} Now we change to the moving frame attached to the racket, where the velocity after the impact is expressed as $v=w-\dot{f}(t)$, and we get the equations \begin{equation}\label{eq:unb} \left\{ \begin{split} \Pto = {} & \to + \frac 2g \vo-\frac 2g f[\to,\Pto]+\frac 2g \df(\to)\textcolor{blue}{\,} \\ \Pvo = {} & \vo - 2f[\to,\Pto] + \df (\Pto)+\df(\to)\textcolor{blue}{\,.} \end{split} \right. \end{equation} By the periodicity of the function $f$, the coordinate $t$ can be seen as an angle. Hence, equations \eqref{eq:unb} define formally a map \[ \begin{array}{rcl} \tilde\Psi: \RR & \longrightarrow & \RR \\ (\to,\vo) & \longmapsto & (\Pto, \Pvo), \end{array} \] satisfying $\tilde\Psi\circ\sigma=\sigma\circ\tilde\Psi$ and the associated map of the cylinder $\Psi:\AA\rightarrow\AA$. This is the formulation considered by Kunze and Ortega \cite{kunzeortega2}. Another approach was considered by Pustylnikov in \cite{pust} and leads to a map that is equivalent to \eqref{eq:unb}, see \cite{maro3}. Noting that $w>\df(t)$ if and only if $v>0$, we can define a bouncing motion as before and denote it as a sequence $(t_n,v_n)_{n\in\ZZ^+}$ with $\ZZ^+=\{n\in\ZZ \::\: n\geq 0\}$ such that $(t_n,v_n)\in \TT\times [0,+\infty)$ for every $n\in\ZZ^+$. The maps $\Psi$ and its lift $\tilde{\Psi}$ are only defined formally. In the following lemma we state that they are well defined and have some regularity. Let us introduce the notation $\RR_{v_*}=\{v\in\RR \: :\: v>v_* \}$, $\AA_{v_*} = \TT\times \RR_{v_*}$ and $\RR^2_{v_*}=\RR\times\RR_{v_*}$. We will denote the $\sup$ norm by $\norm{\cdot}$ and recall that $f\in C^k(\TT), k\geq 2$ or real analytic. \begin{lemma} \label{well_def} There exists $v_*>4\norm{\df}$ such that the map $\Psi:\AA_{v_*}\rightarrow \AA$ is a $C^{k-1}$ embedding. If $f$ is real analytic, then $\Psi$ is a real analytic embedding. \end{lemma} \begin{proof} The proof is essentially given in \cite{maro5}. We give here a sketch. To prove that the map is well defined and $C^{k-1}$ we denote $v_{**}=4\norm{\df}$ and apply the implicit function theorem to the $C^{k-1}$ function $F :\{(\to,\vo,\Pto,\Pvo)\in \AA_{v_{**}} \times \RR^2 \: :\:\to\neq\Pto \} \rightarrow \RR^2$ given by \begin{equation*} F(\to,\vo,\Pto,\Pvo):= \left( \begin{split} & \Pto - \to - \frac 2g \vo + \frac 2g f[\to,\Pto]-\frac 2g \df (\to) \\ & \Pvo - \vo + 2f[\to,\Pto] - \df(\Pto)-\df(\to) \end{split} \right), \end{equation*} This gives the existence of a $C^{k-1}$ map $\Psi$ defined in $\AA_{v_{**}}$ such that $F(\to,\vo,\Psi(\to,\vo) )=0$. If $f$ is real analytic, we get that $\Psi$ is real analytic applying the analytic version of the implicit function theorem. \\ One can easily check that $\Psi$ is a local diffeomorphism since \[ \det \Dif_{\to,\vo} \Psi (t,v) =-\frac{\det (\Dif_{\to,\vo} F(\to,\vo,\Psi(\to,\vo) ))}{ \det (\Dif_{\Pto,\Pvo} F(\to,\vo,\Psi(\to,\vo) ))} \neq 0 \quad\mbox{on }\AA_{v_{**}}. \] To prove that $\Psi$ is a global embedding we need to prove that it is injective in $\AA_{v_*}$ for $v_*$ eventually larger than $v_{**}$. This can be done as in \cite{maro5}. \end{proof} \begin{remark} Note that we cannot guarantee that if $(\to_0,\vo_0) \in \AA_{v_*}$ then $\Psi(\to_0,\vo_0) \in \AA_{v_*}$. This is reasonable, since the ball can slow down decreasing its velocity at every bounce. However, a bouncing motion is defined for $v\geq 0$ \end{remark} \begin{remark} From the physical point of view, the condition $\Psi^n(\to_0,\vo_0)\in\AA_{v_*}$ for every $n$, implies that we can only hit the ball when it is falling. To prove it, suppose that $\to_0 =0$ and let us see what happens at the first iterate. The time at which the ball reaches its maximum height is $t^{max}=\frac{\vo_0}{g}$. On the other hand, the first impact time $\Pto$ satisfies, \[ \Pto \geq \frac{2}{g}\vo_0 - \frac{4}{g}\norm{\df}= t^{max}\left( 2-\frac{4}{\vo_0}\norm{\df} \right) > t^{max}, \] where the last inequality comes from $\vo_0\in\RR_{v_*}$ and $v_*>4\norm{\df}$. \end{remark} The map $\tilde\Psi$ is exact symplectic if we pass to the variables time-energy $(\to,\Eo)$ defined by \[ (\to,\Eo) = \left(\to,\frac{1}{2}\vo^2\right), \] obtaining the conjugated map \[ \Phi :\AA_{\Eo_*} \longrightarrow \AA, \qquad \Eo_*=\frac{1}{2}v_*^2 \] defined by \begin{equation}\label{eq:unbe} \left\{ \begin{split} \Pto = & \to + \frac 2g \sqrt{2\Eo}-\frac 2g f[\to,\Pto]+\frac 2g \df(\to) \\ \PEo = & \frac{1}{2}\left( \sqrt{2\Eo} - 2f[\to,\Pto] + \df (\Pto)+\df(\to) \right)^2, \end{split} \right. \end{equation} that by Lemma \ref{well_def} is a $C^{k-1}$-embedding or real analytic if $f$ is real analytic. More precisely, we have the following \begin{lemma} \label{lemma:exact} The map $\Phi$ is exact symplectic and twist in $\AA_{e_*}$. Moreover, $\Phi$ preserves and twists infinitely the upper end. \end{lemma} The map $\Phi$ is not defined in the whole cylinder. However, it is possible to extend to the whole cylinder preserving its properties. More precisely: \begin{lemma} \label{extension} There exists a $C^{k-2}$ exact symplectic and twist diffeomorphism $\bar{\Phi}:\AA\rightarrow\AA$ such that $\bar{\Phi} \equiv \Phi$ on $\AA_{e_*}$ and $\bar{\Phi}\equiv\Phi_0$ on $\AA\setminus\AA_{\frac{e_*}{2}}$ where $\Phi_0$ is the integrable twist map $\Phi_0(t,e)=(t+e,e)$. Moreover, $\bar{\Phi}$ preserves the ends of the cylinder and twists them infinitely. If $f$ is real analytic, then the extension $\bar{\Phi}$ is $C^\infty$. \end{lemma} Due to Lemma \ref{well_def} and the fact that the maps $\Phi$ and $\Psi$ are conjugated we can consider the lift $\tilde{\Phi}:\RR^2_{e_*}\rightarrow\RR^2$ and give the following \begin{definition} A complete bouncing motion $(t_n,e_n)_{n\in\ZZ}$ is a complete orbit of the map $\tilde{\Phi}$. \end{definition} In the following section we will study the existence and properties of periodic complete bouncing motions as orbits of the map $\tilde{\Phi}$ defined in \eqref{eq:unbe}. \section{Periodic bouncing motions}\label{sec:per} The existence of periodic complete bouncing motions follows from an application of Aubry-Mather theory. In this section we prove it and in the analytic case we give some results on the structure of such motions and their stability. We start saying that a complete bouncing motion is $(q,p)$-periodic if in time $p$ the ball makes $q$ bouncing before repeating the motion, more precisely: \begin{definition} Given two coprime integers $q,p\in\ZZ^+$, a complete bouncing motion $(t_n,e_n)_{n\in\ZZ}$ is $(q,p)$-periodic if the corresponding orbit of $\tilde{\Phi}$ is $(p,q)$-periodic. Moreover, we say that it is stable if the corresponding orbit is stable. \end{definition} The existence of two $(q,p)$-periodic complete bouncing motions comes from an application of Theorem \ref{birk_orbits}. \begin{theorem}\label{pre_bouncing} For every $f\in C^3$ there exists $\alpha>0$ such that for every positive coprime $p,q$ satisfying $p/q>\alpha$ there exist two different $(q,p)$-periodic complete bouncing motions. Moreover, if $f$ is real analytic, then at least one of the $(q,p)$-periodic complete bouncing motion is unstable. \end{theorem} \begin{proof} By Lemma \ref{lemma:exact}, the map $\Phi$ defined in \eqref{eq:unbe} is a $C^2$ exact symplectic twist embedding in $\AA_{e_*}$ for some large $e_*$ depending on $\norm{\df}$. Moreover $\Phi$ preserves and twists infinitely the upper end. Its extension $\bar{\Phi}$ coming from Lemma \ref{extension} satisfies the hypothesis of Theorem \ref{birk_orbits} and admits for every coprime $p,q$ two Birkhoff $(q,p)$-periodic orbit. Consider the Birkhoff $(q,p)$-periodic orbits for $p,q$ positive and $p/q$ large enough such that \begin{equation}\label{choice_pq} \frac{p}{q}-1-\frac{4}{g}\norm\df>\frac{2}{g}\sqrt{2e_*}. \end{equation} Since Birkhoff periodic orbits are cyclically ordered, from \cite[lemma 9.1]{gole} we have that they satisfy the estimate $t_{n+1}-t_n>p/q - 1$. On the other hand, from \eqref{eq:unbe}, \[ t_{n+1}-t_n\leq\frac{2}{g}\sqrt{2e_n}+\frac{4}{g}\norm\df \] so that it must be \[ \frac{2}{g}\sqrt{2e_n}+\frac{4}{g}\norm\df>\frac{p}{q}-1. \] By the choice of $p/q$ in \eqref{choice_pq} we have that $e_n>e_*$ for every $n\in\ZZ$ so that these Birkhoff periodic orbits are all contained in $\AA_{e_*}$ and so they are orbits of the original map $\Phi$. If $f$ is real analytic the result on the instability follows from Proposition \ref{unstable}. \end{proof} Theorem \ref{pre_bouncing} gives the existence of $(p,q)$-periodic bouncing motions but does not give information on the topological structure of the set of $(p,q)$-periodic bouncing motions for fixed values of $(p,q)$. This is a complicated issue and some results comes from Aubry-Mather theory. However, here we will see which results can be obtained using Theorem \ref{maro_teo}. To state this result we give the following \begin{definition} We say that the set of $(p,q)$-periodic complete bouncing motions is (analytically) degenerate if there exists a real analytic curve $(t(s),e(s))$ such that $(t(s+1),e(s+1))=(t(s)+1,e(s))$ for every $s\in\RR$, the function $t(s)$ is bijective for $s\in[0,1)$ and $(t_n,e_n)_{n\in\ZZ}$ is a $(p,q)$-periodic complete bouncing motion if and only if there exist $n_0,s_0$ such that $(t_{n_0},e_{n_0})=(t(s_0),e(s_0))$. \end{definition} The following result is a quite direct consequence of Lemma \ref{lemma:exact}. \begin{proposition} If $f$ is real analytic, then there exists $\alpha>0$ such that for every $p>\alpha$ the set of $(p,1)$-periodic complete bouncing motions is either finite or degenerate. In the first case at least one $(p,1)$-periodic complete bouncing motion is unstable. In the degenerate case, all $(p,1)$-periodic complete bouncing motion are unstable. \end{proposition} \begin{proof} By Lemma \ref{lemma:exact} the map $\tilde{\Phi}$ is exact symplectic and twist on $\RR^2_{e_*}$. Moreover, let us choose $a$ such that $e_*<\sqrt{2a}$ and $p$ such that \[ \frac{gp}{2}-2\norm{\dot{f}}>\sqrt{2a}. \] Let us start with the following estimates for the lift $\tilde{\Phi}$ that can be easily proved by induction on $n$ from \eqref{eq:unbe}: \begin{equation}\label{stim_t_e} |\sqrt{2e_n}-\sqrt{2e}|\leq 4n\norm{\dot{f}}, \qquad \left|t_n-t-\frac{2}{g}n\sqrt{2e}\right|\leq 4n^2\frac{\norm{\dot{f}}}{g}. \end{equation} These give \[ \bar{t}(t,a)-t\leq \frac{2}{g}\sqrt{2a}+4\frac{\norm{\dot{f}}}{g}<p. \] On the other hand, Lemma \ref{lemma:exact} also gives that $\tilde{\Phi}$ twists the upper end infinitely, i.e. $\lim_{e\rightarrow +\infty}\bar{t}(t,e)-t=+\infty$ uniformly in $t$. Hence, condition \eqref{maro_cond} is satisfied in the strip $\Sigma=[a,+\infty)$ for every $p$. The conclusion comes from the application of Theorem \ref{maro_teo} and the fact that $(p,1)$-periodic complete bouncing motions corresponds to the fixed points of the map $\sigma^{-p}\circ\tilde{\Phi}$. \end{proof} This result is not trivially extended to $(p,q)$-periodic motions for $q\geq 1$ since $\Phi^q$ need to be exact symplectic and twist. The twist condition is in general not preserved by composition, while the exactness is, as shown in the following result, inspired by \cite{bosc_ort} \begin{lemma}\label{lemma_isot_exact} For every $q>0$ there exists $e_\#\geq e_*$ such that for every $p>0$ the map $\sigma^{-p}\circ\tilde{\Phi}^q:\RR^2_{e_\#}\rightarrow\RR^2$ is exact symplectic \end{lemma} \begin{proof} Since the map $\tilde{\Phi}$ is defined in $\RR^2_{e_*}$, the image $\tilde{\Phi}(\RR^2_{e_*})$ could not be contained in $\RR^2_{e_*}$ so that the iterate could not be defined. From \eqref{eq:unb} we have that $|\bar{v}-v|\leq 4\norm{\dot{f}}$ from which, the map $\tilde{\Psi}^q$ is well defined in $\RR^2_{v_\#}$ with $v_\#=v_* + 4 q \norm{\dot{f}}$. Hence passing to the variables $(t,e)$, the map $\tilde{\Phi}^q$ is defined in $\RR^2_{e_\#}$ with $e_\#=\frac{1}{2}v_\#^2$. Since $\Phi$ is exact symplectic, there exists $V:\RR^2_{e_\#}\rightarrow\RR$ such that, defining $\lambda=e dt$ we have $\tilde{\Phi}^*\lambda-\lambda=dV$. Hence, denoting $V_1=V+V\circ\tilde{\Phi}+\dots+V\circ\tilde{\Phi}^{q-1}$ it holds that $V_1\circ\sigma=V_1$ on $\RR^2_{e_\#}$ and \begin{align*} dV_1 &= dV+\tilde{\Phi}^*dV+\dots+(\tilde{\Phi}^{q-1})^*dV \\ & = \tilde{\Phi}^*\lambda-\lambda + (\tilde{\Phi}^2)^*\lambda-\tilde{\Phi}^*\lambda +\dots+(\tilde{\Phi}^q)^*\lambda-(\tilde{\Phi}^{q-1})^*\lambda \\ &= (\tilde{\Phi}^q)^*\lambda-\lambda \end{align*} from which $\tilde{\Phi}$ is exact symplectic. Finally, we conclude noting that by the definition of $\sigma^{-p}$, $(\sigma^{-p}\circ\tilde{\Phi}^q)^*\lambda = (\tilde{\Phi}^q)^*\lambda$. \end{proof} Concerning the twist condition the following technical result holds. \begin{lemma}\label{twist_q} Let $f$ be $C^2$. For every $q\geq 1$ there exist $\epsilon_q>0$, $e^q>e_\#$, such that if $\norm{\ddf}<\epsilon_q$ then \[ \frac{\partial t_q}{\partial e}=\frac{2q}{g\sqrt{2e}}(1+\tilde{f}_q(t,e)) \] where $|\tilde{f}_q(t,e)|< 1/2$ on $\RR^2_{e^q}$. \end{lemma} \begin{proof} To simplify the computation, let us perform the change of variables $y=\sqrt{2e}+\df(t)$ so that \eqref{eq:unbe} becomes \begin{equation}\label{eq:unby} \left\{ \begin{split} \Pto = & \to + \frac 2g y-\frac 2g f[\to,\Pto] \\ \bar{y} = & y - 2f[\to,\Pto] + 2\df (\Pto). \end{split} \right. \end{equation} Since $\partial t_q/\partial e=(\partial t_q/\partial y) (\partial y/\partial e)$ it is enough to prove that for every $q\geq 1$ there exist $\epsilon_q>0$ and $y^q$ large, such that if $\norm{\ddf}<\epsilon_q$ then \begin{equation}\label{new_th} \frac{\partial t_q}{\partial y}=\frac{2q}{g}(1+\tilde{f}_q(t,y)) \end{equation} where $|\tilde{f}_q(t,y)|< 1/2$ on $\RR^2_{y^q}$. Let us start with some estimates that hold for every $q\geq 1$. It comes from \eqref{eq:unby} that \begin{equation}\label{y_q} y_q=y+2\sum_{i=1}^{q}\df(t_i)+2\sum_{i=1}^{q}f[t_{i-1},t_{i}] \end{equation} so that \[ |y_q-y|\leq 4q\norm\df. \] Using it, \begin{equation}\label{t_q} |t_q-t_{q-1}|\geq \frac{2}{g}y-\frac{2}{g}(4q+1)\norm\df, \end{equation} from which there exists $y^q$ large enough and $C_q$ such that \begin{equation}\label{fqq-11} \left|\partial_{t_q}f[t_{q-1},t_q]\right|=\left|\frac{\dot{f}(t_q)-f[t_{q-1},t_q]}{t_q-t_{q-1}}\right|\leq \frac{g\norm{\dot{f}}}{y-(4q+2)\norm{\dot{f}}}<\frac{C_q}{y} \qquad \mbox{on } \RR^2_{y^q} \end{equation} and analogously \begin{equation}\label{fqq-12} \left|\partial_{t_{q-1}}f[t_{q-1},t_q]\right|<\frac{C_{q-1}}{y} \qquad \mbox{on } \RR^2_{y^{q-1}} \end{equation} Now we can start the proof by induction on $q\geq 1$. For $q=1$ we have, differentiating the first equation in \eqref{eq:unby} \begin{equation}\label{t_1_y} \frac{\partial t_1}{\partial y}\left(1+\frac{2}{g}\partial_{t_{1}}f[t,t_1]\right)=\frac{2}{g}y \end{equation} from which, using \eqref{fqq-11} we get the initial step taking a suitably larger value of $y^1$.\\ For the inductive step, let us suppose \eqref{new_th} to be true for $i=1,\dots,q-1$. By implicit differentiation \begin{equation}\label{t_q_e} \frac{\partial t_q}{\partial y}\left(1+\frac{2}{g}\partial_{t_{q}}f[t_{q-1},t_q]\right)=\frac{2}{g}\frac{\partial y_{q-1}}{\partial y}+\frac{\partial t_{q-1}}{\partial y}\left(1-\frac{2}{g}\partial_{t_{q-1}}f[t_{q-1},t_q]\right) \end{equation} From \eqref{y_q} and the inductive hypothesis we have \begin{align*} \frac{\partial y_{q-1}}{\partial y}&=1+2\sum_{i=1}^{q-1}\left(\ddf(t_i) \frac{\partial t_i}{\partial y}-\partial_{t_{i}}f[t_{i-1},t_{i}]\frac{\partial t_i}{\partial y} -\partial_{t_{i-1}}f[t_{i-1},t_{i}]\frac{\partial t_{i-1}}{\partial y}\right)\\ &=1+2\sum_{i=1}^{q-1}\left(\ddf(t_i) (1+\tilde{f}_i)-\partial_{t_{i}}f[t_{i-1},t_{i}](1+\tilde{f}_i) -\partial_{t_{i-1}}f[t_{i-1},t_{i}](1+\tilde{f}_{i-1})\right). \end{align*} Since by (\ref{fqq-11}-\ref{fqq-12}) for every $i$ $|\partial_{t_{i}}f[t_{i-1},t_{i}]|$ tends to zero uniformly as $y \rightarrow +\infty$ and $|\tilde{f}_i|<1/2$ for $y$ large, we can find new constants $C_{q-1}$ and $y^{q-1}$ such that on $\RR^2_{y^{q-1}}$, \begin{equation}\label{stim_y} \frac{\partial y_{q-1}}{\partial y} = 1 + \bar{f}_{q-1}(t,y) \qquad \mbox{with } |\bar{f}_{q-1}|\leq C_{q-1}\norm\ddf. \end{equation} Using it and the inductive hypothesis in \eqref{t_q_e} we get \begin{align}\label{final} \frac{\partial t_q}{\partial y}\left(1+\frac{2}{g}\partial_{t_{q}}f[t_{q-1},t_q]\right)&=\frac{2}{g}(1 + \bar{f}_{q-1}(t,y))+\frac{2(q-1)}{g}(1+\tilde{f}_{q-1}(t,y))\left(1-\frac{2}{g}\partial_{t_{q-1}}f[t_{q-1},t_q]\right)\\ &=\frac{2q}{g}\left(1+ \tilde{f}_q(t,y)\right) \end{align} where, \[ \tilde{f}_q(t,y)=\frac{1}{q}\bar{f}_{q-1}(t,y)+\frac{q-1}{q}\tilde{f}_{q-1}(t,y)+\frac{2(q-1)}{gq}\partial_{t_{q-1}}f[t_{q-1},t_q](1+\tilde{f}_{q-1}(t,y)). \] Now (\ref{fqq-11}-\ref{fqq-12}) and \eqref{stim_y} imply \[ |\tilde{f}_q|<\frac{C_{q-1}}{q}\norm\ddf+\frac{q-1}{2q}+\frac{C'_{q-1}}{y} \] so that we can find $\epsilon_q$ and $y_q$ such that if $\norm\ddf<\epsilon_q$ then $|\tilde{f}_q|<\frac{1}{2}-\frac{1}{2q}$ on $\RR^2_{y^{q}}$. Plugging it into \eqref{final} and using again (\ref{fqq-11}-\ref{fqq-12}) we get the thesis, eventually increasing $y^q$. \end{proof} This is used to prove the following result \begin{proposition} Suppose that $f$ is real analytic. For every $q>0$ there exist $\alpha>0$ and $\epsilon_q>0$ such that if $p>\alpha$ and $\norm{\ddf}<\epsilon_q$ then the set of $(p,q)$-periodic complete bouncing motion is either finite or degenerate. In the first case at least one $(p,q)$-periodic complete bouncing motion is unstable. In the degenerate case, all $(p,q)$-periodic complete bouncing motion are unstable. \end{proposition} \begin{proof} We would like to apply Theorem \ref{maro_teo} to the map $\tilde{\Phi}^q$, noting that $(p,q)$-periodic bouncing motions correspond to fixed points of the map $\sigma^{-p}\circ\tilde{\Phi}^q$. Let us fix $q>0$. In Lemma \ref{lemma_isot_exact} we proved that $\tilde{\Phi}^q$ is exact symplectic in $\RR^2_{e_\#}$ for some $e_\#$ depending on $q$. Moreover, by Lemma \ref{twist_q}, there exist $\epsilon_q$ and $e^q>e_\#$ such that if $\norm{\ddf}<\epsilon_q$ then $\tilde{\Phi}^q$ is also twist on $\RR^2_{e^q}$. Now choose $p>0$ such that \[ \frac{gp}{2q}-2q\norm{\dot{f}}>e^q. \] Hence, there exist $b>a$ such that \[ e^q<\sqrt{2a}<\frac{gp}{2q}-2q\norm{\dot{f}}<\frac{gp}{2q}+2q\norm{\dot{f}}<\sqrt{2b}. \] This choice for $a,b$ gives condition \eqref{maro_cond} on the strip $\Sigma=\RR\times (a,b)$. Actually, from \eqref{stim_t_e}, \begin{align*} t_q(t,b)-t & \geq\frac{2}{g}q\sqrt{2b}-4q^2\frac{\norm{\dot{f}}}{g}>p \\ t_q(t,a)-t & \leq\frac{2}{g}q\sqrt{2a}+4q^2\frac{\norm{\dot{f}}}{g}<p. \end{align*} This concludes the proof. \end{proof}

Q: How can I correct my war application (Tomcat 8)? I made a Web Java Application, on JDK 1.8, with the next libraries: - Hibernate 4.3.x - bootstrap 1.0.10 - commons codec 1.10 - commons logging 1.2 - poi 3.12-20150511 - poi ooxml 3.12-20150511 - poi ooxml-schemas 3.12-20150511 - xmlbeans 2.6.0 - gson 2.3.1 - bson4jackson 2.7.0 - jackson annotations 2.7.3 - jackson core 2.7.3 - jackson databind 2.7.3 - jongo 1.3.0 - mongo java driver 3.2.2 - postgresql 9.4.1208jre6 - primefaces 6.0 - commons fileupload 1.3.1 - commons io 2.4 I developed my application on Netbeans 8.0 and finally I generated a war file. After I downloaded and installed Tomcat 8 in my computer (with Windows 8.1 to 64 bits) to 32 bits, and when I mount my war file on Tomcat, and I accessed to http://localhost:8080/MyApplication the page respond with HTTP STATUS 404 message. As I don't know what is the file with the specific exception, I show all the files of the log folder: catalina.2017-03-20.log 20-Mar-2017 19:31:57.589 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Server version: Apache Tomcat/8.5.12 20-Mar-2017 19:31:57.616 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Server built: Mar 8 2017 17:41:47 UTC 20-Mar-2017 19:31:57.637 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Server number: 8.5.12.0 20-Mar-2017 19:31:57.660 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log OS Name: Windows 8.1 20-Mar-2017 19:31:57.661 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log OS Version: 6.3 20-Mar-2017 19:31:57.662 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Architecture: x86 20-Mar-2017 19:31:57.662 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Java Home: C:\Program Files (x86)\Java\jre1.8.0_101 20-Mar-2017 19:31:57.663 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log JVM Version: 1.8.0_101-b13 20-Mar-2017 19:31:57.663 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log JVM Vendor: Oracle Corporation 20-Mar-2017 19:31:57.663 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log CATALINA_BASE: C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5 20-Mar-2017 19:31:57.664 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log CATALINA_HOME: C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5 20-Mar-2017 19:31:57.665 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Command line argument: -Dcatalina.home=C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5 20-Mar-2017 19:31:57.665 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Command line argument: -Dcatalina.base=C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5 20-Mar-2017 19:31:57.666 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Command line argument: -Djava.io.tmpdir=C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\temp 20-Mar-2017 19:31:57.666 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Command line argument: -Djava.util.logging.manager=org.apache.juli.ClassLoaderLogManager 20-Mar-2017 19:31:57.666 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Command line argument: -Djava.util.logging.config.file=C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\conf\logging.properties 20-Mar-2017 19:31:57.667 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Command line argument: exit 20-Mar-2017 19:31:57.667 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Command line argument: -Xms128m 20-Mar-2017 19:31:57.667 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Command line argument: -Xmx256m 20-Mar-2017 19:31:57.667 INFORMACIÓN [main] org.apache.catalina.core.AprLifecycleListener.lifecycleEvent La biblioteca nativa de Apache Tomcat basada en ARP que permite un rendimiento óptimo en entornos de desarrollo no ha sido hallada en java.library.path: C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\bin;C:\WINDOWS\Sun\Java\bin;C:\WINDOWS\system32;C:\WINDOWS;C:\ProgramData\Oracle\Java\javapath;C:\Program Files (x86)\Intel\TXE Components\TCS\;C:\Program Files\Intel\TXE Components\TCS\;C:\WINDOWS\system32;C:\WINDOWS;C:\WINDOWS\System32\Wbem;C:\WINDOWS\System32\WindowsPowerShell\v1.0\;C:\Program Files\nodejs\;C:\Program Files\MongoDB\Server\3.2\bin;C:\Program Files\PostgreSQL\9.3\bin;C:\tas-8.3-1\multiserver\enhydra\bin; C:\Program Files\PostgreSQL\9.3\bin;C:\Python27;C:\Python27\Scripts;C:\Program Files (x86)\Skype\Phone\;;. 20-Mar-2017 19:31:58.005 INFORMACIÓN [main] org.apache.coyote.AbstractProtocol.init Initializing ProtocolHandler ["http-nio-8081"] 20-Mar-2017 19:31:58.593 INFORMACIÓN [main] org.apache.tomcat.util.net.NioSelectorPool.getSharedSelector Using a shared selector for servlet write/read 20-Mar-2017 19:31:58.599 INFORMACIÓN [main] org.apache.coyote.AbstractProtocol.init Initializing ProtocolHandler ["ajp-nio-8009"] 20-Mar-2017 19:31:58.605 INFORMACIÓN [main] org.apache.tomcat.util.net.NioSelectorPool.getSharedSelector Using a shared selector for servlet write/read 20-Mar-2017 19:31:58.606 INFORMACIÓN [main] org.apache.catalina.startup.Catalina.load Initialization processed in 2024 ms 20-Mar-2017 19:31:58.680 INFORMACIÓN [main] org.apache.catalina.core.StandardService.startInternal Arrancando servicio Catalina 20-Mar-2017 19:31:58.680 INFORMACIÓN [main] org.apache.catalina.core.StandardEngine.startInternal Starting Servlet Engine: Apache Tomcat/8.5.12 20-Mar-2017 19:31:58.761 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployWAR Despliegue del archivo C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\MyApplication.war de la aplicación web 20-Mar-2017 19:32:15.612 GRAVE [localhost-startStop-1] org.apache.catalina.core.ContainerBase.addChildInternal ContainerBase.addChild: start: org.apache.catalina.LifecycleException: Failed to start component [StandardEngine[Catalina].StandardHost[localhost].StandardContext[/MyApplication]] at org.apache.catalina.util.LifecycleBase.start(LifecycleBase.java:167) at org.apache.catalina.core.ContainerBase.addChildInternal(ContainerBase.java:752) at org.apache.catalina.core.ContainerBase.addChild(ContainerBase.java:728) at org.apache.catalina.core.StandardHost.addChild(StandardHost.java:734) at org.apache.catalina.startup.HostConfig.deployWAR(HostConfig.java:952) at org.apache.catalina.startup.HostConfig$DeployWar.run(HostConfig.java:1823) at java.util.concurrent.Executors$RunnableAdapter.call(Unknown Source) at java.util.concurrent.FutureTask.run(Unknown Source) at java.util.concurrent.ThreadPoolExecutor.runWorker(Unknown Source) at java.util.concurrent.ThreadPoolExecutor$Worker.run(Unknown Source) at java.lang.Thread.run(Unknown Source) Caused by: java.lang.IllegalArgumentException: El mapeo de filtro especifica un nombre desconocido de filtro PrimeFaces FileUpload Filter at org.apache.catalina.core.StandardContext.validateFilterMap(StandardContext.java:2987) at org.apache.catalina.core.StandardContext.addFilterMap(StandardContext.java:2950) at org.apache.catalina.startup.ContextConfig.configureContext(ContextConfig.java:1275) at org.apache.catalina.startup.ContextConfig.webConfig(ContextConfig.java:1190) at org.apache.catalina.startup.ContextConfig.configureStart(ContextConfig.java:775) at org.apache.catalina.startup.ContextConfig.lifecycleEvent(ContextConfig.java:299) at org.apache.catalina.util.LifecycleBase.fireLifecycleEvent(LifecycleBase.java:94) at org.apache.catalina.core.StandardContext.startInternal(StandardContext.java:5114) at org.apache.catalina.util.LifecycleBase.start(LifecycleBase.java:150) ... 10 more 20-Mar-2017 19:32:15.615 GRAVE [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployWAR Error durante el despliegue del archivo C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\MyApplication.war de la aplicación web java.lang.IllegalStateException: ContainerBase.addChild: start: org.apache.catalina.LifecycleException: Failed to start component [StandardEngine[Catalina].StandardHost[localhost].StandardContext[/MyApplication]] at org.apache.catalina.core.ContainerBase.addChildInternal(ContainerBase.java:756) at org.apache.catalina.core.ContainerBase.addChild(ContainerBase.java:728) at org.apache.catalina.core.StandardHost.addChild(StandardHost.java:734) at org.apache.catalina.startup.HostConfig.deployWAR(HostConfig.java:952) at org.apache.catalina.startup.HostConfig$DeployWar.run(HostConfig.java:1823) at java.util.concurrent.Executors$RunnableAdapter.call(Unknown Source) at java.util.concurrent.FutureTask.run(Unknown Source) at java.util.concurrent.ThreadPoolExecutor.runWorker(Unknown Source) at java.util.concurrent.ThreadPoolExecutor$Worker.run(Unknown Source) at java.lang.Thread.run(Unknown Source) 20-Mar-2017 19:32:15.621 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployWAR Deployment of web application archive C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\MyApplication.war has finished in 16.856 ms 20-Mar-2017 19:32:15.625 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployDirectory Despliegue del directorio C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\docs de la aplicación web 20-Mar-2017 19:32:15.899 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployDirectory Deployment of web application directory C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\docs has finished in 274 ms 20-Mar-2017 19:32:15.900 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployDirectory Despliegue del directorio C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\examples de la aplicación web 20-Mar-2017 19:32:16.762 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployDirectory Deployment of web application directory C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\examples has finished in 862 ms 20-Mar-2017 19:32:16.762 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployDirectory Despliegue del directorio C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\host-manager de la aplicación web 20-Mar-2017 19:32:16.833 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployDirectory Deployment of web application directory C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\host-manager has finished in 71 ms 20-Mar-2017 19:32:16.834 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployDirectory Despliegue del directorio C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\manager de la aplicación web 20-Mar-2017 19:32:16.954 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployDirectory Deployment of web application directory C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\manager has finished in 120 ms 20-Mar-2017 19:32:16.955 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployDirectory Despliegue del directorio C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\ROOT de la aplicación web 20-Mar-2017 19:32:16.999 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployDirectory Deployment of web application directory C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\ROOT has finished in 44 ms 20-Mar-2017 19:32:17.008 INFORMACIÓN [main] org.apache.coyote.AbstractProtocol.start Starting ProtocolHandler [http-nio-8081] 20-Mar-2017 19:32:17.047 INFORMACIÓN [main] org.apache.coyote.AbstractProtocol.start Starting ProtocolHandler [ajp-nio-8009] 20-Mar-2017 19:32:17.054 INFORMACIÓN [main] org.apache.catalina.startup.Catalina.start Server startup in 18447 ms commons-daemon.2017-03-20.log [2017-03-20 19:31:55] [info] [ 1908] Commons Daemon procrun (1.0.15.0 32-bit) started [2017-03-20 19:31:55] [info] [ 1908] Running 'Tomcat8' Service... [2017-03-20 19:31:55] [info] [ 4584] Starting service... [2017-03-20 19:31:57] [info] [ 4584] Service started in 1292 ms. host-manager.2017-03-20.log [is empty] localhost.2017-03-20.log 20-Mar-2017 19:32:16.740 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.core.ApplicationContext.log ContextListener: contextInitialized() 20-Mar-2017 19:32:16.741 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.core.ApplicationContext.log SessionListener: contextInitialized() localhost_access_log.2017-03-20.txt 0:0:0:0:0:0:0:1 - - [20/Mar/2017:19:32:27 -0500] "GET /MyApplication/ HTTP/1.1" 404 994 0:0:0:0:0:0:0:1 - - [20/Mar/2017:19:32:29 -0500] "GET /MyApplication/ HTTP/1.1" 404 994 0:0:0:0:0:0:0:1 - - [20/Mar/2017:19:32:29 -0500] "GET /favicon.ico HTTP/1.1" 200 21630 0:0:0:0:0:0:0:1 - - [20/Mar/2017:19:32:30 -0500] "GET /MyApplication/ HTTP/1.1" 404 994 0:0:0:0:0:0:0:1 - - [20/Mar/2017:19:32:30 -0500] "GET /favicon.ico HTTP/1.1" 200 21630 manager.2017-03-20.log [Is empty] tomcat8-stderr.2017-03-20.log 2017-03-20 19:31:55 Commons Daemon procrun stderr initialized 20-Mar-2017 19:31:57.589 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Server version: Apache Tomcat/8.5.12 20-Mar-2017 19:31:57.616 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Server built: Mar 8 2017 17:41:47 UTC 20-Mar-2017 19:31:57.637 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Server number: 8.5.12.0 20-Mar-2017 19:31:57.660 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log OS Name: Windows 8.1 20-Mar-2017 19:31:57.661 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log OS Version: 6.3 20-Mar-2017 19:31:57.662 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Architecture: x86 20-Mar-2017 19:31:57.662 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Java Home: C:\Program Files (x86)\Java\jre1.8.0_101 20-Mar-2017 19:31:57.663 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log JVM Version: 1.8.0_101-b13 20-Mar-2017 19:31:57.663 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log JVM Vendor: Oracle Corporation 20-Mar-2017 19:31:57.663 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log CATALINA_BASE: C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5 20-Mar-2017 19:31:57.664 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log CATALINA_HOME: C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5 20-Mar-2017 19:31:57.665 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Command line argument: -Dcatalina.home=C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5 20-Mar-2017 19:31:57.665 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Command line argument: -Dcatalina.base=C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5 20-Mar-2017 19:31:57.666 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Command line argument: -Djava.io.tmpdir=C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\temp 20-Mar-2017 19:31:57.666 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Command line argument: -Djava.util.logging.manager=org.apache.juli.ClassLoaderLogManager 20-Mar-2017 19:31:57.666 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Command line argument: -Djava.util.logging.config.file=C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\conf\logging.properties 20-Mar-2017 19:31:57.667 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Command line argument: exit 20-Mar-2017 19:31:57.667 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Command line argument: -Xms128m 20-Mar-2017 19:31:57.667 INFORMACIÓN [main] org.apache.catalina.startup.VersionLoggerListener.log Command line argument: -Xmx256m 20-Mar-2017 19:31:57.667 INFORMACIÓN [main] org.apache.catalina.core.AprLifecycleListener.lifecycleEvent La biblioteca nativa de Apache Tomcat basada en ARP que permite un rendimiento óptimo en entornos de desarrollo no ha sido hallada en java.library.path: C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\bin;C:\WINDOWS\Sun\Java\bin;C:\WINDOWS\system32;C:\WINDOWS;C:\ProgramData\Oracle\Java\javapath;C:\Program Files (x86)\Intel\TXE Components\TCS\;C:\Program Files\Intel\TXE Components\TCS\;C:\WINDOWS\system32;C:\WINDOWS;C:\WINDOWS\System32\Wbem;C:\WINDOWS\System32\WindowsPowerShell\v1.0\;C:\Program Files\nodejs\;C:\Program Files\MongoDB\Server\3.2\bin;C:\Program Files\PostgreSQL\9.3\bin;C:\tas-8.3-1\multiserver\enhydra\bin; C:\Program Files\PostgreSQL\9.3\bin;C:\Python27;C:\Python27\Scripts;C:\Program Files (x86)\Skype\Phone\;;. 20-Mar-2017 19:31:58.005 INFORMACIÓN [main] org.apache.coyote.AbstractProtocol.init Initializing ProtocolHandler ["http-nio-8081"] 20-Mar-2017 19:31:58.593 INFORMACIÓN [main] org.apache.tomcat.util.net.NioSelectorPool.getSharedSelector Using a shared selector for servlet write/read 20-Mar-2017 19:31:58.599 INFORMACIÓN [main] org.apache.coyote.AbstractProtocol.init Initializing ProtocolHandler ["ajp-nio-8009"] 20-Mar-2017 19:31:58.605 INFORMACIÓN [main] org.apache.tomcat.util.net.NioSelectorPool.getSharedSelector Using a shared selector for servlet write/read 20-Mar-2017 19:31:58.606 INFORMACIÓN [main] org.apache.catalina.startup.Catalina.load Initialization processed in 2024 ms 20-Mar-2017 19:31:58.680 INFORMACIÓN [main] org.apache.catalina.core.StandardService.startInternal Arrancando servicio Catalina 20-Mar-2017 19:31:58.680 INFORMACIÓN [main] org.apache.catalina.core.StandardEngine.startInternal Starting Servlet Engine: Apache Tomcat/8.5.12 20-Mar-2017 19:31:58.761 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployWAR Despliegue del archivo C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\MyApplication.war de la aplicación web 20-Mar-2017 19:32:15.612 GRAVE [localhost-startStop-1] org.apache.catalina.core.ContainerBase.addChildInternal ContainerBase.addChild: start: org.apache.catalina.LifecycleException: Failed to start component [StandardEngine[Catalina].StandardHost[localhost].StandardContext[/MyApplication]] at org.apache.catalina.util.LifecycleBase.start(LifecycleBase.java:167) at org.apache.catalina.core.ContainerBase.addChildInternal(ContainerBase.java:752) at org.apache.catalina.core.ContainerBase.addChild(ContainerBase.java:728) at org.apache.catalina.core.StandardHost.addChild(StandardHost.java:734) at org.apache.catalina.startup.HostConfig.deployWAR(HostConfig.java:952) at org.apache.catalina.startup.HostConfig$DeployWar.run(HostConfig.java:1823) at java.util.concurrent.Executors$RunnableAdapter.call(Unknown Source) at java.util.concurrent.FutureTask.run(Unknown Source) at java.util.concurrent.ThreadPoolExecutor.runWorker(Unknown Source) at java.util.concurrent.ThreadPoolExecutor$Worker.run(Unknown Source) at java.lang.Thread.run(Unknown Source) Caused by: java.lang.IllegalArgumentException: El mapeo de filtro especifica un nombre desconocido de filtro PrimeFaces FileUpload Filter at org.apache.catalina.core.StandardContext.validateFilterMap(StandardContext.java:2987) at org.apache.catalina.core.StandardContext.addFilterMap(StandardContext.java:2950) at org.apache.catalina.startup.ContextConfig.configureContext(ContextConfig.java:1275) at org.apache.catalina.startup.ContextConfig.webConfig(ContextConfig.java:1190) at org.apache.catalina.startup.ContextConfig.configureStart(ContextConfig.java:775) at org.apache.catalina.startup.ContextConfig.lifecycleEvent(ContextConfig.java:299) at org.apache.catalina.util.LifecycleBase.fireLifecycleEvent(LifecycleBase.java:94) at org.apache.catalina.core.StandardContext.startInternal(StandardContext.java:5114) at org.apache.catalina.util.LifecycleBase.start(LifecycleBase.java:150) ... 10 more 20-Mar-2017 19:32:15.615 GRAVE [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployWAR Error durante el despliegue del archivo C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\MyApplication.war de la aplicación web java.lang.IllegalStateException: ContainerBase.addChild: start: org.apache.catalina.LifecycleException: Failed to start component [StandardEngine[Catalina].StandardHost[localhost].StandardContext[/MyApplication]] at org.apache.catalina.core.ContainerBase.addChildInternal(ContainerBase.java:756) at org.apache.catalina.core.ContainerBase.addChild(ContainerBase.java:728) at org.apache.catalina.core.StandardHost.addChild(StandardHost.java:734) at org.apache.catalina.startup.HostConfig.deployWAR(HostConfig.java:952) at org.apache.catalina.startup.HostConfig$DeployWar.run(HostConfig.java:1823) at java.util.concurrent.Executors$RunnableAdapter.call(Unknown Source) at java.util.concurrent.FutureTask.run(Unknown Source) at java.util.concurrent.ThreadPoolExecutor.runWorker(Unknown Source) at java.util.concurrent.ThreadPoolExecutor$Worker.run(Unknown Source) at java.lang.Thread.run(Unknown Source) 20-Mar-2017 19:32:15.621 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployWAR Deployment of web application archive C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\MyApplication.war has finished in 16.856 ms 20-Mar-2017 19:32:15.625 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployDirectory Despliegue del directorio C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\docs de la aplicación web 20-Mar-2017 19:32:15.899 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployDirectory Deployment of web application directory C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\docs has finished in 274 ms 20-Mar-2017 19:32:15.900 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployDirectory Despliegue del directorio C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\examples de la aplicación web 20-Mar-2017 19:32:16.762 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployDirectory Deployment of web application directory C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\examples has finished in 862 ms 20-Mar-2017 19:32:16.762 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployDirectory Despliegue del directorio C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\host-manager de la aplicación web 20-Mar-2017 19:32:16.833 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployDirectory Deployment of web application directory C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\host-manager has finished in 71 ms 20-Mar-2017 19:32:16.834 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployDirectory Despliegue del directorio C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\manager de la aplicación web 20-Mar-2017 19:32:16.954 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployDirectory Deployment of web application directory C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\manager has finished in 120 ms 20-Mar-2017 19:32:16.955 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployDirectory Despliegue del directorio C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\ROOT de la aplicación web 20-Mar-2017 19:32:16.999 INFORMACIÓN [localhost-startStop-1] org.apache.catalina.startup.HostConfig.deployDirectory Deployment of web application directory C:\Program Files (x86)\Apache Software Foundation\Tomcat 8.5\webapps\ROOT has finished in 44 ms 20-Mar-2017 19:32:17.008 INFORMACIÓN [main] org.apache.coyote.AbstractProtocol.start Starting ProtocolHandler [http-nio-8081] 20-Mar-2017 19:32:17.047 INFORMACIÓN [main] org.apache.coyote.AbstractProtocol.start Starting ProtocolHandler [ajp-nio-8009] 20-Mar-2017 19:32:17.054 INFORMACIÓN [main] org.apache.catalina.startup.Catalina.start Server startup in 18447 ms tomcat8-stdout.2017-03-20.log 2017-03-20 19:31:55 Commons Daemon procrun stdout initialized And the web.xml of my application is: <?xml version="1.0" encoding="UTF-8"?> <web-app version="3.1" xmlns="http://xmlns.jcp.org/xml/ns/javaee" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://xmlns.jcp.org/xml/ns/javaee http://xmlns.jcp.org/xml/ns/javaee/web-app_3_1.xsd"> <context-param> <param-name>primefaces.THEME</param-name> <param-value>bootstrap</param-value> </context-param> <context-param> <param-name>javax.faces.PROJECT_STAGE</param-name> <param-value>Development</param-value> </context-param> <context-param> <param-name>facelets.LIBRARIES</param-name> <param-value>/WEB-INF/tsp.taglib.xml</param-value> </context-param> <context-param> <param-name>primefaces.FONT_AWESOME</param-name> <param-value>true</param-value> </context-param> <context-param> <param-name>javax.faces.DATETIMECONVERTER_DEFAULT_TIMEZONE_IS_SYSTEM_TIMEZONE</param-name> <param-value>true</param-value> </context-param> <mime-mapping> <extension>ttf</extension> <mime-type>application/x-font-ttf</mime-type> </mime-mapping> <mime-mapping> <extension>woff</extension> <mime-type>application/x-font-woff</mime-type> </mime-mapping> <mime-mapping> <extension>woff2</extension> <mime-type>application/x-font-woff2</mime-type> </mime-mapping> <mime-mapping> <extension>eot</extension> <mime-type>application/x-font-eot</mime-type> </mime-mapping> <filter-mapping> <filter-name>PrimeFaces FileUpload Filter</filter-name> <servlet-name>Faces Servlet</servlet-name> </filter-mapping> <servlet> <servlet-name>Faces Servlet</servlet-name> <servlet-class>javax.faces.webapp.FacesServlet</servlet-class> <load-on-startup>1</load-on-startup> </servlet> <servlet-mapping> <servlet-name>Faces Servlet</servlet-name> <url-pattern>/faces/*</url-pattern> </servlet-mapping> <session-config> <session-timeout> -1 </session-timeout> </session-config> <welcome-file-list> <welcome-file>faces/index.xhtml</welcome-file> </welcome-file-list> </web-app> Could you help me to understand and solve the error? Thank you very much!!

Thomas Prince (20 February 1879 – 1950) was an English professional footballer who played as a winger for Sunderland. References 1879 births 1950 deaths People from Hetton-le-Hole Footballers from Tyne and Wear English footballers Association football wingers Selbourne F.C. players Sunderland A.F.C. players English Football League players

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"> <html> <head> <title>CApplication.ApplicationForm</title> <link href="css/style.css" rel="stylesheet" type="text/css"> <meta http-equiv="Content-Type" content="text/html;charset=utf-8" > </head> <body bgcolor="#ffffff"> <table border="0" width="100%" bgcolor="#F0F0FF"> <tr> <td>Concept Framework 2.2 documentation</td> <td align="right"><a href="index.html">Contents</a> | <a href="index_fun.html">Index</a></td> </tr> </table> <h2><a href="CApplication.html">CApplication</a>.ApplicationForm</h2> <table border="0" cellspacing="0" cellpadding="0" width="500" style="border-style:solid;border-width:1px;border-color:#D0D0D0;"> <tr bgcolor="#f0f0f0"> <td><i>Name</i></td> <td><i>Type</i></td> <td><i>Access</i></td> <td><i>Version</i></td> <td><i>Deprecated</i></td> </tr> <tr bgcolor="#fafafa"> <td><b>ApplicationForm</b></td> <td>property</td> <td>public</td> <td>version 1.0</td> <td>no</td> </tr> </table> <br /> <b>Prototype:</b><br /> <table bgcolor="#F0F0F0" width="100%" style="border-style:solid;border-width:1px;border-color:#D0D0D0;"><tr><td><b>Read/Write property ApplicationForm[=<a href="RForm.html">RForm</a>]</b></td></tr></table> <br /> <br /> <b>Description:</b><br /> <table width="100%" bgcolor="#FAFAFF" style="border-style:solid;border-width:1px;border-color:#D0D0D0;"> <tr><td> Sets or gets the main form for the application. This property should not be set (is set by the constructor). </td></tr> </table> <br /> <b>Returns:</b><br /> Returns a <a href="RForm.html">RForm</a> representing the main form of the application. If no form is set, it returns null. <br /> <br /> <!-- <p> <a href="http://validator.w3.org/check?uri=referer"><img src="http://www.w3.org/Icons/valid-html40" alt="Valid HTML 4.0 Transitional" height="31" width="88" border="0"></a> <a href="http://jigsaw.w3.org/css-validator/"> <img style="border:0;width:88px;height:31px" src="http://jigsaw.w3.org/css-validator/images/vcss" alt="Valid CSS!" border="0"/> </a> </p> --> <table bgcolor="#F0F0F0" width="100%"><tr><td>Documented by Eduard Suica, generation time: Sun Jan 27 18:15:11 2013 GMT</td><td align="right">(c)2013 <a href="http://www.devronium.com">Devronium Applications</a></td></tr></table> </body> </html>

Place Beauvau (English: Beauvau Square) is a public square in the 8th arrondissement of Paris, at the intersection of the Rue du Faubourg-Saint-Honoré, Avenue de Marigny, Rue des Saussaies and Rue de Miromesnil. It is located in the La Madeleine neighbourhood, next to the Élysée Palace. Hôtel de Beauvau Place Beauvau is best known for the Hôtel de Beauvau, built by the architect Nicolas Le Camus de Mézières around 1770 for the prince, Charles Juste de Beauvau-Craon. In 1859, the Government of France purchased the building and installed the French governor-general of Algeria there. However, Victor Fialin, the duke of Persigny, who was Minister of the Interior under Napoleon III, arranged for his ministry to be moved from the Rue de Grenelle, in the 7th arrondissement, to this location. The Hôtel de Beauvau has housed the Ministry of the Interior since 1861; "Place Beauvau" is often used by French news-gathering organisations as shorthand for the ministry. The buildings to the north of the square are devoted to various services of the ministry. Nearby places of interest The Elysée Palace (Palais de l'Elysée), located on the Rue du Faubourg Saint-Honoré, is the official residence of the President of the French Republic, where the president's office is located, and the Council of Ministers meets. Important foreign visitors are hosted at the nearby Hôtel de Marigny (not a hotel in the English sense, but a palatial residence.) The Service de Protection des Hautes Personnalités (SPHP) is a French national police unit in charge of the protection of high-profile personalities who visit France. It is located just a few steps off the Place Beauvau in the Rue de Miromesnil. Metro station The Place Beauvau is: It is served by lines 1, 8, 9, 12, 13, and 14. External links Place Beauvau : La face cachée de la police par Jean-Michel Décugis, Christophe Labbé, Olivia Recasens; Robert Laffont, 2006 L'hôtel de Beauvau Sur le site du ministère de l'Intérieur Beauvau Buildings and structures in the 8th arrondissement of Paris

Q: Android run time permission error I am developing an application that required to access contacts in phone. this method is executed inside a thread. But when app start for the first time it crashes and says android.permission.READ_CONTACTS or android.permission.READ_CONTACTS required as error. as soon as press on OK in on error pop up dialog box. it restart it self asking for permission and works fine. here's the code inside fragment on onCreateView method to check whether permission already has been granted. if (ContextCompat.checkSelfPermission(getActivity(), Manifest.permission.READ_CONTACTS) == PackageManager.PERMISSION_GRANTED) { Runnable r = new Runnable() { @Override public void run() { getContacts(); } }; Thread thread = new Thread(r); thread.start(); }else{ if (Build.VERSION.SDK_INT >= Build.VERSION_CODES.M) { if (shouldShowRequestPermissionRationale(Manifest.permission.READ_CONTACTS)) { Toast.makeText(getActivity(),"Read contacts permission is required to function app correctly",Toast.LENGTH_LONG) .show(); } requestPermissions(new String[]{Manifest.permission.READ_CONTACTS}, REQUEST_READ_CONTACTS); } } here's the onRequestPermissionsResult method. @Override public void onRequestPermissionsResult(int requestCode, @NonNull String[] permissions, @NonNull int[] grantResults) { switch (requestCode){ case REQUEST_READ_CONTACTS : Runnable r = new Runnable() { @Override public void run() { getContacts(); } }; Thread thread = new Thread(r); thread.start(); break; default: super.onRequestPermissionsResult(requestCode, permissions, grantResults); } } here's the code for get contact method. public void getContacts() { ContentResolver cr = getActivity().getContentResolver(); Cursor cur = cr.query(ContactsContract.Contacts.CONTENT_URI, null, null, null, null); if (cur != null) { if (cur.getCount() > 0) { while (cur.moveToNext()) { String id = cur.getString(cur.getColumnIndex(ContactsContract.Contacts._ID)); String name = cur.getString(cur.getColumnIndex(ContactsContract.Contacts.DISPLAY_NAME)); String imgPath = cur.getString(cur.getColumnIndex(ContactsContract.CommonDataKinds.Phone.PHOTO_URI)); if (Integer.parseInt(cur.getString(cur.getColumnIndex(ContactsContract.Contacts.HAS_PHONE_NUMBER))) > 0) { Cursor ncur = cr.query(ContactsContract.CommonDataKinds.Phone.CONTENT_URI, null, ContactsContract.CommonDataKinds.Phone.CONTACT_ID + " = ?", new String[]{id}, null); if (ncur != null) { while (ncur.moveToNext()) { String phoneNumber = ncur.getString(ncur.getColumnIndex(ContactsContract.CommonDataKinds.Phone.NUMBER)); String reDefinedPhoneNumber = ""; if (phoneNumber.contains("-")) { String[] split = phoneNumber.split("-"); for (String k : split) { reDefinedPhoneNumber = reDefinedPhoneNumber.concat(k); } } else if (phoneNumber.contains(" ")) { String[] split = phoneNumber.split(" "); for (String k : split) { reDefinedPhoneNumber = reDefinedPhoneNumber.concat(k); } } else { reDefinedPhoneNumber = phoneNumber; } Contact contact = new Contact(); contact.setId(contact.getId()); contact.setName(name); contact.setNumber(reDefinedPhoneNumber); contact.setImgPath(imgPath); contacts.add(contact); } ncur.close(); } } } } cur.close(); } } Here's AndroidManifest.xml code. <?xml version="1.0" encoding="utf-8"?> <manifest xmlns:android="http://schemas.android.com/apk/res/android" package="com.shan.chathuranga.smsscheduler"> <uses-permission android:name="android.permission.SEND_SMS" /> <uses-permission android:name="android.permission.RECEIVE_BOOT_COMPLETED" /> <uses-permission android:name="android.permission.READ_CONTACTS" /> </manifest> what am I doing wrong. works fine in below marshmallow.

namespace SSS_Windows_Forms.Forms.Tutor { partial class TutorDashboardModal { /// <summary> /// Required designer variable. /// </summary> private System.ComponentModel.IContainer components = null; /// <summary> /// Clean up any resources being used. /// </summary> /// <param name="disposing">true if managed resources should be disposed; otherwise, false.</param> protected override void Dispose(bool disposing) { if (disposing && (components != null)) { components.Dispose(); } base.Dispose(disposing); } #region Windows Form Designer generated code /// <summary> /// Required method for Designer support - do not modify /// the contents of this method with the code editor. /// </summary> private void InitializeComponent() { this.components = new System.ComponentModel.Container(); this.reportViewer1 = new Microsoft.Reporting.WinForms.ReportViewer(); this.IS2G10_DBSSSDataSetBindingSource = new System.Windows.Forms.BindingSource(this.components); ((System.ComponentModel.ISupportInitialize)(this.IS2G10_DBSSSDataSetBindingSource)).BeginInit(); this.SuspendLayout(); // // reportViewer1 // this.reportViewer1.Dock = System.Windows.Forms.DockStyle.Fill; this.reportViewer1.LocalReport.ReportEmbeddedResource = "SSS_Windows_Forms.Reports.Tutor.TutorDashboardReport.rdlc"; this.reportViewer1.Location = new System.Drawing.Point(0, 0); this.reportViewer1.Name = "reportViewer1"; this.reportViewer1.ShowToolBar = false; this.reportViewer1.Size = new System.Drawing.Size(753, 539); this.reportViewer1.TabIndex = 0; // // IS2G10_DBSSSDataSetBindingSource // this.IS2G10_DBSSSDataSetBindingSource.DataMember = "AVERAGE_RATINGS"; // // TutorDashboardModal // this.AutoScaleDimensions = new System.Drawing.SizeF(6F, 13F); this.AutoScaleMode = System.Windows.Forms.AutoScaleMode.Font; this.ClientSize = new System.Drawing.Size(753, 539); this.ControlBox = false; this.Controls.Add(this.reportViewer1); this.FormBorderStyle = System.Windows.Forms.FormBorderStyle.None; this.Name = "TutorDashboardModal"; this.Text = "TutorDashboardModal"; this.Load += new System.EventHandler(this.TutorDashboardModal_Load); this.VisibleChanged += new System.EventHandler(this.TutorDashboardModal_VisibleChanged); ((System.ComponentModel.ISupportInitialize)(this.IS2G10_DBSSSDataSetBindingSource)).EndInit(); this.ResumeLayout(false); } #endregion private Microsoft.Reporting.WinForms.ReportViewer reportViewer1; private System.Windows.Forms.BindingSource IS2G10_DBSSSDataSetBindingSource; } }

Q: How join annotate value of QuerySet and property field of Model to one logic in Django? I have this situation. I calculate a diameter in two ways: annotate of QuerySet and property in Model. class CircleQuerySet(models.QuerySet): def annotate_diameter(self): return self.annotate(diameter=models.F('radius')*2) class Circle(models.Model): radius = models.DecimalField(max_digits=11, decimal_places=2) objects = CircleQuerySet.as_manager() @property def diameter(self): return self.radius * 2 How can I join this two ways to one? Is it exists? A: You can add a setter for the diameter property so that you do not get errors when trying to add an annotation of the same name @property def diameter(self): return self.radius * 2 @diameter.setter def diameter(self, value): return As for only having the calculation in one place, it is not possible because the annotation is a database instruction and you still need the property for objects that are not retrieved from the database. You could add the annotation to every query by overriding the get_queryset method of the manager so that even .get() will return an object with the annotation.

Pokemon Season 11: Diamond and Pearl: Battle Dimension Select ratingGive Pokemon Season 11: Diamond and Pearl: Battle Dimension 1/10Give Pokemon Season 11: Diamond and Pearl: Battle Dimension 2/10Give Pokemon Season 11: Diamond and Pearl: Battle Dimension 3/10Give Pokemon Season 11: Diamond and Pearl: Battle Dimension 4/10Give Pokemon Season 11: Diamond and Pearl: Battle Dimension 5/10Give Pokemon Season 11: Diamond and Pearl: Battle Dimension 6/10Give Pokemon Season 11: Diamond and Pearl: Battle Dimension 7/10Give Pokemon Season 11: Diamond and Pearl: Battle Dimension 8/10Give Pokemon Season 11: Diamond and Pearl: Battle Dimension 9/10Give Pokemon Season 11: Diamond and Pearl: Battle Dimension 10/10 It's looking good for Ash as he works on his next three Gym Badges, but not so good for Dawn, coming off a pair of Contest defeats. Both will do what they can to become better Trainers, from entering the Wallace Cup competition to attending Professor Rowan's Pokémon Summer Academy. Hopefully, the new tactics they pick up will give them the tools they need to succeed against the latest plot by Pokémon Hunter J—as well as the emerging threat of Team Galactic! Aired: Nov. 8, 2007 to Dec. 4, 2008 Producers: Viz Media, The Pokemon Company International Rating: PG - Children Pokemon Season 11: Diamond and Pearl: Battle Dimension Episodes Select episode 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 Pokemon Season 11: Diamond and Pearl: Battle Dimension Episode 1 dubbed Pokemon Season 11: Diamond and Pearl: Battle Dimension Episode 10 dubbed Pokemon Season 11

Whether you are looking for the perfect flowers to decorate and add beauty to your home or you are planning to give them as a gift, you cannot deny the fact that flowers put smiles on our faces. When looking to buy fresh flowers, you should not look further. Visit your local flower shop because they have the best florists that can help you pick and make your flowers extra special. Their florists are skilled , experienced, and knowledgeable to help you select the best flowers for any particular event or occasion. They are professionals who studied and perfected different varieties of flowers. For as long as you know a good florist from the flower store, picking and buying flowers is a walk in the park. In this article, we will be discussing some important factors that you need to consider when buying flowers from your local flower shop. Flowers are great gifts and are excellent when it comes to delivering important messages. There is no better way to say "I love you", "I miss you", "congratulations", etc. than giving flowers. Flowers come in a wide array of colors, sizes, and kinds. Each color represents or symbolizes a certain meaning. For example, when giving flowers to express your love for a special someone, it is a must that you pick the color red. If you are not very familiar with this, it is best to ask for the help of your local florist. With his advice, you are guaranteed to have the best and appropriate flowers for any event that you are celebrating. 2. Get them customized/ decorated. It is recommendable to visit your local florist when buying flowers because they go the extra mile to make your flowers more presentable and appealing. They are trained to arrange and add beauty to any kinds of flowers. If you want to add a letter/ note, chocolates, and other gifts to a set of beautiful flowers, there is no better place than your local flower shop. 3. See if you can get them delivered. The convenience factor is probably the greatest advantage your local flower shop can provide. It is here where you can find the best florists in town to help you pick and arrange your fresh blooms. A lot of reputable and successful flower shops even offer a delivery service. This will guarantee that your flowers will reach your loved one on time. It does not get any better than that. When planning to buy flowers for your home or for a special someone, be sure to visit your local flower shop for the best selection of flowers.

Our Atlanta lawn aeration service company is the best lawn aeration service in Atlanta GA. Our Atlanta based lawn aerate service provides services to Marietta, East Cobb, Smyrna, Vinings, Buckhead, Roswell, lawns of Alpharetta, Sandy Springs, Kennesaw, Johns Creek, Douglasville, Hiram, Powder Springs and more. Call 678 665-0784 to schedule Atlanta's best lawn aerate service today. Tricks And Tips On How To Make The Most Out Of Your LandscapeDoes everyone in your neighborhood seem to know the intimate details of your yard? Are they discussing the fact that it's unsightly? If that is true for you, turn things around by sprucing up your yard. Keep reading to find some great yard tips.Make a sketch of your landscaping project ideas before you start digging. This drawing can help you figure out what the final result will look like and start listing what kind of materials you need. It is a lot easier to fix your sketch than it would be to adjust the yard.Clay soil makes working with a shovel difficult. The clay is hard and sticks to the shovel. Coat the shovel with floor or car wax, and buff it with a clean rag to make the job a lot easier. This will both make the clay fall off of the surface, and prevent the surface from rusting. TIP! For a garden that thrives, choose the right type of soil. Depending on what type of plants you have, your soil may or may not be adapted. Make your yard look beautiful all year by creating a garden that incorporates all seasons. Select different plants that flower in different seasons, paying attention to what will grow well in your area. You can also pick trees with nice foliage or evergreens which make your yard look alive all year long.People often forget about the many online options when shopping for landscaping materials or equipment. Shopping online is faster and more convenient, and also provides you access to unusual plants that may not be in stock at a local store.When fall arrives, it's time to plant your autumn vegetables. Try planting your fall veggies, especially leafy greens, inside of a pumpkin! Scoop the insides out of the pumpkin, and don't forget to spray the inside with Wilt-Pruf. This will prevent your pumpkin from rotting. After that, your pumpkin planter is ready to use! TIP! You can use boiling water to get rid of weeds naturally. The safest herbicide that you can probably find is a cup of boiling water. Take time to accurately measure the area you are landscaping prior to visiting your garden center. By having correct measurement it will be easier to determine the amount of plants you need. This will help you not buy too much or too little of your materials.As you begin your landscape design journey, think about getting some advice from a professional before you make any major decisions. Seasoned experts have the ability to offer useful, cost-effective ideas for your outdoor space. The $75 or so that you will spend on it can be worth every penny by helping you prevent costly mistakes.If you would love to have access to fresh and healthy mint leaves from your own back yard, but dread the way the plant spreads so quickly, worry not. Stunt their growth a little by planting your mint into a garden container or large pot instead. Then, you can plant the container into the ground. However, the container walls will keep the roots held, and prevent the plant from consuming too much of your garden space. TIP! It is important to follow the instructions on your chemicals and tools closely, especially if you are new to gardening. Some of the chemicals in these products can cause skin irritation, or worse, if you fail to take this simple precaution. Landscaping need not be done just by professionals! You can beautify your yard, as long as you put the time in and learn the right skills to do it well. Your accomplishments will have all your neighbors looking at your yard enviously. That is something that every homeowner wants! Need aeration and seeding done? Call Pro Advantage Landscaping to schedule your premium aerate and seeding service today at 678 665-0784.

Certified Nurse-Midwives (CNMs) specialize in normal pregnancy and birth, and care for women from adolescence to beyond menopause. Our scope of practice includes primary care, gynecology, birth control, prenatal care, postpartum care and early newborn care. CNMs are Master's Degree prepared Advanced Practice Nurses who are board certified by the American Midwifery Certification Board (AMCB). In California we are independent practitioners and licensed by the Board of Nursing. Where can you find a midwife? CNMs in Los Angeles work in hospitals, birth centers, health centers and attend homebirths. You can find us at UCLA, Kaiser, Cedars-Sinai, Planned Parenthood and many more locations. To find a midwife, click here. In California, UCSF, UCSD and California State University at Fullerton offer Master's programs in midwifery. Learn more about becoming a midwife. For new and experienced midwives interested in connecting through a mentorship program please see the student page of the CNMA website.

Q: Transferring MySQL Workbench to Server I am trying to move my database model from mysql workbench to mysql server. I am using the reverse engineer sql create script but when importing it gives me an error. I have tried to google the problem but no luck to my situation. -- ----------------------------------------------------- -- Table `MapLibrary`.`Books` -- ----------------------------------------------------- DROP TABLE IF EXISTS `MapLibrary`.`Books` ; CREATE TABLE IF NOT EXISTS `MapLibrary`.`Books` ( `ISBN` VARCHAR(13) NOT NULL, `date_of_publication` INT NULL, `book_title` VARCHAR(45) NULL, PRIMARY KEY (`ISBN`)) ENGINE = InnoDB; -- ----------------------------------------------------- -- Table `MapLibrary`.`Genre` -- ----------------------------------------------------- DROP TABLE IF EXISTS `MapLibrary`.`Genre` ; CREATE TABLE IF NOT EXISTS `MapLibrary`.`Genre` ( `genre_code` INT NOT NULL, `genre_name` VARCHAR(45) NOT NULL, PRIMARY KEY (`genre_code`)) ENGINE = InnoDB; -- ----------------------------------------------------- -- Table `MapLibrary`.`Books_By_Genre` -- ----------------------------------------------------- DROP TABLE IF EXISTS `MapLibrary`.`Books_By_Genre` ; CREATE TABLE IF NOT EXISTS `MapLibrary`.`Books_By_Genre` ( `genre_code` INT NOT NULL, `ISBN` VARCHAR(13) NOT NULL, PRIMARY KEY (`genre_code`, `ISBN`), INDEX `Books_idx` (`ISBN` ASC), CONSTRAINT `Books` FOREIGN KEY (`ISBN`) REFERENCES `MapLibrary`.`Books` (`ISBN`) ON DELETE NO ACTION ON UPDATE NO ACTION, CONSTRAINT `Genre` FOREIGN KEY (`genre_code`) REFERENCES `MapLibrary`.`Genre` (`genre_code`) ON DELETE NO ACTION ON UPDATE NO ACTION) ENGINE = InnoDB; ERROR: ERROR 1022 (23000) at line 89: Can't write; duplicate key in table 'books_by_genre' Operation failed with exitcode 1 A: The problem is that the ISBN is NOT a unique identifier on its own in the referenced tables. I assume, that the Books table is your base table and the three referenced tables are M:N link tables. If this is true, then your foreign keys are pointing in the wrong direction. (Try to drag the connection in the other direction?)

Q: hadoop2.2.0 installation on linux ( NameNode not starting ) I am trying to run a single node hadoop cluster on my machine with the following config: inux livingstream 3.2.0-29-generic #46-Ubuntu SMP Fri Jul 27 17:03:23 UTC 2012 x86_64 x86_64 x86_64 GNU/Linux I am able to format the namenode without any problems however when I try and start the namenode using : hadoop-daemon.sh start namenode I get the following errors : ishan@livingstream:/usr/local/hadoop$ hadoop-daemon.sh start namenode Warning: $HADOOP_HOME is deprecated. mkdir: cannot create directory `/var/log/hadoop/ishan': Permission denied chown: cannot access `/var/log/hadoop/ishan': No such file or directory mkdir: cannot create directory `/var/run/hadoop': Permission denied starting namenode, logging to /var/log/hadoop/ishan/hadoop-ishan-namenode-livingstream.out /usr/sbin/hadoop-daemon.sh: line 138: /var/run/hadoop/hadoop-ishan-namenode.pid: No such file or directory /usr/sbin/hadoop-daemon.sh: line 137: /var/log/hadoop/ishan/hadoop-ishan-namenode-livingstream.out: No such file or directory head: cannot open `/var/log/hadoop/ishan/hadoop-ishan-namenode-livingstream.out' for reading: No such file or directory /usr/sbin/hadoop-daemon.sh: line 147: /var/log/hadoop/ishan/hadoop-ishan-namenode-livingstream.out: No such file or directory /usr/sbin/hadoop-daemon.sh: line 148: /var/log/hadoop/ishan/hadoop-ishan-namenode-livingstream.out: No such file or directory I did not create a separate user "hduser" for hadoop installation. I am using my exsisting username. May be that is why I am facing the problem. Can someone please help me with this . Exactly what permissions do I need to alter to get this working ? UPDATE After fiddling around and getting around the permission problems I have moved on to new stupidity of errors posted here : hadoop Nanenode wont start I will forever keep you guys in mind if you can nudge me in the right direction so that I can start some real work on this.

@class UIImage; @interface CHChatMessageLocationVM : CHChatMessageFileVM<CHChatMessageViewModelProtocol> @property (nonatomic ,readonly) double longitude; @property (nonatomic ,readonly) double latitude; @property (nonatomic ,readonly) CLLocationCoordinate2D coor; @property (nonatomic ,readonly) NSString *areaDetail; @property (nonatomic ,readonly) NSString *areaName; @property (nonatomic ,readonly) UIImage *snapshot; @end

Q: How to make the RecyclerView's ItemTouchHelper work on only part of the list(drag & drop) I use RecyclerView's ItemTouchHelper to change the order(drag & drop),And I want to move only a part of the list. I don't want to move after a certain index. How can I handle it with one RecyclerView? If I explain a little more about what I want to make, The active items are sorted up and the non-active items are sorted down. And only the activated items will shift the order. Right now, when I drag an active item, it goes down to the area of ​​the non-active item, but I want to prevent it from going down. How can I do it? UPDATE open class SimpleItemTouchHelperCallback(private val mAdapter: ItemTouchHelperAdapter) : ItemTouchHelper.Callback() { private var isLongPressDrag = true fun setLongPressDragEnable(isLongPressDrag: Boolean) { this.isLongPressDrag = isLongPressDrag } override fun isLongPressDragEnabled() = isLongPressDrag override fun getMovementFlags( recyclerView: RecyclerView, viewHolder: RecyclerView.ViewHolder ): Int { val dragFlags = ItemTouchHelper.UP or ItemTouchHelper.DOWN val swipeFlags = 0 return makeMovementFlags(dragFlags, swipeFlags) } override fun onMove( recyclerView: RecyclerView, viewHolder: RecyclerView.ViewHolder, target: RecyclerView.ViewHolder ): Boolean { return mAdapter.onItemMove(viewHolder.adapterPosition, target.adapterPosition) } override fun onSwiped(viewHolder: RecyclerView.ViewHolder, i: Int) { mAdapter.onItemDismiss(viewHolder.adapterPosition) } } A: Use ItemTouchHelper.SimpleCallback and override getDragDirs and onMove methods: ItemTouchHelper.SimpleCallback( UP or DOWN, 0 ) { override fun getDragDirs(recyclerView: RecyclerView, viewHolder: RecyclerView.ViewHolder): Int { val selectedPosition = viewHolder.adapterPosition val isActive: Boolean = // retrieve your model from list and check its active state return if (isActive) super.getDragDirs(recyclerView, viewHolder) else 0 } override fun onMove( recyclerView: RecyclerView, viewHolder: RecyclerView.ViewHolder, target: RecyclerView.ViewHolder, ): Boolean { val toPosition = target.adapterPosition val isActiveTarget: Boolean = // retrieve your target model from list and check its active state if (!isActiveTarget) return false val fromPosition = viewHolder.adapterPosition moveItem(fromPosition, toPosition) return true } } Returning 0 on getDragDirs prevents inactive item selection, while returning false on onMove prevents item movement while dragging.

John Kelly of the Irish Chamber Orchestra at the 2011 Irish America Wall Street 50 John Kelly of the Irish Chamber Orchestra plays a riveting rendition of "O'Carolan's Cocerto" follwed by an encore performance of "The Orange Blossom Special" at the annual Irish America Wall Street 50 awards dinner on September 22, 2011 at the New York Yacht Club. 2011 Wall Street 50 Awards Highlights Irish America magazine celebrated the 2011 Wall Street 50, an annual celebration of the best and brightest Irish Americans in finance, on September 22, 2011 at the New York Yacht Club. Among the speakers were Tanaiste Eamon Gilmore, Governor Martin O'Malley and keynote speaker Brian Ruane, CEO of BNY Mellon Alternative Investment Services John KellyRead more.. Tanaiste Eamon Gilmore addresses the Irish America Wall Street 50 Tanaiste Eamon Gilmore delivers a speech at the Irish America Wall Street 50 awards dinner on September 22, 2011 at the New York Yacht Club. Governor Martin O'Malley of Maryland addresses the Irish America Wall Street 50 Governor Martin O'Malley of Maryland speaks at the 14th Annual Irish America Wall Street 50 awards dinner on September 22, 2011 at the New York Yacht Club. Brian Ruane of BNY Mellon Keynote address at the Irish America Wall Street 50 Brian Ruane, CEO of BNY Mellon Alternative Investment Services delivers his Keynote address at the Irish America Wall Street 50 awards dinner. The Wall Street 50 awards honored the best and brightest Irish Americans in finance on September 22, 2011 at the New York Yacht Club.

import * as React from 'react'; import { useUtils } from './useUtils'; import { ParseableDate } from '../constants/prop-types'; import { PickerOnChangeFn } from './useViews'; import { getMeridiem, convertToMeridiem } from '../time-utils'; export type OverrideParseableDateProps<TDate, TProps, TKey extends keyof TProps> = Omit< TProps, TKey > & Partial<Record<TKey, ParseableDate<TDate>>>; export function useParsedDate<TDate>( possiblyUnparsedValue: ParseableDate<TDate>, ): TDate | undefined { const utils = useUtils<TDate>(); return React.useMemo( () => typeof possiblyUnparsedValue === 'undefined' ? undefined : utils.date(possiblyUnparsedValue)!, [possiblyUnparsedValue, utils], ); } interface MonthValidationOptions { disablePast?: boolean; disableFuture?: boolean; minDate: unknown; maxDate: unknown; } export function useNextMonthDisabled( month: unknown, { disableFuture, maxDate }: Pick<MonthValidationOptions, 'disableFuture' | 'maxDate'>, ) { const utils = useUtils(); return React.useMemo(() => { const now = utils.date(); const lastEnabledMonth = utils.startOfMonth( disableFuture && utils.isBefore(now, maxDate) ? now : maxDate, ); return !utils.isAfter(lastEnabledMonth, month); }, [disableFuture, maxDate, month, utils]); } export function usePreviousMonthDisabled( month: unknown, { disablePast, minDate }: Pick<MonthValidationOptions, 'disablePast' | 'minDate'>, ) { const utils = useUtils(); return React.useMemo(() => { const now = utils.date(); const firstEnabledMonth = utils.startOfMonth( disablePast && utils.isAfter(now, minDate) ? now : minDate, ); return !utils.isBefore(firstEnabledMonth, month); }, [disablePast, minDate, month, utils]); } export function useMeridiemMode<TDate>( date: TDate, ampm: boolean | undefined, onChange: PickerOnChangeFn<TDate>, ) { const utils = useUtils<TDate>(); const meridiemMode = getMeridiem(date, utils); const handleMeridiemChange = React.useCallback( (mode: 'am' | 'pm') => { const timeWithMeridiem = convertToMeridiem<TDate>(date, mode, Boolean(ampm), utils); onChange(timeWithMeridiem, 'shallow'); }, [ampm, date, onChange, utils], ); return { meridiemMode, handleMeridiemChange }; }

#include <iostream> #include "eval.h" #include "env.h" #include "load.h" #include "utils.h" namespace { using namespace mclisp; ConsCell *Evcon(const ConsCell *clauses, ConsCell *env) { TYPECHECK(clauses, Listp); if (Null(clauses)) return kNil; TYPECHECK(Car(clauses), Consp); if (*Eval(Caar(clauses), env)) return Eval(Cadar(clauses), env); return Evcon(Cdr(clauses), env); } ConsCell* Evlis(ConsCell* lst, ConsCell* env) { TYPECHECK(lst, Listp); if (Null(lst)) return kNil; return Cons(Eval(Car(lst), env), Evlis(Cdr(lst), env)); } } // namespace namespace mclisp { ConsCell *Eval(const ConsCell *exp, ConsCell *env /* env::g_user_env */) { if (Atom(exp)) return env::Lookup(env, exp); if (Atom(Car(exp))) { if (EQ(Car(exp), QUOTE)) return Cadr(exp); if (EQ(Car(exp), ATOM)) return FromBool(Atom(Eval(Cadr(exp), env))); if (EQ(Car(exp), EQ)) return FromBool(Eq(Eval(Cadr(exp), env), Eval(Caddr(exp), env))); if (EQ(Car(exp), COND)) return Evcon(Cdr(exp), env); if (EQ(Car(exp), CAR)) return Car(Eval(Cadr(exp), env)); if (EQ(Car(exp), CDR)) return Cdr(Eval(Cadr(exp), env)); if (EQ(Car(exp), CONS)) return Cons(Eval(Cadr(exp), env), Eval(Caddr(exp), env)); if (EQ(Car(exp), DEFUN)) { ConsCell *fname = Cadr(exp); ConsCell *formals = Caddr(exp); ConsCell *body = Cdddr(exp); ConsCell *lambda = Append(List(BUILTIN(LAMBDA), formals), body); env::g_user_env = env::Extend(env::g_user_env, fname, lambda); return fname; } if (EQ(Car(exp), EVAL)) return Eval(Eval(Cadr(exp), env), env); if (EQ(Car(exp), LOAD)) { // We append ".lisp" because '.' can't be a valid symbol character (since // symbols can have whitespace and '.' is also used for dotted lists). LoadFile(ToLower(SymbolName(Eval(Cadr(exp), env))) + ".lisp"); return kNil; } if (EQ(Car(exp), PRINT)) { ConsCell *v = Eval(Cadr(exp), env); std::cerr << *v << std::endl; return v; } return Eval(Cons(env::Lookup(env, Car(exp)), Cdr(exp)), env); } if (EQ(Caar(exp), LABEL)) return Eval(Cons(Caddar(exp), Cdr(exp)), env::Extend(env, Cadar(exp), Car(exp))); if (EQ(Caar(exp), LAMBDA)) { ConsCell *body = Caddar(exp); ConsCell *formals = Cadar(exp); ConsCell *parameters = Cdr(exp); if (Listp(formals)) PARITY_CHECK(formals, parameters); // The double Listp check is wasteful, but I think it makes the code easier // to read. auto extendfn = Listp(formals) ? env::ExtendAll : env::Extend; ConsCell *values = Evlis(parameters, env); ConsCell *newenv = extendfn(env, formals, values); return Eval(body, newenv); } ERROR("Invalid expression: " + ToString(exp)); } } // namespace mclisp

HomePosts tagged 'church and state' Pittsburgh Christian Academy Tries to Become a Charter School to Cash in on Taxpayer Funding February 5, 2019 February 5, 2019 stevenmsinger Accountability, Betsy DeVos, Budget, capitalism, Charter Schools, church and state, Civil Rights, Corporate Education "Reform", Education, Local Control, Parents, Pennsylvania, Pittsburgh, Pittsburgh Public Schools, Politics, privatization, School Choice, School Funding, school vouchers, Schools, Students, Teachers, Tom Wolf charter schools, church and state, education, First Amendment, Imani Christian Academy, Pennsylvania, Pittsburgh, Pittsburgh Public Schools, public schools, separation of church and state, U.S. Constitution The line between public and private school is getting awfully thin in Pittsburgh. City public school directors received a request from Imani Christian Academy, a religious school in the East Hills, to be allowed to transform into Imani Academy Charter School for the Fall term of 2019. Though parochial schools have metamorphosed into charter schools in Florida, Tennessee and Washington, D.C., this would be the first such transformation in Pennsylvania, according to Ana Meyers, executive director of the Pennsylvania Coalition of Public Charter Schools. The change would require Imani to give up its religious curriculum in exchange for being fully funded by taxpayer dollars. However, there are numerous red flags in the school's application that make one wonder if operators are being entirely honest about giving up a faith-based curriculum. First, there is the proposal by the school, itself. The application does not specify that religious values will be taught in the classroom. However, its personnel budget lists a comparative religion teacher on staff. The list of proposed teachers also includes a middle/high school religious studies teacher. That's not exactly common practice at most public schools though teaching about religion in a secular context is allowed. According to the Anti-defamation League's Website: "Public schools may not teach religion, although teaching about religion in a secular context is permitted. The Bible may be taught in a school, but only for its historical, cultural or literary value and never in a devotional, celebratory or doctrinal manner, or in such a way that encourages acceptance of the Bible as a religious document." Even so, it's awfully convenient that a school whose mission statement currently includes "We share Christ with our children daily and seek to help them grow into mature Christians" would somehow magically become secular overnight. If Imani's charter is approved, it would be required to discontinue any religious component in its curriculum. The state school code requires even charter schools to be "nonsectarian in all operations." The proposed academy would not be permitted to display any religious objects or symbols on the premises. Yet one wonders who will check to make sure this actually happens. Charter schools are not required to be nearly as transparent as fully public schools. They are not required to have open meetings of school directors, release their documents for public inspection or any of a host of other safeguards that you'll find standard at the state's hundreds of fully public districts. Pennsylvania charter schools have had operators embezzle millions of dollars from taxpayers to buy private jets, apartments and jewelry. It took investigators years to uncover such graft. Will the few auditors tasked with keeping charter schools honest even be equipped to determine whether parochial schools suddenly turned charter actually refrain from ministering to students? According to Public Source, a nonprofit digital newspaper covering the Pittsburgh area, one of the qualities Imani is looking for in an operator for its charter school is the ability to use the school building after-school hours for religious instruction and activities. So during the day, there will be an entirely secular K-12 school at the site of the present day parochial school that just happens to teach comparative religious studies. Then at a certain time of day, it will transform into an optional religious school offering church functions!? This is a violation of the Separation of Church and State waiting to happen. But it's not only the establishment clause of the U.S. Constitution that is in danger of being trampled. Imani's proposal is not fiscally responsible. The charter application proposes its CEO/head of school be paid a salary of $145,000 a year for an institution that would enroll merely 230 students. Pittsburgh Public School Superintendent Dr. Anthony Hamlet earns a salary of $210,000 a year and he oversees a district with 24,652 students! The proposed academy would also employ a principal at $85,000 annual salary. That's not exactly good reimbursement of services for the outlay of cash taxpayers are expected to pay. Imani has struggled financially for several years. In 2014, the school had more than $400,000 in additional expenses over its revenue, according to its form 990 filed with the IRS. The very next year, it had a budget surplus of almost the same amount. By 2016 – the most recent year on file – its expenses again were more than its revenue – this time by more than $500,000. Imani CEO and Head of School Paulo Nzambi explained the up and down budgeting to state officials in 2017 this way. The parochial school relied on the state's defacto school voucher program – the Education Improvement Tax Credit. However, payments were delayed resulting in the use of a line of credit to pay bills. It's just such financial uncertainties that are pushing Imani to become a charter school in the first place. Even with school vouchers, parochial schools rely heavily on tuition from parents. However, you always know where the money is coming from in a charter school. Like religious and private schools, these institutions are privately managed – but like public schools they're funded entirely by taxpayers. Before setting up shop, any new charter school in Pennsylvania must get the approval of the school board from the district where it would be located. If the board does not approve the application, charter school administrators can appeal to the state Charter Appeals Board. Pittsburgh school board held a public hearing on Imani's application in December and earlier this month. Next, the district's review team will offer its suggestions on the application. District solicitor Ira Weiss says the board is scheduled to vote on the matter at its Feb. 27 meeting. If approved, the district would be required to pay for each student at the new charter school based on the district's per-student spending formula. The Pittsburgh district already pays approximately $82.8 million – about 13 percent of its total budget – for charter school tuition. Imani Christian Academy currently operates out of the former East Hills Elementary School building, which it purchased from the city school district for $1 million in 2008. The objections brought up here are really just the tip of the iceberg. The proposal leaves many questions unanswered. For instance, though the new academy would be located within the geographical boundaries of the Pittsburgh Public School District, where would it get its students from? Would current students at the religious school get preferential enrollment – and what if they don't already live in and pay taxes to Pittsburgh? Let's hope Pittsburgh school directors do the right thing and deny this request. Still can't get enough Gadfly? I've written a book, "Gadfly on the Wall: A Public School Teacher Speaks Out on Racism and Reform," now available from Garn Press. Ten percent of the proceeds go to the Badass Teachers Association. Check it out! School Choice Week – Choosing Away Your Choice January 24, 2018 stevenmsinger Accountability, Betsy DeVos, Budget, capitalism, Charter Schools, church and state, Civil Rights, Corporate Education "Reform", Education, Local Control, Parents, Politics, Prejudice, privatization, Propaganda, Racism, School Choice, school closings, School Funding, school segregation, school vouchers, Schools, segregation, small class size, Social Justice, Standardized Testing, Students, Teachers, Unions charter schools, church and state, Local Control, Privatize, propaganda, public schools, scam, scandal, School Choice, School Choice Week, school vouchers School Choice Week is one of the greatest scams in American history. It is a well-funded, thoroughly organized attempt to trick parents into signing away their right to make educational choices about their children. It goes like this: Salesman: Would you like a choice? Parent: Sure! Salesman: Then just agree to never have another choice again. That's it in a nutshell. Choose not to choose. When you decide to send your child to a so-called choice school – a charter or voucher institution – you lose almost every other choice about what happens at your child's school. Sound impossible? Let me count the decisions you lose by signing on the dotted line. When you send your child to a school paid for with public money but run by a private organization, you lose: –AN ELECTED SCHOOL BOARD, so you have no say about what the school does. –OPEN DOCUMENTS, so you have no right to see budgets, spending agreements, bids, contracts, etc. –OPEN MEETINGS, so you have no public place to speak up to the people who run your school. –RIGHT TO SELF-GOVERNMENT, so you have no right to run for a leadership position on the school board. Instead you're at the mercy of appointed flunkies. –THE RIGHT OF ENROLLMENT, so school operators get to choose whether your child gets to attend, unlike public schools which have to accept your child no matter what – so long as you live in the district. –QUALITY SERVICES, so school operators can cut services for your child and pocket the savings as profit or use it to advertise to get more paying butts in seats. –QUALITY TEACHERS, because most charter and voucher schools aren't required to hire educators with 4-year degrees, and since they don't pay as well as public schools and often refuse to let their teachers unionize, they attract less experienced and distinguished educators. –DIVERSE CLASSMATES, because charter and voucher schools increase segregation. Your children will be educated with more kids that look just like them. That's healthy! And that's merely at MOST privatized schools. But that's not all. At some privatized schools you can lose even more! You may also lose: –COMMON SENSE DISCIPLINE POLICIES, so your children will be held to a zero tolerance discipline policy where they may have to sit quietly, eyes forward, marching in line or else face aggressive public reprimands and harsh punishments. –AN UNBIASED SECULAR EDUCATION, so your children will be taught religion and politics as if they were fact – all funded by public tax dollars! Hear that sound? That's our Founders crying. –FREE TIME, so you'll be required to volunteer at the school regardless of your ability to do so. Gotta' work? Tough! –MONEY, so you'll have to pay tuition, buy expensive uniforms, school supplies or other amenities. And if your children are struggling academically, you may also lose: –ENROLLMENT, so your child is given the boot back to the public school because he or she is having difficulty learning, and thus costs too much to educate. You lose all that if you decide to enroll your child in a charter or voucher school! But that's not all! If you DON'T decide to send your child to a so-called choice school, you can still lose choice! Why? Because of the rubes who were fooled into give up their choice. When they did that, they took some of your choices, too. Because of them, you still lose: -NECESSARY FUNDING, because your public school has to make up the money it lost to charter and voucher schools somewhere, and that means fewer resources and services for your child. -LOWER CLASS SIZES, because your public school has to fire teachers and increase class size to make up for lost revenue. -FAIR ASSESSMENTS, because the state and federal government require your child to take unfair high stakes tests to "prove" your public school is failing and thus justify replacing it with a charter or voucher school – as if those have ever been proven to be better, but whatever! CA-CHING! CA-CHING! This is what you get from School Choice Week. It's a uniquely American experience – selling the loss of choice — as choice. And all the while they try to convince you that public schools are the ones that take away your alternatives. Yet public schools are where you get all those things you lose at privatized schools. You get elected school boards, open documents, open meetings, the right to self-government, the right of enrollment, quality services, quality teachers, diverse classmates, common sense discipline policies, an unbiased secular education, free time and money! That's right! You actually get all that and more money in your pocket! I'm not saying public schools are perfect. There are many ways they need to improve, but it's difficult to do so when many of the people tasked with improving these schools are more concerned with sabotaging them to make room for privatized systems. These are paid employees of the charter and voucher school movement who want to kill public schools – BUT THE KILLER IS ALREADY IN THE HOUSE! Imagine if we dedicated ourselves to making our public school system better! Imagine if we committed to giving parents and students more choices in the system and not trying to replace that system with one that gives all the benefits and choices away to corporate vultures! So, yeah, School Choice Week is a scam. But, hey, enjoy those yellow scarfs. Stupid Ass School Voucher Bill Back for Pennsylvania Vote Tomorrow October 23, 2017 stevenmsinger Accountability, church and state, Civil Rights, Corporate Education "Reform", Democrat, Education, Parents, Pennsylvania, Philadelphia, Philadelphia Schools, Pittsburgh Public Schools, Politics, Poverty, privatization, Propaganda, Republican, School Choice, School Funding, school vouchers, Schools, small class size, Students, Teachers church and state, John DiSanto, Pennsylvania, Politics, private schools, Privatize, School Choice, school vouchers, separation of church and state Close your eyes and imagine a school like the one where I teach. The public middle school is right next door to a Catholic middle school. Some of the wealthiest families send their kids to the religious school. The rest send their kids to the public school. Now imagine that the state passes a school voucher bill. Those wealthy families can now use public tax dollars to help fund their kids' Catholic school tuition. A truckload of taxpayer wealth would be redistributed away from the public school and into the religious one. And this is for children who weren't attending public school in the first place. Imagine what an impact that would have on the two schools. At the Catholic middle school, not much would change. At most a few more kids might enroll. And wealthy parents would get to pay less in tuition. At the public middle school, however, the results would be disastrous. It would have to survive on much less funding than it was already receiving. Services for the majority of students in the district would be degraded. Class sizes would balloon. Educational quality would take a nose dive. So why wouldn't more kids from the public school move to the Catholic one? Well, first of all, few kids in the district are Catholic. Should they be forced to be indoctrinated in a faith in which they don't believe? Second, tuition at the Catholic school costs more than the price of the voucher. Parents would have to pay above and beyond what they're paying now to make tuition at the Catholic school. And this is a mostly poor neighborhood. Parents simply can't afford it. THIS is the situation the Pennsylvania Education Committee will vote on tomorrow. The committee will decide whether State Sen. John DiSanto's school voucher bill should be voted on by the state Senate and House. School vouchers are not popular at both the national and state level. Around 70% of people across the country oppose school vouchers, according to the PDK-Gallup public opinion poll about U.S. education. Moreover, Harrisburg wastepaper baskets are lined with school voucher bills that fail to pass despite being introduced every few years. DiSanto's bill is called Education Savings Accounts for Students in Underperforming Schools or SB 2. And guess what!? It's almost exactly the same as a pile of similar bills offered by the American Legislative Exchange Council (ALEC). The Special Needs Scholarship Program Act, The Foster Child Scholarship Program Act, "Opportunity Scholarships," The Smart Start Scholarship Program – all ALEC bills that do almost the same thing. They designate some group of at risk students and say, "Hey, you know what they need? School vouchers!" Well, my goodness. I'm sure glad DiSanto didn't stress himself out writing something new. I'm certain his constituents wanted him to plagiarize someone else's bill and pretend like it was his own. And how exactly will spending public tax dollars on non-public schools help these kids succeed? That's never explained. Fools like DiSanto just pretend that it will help as a matter of faith. And since the overwhelming majority of school vouchers go to religious school coffers, this makes sense. It is a blatant violation of the separation of church and state. But privatization supporters don't give a crap about that. They don't care about the values on which this country where founded. Their only concern is doing what their rich donors demand. SB 2 would target students living in districts with the most underfunded schools serving the most impoverished populations. You know – "failing schools." If passed, kids living in these neighborhoods would have whatever the district sets aside for each student put in a savings account to be spent in almost any way parents see fit so long as they could somehow justify it as educational. Send your kids to a private or parochial school? Homeschool your child? Go on a trip to the life-sized replica of Noah's Ark in Williamstown, Kentucky? You betcha! And the best part is there is hardly any accountability built in to the law, so we probably wouldn't even know how this money was spent. Your tax dollars at work. Somehow. Somewhere. Out of sight. I guess that's what Pennsylvania Republicans like DiSanto call fiscal conservatism. If passed, the bill would affect 800 schools – the 15% lowest performing in the state – including mine. Take a look at the list. Every school serves mostly poor students. Every school is severely underfunded. Pennsylvania ranks 45th out of 50 for school funding. There are only five states in the country where the state government pays less of the cost of educating students. The Commonwealth relies on local municipalities to make up the difference. That means local property taxes, so the richer an area you live in, the more money it can afford to pay to educate children. The poorer an area where you live, the less it can pay. This is why Pennsylvania has the widest disparity between how much it spends on rich kids vs. poor ones. Wealthy children are cherished and coddled. Poor ones are left to fend for themselves. This voucher bill would only exacerbate the situation. It's a giveaway to those who don't need it at the expense of those who can least afford to pay. If you live in the Commonwealth, please call and/or write your state Senator and Representative and ask them to oppose this bill. Supreme Court Paves the Way to Taxing Churches June 27, 2017 stevenmsinger Accountability, church and state, Civil Rights, Corporate Education "Reform", Donald Trump, Education, Judicial Reform, Politics, privatization, Republican, School Choice, School Funding, school vouchers, Schools church and state, Politics, religion, Republicans, School Choice, school vouchers, separation of church and state, Supreme Court, Taxation Finally some good news! A U.S. Supreme Court decision yesterday pokes a hole in the separation of church and state. But that hole goes both ways. Justices ruled 7-2 that Missouri could not withhold tax dollars to resurface a playground at a church preschool simply on the grounds that it's a religious institution. Therefore, one can expect any day now a ruling that the church can't be exempted from paying taxes for the same reason. Here's the key issue. Traditionally, the government doesn't pay for the church. But now our highest court in the land has ruled that's discriminatory! Never mind that Missouri actually relented in this case and paid for the concrete anyway making the entire ruling moot and something that no other Supreme Court in history would have voted on because doing so would expose justices as being activists legislating from the bench. No. Now that Republicans stole the seat of President Barack Obama's rightful nominee, Merrick Garland, with President Donald Trump's nominee, Neil Gorsuch (i.e. Scalia 2.0), the court is a decidedly fascist institution. In other words, it's no longer a body of scholarly justices dedicated to interpreting the law. It's now a shell corporation of paid corporate lobbyists issuing justifications to support the mandates of the billionaire class. The five wealthiest people in the country have as much money as 750 million people – each. And most of these mega-rich want to destroy our public school system so they can hoover up tax dollars into their private portfolios. (Once you've got that much money, it's just a game where you're playing against other multi-billionaires to see who can get all the money, flip over the board and proclaim themselves King.) To do this, they need school vouchers to help destabilize the system. Chop it down, remove any pretense of accountability to taxpayers about how that money is being spent and then sweep up that sweet, sweet money. It also has the added benefit of ensuring the next generation is dumb enough to – I don't know – continue voting for reality TV stars as President. But that's just the most obvious implication. Now that the state has been shown to be responsible to support the church, the reverse has also been proven: the church has responsibilities to support the state. That's right. No more tax free status for houses of worship. Get ready to dig deep into your pockets, parishioners. Uncle Sam needs a new pair of shoes. Who's paying for all those needless wars of aggression? The Church Lady! That's who! Where are we going to get the money to keep up the counterproductive war on drugs? The collection plate! Yep. The assembled flock is about to get fleeced! What conservatives seem to forget is that the wall of separation between church and state wasn't erected just to protect the state from influence by religion. It also was set up to protect religion from the state. Once you have money flowing from one to the other, regulations are soon to follow. Expect your cute little parochial school to put away the Bible and replace it with "The Origin of Species". What? Your faith compels you to believe in the Creation of Man by God and not scientific evolution of organisms through heritable traits? I guess you'll just have to teach the controversy. Some people in America still think that there's value in having both public and private schools. They seem to think that it's actually a benefit having school systems where people are taught differently. But this new ruling paves the way (pun intended) to breaking down the walls between each type of institution. Yes, public schools will become more like religious schools. But religious schools will also become more like public schools. The entire education system will become one big watered down whole. And – giggle – those pushing for it actually call the process "School Choice"! Oh the plutocrats will do their best to cover it all up with culture war nonsense. You'll hear hours of cable news blather about poor conservative bakers fighting not to make cupcakes for gay people. But behind this high profile grist for the mill will be active efforts at homogenization, government overreach and oligarchy. There's one way in which this is good news. Some people have always thought churches were getting off easy, that they were being allowed undue influence on politics without having to pay the entrance fee of taxation like the rest of us. However, this was only ever true at some houses of worship. Others were dedicated to spirituality, community and charity while eschewing affairs of state altogether. This new ruling rips away protections from those authentically beneficent congregations as it does those more politically inclined. It exposes the preacher and the partisan equally. Moreover, anyone who doesn't want their tax dollars supporting someone else's religious beliefs can expect their cries to fall on deaf ears. Christians will fund Muslims and Jews will fund Christians and all will pay for the Church of Satan and whatever sect is formed to take advantage of this brave new source of tax revenue. Religion is now decidedly in the public domain and all that goes with it. The results are bound to displease everyone – except the mega-rich. In short, you can't tear down the rules that were set up to protect everyone without opening us all up to ruin. America's religious people are about to find that out. It's almost poetic justice. Get ready to reap what you sow. Betsy's Choice: School Privatization Over Kids' Civil Rights June 7, 2017 June 8, 2017 stevenmsinger Accountability, Betsy DeVos, Budget, Campaign Donations, capitalism, Charter Schools, Civil Rights, Congress, Corporate Education "Reform", Democrat, Donald Trump, Education, Obama, Politics, Prejudice, President, privatization, Racism, Republican, School Choice, School Funding, school vouchers, Schools, Sexism, Teachers Betsy DeVos, charter schools, children, church and state, Civil Rights, Donald Trump, LGBT, Privatize, Republicans, School Choice, school vouchers Betsy DeVos seems to be confused about her job. As U.S. Secretary of Education, she is responsible for upholding the civil rights of all U.S. students. She is NOT a paid lobbyist for the school privatization industry. Yet when asked point blank by Sen. Jeff Merkley (D-Ore.) whether her department would ensure that private schools receiving federal school vouchers don't discriminate against lesbian, gay, bisexual, transgender and queer (LGBTQ) students, she refused to give a straight answer. She said that the these schools would be required to follow all federal antidiscrimination laws but her department would not issue any clarifications or directives about exactly how they should be doing it. "On areas where the law is unsettled, this department is not going to be issuing decrees. That is a matter for Congress and the courts to settle," DeVos said at a hearing before the Senate Appropriations Subcommittee on Labor, Health and Human Services, and Education yesterday. "I think you just said where it's unsettled, such discrimination will continue to be allowed under your program. If that's incorrect, please correct it for the record," Merkley replied. DeVos did not correct him. Instead she simply repeated, "Schools that receive federal funds will follow federal law, period." Merkley said she was dodging the question. "I think that's very important for the public to know, that today, the secretary of education, before this committee, refused to affirm that she would put forward a program that would ban discrimination based on LGBTQ status of students or would ban discrimination based on religion," he said. "Discrimination in any form is wrong. I don't support discrimination in any form," DeVos replied. But that doesn't mean she'll fight against it. She held firm to her position that it is not her job as Secretary of Education to fight for students' civil rights. That is the responsibility of Congress and the courts. But she's wrong. The Office for Civil Rights (OCR) is part of the Department of Education. According to the department's own Website, the "OCR's mission is to ensure equal access to education and to promote educational excellence through vigorous enforcement of civil rights in our nation's schools." There is nothing "unsettled" about that at all. What IS unsettled is how and if the U.S. Constitution allows federal funds to be spent on private schools in any manner whatsoever. At very least, it has been argued that giving tax dollars to parochial schools violates the establishment clause of the First Amendment guaranteeing a separation of church and state. Moreover, the degree to which voucher schools that don't explicitly teach religion would have to abide by federal laws about what they can and should do is likewise "unsettled." Yet DeVos has no problem advocating for the school privatization industry. In fact, it has been her lifelong calling. As a billionaire Republican mega-donor, that's exactly what she's done for years – shoving bundles of cash at candidates and lawmakers to support school vouchers and charter schools. Someone needs to remind her that that is no longer her role. In her official capacity as Secretary of Education, her job is not to advocate for school choice. But it IS her job to protect students' civil rights – regardless of the type of school those students attend. If a school is at all public, she is responsible for ensuring those students' rights. And receiving public funds makes a school public. Specifically, she is responsible for ensuring no child is discriminated against on the basis of race, color and national origin, according to Title VI of the Civil Rights Act of 1964. This includes protecting children who are being treated unfairly due to limited understanding of the English language or who are still learning to speak the language. This includes children experiencing bigotry as a result of their shared ancestry, ethnicity or religion such as Muslims, Sikhs or Jews. It is also her job to protect children from sexual discrimination as per Title IX of the Education Amendments of 1972. No matter her own personal conservative views, she must protect pregnant teens or teen parents. And to speak toward Merkley's point, according to the Department's Website, this explicitly includes, "…sex stereotypes (such as treating persons differently because they do not conform to sex-role expectations or because they are attracted to or are in relationships with persons of the same sex); and gender identity or transgender status." She is also required to be a champion of students with disabilities as per Section 504 of the Rehabilitation Act of 1973 and Title II of the Americans with Disabilities Act of 1990. Moreover, Title II explicitly forbids public entities – whether or not they receive federal funds – from demonstrating any partiality against students with disabilities. And that's just the tip of the iceberg. She has to protect against age discrimination per the Age Discrimination Act of 1975 and enforce the Boy Scouts of America Equal Access Act. She is responsible for investigating complaints about equal access to youth groups conducting meetings at public schools and/or that receive federal funding. To quote the Website, one more time: "These civil rights laws extend to all state education agencies, elementary and secondary school systems, colleges and universities, vocational schools, proprietary schools, state vocational rehabilitation agencies, libraries and museums that receive federal financial assistance from ED [the Education Department]." I'm not so sure DeVos understand this – at all. Nor do I expect her to get much help from the political ideologues she's using to staff the department. Take her choice for Assistant Secretary in the Office for Civil Rights, Candice Jackson. She's an ANTI-Civil Rights activist. She literally doesn't believe in the office she's running. The 39-year-old attorney is anti-women's rights, anti-distributive justice and possibly even anti-compulsory education and anti-Civil Rights Act of 1964! She once filed a complaint against her prestigious college, Stanford University, for discriminating against her rights as a rich, white person by refusing to allow her access to free minority tutoring. For all its faults, the Barack Obama administration took civil rights seriously. So much so that conservatives often criticized the Democratic organization as being overzealous in the execution of its duties. The Obama era Education Department issued so many clarifications of the law that it received a record number of civil rights complaints. This required hundreds of additional lawyers and investigators and increasing the civil rights division by 30 percent. Complaints went from more than six thousand in 2009 to almost ten thousand in 2015. Of these, the largest increase was in complaints of sex discrimination. However, President Donald Trump has recommended the Department be downsized in his budget proposal. The Reality TV star would cut the Department's budget by 13 percent, or $9 billion, eliminating after-school and summer programming for kids and professional development for teachers. Instead, he would invest $250 million in a school voucher incentive program and an additional $168 million for charter schools. Also, getting a boost is personal security for DeVos, herself. She is spending an additional $1 million a month for U.S. Marshalls to guard her against protesters. It should come as no surprise that Trump and DeVos don't support the mission of the Department of Education. Both have expressed interest in disbanding the office altogether. In a February magazine interview, DeVos said, "It would be fine with me to have myself worked out of a job. But I'm not sure that – I'm not sure that there will be a champion movement in Congress to do that." Likewise, Trump wrote in his 2015 book "Great Again: How to Fix Our Crippled America" that "if we don't eliminate [the department] completely, we certainly need to cut its power and reach." That is exactly what DeVos is doing. Under Presidents George W. Bush and Obama, it could be argued the Department was guilty of overreach. But Trump and DeVos are going in the opposite extreme. Someone has to look out for students' civil rights. That someone has traditionally been the Department of Education. With DeVos abdicating her responsibilities and continuing her role as a school privatization cheerleader, it is anyone's guess who – if anyone – will step into the void. Charter Schools and Voucher Schools are Virtually Identical May 18, 2017 stevenmsinger Accountability, Betsy DeVos, Budget, Campaign Donations, Charter Schools, Corporate Education "Reform", Cyber Charter Schools, Democrat, Donald Trump, Education, Obama, Politics, Prejudice, President, privatization, Propaganda, Republican, School Choice, School Funding, school vouchers, Schools, Standardized Testing, Teachers Betsy DeVos, charter schools, church and state, Democrats, Donald Trump, education, neofascist, neoliberal, Politics, Privatize, rebranding, Republicans, school vouchers The stark orange monolith that was Donald Trump is starting to crumble. And with it so are the dreams of corporate education reformers everywhere. Where in previous administrations they could pass off their policies as Democratic or Republican depending on whichever way the wind blows, today their brand has been so damaged by Trump's advocacy, they fear it may never recover. Under Presidents George W. Bush and Barack Obama, they could champion both charter schools and school vouchers with impunity. But now the privatizers and profiteers hiding in progressive clothing are trying desperately to rebrand. Not only is Trump's voucher plan deeply unpopular, but the public has already begun to associate any kind of school privatization with a doomed President. So like cockroaches, neoliberals have begun to skitter to one type of privatization over another. Fake Democrats hide beneath unfettered charter school expansion. Bought-and-sold Republicans cling to the idea that we should spend taxpayer dollars on private and parochial schools. But is there a real substantial difference between each of these so-called "choice" schemes? Or are they both just scams when compared with traditional public schools? Charter Schools and Private Schools are basically the same thing. The biggest difference between the two is funding. Charter schools are completely funded by tax dollars. Private schools – even when school vouchers are used – often need to be subsidized by parents. For instance, many private schools charge tuition of $30,000 – $40,000 a year. Vouchers rarely provide more than $6,000. So at best they bring the cost down but still make it impossible for most students to attend private schools. Sure they may start as an effort to allow only impoverished children to use tax dollars towards private and parochial school tuition. But they soon grow to include middle class and wealthy children, thus partially subsidizing attendance at the most exclusive schools in the country for those families who can already afford it. Parochial schools, meanwhile, are exactly the same except for one meaningful difference. They teach religion. Their entire curriculum comes from a distinctly religious point of view. They indoctrinate youth into a way of seeing the world that is distinctly non-secular. Progressives complain that using tax dollars to pay for student tuition at such schools – even only partial tuition – violates a foundational principal of our nation. Using public money to pay for religious teaching has historically been interpreted as a violation of the establishment clause of the first Amendment to the Constitution – namely, "Congress shall make no law respecting an establishment of religion, or prohibiting the free exercise thereof…" Thomas Jefferson called it "a wall of separation between Church and State." This is further exacerbated in many parochial schools where religious teaching includes a blatant political bias toward conservatism. Children at many of these schools are taught that supply side economics, voter disenfranchisement and prejudice are normative bedrock truths. These are the main distinctions between voucher and charter schools. In short, they're not all exactly the same. And corporate reform apologist are trying to rebuild their brand on these split hairs. But the similarities between these types of school are much more striking. THE SIMILARITIES The biggest commonality between these types of educational institutions is how they're run. Unlike traditional public schools – which are governed by duly-elected school boards – charter, private and parochial schools are overseen by private interests. They are administered by independent management firms. They rarely have elected school boards. Their operators rarely make decisions in public, and their budgets and other documents are not open to review by taxpayers. This is true despite the fact that they are funded to varying degrees by public tax dollars. So in all three cases, these schools are run privately, but taxpayers pick up the tab. It's ironic. Sending kids to charters, private and parochial schools with public money is called school choice. However, each of these types of schools gives taxpayers much less choice about how their money is being spent. The community funds the school, but almost all decisions are made by people outside of the community – people appointed, in fact, by bureaucrats or business managers. To be sure, parents can express their displeasure of administrative decisions by disenrolling their children in the school. But beyond this nuclear option, they are powerless. Even more troubling, taxpayers without children or with children who do not attend these schools have no say whatsoever about how their money is spent. And to add insult to injury, it doesn't even really allow the parents to choose which schools their children attend. They can put in a request for their kids to attend a choice school, but enrollment decisions are made by these same private equity managers. In short, administrators make the ultimate choice – not parents. If the religious school doesn't want to accept your child for whatever reason including operators' disapproval of your religious beliefs, they don't have to accept him. If the private school doesn't want to accept your child based on race, gender or nationality, they don't have to accept him. If the charter school doesn't want to accept your child because of bad grades or troublesome behaviors, they don't have to accept him. The traditional public school, however, cannot refuse a child who lives in district borders for any of these reasons. In effect, school choice really isn't about parental choice. It's about increasing choice for the operators of privatized schools – letting them choose their students and how to spend your money without any meaningful input from you. And it's true at all three types of school! Those are pretty considerable similarities. Moreover, they highlight major differences between these so-called choice schools and traditional public schools. This is important because we don't even have to get into the academic records of individual schools. The way each type of school is structured shows the clear inferiority of choice schools compared to traditional public schools. By their very structure, public schools give parents and taxpayers much more agency in children's education and how taxpayer money is spent. Second, the latitude for school administrators to perpetrate fraud on the public is maximized in so-called choice schools and minimized in public schools. This doesn't mean public schools are perfect, but it is much better to have a school under public scrutiny and local control than otherwise. This is demonstrated by the huge numbers of charter school scandals popping up in the news every day, where charters close suddenly, money is misspent on luxury items for operators that have nothing to do with education, and – especially in cyber charters – the quality of education students receive is literally lower than having no formal education at all. Finally, if public schools struggle, it is almost always due to a lack of equitable funding and a surplus of impoverished students. It is no accident that poor students receive less resources and larger class sizes than middle class or wealthy ones. Nor is it an accident that we judge the effectiveness of schools primarily on standardized tests which are so good at highlighting the results of lack of resources rather than any academic deficiency. If we spent our education dollars ensuring equitable resources instead of funneling tax dollars to charter, private and parochial schools, we would better increase the quality of children's education. But for the last few decades that has not been the goal of education policy. It has instead been to enrich these same privatized school managers and investors – the corporate education reform industry. Nor is it a coincidence that this industry and its subsidiaries counts itself as major donors to both political parties. Before she was elevated to Education Secretary, Betsy DeVos was exactly that – a billionaire mega-donor pushing school privatization while getting richer off investments in the same. Now that she's driving school vouchers off a cliff in the Trump train, her co-conspirators are getting nervous. Neoliberal Democrats may try to save the movement by claiming charter schools are completely different. But they aren't. They are fundamentally the same. The public sees the clear similarities between these kinds of schools. And much of that is thanks to the incompetent boobery of Donald J. Trump.

<?php namespace Phalcon\Logger { /** * Phalcon\Logger\Item * * Represents each item in a logging transaction * */ class Item { protected $_type; protected $_message; protected $_time; protected $_context; /** * \Phalcon\Logger\Item constructor * * @param string $message * @param integer $type * @param integer $time */ public function __construct($message, $type, $time=null){ } /** * Returns the message * * @return string */ public function getMessage(){ } /** * Returns the log type * * @return integer */ public function getType(){ } /** * Returns log timestamp * * @return integer */ public function getTime(){ } public function getContext(){ } } }

Q: Force page refresh and jump to a #section It seems that I must be missing something completely elementary. What I'm trying to achieve looks like quite a common case, and so it makes me wonder why there is no straightforward way. The problem is that I would like to refresh the current page from JavaScript and simultaneously land on a #section. If I do simply: document.location.href = document.location.href + "#section"; all browsers I tested just scroll to that #section (no reload). It makes sense in a way. Just for completeness, if I do document.location.assign(document.location.href + "#section"); it does the same thing (not surprisingly; it boils down internally to the same function for sure). Finally, the document object seems to have also the document.reload() function which takes an optional boolean argument specifying whether I want to force the reload, but obviously, it does not allow to specify the #section. The only way I could find (using these methods) was the following combination: document.location.assign(document.location.href + "#section"); document.location.reload(); But it is not ideal, because as you have probably guessed, it scrolls and then reloads which causes the browser to actually scroll three times in the end. I know that there are ways around it: server side redirect or adding some unique random query string parameter, but it seems strange that there is no simple way. A: That is the "hash" value of the location object. You need to set it like this... location.hash = "#section"; If that does not work consistently, you might want to consider using a scrollToElement function... function scrollToElement(elem) { if(typeof elem == 'string') elem = document.getElementById(elemId); var top = 0; if(elem) { if(elem.offsetParent) { top = elem.offsetTop; while(elem = elem.offsetParent) { top += elem.offsetTop; } } window.scrollTo(0, top); } } If you absolutely need a page reload (not sure why you ever would), try opening a window in itself... window.open(location.href + '#section', '_top'); Or try replace... location.replace(location.href + '#section'); A: There is a much much simpler solution: if (document.location.href.match(/[?]/)) document.location.href = document.location.href + '&fake_param=' + Math.random() + '#section' ; else document.location.href = document.location.href + '?fake_param=' + Math.random() + '#section' ;

\subsection{Deligne's category $\mathop{\underline{\smash{\mathrm{Rep}}}}(GL_t)$} From the perspective of the Killing-Cartan-Weyl classification of simple Lie algebras and their representation theory in terms of highest weights, root systems, Weyl groups and associated combinatorics it is not so easy to understand the extreme uniformity in the representation theory that exists among different Lie groups. With possible application to a universal Chern-Simons type knot invariant in mind, P. Vogel \cite{Vog1999} tried to define a universal Lie algebra, $\mathfrak{g}(\alpha:\beta:\gamma)$ depending on three {\em Vogel parameters} that determine a point $(\alpha:\beta:\gamma)$ in the {\em Vogel plane}, in which all simple Lie algebras find their place. The dimension of the Lie algebra $\mathfrak{g}(\alpha:\beta:\gamma)$ is given by a universal rational expression \begin{equation*} \dim \mathfrak{g}(\alpha:\beta:\gamma)\, = \, \frac{(\alpha-2t)(\beta-2t)(\gamma-2t)}{\alpha\beta\gamma},\qquad t=\alpha+\beta+\gamma , \end{equation*} and similar universal rational formulas can be given for the dimensions of irreducible constituents of $S^2\mathfrak{g}, S^3\mathfrak{g}$ and $S^4\mathfrak{g}$. Although the current status of Vogel's suggestions is unclear to us, these ideas have led to many interesting developments, such as the discovery of $E_{7\frac{1}{2}}$ by Landsberg and Manivel, \cite{LM2002}, \cite{LM2004}, \cite{LM2006}, \cite{LM2006a}, \cite{LM2006a}. In order to interpolate within the classical $A,B,C,D$ series of Lie algebras, Deligne has defined $\otimes$-categories \[ \mathop{\underline{\smash{\mathrm{Rep}}}}(GL_t),\;\; \mathop{\underline{\smash{\mathrm{Rep}}}}(O_t), \] where $t$ is a parameter that can take on any complex value. (The category $\mathop{\underline{\smash{\mathrm{Rep}}}}(Sp_{2t})$ is usually not discussed as it can be expressed easily in terms of the category $\mathop{\underline{\smash{\mathrm{Rep}}}}(O_T)$ with $T=-2t$.) If $n$ is an integer, there are natural surjective functors \[\mathop{\underline{\smash{\mathrm{Rep}}}}(GL_n) \to \mathop{\mathrm{Rep}}(GL_n)\] In the tannakian setup one would attempt to reconstruct a group $G$ from its $\otimes$-category of representations $\mathop{\mathrm{Rep}}(G)$ using a fibre functor to the $\otimes$-category $Vect$ of vector spaces, but Deligne's category has no fibre functor and is not tannakian, or, in general, even abelian. (However, when $t$ is not an integer, the category \emph{is} abelian semisimple.) According to the axioms, in an arbitrary rigid $\otimes$-category $\mathcal{R}$ there exist a unit object~${\bf 1}$ and canonical evaluation and coevaluation morphisms \[ \epsilon: V \otimes V^* \to {\bf 1},\qquad \delta: {\bf 1} \to V \otimes V^*\] so that we can assign to any object a dimension by setting \[ \dim V =\epsilon \circ \delta \in \mathop{\mathrm{End}}({\bf 1}) \in \mathbb{C}. \] A simple diagrammatic description of $\mathop{\underline{\smash{\mathrm{Rep}}}}(GL_t)$ can be found in \cite{CW2012}. One first constructs a skeletal category ${\mathop{\underline{\smash{\mathrm{Rep}}}}\,}_0(GL_t)$, whose objects are words in the alphabet $\{\bullet, \circ\}$. The letter $\bullet$ corresponds to the fundamental representation $V$ of $GL_t$, $\circ$ to its dual $V^*$. A~$\otimes$-structure is induced by concatenation of words. The space of morphisms between two such words is the $\mathbb{C}$-span of a set of admissible graphs, with vertices the circles and dots of the two words. Such an admissible graph consists of edges between the letters of the two words. Each letter is contained in one edge. Such an edge connects different letters of the same word or the same letter if the words are different. $$\vcenter{ \xymatrix{ \bullet \ar@/_2ex/@{-}[rr] & \bullet \ar@{-}[ld] & \circ & \circ \ar@{-}[d] \\ \bullet \ar@{-}[rrd] & \circ \ar@/^/@{-}[r] \ar@/_/@{-}[r]& \bullet & \circ \ar@{-}[lld] \\ & \circ & \bullet & \\ } } = t \cdot \left( \vcenter{ \xymatrix{\bullet \ar@/_2ex/@{-}[rr] & \bullet \ar@{-}[ddr] & \circ & \circ \ar@{-}[ddll] \\ & & \\ & \circ & \bullet & \\ }} \right) $$ The composition is juxtaposition of the two graphs, followed by the elimination of loops, which results in a factor $t$.\\ Deligne's category is now obtained by first forming its additive hull by introducing formally direct sums and then passing to the Karoubian hull, i.e. forming a category of pairs $(W,e)$, consisting of an object together with an idempotent: \[\mathop{\underline{\smash{\mathrm{Rep}}}} (GL_t) =({\mathop{\underline{\smash{\mathrm{Rep}}}}\,}_0(GL_t)^{\text{add}})^\text{Karoubi}. \] \bf Example. \rm Consider the word $\bullet \bullet$ and the morphisms $\mathrm{Id}$ and $\mathrm{Swap}$ with the obvious meaning. One then can put \[ S^2V=(\bullet \bullet, s), \;\;\wedge^2 V=(\bullet\bullet, a),\] where \[ s=\frac{1}{2}(\mathrm{Id}+\mathrm{Swap}),\;\;a=\frac{1}{2}(\mathrm{Id}-\mathrm{Swap})\] so that in $\mathop{\underline{\smash{\mathrm{Rep}}}}(Gl_t)$ one has: \[ V \otimes V=(\bullet \bullet ,Id)=S^2V \oplus \wedge^2V,\] which upon taking dimensions is the identity \[ t^2 = \frac{t(t+1)}{2}+\frac{t(t-1)}{2} .\] \subsection{`Spaces of sections' as objects in Deligne's category and the beta integral.} As above, we assume that $n$ is a natural number. Write $t=N+1$ and let $V_t=V$ be the fundamental object of $\mathop{\underline{\smash{\mathrm{Rep}}}}(GL_t)$ so that $\dim V_t=t$. We do not define the projective space $\P =\P^N$, but we can pretend that, in the sense of Deligne, the space of global sections is \[ H(\mathcal{O}_{\P}(n)) :=\mathop{\mathrm{Sym}^n}(V_t^*) \in \mathop{\underline{\smash{\mathrm{Rep}}}}(GL_t) .\] Its dimension is then, as expected \begin{equation} \chi(\mathcal{O}_{\P}(n)) :=\dim H (\mathcal{O}_{\P}(n))={N+n \choose n} \label{chi-interpret}, \end{equation} (interpreted in the obvious way as a polynomial in $N$ if $N\not\in\mathbb{Z}$), so that e.g. \[\chi(\mathcal{O}_{\P^{1/2}}(2))=\frac{3}{8}.\] The Poincar\'e series \[P(y):=\sum_{n=0}^{\infty} \chi(\mathcal{O}_{\P}(n)) y^n =\frac{1}{(1-y)^{N+1}},\] which is consistent with the idea that $\dim V_t = N+1$. \medskip Returning to the question posed at the beginning, `is there a way to extend the interpolation of $\chi$ individually to the Chern and the Todd ingredients?', we reason as follows. If $X$ is a smooth projective $n$-dimensional variety, and $E$ a vector bundle on $X$, then the Euler characteristic \[\chi(X,E):=\sum_{i=0}^n (-1)^i\dim H^i(X,E)\] can be expressed in terms of characteristic numbers \[\chi(X,E)=\int_X \mathop{\mathrm{ch}}(E) \cdot \mathop{\mathrm{td}}(X) . \] Here the integral in the right hand side is usually interpreted as resulting from evaluating the cap product with the fundamental class $[X]$ on the cohomology algebra $H^*(X)$, and the Chern character and Todd class are defined in terms of the Chern roots $x_i$ of $E$ and $y_i$ of $TX$: \[\mathop{\mathrm{ch}}(E)=\sum_{i=1}^r e^{x_i}\,, \qquad \mathop{\mathrm{td}}(X)=\prod_{i=1}^n \frac{y_i}{1-e^{-y_i}} .\] The cohomology ring of an $n$-dimensional projective space is a truncated polynomial ring: \[H^*(\P^N)=\mathbb{Z}[\xi]/(\xi^{N+1})\,, \qquad\xi=c_1(\mathcal{O}(1)),\] and it is not directly clear how to make sense of this if $N$ is not an integer. Our tactic will be to drop the relation \[\xi^{N+1}=0\] altogether, thinking instead of $\mathbb{Z}[\xi]$ as a Verma module over the $sl_2$ of the Lefschetz theory, and replacing taking the cap product with integration. As we will be integrating meromorphic functions in $\xi$, the polynomial ring is too small, and we put \[ \hat{H}(\P) :=\mathbb{Z}[[s]] \supset \mathbb{Z}[s] .\] One has \[ \chi(\mathcal{O}(n))=e^{n\xi}\,, \qquad \mathop{\mathrm{td}}(\P)=\left(\frac{\xi}{1-e^{-\xi}}\right)^{N+1}, \] so Hirzebruch-Riemann-Roch reads \[\chi(\mathcal{O}(n))=\left[e^{n\xi} \left(\frac{\xi}{1-e^{-\xi}}\right)^{N+1}\right]_N\] where $[...]_N$ is the coefficient at $\xi^N$ in a series. This can be expressed analytically as a residue integral along a small circle around the origin: \begin{equation*} \chi(\mathcal{O}(n))=\frac{1}{2\pi i}\oint e^{n \xi}\left(\frac{\xi}{1-e^{-\xi}}\right)^{N+1}\frac{d\xi}{\xi^{N+1}} . \end{equation*} As it stands, it cannot be extended to non-integer $N$ since the factor $(1- e^{-\xi})^{-N-1}$ is not univalued on the circle. The usual way to adapt it is to consider, for $n \ge 0$, the integral along the path going from $- \infty - i \varepsilon$ to $ - i \varepsilon$, making a half--turn round the origin and going back, and choosing the standard branch of the logarithm. Because of the change in the argument this integral is equal to \begin{equation*} J(N,n) = \frac{e^{2 \pi i (N+1)}-1}{2 \pi i} \int_{-\infty}^0 \frac{e^{n \xi}}{(1-e^{-\xi})^{N+1}} d \xi , \end{equation*} or, after the substitution $s=e^{\xi}$, \begin{equation*} J(N,n) = \frac{e^{2 \pi i (N+1)}-1}{2 \pi i} \int_0^1 s^{n-1} (1-1/s)^{-N-1} ds = \frac{\sin \pi (N+1)}{ \pi } \int_0^1 s^{n+N} (1-s)^{-N-1} ds . \end{equation*} Using Euler's formulas \begin{equation} \Gamma(x)\Gamma(1-x) =\frac{\pi}{\sin \pi x} \,, \label{gamma-one-minus-argument} \end{equation} \begin{equation} \int_0^1 s^{\alpha-1}(1-s)^{\beta-1} ds = \frac{\Gamma(\alpha)\Gamma(\beta)}{\Gamma(\alpha+\beta)} \,, \label{beta-integral} \end{equation} and \begin{equation*} \frac{\Gamma(N+n+1)}{\Gamma(n+1) \Gamma(N+1)} = {N+n \choose n} \,, \end{equation*} we arrive at a version of RRH `with integrals': \medskip \noindent \bf Proposition 1. \rm Let $n \in \mathbb{N}$. Assume $\mathop{\mathrm{Re}} N < 0, \, N \notin \mathbb{Z}$. Interpret the Euler characteristic of~$\P ^N$ via formula \eqref{chi-interpret}. Then \begin{equation*} \label{little-propo} \chi_\P(\O (n)) = \frac{e^{2 \pi i (N+1)}-1}{2 \pi i} \int_{-\infty}^0 \frac{e^{n \xi}}{(1-e^{-\xi})^{N+1}} d \xi . \end{equation*} \qed \bigskip \medskip \subsection{The grassmannian and the Selberg integral.} For $\P^N$, we ended up with the beta function, a one-dimensional integral, as the cohomology ring is generated by a single class~$\xi$. In the cases where the cohomology ring is generated by $k$ elements, for example the grassmannian $G(k,N+k)$, we would like to see a $k$-dimensional integral appear in a natural way. For $N \in \mathbb{N}$ the cohomology ring of the grassmannian $\mathbb{G}:=G(k,N+k)$ is given by \[H^*(G(k,N+k))=\mathbb{C}[s_1,s_2,\ldots,s_k]/(q_{N+1},q_{N+2}, \dots, q_{N+k}),\] where the $s_i$ are the Chern classes of the universal rank $k$ sub-bundle and $q_i=c_i(Q)$ are formally the Chern classes of the universal quotient bundle $Q$ (so that the generating series of $q$'s is inverse to that of $s$'s). In the same vein as before, we set: \begin{equation} \hat{H}^*(\mathbb{G}):=\mathbb{C}[[s_1,s_2,\ldots,s_k]]=\mathbb{C}[[x_1,x_2,\ldots,x_k]]^{S_k} \label{drop-rel} \end{equation} by dropping the relations. A $\mathbb{C}$-basis of this ring given by the Schur polynomials \[\sigma_{\lambda} :=\frac{\det(x_i^{\lambda_j+k-j})}{\det(x_i^{k-j})}\] where $\lambda=(\lambda_1,\lambda_2,\ldots,\lambda_k)$ is an arbitrary Young diagram with at most $k$ rows. There is a Satake--type map for the extended cohomology: \[ \mathrm{Sat}: \hat{H}(\mathbb{G}) \to \wedge^k \hat{H}(\P) \] obtained from the Young diagram by `wedging its rows': \[\sigma_{\lambda} \mapsto s^{\lambda_1+k-1} \wedge s^{\lambda_2+k-2}\wedge \ldots \wedge s^{\lambda_k-1}. \] We are therefore seeking an expression for the values of the Hilbert polynomial of $G(k,N)$ in terms of a $k$--dimensional integral of the beta type involving $k$--wedging. Euler's beta integral \eqref{beta-integral} has several generalizations. Selberg introduced \cite{Selberg1944} an integral \cite{FW2008} over the $k$-dimensional cube \begin{equation*} S(\alpha, \beta,\gamma, k):=\int_0^1\ldots\int_0^1 (s_1 s_2\ldots s_k)^{\alpha-1}((1-s_1)(1-s_2)\ldots(1-s_k))^{\beta-1}\Delta(s)^{2\gamma} ds_1ds_2\ldots ds_k \end{equation*} where \[ \Delta(s)=\Delta(s_1,s_2,\ldots,s_k)=\prod_{i <j} (s_i-s_j) ,\] and showed that it admits meromorphic continuation, which we will also denote by $S$. \medskip \noindent {\bf Proposition 2.} For $k \in \mathbb{N},\, n \in \mathbb{Z}_+$, let $\chi(\mathcal{O}_{\mathbb{G}}(n))$ denote the result of interpolating the polynomial function $\chi(\mathcal{O}_{G (k,k+N)}(n))$ of the argument $N \in \mathbb{N}$ to $\mathbb{C}$. One has \begin{equation*} \chi(\mathcal{O}_{\mathbb{G}}(n))= \frac{(-1)^{k(k-1)/2}}{k!}\left( \frac{\sin \pi(N+1)}{\pi}\right)^k S(n+N+1,-N-k+1;1,k) . \end{equation*} \rm {\sc Proof.} The shortest (but not the most transparent) way to see this is to use the expressions for the LHS and the RHS in terms of the product of gamma factors found by Littlewood and Selberg respectively. By Selberg, \begin{equation} S(\alpha,\beta,\gamma,k)=\prod_{i=0}^{k-1} \frac{\Gamma(\alpha+i\gamma)\Gamma(\beta+i\gamma)\Gamma(1+(i+1)\gamma)} {\Gamma(\alpha+\beta+(k+i-1)\gamma) \Gamma(1+\gamma)} \label{Selberg-formula}. \end{equation} By Littlewood \cite{Lit1942}, for $N \in \mathbb{Z}_{>0}$ one has \begin{equation*} \chi(\mathcal{O}_{G(k,k+N)}(n)) =\frac{{N+n \choose n} {N+n+1 \choose n+1} \ldots {N+n+(k-1) \choose n+(k-1)}}{ {N \choose 0} {N+1 \choose 1} \ldots {N+(k-1) \choose (k-1)}}, \end{equation*} where there are $k$ factors at the top and the bottom. Rearranging the terms in the RHS of \eqref{Selberg-formula} and using \eqref{gamma-one-minus-argument}, we bring the $\Gamma$-factors that involve $\beta$ to the denominator in order to form the binomial coefficients at the expense of the sine factor. \qed \bigskip As an example, for $k=2$ and $N=-1/2$, we get the Hilbert series \[ \sum_{k=0}^\infty \chi(\mathcal{O}_{G(2,3/2)}(n)) \, y^n = 1+6\, \frac{t}{16} +60\left(\frac{t}{16}\right)^2 + 700 \left(\frac{t}{16} \right)^3+8820 \left(\frac{t}{16} \right)^4 +\ldots \] which is no longer algebraic, but can be expressed in terms of elliptic functions. More generally, one can consider a Selberg--type integral with an arbitrary symmetric function rather than the discriminant in the numerator and use separation of variables together with the Jacobi--Trudi formula in order to obtain similar expressions in terms of the gamma function in order to interpolate between the Euler characteristics of more general vector bundle on grassmannians (or the dimensions of highest weight representations of $GL_{N+k}$). \subsection{Towards a gamma conjecture in non--integral dimensions.} \label{gamma-phenomena} The by now standard predictions of mirror symmetry relate the RRH formalism on a Fano variety $F$ to the monodromy of its regularized quantum differential equation. It is expected that this differential equation arises from the Gauss--Manin connection in the middle cohomology of level hypersurfaces of a regular function $f$ defined on some quasiprojective variety (typically a Laurent polynomial on $\mathbb{G}_\mathrm{m}^{\, d}$), called in this case a Landau--Ginzburg model of $F$. By stationary phase, the monodromy of the Gauss--Manin connection in a pencil translates into the asymptotic behavior of oscillatory integrals of the generic form $I (z) = \int \exp (izf)\, d\mu (\mathbb{G}_\mathrm{m}^{\, d})$, which satisfy the quantum differential equation of $F$, this time without the word `regularized'. The asymptotics are given by Laplace integrals computed at the critical points, and the critical values of $f$ are the exponents occurring in the oscillatory integrals $I_i(z)$ that have `pure' asymptotic behavior in sectors. One wants to express these pure asymptotics in terms of the Frobenius basis of solutions $\{ \Psi_i (z) \}$ around $z = 0$. The gamma conjecture \cite{GGI2016} predicts that such an expression for the highest--growth asymptotic (arising from the critical value next to infinity) will give the `gamma--half' of the Todd genus and therefore effectively encode the Hilbert polynomial of $F$ with respect to the anticanonical bundle. At first sight, none of this seems capable of surviving in non--integer dimensions. Yet, to return to the example of $G(2,N+2)$, define the numbers $c_j$ and $d_j$ by the expansions \begin{equation*} \Gamma_\P^{(0)} (\varepsilon) = \Gamma (1+\varepsilon)^{N+2} = \sum_{j=0}^\infty d_j \varepsilon^j , \end{equation*} \begin{equation*} \Gamma_\P^{(1)} (\varepsilon) = \Gamma (1+\varepsilon)^{N+2} e^{2 \pi i \varepsilon} = \sum_{j=0}^\infty c_j \varepsilon^j. \end{equation*} Put \begin{equation*} F(\varepsilon,z) = \sum_{k=0}^{\infty} \frac{z^{l+\varepsilon}}{\Gamma(1+l+\varepsilon)^{N+2}} \end{equation*} and \begin{equation*} \Psi (\varepsilon,z) = \Gamma_\P (\varepsilon) F (\varepsilon, z) = \sum_{k=0}^\infty \Psi_k (z) \varepsilon^k. \end{equation*} \medskip \noindent \bf Claim \rm (rudimentary gamma conjecture). For fixed $N > 2$ and $i, \, j$ in a box of at least some moderate size, one should have \begin{equation*} \label{claim-grass} \lim_{z \to - \infty} \frac{\Psi_i (z) \Psi'_j (z) - \Psi_j (z) \Psi'_i (z)}{\Psi_1 (z) \Psi'_0 (z) - \Psi_0 (z) \Psi'_1 (z)} = \frac{c_i d_j - c_j d_i}{c_1 d_0 - c_0 d_1} . \end{equation*} \bigskip \bigskip \noindent The LHS and RHS mimic, in the setup of formula \eqref{drop-rel}, the $\sigma_{[j-1,i]}$-coefficients in the expansion of the `principal asymptotic class' and the gamma class of the usual grassmannian: in the case when $N \in \mathbb{N}$ and $0 \le i,j \le N$ one would use the identification of $2$--Wronskians of a fundamental matrix of solutions to a higher Bessel equation with homology classes of $G(2,N+2)$. Preliminary considerations together with numerical evidence suggest that the claim has a good chance to be true, as well as its versions for $G(k,N+k)$ with $k > 2$. \bigskip \bigskip \bigskip The first--named author is grateful to Yuri Manin and Vasily Pestun for stimulating discussions. We thank Hartmut Monien for pointing us to \cite{FW2008}. \bigskip \nocite{MV2017} \nocite{GM2014} \nocite{Bra2013} \nocite{BS2013} \nocite{Etingof1999} \nocite{Etingof2014} \nocite{Etingof2016} \nocite{EGNO2015} \nocite{FW2008} \nocite{Man2006} \nocite{Opd1999} \nocite{Man1985} \nocite{Lit1942} \nocite{Lit1943} \nocite{BD2016} \nocite{LM2002} \nocite{LM2004} \nocite{LM2006} \nocite{LM2006a} \nocite{GW2011} \nocite{Del2002} \nocite{} \nocite{} \nocite{} \nocite{} \nocite{} \nocite{}

mesmixmusic.com - Gymnastics Mats For Home Walmart Shop for Exercise Mats in Yoga & Pilates. Buy products such as Gold's Gym 24 Sq Ft High Impact EVA Foam 6-Piece Interlocking Puzzle Exercise Mat at Walmart and save. Buy products such as Gold's Gym 24 Sq Ft High Impact EVA Foam 6-Piece Interlocking Puzzle Exercise Mat at Walmart and save.Gym mats for exercise & equipment support. Workout in comfort and protect your flooring with Walmart Canada's wide selection of gym mats, including equipment and exercise mats. Find them at Walmart.ca!Gymnastics mats for home walmart. kevinkevincarey.com - Gymnastics Mats For Home Walmart Shop for Exercise Mats in Yoga & Pilates. Buy products such as Gold's Gym 24 Sq Ft High Impact EVA Foam 6-Piece Interlocking Puzzle Exercise Mat at Walmart and save.27+ gymnastics mats for home walmart. daniellelighthouse.com - Gymnastics Mats For Home Walmart Shop for Exercise Mats in Yoga & Pilates. Buy products such as Gold's Gym 24 Sq Ft High Impact EVA Foam 6-Piece Interlocking Puzzle Exercise Mat at Walmart and save.

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en"> <head> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <title>Airports | KTI Online</title> <meta http-equiv="content-language" content="en" /> <meta name="description" content="KCI Terminal Renovations &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; Charles B. Wheeler Downtown Airport &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; KCI Taxiway Rehab..." /> <meta name="keywords" content="" /> <meta http-equiv="Content-Type" content="text/html; charset=utf-8" /> <link rel="shortcut icon" href="/sites/default/files/blueprint_favicon.gif" type="image/x-icon" /> <link type="text/css" rel="stylesheet" media="all" href="/modules/node/node.css" /> <link type="text/css" rel="stylesheet" media="all" href="/modules/system/defaults.css" /> <link type="text/css" rel="stylesheet" media="all" href="/modules/system/system.css" /> <link type="text/css" rel="stylesheet" media="all" href="/modules/system/system-menus.css" /> <link type="text/css" rel="stylesheet" media="all" href="/modules/user/user.css" /> <link type="text/css" rel="stylesheet" media="screen,projection" href="/themes/blueprint/blueprint/blueprint/screen.css" /> <link type="text/css" rel="stylesheet" media="screen,projection" href="/themes/blueprint/css/blueprint.css" /> <link type="text/css" rel="stylesheet" media="screen,projection" href="/themes/blueprint/css/style.css" /> <link type="text/css" rel="stylesheet" media="print" href="/themes/blueprint/blueprint/blueprint/print.css" /> <!--[if lte IE 7]> <link rel="stylesheet" href="/themes/blueprint/blueprint/blueprint/ie.css" type="text/css" media="screen, projection"> <link href="/themes/blueprint/css/ie.css" rel="stylesheet" type="text/css" media="screen, projection" /> <![endif]--> <!--[if lte IE 6]> <link href="/themes/blueprint/css/ie6.css" rel="stylesheet" type="text/css" media="screen, projection" /> <![endif]--> </head> <body class="not-front not-logged-in page-node node-type-page one-sidebar sidebar-right col-2 "> <div class="container"> <div id="header"> <div id="logo-img"> <a href="/"><img src="/themes/blueprint//images/logo.png" /></a> <h1>Kruger Technologies, Inc.</h1> </div> <ul id="nav" class="links"><li class="menu-167 first"><a href="/user" title="">Client Login</a></li> <li class="menu-166 last"><a href="/" title="">Home</a></li> </ul> </div> <div class=""><div id="block-menu-secondary-links" class="block block-menu region-odd odd region-count-1 count-3"> <div class="content"><ul class="menu"><li class="leaf first"><a href="/" title="Home">Home</a></li> <li class="expanded"><a href="/about" title="About KTI">About</a><ul class="menu"><li class="leaf first"><a href="/about/history" title="History">History</a></li> <li class="leaf"><a href="/locations" title="Locations">Locations</a></li> <li class="leaf"><a href="/about/values" title="Values">Values</a></li> <li class="leaf last"><a href="/about/careers" title="Careers at KTI">Careers</a></li> </ul></li> <li class="expanded"><a href="/services" title="Services">Services</a><ul class="menu"><li class="leaf first"><a href="/services/construction" title="Construction Services">Construction Services</a></li> <li class="leaf"><a href="/services/geotechnical" title="Geotechnical">Geotechnical</a></li> <li class="leaf last"><a href="/services/environmental" title="Environmental">Environmental</a></li> </ul></li> <li class="expanded active-trail"><a href="/experience" title="Experience">Experience</a><ul class="menu"><li class="leaf first"><a href="/experience/gsa" title="GSA">GSA</a></li> <li class="leaf"><a href="/experience/military" title="Military/Government">Military/Government</a></li> <li class="leaf"><a href="/experience/design-build" title="Design/Build">Design/Build</a></li> <li class="leaf"><a href="/experience/education" title="Education">Education</a></li> <li class="leaf"><a href="/experience/commercial" title="Commercial">Commercial</a></li> <li class="leaf active-trail"><a href="/experience/airports" title="Airports" class="active">Airports</a></li> <li class="leaf"><a href="/experience/infrastructure" title="Infrastructure">Infrastructure</a></li> <li class="leaf last"><a href="/experience/public" title="">Public Works</a></li> </ul></li> <li class="leaf"><a href="/people" title="People">People</a></li> <li class="collapsed last"><a href="/contact" title="">Contact Us</a></li> </ul></div> </div> </div> <div class="col-center span-15"> <h2>Airports</h2><div id="node-38" class="node clear-block"> <div class="content clear-block"> <div class="intro">KCI Terminal Renovations</div> <p><img src="/images/kcithumb.jpg" title="Kansas City International Airport Terminal" align="left" style="padding-left: 0pt; padding-top: 15pt; padding-bottom: 0pt; padding-right: 10pt" /></p> <p>&nbsp;</p> <p>&nbsp;</p> <p>&nbsp;</p> <p>&nbsp;</p> <p>&nbsp;</p> <div class="intro">Charles B. Wheeler Downtown Airport</div> <p><img src="/images/cbwthumb.jpg" border="0" align="right" title="Charles B. Wheeler Downtown Airport" style="padding-left: 10pt; padding-top: 15pt; padding-bottom: 0pt; padding-right: 0pt" /></p> <p>&nbsp;</p> <p>&nbsp;</p> <p>&nbsp;</p> <p>&nbsp;</p> <p>&nbsp;</p> <div class="intro">KCI Taxiway Rehabilitations</div> <p><img src="/images/kcirunway.jpg" title="Kansas City International Airport Aerial View" align="left" style="padding-left: 0pt; padding-top: 15pt; padding-bottom: 0pt; padding-right: 10pt" /></p> <p>&nbsp;</p> <p>&nbsp;</p> <p>&nbsp;</p> <p>&nbsp;</p> <p>&nbsp;</p> <div class="intro">Lee's Summit Municipal Airport</div> <p><img src="/images/leessummitairportthumb.jpg" border="0" align="right" title="Lee's Summit Municipal Airport" style="padding-left: 10pt; padding-top: 15pt; padding-bottom: 0pt; padding-right: 0pt" /></p> <p>&nbsp;</p> <p>&nbsp;</p> <p>&nbsp;</p> <p>&nbsp;</p> </div> </div> </div> <div class="col-right span-6"><div id="block-block-15" class="block block-block region-odd odd region-count-1 count-1"> <h3>Airports</h3> <div class="content"><p>Airports are unique because of the more stringent requirements for the strength of materials and the frequency of testing and inspection. Special equipment is required for testing the strength of concrete used in runways and taxiways. Because of these aspects, KTI employs technicians that are devoted exclusively to aviation related projects. In the past seven years alone, KTI has participated in construction projects at 38 different airports in Kansas and Missouri, and our experience and capabilities are unsurpassed. </p> </div> </div> </div> <script type="text/javascript" src="/misc/jquery.js"></script> <script type="text/javascript" src="/misc/drupal.js"></script> <script type="text/javascript" src="/themes/blueprint/scripts/general.js"></script> <script type="text/javascript"> <!--//--><![CDATA[//><!-- jQuery.extend(Drupal.settings, { "basePath": "/" }); //--><!]]> </script> <div id="bottom" class="clear"> <div id="block-block-1" class="block block-block region-odd even region-count-1 count-2"> <div class="content"><p><br style="clear:both" /></p> <div id="footer"> <ul> <li><a href="/">Home</a>&nbsp;&nbsp;&nbsp;|&nbsp;&nbsp;&nbsp; <a href="/about">About</a>&nbsp;&nbsp;&nbsp;|&nbsp;&nbsp;&nbsp;<a href="/services">Services</a>&nbsp;&nbsp;&nbsp;|&nbsp;&nbsp;&nbsp;<a href="/experience">Experience</a>&nbsp;&nbsp;&nbsp;|&nbsp;&nbsp;&nbsp;<a href="/people">People</a>&nbsp;&nbsp;&nbsp;|&nbsp;&nbsp;&nbsp;<a href="/contact">Contact Us</a>&nbsp;&nbsp;&nbsp;|&nbsp;&nbsp;&nbsp;<a href="/user">Client Login</a>&nbsp;&nbsp;&nbsp;|&nbsp;&nbsp;&nbsp;<a href="/privacy">Privacy Policy</a></li> </ul> <p>KTI is recognized by the Small Business Administration as a <a href="http://www.sba.gov">SBE</a>. KTI labs have been inspected and validated by the <a href="http://www.wes.army.mil/SL/MTC/ValidatedLabsList.htm">U.S. Army Corps of Engineers</a>.</p> <p>To access the machine-readable files created and published by BlueKC, please click <a href="https://bcbskc.sapphiremrfhub.com/">here</a>.</p><p>&copy; 2009-2017 Kruger Technologies, Inc. All rights reserved.</p> </div> </div> </div> </div> </div> </body> </html>

Pulsed-field gel electrophoresis analysis of retinoic acid receptor-α and promyelocytic leukemia rearrangements: Detection of the t(15;17) translocation in the diagnosis of acute promyelocytic leukemia Academic Article Chromosomes, Human, Pair 15 Gene Rearrangement Leukemia, Promyelocytic, Acute Receptors, Retinoic Acid Translocation, Genetic Acute promyelocytic leukemia (APL) is characterized cytogenetically by a balanced reciprocal chromosomal translocation t(15;17) (q22;q21). This translocation involves the retinoic acid receptor-alpha (RAR-alpha) on chromosome 17 and the promyelocytic leukemia locus (PML) on chromosome 15 and results in the transcription of novel fusion messenger RNAs. In this study, pulsed-field gel electrophoresis (PFGE) was applied to the detection of the t(15;17) translocation in twenty-six clinical specimens cytologically diagnosed by French-American-British criteria as APL. This technique could readily be applied to both fresh and nonviably frozen tumor samples. In 24 of 26 samples, rearrangements of the PML and RAR-alpha, loci could be detected by Southern blotting after digestion with MluI and BssHII. Furthermore, co-migration of the rearranged fragments, detected by hybridization to probes for the PML and RAR-alpha genes, demonstrated that these loci were juxtaposed. The translocation was detected in specimens at the time of initial diagnosis, on differentiation therapy with retinoic acid and at the time of relapse. The diagnostic accuracy was compared to cytogenetics and the reverse transcriptase-polymerase chain reaction for the novel PML-RAR-alpha fusion transcript. The samples from two patients were negative by all three diagnostic methods, and both of these patients failed to respond to all-trans retinoic acid. In the other 24 APL samples, cytogenetics was positive in only 76.9% of the cases, whereas both reverse transcriptase-polymerase chain reaction and PFGE methods detected the translocation in 100% of the cases. Thus, PFGE can readily detect the t(15;17) translocation in both viable and nonviable clinical specimens and can improve the diagnostic accuracy of morphology and cytogenetics in APL. In contrast to conventional electrophoresis based on rearrangement of RAR-alpha, the ability to demonstrate directly co-migration of the PML and RAR-alpha loci enables this method to distinguish the t(15;17) translocation from variant translocations such as the t(11;15). Because PFGE can be performed on nonviable, frozen tumor samples, it could be diagnostically useful in APL when the RNA-based reverse transcriptase-polymerase chain reaction cannot be performed. Xiao, Yong Hong Miller, Wilson H. Warrell, Raymond P. Dmitrovsky, Ethan Zelenetz, Andrew American Journal of Pathology Journal

form10_k.htm FOR THE FISCAL YEAR ENDED JANUARY 3, 2009 FOR THE TRANSITION PERIOD FROM _______ TO _______ (I.R.S. Employer Identification No.) The Proscenium 1170 Peachtree Street NE, Suite 900 NAME OF EACH EXCHANGE ON Carter's, Inc.'s common stock WHICH REGISTERED: par value $0.01 per share SECURITIES REGISTERED PURSUANT TO SECTION 12(g) OF THE ACT: Indicate by check mark if the Registrant is a well-known seasoned issuer, as defined in Rule 405 of the Securities Act. Yes x No o Indicate by check mark if the Registrant is not required to file reports pursuant to Section 13 or Section 15(d) of the Act. Yes o No x Indicate by check mark whether the Registrant (1) has filed all reports required to be filed by Section 13 or 15(d) of the Securities Exchange Act of 1934 during the preceding 12 months (or for such shorter period that the Registrant was required to file such reports), and (2) has been subject to such filing requirements for the past 90 days. Yes x No o Indicate by check mark if disclosure of delinquent filers pursuant to Item 405 of Regulation S-K is not contained herein, and will not be contained, to the best of the Registrant's knowledge, in definitive proxy or information statements incorporated by reference in Part III of this Form 10-K or any amendment to this Form 10-K. o Indicate by check mark whether the Registrant is a large accelerated filer, an accelerated filer, a non-accelerated filer, or a smaller reporting company. See definitions of "large accelerated filer," "accelerated filer," and "smaller reporting company" in Rule 12b-2 of the Exchange Act. (Check one): Large Accelerated Filer x Accelerated Filer o Non-Accelerated Filer o Smaller Reporting Company o Indicate by check mark whether the Registrant is a shell company (as defined in Rule 12b-2 of the Exchange Act). Yes o No x The approximate aggregate market value of the voting stock held by non-affiliates of the Registrant as of June 28, 2008 (the last business day of our most recently completed second quarter) was $776,016,341. There were 56,352,111 shares of Carter's, Inc.'s common stock with a par value of $0.01 per share outstanding as of the close of business on February 27, 2009. Portions of the definitive proxy statement to be filed with the Securities and Exchange Commission pursuant to Regulation 14A relating to the Annual Meeting of Stockholders of Carter's, Inc., to be held on May 14, 2009, will be incorporated by reference in Part III of this Form 10-K. Carter's, Inc. intends to file such proxy statement with the Securities and Exchange Commission not later than 120 days after its fiscal year ended January 3, 2009. INDEX TO ANNUAL REPORT ON FORM 10-K Item 1: Item 1A: Item 1B: Market for Registrant's Common Equity, Related Stockholder Matters, and Issuer Purchases of Equity Securities Item 10: Directors and Executive Officers of the Registrant Security Ownership of Certain Beneficial Owners and Management and Related Stockholder Matters Certain Relationships and Related Transactions Our market share data is based on information provided by the NPD Group, Inc. Unless otherwise indicated, references to market share in this Annual Report on Form 10-K are expressed as a percentage of total retail sales of a market. NPD has restated historical data, therefore, the market data reported prior to 2008 is not directly comparable to the data reported in this Annual Report on Form 10-K. The baby and young children's apparel market includes apparel products from sizes newborn to seven. Unless the context indicates otherwise, in this filing on Form 10-K, "Carter's," the "Company," "we," "us," "its," and "our" refers to Carter's, Inc. and its wholly owned subsidiaries. We are the largest branded marketer in the United States of apparel exclusively for babies and young children. We own two of the most highly recognized and most trusted brand names in the children's apparel industry, Carter's and OshKosh. Established in 1865, our Carter's brand is recognized and trusted by consumers for high-quality apparel for children sizes newborn to seven. In fiscal 2005, we acquired OshKosh B'Gosh, Inc. Established in 1895, OshKosh is recognized as a well-known brand that is trusted by consumers for its line of apparel for children sizes newborn to 12. We have extensive experience in the young children's apparel market and focus on delivering products that satisfy our consumers' needs. We market high-quality, essential core products at prices that deliver an attractive value proposition for consumers. We have developed a business model that we believe has multiple platforms for growth and is focused on high volume and productivity. Our Carter's, OshKosh, and related sub-brands are sold to national department stores, chain and specialty stores, discount retailers, and, as of January 3, 2009, through 253 Carter's and 165 OshKosh outlet and brand retail stores. We believe each of our brands has its own unique positioning in the marketplace. Our brands compete in the $24 billion children's apparel market, for children sizes newborn to seven, with our Carter's brand achieving the #1 branded position with a 10.9% market share. Our OshKosh brand has a 3.2% market share. We offer multiple product categories, including baby, sleepwear, playclothes, and other accessories. Our distribution strategy enables us to reach a broad range of consumers through channel, price point, and region. Since fiscal 2004, including OshKosh, we have increased consolidated net sales at a compound annual growth rate of 16.0%. Since fiscal 2006, our first full year of sales from OshKosh, we have increased consolidated net sales at a compounded annual growth rate of 5.3%. Our pre-tax results have ranged from income of $82.5 million in fiscal 2004 to $117.4 million in fiscal 2008, with the exception of fiscal 2007 in which we had a pre-tax loss of $29.1 million. In fiscal 2007, our pre-tax results were impacted by OshKosh related intangible asset impairment charges of $154.9 million and distribution facility closure costs of $7.4 million related to further integrating OshKosh. In fiscal 2008, our pre-tax results were decreased by executive retirement charges of $5.3 million and a write-down of $2.6 million on our OshKosh distribution facility, which is held for sale. The Company's principal executive offices are located at The Proscenium, 1170 Peachtree Street NE, Suite 900, Atlanta, Georgia 30309, and our telephone number is (404) 745-2700. OUR BRANDS, PRODUCTS, AND DISTRIBUTION CHANNELS CARTER'S BRANDS Under our Carter's brand, we design, source, and market a broad array of products, primarily for sizes newborn to seven. Our Carter's brand is sold in department stores, national chains, specialty stores, off-price sales channels, and through our Carter's retail stores. Additionally, we sell our Just One Year and Child of Mine brands through the mass channel at Target and Wal-Mart, respectively. In fiscal 2008, we sold over 223 million units of Carter's, Child of Mine, and Just One Year products to our wholesale customers, mass channel customers, and through our Carter's retail stores, an increase of approximately 9% from fiscal 2007. Under our Carter's, Child of Mine, and Just One Year brands, sales growth has been driven by our focus on essential, high-volume, core apparel products for babies and young children. Such products include bodysuits, pajamas, blanket sleepers, gowns, bibs, towels, washcloths, and receiving blankets. Our top ten baby and sleepwear core products accounted for approximately 67% of our baby and sleepwear net sales in fiscal 2008, including the mass channel. We believe these core products are essential consumer staples, insulated from changes in fashion trends, and supported by a strong birth rate and other favorable demographic trends. We have four cross-functional product teams focused on the development of our Carter's baby, sleepwear, playclothes, and mass channel products. These teams are skilled in identifying and developing high-volume, core products. Each team includes members from merchandising, design, sourcing, product development, forecasting, and supply chain logistics. These teams follow a disciplined approach to fabric usage, color rationalization, and productivity and are supported by a dedicated art department and state-of-the-art design systems. We also license our brand names to other companies to create a complete collection of lifestyle products, including bedding, hosiery, underwear, shoes, room décor, furniture, and toys. The licensing team directs the use of our designs, art, and selling strategies to all licensees. We believe this disciplined approach to core product design reduces our susceptibility to fashion risk and supports efficient operations. We conduct consumer research as part of our product development process and engage in product testing in our own stores. We analyze quantitative measurements such as pre-season bookings, weekly over-the-counter selling results, and daily re-order rates in order to assess productivity. CARTER'S BRAND POSITIONING Our strategy is to drive our brand image as the leader in baby and young children's apparel and to consistently provide high-quality products at a great value to consumers. We employ a disciplined marketing strategy that identifies and focuses on core products. We believe that we have strengthened our brand image with the consumer by differentiating our core products through fabric improvements, new artistic applications, and new packaging and presentation strategies. We also attempt to differentiate our products through store-in-store shops and advertising with our wholesale and mass channel customers. We have invested in display units for our major wholesale customers that clearly present our core products on their floors to enhance brand and product presentation. We also strive to provide our wholesale and mass channel customers with a consistent, high-level of service, including delivering and replenishing products on time to fulfill customer needs. CARTER'S PRODUCTS Carter's brand baby products include bodysuits, undershirts, towels, washcloths, receiving blankets, layette gowns, bibs, caps, and booties. In fiscal 2008, excluding mass channel sales, we generated $362.7 million in net sales of these products, representing 24.3% of our consolidated net sales. Our Carter's brand is the leading brand in the baby category. In fiscal 2008, in the department store, national chain, outlet, specialty store, and off-price sales channels, our aggregate Carter's brand market share was approximately 29.6% for baby, which represents greater than five times the market share of the next largest brand. We sell a complete range of baby products for newborns, primarily made of cotton. We attribute our leading market position to our brand strength, distinctive print designs, artistic applications, reputation for quality, and ability to manage our dedicated floor space for our retail customers. We tier our products through marketing programs targeted toward gift-givers, experienced mothers, and first-time mothers. Our Carter's Starters product line, the largest component of our baby business, provides mothers with essential core products and accessories, including value-focused multi-packs. Our Little Collections product line consists of coordinated baby programs designed for first-time mothers and gift-givers. Playclothes Carter's brand playclothes products include knit and woven cotton apparel for everyday use in size three months to size seven. In fiscal 2008, we generated $324.8 million in net sales of these products, excluding the mass channel, or 21.8%, of our consolidated net sales. We have focused on building our Carter's brand in the playclothes market by developing a base of essential, high-volume, core products that utilize original print designs and innovative artistic applications. Our aggregate 2008 Carter's brand playclothes market share was 11.7% in the $10.0 billion department store, national chain, outlet, specialty store, and off-price sales channels. Carter's brand sleepwear products include pajamas, cotton long underwear, and blanket sleepers in size 12 months to size seven. In fiscal 2008, we generated $164.6 million in net sales of these products, excluding the mass channel, or 11.0%, of our consolidated net sales. Our Carter's brand is the leading brand of sleepwear for babies and young children within the department store, national chain, outlet, specialty store, and off-price sales channels in the United States. In fiscal 2008, in these channels, our Carter's brand market share was approximately 32.7%, which represents greater than two times the market share of the next largest brand. As in our baby product line, we differentiate our sleepwear products by offering high-volume, core products with creative artwork and soft fabrications. Mass Channel Products Our mass channel product team focuses on baby, sleepwear, and playclothes products produced specifically for the mass channel. Such products are differentiated through fabrications, artwork, and packaging. Our 2008 market share was 7.9% in the $9.8 billion mass channel children's apparel market. Our Child of Mine product line, which is sold in substantially all Wal-Mart stores nationwide, includes layette, sleepwear, and playclothes along with a range of licensed products, such as hosiery, bedding, toys, and gifts. We also sell our Just One Year brand to Target, which includes baby, sleepwear, and baby playclothes along with a range of licensed products, such as hosiery, bedding, toys, and gifts. In fiscal 2008, we generated $254.4 million in net sales of our Child of Mine and Just One Year products, or 17.1%, of our consolidated net sales. Our other product offerings include bedding, outerwear, shoes, socks, diaper bags, gift sets, toys, room décor, and hair accessories. In fiscal 2008, we generated $60.1 million in net sales of these other products in our Carter's retail stores, or 4.0%, of our consolidated net sales. Royalty Income We currently extend our Carter's, Child of Mine, and Just One Year product offerings by licensing our brands to 17 domestic marketers in the United States. These licensing partners develop and sell products through our multiple sales channels while leveraging our brand strength, customer relationships, and designs. Licensed products provide our customers and consumers with a range of lifestyle products that complement and expand upon our core baby and young children's apparel offerings. Our license agreements require strict adherence to our quality and compliance standards and provide for a multi-step product approval process. We work in conjunction with our licensing partners in the development of their products and ensure that they fit within our brand vision of high-quality, core products at attractive values to the consumer. In addition, we work closely with our wholesale and mass channel customers and our licensees to gain dedicated floor space for licensed product categories. In fiscal 2008, our Carter's brand and mass channel licensees generated wholesale and mass channel net sales of $188.4 million on which we earned $16.8 million in royalty income. In fiscal 2008, we extended the Carter's brand licensing arrangements internationally with two licensees who currently license the OshKosh brand. In connection with these arrangements, the Carter's brand generated international licensing sales of $3.2 million on which we earned $0.3 million in royalty income. CARTER'S DISTRIBUTION CHANNELS As described above, we sell our Carter's brand products to leading retailers throughout the United States in the wholesale and mass channels and through our own Carter's retail outlet and brand stores. In fiscal 2008, sales of our Carter's brand products through the wholesale channel, including off-price sales, accounted for 32.9% of our consolidated net sales (34.2% in fiscal 2007), sales through our retail stores accounted for 28.3% of our consolidated net sales (25.9% in fiscal 2007), and sales through the mass channel accounted for 17.1% of our consolidated net sales (17.2% in fiscal 2007). Business segment financial information for our Carter's brand wholesale, Carter's brand retail, and Carter's brand mass channel segments is contained in ITEM 8 "Financial Statements and Supplementary Data," Note 14 -- "Segment Information" to the accompanying audited consolidated financial statements. Our Carter's brand wholesale customers include major retailers, such as Kohl's, Toys "R" Us, Costco, JCPenney, Macy's, and Sears. Our mass channel customers are Wal-Mart and Target. Our sales professionals work with their department or specialty store accounts to establish annual plans for our baby products, which we refer to as core basics. Once we establish an annual plan with an account, we place the majority of our accounts on our automatic reorder plan for core basics. This allows us to plan our sourcing requirements and benefits both us and our wholesale and mass channel customers by maximizing our customers' in-stock positions, thereby improving sales and profitability. We intend to drive continued growth with our wholesale and mass channel customers through our focus on managing our key accounts' business through product mix, fixturing, brand presentation, and advertising. We believe that we maintain strong account relationships and drive brand growth through frequent meetings with the senior management of our major wholesale and mass channel customers. As of January 3, 2009, we operated 253 Carter's retail stores, of which 170 were outlet stores and 83 were brand stores. These stores carry a complete assortment of first-quality baby and young children's apparel, accessories, and gift items. Our stores average approximately 4,700 square feet per location and are distinguished by an easy, consumer-friendly shopping environment. We believe our brand strength and our assortment of core products has made our stores a destination location within many outlet and strip centers. Our outlet stores are generally located within 20 to 30 minutes of densely-populated areas. Our brand stores are generally located in high-traffic, strip centers located in or near major cities. We have established a real estate selection process whereby we fully assess all new locations based on demographic factors, retail adjacencies, and population density. We believe that we are located in many of the premier outlet centers in the United States and we continue to add new strip center locations to our real estate portfolio. OSHKOSH BRANDS Under our OshKosh brand, we design, source, and market a broad array of young children's apparel, primarily for children in sizes newborn to 12. Our OshKosh brand is currently sold in our OshKosh retail stores, department stores, national chains, specialty stores, and through off-price sales channels. In fiscal 2008, we sold over 45 million units of OshKosh products through our retail stores and to our wholesale customers, an increase of approximately 7% over fiscal 2007. We also have a licensing agreement with Target through which Target sells products under our Genuine Kids from OshKosh brand. Given its long history of durability, quality, and style, we believe our OshKosh brand continues to be a market leader in the children's branded apparel industry and represents a significant long-term growth opportunity for us, especially in the $17.0 billion young children's playclothes market. While we have made significant progress integrating the OshKosh business, our plans to grow the OshKosh brand in the wholesale and retail store channels have not met our expectations to date. We continue to focus on our core product development and marketing disciplines, improving the productivity of our OshKosh retail stores, leveraging our relationships with major wholesale accounts, and leveraging our infrastructure and supply chain. OSHKOSH BRAND POSITIONING We believe our OshKosh brand stands for high-quality, authentic playclothes products for children sizes newborn to 12. Our core OshKosh brand products include denim, overalls, t-shirts, fleece, and other playclothes for children. Our OshKosh brand is generally positioned towards an older segment (sizes two to seven) and at slightly higher average prices than our Carter's brand. We believe our OshKosh brand has significant brand name recognition, which consumers associate with rugged, durable, and active playclothes for young children. OSHKOSH PRODUCTS Our OshKosh brand is best known for its playclothes products. In fiscal 2008, we generated $228.4 million in net sales of OshKosh brand playclothes products, which accounted for approximately 15.3% of our consolidated net sales. OshKosh brand playclothes products include denim apparel products with multiple wash treatments and coordinating garments, overalls, woven bottoms, knit tops, and playclothes products for everyday use in sizes newborn to 12. We plan to grow this business by continuing to reduce product complexity, expanding our core product offerings, improving product value, and leveraging our strong customer relationships and global supply chain expertise. We believe our OshKosh brand represents a significant opportunity for us to increase our share as the $17.0 billion young children's playclothes market, including the mass channel, is highly fragmented. In fiscal 2008, this market was more than five times the size of the baby and sleepwear markets combined. Our OshKosh brand's playclothes market share in the department store, national chain, outlet, specialty store, and off-price sales channels in fiscal 2008, exclusive of the mass channel, was approximately 4.8% in the $10.0 billion market in these channels. We are continuing to develop a base of high-volume, core playclothes products for our OshKosh brand. The remainder of our OshKosh brand product offering includes baby, sleepwear, outerwear, shoes, hosiery, and accessories. In fiscal 2008, we generated $95.0 million in net sales of these other products in our OshKosh retail stores, which accounted for 6.4% of our consolidated net sales. We partner with a number of domestic and international licensees to extend the reach of our OshKosh brand. We currently have eight domestic licensees, as well as 23 international licensees selling apparel and accessories in approximately 36 countries. Our largest licensing agreement is with Target. All Genuine Kids from OshKosh products sold by Target are sold pursuant to this licensing agreement. Our licensed products provide our customers and consumers with a range of OshKosh products including outerwear, underwear, swimwear, socks, shoes, bedding, and accessories. In fiscal 2008, our domestic licensees generated wholesale and mass channel net sales of approximately $187.7 million on which we earned approximately $9.5 million in royalty income. In fiscal 2008, our international licensees generated retail sales of approximately $112.3 million on which we earned approximately $7.1 million in royalty income. OSHKOSH DISTRIBUTION CHANNELS In fiscal 2008, sales of our OshKosh brand products through our OshKosh retail stores accounted for 16.7% of our consolidated net sales (16.6% in fiscal 2007) and sales through the wholesale channel, including off-price sales, accounted for 5.0% of our consolidated net sales (6.1% in fiscal 2007). Business segment financial information for our OshKosh brand wholesale and OshKosh brand retail segments is contained in ITEM 8 "Financial Statements and Supplementary Data," Note 14 -- "Segment Information" to the accompanying audited consolidated financial statements. As of January 3, 2009, we operated 165 OshKosh retail stores, of which 156 were outlet stores and nine were brand stores. These stores carry a wide assortment of young children's apparel, accessories, and gift items and average approximately 4,800 square feet per location. Our OshKosh brand wholesale customers include major retailers, such as Kohl's, Bon Ton, Costco, Fred Meyer, and JCPenney. We continue to work with our department and specialty store accounts to establish seasonal plans for playclothes products. The majority of our OshKosh brand playclothes products will be planned and ordered seasonally as we introduce new products. We have significant experience in sourcing products from Asia, with expertise that includes the ability to evaluate vendors, familiarity with foreign supply sources, and experience with sourcing logistics particular to Asia. We also have relationships with both leading and certain specialized sourcing agents in Asia. Our sourcing network consists of approximately 140 vendors located in approximately 13 countries. We believe that our sourcing arrangements are sufficient to meet our current operating requirements and provide capacity for growth. The baby and young children's apparel market is highly competitive. Competition is generally based upon product quality, brand name recognition, price, selection, service, and convenience. Both branded and private label manufacturers compete in the baby and young children's apparel market. Our primary competitors in the wholesale and mass channels include Disney, Gerber, and private label product offerings. Our primary competitors in the retail store channel include Old Navy, The Gap, The Children's Place, Gymboree, and Disney. Most retailers, including our customers, have significant private label product offerings that compete with us. Because of the highly-fragmented nature of the industry, we also compete with many small manufacturers and retailers. We believe that the strength of our Carter's and OshKosh brand names combined with our breadth of product offerings and operational expertise position us well against these competitors. We are subject to various federal, state, and local laws that govern activities or operations that may have adverse environmental effects. Noncompliance with these laws and regulations can result in significant liabilities, penalties, and costs. Generally, compliance with environmental laws has not had a material impact on our operations, but there can be no assurance that future compliance with such laws will not have a material adverse effect on our operations. TRADEMARKS, COPYRIGHTS, AND LICENSES We own many copyrights and trademarks, including Carter's®, Carter's® Classics, Celebrating Childhood™, Child of Mine®, Just One Year®, OshKosh®, OshKosh B'Gosh®, At Play Since 1895™, OshKosh Est. 1895®, Genuine Kids®, The Genuine Article®, and The Genuine Deal™ many of which are registered in the United States and in more than 120 foreign countries. We license various Company trademarks, including Carter's, Just One Year, Child of Mine, OshKosh, OshKosh B'Gosh, OshKosh Est. 1895, and Genuine Kids to third parties to produce and distribute children's apparel and related products such as hosiery, outerwear, swimwear, underwear, shoes, boots, slippers, diaper bags, furniture, room décor, bedding, giftwrap, baby books, party goods, and toys. Our Internet address is www.carters.com. We are not including the information contained on our website as part of, or incorporating it by reference into, this Annual Report on Form 10-K. There we make available, free of charge, our Annual Report on Form 10-K, quarterly reports on Form 10-Q, current reports on Form 8-K, and any amendments to those reports, proxy statements, director and officer reports on Forms 3, 4, and 5, and amendments to these reports, as soon as reasonably practicable after we electronically file such material with, or furnish it to, the Securities and Exchange Commission ("SEC"). Our SEC reports can be accessed through the investor relations section of our website. The information found on our website is not part of this or any other report we file with or furnish to the SEC. We also make available on our website, the Carter's Code of Business Ethics and Professional Conduct, our Corporate Governance Principles, and the charters for the Compensation, Audit, and Nominating and Corporate Governance Committees of the Board of Directors. Our SEC filings are also available for reading and copying at the SEC's Public Reference Room at 100 F Street, NE, Washington, D.C. 20549. Information on the operation of the Public Reference Room may be obtained by calling the SEC at 1-800-SEC-0330. In addition, the SEC maintains an Internet site, www.sec.gov, containing reports, proxy and information statements, and other information regarding issuers that file electronically with the SEC. As of January 3, 2009, we had 6,548 employees, 2,675 of whom were employed on a full-time basis and 3,873 of whom were employed on a part-time basis. We have no unionized employees. We have had no labor-related work stoppages and believe that our labor relations are good. You should carefully consider each of the following risk factors as well as the other information contained in this Annual Report on Form 10-K and other filings with the Securities and Exchange Commission in evaluating our business. The risks and uncertainties described below are not the only we face. Additional risks and uncertainties not presently known to us or that we currently consider immaterial may also impact our business operations. If any of the following risks actually occur, our operating results may be affected. The loss of one or more of our major customers could result in a material loss of revenues. In fiscal 2008, we derived approximately 42% of our consolidated net sales from our top eight customers, including mass channel customers. Kohl's and Wal-Mart each accounted for approximately 10% of our consolidated net sales in fiscal 2008. We do not enter into long-term sales contracts with our major customers, relying instead on long-standing relationships and on our position in the marketplace. As a result, we face the risk that one or more of our major customers may significantly decrease its or their business with us or terminate its or their relationships with us. Any such decrease or termination of our major customers' business could result in a material decrease in our sales and operating results. The acceptance of our products in the marketplace is affected by consumers' tastes and preferences, along with fashion trends. We believe that continued success depends on our ability to provide a unique and compelling value proposition for our consumers in the Company's distribution channels. There can be no assurance that the demand for our products will not decline, or that we will be able to successfully evaluate and adapt our product to be aware of consumers' tastes and preferences and fashion trends. If consumers' tastes and preferences are not aligned with our product offerings, promotional pricing may be required to move seasonal merchandise. Increased use of promotional pricing would have a material adverse affect on our sales, gross margin, and results of operations. The value of our brand, and our sales, could be diminished if we are associated with negative publicity. Although our employees, agents, and third-party compliance auditors periodically visit and monitor the operations of our vendors, independent manufacturers, and licensees, we do not control these vendors, independent manufacturers, licensees, or their labor practices. A violation of our vendor policies, licensee agreements, labor laws, or other laws by these vendors, independent manufacturers, or licensees could interrupt or otherwise disrupt our supply chain or damage our brand image. As a result, negative publicity regarding our Company, brands, or products, including licensed products, could adversely affect our reputation and sales. The security of the Company's databases that contain personal information of our retail customers could be breached, which could subject us to adverse publicity, litigation, and expenses. In addition, if we are unable to comply with security standards created by the credit card industry, our operations could be adversely affected. Database privacy, network security, and identity theft are matters of growing public concern. In an attempt to prevent unauthorized access to our network and databases containing confidential, third-party information, we have installed privacy protection systems, devices, and activity monitoring on our network. Nevertheless, if unauthorized parties gain access to our networks or databases, they may be able to steal, publish, delete, or modify our private and sensitive third-party information. In such circumstances, we could be held liable to our customers or other parties or be subject to regulatory or other actions for breaching privacy rules. This could result in costly investigations and litigation, civil or criminal penalties, and adverse publicity that could adversely affect our financial condition, results of operations, and reputation. Further, if we are unable to comply with the security standards, established by banks and the credit card industry, we may be subject to fines, restrictions, and expulsion from card acceptance programs, which could adversely affect our retail operations. The Company's royalty income is greatly impacted by the Company's brand reputation. The Company's brand image, which is associated with providing a consumer product with outstanding quality and name recognition, makes it valuable as a royalty source. The Company is able to generate royalty income from the sale of licensed products that bear its Carter's, Child of Mine, Just One Year, OshKosh, Genuine Kids from OshKosh, and related trademarks. The Company also generates foreign royalty income as our OshKosh B'Gosh label carries an international reputation for quality and American style. While the Company takes significant steps to ensure the reputation of its brand is maintained through its license agreements, there can be no guarantee that the Company's brand image will not be negatively impacted through its association with products outside of the Company's core apparel products. There are deflationary pressures on the selling price of apparel products. In part due to the actions of discount retailers, and in part due to the worldwide supply of low cost garment sourcing, the average selling price of children's apparel continues to decrease. To the extent these deflationary pressures are not offset by reductions in manufacturing costs, there would be an affect on the Company's gross margin. Additionally, the inability to leverage certain fixed costs of the Company's design, sourcing, distribution, and support costs over its gross sales base could have an adverse impact on the Company's operating results. Our business is sensitive to overall levels of consumer spending, particularly in the young children's apparel segment. Consumers' demand for young children's apparel, specifically brand name apparel products, is impacted by the overall level of consumer spending. Discretionary consumer spending is impacted by employment levels, gasoline and utility costs, business conditions, availability of consumer credit, tax rates, interest rates, levels of consumer indebtedness, and overall levels of consumer confidence. Recent and further reductions in the level of discretionary spending may have a material adverse affect on the Company's sales and results of operations. We face risks associated with the current global credit crisis and related economic downturn. The continuing volatility in the financial markets and the related economic downturn in markets throughout the world could have a material adverse effect on our business. While we currently generate significant cash flows from our ongoing operations and have access to credit through amounts available under our revolving credit facility (the "Revolver"), credit markets have recently experienced significant disruptions and certain leading financial institutions have either declared bankruptcy or have shown significant deterioration in their financial stability. Further deterioration in the financial markets could make future financing difficult or more expensive. If any of the financial institutions that are parties to our Revolver were to declare bankruptcy or become insolvent, they may be unable to perform under their agreements with us. This could leave us with reduced borrowing capacity. In addition, tighter credit markets may lead to business disruptions for certain of our suppliers, contract manufacturers or trade customers and consequently, could disrupt our business. We source substantially all of our products through foreign production arrangements. Our dependence on foreign supply sources could result in disruptions to our operations in the event of political instability, unfavorable economic conditions, international events, or new foreign regulations and such disruptions may increase our cost of goods sold and decrease gross profit. We source substantially all of our products through a network of vendors primarily in Asia, coordinated by our Asia agents. The following could disrupt our foreign supply chain, increase our cost of goods sold, decrease our gross profit, or impact our ability to get products to our customers: financial instability of one of our major vendors; political instability or other international events resulting in the disruption of trade in foreign countries from which we source our products; increases in transportation costs as a result of increased fuel prices; the imposition of new regulations relating to imports, duties, taxes, and other charges on imports including the China safeguards; the occurrence of a natural disaster, unusual weather conditions, or an epidemic, the spread of which may impact our ability to obtain products on a timely basis; changes in the United States customs procedures concerning the importation of apparel products; unforeseen delays in customs clearance of any goods; disruption in the global transportation network such as a port strike, world trade restrictions, or war; the application of foreign intellectual property laws; the ability of our vendors to secure sufficient credit to finance the manufacturing process including the acquisition of raw materials; and exchange rate fluctuations between the United States dollar and the local currencies of foreign contractors. These and other events beyond our control could interrupt our supply chain and delay receipt of our products into the United States. We source all of our products through a network of vendors. We have limited control over these vendors and we may experience delays, product recalls or loss of revenues if our products do not meet our quality standards or regulatory requirements. Our vendors, independent manufacturers and licensees may not continue to provide products that are consistent with our standards. We have occasionally received, and may in the future continue to receive, shipments of product that fail to conform to our quality control standards. A failure in our quality control program may result in diminished product quality, which may result in increased order cancellations and returns, decreased consumer demand for our products, or product recalls, any of which may have a material adverse affect on our results of operations and financial condition. In addition, because we do not control our vendors, notwithstanding our strict quality control procedures, products that fail to meet our standards, or other unauthorized products, could end up in the marketplace without our knowledge, which could harm our brand and our reputation in the marketplace. Our products are subject to regulation of and regulatory standards set by various governmental authorities with respect to quality and safety. Regulations and standards in this area are currently in place. These regulations and standards may change from time to time. Our inability to comply on a timely basis with regulatory requirements could result in significant fines or penalties, which could adversely affect our reputation and sales. Issues with the quality and safety of merchandise we sell in our stores, regardless of our culpability, or customer concerns about such issues, could result in damage to our reputation, lost sales, uninsured product liability claims or losses, merchandise recalls, and increased costs. We operate in a highly competitive market and the size and resources of some of our competitors may allow them to compete more effectively than we can, resulting in a loss of market share and, as a result, a decrease in revenue and gross profit. The baby and young children's apparel market is highly competitive. Both branded and private label manufacturers compete in the baby and young children's apparel market. Our primary competitors in our wholesale and mass channel businesses include Disney, Gerber, and private label product offerings. Our primary competitors in the retail store channel include Old Navy, The Gap, The Children's Place, Gymboree, and Disney. Because of the fragmented nature of the industry, we also compete with many other manufacturers and retailers. Some of our competitors have greater financial resources and larger customer bases than we have and are less financially leveraged than we are. As a result, these competitors may be able to: adapt to changes in customer requirements more quickly; take advantage of acquisition and other opportunities more readily; devote greater resources to the marketing and sale of their products; and adopt more aggressive pricing strategies than we can. The Company's retail success and future growth is dependent upon identifying locations and negotiating appropriate lease terms for retail stores. The Company's retail stores are located in leased retail locations across the country. Successful operation of a retail store depends, in part, on the overall ability of the retail location to attract a consumer base sufficient to make store sales volume profitable. If the Company is unable to identify new retail locations with consumer traffic sufficient to support a profitable sales level, retail growth may consequently be limited. Further, if existing outlet and strip centers do not maintain a sufficient customer base that provides a reasonable sales volume, there could be a material adverse impact on the Company's sales, gross margin, and results of operations. Our leverage could adversely affect our financial condition. On January 3, 2009, we had total debt of approximately $338.0 million. Our indebtedness could have negative consequences. For example, it could: increase our vulnerability to interest rate risk; limit our ability to obtain additional financing to fund future working capital, capital expenditures, and other general corporate requirements, or to carry out other aspects of our business plan; require us to dedicate a substantial portion of our cash flow from operations to pay principal of, and interest on, our indebtedness, thereby reducing the availability of that cash flow to fund working capital, capital expenditures, or other general corporate purposes, or to carry out other aspects of our business plan; limit our flexibility in planning for, or reacting to, changes in our business and the industry; and place us at a competitive disadvantage compared to our competitors that have less debt. In addition, our senior credit facility contains financial and other restrictive covenants that may limit our ability to engage in activities that may be in our long-term best interests such as selling assets, strategic acquisitions, paying dividends, and borrowing additional funds. Our failure to comply with those covenants could result in an event of default which, if not cured or waived, could result in the acceleration of all of our debt which could leave us unable to meet some or all of our obligations. Profitability could be negatively impacted if we do not adequately forecast the demand for our products and, as a result, create significant levels of excess inventory or insufficient levels of inventory. If the Company does not adequately forecast demand for its products and purchases inventory to support an inaccurate forecast, the Company could experience increased costs due to the need to dispose of excess inventory or lower profitability due to insufficient levels of inventory. We may not achieve sales growth plans, cost savings, and other assumptions that support the carrying value of our intangible assets. As of January 3, 2009, the Company had Carter's cost in excess of fair value of net assets acquired of $136.6 million, a $220.2 million Carter's brand tradename asset, and an $85.5 million OshKosh brand tradename asset on its consolidated balance sheet. The carrying value of these assets is subject to annual impairment reviews as of the last day of each fiscal year or more frequently, if deemed necessary, due to any significant events or changes in circumstances. During the second quarter of fiscal 2007, the Company performed an interim impairment review of the OshKosh intangible assets due to continued negative trends in sales and profitability of the Company's OshKosh wholesale and retail segments. As a result of this review, the Company wrote off our OshKosh cost in excess of fair value of net assets acquired asset of $142.9 million and wrote down the OshKosh tradename by $12.0 million. Estimated future cash flows used in these impairment reviews could be negatively impacted if we do not achieve our sales plans, planned cost savings, and other assumptions that support the carrying value of these intangible assets, which could result in potential impairment of the remaining asset value. The Company's success is dependent upon retaining key individuals within the organization to execute the Company's strategic plan. The Company's ability to attract and retain qualified executive management, marketing, merchandising, design, sourcing, operations, and support function staffing is key to the Company's success. If the Company were unable to attract and retain qualified individuals in these areas, an adverse impact on the Company's growth and results of operations may result. ITEM 1B. UNRESOLVED STAFF COMMENTS Approximate floor space in square feet Principal use Distribution/warehousing Hogansville, Georgia Barnesville, Georgia White House, Tennessee Distribution/warehousing * Finance/information technology/benefits administration/rework Carter's customer service Executive offices/Carter's design and merchandising OshKosh's operating offices Finance and retail store administration office Sales office/showroom OshKosh's design center * As of January 3, 2009, this property is classified as an asset held for sale included in prepaid and other current assets on the accompanying audited consolidated balance sheets. As of January 3, 2009, we operated 418 leased retail stores located primarily in outlet and strip centers across the United States, having an average size of approximately 4,800 square feet. Generally, the majority of our leases have an average term of approximately five years with additional five-year renewal options. Aggregate lease commitments as of January 3, 2009 for the above leased properties are as follows: fiscal 2009—$51.8 million; fiscal 2010—$45.8 million; fiscal 2011—$35.4 million; fiscal 2012—$26.4 million; fiscal 2013—$21.2 million, and $51.7 million for the balance of these commitments beyond fiscal 2013. A class action lawsuit was filed on September 16, 2008 in the United States District Court for the Northern District of Georgia asserting claims under Sections 10(b) and 20(a) of the federal securities laws. The complaint alleges that between February 21, 2006 and July 21, 2007, the Company made misrepresentations regarding the successful integration of OshKosh into the Company's business, and that the share price of the Company's stock later fell when the market learned that the integration had not been as successful as represented. Plaintiff Plymouth County Retirement System filed an unopposed motion to be appointed lead counsel on November 18, 2008, and that motion was fully submitted as of December 8, 2008. Plaintiff is now waiting for a decision from the court. By stipulation of the parties, no motion to dismiss or other response to the complaint will be due until 60 days after an amended complaint is filed subsequent to lead plaintiff appointment. The Company intends to vigorously defend this claim. Following appointment of lead plaintiff and lead counsel, the Company intends to file a motion to dismiss for failure to state a claim under the federal securities laws. A class action lawsuit was filed on September 29, 2008 in United States District Court for the Northern District of Illinois against the Company claiming breach of contract arising from certain advertising and pricing practices with respect to Carter's brand products purchased by consumers at Carter's retail stores nationally. The complaint seeks damages and injunctive relief. Plaintiff has since filed an amended complaint, alleging breach of contract on behalf of a nationwide class and Illinois Consumer Fraud Act claims on behalf of Illinois consumers. The Company has moved to dismiss the entire amended complaint. On February 3, 2009 the same plaintiff's attorney filed a second, nearly identical action against the Company in the same court but in the name of a different plaintiff. The parties filed an agreed upon motion to consolidate this second action with the first case and to stay the need for response in the second case until after the court has ruled upon the pending motion to dismiss. The Company intends to vigorously defend these claims. The Company is subject to various other claims and pending or threatened lawsuits in the normal course of our business. We are not currently party to any other legal proceedings that we believe would have a material adverse effect on our financial position, results of operations or cash flows. ITEM 5. MARKET FOR REGISTRANT'S COMMON EQUITY, RELATED STOCKHOLDER MATTERS, AND ISSUER PURCHASES OF EQUITY SECURITIES Our common stock trades on the New York Stock Exchange under the symbol CRI. The last reported sale price per share of our common stock on February 13, 2009 was $15.70. On that date there were approximately 43,548 holders of record of our common stock. The following table sets forth for the periods indicated the high and low sales prices per share of common stock as reported by the New York Stock Exchange: PURCHASES OF EQUITY SECURITIES BY THE ISSUER AND AFFILIATED PURCHASERS The following table provides information about purchases by the Company during the fourth quarter of fiscal 2008 of equity securities that are registered by the Company pursuant to Section 12 of the Exchange Act: Approximate dollar value of shares that may yet be purchased under the plans or programs September 28, 2008 through October 25, 2008 228,178 $ 16.93 228,178 $ 8,895,948 October 26, 2008 through November 29, 2008 -- -- -- $ 8,895,948 November 30, 2008 through January 3, 2009 Represents repurchased shares which were retired. On February 16, 2007, our Board of Directors approved a stock repurchase program, pursuant to which the Company is authorized to purchase up to $100 million of its outstanding common shares. Such repurchases may occur from time to time in the open market, in negotiated transactions, or otherwise. This program has no time limit. The timing and amount of any repurchases will be determined by the Company's management, based on its evaluation of market conditions, share price, and other factors. This program was announced in the Company's report on Form 8-K, which was filed on February 21, 2007. The total remaining authorization under the repurchase program was $8,895,948 as of January 3, 2009. Provisions in our senior credit facility currently restrict the ability of our operating subsidiary, The William Carter Company ("TWCC"), from paying cash dividends to our parent company, Carter's, Inc., in excess of $15.0 million, which materially restricts Carter's, Inc. from paying cash dividends on our common stock. We do not anticipate paying cash dividends on our common stock in the foreseeable future but intend to retain future earnings, if any, for reinvestment in the future operation and expansion of our business and related development activities. Any future decision to pay cash dividends will be at the discretion of our Board of Directors and will depend upon our financial condition, results of operations, terms of financing arrangements, capital requirements, and any other factors as our Board of Directors deems relevant. RECENT SALES OF UNREGISTERED SECURITIES The following table sets forth selected financial and other data as of and for the five fiscal years ended January 3, 2009 (fiscal 2008). On July 14, 2005, Carter's, Inc., through TWCC, acquired all of the outstanding common stock of OshKosh for a purchase price of $312.1 million, which included payment for vested stock options (the "Acquisition"). As part of financing the Acquisition, the Company refinanced its existing debt (the "Refinancing"), comprised of its former senior credit facility and its outstanding 10.875% Senior Subordinated Notes due 2011 (the "Notes") (the Refinancing, together with the Acquisition, the "Transaction"). Financing for the Transaction was provided by a new $500 million Term Loan (the "Term Loan") and a $125 million revolving credit facility (including a sub-limit for letters of credit of $80 million, the "Revolver") entered into by TWCC with Bank of America, N.A., as administrative agent, and certain other financial institutions (the "Senior Credit Facility"). The proceeds from the Refinancing were used to purchase the outstanding common stock and vested stock options of OshKosh ($312.1 million), pay Transaction expenses ($6.2 million), refinance the Company's former senior credit facility ($36.2 million), repurchase the Company's Notes ($113.8 million), pay a redemption premium on the Company's Notes ($14.0 million), along with accrued and unpaid interest ($5.1 million), and pay debt issuance costs ($10.6 million). Other Transaction expenses paid prior and subsequent to the closing of the Transaction totaled $1.4 million, including $0.2 million in debt issuance costs. On June 6, 2006, the Company effected a two-for-one stock split (the "stock split") through a stock dividend to stockholders of record as of May 23, 2006 of one share of our common stock for each share of common stock outstanding. Earnings per share for all prior periods presented have been adjusted to reflect the stock split. The selected financial data for the five fiscal years ended January 3, 2009 were derived from our audited consolidated financial statements. Our fiscal year ends on the Saturday, in December or January, nearest the last day of December. Consistent with this policy, fiscal 2008 ended on January 3, 2009, fiscal 2007 ended on December 29, 2007, fiscal 2006 ended on December 30, 2006, fiscal 2005 ended on December 31, 2005, and fiscal 2004 ended on January 1, 2005. Fiscal 2008 contained 53 weeks of financial results. Fiscal 2007, fiscal 2006, fiscal 2005, and fiscal 2004 each contained 52 weeks of financial results. The following table should be read in conjunction with ITEM 7 "Management's Discussion and Analysis of Financial Condition and Results of Operations" and ITEM 8 "Financial Statements and Supplementary Data." (dollars in thousands, except per share data) OPERATING DATA: Wholesale sales – Carter's Wholesale sales – OshKosh 74,270 86,555 96,351 59,707 -- Retail sales – Carter's Retail sales – OshKosh 249,130 233,776 229,103 140,104 -- Mass Channel sales – Carter's 1,490,016 1,412,246 1,343,467 1,121,358 823,121 Selling, general, and administrative expenses Intangible asset impairment (a) -- 154,886 -- -- -- Executive retirement charges (b) 5,325 -- -- -- -- Facility write-down and closure costs (c) 2,609 5,285 91 6,828 620 (33,685 ) (30,738 ) (29,164 ) (20,426 ) (12,362 ) 135,494 (6,009 ) 165,111 121,246 101,025 (1,491 ) (1,386 ) (1,914 ) (1,322 ) (335 ) Loss on extinguishment of debt (d) -- -- -- 20,137 -- 117,407 (29,088 ) 138,188 77,867 82,508 $ 75,058 $ (70,618 ) $ 87,220 $ 47,202 $ 49,658 PER COMMON SHARE DATA: Basic net income (loss) $ 1.33 $ (1.22 ) $ 1.50 $ 0.82 $ 0.88 Diluted net income (loss) Basic weighted-average shares 56,309,454 57,871,235 57,996,241 57,280,504 56,251,168 Diluted weighted-average shares BALANCE SHEET DATA (end of period): Working capital (e) 1,051,057 974,668 1,123,191 1,116,727 672,965 Total debt, including current maturities CASH FLOW DATA: $ 183,623 $ 51,987 $ 88,224 $ 137,267 $ 42,676 (37,529 ) (21,819 ) (30,500 ) (308,403 ) (18,577 ) Net cash (used in) provided by financing activities (32,757 ) (49,701 ) (73,455 ) 222,147 (26,895 ) 34.5 % 34.2 % 36.4 % 35.3 % 36.2 % See Notes to Selected Financial Data. NOTES TO SELECTED FINANCIAL DATA (a) Intangible asset impairment charges of $154.9 million in fiscal 2007 reflect the impairment of the OshKosh cost in excess of fair value of net assets acquired asset (OshKosh wholesale segment of $36.0 million and OshKosh retail segment of $106.9 million) and the impairment of the value ascribed to the OshKosh tradename of $12.0 million. (b) Executive retirement charges of $5.3 million consist of $3.1 million related to the present value of severance and benefit obligations and $2.2 million of which related to the accelerated vesting of certain stock options. (c) The $0.6 million in closure costs in fiscal 2004 relate to costs associated with the closure of our Costa Rican facilities and our distribution facility in Leola, Pennsylvania. The $6.8 million and $0.1 million in closure costs in fiscal 2005 and fiscal 2006 relate to the closure of our Mexican sewing facilities. The $5.3 million in closure costs in fiscal 2007 relate to the closure of our OshKosh distribution facility. The $2.6 million charge in fiscal 2008 relates to the write-down of the carrying value of our OshKosh distribution facility held for sale. (d) Debt extinguishment charges in fiscal 2005 reflect the payment of a $14.0 million redemption premium on our Notes, the write-off of $4.5 million in unamortized debt issuance costs related to the former senior credit facility and Notes, and the write-off of $0.5 million of the related Note discount. Additionally, we expensed approximately $1.1 million of debt issuance costs associated with our Senior Credit Facility in accordance with Emerging Issues Task Force ("EITF") No. 96-19, "Debtor's Accounting for a Modification or Exchange of Debt Instruments." (e) Represents total current assets less total current liabilities. ITEM 7. MANAGEMENT'S DISCUSSION AND ANALYSIS OF FINANCIAL CONDITION AND RESULTS OF OPERATIONS The following is a discussion of our results of operations and current financial condition. You should read this discussion in conjunction with our consolidated historical financial statements and notes included elsewhere in this Annual Report on Form 10-K. Our discussion of our results of operations and financial condition includes various forward-looking statements about our markets, the demand for our products and services, and our future results. We based these statements on assumptions that we consider reasonable. Actual results may differ materially from those suggested by our forward-looking statements for various reasons including those discussed in the "Risk Factors" in ITEM 1A of this Annual Report on Form 10-K. Those risk factors expressly qualify all subsequent oral and written forward-looking statements attributable to us or persons acting on our behalf. Except for any ongoing obligations to disclose material information as required by the federal securities laws, we do not have any intention or obligation to update forward-looking statements after we file this Annual Report on Form 10-K. For more than 140 years, Carter's has become one of the most highly recognized and most trusted brand names in the children's apparel industry and with the Acquisition of OshKosh on July 14, 2005, we now own the highly recognized and trusted OshKosh B'Gosh brand which also earned the position of a highly trusted and well-known brand for over 110 years. We sell our products under our Carter's and OshKosh brands in the wholesale channel, which includes over 260 department store, national chain, and specialty store accounts. We also sell our products in the mass channel under our Child of Mine brand to over 3,500 Wal-Mart stores nationwide and under our Just One Year brand to over 1,600 Target stores. Additionally, as of January 3, 2009, we operated 253 Carter's and 165 OshKosh retail stores located primarily in outlet and strip centers throughout the United States. We also extend our brand reach by licensing our Carter's, Child of Mine, Just One Year, OshKosh, and related brand names through domestic licensing arrangements, including licensing of our Genuine Kids from OshKosh brand to Target stores nationwide. Our OshKosh B'Gosh brand name is also licensed through international licensing arrangements. During fiscal 2008, we earned approximately $33.7 million in royalty income from these arrangements, including $16.6 million from our OshKosh and Genuine Kids from OshKosh brands. In connection with the Acquisition of OshKosh, we recorded cost in excess of fair value of net assets acquired of $142.9 million and an OshKosh brand tradename asset of $102.0 million. During the second quarter of fiscal 2007, as a result of the continued negative trends in sales and profitability of the Company's OshKosh B'Gosh wholesale and retail segments and re-forecasted projections for such segments for the balance of fiscal 2007, the Company conducted an interim impairment assessment on the value of the intangible assets that the Company recorded in connection with the Acquisition. Based on this assessment, charges of approximately $36.0 million for the OshKosh wholesale segment and $106.9 million for the OshKosh retail segment were recorded for the impairment of the cost in excess of fair value of net assets acquired asset. In addition, an impairment charge of $12.0 million was recorded to reflect the impairment of the value ascribed to the OshKosh tradename. The carrying value of the OshKosh tradename asset is subject to annual impairment reviews as of the last day of each fiscal year or more frequently if deemed necessary due to any significant events or changes in circumstances. Estimated future cash flows used in such impairment reviews could be negatively impacted if we do not achieve our sales plans and other assumptions that support the carrying value of these intangible assets, which could result in potential impairment of such assets. We have also acquired certain definite-lived intangible assets in connection with the Acquisition of OshKosh comprised of licensing agreements and leasehold interests which resulted in annual amortization expense of $4.7 million in fiscal 2006; $4.5 million in fiscal 2007; and $4.1 million in fiscal 2008. Amortization expense related to these intangible assets will be $3.7 million in fiscal 2009 and $1.8 million in fiscal 2010. During fiscal 2007, the Board of Directors approved a stock repurchase program, pursuant to which the Company is authorized to purchase up to $100 million of its outstanding common shares. Such repurchases may occur from time to time in the open market, in negotiated transactions, or otherwise. This program has no time limit. The timing and amount of any repurchases will be determined by management, based on its evaluation of market conditions, share price, and other factors. During fiscal 2008, the Company repurchased and retired 2,126,361 shares, or approximately $33.6 million, of its common stock at an average price of $15.82 per share. Since inception of the program and through fiscal 2008, the Company repurchased and retired 4,599,580 shares, or approximately $91.1 million, of its common stock at an average price of $19.81 per share. Our fiscal year ends on the Saturday, in December or January, nearest the last day of December. Consistent with this policy, fiscal 2008 ended on January 3, 2009, fiscal 2007 ended on December 29, 2007, and fiscal 2006 ended on December 30, 2006. Fiscal 2008 contained 53 weeks of financial results while fiscal 2007 and 2006 each contained 52 weeks. The following table sets forth, for the periods indicated (i) selected statement of operations data expressed as a percentage of net sales and (ii) the number of retail stores open at the end of each period: Wholesale sales: Total wholesale sales Retail store sales: Total retail store sales Mass channel sales Consolidated net sales Intangible asset impairment -- 11.0 -- Executive retirement charges 0.4 -- -- Facility write-down and closure costs 0.2 0.3 -- (2.3 ) (2.2 ) (2.1 ) 9.1 (0.4 ) 12.3 5.0 % (5.0 )% 6.5 % Number of retail stores at end of period: FISCAL YEAR ENDED JANUARY 3, 2009 COMPARED WITH FISCAL YEAR ENDED DECEMBER 29, 2007 Consolidated net sales for fiscal 2008 were $1.5 billion, an increase of $77.8 million, or 5.5%, compared to $1.4 billion in fiscal 2007. This increase reflects growth in all three of our Carter's brand segments and our OshKosh brand retail store segment. For the fiscal years ended Wholesale-Carter's $ 489,744 32.9 % $ 482,350 34.2 % Wholesale-OshKosh 74,270 5.0 % 86,555 6.1 % Retail-Carter's 422,436 28.3 % 366,296 25.9 % Retail-OshKosh Mass Channel-Carter's $ 1,490,016 100.0 % $ 1,412,246 100.0 % CARTER'S WHOLESALE SALES Carter's brand wholesale sales increased $7.4 million, or 1.5%, in fiscal 2008, to $489.7 million. The increase in Carter's brand wholesale sales was driven by a 6% increase in units shipped, partially offset by a 4% decrease in average price per unit, as compared to fiscal 2007. The growth in units shipped was driven primarily by growth in all product categories due to increased demand and higher levels of off-price units shipped. The decrease in average price per unit was due to more competitive pricing in certain product categories, particularly to our off-price customers. OSHKOSH WHOLESALE SALES OshKosh brand wholesale sales decreased $12.3 million, or 14.2%, in fiscal 2008 to $74.3 million. The decrease in OshKosh brand wholesale sales reflects a 16% decline in average price per unit, partially offset by a 2% increase in units shipped, as compared to fiscal 2007. The decrease in average prices reflects a change in strategy to reposition the OshKosh brand to appeal to a broader consumer population. We believe our new product offerings and price repositioning drove the increase in units shipped. CARTER'S RETAIL STORES Carter's retail stores sales increased $56.1 million, or 15.3%, in fiscal 2008 to $422.4 million. The increase was driven by a comparable store sales increase of $38.5 million, or 9.0% (based on 225 locations), incremental sales of $18.5 million generated by new store openings, partially offset by the impact of store closures of $0.9 million. During fiscal 2008, on a comparable store basis, transactions increased 4.0%, units per transaction increased 3.5%, and average prices increased 1.3% as compared to fiscal 2007. The increases in transactions and units per transaction were driven by strong product performance in all product categories, improved in-store product presentation, and a focus on merchandising and marketing efforts. The increase in average prices was driven by our baby, sleepwear, and other product categories, partially offset by decreased playwear product category pricing. The Company's comparable store sales calculations include sales for all stores that were open during the comparable fiscal period, including remodeled stores and certain relocated stores. If a store relocates within the same center with no business interruption or material change in square footage, the sales for such store will continue to be included in the comparable store calculation. If a store relocates to another center or there is a material change in square footage, such store is treated as a new store. Stores that are closed during the period are included in the comparable store sales calculation up to the date of closing. There were a total of 253 Carter's retail stores open as of January 3, 2009. During fiscal 2008, we opened 25 stores. We plan to open approximately 20 and close five Carter's retail stores during fiscal 2009. OSHKOSH RETAIL STORES OshKosh retail store sales increased $15.4 million, or 6.6%, in fiscal 2008 to $249.1 million. The increase was due to incremental sales of $7.1 million generated by new store openings, and a comparable store sales increase of $10.3 million, or 3.2% (based on 160 locations), partially offset by the impact of store closings of $2.0 million. On a comparable store basis, transactions increased 2.0%, units per transaction increased 4.3%, and average prices decreased 3.0%. The increases in transactions and units per transaction and decrease in average prices were driven by heavy promotional pricing on excess products during the first half of fiscal 2008. There were a total of 165 OshKosh retail stores open as of January 3, 2009. During fiscal 2008, we opened three stores and closed one store. We plan to close three OshKosh retail stores during fiscal 2009. Mass channel sales increased $11.2 million, or 4.6%, in fiscal 2008 to $254.4 million. The increase was driven by sales of $14.9 million, or 15.5%, of our Just One Year brand to Target partially offset by a $3.7 million, or 2.5%, decrease in sales of our Child of Mine brand to Wal-Mart. The increase in Just One Year sales was driven primarily from new door growth and new floor space, particularly in playwear and baby. The decrease in Child of Mine sales was due to product performance in certain categories, particularly certain Spring 2008 products and certain fall hanging products. We anticipate our mass channel sales could decline approximately 15% in fiscal 2009 as compared to fiscal 2008. Our gross profit increased $30.8 million, or 6.4%, to $514.0 million in fiscal 2008. Gross profit as a percentage of net sales was 34.5% in fiscal 2008 as compared to 34.2% in fiscal 2007. The increase in gross profit as a percentage of net sales reflects a higher relative percentage of sales from our Carter's and OshKosh retail store segments, which generate higher gross profit margins than our other business segments. In fiscal 2008, our retail segments sales increased $71.5 million, or 11.9%. Partially offsetting these increases were: higher provisions for excess inventory of approximately $6.0 million in fiscal 2008 as compared to fiscal 2007 due to declining market conditions; lower margins on 2008 Child of Mine products due to disappointing over-the-counter performance; and a decline in Carter's and OshKosh brand wholesale margins due to price reductions. The Company includes distribution costs in its selling, general, and administrative expenses. Accordingly, the Company's gross profit may not be comparable to other companies that include such distribution costs in their cost of goods sold. Selling, general, and administrative expenses in fiscal 2008 increased $44.4 million, or 12.4%, to $404.3 million. As a percentage of net sales, selling, general, and administrative expenses in fiscal 2008 were 27.1% as compared to 25.5% in fiscal 2007. The increase in selling, general, and administrative expenses as a percentage of net sales reflects: increase in our consolidated retail expenses from 30.7% of retail store sales in fiscal 2007 to 31.6% in fiscal 2008, related primarily to new store openings and investments in our retail management team; and a provision for incentive compensation of $6.3 million in fiscal 2008 as compared to no provision in fiscal 2007. a decline in distribution costs as a percentage of sales from 4.1% in fiscal 2007 to 3.7% in fiscal 2008 resulting from supply chain efficiencies; and accelerated depreciation of $2.1 million recorded in fiscal 2007 related to the closure of our OshKosh distribution facility. The Company is currently in the process of evaluating its overall cost structure in order to identify areas where costs can be reduced and operations can be run more efficiently. While the timing of and charges associated with any restructuring have not yet been determined, it is likely that some level of restructuring charges will be incurred during the first quarter and balance of fiscal 2009. During the second quarter of fiscal 2007, as a result of negative trends in sales and profitability of the OshKosh wholesale and retail segments and revised projections for such segments, the Company conducted an interim impairment assessment of the value of the intangible assets that the Company recorded in connection with the Acquisition of OshKosh. This assessment was performed in accordance with Statement of Financial Accounting Standards ("SFAS") No. 142, "Goodwill and Intangible Assets." Based on this assessment, charges of approximately $36.0 million and $106.9 million were recorded for the impairment of the cost in excess of fair value of net assets acquired for the wholesale and retail segments, respectively. In addition, an impairment charge of $12.0 million was recorded to reflect the impairment of the value ascribed to the OshKosh tradename. On June 11, 2008, the Company announced the retirement of an executive officer. In connection with this retirement, the Company recorded charges of $5.3 million, $3.1 million of which related to the present value of severance and benefit obligations, and $2.2 million of which related to the accelerated vesting of stock options. On February 15, 2007, the Board of Directors approved management's plan to close the Company's OshKosh distribution facility, which was utilized to distribute the Company's OshKosh brand products. In connection with this closure we recorded costs of $7.4 million, consisting of asset impairment charges of $2.4 million related to a write-down of the related land, building, and equipment, $2.0 million of severance charges, $2.1 million of accelerated depreciation (included in selling, general, and administrative expenses), and $0.9 million in other closure costs during fiscal 2007. In the third quarter of fiscal 2008, the Company wrote down the carrying value of the OshKosh distribution facility by $2.6 million to reflect a reduction of the anticipated selling price of the property as a result of the deterioration in the commercial real estate market. Our royalty income increased $2.9 million, or 9.6%, to $33.7 million in fiscal 2008. We license the use of our Carter's, Just One Year, and Child of Mine brands. Royalty income from these brands was approximately $16.8 million, an increase of 9.1%, or $1.4 million, as compared to fiscal 2007 due to increased sales by our Carter's brand and Child of Mine brand licensees. In addition, in fiscal 2008, the Company began to license the Carter's brand internationally generating $0.3 million in royalty income. We also license the use of our OshKosh B'Gosh, OshKosh, and Genuine Kids from OshKosh brand names. Royalty income from these brands increased approximately $1.3 million, or 8.2%, to $16.6 million in fiscal 2008 and includes $7.1 million of international royalties. This increase was driven by increased sales by our OshKosh brand domestic and international licensees. Our operating income was $135.5 million in fiscal 2008 as compared to an operating loss of $6.0 million in fiscal 2007. This change in our operating results is due largely to the charges in fiscal 2007 related to the impairment of OshKosh's intangible assets and the closure of our OshKosh distribution facility in addition to the other factors described above. Interest expense, net, in fiscal 2008 decreased $5.0 million, or 21.6%, to $18.1 million. This decrease is attributable to a lower effective interest rate on lower weighted-average borrowings. In fiscal 2008, weighted-average borrowings were $340.1 million at an effective interest rate of 5.76% as compared to weighted-average borrowings of $349.2 million at an effective interest rate of 7.01% in fiscal 2007. In fiscal 2008, we recorded $1.1 million in interest expense related to our interest rate swap agreement and $1.2 million in interest expense related to our interest rate collar agreement. In fiscal 2007, we recorded interest income of approximately $1.6 million related to our interest rate swap agreement, which effectively reduced our interest expense under the term loan. Our effective tax rate was approximately 36.1% in fiscal 2008 as compared to approximately (142.8%) in fiscal 2007. This change is a result of the impairment of our OshKosh cost in excess of fair value of net assets acquired asset in fiscal 2007, which was not deductible for income tax purposes. See Note 8 to the accompanying audited consolidated financial statements for a reconciliation of the statutory rate to our effective tax rate. As a result of the factors above, we recorded net income of $75.1 million in fiscal 2008 as compared to a net loss of $70.6 million in fiscal 2007. FISCAL YEAR ENDED DECEMBER 29, 2007 COMPARED WITH FISCAL YEAR ENDED DECEMBER 30, 2006 Consolidated net sales for fiscal 2007 were $1.4 billion, an increase of $68.8 million, or 5.1%, compared to $1.3 billion in fiscal 2006. This increase reflects growth in all three of our Carter's brand distribution channels and our OshKosh brand retail store segment. Carter's brand wholesale sales increased $17.7 million, or 3.8%, in fiscal 2007, to $482.4 million. The increase in Carter's brand wholesale sales was driven by a 4% increase in units shipped. Average price per unit was comparable to fiscal 2006. The growth in units shipped was driven primarily by our baby and playwear product categories, which accounted for approximately 47% and 33% of total Carter's brand wholesale sales, respectively, partially offset by a decrease in sleepwear units shipped. The growth in baby and playwear units shipped was driven by increased demand. OshKosh brand wholesale sales decreased $9.8 million, or 10.2%, in fiscal 2007 to $86.6 million. The decrease in OshKosh brand wholesale sales was impacted by a 19% decrease in average price per unit, partially offset by an 11% increase in units shipped as compared to fiscal 2006. The decrease in average prices reflects changes in product mix and higher levels of customer accommodations as compared to the prior year. Carter's retail stores sales increased $33.2 million, or 10.0%, in fiscal 2007 to $366.3 million. The increase was driven by incremental sales of $22.8 million generated by new store openings and a comparable store sales increase of $13.3 million, or 4.1% (based on 206 locations), partially offset by the impact of store closures of $2.8 million. During fiscal 2007, units per transaction increased 5.3% and average prices decreased 3.0% as compared to fiscal 2006. Average prices decreased due to increased promotional pricing on spring sleepwear and fall playclothes products. We believe increased promotional pricing drove the increase in unit volume. Average inventory levels, on a comparable store basis, were up 10.9% as compared to fiscal 2006. We believe these higher average inventory levels helped drive our comparable store sales increases. There were a total of 228 Carter's retail stores as of December 29, 2007. During fiscal 2007, we opened ten stores and closed one store. OshKosh retail store sales increased $4.7 million, or 2.0%, in fiscal 2007 to $233.8 million. The increase was due to incremental sales of $15.2 million generated by new store openings, partially offset by a comparable store sales decrease of $9.8 million, or 4.3% (based on 146 locations), and the impact of store closings of $0.8 million. Average prices decreased 6.0% and units per transaction increased 4.4%. Average prices decreased due to increased promotional activity across all major product categories. Average inventory levels, on a comparable store basis, were up 22.5% as compared to fiscal 2006. There were a total of 163 OshKosh retail stores as of December 29, 2007. During fiscal 2007, we opened nine stores and closed three stores. Mass channel sales increased $22.9 million, or 10.4%, in fiscal 2007 to $243.3 million. The increase was driven by increased sales of $11.9 million, or 8.8%, of our Child of Mine brand to Wal-Mart and increased sales of $11.0 million, or 12.9%, of our Just One Year brand to Target. The growth in sales of our Child of Mine brand was driven by gaining additional floor space for fall sleepwear and fall playwear products. Growth in sales of our Just One Year brand was driven by new door growth and better product performance. Our gross profit decreased $5.2 million, or 1.1%, to $483.3 million in fiscal 2007. Gross profit as a percentage of net sales was 34.2% in fiscal 2007 as compared to 36.4% in fiscal 2006. The decrease in gross profit as a percentage of net sales reflects: a decrease in gross profit in our consolidated retail segments, primarily OshKosh, due to increased promotional pricing (consolidated retail gross margin decreased from 51.1% in fiscal 2006 to 47.8% in fiscal 2007 despite an increase in consolidated retail net sales of 6.7% in fiscal 2007); the impact of OshKosh brand wholesale product performance, which led to higher levels of customer accommodations in fiscal 2007; and the impact of $4.9 million in higher losses associated with excess inventory. Selling, general, and administrative expenses in fiscal 2007 increased $7.4 million, or 2.1%, to $359.8 million. As a percentage of net sales, selling, general, and administrative expenses in fiscal 2007 were 25.5% as compared to 26.2% in fiscal 2006. The decrease in selling, general, and administrative expenses as a percentage of net sales reflects: a reduction in incentive compensation expense of $10.2 million as compared to fiscal 2006; controlling growth in spending to a rate lower than the growth in net sales for fiscal 2007; and the reversal in fiscal 2007 of approximately $1.5 million of previously recorded stock-based compensation expense and the reduction in fiscal 2007 of $1.2 million of stock-based compensation expense on performance-based stock awards (see Note 6). Partially offsetting these decreases were: accelerated depreciation charges of $2.1 million in fiscal 2007 related to the closure of our OshKosh distribution facility; and increased severance, recruiting, and relocation expenses of $1.9 million as compared to fiscal 2006. The increase was driven primarily by restructuring our retail store management team. During the second quarter of fiscal 2007, as a result of negative trends in sales and profitability of the OshKosh wholesale and retail segments and revised projections for such segments, the Company conducted an interim impairment assessment on the value of the intangible assets that the Company recorded in connection with the Acquisition of OshKosh. This assessment was performed in accordance with Statement of Financial Accounting Standards ("SFAS") No. 142, "Goodwill and Intangible Assets." Based on this assessment, charges of approximately $36.0 million and $106.9 million were recorded for the impairment of the cost in excess of fair value of net assets acquired for the wholesale and retail segments, respectively. In addition, an impairment charge of $12.0 million was recorded to reflect the impairment of the value ascribed to the OshKosh tradename. CLOSURE COSTS In May 2005, we decided to exit two Carter's sewing facilities in Mexico. During fiscal 2006, in connection with these closures, we recorded costs of $91,000, including $74,000 of severance and $17,000 of other exit costs. We license the use of our Carter's, Just One Year, and Child of Mine brands. Royalty income from these brands was approximately $15.3 million, an increase of 2.1%, or $0.3 million, as compared to fiscal 2006 due to increased sales by our Carter's brand and Child of Mine brand licensees. We license the use of our OshKosh and Genuine Kids from OshKosh brand names. Royalty income from these brands increased approximately $1.3 million, or 8.9%, to $15.4 million in fiscal 2007 and includes $6.5 million of international royalty. This increase was driven primarily by increased sales by our OshKosh brand domestic licensees. OPERATING (LOSS) INCOME Our operating loss was $6.0 million in fiscal 2007 as compared to operating income of $165.1 million in fiscal 2006. The decrease in operating results was due to the factors described above including the charges incurred in fiscal 2007 related to the impairment of OshKosh's intangible assets and the closure of our OshKosh distribution facility, partially offset by the reversal of stock-based compensation expense associated with performance stock awards. Interest expense in fiscal 2007 decreased $3.8 million, or 14.3%, to $23.1 million. This decrease is attributable to accelerated debt reduction in fiscal 2006 and a lower effective interest rate. In fiscal 2007, weighted-average borrowings were $349.2 million at an effective interest rate of 7.01% as compared to weighted-average borrowings of $397.9 million at an effective interest rate of 7.25% in fiscal 2006. In fiscal 2007 and 2006, our interest rate swap agreement reduced our interest expense under the Term Loan by approximately $1.6 million and $1.3 million, respectively. Our effective tax rate was approximately (142.8%) in fiscal 2007 as compared to approximately 36.9% in fiscal 2006. This change in our effective tax rate is a result of the impairment of our OshKosh cost in excess of fair value of net assets acquired asset, which is not deductible for income tax purposes. See Note 8 to the accompanying audited consolidated financial statements for a reconciliation of the statutory rate to our effective tax rate. As a result of the factors above, we recorded a net loss for fiscal 2007 of $70.6 million as compared to net income of $87.2 million in fiscal 2006. Our primary cash needs are working capital and capital expenditures. Our primary source of liquidity will continue to be cash flow from operations and borrowings under our Revolver, and we expect that these sources will fund our ongoing requirements for working capital and capital expenditures. These sources of liquidity may be impacted by continued demand for our products and our ability to meet debt covenants under our Senior Credit Facility, described below. Net accounts receivable at January 3, 2009 were $106.1 million compared to $119.7 million at December 29, 2007. This decrease reflects lower levels of wholesale revenue in the latter part of fiscal 2008 as compared to the latter part of fiscal 2007. Net inventories at January 3, 2009 were $203.5 million compared to $225.5 million at December 29, 2007. This decrease was due primarily to improved inventory management across all business segments. Net cash provided by operating activities for fiscal 2008 was $183.6 million compared to $52.0 million in fiscal 2007. This change is primarily attributable to improved working capital management. We expect operating cash flow in fiscal 2009 to return to levels more consistent with those achieved in the previous two years. Net cash provided by our operating activities in fiscal 2006 was approximately $88.2 million. We invested $37.5 million in capital expenditures during fiscal 2008 compared to $21.9 million in fiscal 2007. Major investments included retail store openings and remodelings (including retail store fixtures), a new point of sale system for our retail stores, fixtures for our wholesale customers, and a new finance and retail store administration office in Shelton, Connecticut. We plan to invest approximately $40 million in capital expenditures in fiscal 2009 primarily for retail store openings and remodelings (including retail store fixtures), fixtures for our wholesale customers, and investments in information technology. On February 16, 2007, the Board of Directors approved a stock repurchase program, pursuant to which the Company is authorized to purchase up to $100 million of its outstanding common shares. Such repurchases may occur from time to time in the open market, in negotiated transactions, or otherwise. This program has no time limit. The timing and amount of any repurchases will be determined by management, based on its evaluation of market conditions, share price, and other factors. During fiscal 2008, the Company repurchased and retired 2,126,361 shares, or approximately $33.6 million, of its common stock at an average price of $15.82 per share. Since inception of the program and through fiscal 2008, the Company repurchased and retired 4,599,580 shares, or approximately $91.1 million, of its common stock at an average price of $19.81 per share. At January 3, 2009, we had approximately $338.0 million in Term Loan borrowings and no borrowings under our Revolver, exclusive of $8.6 million of outstanding letters of credit. At December 29, 2007, we had approximately $341.5 million in Term Loan borrowings and no borrowings under our Revolver, exclusive of approximately $16.3 million of outstanding letters of credit. Weighted-average borrowings for fiscal 2008 were $340.1 million at an effective rate of 5.76% as compared to weighted-average borrowings of $349.2 million at an effective rate of 7.01% in fiscal 2007. The term of the Revolver expires July 14, 2011 and the term of the Term Loan expires July 14, 2012. Principal borrowings under the Term Loan are due and payable in quarterly installments of $0.9 million from March 31, 2009 through June 30, 2012 with the remaining balance of $325.8 million due on July 14, 2012. In fiscal 2008 and fiscal 2007, we made scheduled amortization payments of $3.5 million in each year. The Term Loan has an applicable rate of LIBOR + 1.50%, regardless of the Company's overall leverage level. Interest is payable at the end of interest rate reset periods, which vary in length, but in no case exceed 12 months for LIBOR rate loans and quarterly for prime rate loans. The effective interest rate on Term Loan borrowings as of January 3, 2009 and December 29, 2007 was 3.3% and 6.4%. The Senior Credit Facility contains and defines financial covenants, including a minimum interest coverage ratio, maximum leverage ratio, and a fixed charge coverage ratio. As of January 3, 2009, the Company is in compliance with all debt covenants. The Senior Credit Facility also sets forth mandatory and optional prepayment conditions, including an annual excess cash flow requirement, as defined, that may result in our use of cash to reduce our debt obligations. There was no excess cash flow payment required for fiscal 2008 or 2007. Our obligations under the Senior Credit Facility are collateralized by a first priority lien on substantially all of our assets, including the assets of our domestic subsidiaries. Our Senior Credit Facility requires us to hedge at least 25% of our variable rate debt under the term loan. On September 22, 2005, we entered into an interest rate swap agreement to receive floating interest and pay fixed interest. This interest rate swap agreement is designated as a cash flow hedge of the variable interest payments on a portion of our variable rate term loan debt. The interest rate swap agreement matures on July 30, 2010. As of January 3, 2009, approximately $55.3 million of our outstanding term loan debt was hedged under this agreement. On May 25, 2006, we entered into an interest rate collar agreement with a floor of 4.3% and a ceiling of 5.5%. The interest rate collar agreement covers $100 million of our variable rate term loan debt and is designated as a cash flow hedge of the variable interest payments on such debt. The interest rate collar agreement matures on January 31, 2009. On January 30, 2009, we entered into two interest rate swap agreements, each covering $50.0 million of our variable rate Term Loan debt, to receive floating rate interest and pay fixed interest. These swap agreements are designated as cash flow hedges of the variable interest payments on a portion of our variable rate Term Loan debt. These swap agreements mature in January 2010. Our operating results are subject to risk from interest rate fluctuations on our Senior Credit Facility, which carries variable interest rates. As of January 3, 2009, our outstanding debt aggregated approximately $338.0 million, of which $182.7 million bore interest at a variable rate. An increase or decrease of 1% in the applicable rate would increase or decrease our annual interest cost by $1.8 million, exclusive of variable rate debt subject to our swap and collar agreements, and could have an adverse effect on our net income (loss) and cash flow. The following table summarizes as of January 3, 2009, the maturity or expiration dates of mandatory contractual obligations and commitments for the following fiscal years: $ 3,503 $ 3,503 $ 3,503 $ 327,517 $ -- $ -- $ 338,026 Interest on debt: Variable rate (a) 11,007 11,007 11,007 5,503 -- -- 38,524 Operating leases (see Note 10 to the Consolidated Financial Statements) 52,888 46,278 35,502 26,407 21,240 51,692 234,007 Total financial obligations 67,398 60,788 50,012 359,427 21,240 51,692 610,557 8,571 -- -- -- -- -- 8,571 Purchase obligations (b) 210,648 -- -- -- -- -- 210,648 Total financial obligations and commitments $ 286,617 $ 60,788 $ 50,012 $ 359,427 $ 21,240 $ 51,692 $ 829,776 Reflects estimated variable rate interest on obligations outstanding on our Term Loan as of January 3, 2009 using an interest rate of 3.3% (rate in effect at January 3, 2009). Unconditional purchase obligations are defined as agreements to purchase goods or services that are enforceable and legally binding on us and that specify all significant terms, including fixed or minimum quantities to be purchased; fixed, minimum, or variable price provisions; and the approximate timing of the transaction. The purchase obligations category above relates to commitments for inventory purchases. Amounts reflected on the accompanying audited consolidated balance sheets in accounts payable or other current liabilities are excluded from the table above. In addition to the total contractual obligations and commitments in the table above, we have post-retirement benefit obligations and reserves for uncertain tax positions, included in other current and other long-term liabilities as further described in Note 7 and Note 8, respectively, to the accompanying audited consolidated financial statements. Based on our current level of operations, we believe that cash generated from operations and available cash, together with amounts available under our Revolver, will be adequate to meet our debt service requirements, capital expenditures, and working capital needs for the foreseeable future, although no assurance can be given in this regard. We may, however, need to refinance all or a portion of the principal amount of amounts outstanding under our Revolver on or before July 14, 2011 and amounts outstanding under our Term Loan on or before July 14, 2012. The continuing volatility in the financial markets and the related economic downturn in markets throughout the world could have a material adverse effect on our business. While we currently generate significant cash flows from our ongoing operations and have access to credit through amounts available under our Revolver, credit markets have recently experienced significant disruptions and certain leading financial institutions have either declared bankruptcy or have shown significant deterioration in their financial stability. Further deterioration in the financial markets could make future financing difficult or more expensive. If any of the financial institutions that are parties to our Revolver were to declare bankruptcy or become insolvent, they may be unable to perform under their agreements with us. This could leave us with reduced borrowing capacity. In addition, tighter credit markets may lead to business disruptions for certain of our suppliers, contract manufacturers or trade customers and consequently, could disrupt our business. EFFECTS OF INFLATION AND DEFLATION We are affected by inflation and changing prices primarily through purchasing product from our global suppliers, increased operating costs and expenses, and fluctuations in interest rates. The effects of inflation on our net sales and operations have not been material in recent years. In recent years, there has been deflationary pressure on selling prices. If deflationary price trends outpace our ability to obtain price reductions from our global suppliers, our profitability may be affected. We experience seasonal fluctuations in our sales and profitability, with generally lower sales and gross profit in the first and second quarters of our fiscal year. Over the past five fiscal years, excluding the impact of the OshKosh acquisition in fiscal 2005, approximately 57% of our consolidated net sales were generated in the second half of our fiscal year. Accordingly, our results of operations for the first and second quarters of any year are not indicative of the results we expect for the full year. As a result of this seasonality, our inventory levels and other working capital requirements generally begin to increase during the second quarter and into the third quarter of each fiscal year. During these peak periods, we had historically borrowed under our Revolver. In fiscal 2008, we had no borrowings under our Revolver. In fiscal 2007, we had $41.6 million in peak borrowings under our Revolver. Our discussion and analysis of our financial condition and results of operations are based upon our consolidated financial statements, which have been prepared in accordance with accounting principles generally accepted in the United States of America. The preparation of these financial statements requires us to make estimates and judgments that affect the reported amounts of assets, liabilities, revenues, expenses, and related disclosure of contingent assets and liabilities. We base our estimates on historical experience and on various other assumptions that we believe are reasonable under the circumstances, the results of which form the basis for making judgments about the carrying values of assets and liabilities that are not readily apparent from other sources. Actual results may differ from these estimates under different assumptions or conditions. Our significant accounting policies are described in Note 2 to the accompanying audited consolidated financial statements. The following discussion addresses our critical accounting policies and estimates, which are those policies that require management's most difficult and subjective judgments, often as a result of the need to make estimates about the effect of matters that are inherently uncertain. Revenue recognition: We recognize wholesale and mass channel revenue after shipment of products to customers, when title passes, when all risks and rewards of ownership have transferred, the sales price is fixed or determinable, and collectibility is reasonably assured. In certain cases, in which we retain the risk of loss during shipment, revenue recognition does not occur until the goods have reached the specified customer. In the normal course of business, we grant certain accommodations and allowances to our wholesale and mass channel customers in order to assist these customers with inventory clearance or promotions. Such amounts are reflected as a reduction of net sales and are recorded based upon historical trends and annual forecasts. Retail store revenues are recognized at the point of sale. We reduce revenue for customer returns and deductions. We also maintain an allowance for doubtful accounts for estimated losses resulting from the inability of our customers to make payments and other actual and estimated deductions. If the financial condition of our customers were to deteriorate, resulting in an impairment of their ability to make payments, an additional allowance could be required. Past due balances over 90 days are reviewed individually for collectibility. Our credit and collections department reviews all other balances regularly. Account balances are charged off against the allowance when we believe it is probable the receivable will not be recovered. We contract with a third-party service to provide us with the fair value of cooperative advertising arrangements entered into with certain of our major wholesale and mass channel customers. Such fair value is determined based upon, among other factors, comparable market analysis for similar advertisements. In accordance with EITF Issue No. 01-09, "Accounting for Consideration Given by a Vendor to a Customer/Reseller," we have included the fair value of these arrangements of approximately $2.1 million in fiscal 2008, $2.5 million in fiscal 2007, and $3.3 million in fiscal 2006 as a component of selling, general, and administrative expenses on the accompanying audited consolidated statement of operations rather than as a reduction of revenue. Amounts determined to be in excess of the fair value of these arrangements are recorded as a reduction of net sales. Inventory: We provide reserves for slow-moving inventory equal to the difference between the cost of inventory and the estimated market value based upon assumptions about future demand and market conditions. If actual market conditions are less favorable than those we project, additional write-downs may be required. Cost in excess of fair value of net assets acquired and tradename: As of January 3, 2009, we had approximately $136.6 million in Carter's cost in excess of fair value of net assets acquired and $305.7 million of aggregate value related to the Carter's and OshKosh tradename assets. The fair value of the Carter's tradename was estimated at the acquisition of Carter's, Inc. by Berkshire Partners LLC which was consummated on August 15, 2001, using a discounted cash flow analysis, which examined the hypothetical cost savings that accrue as a result of our ownership of the tradename. The fair value of the OshKosh tradename was also estimated at its acquisition date using an identical discounted cash flow analysis. The tradenames were determined to have indefinite lives. The carrying values of these assets are subject to annual impairment reviews in accordance with Statement of Financial Accounting Standards No. 142, "Goodwill and other Intangible Assets," as of the last day of each fiscal year. Factors affecting such impairment reviews include the continued market acceptance of our offered products and the development of new products. Impairment reviews may also be triggered by any significant events or changes in circumstances. Accrued expenses: Accrued expenses for workers' compensation, incentive compensation, health insurance, and other outstanding obligations are assessed based on actual commitments, statistical trends, and estimates based on projections and current expectations, and these estimates are updated periodically as additional information becomes available. Loss contingencies: We record accruals for various contingencies including legal exposures as they arise in the normal course of business. In accordance with SFAS No. 5, "Accounting for Contingencies," we determine whether to disclose and accrue for loss contingencies based on an assessment of whether the risk of loss is remote, reasonably possible or probable. Our assessment is developed in consultation with our internal and external counsel and other advisors and is based on an analysis of possible outcomes under various strategies. Loss contingency assumptions involve judgments that are inherently subjective and can involve matters that are in litigation, which, by its nature is unpredictable. We believe that our assessment of the probability of loss contingencies is reasonable, but because of the subjectivity involved and the unpredictable nature of the subject matter at issue, our assessment may prove ultimately to be incorrect, which could materially impact our consolidated financial statements. Accounting for income taxes: As part of the process of preparing the accompanying audited consolidated financial statements, we are required to estimate our actual current tax exposure (state, federal, and foreign). We assess our income tax positions and record tax benefits for all years subject to examination based upon management's evaluation of the facts, circumstances, and information available at the reporting dates. For those uncertain tax positions where it is "more likely than not" that a tax benefit will be sustained, we have recorded the largest amount of tax benefit with a greater than 50% likelihood of being realized upon ultimate settlement with a taxing authority that has full knowledge of all relevant information. For those income tax positions where it is not "more likely than not" that a tax benefit will be sustained, no tax benefit has been recognized in the financial statements. Where applicable, associated interest is also recognized. We also assess permanent and temporary differences resulting from differing bases and treatment of items for tax and accounting purposes, such as the carrying value of intangibles, deductibility of expenses, depreciation of property, plant, and equipment, stock-based compensation expense, and valuation of inventories. Temporary differences result in deferred tax assets and liabilities, which are included within our consolidated balance sheets. We must then assess the likelihood that our deferred tax assets will be recovered from future taxable income. Actual results could differ from this assessment if sufficient taxable income is not generated in future periods. To the extent we determine the need to establish a valuation allowance or increase such allowance in a period, we must include an expense within the tax provision in the accompanying audited consolidated statement of operations. Employee benefit plans: We sponsor a defined benefit pension, defined contribution and other post-retirement plans. Major assumptions used in the accounting for these employee benefit plans include the discount rate, expected return on the pension fund assets, and health care cost increase projections. See Note 7, "Employee Benefits Plans," to the accompanying audited consolidated financial statements for further details on rates and assumptions. Stock-based compensation arrangements: The Company accounts for stock-based compensation in accordance with the fair value recognition provisions of SFAS No. 123 (revised 2004), "Share-Based Payment" ("SFAS 123R"). The Company adopted SFAS 123R using the modified prospective application method of transition. The Company uses the Black-Scholes option pricing model, which requires the use of subjective assumptions. These assumptions include the following: Volatility – This is a measure of the amount by which a stock price has fluctuated or is expected to fluctuate. The Company uses actual monthly historical changes in the market value of our stock since the Company's initial public offering on October 29, 2003, supplemented by peer company data for periods prior to our initial public offering covering the expected life of stock options being valued. An increase in the expected volatility will increase compensation expense. Risk-free interest rate – This is the U.S. Treasury rate as of the grant date having a term equal to the expected term of the stock option. An increase in the risk-free interest rate will increase compensation expense. Expected term – This is the period of time over which the stock options granted are expected to remain outstanding and is based on historical experience and estimated future exercise behavior. Separate groups of employees that have similar historical exercise behavior are considered separately for valuation purposes. An increase in the expected term will increase compensation expense. Dividend yield – The Company does not have plans to pay dividends in the foreseeable future. An increase in the dividend yield will decrease compensation expense. Forfeitures – The Company estimates forfeitures of stock-based awards based on historical experience and expected future activity. Changes in the subjective assumptions can materially affect the estimate of fair value of stock-based compensation and consequently, the related amount recognized in the accompanying audited consolidated statement of operations. The Company accounts for its performance-based awards in accordance with SFAS 123R and records stock-based compensation expense over the vesting term of the awards that are expected to vest based on whether it is probable that the performance criteria will be achieved. The Company reassesses the probability of vesting at each reporting period for awards with performance criteria and adjusts stock-based compensation expense based on its probability assessment. In December 2007, the Financial Accounting Standards Board ("FASB") issued SFAS No. 141 (revised 2007), "Business Combinations" ("SFAS 141(R)"), which replaces SFAS 141, "Business Combinations" ("SFAS 141"). SFAS 141(R) retains the underlying concepts of SFAS 141 in that all business combinations are still required to be accounted for at fair value under the acquisition method of accounting, but SFAS 141(R) changed the method of applying the acquisition method in a number of significant aspects. Acquisition costs will generally be expensed as incurred; noncontrolling interests will be valued at fair value at the acquisition date; in-process research and development will be recorded at fair value as an indefinite-lived intangible asset at the acquisition date; restructuring costs associated with a business combination will generally be expensed subsequent to the acquisition date; and changes in deferred tax asset valuation allowances and income tax uncertainties after the acquisition date generally will affect income tax expense. SFAS 141(R) is effective on a prospective basis for all business combinations for which the acquisition date is on or after the beginning of the first annual period subsequent to December 15, 2008. SFAS 141(R) amends SFAS No. 109, "Accounting for Income Taxes," such that adjustments made to valuation allowances on deferred taxes and acquired tax contingencies associated with acquisitions that closed prior to the effective date of SFAS 141(R) would also apply the provisions of SFAS 141(R). Early adoption is not permitted. We have evaluated the impact that SFAS 141(R) will have on our consolidated financial statements and have determined that it will not have a material impact on our consolidated financial statements. In February 2008, the FASB issued FASB Staff Position ("FSP") No. FAS 157-2 ("FSP 157-2"), which delays the effective date of SFAS 157, "Fair Value Measurements," for nonfinancial assets and nonfinancial liabilities, except for items that are recognized or disclosed at fair value in the financial statements on a recurring basis (at least annually). Nonfinancial assets and nonfinancial liabilities would include all assets and liabilities other than those meeting the definition of a financial asset or financial liability as defined in paragraph 6 of SFAS No. 159, "The Fair Value Option for Financial Assets and Financial Liabilities." This FSP defers the effective date of Statement 157 to fiscal years beginning after November 15, 2008, and interim periods within those fiscal years for items within the scope of FSP 157-2. We have evaluated the impact that FSP 157-2 will have on our consolidated financial statements and have determined that it will not have a material impact on our consolidated financial statements. In March 2008, the FASB issued SFAS No. 161, "Disclosures about Derivative Instruments and Hedging Activities – an Amendment of FASB Statement No. 133," which requires enhanced disclosures on the effect of derivatives on a Company's financial statements. These disclosures will be required for the Company beginning with the first quarter of fiscal 2009 consolidated financial statements. We will include such required disclosures beginning with our Quarterly Report on Form 10-Q for the three-month period ending April 4, 2009. In April 2008, the FASB issued FSP No. 142-3, "Determination of the Useful Life of Intangible Assets" ("FSP 142-3"). The FSP amends the factors an entity should consider in developing renewal or extension assumptions used in determining the useful life of recognized intangible assets under SFAS No. 142, "Goodwill and Other Intangible Assets," and adds certain disclosures for an entity's accounting policy of the treatment of the costs, period of extension, and total costs incurred. The FSP must be applied prospectively to intangible assets acquired after January 1, 2009. We have evaluated the impact that FSP 142-3 will have on our consolidated financial statements and have determined that it will not have a material impact on our consolidated financial statements. In December 2008, the FASB issued FSP No. FAS 132(R)-1, "Employers' Disclosures about Postretirement Benefit Plan Assets" ("FSP FAS 132(R)-1"), to provide guidance on an employers' disclosures about plan assets of a defined benefit pension or other postretirement plan. This FSP is effective for fiscal years ending after December 15, 2009. We are currently evaluating the impact that FSP FAS 132(R)-1 will have on our consolidated financial statements. Statements contained herein that relate to our future performance, including, without limitation, statements with respect to our anticipated results of operations or level of business for fiscal 2009 or any other future period, are forward-looking statements within the meaning of the safe harbor provisions of the Private Securities Litigation Reform Act of 1995. Such statements are based on current expectations only and are subject to certain risks, uncertainties, and assumptions. Should one or more of these risks or uncertainties materialize, or should underlying assumptions prove incorrect, actual results may vary materially from those anticipated, estimated, or projected. These risks are described herein under the heading "Risk Factors" on page 7. We undertake no obligation to publicly update or revise any forward-looking statements, whether as a result of new information, future events, or otherwise. CURRENCY AND INTEREST RATE RISKS In the operation of our business, we have market risk exposures including those related to foreign currency risk and interest rates. These risks and our strategies to manage our exposure to them are discussed below. We contract for production with third parties primarily in Asia and South and Central America. While these contracts are stated in United States dollars, there can be no assurance that the cost for the future production of our products will not be affected by exchange rate fluctuations between the United States dollar and the local currencies of these contractors. Due to the number of currencies involved, we cannot quantify the potential impact of future currency fluctuations on net income (loss) in future years. In order to manage this risk, we source products from approximately 140 vendors worldwide, providing us with flexibility in our production should significant fluctuations occur between the United States dollar and various local currencies. To date, such exchange fluctuations have not had a material impact on our financial condition or results of operations. We do not hedge foreign currency exchange rate risk. Our operating results are subject to risk from interest rate fluctuations on our Senior Credit Facility, which carries variable interest rates. As of January 3, 2009, our outstanding debt aggregated approximately $338.0 million, of which $182.7 million bore interest at a variable rate. An increase or decrease of 1% in the applicable rate would increase or decrease our annual interest cost by $1.8 million, exclusive of variable rate debt subject to our interest rate swap and collar agreements, and could have an adverse effect on our net income (loss) and cash flow. We enter into various purchase order commitments with full-package suppliers. We can cancel these arrangements, although in some instances, we may be subject to a termination charge reflecting a percentage of work performed prior to cancellation. As we rely exclusively on our full-package global sourcing network, we could incur more of these termination charges, which could increase our cost of goods sold and have a material impact on our business. Consolidated Balance Sheets at January 3, 2009 and December 29, 2007 Consolidated Statements of Operations for the fiscal years ended January 3, 2009, December 29, 2007, and December 30, 2006 Consolidated Statements of Cash Flows for the fiscal years ended January 3, 2009, December 29, 2007, and December 30, 2006 Consolidated Statements of Changes in Stockholders' Equity for the fiscal years ended January 3, 2009, December 29, 2007, and December 30, 2006 To the Board of Directors and Stockholders of Carter's, Inc.: In our opinion, the consolidated financial statements listed in the accompanying index present fairly, in all material respects, the financial position of Carter's, Inc. and its subsidiaries at January 3, 2009 and December 29, 2007, and the results of their operations and their cash flows for each of the three years in the period ended January 3, 2009 in conformity with accounting principles generally accepted in the United States of America. Also in our opinion, the Company maintained, in all material respects, effective internal control over financial reporting as of January 3, 2009, based on criteria established in Internal Control - Integrated Framework issued by the Committee of Sponsoring Organizations of the Treadway Commission (COSO). The Company's management is responsible for these financial statements, for maintaining effective internal control over financial reporting and for its assessment of the effectiveness of internal control over financial reporting, included in Management's Report on Internal Control over Financial Reporting appearing under Item 9A. Our responsibility is to express opinions on these financial statements and on the Company's internal control over financial reporting based on our integrated audits. We conducted our audits in accordance with the standards of the Public Company Accounting Oversight Board (United States). Those standards require that we plan and perform the audits to obtain reasonable assurance about whether the financial statements are free of material misstatement and whether effective internal control over financial reporting was maintained in all material respects. Our audits of the financial statements included examining, on a test basis, evidence supporting the amounts and disclosures in the financial statements, assessing the accounting principles used and significant estimates made by management, and evaluating the overall financial statement presentation. Our audit of internal control over financial reporting included obtaining an understanding of internal control over financial reporting, assessing the risk that a material weakness exists, and testing and evaluating the design and operating effectiveness of internal control based on the assessed risk. Our audits also included performing such other procedures as we considered necessary in the circumstances. We believe that our audits provide a reasonable basis for our opinions. A company's internal control over financial reporting is a process designed to provide reasonable assurance regarding the reliability of financial reporting and the preparation of financial statements for external purposes in accordance with generally accepted accounting principles. A company's internal control over financial reporting includes those policies and procedures that (i) pertain to the maintenance of records that, in reasonable detail, accurately and fairly reflect the transactions and dispositions of the assets of the company; (ii) provide reasonable assurance that transactions are recorded as necessary to permit preparation of financial statements in accordance with generally accepted accounting principles, and that receipts and expenditures of the company are being made only in accordance with authorizations of management and directors of the company; and (iii) provide reasonable assurance regarding prevention or timely detection of unauthorized acquisition, use, or disposition of the company's assets that could have a material effect on the financial statements. /s/ PricewaterhouseCoopers LLP (dollars in thousands, except for share data) Accounts receivable, net of reserve for doubtful accounts of $5,167 in fiscal 2008 and $4,743 in fiscal 2007 Finished goods inventories, net Property, plant, and equipment, net Tradenames Cost in excess of fair value of net assets acquired Licensing agreements, net of accumulated amortization of $13,840 in fiscal 2008 and $10,185 in fiscal 2007 Deferred debt issuance costs, net $ 1,051,057 $ 974,668 Current maturities of long-term debt Preferred stock; par value $.01 per share; 100,000 shares authorized; none issued or outstanding at January 3, 2009 and December 29, 2007 Common stock, voting; par value $.01 per share; 150,000,000 shares authorized; 56,352,111 and 57,663,315 shares issued and outstanding at January 3, 2009 and December 29, 2007, respectively (7,318 ) 2,671 The accompanying notes are an integral part of the consolidated financial statements Intangible asset impairment (Note 2) -- 154,886 -- Executive retirement charges (Note 16) 5,325 -- -- Facility write-down and closure costs (Note 15) 2,609 5,285 91 135,494 (6,009 ) 165,111 117,407 (29,088 ) 138,188 $ 75,058 $ (70,618 ) $ 87,220 Basic net income (loss) per common share $ 1.33 $ (1.22 ) $ 1.50 Diluted net income (loss) per common share Basic weighted-average number of shares outstanding Diluted weighted-average number of shares outstanding Adjustments to reconcile net income (loss) to net cash provided by operating activities: Non-cash intangible asset impairment charges Non-cash stock-based compensation expense Non-cash facility write-down and closure costs 2,609 2,450 -- Loss on disposal/sale of property, plant, and equipment Income tax benefit from exercised stock options (1,979 ) (9,630 ) 502 Effect of changes in operating assets and liabilities: 13,647 (9,092 ) (14,471 ) 22,008 (31,906 ) (5,134 ) Prepaid expenses and other assets (2,043 ) (1,404 ) (886 ) 22,422 (13,721 ) 7,181 15,154 3,882 (11,936 ) 183,623 51,987 88,224 Proceeds from sale of property, plant, and equipment -- 57 348 Payments on term loan (3,503 ) (3,503 ) (85,000 ) Proceeds from revolving loan facility -- 121,400 5,000 Payments on revolving loan facility -- (121,400 ) (5,000 ) (33,637 ) (57,467 ) -- 852 3,039 2,390 113,337 (19,533 ) (15,731 ) CONSOLIDATED STATEMENTS OF CHANGES IN STOCKHOLDERS' EQUITY paid-in Accumulated other comprehensive income (loss) Total stockholders' $ 289 $ 260,414 $ (2,749 ) $ 1,354 $ 127,336 $ 386,644 Exercise of stock options (994,250 shares) 9 2,381 2,390 Stock-based compensation expense Issuance of common stock (17,172 shares) Reversal of deferred compensation (Note 6)

Daily coffee doesn't affect cancer risk, according to new research from QIMR Home / Daily coffee doesn't affect cancer risk, according to new research from QIMR Researchers from QIMR Berghofer Medical Research Institute have found that drinking coffee does not change a person's risk of being diagnosed with, or dying from, cancer, in a study published in the International Journal of Epidemiology. The large Mendelian randomisation study looked at data from more than 300,000 people and showed that drinking coffee every day neither reduced nor increased a person's risk of developing any cancer. Coffee contains a complex mixture of bioactive ingredients, including substances such as caffeine and kahweol, which have been shown to display antitumour effects in animal studies. However, its potential anticancer effect on humans has not been established, with studies to date producing conflicting findings for overall cancer risk and for individual cancers such as breast and prostate cancers. The QIMR Berghofer study used cancer data drawn from the UK Biobank cohort for more than 46,000 people who had been diagnosed with most invasive cancer types, including about 7,000 people who died from the disease. Senior author, QIMR's Associate Professor Stuart MacGregor said "Our two-pronged research looked at whether cancer rates differed among people with different levels of self-reported coffee consumption, and whether the same trend was seen when we replaced self-reported consumption with genetic predisposition towards coffee consumption. We found there was no real relationship between how many cups of coffee a person had a day and if they developed any particular cancers." "The study also ruled out a link between coffee intake and dying from the disease," he said. The genetic and preference information from the people with cancer was compared with data from more than 270,000 others who had never been diagnosed with cancer. QIMR Berghofer lead researcher, Jue-Sheng Ong, said the study also looked at some common individual cancers such as breast, ovarian, lung and prostate cancers and found drinking coffee did not increase or decrease their incidence. "There was some inconclusive evidence about colorectal cancer, where those who reported drinking a lot of coffee had a slightly lower risk of developing cancer, but conversely examination of data from those people with a higher genetic predisposition to drink more coffee seemed to indicate a greater risk of developing the disease. The disparity in those findings would suggest more research is needed to clarify if there is any relationship between colorectal cancer and coffee" Mr Ong said. Associate Professor MacGregor said the study had implications for public health messaging around the world. "The health benefits of coffee have been argued for a long time, but this research shows simply changing your coffee consumption isn't an effective way of protecting yourself from cancer," he said

static const uint64_t PRIMES[] = { 108641969, 116049371, 125925907, 133333309, 145678979, 175308587, 197530793, 234567803, 251851741, 264197411, 330864029, 399999781, 407407183, 459258997, 479012069, 545678687, 560493491, 607407037, 629629243, 656789717, 716048933, 718518067, 725925469, 733332871, 753085943, 755555077, 782715551, 790122953, 812345159, 814814293, 893826581, 923456189, 940740127, 953085797, 985184539, 990122807}; static const uint64_t PRIMES_SIZE = sizeof(PRIMES) / sizeof(PRIMES[0]); // Calculate hashes of ngrams that preceeds word_index in the sentence // // Fills ngram_hashes array with numbers in {0, 1, ..., max_hash_index - 1} // If add_padding then dummy -1 words are added to the beginning of the sentence // Return the number of indices filled (maybe less than maxent_order // for a few first sentence words if add_padding is false) int CalculateMaxentHashIndices( const WordIndex *sen, int word_index, int maxent_order, uint64_t max_hash_index, bool add_padding, uint64_t ngram_hashes[MAX_NGRAM_ORDER]); class MaxEnt { public: enum LearningMethod {kSGD, kAdaGrad, kFTRL}; static const LearningMethod kLearningMethod = kSGD; static const size_t kStride = (kLearningMethod == kSGD) ? 1 : (kLearningMethod == kFTRL ? 3 : 2); static const Real kAdaGradPower = 0.5; MaxEnt() : hash_size_(0), storage_(NULL) { // empty constructor } void Init(size_t hash_size); ~MaxEnt(); void DumpWeights(std::vector<Real>* weights) const; Real GetValue(size_t feature_index) const { return storage_[feature_index * kStride]; } Real operator()(size_t feature_index) const { return GetValue(feature_index); } bool IsNull(size_t feature_index) const { return std::abs(GetValue(feature_index)) < 1e-6; } void UpdateValue(size_t feature_index, Real learning_rate, Real antigrad, Real l2) { if (kLearningMethod == kAdaGrad) { Real& n = storage_[feature_index * kStride + 1]; n += antigrad * antigrad; Real adarate = n; if (kAdaGradPower == 0.5) { adarate = std::sqrt(adarate); } else if (kAdaGradPower != 1) { adarate = std::pow(adarate, kAdaGradPower); } learning_rate /= adarate; Real& weight = storage_[feature_index * kStride]; weight += learning_rate * antigrad - weight * l2; } else if (kLearningMethod == kFTRL) { // TODO: add a separate parameter for l1 const Real l1 = l2; FTRLUpdate(feature_index, learning_rate, antigrad, l1, l2); } else { // SGD by default storage_[feature_index] += learning_rate * antigrad - storage_[feature_index] * l2; } } void Dump(FILE* fo) const; void Load(FILE* fo); private: size_t hash_size_; Real* storage_; void FTRLUpdate(size_t feature_index, Real learning_rate, Real antigrad, Real l1, Real l2) { // see http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/41159.pdf const Real alpha = learning_rate; const Real beta = 0; Real& w = storage_[feature_index * kStride]; Real& n = storage_[feature_index * kStride + 1]; Real& z = storage_[feature_index * kStride + 2]; Real sigma = (std::sqrt(n + antigrad * antigrad) - std::sqrt(n)) / alpha; z -= antigrad + sigma * w; n += antigrad * antigrad; Real sign = (z < 0) ? -1 : 1; if (sign * z > l1) { w = (sign * l1 - z) / ((beta + std::sqrt(n)) / alpha + l2); } else { w = 0; } } }; inline int CalculateMaxentHashIndices( const WordIndex *sen, int word_index, int maxent_order, uint64_t max_hash, bool add_padding, uint64_t ngram_hashes[MAX_NGRAM_ORDER]) { int maxent_present = (maxent_order > word_index + 1 && !add_padding) ? word_index + 1 : maxent_order; if (maxent_present) { // (order < maxent_present) <--> (order < maxent_order && order <= word_index) for (int order = 0; order < maxent_present; ++order) { ngram_hashes[order] = PRIMES[0] * PRIMES[1]; for (int i = 1; i <= order; ++i) { uint64_t word = (word_index - i >= 0) ? sen[word_index - i] : -1; ngram_hashes[order] += PRIMES[(order * PRIMES[i] + i) % PRIMES_SIZE] * (word + 1); } ngram_hashes[order] = ngram_hashes[order] % max_hash; } } return maxent_present; } #endif // FASTER_RNNLM_MAXENT_H_

Q: Slot machine TimeLine animation not working I am trying to develop a slot machine reel application. I have a custom reel pane which adds children vertically. When a spin button is clicked children have to move and when the last child reaches a boundary it has to shift its position above the first child. What I did is shown below. public class ReelPane extends Pane { Timeline timeline = new Timeline(); @Override protected void layoutChildren() { List<Node> managed = getChildren(); double y = 0; for (Node node : managed) { node.setLayoutX(0); node.setLayoutY(y); y += node.getBoundsInLocal().getHeight(); } } public void spin() { List<Node> managed = getChildren(); double dy = 4; for (Node node : managed) { timeline.getKeyFrames().addAll(new KeyFrame(Duration.millis(2000),new KeyValue(node.layoutYProperty(),node.getLayoutY()+dy))); if(node.getLayoutY()>=600){ node.setLayoutY(-50); } } timeline.setCycleCount(Timeline.INDEFINITE); timeline.play(); } } fxml file <?import javafx.scene.control.Button?> <?import javafx.scene.image.*?> <?import javafx.scene.layout.Pane?> <?import sample.ReelPane?> <Pane stylesheets="@css/slot.css" xmlns:fx="http://javafx.com/fxml/1" xmlns="http://javafx.com/javafx" fx:controller="sample.Controller"> <ReelPane fx:id="reel" styleClass="container"> <ImageView fitHeight="100" fitWidth="100"> <Image url="/sample/resources/apple.png"/> </ImageView> <ImageView fitHeight="100" fitWidth="100"> <Image url="/sample/resources/diamond.png"/> </ImageView> <ImageView fitHeight="100" fitWidth="100"> <Image url="/sample/resources/glass.png"/> </ImageView> <ImageView fitHeight="100" fitWidth="100"> <Image url="/sample/resources/grape.png"/> </ImageView> <ImageView fitHeight="100" fitWidth="100"> <Image url="/sample/resources/star.png"/> </ImageView> </ReelPane> <Button fx:id="spin" text="SPIN"/> </Pane> controller package sample; import javafx.fxml.FXML; import javafx.scene.control.Button; public class Controller { @FXML ReelPane reel; @FXML Button spin; public void initialize() { spin.setOnAction(event -> reel.spin()); } } main package sample; import javafx.application.Application; import javafx.fxml.FXMLLoader; import javafx.scene.Parent; import javafx.scene.Scene; import javafx.stage.Stage; public class Main extends Application { @Override public void start(Stage primaryStage) throws Exception { Parent root = FXMLLoader.load(getClass().getResource("resources/fxml/slot.fxml")); primaryStage.setScene(new Scene(root, 400, 900)); primaryStage.show(); } public static void main(String[] args) { launch(args); } } But the children are not moving when button is clicked.Can someone tell what went wrong? A: All of the KeyFrames of your Timeline are scheduled at the same time. Furthermore the if statement is executed before you even start the animation. Imho it's easier to put all the elements in a VBox and simply repeatedly change translateY repeatedly from a negative value equal to the element height to 0 and move the last element to the front at the end of the cycle. You may want to apply a clip to the parent of the VBox though to hide anything exceeding the bounds of a single element. @Override public void start(Stage primaryStage) throws Exception { VBox pane = new VBox(); Pane parent = new Pane(pane); parent.setPrefSize(50, 50); parent.setMinSize(Region.USE_PREF_SIZE, Region.USE_PREF_SIZE); parent.setMaxSize(Region.USE_PREF_SIZE, Region.USE_PREF_SIZE); Timeline timeline = new Timeline(new KeyFrame(Duration.ZERO, new KeyValue(pane.translateYProperty(), -50d)), new KeyFrame(Duration.seconds(2), evt -> { pane.getChildren().get(pane.getChildren().size() - 1).toBack(); }, new KeyValue(pane.translateYProperty(), 0d))); timeline.setCycleCount(Animation.INDEFINITE); for (int i = 0; i < 6; i++) { Rectangle rect = new Rectangle(50, 50, Color.RED.interpolate(Color.BLACK, i / 6d)); pane.getChildren().add(rect); } parent.setClip(new Rectangle(50, 50)); timeline.play(); Scene scene = new Scene(new StackPane(parent), 200, 200); primaryStage.setScene(scene); primaryStage.show(); } A: A much simpler tool for the needed animation is PauseTransition. If you do not want to specify the layout in the fxml you can override layoutChildren() as you did but you'll need to disable automatic layout (layoutChildren()) so the animation can change positions: import java.util.List; import javafx.animation.PauseTransition; import javafx.scene.Node; import javafx.scene.layout.Pane; import javafx.util.Duration; public class ReelPane extends Pane { private List<Node> managed; private double dy, numberOfCchildren; private boolean isAnimating = false; private static final double PAUSE = 1; @Override protected void layoutChildren() { if(isAnimating) return; managed = getChildren(); numberOfCchildren = managed.size(); double y = 0; for (Node node : managed) { node.setLayoutX(0); node.setLayoutY(y); dy = Math.max(dy, node.getBoundsInLocal().getHeight()); //dy stores the highest y += dy; } } public void spin() { isAnimating = true; PauseTransition pause = new PauseTransition(Duration.seconds(PAUSE)); pause.setOnFinished(event ->{ for (Node node : managed) { if(node.getLayoutY()>= (numberOfCchildren -1) * dy){ node.setLayoutY(-dy); } node.setLayoutY(node.getLayoutY() +dy); } pause.play(); }); pause.play(); } } Consider disabling the button while spinning: import javafx.fxml.FXML; import javafx.scene.control.Button; public class Controller { @FXML ReelPane reel; @FXML Button spin; public void initialize() { spin.setOnAction(event -> { reel.spin(); spin.setDisable(true); }); } } To make the code mre here is the slot.fxml using publicly available resources: <?import javafx.scene.control.Button?> <?import javafx.scene.image.*?> <?import javafx.scene.layout.Pane?> <?import fx_tests.ReelPane?> <Pane xmlns:fx="http://javafx.com/fxml/1" xmlns="http://javafx.com/javafx" fx:controller="fx_tests.sample.Controller"> <ReelPane fx:id="reel"> <ImageView fitHeight="100" fitWidth="100"> <Image url="https://cdn3.iconfinder.com/data/icons/softwaredemo/PNG/128x128/Box_Green.png"/> </ImageView> <ImageView fitHeight="100" fitWidth="100" > <Image url="https://cdn3.iconfinder.com/data/icons/softwaredemo/PNG/128x128/Box_Red.png"/> </ImageView> <ImageView fitHeight="100" fitWidth="100"> <Image url="https://cdn3.iconfinder.com/data/icons/softwaredemo/PNG/128x128/Box_Yellow.png"/> </ImageView> <ImageView fitHeight="100" fitWidth="100" > <Image url="https://cdn3.iconfinder.com/data/icons/softwaredemo/PNG/128x128/Box_Blue.png"/> </ImageView> <ImageView fitHeight="100" fitWidth="100"> <Image url="https://cdn3.iconfinder.com/data/icons/softwaredemo/PNG/128x128/Box_Orange.png"/> </ImageView> </ReelPane> <Button fx:id="spin" text="SPIN" layoutX="20." layoutY="550.0" /> </Pane> A test application: import javafx.application.Application; import javafx.fxml.FXMLLoader; import javafx.scene.Parent; import javafx.scene.Scene; import javafx.stage.Stage; public class Main extends Application { @Override public void start(Stage primaryStage) throws Exception { Parent root = FXMLLoader.load(getClass().getResource("slot.fxml")); primaryStage.setScene(new Scene(root, 200, 600)); primaryStage.show(); } public static void main(String[] args) { launch(args); } }

<?php namespace Hochstrasser\Wirecard\Request\Seamless\Frontend; use Hochstrasser\Wirecard\Request\AbstractWirecardRequest; class ReadDataStorageRequest extends AbstractWirecardRequest { protected $requiredParameters = ['storageId']; protected $fingerprintOrder = ['storageId']; protected $endpoint = 'https://checkout.wirecard.com/seamless/dataStorage/read'; protected $resultClass = 'Hochstrasser\Wirecard\Model\Seamless\Frontend\DataStorageReadResult'; static function withStorageId($storageId) { $request = new static(); $request->setStorageId($storageId); return $request; } function setStorageId($storageId) { return $this->addParam('storageId', $storageId); } }

January 8, 2020 / 8:11 PM / 14 days ago UPDATE 1-UK's Johnson urges Trump to de-escalate Iran situation (Recasts with White House statement, adds comments on nuclear deal) LONDON/WASHINGTON, Jan 8 (Reuters) - British Prime Minister Boris Johnson and U.S. President Donald Trump discussed Iranian missile attacks on Wednesday, even as the two leaders separately offered different approaches on how to prevent Iran from developing nuclear weapons. The two allied leaders spoke in a call before Trump, in a speech, backed away from any military response toward Tehran in retaliation for the strikes on military bases in Iraq housing U.S. troops, Johnson's spokesman and the White House said. The Iranian strikes came after the United States killed a top Iranian commander in Baghdad last week. Trump said no U.S. troops were killed in Tehran's strikes. Johnson, in the call, urged Trump to de-escalate the situation urgently to avoid further conflict, Johnson's spokesman said. "The two leaders discussed the current situation in the Middle East and agreed to continue close coordination in support of shared national security interests," White House spokesman Judd Deere said in a statement. He gave no other details. Still the leaders, whose countries are close allies, separately backed different approaches to Iran. Johnson told the UK's parliament earlier on Wednesday the 2015 nuclear deal negotiated between Iran and six world powers, including the United States and the United Kingdom, remained the best option to prevent Iran from developing nuclear weapons. Trump pulled out of the deal in 2018 and adopted a "maximum pressure" campaign against Tehran, but Johnson told UK lawmakers the agreement "remains a shell into which we can put substance again." In his remarks at the White House on Wednesday, Trump called the pact negotiated under his Democratic predecessor Barack Obama "very defective." "The time has come for the United Kingdom, Germany, France, Russia, and China to recognize this reality," Trump said. "They must now break away from the remnants of the Iran deal - or JCPOA - and we must all work together toward making a deal with Iran that makes the world a safer and more peaceful place." (Reporting Elizabeth Piper; Writing by Kylie MacLellan and Susan Heavey; Editing by David Milliken and Andrea Ricci)

This is a placeholder page for Bonnie Sargent, which means this person is not currently on this site. We do suggest using the tools below to find Bonnie Sargent. You are visiting the placeholder page for Bonnie Sargent. This page is here because someone used our placeholder utility to look for Bonnie Sargent. We created this page automatically in hopes Bonnie Sargent would find it. If you are not Bonnie Sargent, but are an alumni of Hurley High School Hurley, VA, register on this site for free now.

Man charged with slashing throat of 10-year-old playing video game in Lewis County LEWIS COUNTY, Tenn. (WKRN) — A 29-year-old man accused of slashing the throat of a ten-year-old boy over the weekend in Lewis County has been charged with attempted criminal homicide. The Lewis County Sheriff's Office said Sammy Sadler, Jr. used a knife to cut the child's throat while the boy was playing a video game Sunday evening at a residence on Howard Switch Road. The child was transported to Vanderbilt University Medical Center and is expected to survive his injuries, deputies explained. Court records show Sadler was booked into the Lewis County jail Monday afternoon on charges including attempted criminal homicide, aggravated assault, aggravated child abuse and resisting arrest. No additional information was immediately released and the incident remains under investigation.

Q: How do I add an XML attribute using DataContract I have a simple class I'm serializing. [DataContract(Name = "Test", Namespace = "")] public class Test { [DataMember(Order = 0, Name = "Text")] public string Text { get; set; } public Test() {} } This kicks out the following XML: <Test> <Text>Text here</Text> </Test> What I want is: <Test> <Text type="MyType">Text here</Text> </Test> How do I add attributes the the XML elements? Thanks in advance. A: Not exactly an answer, but you can try to implement IXmlSerializable to fully control output xml format. A: You can't add attributes to a DataContract. You either have to use a class that Implements ISerializable or use the .Net XmlSerializer. A: I was able to achieve this by declaring an XElement which has attributes defined in it. Ex: public XElement Text { get; set;} A: Add the type attribute with [XMLAttribute] and the element value with [XmlText]. public class Test { public text Text; public Test() { Text = new text(); } [DataContract(Name = "Test", Namespace = "")] public class text { [XmlText] public string Text { get; set; } [XmlAttribute] public string type { get; set; } } }

Q: Загрузка Счетов и Актов в 1С из файлов, сгенерированных в PHP Имеется: 1С Предприятие 8.2 + Бухгалтерия 2.0 Нужно каким-нибудь образом загружать в 1Ску счета и акты. В 1С не бум бум, но знаю, что наш бухгалтер все платежки из Сбербанк Бизнес-он-лайн выгружает в текстовый файл, который потом использует в 1С (через кнопку "Загрузить выписку"). Наверное как-то можно и счета и акты загружать в 1С через файл? Скажите в какую сторону копать? Где искать решение? Сгенерировать нужные txt, excel, csv файлы я смогу на стороне php, важно найти решения загрузки их в 1С. A: "Загрузить выписку" = Обработка на языке 1С, которая читает файлик, выгруженный из клиент-банка и создает соответствующий документ(-ы) в базе. Поэтому, копать нужно в сторону 1С-ника, который напишет обработку для создания Актов/Счетов из файла с данными, который предоставите ему вы. Второй вариант: смотреть на шлюз интеграции с 1С<->1С:Битрикс (CommerceML - суть XML с синтаксисом на русском), но "из-коробки" у Битрикса обработки расчитаны на 1С:Управление торговлей, а не Бухгалтерию. Третий вариант: поискать готовые обработки загрузки на Инфостарте. В любом случае, придется либо самому вникать в код обработок и быть готовым его править, либо искать 1С-ника.

This is a placeholder page for Sandy Arab, which means this person is not currently on this site. We do suggest using the tools below to find Sandy Arab. You are visiting the placeholder page for Sandy Arab. This page is here because someone used our placeholder utility to look for Sandy Arab. We created this page automatically in hopes Sandy Arab would find it. If you are not Sandy Arab, but are an alumni of Dowagiac Union High School, register on this site for free now.

package uk.co.harrymartland.multijmx.service.commandline; import com.google.inject.Inject; import com.google.inject.Provider; import com.google.inject.Singleton; import org.apache.commons.cli.CommandLine; import org.apache.commons.cli.CommandLineParser; import org.apache.commons.cli.ParseException; import uk.co.harrymartland.multijmx.service.options.OptionsService; @Singleton public class CommandLineServiceImpl implements CommandLineService { private CommandLine commandLine; private CommandLineParser commandLineParser; private Provider<OptionsService> optionsService; @Inject public CommandLineServiceImpl(CommandLineParser commandLineParser, Provider<OptionsService> optionsService) { this.commandLineParser = commandLineParser; this.optionsService = optionsService; } @Override public CommandLine get() { if (commandLine == null) { throw new IllegalStateException("Command line not set!"); } return commandLine; } @Override public CommandLine create(String[] args) throws ParseException { if (commandLine != null) { throw new IllegalStateException("Command line already set!"); } return commandLine = commandLineParser.parse(optionsService.get().getOptions(), args); } }

module MATLAB using Libdl using SparseArrays import Base: eltype, close, size, copy, ndims, unsafe_convert # mxarray export MxArray, mxClassID, mxComplexity, mxclassid, data_ptr, classid, nrows, ncols, nelems, elsize export is_double, is_single, is_int8, is_uint8, is_int16, is_uint16, is_int32, is_uint32, is_int64, is_uint64, is_numeric, is_complex, is_sparse, is_empty, is_logical, is_char, is_struct, is_cell export mxarray, mxsparse, delete, mxcellarray, get_cell, set_cell, mxstruct, mxstructarray, mxnfields, get_fieldname, get_field, set_field, jvalue, jarray, jscalar, jvector, jmatrix, jsparse, jstring, jdict # engine & matfile export MSession, MatFile, get_default_msession, restart_default_msession, close_default_msession, eval_string, get_mvariable, get_variable, put_variable, put_variables, variable_names, read_matfile, write_matfile, mxcall, @mput, @mget, @mat_str if Sys.iswindows() export show_msession, hide_msession, get_msession_visiblity end const depsfile = joinpath(dirname(@__DIR__), "deps", "deps.jl") if isfile(depsfile) include(depsfile) else error("MATLAB is not properly installed. Please run Pkg.build(\"MATLAB\") and restart Julia.") end # exceptions struct MEngineError <: Exception message::String end include("init.jl") # initialize Refs include("mxarray.jl") include("matfile.jl") include("engine.jl") include("matstr.jl") if Sys.iswindows() # workaround "primary message table for module 77" error # creates a dummy Engine session and keeps it open so the libraries used by all other # Engine clients are not loaded and unloaded repeatedly # see: https://www.mathworks.com/matlabcentral/answers/305877-what-is-the-primary-message-table-for-module-77 # initialization is delayed untill first call to MSession const persistent_msession_ref = Ref{MSession}() const persistent_msession_assigned = Ref(false) function assign_persistent_msession() if persistent_msession_assigned[] == false persistent_msession_assigned[] = true persistent_msession_ref[] = MSession(0) end end end # helper library access function engfunc(fun::Symbol) = Libdl.dlsym(libeng[], fun) mxfunc(fun::Symbol) = Libdl.dlsym(libmx[], fun) matfunc(fun::Symbol) = Libdl.dlsym(libmat[], fun) function __init__() check_deps() if libmx_size > 0 # non-zero size library path # load libraries libmx[] = Libdl.dlopen(joinpath(matlab_libpath, "libmx"), Libdl.RTLD_GLOBAL) libmat[] = Libdl.dlopen(joinpath(matlab_libpath, "libmat"), Libdl.RTLD_GLOBAL) libeng[] = Libdl.dlopen(joinpath(matlab_libpath, "libeng"), Libdl.RTLD_GLOBAL) # engine functions eng_open[] = engfunc(:engOpen) eng_close[] = engfunc(:engClose) eng_set_visible[] = engfunc(:engSetVisible) eng_get_visible[] = engfunc(:engGetVisible) eng_output_buffer[] = engfunc(:engOutputBuffer) eng_eval_string[] = engfunc(:engEvalString) eng_put_variable[] = engfunc(:engPutVariable) eng_get_variable[] = engfunc(:engGetVariable) # mxarray functions mx_destroy_array[] = mxfunc(:mxDestroyArray) mx_duplicate_array[] = mxfunc(:mxDuplicateArray) # load functions to access mxarray mx_free[] = mxfunc(:mxFree) mx_get_classid[] = mxfunc(:mxGetClassID) mx_get_m[] = mxfunc(:mxGetM) mx_get_n[] = mxfunc(:mxGetN) mx_get_nelems[] = mxfunc(:mxGetNumberOfElements) mx_get_ndims[] = mxfunc(:mxGetNumberOfDimensions_730) mx_get_elemsize[] = mxfunc(:mxGetElementSize) mx_get_data[] = mxfunc(:mxGetData) mx_get_dims[] = mxfunc(:mxGetDimensions_730) mx_get_nfields[] = mxfunc(:mxGetNumberOfFields) mx_get_pr[] = mxfunc(:mxGetPr) mx_get_pi[] = mxfunc(:mxGetPi) mx_get_ir[] = mxfunc(:mxGetIr_730) mx_get_jc[] = mxfunc(:mxGetJc_730) mx_is_double[] = mxfunc(:mxIsDouble) mx_is_single[] = mxfunc(:mxIsSingle) mx_is_int64[] = mxfunc(:mxIsInt64) mx_is_uint64[] = mxfunc(:mxIsUint64) mx_is_int32[] = mxfunc(:mxIsInt32) mx_is_uint32[] = mxfunc(:mxIsUint32) mx_is_int16[] = mxfunc(:mxIsInt16) mx_is_uint16[] = mxfunc(:mxIsUint16) mx_is_int8[] = mxfunc(:mxIsInt8) mx_is_uint8[] = mxfunc(:mxIsUint8) mx_is_char[] = mxfunc(:mxIsChar) mx_is_numeric[] = mxfunc(:mxIsNumeric) mx_is_logical[] = mxfunc(:mxIsLogical) mx_is_complex[] = mxfunc(:mxIsComplex) mx_is_sparse[] = mxfunc(:mxIsSparse) mx_is_empty[] = mxfunc(:mxIsEmpty) mx_is_struct[] = mxfunc(:mxIsStruct) mx_is_cell[] = mxfunc(:mxIsCell) # load functions to create & delete MATLAB array mx_create_numeric_matrix[] = mxfunc(:mxCreateNumericMatrix_730) mx_create_numeric_array[] = mxfunc(:mxCreateNumericArray_730) mx_create_double_scalar[] = mxfunc(:mxCreateDoubleScalar) mx_create_logical_scalar[] = mxfunc(:mxCreateLogicalScalar) mx_create_sparse[] = mxfunc(:mxCreateSparse_730) mx_create_sparse_logical[] = mxfunc(:mxCreateSparseLogicalMatrix_730) mx_create_string[] = mxfunc(:mxCreateString) mx_create_char_array[] = mxfunc(:mxCreateCharArray_730) mx_create_cell_array[] = mxfunc(:mxCreateCellArray_730) mx_create_struct_matrix[] = mxfunc(:mxCreateStructMatrix_730) mx_create_struct_array[] = mxfunc(:mxCreateStructArray_730) mx_get_cell[] = mxfunc(:mxGetCell_730) mx_set_cell[] = mxfunc(:mxSetCell_730) mx_get_field[] = mxfunc(:mxGetField_730) mx_set_field[] = mxfunc(:mxSetField_730) mx_get_field_bynum[] = mxfunc(:mxGetFieldByNumber_730) mx_get_fieldname[] = mxfunc(:mxGetFieldNameByNumber) mx_get_string[] = mxfunc(:mxGetString_730) # load I/O mat functions mat_open[] = matfunc(:matOpen) mat_close[] = matfunc(:matClose) mat_get_variable[] = matfunc(:matGetVariable) mat_put_variable[] = matfunc(:matPutVariable) mat_get_dir[] = matfunc(:matGetDir) end end ########################################################### # # deprecations # ########################################################### end

SoccerPunter > Player > Connor Riley-Lowe Connor Riley-Lowe Profile and Player Statistics Connor Riley-Lowe First name: Connor Last name: Riley-Lowe Position: , Defender, LB, LM, Midfielder We are going to show you the list of football clubs and seasons in which Connor Riley-Lowe has played. It includes the total number of appearance (caps), substitution details, goals, yellow and red cards stats. FA Cup 2022/2023 Truro City 0 0 0 0 0 0 0 0 Fa Trophy 2022/2023 Truro City 0 0 0 0 0 0 0 0 Non League Premier: Southern South 2022/2023 Truro City 0 0 0 0 0 0 0 0 Club Friendlies 3 2022 Truro City 0 0 0 0 0 0 0 0 Fa Trophy 2021/2022 Truro City 180 2 0 0 0 0 0 0 Fa Trophy 2020/2021 Truro City 90 1 0 0 0 0 0 0 Fa Trophy 2019/2020 Bath City 55 3 2 1 0 0 0 0 Vanarama National League South 2019/2020 Bath City 2216 29 4 3 0 0 0 0 Vanarama National League South 2018/2019 Truro City 3690 41 0 0 3 1 0 0 FA Cup 2017/2018 Truro City 180 2 0 0 0 0 0 0 Carabao Cup 2016/2017 Exeter City 77 2 1 1 0 0 0 0 EFL Trophy 2016/2017 Exeter City 111 2 1 0 0 0 0 0 League Two 2016/2017 Exeter City 397 6 2 1 0 0 1 0 Vanarama National League South 2016/2017 Truro City 406 5 0 1 0 0 0 0 EFL Trophy 2014/2015 Exeter City 90 1 0 0 0 0 0 0 FA Cup 2014/2015 Exeter City 0 0 0 0 0 0 0 0 Connor Riley-Lowe has played in the following competitions and football tournaments. Carabao Cup(3) EFL Trophy(2) FA Cup(1) Fa Trophy(9) League Two(6) Non League Premier: Southern South(6) Serie C: Girone C(2) Vanarama National League South(129) 07/01/2023 Hendon Truro City 1-1 H2H + 0 - 1 11' C. Riley-Lowe J. White 29' 1 - 1 B. Adelsbury 54' 2 - 1 2 - 2 54' F. Keita 02/01/2023 Truro City Tiverton Town 2-0 H2H + C. Riley-Lowe 22' 1 - 0 T. Harvey 26' 2 - 0 2 - 1 49' T. Purrington A. Porter 52' 3 - 1 3 - 2 90' L. Vowles 26/12/2022 Plymouth Parkway 0 - 1 14' A. Porter B. Seymour 25' 1 - 1 1 - 2 45+2' C. Riley-Lowe J. Crago 88' 3 - 2 3 - 3 90+4' W. Dean 12/02/2022 Tiverton Town D. Hayfield 23' 1 - 0 A. Booth 70' 2 - 1 Dagenham & Redbridge 0-0 H2H + 0 - 1 76' J. Walker A. Neal 88' 1 - 1 27/11/2021 Binfield 0 - 1 7' T. Harvey 0 - 2 26' A. Neal J. Howell 53' 1 - 3 O. Harris 77' 2 - 3 19/12/2020 Concord Rangers 0 - 1 52' T. Harvey 0 - 2 63' A. Battle S. Blackman 90' 1 - 2 Wimborne Town 4-0 H2H + J. Richards 5' 1 - 0 J. Richards 45' 4 - 0 4 - 1 51' L. Beale 0 - 2 56' D. Rooney 19/07/2020 Bath City Dorking Wanderers 0-2 H2H + 0 - 1 6' J. McShane 0 - 2 41' J. Prior R. Brunt 80' 1 - 2 14/03/2020 Hungerford Town Bath City 0-1 H2H + 0 - 1 45' A. Mann Weymouth 0-0 H2H + 29/02/2020 Braintree Town J. Chiedozie 60' 1 - 0 L. Smyth 90+2' 2 - 0 0 - 1 39' R. Stearn St Albans City 0-2 H2H + 0 - 1 20' S. Nwabuokei 0 - 2 34' J. Iaciofano 0 - 3 70' Z. Banton Concord Rangers 1-1 H2H + 0 - 1 15' B. Roast 1 - 2 88' J. Nouble 25/01/2020 Wealdstone B. Clifford 14' 1 - 0 F. Artus 24' 2 - 0 C. Stevens 42' 3 - 0 D. Lewis 54' 4 - 0 D. Green 69' 6 - 0 M. Phillips 80' 7 - 0 Hemel Hempstead Town 0-0 H2H + T. Smith 78' 1 - 0 R. Stearn 84' 2 - 0 A. Pollock 77' 1 - 0 1 - 1 79' T. Smith Billericay Town 1-1 H2H + 0 - 1 24' D. Noel-Williams R. Stearn 90+1' 2 - 1 01/01/2020 Chippenham Town C. Zebroski 42' 1 - 0 1 - 1 45+1' R. Brunt 1 - 3 90' L. Britton 28/12/2019 Hampton & Richmond 21/12/2019 Eastbourne Borough G. Luer 41' 1 - 0 1 - 2 90+3' A. Hartridge Sholing 1-0 H2H + A. Watkins 59' 2 - 0 16/11/2019 Havant & Waterlooville A. Rutherford 57' 1 - 1 D. Kedwell 73' 2 - 1 02/11/2019 Dulwich Hamlet 0 - 1 30' N. Chilvers A. Yussuff 48' 1 - 1 1 - 2 53' S. Pearson 1 - 3 90+1' T. Smith A. Mann 54' 1 - 0 19/10/2019 St Albans City Maidstone United 0-0 H2H + 0 - 1 76' R. Johnson R. Brunt 90+5' 1 - 1 28/09/2019 Hemel Hempstead Town 0 - 1 32' R. Brunt L. Nash 45' 1 - 1 L. Howell 80' J. Midson 86' 2 - 1 Eastbourne Borough 1-0 H2H + 1 - 1 76' G. Luer 1 - 2 79' E. Romain H. Hamblin 85' 2 - 2 07/09/2019 Billericay Town S. Deering 32' 1 - 0 Hampton & Richmond 1-0 H2H + 31/08/2019 Chelmsford City S. Jeffers 64' 1 - 0 Oxford City 1-0 H2H + T. Richards 26' 1 - 0 1 - 1 50' T. Moore-Azille 1 - 3 75' S. Brown 24/08/2019 Slough Town D. Roberts 13' 1 - 0 1 - 2 38' T. Richards M. Williams 87' 2 - 2 W. Harris 90+4' 4 - 2 Tonbridge Angels 0-0 H2H + Hungerford Town 1-0 H2H + H. Smith 38' 1 - 0 3 - 1 90' K. Halliday 10/08/2019 Welling United 0 - 1 10' A. Hartridge 06/08/2019 Weymouth A. Hartridge 5' 1 - 0

Eggstravaganza is 'about loving the community' Thousands of plastic Easter eggs were scattered around Community Center Park in Camarillo, glistening in the grass under Saturday's bright spring sun. Eggstravaganza is 'about loving the community' Thousands of plastic Easter eggs were scattered around Community Center Park in Camarillo, glistening in the grass under Saturday's bright spring sun. Check out this story on vcstar.com: http://www.vcstar.com/story/news/local/communities/camarillo/2017/04/15/eggstravaganza-s-loving-community/100418902/ Jeremy Childs, jeremy.childs@vcstar.com, 805-437-0208 Published 6:03 p.m. PT April 15, 2017 | Updated 7:03 p.m. PT April 15, 2017 Children rush to find eggs during the 2017 Easter Eggstravaganza and Craft Fair put on by the Pleasant Valley Recreation and Parks District in Camarillo. This year's event will be from 10 a.m. to 2 p.m. March 31 at Camarillo Community Center Park.(Photo: JEREMY CHILDS/THE STAR)Buy Photo Within a minute, they all would be snatched up by eager children during the Easter Eggstravaganza and Craft Fair, an annual event hosted by the Pleasant Valley Recreation and Parks District. Amy Stewart, recreational services manager for the district, said the Easter fair has taken place in Camarillo for more than 20 years. "It's a way for our community to come together over Easter weekend, for free, without leaving the city," Stewart said. Stewart expected about 4,000 people at this year's event. Linda Boyett, a parent who was there, said this was the first year she had seen the parking lot fill up. Gallery: Easter Eggstravaganza in Camarillo Lindsey and Issac Ordonez of Moorpark feed a pony at the petting zoo during the 2017 Easter Eggstravaganza and Craft Fair in Camarillo. This year's event will be from 10 a.m. to 2 p.m. March 31 at Camarillo Community Center Park. JEREMY CHILDS/THE STAR Ismael Thenoz of Camarillo shows off the eggs he gathered during the 2017 Easter Eggstravaganza and Craft Fair in Camarillo. This year's event will be from 10 a.m. to 2 p.m. March 31 at Camarillo Community Center Park. JEREMY CHILDS/THE STAR Children rush to find eggs during the 2017 Easter Eggstravaganza and Craft Fair put on by the Pleasant Valley Recreation and Parks District in Camarillo. This year's event will be from 10 a.m. to 2 p.m. March 31 at Camarillo Community Center Park. JEREMY CHILDS/THE STAR The hunting grounds are covered in eggs during the 2017 Easter Eggstravaganza and Craft Fair in Camarillo. This year's event will be from 10 a.m. to 2 p.m. March 31 at Camarillo Community Center Park. JEREMY CHILDS/THE STAR The Easter Bunny delivers eggs before the 2017 Easter Eggstravaganza and Craft Fair, an annual event put on by the Pleasant Valley Recreation and Parks District. This year's event will be from 10 a.m. to 2 p.m. March 31 at Camarillo Community Center Park. JEREMY CHILDS/THE STAR Matthew Sanchez of Camarillo decorates a plastic pot with googly eyes during the 2017 Easter Eggstravaganza and Craft Fair in Camarillo. This year's event will be from 10 a.m. to 2 p.m. March 31 at Camarillo Community Center Park. JEREMY CHILDS/THE STAR The Camarillo Community Center's Tap Dance 2 class, led by instructor Haley-Nicole, entertains during the 2017 Easter Eggstravaganza and Craft Fair in Camarillo. This year's event will be from 10 a.m. to 2 p.m. March 31 at Camarillo Community Center Park. JEREMY CHILDS/THE STAR The main attractions were the six separate hunts which had more than 15,000 Easter eggs among them. Volunteers dispersed the eggs within a sectioned off area of the park, split into two parts — for children ages 5 and younger and those ages 6 and up. When given the green light, kids swarmed the field and tried to fill their baskets with as many eggs as possible. It was highly competitive, with some children walking away with several eggs in their basket and others with none. "I wanted to leave some so the little kids could get them," said Emily Ake, who gathered two eggs during a hunt for ages 6 and up. The festival also had a crafting booth for children, offering them the chance to decorate the plastic pots of drought-resistant succulents. It also featured a petting zoo, two bounce houses, an Easter Bunny photo opportunity and booths with carnival games. A DJ played dance music next to a stage that featured gymnastics demonstrations from Cartwheel A Go Go and a tap dance performance from participants in the Camarillo Community Center's dance classes. Journey: The Church, which congregates nearby at the Camarillo Community Center, sponsored the egg hunt for the sixth time this year. The church helped facilitate the event, provided eggs with prizes inside them and distributed bottles of water. Jeremy Kays, a pastor, said he hoped the event would help bring people together in celebration of the occasion. "It's about loving the community," he said. Read or Share this story: http://www.vcstar.com/story/news/local/communities/camarillo/2017/04/15/eggstravaganza-s-loving-community/100418902/

Home > Stockport House Prices > Somerford Road Sold House Prices in Somerford Road This page displays sold house prices for Somerford Road in Stockport. Somerford Road in Stockport SK5 consists predominantly of terraced houses. Properties on Somerford Road typically have values around £100,000 - £150,000, ranging upwards of £150,000 for larger semi-detached houses. 1 Somerford Road, Stockport SK5 6QA £143,000 Semi-detached house, Freehold 20th October 2006 6 Somerford Road, Stockport SK5 6QB £95,000 Terraced house, Freehold 7th June 2013 £36,950 Terraced house, Freehold 31st March 2000 £78,950 Semi-detached house, Freehold 17th April 2003 £110,000 Semi-detached house, Freehold 30th November 2011 £40,000 Terraced house, Freehold 24th November 1999 10 Somerford Road, Stockport SK5 6QB £117,000 Terraced house, Freehold 22nd March 2005 £121,100 Terraced house, Freehold 28th April 2008 11 Somerford Road, Stockport SK5 6QA £60,000 Semi-detached house, Freehold 15th March 1999 £124,000 Terraced house, Freehold 23rd June 2006 £93,500 Terraced house, Freehold 6th April 2004 £42,500 Terraced house, Freehold 22nd March 1995 £37,000 Terraced house, Freehold 25th September 1998 £83,000 Semi-detached house, Freehold 22nd November 2010 £41,060 Terraced house, Freehold 20th April 2001 £41,000 Terraced house, Freehold 9th January 1998 £42,500 Terraced house, Freehold 7th September 2001 £97,950 Terraced house, Freehold 12th July 2004 £47,950 Terraced house, Freehold 15th December 2000 £108,000 Terraced house, Freehold 23rd December 2005 £29,250 Terraced house, Freehold 19th June 2000 £64,950 Semi-detached house, Freehold 19th July 2002 £90,000 Semi-detached house, Freehold 19th December 2008 £42,000 Semi-detached house, Freehold 1st November 1996 £62,000 Semi-detached house, Freehold 17th May 2002 £103,500 Semi-detached house, Freehold 17th March 2006 £115,000 Terraced house, Freehold 10th February 2015 £47,000 Semi-detached house, Freehold 12th October 2001 £29,000 Terraced house, Freehold 31st August 1995 £49,000 Terraced house, Freehold 21st February 2002 £113,000 Terraced house, Freehold 9th November 2007 £105,000 Terraced house, Freehold 11th October 2013 £46,000 Terraced house, Freehold 3rd September 2001 £124,950 Terraced house, Freehold 4th July 2007 £110,000 Terraced house, Freehold 11th August 2006 £110,000 Terraced house, Freehold 13th June 2007 £25,000 Terraced house, Freehold 4th December 1998 £113,000 Terraced house, Freehold 5th December 2012 £120,000 Terraced house, Freehold 20th December 2007 £52,630 Terraced house, Freehold 23rd November 2001 £110,000 Semi-detached house, Freehold 7th December 2011 £109,000 Semi-detached house, Freehold 18th February 2005 £85,000 Terraced house, Freehold 28th February 2006 £40,500 Terraced house, Freehold 8th July 1999 £30,000 Terraced house, Freehold 14th August 1997 £108,000 Terraced house, Freehold 5th April 2007 £110,000 Terraced house, Freehold 26th July 2013 £65,000 Terraced house, Freehold 7th October 2011 £90,100 Terraced house, Freehold 28th October 2011 76 Somerford Road, Stockport SK5 6QE £64,700 Semi-detached house, Freehold 28th June 2002 £132,000 Semi-detached house, Freehold 2nd November 2007 £32,500 Terraced house, Freehold 10th March 1998 £90,000 Terraced house, Freehold 1st December 2004 87 Somerford Road, Stockport SK5 6QF £27,500 Terraced house, Freehold 8th May 1998 £34,500 Terraced house, Freehold 31st May 1995 £110,000 Terraced house, Freehold 12th May 2005 £102,500 Terraced house, Freehold 6th May 2005 £106,500 Terraced house, Freehold 22nd June 2006 £47,950 Terraced house, Freehold 19th May 2000 £28,500 Semi-detached house, Freehold 7th February 1997 101 Somerford Road, Stockport SK5 6QF 102 Somerford Road, Stockport SK5 6QE £65,500 Terraced house, Freehold 22nd December 2003 £98,000 Terraced house, Freehold 22nd May 2015 £45,800 Terraced house, Freehold 18th January 1995 £39,950 Semi-detached house, Leasehold 15th January 2001 £128,000 Semi-detached house, Leasehold 31st July 2007 £52,500 Semi-detached house, Leasehold 1st March 2002 £77,600 Terraced house, Leasehold 23rd May 2011 £64,000 Terraced house, Leasehold new build 2nd April 2007 £125,000 Terraced house, Freehold 29th March 2007 £125,000 Terraced house, Freehold 21st October 2013 £115,500 Terraced house, Leasehold 20th March 2015 £39,950 Semi-detached house, Leasehold 22nd February 1995 £44,000 Flat, Leasehold 19th July 2010 £24,000 Terraced house, Leasehold 19th October 1998 £37,500 Semi-detached house, Freehold 27th January 1995 £22,257 Semi-detached house, Freehold 19th August 1998 £25,000 Terraced house, Leasehold 16th January 2004 £74,500 Terraced house, Leasehold 19th December 2012 £62,950 Semi-detached house, Freehold 29th November 2002 Somerford Road Map showing Somerford Road in Stockport.

Q: Python Tuple Class Memory Why does the use of tuple instead of list in objects below increase memory usage? from pympler.asizeof import asizeof class myClass(object): __slots__ = ('l') def __init__(self, m): self.l = m m = range(10) ob = [myClass(m) for i in xrange(100000)] print asizeof(ob) for o in ob: o.l = tuple(o.l) print asizeof(ob) The first has size 64697936 The second has size 200697784 A: In your original code, every myClass instance points to the same list. >>> ob[0].l.append('foo') >>> ob[1].l ['foo'] In other words: you compared the memory usage of one list to that of 100,000 tuples. Compare it to 100,000 lists instead: for o in ob: o.l = list(o.l) with these results: 6424936 27224856 The original: 6424936 20024784

New South Africa Business Software Launches With Freebies & ...| MENAFN.COM New South Africa Business Software Launches With Freebies & 55% Off Packages (MENAFN- MarketersMEDIA) Win big with Ubuntu SBS! Get a host of freebies & 55% off all packages until May 2023. Try our Cloud Based ERP for small biz now at Pretoria, South Africa - January 25, 2023 /PressCable/ - In a unique approach to launching its Small Business Management Software (Cloud Based ERP), Ubuntu SBS (Pty) Ltd, a Small Business Management Solution Provider in South Africa, has decided to give away a host of goodies to all new customers until May 2023, as well as a 55% discount on all packages. This promotion is expected to take place from now until 1 May 2023. Instead of having a launch party like many businesses, Ubuntu SBS (Pty) Ltd has chosen to be more direct, giving consumers the benefit of the money that would have been spent on a fancy party for the launch of its Small Business Management Software (Cloud Based ERP). Jaco Roets, Founder and CEO at Ubuntu SBS (Pty) Ltd, states: 'We wanted to be direct and give consumers the benefit of the money that would have been spent on a fancy party for the launch of our Small Business Management Software (Cloud Based ERP) because our customers are what we are about! Their success is our success, and every step we can take toward boosting their bottom line is a step in the right direction.' It is expected that this promotion will be highly beneficial and the launch is expected to be successful, unless the internet is taken over by aliens. However, Ubuntu SBS (Pty) Ltd has backup plans in place for this scenario. Ubuntu SBS (Pty) Ltd has always made a point of standing out when compared to other Small Business Management Solution Providers in the South Africa area. This launch celebration is just one of the many ways it does and integrations that are designed to increase efficiency and productivity. The software is accessible through a web browser and offers integration with popular communication tools like Zoom, Slack, and Telegram. This means that small businesses can easily track performance, make informed decisions, and collaborate with team members in real-time. The system is built on the same technology used by some of the world's largest companies, but it is specifically tailored for small businesses. It offers a wide range of functionalities, including employee management, HR management, project management, and financial management. Overall, the Small Business Management Software (Cloud Based ERP) from Ubuntu SBS (Pty) Ltd is an excellent choice for small businesses looking to streamline their operations, improve efficiency and grow exponentially. So, don't miss out on this amazing opportunity and visit to take advantage of the freebies and discounts before it's too late. Name: Jaco Roets Organization: Ubuntu SBS Address: 410 Furrow Road Equestria, Pretoria, Gauteng 0184, South Africa Release ID: 89089011

package org.apache.flink.streaming.connectors.kafka; import org.apache.flink.streaming.util.serialization.JSONKeyValueDeserializationSchema; import org.apache.flink.shaded.jackson2.com.fasterxml.jackson.databind.ObjectMapper; import org.apache.flink.shaded.jackson2.com.fasterxml.jackson.databind.node.ObjectNode; import org.junit.Assert; import org.junit.Test; import java.io.IOException; /** * Tests for the{@link JSONKeyValueDeserializationSchema}. */ public class JSONKeyValueDeserializationSchemaTest { @Test public void testDeserializeWithoutMetadata() throws IOException { ObjectMapper mapper = new ObjectMapper(); ObjectNode initialKey = mapper.createObjectNode(); initialKey.put("index", 4); byte[] serializedKey = mapper.writeValueAsBytes(initialKey); ObjectNode initialValue = mapper.createObjectNode(); initialValue.put("word", "world"); byte[] serializedValue = mapper.writeValueAsBytes(initialValue); JSONKeyValueDeserializationSchema schema = new JSONKeyValueDeserializationSchema(false); ObjectNode deserializedValue = schema.deserialize(serializedKey, serializedValue, "", 0, 0); Assert.assertTrue(deserializedValue.get("metadata") == null); Assert.assertEquals(4, deserializedValue.get("key").get("index").asInt()); Assert.assertEquals("world", deserializedValue.get("value").get("word").asText()); } @Test public void testDeserializeWithMetadata() throws IOException { ObjectMapper mapper = new ObjectMapper(); ObjectNode initialKey = mapper.createObjectNode(); initialKey.put("index", 4); byte[] serializedKey = mapper.writeValueAsBytes(initialKey); ObjectNode initialValue = mapper.createObjectNode(); initialValue.put("word", "world"); byte[] serializedValue = mapper.writeValueAsBytes(initialValue); JSONKeyValueDeserializationSchema schema = new JSONKeyValueDeserializationSchema(true); ObjectNode deserializedValue = schema.deserialize(serializedKey, serializedValue, "topic#1", 3, 4); Assert.assertEquals(4, deserializedValue.get("key").get("index").asInt()); Assert.assertEquals("world", deserializedValue.get("value").get("word").asText()); Assert.assertEquals("topic#1", deserializedValue.get("metadata").get("topic").asText()); Assert.assertEquals(4, deserializedValue.get("metadata").get("offset").asInt()); Assert.assertEquals(3, deserializedValue.get("metadata").get("partition").asInt()); } }

Συμβουλευτείτε τις κατευθυντήριες οδηγίες NCCN και αποκτήστε πρόσβαση σε ένα ολοκληρωμένο σύνολο κατευθυντήρων οδηγιών. Over the past 20 years, NCCN has developed an integrated suite of tools to improve the quality of cancer care. The NCCN Clinical Practice Guidelines in Oncology (NCCN Guidelines®) document evidence-based, consensus-driven management to ensure that all patients receive preventive, diagnostic, treatment, and supportive services that are most likely to lead to optimal outcomes. The NCCN Guidelines® are a comprehensive set of guidelines detailing the sequential management decisions and interventions that currently apply to 97 percent of cancers affecting patients in the United States.

package com.jetbrains.python.run; import com.intellij.execution.filters.Filter; import com.intellij.execution.filters.OpenFileHyperlinkInfo; import com.intellij.openapi.project.Project; import com.intellij.openapi.util.text.StringUtil; import com.intellij.openapi.vfs.LocalFileSystem; import com.intellij.openapi.vfs.VirtualFile; import org.jetbrains.annotations.Nullable; import java.io.File; import java.util.regex.Matcher; import java.util.regex.Pattern; /** * @author yole */ public class PythonTracebackFilter implements Filter { private final Project myProject; private final String myWorkingDirectory; private final Pattern myMatchingPattern = Pattern.compile("File \"([^\"]+)\", line (\\d+)"); public PythonTracebackFilter(Project project) { myProject = project; myWorkingDirectory = null; } public PythonTracebackFilter(Project project, @Nullable String workingDirectory) { myProject = project; myWorkingDirectory = workingDirectory; } public Result applyFilter(String line, int entireLength) { // File "C:\Progs\Crack\psidc\scummdc.py", line 72, in ? Matcher matcher = myMatchingPattern.matcher(line); if (matcher.find()) { String fileName = matcher.group(1).replace('\\', '/'); int lineNumber = Integer.parseInt(matcher.group(2)); VirtualFile vFile = findFileByName(fileName); if (vFile != null) { OpenFileHyperlinkInfo hyperlink = new OpenFileHyperlinkInfo(myProject, vFile, lineNumber - 1); final int textStartOffset = entireLength - line.length(); int startPos = line.indexOf('\"') + 1; int endPos = line.indexOf('\"', startPos); return new Result(startPos + textStartOffset, endPos + textStartOffset, hyperlink); } } return null; } @Nullable protected VirtualFile findFileByName(String fileName) { VirtualFile vFile = LocalFileSystem.getInstance().findFileByPath(fileName); if (vFile == null && !StringUtil.isEmptyOrSpaces(myWorkingDirectory)) { vFile = LocalFileSystem.getInstance().findFileByIoFile(new File(myWorkingDirectory, fileName)); } return vFile; } }

Diagnostic Medical Systems SA (DGM) - Medical Equipment - Deals and Alliances Profile Report Title Diagnostic Medical Systems SA (DGM) - Medical Equipment - Deals and Alliances Profile Diagnostic Medical Systems SA (DMS) is a medical device company that designs, manufactures and distributes imaging systems. The company's products comprise radiography and fluoroscopy, retrofit kits, mammography, chest and bone rooms, mobiles, bone densitometry, 3D reconstruction, mobile C-arms, and posturology solutions. It offers bone densitometry products such as 3D-DXA, Pegasus, Stratos, and Stratos dR. DMS's DR solutions comprise Baccara dRF 43, EZ2GO, Pixium EZ, and Platinum. The company has its presence in Africa, Asia, Australia, Europe, North America and South America. DMS is headquartered in Montpellier, France. Diagnostic Medical Systems SA (DGM)-Medical Equipment-Deals and Alliances Profile provides you comprehensive data and trend analysis of the company's Mergers and Acquisitions (M&As), partnerships and financings. The report provides detailed information on Mergers and Acquisitions, Equity/Debt Offerings, Private Equity, Venture Financing and Partnership transactions recorded by the company over a five year period. The report offers detailed comparative data on the number of deals and their value categorized into deal types, sub-sector and regions. - Financial Deals-Analysis of the company's financial deals including Mergers and Acquisitions, Equity/Debt Offerings, Private Equity, Venture Financing and Partnerships. - Deals by Year-Chart and table displaying information encompassing the number of deals and value reported by the company by year, for a five year period. - Deals by Type-Chart and table depicting information including the number of deals and value reported by the company by type such as Mergers and Acquisitions, Equity/Debt Offering etc. - Deals by Region-Chart and table presenting information on the number of deals and value reported by the company by region, which includes North America, Europe, Asia Pacific, the Middle East and Africa and South and Central America. - Deals by Sub-sector-Chart and table showing information on the number of deals and value reported by the company, by sub-sector. - Major Deals-Information on the company's major financial deals. Each such deal has a brief summary, deal type, deal rationale; and deal financials and target Company's (major public companies) key financial metrics and ratios. - Business Description-A brief description of the company's operations. - Key Employees-A list of the key executives of the company. - Important Locations and Subsidiaries-A list and contact details of key centers of operation and subsidiaries of the company. - Key Competitors-A list of the key competitors of the company. - Key Recent Developments-A brief on recent news about the company. - The profile enables you to analyze the company's financial deals by region, by year, by business segments and by type, for a five year period. - The profile presents deals from the company's core business segments' perspective to help you understand its corporate strategy. - Detailed information on major recent deals includes a summary of each deal, deal type, deal rationale, deal financials and Target Company's key financial metrics and ratios. - The profile analyzes the company's business structure, locations and subsidiaries, key executives and key competitors. - Recent developments concerning the company presented in the profile help you track important events. - Key elements such as break up of deals into categories and information on detailed major deals are incorporated into the profile to assist your academic or business research needs. Diagnostic Medical Systems SA, Medical Equipment, Deals By Year, 2012 to YTD 2018 5 Diagnostic Medical Systems SA, Medical Equipment Deals By Type, 2012 to YTD 2018 6 Diagnostic Medical Systems SA, Medical Equipment, Deals By Region, 2012 to YTD 2018 7 Diagnostic Medical Systems SA, Medical Equipment, Deals By Market, 2012 to YTD 2018 8 Diagnostic Medical Systems SA, Medical Equipment, Deals Summary, 2012 to YTD 2018 9 Diagnostic Medical Systems SA, Medical Equipment, Deal Details 10 Private Equity 10 Diagnostic Medical Systems to Raise up to USD44.8 Million in Private Placement of Bonds and Warrants 10 Jolt Capital and Ambrosia Investments Acquire 42.94% Stake in Alpha Mos from Diagnostic Medical Systems 11 Equity Offering 12 Diagnostic Medical Systems to Raise Funds in Public Offering of Shares 12 Diagnostic Medical Systems Raises USD2.5 Million in Private Placement of Shares 13 Diagnostic Medical Systems Raises USD10.4 Million in Public Offering of Shares 14 Alpha MOS Raises Additional USD1.25 Million in Private Placement of Shares 15 Diagnostic Medical Systems Acquires STEMCIS 16 Diagnostic Medical Systems Acquires AXS Medical 17 Diagnostic Medical Systems SA-Key Competitors 18 Diagnostic Medical Systems SA-Key Employees 19 Diagnostic Medical Systems SA-Locations And Subsidiaries 20 Diagnostic Medical Systems SA, Medical Equipment, Deals by Type, 2012 to YTD 2018 2 Diagnostic Medical Systems SA, Medical Equipment, Key Facts, 2017 2 Diagnostic Medical Systems SA, Deals By Market, 2012 to YTD 2018 8 Diagnostic Medical Systems SA, Key Competitors 18 Diagnostic Medical Systems SA, Key Employees 19 Diagnostic Medical Systems SA, Subsidiaries 20 Diagnostic Medical Systems SA, Deal Analysis, Mergers, Acquisitions, Asset Purchases, Asset Divestitures, Company Divestitures, Equity Offerings, Capital Raising, Debt Offerings, IPOs, Initial Public Offering, Private Placement, Private Investment In Public Equities, Secondary Offerings, Follow-On Offerings, Debt Private Placement, Public Debt Placement, Partnerships, Joint Venture, Licensing Agreements, Co-Marketing Agreements, Upfront Payment, Milestone Payment, Phases, Clinical Trials, Private Equity, Venture Capital, PE,VC, Asset Finance, Project Finance, Tax Equity Financing, Bond Financing, Lease Financing, New Build Financing, Deal Analysis By Market/sector, Deal Analysis By Geography, Deal Analysis By Deal Types, Key Employees, Locations And Subsidiaries, Competitors, Recent News, Company Overview, Key Facts, Deals By Year, Deal Details, Recent Developments, Significant Developments.

Find a storeLoginContact us LookbookOnline StoreCreatorNewsAbout 2020 Fall - Winter | N°25 collection 2020 Spring - Summer | N°25 collection Fall - Winter 2019 | VIBRATIONAll249 Necklaces97 Rings9 Earrings51 Bracelets77 Pins1 Necklace extensions3 Greeting cards1 Anne-Marie Chagnon Artistic processAll124 Jewellery spotted28 In the media73 Trade shows6Studio LookbookOnline StoreCreatorAnne-Marie ChagnonJourneyArtistic processNewsAboutStudioCommunity involvementPartners Find a storeLoginContact usMy accountLogout Find the closest retailer Les Petroleuses Chaussée de Mons 125 - 7060, Soignies, , Belgique Chaussée de Mons 125 - 7060, Soignies, Belgique, Emporium North Hatley 100 rue Main, North Hatley, QC, J0B 2C0, Canada 100 rue Main, North Hatley, QC, Canada, J0B 2C0 Parfumerie L'O de l'Aube 2235 rue King Ouest, Bureau 204, Sherbrooke, Qc, J1J 2G2, Canada 2235 rue King Ouest, Bureau 204, Sherbrooke, Qc, Canada, J1J 2G2 Les Belles Du Lac 490 rue Principale, Piopolis, Qc, G0Y 1H0, Canada 490 rue Principale, Piopolis, Qc, Canada, G0Y 1H0 4841 rue Wellington, Verdun, QC, H4G 1X5 , Canada 4841 rue Wellington, Verdun, QC, Canada, H4G 1X5 Boutique-Atelier Anne-Marie Chagnon 5333, avenue Casgrain, 5e étage, suite 502, Montréal, QC, H2T 1X3, Canada 5333, avenue Casgrain, 5e étage, suite 502, Montréal, QC, Canada, H2T 1X3 86, avenue Laurier Ouest, Montréal, QC, H2T 2N4, Canada 86, avenue Laurier Ouest, Montréal, QC, Canada, H2T 2N4 Oppen's 4828, boul. Saint-Laurent, Montréal, QC, H2T 1R5, Canada 4828, boul. Saint-Laurent, Montréal, QC, Canada, H2T 1R5 Belle et Rebelle , Montréal, QC, H2S 2L9, Canada , Montréal, QC, Canada, H2S 2L9 Arloca 6572 Saint-Hubert, Montréal, QC, H2S 2M3, Canada 6572 Saint-Hubert, Montréal, QC, Canada, H2S 2M3 Artefact Montréal 4117, rue Saint-Denis, Montréal, QC, H2W 2M7, Canada 4117, rue Saint-Denis, Montréal, QC, Canada, H2W 2M7 La Mansarde Bleue 2563, rue Beaubien Est, Montréal, QC, H1Y 1G4, Canada 2563, rue Beaubien Est, Montréal, QC, Canada, H1Y 1G4 Boutique M (Musée des beaux-arts de Montréal) 1390, rue Sherbrooke Ouest, Montréal, QC, H3G 1J5, Canada 1390, rue Sherbrooke Ouest, Montréal, QC, Canada, H3G 1J5 Bijouterie Claude Gougeon & fils 3116, rue Masson, Montréal, QC, H1Y 1X8, Canada 3116, rue Masson, Montréal, QC, Canada, H1Y 1X8 L'Art des Artisans du Québec 150, rue Sainte-Catherine Ouest, Complexe Desjardins, Montréal, QC, H2X 3Y2, Canada 150, rue Sainte-Catherine Ouest, Complexe Desjardins, Montréal, QC, Canada, H2X 3Y2 Boutique des métiers d'art du Québec 20, rue Saint-Paul Ouest, Suite 103, Montréal, QC, H2Y 1Y7, Canada 20, rue Saint-Paul Ouest, Suite 103, Montréal, QC, Canada, H2Y 1Y7 La Boutique Artisans Canada (Montréal) 122, rue St-Paul Est, Montréal, QC, H2Y 1G6, Canada 122, rue St-Paul Est, Montréal, QC, Canada, H2Y 1G6 LOLA Petite Bourgogne 2652, rue Notre-Dame Ouest, Montréal, QC, H3J 1N7, Canada 2652, rue Notre-Dame Ouest, Montréal, QC, Canada, H3J 1N7 Joaillerie Jules Perrier 350, rue Saint-Paul Est, Marché Bonsecours, Montréal, QC, H2Y 1H2, Canada 350, rue Saint-Paul Est, Marché Bonsecours, Montréal, QC, Canada, H2Y 1H2 Casa Luca 1354, rue Fleury Est, Montréal, QC, H2C 1R5, Canada 1354, rue Fleury Est, Montréal, QC, Canada, H2C 1R5 428 Victoria, Suite A, Saint-Lambert, QC, J4P 2H9, Canada 428 Victoria, Suite A, Saint-Lambert, QC, Canada, J4P 2H9 Charlot fleurs et cadeaux 189, rue Saint-Charles Ouest, Longueuil, QC, J4H 1C8, Canada 189, rue Saint-Charles Ouest, Longueuil, QC, Canada, J4H 1C8 Bijoux L'Inédit 524, avenue Victoria, Saint-Lambert, QC, J4P 2J5, Canada 524, avenue Victoria, Saint-Lambert, QC, Canada, J4P 2J5 Joaillerie Langevin 66, route 132, Local 100, Deslon, QC, J5B 0A1, Canada 66, route 132, Local 100, Deslon, QC, Canada, J5B 0A1 Boutique Le Présent 155, rue Saint-André, Terrebonne, QC, J6W 3C2, Canada 155, rue Saint-André, Terrebonne, QC, Canada, J6W 3C2 Novo Bas 1001, boul. de Montarville, Boucherville, QC, J4B 6P5, Canada 1001, boul. de Montarville, Boucherville, QC, Canada, J4B 6P5 Signé Local - DIX30 9200, boul. Leduc , suite 160, Brossard, QC, J4Y 0J1, CANADA 9200, boul. Leduc , suite 160, Brossard, QC, CANADA, J4Y 0J1 Cachet Ampleman 270 Boul. Anjou, Châteauguay, QC, J6K 1C6, Canada 270 Boul. Anjou, Châteauguay, QC, Canada, J6K 1C6 645, Boul. Samson, Laval, QC, H7X 1J9, Canada 645, Boul. Samson, Laval, QC, Canada, H7X 1J9 Nous Vous Ils Boutique Métiers D'art 150 chemin de la Grande-Côte , Suite 101, Rosemère, QC, J7A 1H3, Canada 150 chemin de la Grande-Côte , Suite 101, Rosemère, QC, Canada, J7A 1H3 Atelier Bois Brillant 22 Chemin de la Grande-Côte, Boisbriand, QC, J7G 1E2, Canada 22 Chemin de la Grande-Côte, Boisbriand, QC, Canada, J7G 1E2 Boutique Héritage 260, rue Notre-Dame, Repentigny, QC, J6A 2R6, Canada 260, rue Notre-Dame, Repentigny, QC, Canada, J6A 2R6 Boutique La Chaumière 1401, rue de Montarville, Saint-Bruno-de-Montarville, QC, J3V 3T6, Canada 1401, rue de Montarville, Saint-Bruno-de-Montarville, QC, Canada, J3V 3T6 La P'tite Bise 367, boul. Arthur-Sauvé, Place Saint-Eustache, Saint-Eustache, QC, J7P 2B1, Canada 367, boul. Arthur-Sauvé, Place Saint-Eustache, Saint-Eustache, QC, Canada, J7P 2B1 Ombelle Fleuriste 191, rue Sir Wilfrid Laurier , Local 110, St-Basile-le-Grand, QC, J3N 1R1, Canada 191, rue Sir Wilfrid Laurier , Local 110, St-Basile-le-Grand, QC, Canada, J3N 1R1 Boutique Signé Marie-Pierre 505, boul Arthur Sauvé, Saint-Eustache, QC, J7P 4X4, Canada 505, boul Arthur Sauvé, Saint-Eustache, QC, Canada, J7P 4X4 Gaby Style et Passion 1255, boul. de Périgny, Place Chambly, Chambly, QC, J3L 1W7 , Canada 1255, boul. de Périgny, Place Chambly, Chambly, QC, Canada, J3L 1W7 La Douce Pensée 520, boul. Arthur-Sauvé, Hôpital de Saint-Eustache, Saint-Eustache, QC, J7R 5B1, Canada Hôpital de Saint-Eustache, Saint-Eustache, QC, Canada, J7R 5B1 459, boul. Saint-Luc, Saint-Jean-sur-Richelieu, QC, J2W 1E7, Canada 459, boul. Saint-Luc, Saint-Jean-sur-Richelieu, QC, Canada, J2W 1E7 290, boul. Saint-Luc, Local 28, Saint-Jean-sur-Richelieu, QC, J2W 2A3, Canada 290, boul. Saint-Luc, Local 28, Saint-Jean-sur-Richelieu, QC, Canada, J2W 2A3 Bijouterie Renaissance 814, boul. de l'Ange-Gardien, L'Assomption, QC, J5W 1P6, Canada 814, boul. de l'Ange-Gardien, L'Assomption, QC, Canada, J5W 1P6 G. D'Aoust et Cie 73, rue Sainte-Anne, Sainte-Anne-de-Bellevue, QC, H9X 1L9, Canada 73, rue Sainte-Anne, Sainte-Anne-de-Bellevue, QC, Canada, H9X 1L9 145, boul. Saint-Joseph, Local 96, Halles Saint-Jean, Saint-Jean-sur-Richelieu, QC, J3B 1W5, Canada 145, boul. Saint-Joseph, Local 96, Halles Saint-Jean, Saint-Jean-sur-Richelieu, QC, Canada, J3B 1W5 Boutique L'Antilope 934, rue Monseigneur-De Laval, Beloeil, QC, J3G 4E7, Canada 934, rue Monseigneur-De Laval, Beloeil, QC, Canada, J3G 4E7 Mers & Monde – Boutique Mode Voyage 418, boul. Sir-Wilfrid-Laurier, Mont-Saint-Hilaire, QC, J3H 3N9, Canada 418, boul. Sir-Wilfrid-Laurier, Mont-Saint-Hilaire, QC, Canada, J3H 3N9 Pensée Pour Vous 286, avenue Saint-Charles, Vaudreuil-Dorion, QC, J7V 2L8, Canada 286, avenue Saint-Charles, Vaudreuil-Dorion, QC, Canada, J7V 2L8 Boutique Amandine Joliette 21, place Bourget Nord, Joliette, QC, J6E 5E3, Canada 21, place Bourget Nord, Joliette, QC, Canada, J6E 5E3 Simplement Célyne 51, rue Grande-Île, Salaberry-de-Valleyfield, QC, J6S 3L9, Canada 51, rue Grande-Île, Salaberry-de-Valleyfield, QC, Canada, J6S 3L9 Boutique Amandine 1305, rue des Cascades, Saint-Hyacinthe, QC, J2S 3H3, Canada 1305, rue des Cascades, Saint-Hyacinthe, QC, Canada, J2S 3H3 Fleurs du Village 61, route 338, Les Coteaux, QC, J7X 1A2, Canada 61, route 338, Les Coteaux, QC, Canada, J7X 1A2 Le Marché Vert 75, avenue de la Gare, Bloc K-1, Les Galeries des Monts, Saint-Sauveur, QC, J0R 1R6, Canada 75, avenue de la Gare, Bloc K-1, Les Galeries des Monts, Saint-Sauveur, QC, Canada, J0R 1R6 Les Choix de Mimi 260, rue Principale, Saint-Sauveur, QC, J0R 1R0, Canada 260, rue Principale, Saint-Sauveur, QC, Canada, J0R 1R0 2347, rue de L'Église , Val-David, QC, J0T 2N0, Canada 2347, rue de L'Église , Val-David, QC, Canada, J0T 2N0 L'Échoppe de la Montagne 725, rue Shefford, Bromont, QC, J2L 1C2, Canada 725, rue Shefford, Bromont, QC, Canada, J2L 1C2 Vert Partout 19, rue Principale Nord, Sutton, QC, J0E 2K0, Canada 19, rue Principale Nord, Sutton, QC, Canada, J0E 2K0 Rien ne se perd tout se crée 91, rue Principale, Saint-Sévère, QC, G0X 3B0, Canada 91, rue Principale, Saint-Sévère, QC, Canada, G0X 3B0 814-2, rue de Saint-Jovite, Mont-Tremblant, QC, J8E 3J8, Canada 814-2, rue de Saint-Jovite, Mont-Tremblant, QC, Canada, J8E 3J8 La Grange des Artisans 284, rue Lindsay, Drummondville, QC, J2B 1G3, Canada 284, rue Lindsay, Drummondville, QC, Canada, J2B 1G3 Fleuriste Savard 1833 Boulevard Louis Fréchette, Nicolet, QC, J3T 1M4, Canada 1833 Boulevard Louis Fréchette, Nicolet, QC, Canada, J3T 1M4 Bijouterie La Perle Rare 3905, rue Bellefeuille, Trois-Rivières, QC, G9A 6K8, Canada 3905, rue Bellefeuille, Trois-Rivières, QC, Canada, G9A 6K8 Boutique Cinq Continents 1468, rue Notre-Dame Centre, Trois-Rivières, QC, G9A 4X5, Canada 1468, rue Notre-Dame Centre, Trois-Rivières, QC, Canada, G9A 4X5 300, rue Barkoff, Les Galeries du Cap, Trois-Rivières, QC, G8T 2A3, Canada 300, rue Barkoff, Les Galeries du Cap, Trois-Rivières, QC, Canada, G8T 2A3 Bijouterie PierLyn 107, rue Galipeau, Thurso, QC, J0X 3B0, Canada 107, rue Galipeau, Thurso, QC, Canada, J0X 3B0 Belle et Rebelle Sherbrooke 90 rue Wellington Nord, Sherbrooke, QC, J1H 5B8, Canada 90 rue Wellington Nord, Sherbrooke, QC, Canada, J1H 5B8 Atours du Monde 87, rue Notre-Dame Est, Victoriaville, QC, G6P 3Z8, Canada 87, rue Notre-Dame Est, Victoriaville, QC, Canada, G6P 3Z8 Shepherd's Fashions 145 Trainyards Drive, Unit 4, Ottawa, ON, K1G 3X8, Canada 145 Trainyards Drive, Unit 4, Ottawa, ON, Canada, K1G 3X8 Magpie Jewellery 799 Bank Street, Glebe store, Ottawa, ON, K1S 3V7, Canada 799 Bank Street, Glebe store, Ottawa, ON, Canada, K1S 3V7 50 Rideau Street, Unit 220B, CF Rideau Centre, 2nd Floor, Ottawa, ON, K1N 9J7, Canada 50 Rideau Street, Unit 220B, CF Rideau Centre, 2nd Floor, Ottawa, ON, Canada, K1N 9J7 Boutique Moi 355, boul. Gréber, Gatineau, QC, J8T 6H8, Canada 355, boul. Gréber, Gatineau, QC, Canada, J8T 6H8 National Gallery of Canada Boutique 10 Lady Grey Drive South End, Ottawa, ON, K1N 9N4, Canada 10 Lady Grey Drive South End, Ottawa, ON, Canada, K1N 9N4 Musée Canadien de l'histoire 100, rue Laurier, Gatineau, QC, K1A 0M8, Canada 100, rue Laurier, Gatineau, QC, Canada, K1A 0M8 Boutique Le Local 144, rue Eddy, Gatineau, QC, J8X 2W8, Canada 144, rue Eddy, Gatineau, QC, Canada, J8X 2W8 Clothes by Muriel Dombret 1258 Wellington Street West, Ottawa, ON, K1Y 3A5, Canada 1258 Wellington Street West, Ottawa, ON, Canada, K1Y 3A5 430 Richmond Road, Westboro store, Ottawa, ON, K2A 0G2, Canada 430 Richmond Road, Westboro store, Ottawa, ON, Canada, K2A 0G2 La Nomade 103, rue Principale, Gatineau, QC, J9H 3L9, Canada 103, rue Principale, Gatineau, QC, Canada, J9H 3L9 Bijouterie Signe B 220, rue du Collège, Suite 102, Pont-Rouge, QC, G3H 0C6, Canada 220, rue du Collège, Suite 102, Pont-Rouge, QC, Canada, G3H 0C6 A. Setlakwe 600, avenue Champlain, Disraeli, QC, G0N 1E3, Canada 600, avenue Champlain, Disraeli, QC, Canada, G0N 1E3 188, rue Notre-Dame Ouest, Thetford Mines, QC, G6G 1J6, Canada 188, rue Notre-Dame Ouest, Thetford Mines, QC, Canada, G6G 1J6 Groupe Jacobus 2700 Boulevard Laurier, 2e niveau, Place Laurier, A/s de Diane Lacasse, Québec, QC, G1V 2L8, Canada 2700 Boulevard Laurier, 2e niveau, Place Laurier, A/s de Diane Lacasse, Québec, QC, Canada, G1V 2L8 Musselli 1329B, avenue Maguire, Québec, QC, G1T 1Z2, Canada 1329B, avenue Maguire, Québec, QC, Canada, G1T 1Z2 Accessoires Mode Elle & Lui 8500, boul. Henri-Bourassa, Carrefour Charlesbourg, Québec, QC, G1G 5X1, Canada 8500, boul. Henri-Bourassa, Carrefour Charlesbourg, Québec, QC, Canada, G1G 5X1 Boutique du Musée des beaux-arts du Québec 179, Grande Allée Ouest, Grand Hall, Québec, QC, G1R 2H1, Canada 179, Grande Allée Ouest, Grand Hall, Québec, QC, Canada, G1R 2H1 1191, avenue Cartier, A/s de Kathy Dion, Québec, QC, G1R 2S9, Canada 1191, avenue Cartier, A/s de Kathy Dion, Québec, QC, Canada, G1R 2S9 Boutique Exil 714, rue Saint-Jean, Québec, QC, G1R 1P9, Canada 714, rue Saint-Jean, Québec, QC, Canada, G1R 1P9 La boutique Artisans Canada (Québec) 30, côte de la Fabrique, Québec, QC, G1R 3V7, Canada 30, côte de la Fabrique, Québec, QC, Canada, G1R 3V7 Boutique Fairmont (Le Château Frontenac) 1, rue des Carrières, Niveau du Grand Hall, Québec, QC, G1R 4P5, Canada 1, rue des Carrières, Niveau du Grand Hall, Québec, QC, Canada, G1R 4P5 39, rue du Petit Champlain, Québec, QC, G1K 4H5, Canada 39, rue du Petit Champlain, Québec, QC, Canada, G1K 4H5 Atelier La Pomme 47, rue Sous-le-Fort, Québec, QC, G1K 4G9, Canada 47, rue Sous-le-Fort, Québec, QC, Canada, G1K 4G9 29, rue Notre-Dame, Place Royale, Québec, QC, G1K 4E9, Canada Place Royale, Québec, QC, Canada, G1K 4E9 Boutique du Musée de la civilisation 85, rue Dalhousie, Québec, QC, G1K 4A5, Canada 85, rue Dalhousie, Québec, QC, Canada, G1K 4A5 Bijouterie du Vieux Fort 7777, boul. Guillaume-Couture, Local 29, Lévis, QC, G6V 6Z1, Canada 7777, boul. Guillaume-Couture, Local 29, Lévis, QC, Canada, G6V 6Z1 Bittersweet Fine Craft and Art 5 Leckie Lane, P.O. Box 14, Burnstown, ON, K0J 1G0, Canada 5 Leckie Lane, P.O. Box 14, Burnstown, ON, Canada, K0J 1G0 32 Dundas Street East, Napanee, ON, K7R 1H6, Canada 32 Dundas Street East, Napanee, ON, Canada, K7R 1H6 Massothérapie Manon Dufour 955 Boul. Auger Ouest, Alma, QC, G8B 2B9, Canada 955 Boul. Auger Ouest, Alma, QC, Canada, G8B 2B9 Le Moule à Sucre 248, avenue de Gaspé Est, Saint-Jean-Port-Joli, QC, G0R 3G0, Canada 248, avenue de Gaspé Est, Saint-Jean-Port-Joli, QC, Canada, G0R 3G0 Autour du Pot 42, rue Saint-Jean Baptiste, Baie-Saint-Paul, QC, G3Z 1L9, Canada 42, rue Saint-Jean Baptiste, Baie-Saint-Paul, QC, Canada, G3Z 1L9 Véronique Fortier Joaillière 341B, rue Racine Est, Chicoutimi, QC, G7H 1S8, Canada 341B, rue Racine Est, Chicoutimi, QC, Canada, G7H 1S8 Miss Priss 215 Front Street, Belleville, ON, K8N 2Z4, Canada 215 Front Street, Belleville, ON, Canada, K8N 2Z4 Boutique Indigène art et culture (Séguin) 40, rue du Quai, La Malbaie, QC, G5A 2Y1, Canada 40, rue du Quai, La Malbaie, QC, Canada, G5A 2Y1 Talk O' The Town 19555 Opeongo Line, Barry's Bay, ON, K0J 1B0, Canada 19555 Opeongo Line, Barry's Bay, ON, Canada, K0J 1B0 Zihua Boutique 22A Bridge Street West, Bancroft, ON, K0L 1C0, Canada 22A Bridge Street West, Bancroft, ON, Canada, K0L 1C0 Boutique Le Coquill'Art 356, rue Saint-Jean-Baptiste, L'Anse-Saint-Jean, QC, G0V 1J0, Canada 356, rue Saint-Jean-Baptiste, L'Anse-Saint-Jean, QC, Canada, G0V 1J0 The Clan Shoppe 47 Main Street, Brighton, ON, K0K 1H0, Canada 47 Main Street, Brighton, ON, Canada, K0K 1H0 Trentmendous 33 Main Street, Unit 3, Warkworth, ON, K0K 3K0, Canada Unit 3, Warkworth, ON, Canada, K0K 3K0 Eclectic Mix 13 Main Street, Warkworth, ON, K0K 3K0, Canada 13 Main Street, Warkworth, ON, Canada, K0K 3K0 13 Main Street, P.O. Box 414, Warkworth, ON, K0K 3K0, Canada P.O. Box 414, Warkworth, ON, Canada, K0K 3K0 Fragrances d'Alex 295, boul. Armand-Thériault, Rivière-du-loup, QC, G5R 5H3, Canada 295, boul. Armand-Thériault, Rivière-du-loup, QC, Canada, G5R 5H3 Boutique Nomade 382, rue Lafontaine, Rivière-du-Loup, QC, G5R 3B4, Canada 382, rue Lafontaine, Rivière-du-Loup, QC, Canada, G5R 3B4 Brittany N Bros 35 King Street West, Cobourg, ON, K9A 2M1, Canada 35 King Street West, Cobourg, ON, Canada, K9A 2M1 392 George Street North, Peterborough, ON, K9H 3R3, Canada 392 George Street North, Peterborough, ON, Canada, K9H 3R3 Bijouterie Baribeau 775, 3e Avenue, Val-d'Or, QC, J9P 1S8, Canada 775, 3e Avenue, Val-d'Or, QC, Canada, J9P 1S8 Esthétique Florilège 2366, rue Commerciale Sud, Témiscouata-sur-le-Lac, QC, G0L 1X0, Canada 2366, rue Commerciale Sud, Témiscouata-sur-le-Lac, QC, Canada, G0L 1X0 The Kawartha Store 30 Colborne Street, Fenelon Falls, ON, K0M 1N0, Canada 30 Colborne Street, Fenelon Falls, ON, Canada, K0M 1N0 Oxtongue Craft Cabin & Gallery 1073 Fox Point Road, Dwight, ON, P0A 1H0, Canada 1073 Fox Point Road, Dwight, ON, Canada, P0A 1H0 241 Queen Street, Port Perry, ON, L9L 1B9, Canada 241 Queen Street, Port Perry, ON, Canada, L9L 1B9 Eclipse Art Gallery 1235 Deerhurst Drive, Deerhurst Resort, Huntsville, ON, P1H 2E8, Canada 1235 Deerhurst Drive, Deerhurst Resort, Huntsville, ON, Canada, P1H 2E8 96, rue Saint-Germain Ouest, Rimouski, QC, G5L 4B5, Canada 96, rue Saint-Germain Ouest, Rimouski, QC, Canada, G5L 4B5 255 Boul Ste-Anne, Rimouski, QC, G5M 1E7, Canada 255 Boul Ste-Anne, Rimouski, QC, Canada, G5M 1E7 Optimus Jewellery & Watches 13 Queen Street, Niagara-on-the-Lake, ON, L0S 1J0, Canada 13 Queen Street, Niagara-on-the-Lake, ON, Canada, L0S 1J0 33, route du Fleuve Ouest, Sainte-Luce, QC, G0K 1P0, Canada 33, route du Fleuve Ouest, Sainte-Luce, QC, Canada, G0K 1P0 Thompson Landry Gallery (Cooperage Space) 6 Trinity Street, Distillery District, Toronto, ON, M5A 3C4, Canada 6 Trinity Street, Distillery District, Toronto, ON, Canada, M5A 3C4 223 Carlton Street, Toronto, ON, M5A 2L2, Canada 223 Carlton Street, Toronto, ON, Canada, M5A 2L2 Bijouterie Lingot D'Or 100, rue du Terminus Ouest, Promenade du Cuivre, Rouyn-Noranda, QC, J9X 6H7, Canada 100, rue du Terminus Ouest, Promenade du Cuivre, Rouyn-Noranda, QC, Canada, J9X 6H7 Options For Her 163 Cumberland Street, Toronto, ON, M5R 1A2, Canada 163 Cumberland Street, Toronto, ON, Canada, M5R 1A2 Shop at Art Gallery of Ontario 317 Dundas Street West, Toronto, ON, M5T 1G4, Canada 317 Dundas Street West, Toronto, ON, Canada, M5T 1G4 Freda's 86 Bathurst Street, Toronto, ON, M5V 2P5, Canada 86 Bathurst Street, Toronto, ON, Canada, M5V 2P5 494 Lawrence Avenue West, Marshalls Lawrence Square, Toronto, ON, M6A 1A1, Canada 494 Lawrence Avenue West, Marshalls Lawrence Square, Toronto, ON, Canada, M6A 1A1 Petroff Gallery 1016 Eglinton Avenue West, Toronto, ON, M6C 2C5, Canada 1016 Eglinton Avenue West, Toronto, ON, Canada, M6C 2C5 Made you Look Jewellery 1338 Queen Street West, Toronto, ON, M6K 1L4, Canada 1338 Queen Street West, Toronto, ON, Canada, M6K 1L4 100 Fourth Avenue, Unit 25, Ridley Heights Plaza, Saint Catharines, ON, L2S 2J2, Canada Unit 25, Ridley Heights Plaza, Saint Catharines, ON, Canada, L2S 2J2 Joni's Fine Clothing & Accessories 48 Ellen Street, Barrie, ON, L4N 3A4, Canada 48 Ellen Street, Barrie, ON, Canada, L4N 3A4 Haven's Clothing 4242 Dundas Street West, Kingsmill Shopping Centre, Etobicoke, ON, M8X 1Y6, Canada 4242 Dundas Street West, Kingsmill Shopping Centre, Etobicoke, ON, Canada, M8X 1Y6 McMichael Canadian Art Collection 10365 Islington Avenue, Kleinburg, ON, L0J 1C0, Canada 10365 Islington Avenue, Kleinburg, ON, Canada, L0J 1C0 Objects To Desire 1 Livingston Avenue, Grimsby, ON, L3M 1K4, Canada 1 Livingston Avenue, Grimsby, ON, Canada, L3M 1K4 The Shop For All Reasons 228 Queen Street South, Village of Streetville, Mississauga, ON, L5M 1L5, Canada 228 Queen Street South, Village of Streetville, Mississauga, ON, Canada, L5M 1L5 147 Water Street, Saint Andrews, NB, E5B 1A7, Canada 147 Water Street, Saint Andrews, NB, Canada, E5B 1A7 Art Gallery of Burlington 1333 Lakeshore Road, Burlington, ON, L7S 1A9, Canada 1333 Lakeshore Road, Burlington, ON, Canada, L7S 1A9 Pippa & Prue 312 Dundas Street East, Unit 1, Waterdown, ON, L0R 2H0, Canada 312 Dundas Street East, Unit 1, Waterdown, ON, Canada, L0R 2H0 Shop at Art Gallery of Hamilton 123 King Street West, Hamilton, ON, L8P 4S8, Canada 123 King Street West, Hamilton, ON, Canada, L8P 4S8 Dragonfly Arts on Broadway 189 Broadway Avenue, Orangeville, ON, L9W 1K2, Canada 189 Broadway Avenue, Orangeville, ON, Canada, L9W 1K2 Ladies Designer Fashions 10 Keith Avenue, Suite 205, Cranberry Mews Plaza, Collingwood, ON, L9Y 0W5, Canada 10 Keith Avenue, Suite 205, Cranberry Mews Plaza, Collingwood, ON, Canada, L9Y 0W5 Pavlo Pottery Studio and Shoppe 776 Old Highway 8, Rockton, ON, L0R 1X0, Canada 776 Old Highway 8, Rockton, ON, Canada, L0R 1X0 Carrington & Co. 225 Woodstock Road, Fredericton, NB, E3B 2H8, Canada 225 Woodstock Road, Fredericton, NB, Canada, E3B 2H8 Urban Threadz 103 Church Street, Fredericton, NB, E3B 4C8, Canada 103 Church Street, Fredericton, NB, Canada, E3B 4C8 Women's International Gift & Gallery (YWCA) 55 Dickson Street, Cambridge, ON, N1R 7A5, Canada 55 Dickson Street, Cambridge, ON, Canada, N1R 7A5 Karger Gallery 14 East Mill Street, Elora, ON, N0B 1S0, Canada 14 East Mill Street, Elora, ON, Canada, N0B 1S0 Canadian Clay and Glass Gallery Shop 25 Caroline Street North, Waterloo, ON, N2L 2Y5, Canada 25 Caroline Street North, Waterloo, ON, Canada, N2L 2Y5 Xclusive Elements 7 Front Street, Saint Jacobs, ON, N0B 2N0, Canada 7 Front Street, Saint Jacobs, ON, Canada, N0B 2N0 The Butcher's Daughter 47 Charlotte Street, Saint John City Market, Saint John, NB, E2L 2H8, Canada Saint John City Market, Saint John, NB, Canada, E2L 2H8 Boutique Zekara 47 Clark Road, Rothesay, NB, E2E 2K8, Canada 47 Clark Road, Rothesay, NB, Canada, E2E 2K8 Kisses Ladies Wear 247 Durham Street E, Walkerton, ON, N0G 2V0, Canada 247 Durham Street E, Walkerton, ON, Canada, N0G 2V0 The Touchmark Shop 137 Ontario Street, Stratford, ON, N5A 3H1, Canada 137 Ontario Street, Stratford, ON, Canada, N5A 3H1 Le Serpent à Plumes 756, boul. Perron, Carleton, QC, G0C 1J0, Canada 756, boul. Perron, Carleton, QC, Canada, G0C 1J0 The Flight of Fancy 1869 Clementsvale Road, Bear River, NS, B0S 1B0, Canada 1869 Clementsvale Road, Bear River, NS, Canada, B0S 1B0 MUSE (Museum London's Gift Shop) 421 Ridout Street North, London, ON, N6A 5H4, Canada 421 Ridout Street North, London, ON, Canada, N6A 5H4 Gifted at Applegate 49 South Sharpsville Avenue, Sharon, PA, 16146, USA 49 South Sharpsville Avenue, Sharon, PA, USA, 16146 Studio Style 215 Main Street, Port Stanley, ON, N5L 1C4, Canada 215 Main Street, Port Stanley, ON, Canada, N5L 1C4 Catherine & Company 173 Main Street, Bathurst, NB, E2A 1A6, Canada 173 Main Street, Bathurst, NB, Canada, E2A 1A6 The Urban Nest 3 Renaud Street, Miramichi, NB, E1V 6T2, Canada 3 Renaud Street, Miramichi, NB, Canada, E1V 6T2 Eccentricity Designs 135 E Main St, Carnegie , PA, 15106, USA 135 E Main St, Carnegie , PA, USA, 15106 The Cameleer 125 East Davis Street, Culpeper, VA, 22701, USA 125 East Davis Street, Culpeper, VA, USA, 22701 Judy's Art Gallery 17 Main Street, Suite A, Bayfield, ON, N0M 1G0, Canada Suite A, Bayfield, ON, Canada, N0M 1G0 Objects Art and More 4462 Irvington Road, Irvington, VA, 22480, USA 4462 Irvington Road, Irvington, VA, USA, 22480 Sophia Boutique 7578 Fredle Drive, Painesville, OH, 44077, USA 7578 Fredle Drive, Painesville, OH, USA, 44077 Folies Féminines 431, avenue Brochu, Sept-Îles, QC, G4R 2W9, Canada 431, avenue Brochu, Sept-Îles, QC, Canada, G4R 2W9 Stile Fashion Accessories 801 Main street, Moncton , NB, E1C 1G1, Canada 801 Main street, Moncton , NB, Canada, E1C 1G1 Robert & Gabriel 5244 Mayfield Road, Lyndhurst, OH, 44124, USA 5244 Mayfield Road, Lyndhurst, OH, USA, 44124 Maddie & Sofia 250 Champlain Street, Unit 1B, Dieppe, NB, E1A 1P3, Canada 250 Champlain Street, Unit 1B, Dieppe, NB, Canada, E1A 1P3 Boutique Jolie Eve 445, boul. Saint-Pierre Ouest, Place Saint-Pierre, Caraquet, NB, E1W 1B2, Canada 445, boul. Saint-Pierre Ouest, Place Saint-Pierre, Caraquet, NB, Canada, E1W 1B2 Fine Points 126202 Larchmere Blvd, Cleveland, OH, 44120, USA 126202 Larchmere Blvd, Cleveland, OH, USA, 44120 Cleveland Museum of Art Store 11150 East Boulevard, Ames Family Atrium, Cleveland, OH, 44106, USA 11150 East Boulevard, Ames Family Atrium, Cleveland, OH, USA, 44106 Lilieth Boutique 220 Main Street, Liverpool, NS, B0T 1K0, Canada 220 Main Street, Liverpool, NS, Canada, B0T 1K0 Evie Lou 2509 Professor Avenue, Cleveland, OH, 44113, USA 2509 Professor Avenue, Cleveland, OH, USA, 44113 Don Drumm Studios & Gallery 437 Crouse Street, Akron, OH, 44311, USA 437 Crouse Street, Akron, OH, USA, 44311 Laura of Pembroke 3119 Whipple Avenue Northwest, Canton, OH, 44718, USA 3119 Whipple Avenue Northwest, Canton, OH, USA, 44718 Herbin Jewellers 453 Main Street, Wolfville, NS, B4P 1E3, Canada 453 Main Street, Wolfville, NS, Canada, B4P 1E3 Northern Sun Gallery & Gifts 8 Edgewater Street, Mahone Bay, NB, B0J 2E0, Canada 8 Edgewater Street, Mahone Bay, NB, Canada, B0J 2E0 Caico-Mae Clothiers 138 Montague Street, Lunenburg, NS, B0J 2C0, Canada 138 Montague Street, Lunenburg, NS, Canada, B0J 2C0 30 Church Women's Clothing 30 Church Street, Amherst , NS, B4H 3A7, Canada 30 Church Street, Amherst , NS, Canada, B4H 3A7 Lamia Lamia Salon and Day Spa 19653 Mack Avenue, Grosse Pointe Woods, MI, 48236, USA 19653 Mack Avenue, Grosse Pointe Woods, MI, USA, 48236 3011 West Grand Blvd, Fisher Building, Detroit, MI, 48202, USA 3011 West Grand Blvd, Fisher Building, Detroit, MI, USA, 48202 Studio Sandra 415 East 4th Street, Suite B, Royal Oak, MI, 48067, USA 415 East 4th Street, Suite B, Royal Oak, MI, USA, 48067 Trinity Jewellers 6226 Quinpool Road, Halifax, NS, B3L 1A3, Canada 6226 Quinpool Road, Halifax, NS, Canada, B3L 1A3 FireWorks Gallery 1569 Barrington Street , Halifax, NS , B3J 1Z7, Canada 1569 Barrington Street , Halifax, NS , Canada, B3J 1Z7 Barbara Boz Boutique 205 East Maple Road, Birmingham, MI, 48009, USA 205 East Maple Road, Birmingham, MI, USA, 48009 Timeless & Twist 219 Highway 2, Unit 1, Enfield, NS, B2T 1C9, Canada 219 Highway 2, Unit 1, Enfield, NS, Canada, B2T 1C9 Island Beach Company 1 Bell Boulevard Extension, Halifax Airport, Enfield, NS, B2T 1K2, Canada 1 Bell Boulevard Extension, Halifax Airport, Enfield, NS, Canada, B2T 1K2 Wanda's Perfect Stitch 6449 Inkster Road, Bloomfield Hills, MI, 48301, USA 6449 Inkster Road, Bloomfield Hills, MI, USA, 48301 Marta's Loft 115 South Saginaw Street, Holly, MI, 48442, USA 115 South Saginaw Street, Holly, MI, USA, 48442 Maynard's Fashions & Cosmetics 2123 South Linden Road, Flint, MI, 48532, USA 2123 South Linden Road, Flint, MI, USA, 48532 Details Past & Present 166 Richmond Street, Charlottetown, PE, C1A 1H9, Canada 166 Richmond Street, Charlottetown, PE, Canada, C1A 1H9 ModeAlise 7227 North High Street, Suite 122, The Shops at Worthington Place, Worthington, OH, 43085, USA 7227 North High Street, Suite 122, The Shops at Worthington Place, Worthington, OH, USA, 43085 Sherrie Gallery 694 North High Street, Columbus, OH, 43215, USA 694 North High Street, Columbus, OH, USA, 43215 129 East Main Street , Midland , MI, 48640, USA 129 East Main Street , Midland , MI, USA, 48640 Night Gallery - Branching Out 201 South Estes Drive, University Place, Chapel Hill, NC, 27514, USA 201 South Estes Drive, University Place, Chapel Hill, NC, USA, 27514 Ameublement BrandSource du Havre 1280, rue de la Digue, Havre Saint-Pierre, QC, G0G 1P0, Canada 1280, rue de la Digue, Havre Saint-Pierre, QC, Canada, G0G 1P0 Mackerel Sky 211 M.A.C Avenue, East Lansing, MI, 48823, USA 211 M.A.C Avenue, East Lansing, MI, USA, 48823 Devils Lake View Living 200 Devils Lake Hwy, Manitou Beach, MI, 49253, USA 200 Devils Lake Hwy, Manitou Beach, MI, USA, 49253 Carolyn Todd's 1826 Pembroke Road, Greensboro, NC, 27408, USA 1826 Pembroke Road, Greensboro, NC, USA, 27408 Katalyst 1214 Turner Street, Lansing, MI, 48906, USA 1214 Turner Street, Lansing, MI, USA, 48906 139 State Street, Harbor Springs, MI, 49740, USA 139 State Street, Harbor Springs, MI, USA, 49740 The Plum Tree Gift Shoppe 225 Main Street, Antigonish, NS, B2G 2C1, Canada 225 Main Street, Antigonish, NS, Canada, B2G 2C1 Lavoie Designs Artwear 9076 Helena Road, Alden, MI, 49612, USA 9076 Helena Road, Alden, MI, USA, 49612 Juliaetta's Trunk 100 Corry Street, Yellow Springs, OH, 45387, USA 100 Corry Street, Yellow Springs, OH, USA, 45387 Eve Avery Boutique 131 Northeast Broad Street, Southern Pines, NC, 28387, USA 131 Northeast Broad Street, Southern Pines, NC, USA, 28387 126 East Front St., Traverse City, MI, 49684, USA 126 East Front St., Traverse City, MI, USA, 49684 1121-G Military Cutoff Rd. , Wilmington, NC, 28405, USA 1121-G Military Cutoff Rd. , Wilmington, NC, USA, 28405 Monroe Hair Design 8720 Gull Road, Richland , MI, 49083, USA 8720 Gull Road, Richland , MI, USA, 49083 YT Galleria 966 Cherry Street Southeast, Grand Rapids, MI, 49506, USA 966 Cherry Street Southeast, Grand Rapids, MI, USA, 49506 Eve's Leaves 1129 Main Street, Blowing Rock, NC, 28605, USA 1129 Main Street, Blowing Rock, NC, USA, 28605 Pomegranate & Lime 6804 Wooster Pike, Mariemont, OH, 45227, USA 6804 Wooster Pike, Mariemont, OH, USA, 45227 Cockerill Gallery 2700 Erie Avenue , Cincinnati , OH, 45208, USA 2700 Erie Avenue , Cincinnati , OH, USA, 45208 MiCA 12/v 1201 Vine Street, Cincinnati, OH, 45202, USA 1201 Vine Street, Cincinnati, OH, USA, 45202 Moving Spirits 429 River Street , Manistee, MI, 49660, USA 429 River Street , Manistee, MI, USA, 49660 Patchouli Accessories Boutique 503 Chebucto Street, Unit 5, Baddeck, NS, B0E 1B0, Canada 503 Chebucto Street, Unit 5, Baddeck, NS, Canada, B0E 1B0 Judee's 1205 East University Drive, Granger, IN, 46530, USA 1205 East University Drive, Granger, IN, USA, 46530 Pawleys Island Wear 10880 Ocean Highway, The Hammock Shops Village , Pawleys Island, SC, 29585, USA 10880 Ocean Highway, The Hammock Shops Village , Pawleys Island, SC, USA, 29585 Desirant 34 Broadway Street, Asheville, NC, 28801-2917, USA 34 Broadway Street, Asheville, NC, USA, 28801-2917 23 Haywood Street, Asheville, NC, 28801, USA 23 Haywood Street, Asheville, NC, USA, 28801 Scout Boutique 10 All Souls Crescent, Asheville, NC, 28803, USA 10 All Souls Crescent, Asheville, NC, USA, 28803 Classic Couture 109 E Rutherford St, Landrum, SC, 29356, USA 109 E Rutherford St, Landrum, SC, USA, 29356 Talloni, A Shoe Salon 43 Town Square Blvd, Suite 110, Biltmore Park Town Square, Asheville, NC, 28803, USA 43 Town Square Blvd, Suite 110, Biltmore Park Town Square, Asheville, NC, USA, 28803 Banana Moon (Moon on Main) 329 North Main Street, Hendersonville, NC, 28792, USA 329 North Main Street, Hendersonville, NC, USA, 28792 Laura's Fine Clothing & Gifts 1502 West Sycamore Street, Kokomo, IN, 46901, USA 1502 West Sycamore Street, Kokomo, IN, USA , 46901 9341 Spring Road, Building A, Unit 10, Top of the Hill Shops, Fish Creek, WI, 54212, USA 9341 Spring Road, Building A, Unit 10, Top of the Hill Shops, Fish Creek, WI, USA, 54212 Indianapolis Museum of Art Store 4000 Michigan Road, Indianapolis, IN, 46208, USA 4000 Michigan Road, Indianapolis, IN, USA, 46208 Christopher Park Gallery 608 South Main Street, Suite A, Greenville, SC, 29601, USA Suite A, Greenville, SC, USA, 29601 468 Main Street, Highlands, NC, 28741, USA 468 Main Street, Highlands, NC, USA, 28741 101 West Kirkwood Avenue , Suite 107, Bloomington, IN, 47404, USA 101 West Kirkwood Avenue , Suite 107, Bloomington, IN, USA, 47404 Northern Lights Gallery 423 Main Street, Racine, WI, 53403, USA 423 Main Street, Racine, WI, USA, 53403 1640 East 87th Street, Chicago, IL, 60617, USA 1640 East 87th Street, Chicago, IL, USA, 60617 Arts & Artisans 321 North Michigan Avenue, Chicago, IL, 60601, USA 321 North Michigan Avenue, Chicago, IL, USA, 60601 Mary Walter 33 West Superior Street, Chicago, IL, 60654, USA 33 West Superior Street, Chicago, IL, USA, 60654 35 East Wacker Drive, Chicago, IL, 60601, USA 35 East Wacker Drive, Chicago, IL, USA, 60601 720 South Michigan Avenue, Hilton Hotel, Chicago, IL, 60605, USA 720 South Michigan Avenue, Hilton Hotel, Chicago, IL, USA, 60605 Accents Plus 601 Davis Street, Evanston, IL, 60201, USA 601 Davis Street, Evanston, IL, USA, 60201 500 West Madison Street, Ogilvie Transportation Center, Chicago, IL, 60661, USA 500 West Madison Street, Ogilvie Transportation Center, Chicago, IL, USA, 60661 Picardy Shoe Parlour 11035 North Port Washington Road, Mequon Pavilions Shopping Center, Mequon, WI, 53092, USA 11035 North Port Washington Road, Mequon Pavilions Shopping Center, Mequon, WI, USA, 53092 Milwaukee Art Museum Store 700 North Art Museum Drive, Milwaukee, WI, 53202, USA 700 North Art Museum Drive, Milwaukee, WI, USA, 53202 1515 Sheridan Road, Suite 25, Plaza del Lago, Wilmette, IL, 60091, USA 1515 Sheridan Road, Suite 25, Plaza del Lago, Wilmette, IL, USA, 60091 241 North Broadway, Suite 1B, Milwaukee, WI, 53202, USA 241 North Broadway, Suite 1B, Milwaukee, WI, USA, 53202 4161 North Lincoln Avenue, Chicago, IL, 60618, USA 4161 North Lincoln Avenue, Chicago, IL, USA, 60618 DeBerge's 2008 63rd Street, Kenosha, WI, 53143, USA 2008 63rd Street, Kenosha, WI, USA, 53143 Hoypoloi Gallery 2140 Monroe Street, Chicago, IL, 60612, USA 2140 Monroe Street, Chicago, IL, USA, 60612 Mattie M 990 Green Bay Road, Winnetka, IL, 60093, USA 990 Green Bay Road, Winnetka, IL, USA, 60093 1882 Sheridan Road, Highland Park, IL, 60035, USA 1882 Sheridan Road, Highland Park, IL, USA, 60035 Citywoods 651 Central Avenue, Highland Park, IL, 60035, USA 651 Central Avenue, Highland Park, IL, USA, 60035 The Villager Gift Shop 2007 Ridge road, Homewood, IL, 60430, USA 2007 Ridge road, Homewood, IL, USA, 60430 7532 West State Street, Wauwatosa, WI, 53213, USA 7532 West State Street, Wauwatosa, WI, USA, 53213 Team Blonde 7442 West Madison Street, Forest Park, IL, 60130, USA 7442 West Madison Street, Forest Park, IL, USA, 60130 Robin's Nest 16389 Main Street, N89, Menomonee Falls, WI, 53051, USA 16389 Main Street, N89, Menomonee Falls, WI, USA, 53051 3626 Walton Way Ext. Suite 500, Augusta, GA, 30909, USA 3626 Walton Way Ext. Suite 500, Augusta, GA, USA, 30909 Chicago O'Hare International, Terminal 2, Concourse E, Gate E-3, Chicago, IL, 60666, USA Chicago O'Hare International, Terminal 2, Concourse E, Gate E-3, Chicago, IL, USA, 60666 Hinsdale Adventist Hospital Gift Shop 120 North Oak Street, Hinsdale, IL, 60521, USA 120 North Oak Street, Hinsdale, IL, USA, 60521 Old Sautee Store 2315 Highway 17, Sautee Nacoochee, GA, 30571, USA 2315 Highway 17, Sautee Nacoochee, GA, USA, 30571 Gia Haute & Home 45 South Washington Street, Hinsdale, IL, 60521, USA 45 South Washington Street, Hinsdale, IL, USA, 60521 Alexian Brothers Medical Center Gift Shop 800 Biesterfield Road, Elk Grove Village, IL, 60007, USA 800 Biesterfield Road, Elk Grove Village, IL, USA, 60007 Grace & Glory Uptown 1029 Boundary Street, Suite A, Beaufort, SC, 29902, USA 1029 Boundary Street, Suite A, Beaufort, SC, USA, 29902 St. Alexius Medical Center Shop 1555 Barrington Road, Main entrance, Hoffman Estates, IL, 60169, USA 1555 Barrington Road, Main entrance, Hoffman Estates, IL, USA, 60169 Willow Gift & Home 3500 Hulman Street, Terre Haute, IN, 47803, USA 3500 Hulman Street, Terre Haute, IN, USA, 47803 1600 Main Street, Hilton Head Island, SC, 29926, USA 1600 Main Street, Hilton Head Island, SC, USA, 29926 Evernia 219 West State Street, Geneva, IL, 60134, USA 219 West State Street, Geneva, IL, USA, 60134 Naked South Boutique 9924 Davis St #4, Braselton, GA, 30517, USA 9924 Davis St #4, Braselton, GA, USA, 30517 13 Secrets 426 East Oglethorpe Avenue, Savannah, GA, 31401, USA 426 East Oglethorpe Avenue, Savannah, GA, USA, 31401 Aurum Jewelry and Art 1051 Parkside Commons , Suite 101, Greensboro, GA, 30642, USA 1051 Parkside Commons , Suite 101, Greensboro, GA, USA, 30642 Wild Flower Boutique 2809 Lincoln Avenue, Suite 124, Evansville, IN, 47714, USA 2809 Lincoln Avenue, Suite 124, Evansville, IN, USA, 47714 Potpourri of Sandy Springs 227 Sandy Springs Place Northeast, Suite 374, CityWalk Sandy Springs, Atlanta, GA, 30328, USA 227 Sandy Springs Place Northeast, Suite 374, CityWalk Sandy Springs, Atlanta, GA, USA, 30328 Squash Blossom Boutique 113 E Court Square, Decatur, GA, 30032, USA 113 E Court Square, Decatur, GA, USA, 30032 22 E Church St, Cartersville, GA, 30120, USA 22 E Church St, Cartersville, GA, USA, 30120 Pearl Luvs Earl 2308 North 3rd Street, Wausau, WI, 54403, USA 2308 North 3rd Street, Wausau, WI, USA, 54403 1017 Park Street, Jacksonville, FL, 32204, USA 1017 Park Street, Jacksonville, FL, USA, 32204 Jule Collins Smith Museum Of Fine Art Shop 901 South College Street, Auburn, AL, 36849-0001, USA 901 South College Street, Auburn, AL, USA, 36849-0001 Beverly Ruff Antiques and Linens 2417 Canterbury Road, Beverly Ruff Antiques and Linens, Mountain Brook, AL, 35223, USA 2417 Canterbury Road, Beverly Ruff Antiques and Linens, Mountain Brook, AL, USA, 35223 2000 Reverend Abraham Woods Jr Blvd., Birmingham, AL, 35203, USA 2000 Reverend Abraham Woods Jr Blvd., Birmingham, AL, USA, 35203 6 North Main Street, Rice Lake, WI, 54868, USA 6 North Main Street, Rice Lake, WI, USA, 54868 The Queen Bees 2732 North Highland Avenue, Jackson , TN, 38305, USA 2732 North Highland Avenue, Jackson , TN, USA, 38305 Northcutts On Main 1774 West Main Street, Dothan, AL, 36301, USA 1774 West Main Street, Dothan, AL, USA, 36301 Modernism Museum Shoppe 144 East 4th Avenue, Mount Dora, FL, 32757, USA 144 East 4th Avenue, Mount Dora, FL, USA, 32757 Coco's Gallery and Boutique 402 Brevard Avenue, Cocoa, FL, 32922, USA 402 Brevard Avenue, Cocoa, FL, USA, 32922 Charles Hosmer Morse Museum of American Art Shop 445 North Park Avenue, Winter Park, FL, 32789, USA 445 North Park Avenue, Winter Park, FL, USA, 32789 Peacocks and Pearls 404 North Gloster, Tupelo, MS, 38804, USA 404 North Gloster, Tupelo, MS, USA, 38804 Luya shoes and other fine things 236 S Main St, Zumbrota, MN, 55992, USA 236 S Main St, Zumbrota, MN, USA, 55992 524 2nd St, Hudson, WI, 54016, USA 524 2nd St, Hudson, WI, USA, 54016 6150 Poplar Avenue, Suite 116, Regalia Shopping Center, Memphis, TN, 38119, USA 6150 Poplar Avenue, Suite 116, Regalia Shopping Center, Memphis, TN, USA, 38119 Paper Patisserie 366 Selby Avenue, Saint Paul, MN, 55102, USA 366 Selby Avenue, Saint Paul, MN, USA, 55102 957 Grand Avenue, Saint Paul, MN, 55105, USA 957 Grand Avenue, Saint Paul, MN, USA, 55105 Fawbush's 3420 Galleria, Edina, MN, 55435, USA 3420 Galleria, Edina, MN, USA, 55435 Suzette's on the Rocks 400 Indian Rocks Road North, Belleair Bluffs, FL, 33770, USA 400 Indian Rocks Road North, Belleair Bluffs, FL, USA, 33770 2725 Ingersoll Avenue, Des Moines, IA, 50312, USA 2725 Ingersoll Avenue, Des Moines, IA, USA, 50312 Sunbug 141 West Venice Avenue, Venice, FL, 34285, USA 141 West Venice Avenue, Venice, FL, USA, 34285 The Art of Fashion and Moore 2267 First Street, Suite 12, Fort Myers, FL, 33901, USA 2267 First Street, Suite 12, Fort Myers, FL, USA, 33901 Nichole's Collection at Town & Lake 25148 East Main Street, Nisswa, MN, 56468, USA 25148 East Main Street, Nisswa, MN, USA, 56468 Cybele's 382 Fairhope Avenue, Fairhope, AL, 36532, USA 382 Fairhope Avenue, Fairhope, AL, USA, 36532 M & F Casuals 17070 Scenic Highway, Suite 98, Point Clear , AL, 36564, USA 17070 Scenic Highway, Suite 98, Point Clear , AL, USA, 36564 EPS - Dorothy Maynard D 6257 8260 NW 14th St., Miami, FL, 33191, USA 8260 NW 14th St., Miami, FL, USA, 33191 Jami's 26811 South Bay Drive , Suite 136, The Promenade at Bonita Bay, Bonita Springs, FL, 34134, USA 26811 South Bay Drive , Suite 136, The Promenade at Bonita Bay, Bonita Springs, FL, USA, 34134 Johnny Ruth 181 Water Street, St. John's, NL, A1C 1B1, Canada 181 Water Street, St. John's, NL, Canada, A1C 1B1 Scarlet Pearl Casino 9380 Central Avenue, D'Iberville, MS, 39540, USA 9380 Central Avenue, D'Iberville, MS, USA, 39540 Kemper Museum of Contemporary Art 4420 Warwick Blvd, Kansas City, MO, 64111, USA 4420 Warwick Blvd, Kansas City, MO, USA, 64111 Blue Monarch 120 West Main Street, Suite 102, Vermillion, SD, 57069, USA 120 West Main Street, Suite 102, Vermillion, SD, USA, 57069 749 Saint Mary's Road, Winnipeg, MB, R2M 3N6, Canada 749 Saint Mary's Road, Winnipeg, MB, Canada, R2M 3N6 Tara Davis Studio Boutique 246 McDermot Avenue, Winnipeg, MB, R3B 0S5, Canada 246 McDermot Avenue, Winnipeg, MB, Canada, R3B 0S5 House of Broussard 100 West Main Street, Broussard, LA, 70518, USA 100 West Main Street, Broussard, LA, USA, 70518 Shelmerdine Garden Center 7800 Roblin Blvd, Headingley, MB, R4H 1B6, Canada 7800 Roblin Blvd, Headingley, MB, Canada, R4H 1B6 The Modern Art Museum of Fort Worth Shop 3200 Darnell Street, Fort Worth, TX, 76107, USA 3200 Darnell Street, Fort Worth, TX, USA, 76107 Feather your Nest 3500 Jefferson Street, Suite 120, Austin, TX, 78731, USA 3500 Jefferson Street, Suite 120, Austin, TX, USA, 78731 Blanton Museum Shop 200 East Martin Luther King Junior Blvd, The University of Texas at Austin, Austin, TX, 78701, USA 200 East Martin Luther King Junior Blvd, The University of Texas at Austin, Austin, TX, USA, 78701 Meyer's Department Store 200 Main Street North, Watford City, ND, 58854, USA 200 Main Street North, Watford City, ND, USA, 58854 Studio S Fashion House 3221 Quance Street East, Regina, SK, S4V 3B7, Canada 3221 Quance Street East, Regina, SK, Canada, S4V 3B7 Four and Twenty Blackbirds 505 Main Street, Windsor, CO, 80550, USA 505 Main Street, Windsor, CO, USA, 80550 100 West 14th Avenue Parkway, Denver, CO, 80204, USA 100 West 14th Avenue Parkway, Denver, CO, USA, 80204 Jillian's Design Elements 621 Main Street North, Moose Jaw, SK, S6H 0W6, Canada 621 Main Street North, Moose Jaw, SK, Canada, S6H 0W6 Mixx Projects Atelier 307 E Colorado Ave P.O. Box 3567, Telluride, CO, 81435, USA 307 E Colorado Ave P.O. Box 3567, Telluride, CO, USA, 81435 7039 North Oracle Road, Contact: Moriah, Tucson, AZ, 85704, USA 7039 North Oracle Road, Contact: Moriah, Tucson, AZ, USA, 85704 5001 50th Street, Camrose, AB, T4V 1R3, Canada 5001 50th Street, Camrose, AB, Canada, T4V 1R3 8787 North Scottsdale Road , Suite 222, The Shops at Gainey Village (Contact: Sue), Scottsdale, AZ, 85253, USA 8787 North Scottsdale Road , Suite 222, The Shops at Gainey Village (Contact: Sue), Scottsdale, AZ, USA, 85253 6560 North Scottdale Road, Suite 115, Scottsdale, AZ, 85253, USA 6560 North Scottdale Road, Suite 115, Scottsdale, AZ, USA, 85253 Arizona Biltmore Resort 2400 East Missouri Avenue, Phoenix, AZ, 85016, USA 2400 East Missouri Avenue, Phoenix, AZ, USA, 85016 Virtu Boutique 5004 50th Street, Beaumont, AB, T4X 1E6, Canada 5004 50th Street, Beaumont, AB, Canada, T4X 1E6 2 Sir Winston Churchill Square, Edmonton, AB, T5J 2C1, Canada 2 Sir Winston Churchill Square, Edmonton, AB, Canada, T5J 2C1 Blu's Womens Wear 4719 101 Street NW, BDC, Edmonton, AB, T6E 5C6, Canada 4719 101 Street NW, BDC, Edmonton, AB, Canada, T6E 5C6 C'est Sera 8239 104th Street Northwest, Edmonton, AB, T6E 4E7, Canada 8239 104th Street Northwest, Edmonton, AB, Canada, T6E 4E7 Harlow Crestwood 9676 142 Street, Crestwood Centre, Edmonton, AB, T5N 4B2, Canada Crestwood Centre, Edmonton, AB, Canada, T5N 4B2 Side Street Fashion & Accessories 3310 50 Avenue, Cambridge Red Deer Hotel & convention center, Red Deer, AB, T4N 3X9, Canada Cambridge Red Deer Hotel & convention center, Red Deer, AB, Canada, T4N 3X9 Blue Moon Accessories 10816 Macleod Trail Southeast, Suite 210, Willow Park Village, Calgary, AB, T2J 5N8, Canada 10816 Macleod Trail Southeast, Suite 210, Willow Park Village, Calgary, AB, Canada, T2J 5N8 BraTopia West Inc. 206 1409 Edmonton Tr. NE, Calgary, AB, T2E 3K8, Canada 206 1409 Edmonton Tr. NE, Calgary, AB, Canada, T2E 3K8 Glenbow Museum Shop 130 9th Avenue Southeast, Ground Floor, Calgary, AB, T2G 0P3, Canada 130 9th Avenue Southeast, Ground Floor, Calgary, AB, Canada, T2G 0P3 313 19th Street Northwest, Calgary, AB, T2N 2J2, Canada 313 19th Street Northwest, Calgary, AB, Canada, T2N 2J2 Something2Wear 326 Aspen Glen Landing Southeast, Unit 118, Calgary, AB, T3H 0N5, Canada 326 Aspen Glen Landing Southeast, Unit 118, Calgary, AB, Canada, T3H 0N5 The Best Little Wordhouse In The West 7 Balsam Avenue, Suite 208, Calgary, AB, T0L 0K0, Canada 7 Balsam Avenue, Suite 208, Calgary, AB, Canada, T0L 0K0 Boutique Nine 5005 Dalhousie Drive Northwest , Suite 135, Dalhousie Station Shopping Centre, Calgary, AB, T3A 5R8, Canada 5005 Dalhousie Drive Northwest , Suite 135, Dalhousie Station Shopping Centre, Calgary, AB, Canada, T3A 5R8 210 8560 8A Ave. SW, Calgary, AB, T3H 1T1, Canada 210 8560 8A Ave. SW, Calgary, AB, Canada, T3H 1T1 Eclectica Fashion 5012 50th Street, Sylvan Lake, AB, T4S 1M5, Canada 5012 50th Street, Sylvan Lake, AB, Canada, T4S 1M5 Toccata for Her 721 Main Street, Suite 108, Canmore, AB, T1W 2B2, Canada Suite 108, Canmore, AB, Canada, T1W 2B2 Whyte Museum Of The Canadian Rockies Shop 111 Bear Street, Banff, AB, T1L 1A3, Canada 111 Bear Street, Banff, AB, Canada, T1L 1A3 La Quinta Resort Resort & Club 499 Eisenhower Drive, Unit 49, La Quinta, CA, 92253, USA 499 Eisenhower Drive, Unit 49, La Quinta, CA, USA, 92253 1500 Orange Avenue, att. Accounts Payable, Coronado, CA, 92118, USA 1500 Orange Avenue, att. Accounts Payable, Coronado, CA, USA, 92118 Marla June's Clothing Company 5215 W Clearwater Ave #101, Kennewick, WA, 99336, USA 5215 W Clearwater Ave #101, Kennewick, WA, USA, 99336 Lady Chadderton's 8318 Main St. , Box 984, Osoyoos, BC, V0H 1V0, Canada 8318 Main St. , Box 984, Osoyoos, BC, Canada, V0H 1V0 KoLu 1950 Harvey Avenue, Suite 115, Spall Plaza, Kelowna, BC, V1Y 8G6, Canada 1950 Harvey Avenue, Suite 115, Spall Plaza, Kelowna, BC, Canada, V1Y 8G6 447 Bernard Avenue, Kelowna, BC, V1Y 6N8, Canada 447 Bernard Avenue, Kelowna, BC, Canada, V1Y 6N8 Autry Museum of American West 4700 Western Heritage Way, Los Angeles, CA, 90027, USA 4700 Western Heritage Way, Los Angeles, CA, USA, 90027 Craft & Folk Art Museum Shop 5814 Wilshire Blvd, Los Angeles, CA, 90036, USA 5814 Wilshire Blvd, Los Angeles, CA, USA, 90036 Sass Boutique 10118 Main Street, Summerland, BC, V0H 1Z0, Canada 10118 Main Street, Summerland, BC, Canada, V0H 1Z0 1130 State street, Santa Barbara, CA, 93101, USA 1130 State street, Santa Barbara, CA, USA, 93101 Birkenstock Midtown 2612 J Street, Sacramento, CA, 95816, USA 2612 J Street, Sacramento, CA, USA, 95816 320 Broadway St., Chico, CA, 95928, USA 320 Broadway St., Chico, CA, USA, 95928 Museo Gallery 215 First Street, Langley, WA, 98260, USA 215 First Street, Langley, WA, USA, 98260 212 Homer Avenue, Contact: Diane, Palo Alto, CA, 94301, USA 212 Homer Avenue, Contact: Diane, Palo Alto, CA, USA, 94301 Marita's Boutique 551 Lighthouse Avenue, Pacific Grove, CA, 93950, USA 551 Lighthouse Avenue, Pacific Grove, CA, USA, 93950 Jolie By The Sea South Ocean between MonteVerde & Lincoln, South Ocean, Carmel, CA, 93921, USA South Ocean between MonteVerde & Lincoln, South Ocean, Carmel, CA, USA, 93921 2108 Vine Street, Berkeley, CA, 94709, USA 2108 Vine Street, Berkeley, CA, USA, 94709 2111 Vine Street, Contact: Sherry, Berkeley, CA, 94709, USA 2111 Vine Street, Contact: Sherry, Berkeley, CA, USA, 94709 1799 Fourth Street, (store) Contact: Kay, Berkeley, CA, 94710, USA 1799 Fourth Street, (store) Contact: Kay, Berkeley, CA, USA, 94710 Edge Fashion 15223 Pacific Avenue, Unit 7A, White Rock, BC, V4B 1P8, Canada 15223 Pacific Avenue, Unit 7A, White Rock, BC, Canada, V4B 1P8 J. James Sonoma 122 East Napa Street, Sonoma, CA, 95476, USA 122 East Napa Street, Sonoma, CA, USA, 95476 Bison Country Life 1341 Main Street, St. Helena, CA, 94574, USA 1341 Main Street, St. Helena, CA, USA, 94574 Mara Shoes and Fashion 824 Grant Avenue, Novato, CA, 94945, USA 824 Grant Avenue, Novato, CA, USA, 94945 3080 Edgemont Blvd, North Vancouver, BC, V7R 2N4, Canada 3080 Edgemont Blvd, North Vancouver, BC, Canada, V7R 2N4 Artina's Jewellery 387 Water Street, Vancouver, BC, V6B 1B8, Canada 387 Water Street, Vancouver, BC, Canada, V6B 1B8 Vancouver Art Gallery Store 750 Hornby Street, Vancouver, BC, V6Z 2H7, Canada 750 Hornby Street, Vancouver, BC, Canada, V6Z 2H7 Mia Bella Boutique 1666 Johnston Street, Unit 3, Granville Island, Vancouver, BC, V6H 3S2, Canada 1666 Johnston Street, Unit 3, Granville Island, Vancouver, BC, Canada, V6H 3S2 Eclectic Gallery 2170 Oak Bay Avenue, Victoria, BC, V8R 1E9, Canada 2170 Oak Bay Avenue, Victoria, BC, Canada, V8R 1E9 Runway Fashions 702 Douglas Street, Victoria, BC, V8W 3M6, Canada 702 Douglas Street, Victoria, BC, Canada, V8W 3M6 Something More 5325 Cordova Bay Road, Suite 127, Mattick's Farm Shopping Centre, Victoria, BC, V8Y 2L3, Canada 5325 Cordova Bay Road, Suite 127, Mattick's Farm Shopping Centre, Victoria, BC, Canada, V8Y 2L3 Out of The Blue Boutique 455 Bowen Trunk Road, Suite 22, Bowen Island, BC, V0N 1G0, Canada 455 Bowen Trunk Road, Suite 22, Bowen Island, BC, Canada, V0N 1G0 Frankly Scarlet Jewellery 115 Fulford-Ganges Road, Suite 1104, Grace Point Square, Salt Spring Island, BC, V8K 2T9, Canada 115 Fulford-Ganges Road, Suite 1104, Grace Point Square, Salt Spring Island, BC, Canada, V8K 2T9 Palmeros 5514 Wharf Avenue, Sechelt, BC, V0N 3A0, Canada 5514 Wharf Avenue, Sechelt, BC, Canada, V0N 3A0 180 Commercial Street, Nanaimo, BC, V9R 5G6, Canada 180 Commercial Street, Nanaimo, BC, Canada, V9R 5G6 1336 Bay Street, Florence, OR, 97439-9649, USA 1336 Bay Street, Florence, OR, USA, 97439-9649 Penny Tyme Fashions 442 Duncan Avenue, Suite D, Courtenay, BC, V9N 7J5, Canada 442 Duncan Avenue, Suite D, Courtenay, BC, Canada, V9N 7J5 Mai des Lys 16, rue Dr Verron, Epernay, 51200, France 16, rue Dr Verron, Epernay, France, 51200 7, rue du Général de Gaulle, Héricourt, 70400, France 7, rue du Général de Gaulle, Héricourt, France, 70400 Röser & Zillekens GmbH Kirchenstraße 33, Ladenburg, 68526, Germany Kirchenstraße 33, Ladenburg, Germany, 68526 Julius Staudt Kunstgewerbe Gmbh Fürther Freiheit 2-4, Fürth, Bavaria, D-90762, Germany Fürther Freiheit 2-4, Fürth, Bavaria, Germany, D-90762 Peter Bijoux Sparkassenstraße 21, Merano, BZ, 1-39012, Italia Sparkassenstraße 21, Merano, BZ, Italia, 1-39012 Grand Wailea Resort 3850 Wailea Alanui Drive, Wailea, HI, 96753, USA 3850 Wailea Alanui Drive, Wailea, HI, USA, 96753 Showroom Equip, designer jewelry multi-brand Нижний Сусальный переулок, д.5,, стр.5А, бизнес-квартал АРМА, Москва, 105064, Russia Нижний Сусальный переулок, д.5,, стр.5А, бизнес-квартал АРМА, Москва, Russia, 105064 Vice Jewelry 204 Al Tayer Building , c/o Al Ayali General Trading, Al Riffa, Bur Dubai, Dubai, UAE 204 Al Tayer Building , c/o Al Ayali General Trading, Al Riffa, Bur Dubai, UAE, Dubai 3-8-19 Ebara, Shinagawa-ku, room #307, Tokyo, 142-0063, Japon 3-8-19 Ebara, Shinagawa-ku, room #307, Tokyo, Japon, 142-0063 Professionnal tradeshows Studio, workshops and boutique 5333, Casgrain Ave., studio 502 Montréal (Quebec) Canada, H2T 1X3 International: +00 1 514 844-4305 Get services' emails © Anne-Marie Chagnon inc. 2015 HomepageSitemapTerms and conditions Be among the first to access exciting new arrivals, special offers and events while getting 10% off your next online purchase.

New to the gym? We speak to a personal trainer in Western Sydney, Nabil Touma about the benefits of resistance training and how to implement it into your training routine when you're just starting on your fitness journey. Resistance training is also commonly referred to as strength training or weight training. It's a type of physical exercise which uses resistance through weight to build strength, anaerobic endurance, and increase muscle mass. It can be done using weights, or even your own body weight. Nabil, Planet Fitness Personal Trainer in Western Sydney, says there are many benefits to resistance training. "Resistance training can help you increase muscle mass and muscle fibres, regulate the sugar level by helping insulin sensitivity, increase your bone strength, build self esteem, create more lean body mass, improve flexibility and balance, protect you from injuries, and much more," Nabil says. In addition, the more muscle mass you have, the higher your basal metabolic rate (BMR) is too, which means you are burning more calories even at rest. Strength training is beneficial for women as well as men, and Nabil says it is essential to include it in your exercise program – regardless of your age or ability. There are many misconceptions around resistance and weight training, and Nabil, personal trainer in Western Sydney says he hears a lot of first time gym goers, and even those who have been working out for years mention the same concerns. "Some people think resistance training will make them gain fat, which is not true," Nabil says. Women in particular worry that weight lifting will make them 'bulky'. But, unless you are doing very heavy weights and following a calorie-dense diet, it is very unlikely. Muscle and fat are completely different structures, so it's not possible for one to turn into the other. When it comes to injury, while it is essential that weights are used properly, and it's best to speak to your personal trainer in any of our locations if you're not sure, building muscle will help to prevent injury to joints – which is especially important as we age. What Exercises Should I Start With? If it is your first time attempting resistance training, our personal trainer suggests some simple exercises using body weight to start: push ups, squats, and walking and reverse walking lunges. These simple exercises are easy, as well as highly effective, targeting all areas of the body. If you're in the gym and still unsure, any one of our personal trainers in Western Sydney, Newcastle and the Central Coast can show you these basic moves. How Frequently Should I Be Doing Resistance Training? Our Personal Trainer in Western Sydney, Nabil, says three times a week is ideal. Want to Speak to a Personal Trainer and Get Started with Resistance Training? We have personal trainers at all of our locations, including gyms in Western Sydney, Central Coast, and three gyms in Newcastle. If you would like to have a program customised for you, or would like to know more about resistance training, or about any other type of training, our personal trainers can help. Get in touch with us, or come and say hello to a personal trainer at your nearest Planet Fitness gym.

The Hello Bitches Tour (stylized as Hello Bi+ches Tour) was the debut concert tour of South Korean singer CL. The tour visited nine cities in 2016 in the United States and Canada, kicking off in New York City's Hammerstein Ballroom on October 29 and concluding in Toronto at the Sound Academy on November 14. The tour was promoted by SIVA Entertainment Group. The setlist consisted of her solo songs along with many of her previous works with K-pop girl group 2NE1. Background and development On September 23, 2016, YG Entertainment announced that CL would hold her first American tour. She will visit nine cities in North America, with a total of nine shows. The tour's name derives from CL's 2015 Korean language single "Hello Bitches". The tour's announcement followed the release of CL's debut American single "Lifted" on August 19, amid news of an upcoming English-language debut EP. The sold-out show at the Hammerstein Ballroom made her the first Korean female singer to play a solo concert at a major venue in New York City. An unreleased music video of "Hello Bitches" was also played during the tour. Controversy On November 7, fans and concertgoers had noticed that CL had been using the "controversial" version of her song "MTBD (Mental Breakdown)" since the tour started. CL apologized on her Twitter account stating that her "engineer [had] sent the old version for [the] tour". CL performed the alternative version for the later shows. Set list "Fire" (Intro) "Can't Nobody" "Scream" "I Am the Best" "Come Back Home" "I Don't Care (Reggae Ver.)" "Gotta Be You" "Falling in Love" "Lonely" "Missing You" "If I Were You" "I Love You" "The Baddest Female" "Doctor Pepper" "Dirty Vibe" "MTBD" "Lifted" "Hello Bitches" Encore "Do You Love Me" "I Am The Best (Remix)" Tour dates References 2016 concert tours

Q: Flask: button to update value in database so I currently pull a value from a database and display it on the screen. I have a HTML button right next to it that is supposed to increase the score on the screen by 1 every time I click it. Currently, when I click the button nothing happens. The number on the screen stays the same. Python file @app.route('/') def layout(): db = get_db() try: cur1 = db.execute('SELECT score FROM {tn} where name="Tyler"'.format(tn="Score")) score1 = cur1.fetchone() if request.method == 'POST': db.execute('UPDATE {tn} SET score=score+1 WHERE name="Tyler"'.format(tn="Score")) db.commit() except: flash("This person doesn't exist in our database!") return render_template('layout.html', score1=score1) HTML file <form action="{{ url_for('layout') }}" method="post"> <p align="center">Tyler</p> <div align="center"> <tr> <td>{{ score1.score }}</td> </tr> &nbsp; &nbsp; <button type="button">+1</button> </div> </form> Any help is appreciated. Thank you. Edit: updated view and HTML. Same issue. A: Your two view functions are mapped to the same route; but a URL can only be served by one view. Either map your increaseScore1 function to a different route, or combine the logic in one function which checks if the method is POST and updates the score if so, otherwise just displays it.

Tribal Sleuth Articles and resources for genealogical research, historical events and life in the past. September 30, 1954: USS Nautilus commissioned September 30, 2016 Uncategorizedsleuthboss Previously posted at: http://www.history.com/this-day-in-history/uss-nautilus-commissioned The USS Nautilus, the world's first nuclear submarine, is commissioned by the U.S. Navy. The Nautilus was constructed under the direction of U.S. Navy Captain Hyman G. Rickover, a brilliant Russian-born engineer who joined the U.S. atomic program in 1946. In 1947, he was put in charge of the navy's nuclear-propulsion program and began work on an atomic submarine. Regarded as a fanatic by his detractors, Rickover succeeded in developing and delivering the world's first nuclear submarine years ahead of schedule. In 1952, the Nautilus' keel was laid by President Harry S. Truman, and on January 21, 1954, first lady Mamie Eisenhower broke a bottle of champagne across its bow as it was launched into the Thames River at Groton, Connecticut. Commissioned on September 30, 1954, it first ran under nuclear power on the morning of January 17, 1955. Much larger than the diesel-electric submarines that preceded it, the Nautilus stretched 319 feet and displaced 3,180 tons. It could remain submerged for almost unlimited periods because its atomic engine needed no air and only a very small quantity of nuclear fuel. The uranium-powered nuclear reactor produced steam that drove propulsion turbines, allowing the Nautilus to travel underwater at speeds in excess of 20 knots. In its early years of service, the USS Nautilus broke numerous submarine travel records and in August 1958 accomplished the first voyage under the geographic North Pole. After a career spanning 25 years and almost 500,000 miles steamed, the Nautilus was decommissioned on March 3, 1980. Designated a National Historic Landmark in 1982, the world's first nuclear submarine went on exhibit in 1986 as the Historic Ship Nautilus at the Submarine Force Museum in Groton, Connecticut. September 29, 2005: Reporter Judith Miller released from prison Previously posted at: http://www.history.com/this-day-in-history/reporter-judith-miller-released-from-prison On this day in 2005, New York Times reporter Judith Miller is released from a federal detention center in Alexandria, Virginia, after agreeing to testify in the investigation into the leaking of the identity of covert CIA officer Valerie Plame. Miller had been behind bars since July 6, 2005, for refusing to reveal a confidential source and testify before a grand jury that was looking into the so-called Plame Affair. She decided to testify after the source she had been protecting, I. Lewis "Scooter" Libby, Vice President Dick Cheney's chief of staff, signed a waiver giving her permission to speak. The Plame Affair dates back to a July 6, 2003 op-ed piece for the New York Times written by former U.S. diplomat Joseph Wilson, Plame's husband. In it, Wilson questioned the Bush Administration's reasons for going to war in Iraq. Later that month, on July 14, undercover agent Valerie Plame's identity was revealed in a newspaper column by Robert Novak. Wilson's claim that the disclosure was retaliation by the White House for his op-ed piece sparked an investigation in December 2003 led by special prosecutor Patrick Fitzgerald. A 1982 law made it illegal to reveal information about a covert agent to anyone not authorized to receive such classified information. Fitzgerald interviewed President George W. Bush, Vice President Cheney and other top administration officials, along with various journalists. Although Miller hadn't written an article about Plame, she did meet with Libby shortly after Wilson's op-ed piece was published and Fitzgerald believed Miller had information that was relevant to his investigation. After 85 days in jail, Miller was released and testified before a grand jury that prior to the Novak column, she had several discussions with Scooter Libby in which he talked about Plame. On November 9 of that same year, Miller announced her retirement from the Times after a 28-year career with the newspaper. On March 6, 2007, Scooter Libby was convicted of obstruction of justice, perjury and making false statements to federal investigators in the Plame investigation. In June, he was sentenced to 30 months in federal prison and fined $250,000. However, one month later, on July 2, President George W. Bush commuted Libby's prison term before the ex-White House aide served any time. September 28, 1941: Ted Williams becomes last player to hit .400 Previously posted at: http://www.history.com/this-day-in-history/ted-williams-becomes-last-player-to-hit-400 On this day in 1941, the Boston Red Sox's Ted Williams plays a double-header against the Philadelphia Athletics on the last day of the regular season and gets six hits in eight trips to the plate, to boost his batting average to .406 and become the first player since Bill Terry in 1930 to hit .400. Williams, who spent his entire career with the Sox, played his final game exactly 19 years later, on September 28, 1960, at Boston's Fenway Park and hit a home run in his last time at bat, for a career total of 521 homeruns. Williams was born on August 30, 1918, in San Diego, and began his major league career with the Red Sox in 1939. 1941 marked Williams' best season. In addition to his .406 batting average–no major league player since him has hit .400–the left fielder led the league with 37 homers, 135 runs and had a slugging average of .735. Also that season, Williams, whose nicknames included "The Splendid Splinter" and "The Thumper," had an on-base percentage of .553, a record that remained unbroken for 61 years, until Barry Bonds achieved a percentage of .582 in 2002. In 1942, Williams won the American League Triple Crown, for highest batting average and most RBIs and homeruns. He duplicated the feat in 1947. In 1946 and 1949, he was named the American League's Most Valuable Player and in June 1960, he became the fourth player in major league history to hit 500 homers. He was selected to the All-Star team 17 times. Williams played his last game on September 28, 1960, and retired with a lifetime batting average of .344, a .483 career on-base percentage and 2,654 hits. His achievements are all the more impressive because his career was interrupted twice for military service: Williams was a Marine Corps pilot during World War II and the Korean War and as a result missed a total of nearly five seasons from baseball. Williams, who was inducted into the Baseball Hall of Fame in 1966, managed the Washington Senators (renamed the Texas Rangers in 1972) from 1969 to 1972. In 1984, the Boston Red Sox retired his uniform number (nine). Williams died of cardiac arrest at age 83 on July 5, 2002, in Florida. In a controversial move, his son sent his father's body to be frozen at a cryonics laboratory. AF-093: How Much of the Original White House is Actually Left? Previously posted at: http://youtu.be/a72H5gfxUns September 27, 1779: John Adams appointed to negotiate peace terms with British Previously posted at: http://www.history.com/this-day-in-history/john-adams-appointed-to-negotiate-peace-terms-with-british On this day in 1779, the Continental Congress appoints John Adams to travel to France as minister plenipotentiary in charge of negotiating treaties of peace and commerce with Great Britain during the Revolutionary War. Adams had traveled to Paris in 1778 to negotiate an alliance with France, but had been unceremoniously dismissed when Congress chose Benjamin Franklin as sole commissioner. Soon after returning to Massachusetts in mid-1779, Adams was elected as a delegate to the state convention to draw up a new constitution; he was involved in these duties when he learned of his new diplomatic commission. Accompanied by his young sons John Quincy and Charles, Adams sailed for Europe that November aboard the French ship Sensible, which sprang a leak early in the voyage and missed its original destination (Brest), instead landing at El Ferrol, in northwestern Spain. After an arduous journey by mule train across the Pyrenees and into France, Adams and his group reached Paris in early February 1780. While in Paris, Adams wrote to Congress almost daily (sometimes several letters a day) sharing news about British politics, British and French naval activities and his general perspective on European affairs. Conditions were unfavorable for peace at the time, as the war was going badly for the Continental Army, and the blunt and sometimes confrontational Adams clashed with the French government, especially the powerful Foreign Minister Charles Gravier, Comte de Vergennes. In mid-June, Adams began a correspondence with Vergennes in which he pushed for French naval assistance, antagonizing both Vergennes and Franklin, who brought the matter to the attention of Congress. By that time, Adams had departed France for Holland, where he was attempting to negotiate a loan from the Dutch. Before the end of the year, he was named American minister to the Netherlands, replacing Henry Laurens, who was captured at sea by the British. In June 1781, capitulating to pressure from Vergennes and other French diplomats, Congress acted to revoke Adams' sole powers as peacemaker with Britain, appointing Franklin, Thomas Jefferson, John Jay and Laurens to negotiate alongside him. The tide of the war was turning in America's favor, and Adams returned to Paris in October 1782 to take up his part in the peace negotiations. As Jefferson didn't travel to Europe and Laurens was in failing health after his release from the Tower of London, it was left to Adams, Jay and Franklin to represent American interests. Adams and Jay both distrusted the French government (in contrast with Franklin), but their differences of opinion and diplomatic styles allowed the team to negotiate favorable terms in the Peace of Paris (1783). The following year, Jefferson arrived to take Adams' place as American minister to France, forming a lifelong bond with Adams and his family before the latter left to take up his new post as American ambassador to London and continue his distinguished record of foreign service on behalf of the new nation. September 26, 1960: First Kennedy-Nixon debate Previously posted at: http://www.history.com/this-day-in-history/first-kennedy-nixon-debate For the first time in U.S. history, a debate between major party presidential candidates is shown on television. The presidential hopefuls, John F. Kennedy, a Democratic senator of Massachusetts, and Richard M. Nixon, the vice president of the United States, met in a Chicago studio to discuss U.S. domestic matters. Kennedy emerged the apparent winner from this first of four televised debates, partly owing to his greater ease before the camera than Nixon, who, unlike Kennedy, seemed nervous and declined to wear makeup. Nixon fared better in the second and third debates, and on October 21 the candidates met to discuss foreign affairs in their fourth and final debate. Less than three weeks later, on November 8, Kennedy won 49.7 percent of the popular vote in one of the closest presidential elections in U.S. history, surpassing by a fraction the 49.6 percent received by his Republican opponent. One year after leaving the vice presidency, Nixon returned to politics, winning the Republican nomination for governor of California. Although he lost the election, Nixon returned to the national stage in 1968 in a successful bid for the presidency. Like Lyndon Johnson in 1964, Nixon declined to debate his opponent in the 1968 presidential campaign. Televised presidential debates returned in 1976, and have been held in every presidential campaign since. September 25, 1957: Central High School integrated Previously posted at: http://www.history.com/this-day-in-history/central-high-school-integrated Under escort from the U.S. Army's 101st Airborne Division, nine black students enter all-white Central High School in Little Rock, Arkansas. Three weeks earlier, Arkansas Governor Orval Faubus had surrounded the school with National Guard troops to prevent its federal court-ordered racial integration. After a tense standoff, President Dwight D. Eisenhower federalized the Arkansas National Guard and sent 1,000 army paratroopers to Little Rock to enforce the court order. On May 17, 1954, the U.S. Supreme Court ruled unanimously in Brown v. Board of Education of Topeka that racial segregation in educational facilities was unconstitutional. Five days later, the Little Rock School Board issued a statement saying it would comply with the decision when the Supreme Court outlined the method and time frame in which desegregation should be implemented. Arkansas was at the time among the more progressive Southern states in regard to racial issues. The University of Arkansas School of Law was integrated in 1949, and the Little Rock Public Library in 1951. Even before the Supreme Court ordered integration to proceed "with all deliberate speed," the Little Rock School Board in 1955 unanimously adopted a plan of integration to begin in 1957 at the high school level. The National Association for the Advancement of Colored People (NAACP) filed suit, arguing the plan was too gradual, but a federal judge dismissed the suit, saying that the school board was acting in "utmost good faith." Meanwhile, Little Rock's public buses were desegregated. By 1957, seven out of Arkansas' eight state universities were integrated. In the spring of 1957, there were 517 black students who lived in the Central High School district. Eighty expressed an interest in attending Central in the fall, and they were interviewed by the Little Rock School Board, which narrowed down the number of candidates to 17. Eight of those students later decided to remain at all-black Horace Mann High School, leaving the "Little Rock Nine" to forge their way into Little Rock's premier high school. In August 1957, the newly formed Mother's League of Central High School won a temporary injunction from the county chancellor to block integration of the school, charging that it "could lead to violence." Federal District Judge Ronald Davies nullified the injunction on August 30. On September 2, Governor Orval Faubus—a staunch segregationist—called out the Arkansas National Guard to surround Central High School and prevent integration, ostensibly to prevent the bloodshed he claimed desegregation would cause. The next day, Judge Davies ordered integrated classes to begin on September 4. That morning, 100 armed National Guard troops encircled Central High School. A mob of 400 white civilians gathered and turned ugly when the black students began to arrive, shouting racial epithets and threatening the teenagers with violence. The National Guard troops refused to let the black students pass and used their clubs to control the crowd. One of the nine, 15-year-old Elizabeth Eckford, was surrounded by the mob, which threatened to lynch her. She was finally led to safety by a sympathetic white woman. Little Rock Mayor Woodrow Mann condemned Faubus' decision to call out the National Guard, but the governor defended his action, reiterating that he did so to prevent violence. The governor also stated that integration would occur in Little Rock when and if a majority of people chose to support it. Faubus' defiance of Judge Davies' court order was the first major test of Brown v. Board of Education and the biggest challenge of the federal government's authority over the states since the Reconstruction Era. The standoff continued, and on September 20 Judge Davies ruled that Faubus had used the troops to prevent integration, not to preserve law and order as he claimed. Faubus had no choice but to withdraw the National Guard troops. Authority over the explosive situation was put in the hands of the Little Rock Police Department. On September 23, as a mob of 1,000 whites milled around outside Central High School, the nine black students managed to gain access to a side door. However, the mob became unruly when it learned the black students were inside, and the police evacuated them out of fear for their safety. That evening, President Eisenhower issued a special proclamation calling for opponents of the federal court order to "cease and desist." On September 24, Little Rock's mayor sent a telegram to the president asking him to send troops to maintain order and complete the integration process. Eisenhower immediately federalized the Arkansas National Guard and approved the deployment of U.S. troops to Little Rock. That evening, from the White House, the president delivered a nationally televised address in which he explained that he had taken the action to defend the rule of law and prevent "mob rule" and "anarchy." On September 25, the Little Rock Nine entered the school under heavily armed guard. Troops remained at Central High School throughout the school year, but still the black students were subjected to verbal and physical assaults from a faction of white students. Melba Patillo, one of the nine, had acid thrown in her eyes, and Elizabeth Eckford was pushed down a flight of stairs. The three male students in the group were subjected to more conventional beatings. Minnijean Brown was suspended after dumping a bowl of chili over the head of a taunting white student. She was later suspended for the rest of the year after continuing to fight back. The other eight students consistently turned the other cheek. On May 27, 1958, Ernest Green, the only senior in the group, became the first black to graduate from Central High School. Governor Faubus continued to fight the school board's integration plan, and in September 1958 he ordered Little Rock's three high schools closed rather than permit integration. Many Little Rock students lost a year of education as the legal fight over desegregation continued. In 1959, a federal court struck down Faubus' school-closing law, and in August 1959 Little Rock's white high schools opened a month early with black students in attendance. All grades in Little Rock public schools were finally integrated in 1972. September 24, 1789: The First Supreme Court Previously posted at: http://www.history.com/this-day-in-history/the-first-supreme-court The Judiciary Act of 1789 is passed by Congress and signed by President George Washington, establishing the Supreme Court of the United States as a tribunal made up of six justices who were to serve on the court until death or retirement. That day, President Washington nominated John Jay to preside as chief justice, and John Rutledge, William Cushing, John Blair, Robert Harrison, and James Wilson to be associate justices. On September 26, all six appointments were confirmed by the U.S. Senate. The U.S. Supreme Court was established by Article 3 of the U.S. Constitution. The Constitution granted the Supreme Court ultimate jurisdiction over all laws, especially those in which their constitutionality was at issue. The high court was also designated to oversee cases concerning treaties of the United States, foreign diplomats, admiralty practice, and maritime jurisdiction. On February 1, 1790, the first session of the U.S. Supreme Court was held in New York City's Royal Exchange Building. The U.S. Supreme Court grew into the most important judicial body in the world in terms of its central place in the American political order. According to the Constitution, the size of the court is set by Congress, and the number of justices varied during the 19th century before stabilizing in 1869 at nine. In times of constitutional crisis, the nation's highest court has always played a definitive role in resolving, for better or worse, the great issues of the time. September 23, 1875: Billy the Kid arrested for first time Previously posted at: http://www.history.com/this-day-in-history/billy-the-kid-arrested-for-first-time On this day in 1875, Billy the Kid is arrested for the first time after stealing a basket of laundry. He later broke out of jail and roamed the American West, eventually earning a reputation as an outlaw and murderer and a rap sheet that allegedly included 21 murders. The exact details of Billy the Kid's birth are unknown, other than his name, William Henry McCarty. He was probably born sometime between 1859 and 1861, in Indiana or New York. As a child, he had no relationship with his father and moved around with his family, living in Indiana, Kansas, Colorado and Silver City, New Mexico. His mother died in 1874 and Billy the Kid—who went by a variety of names throughout his life, including Kid Antrim and William Bonney—turned to crime soon afterward. McCarty did a stint as a horse thief in Arizona before returning to New Mexico, where he hooked up with a gang of gunslingers and cattle rustlers involved in the notorious Lincoln County War between rival rancher and merchant factions in Lincoln County in 1878. Afterward, Billy the Kid, who had a slender build, prominent crooked front teeth and a love of singing, went on the lam and continued his outlaw's life, stealing cattle and horses, gambling and killing people. His crimes earned him a bounty on his head and he was eventually captured and indicted for killing a sheriff during the Lincoln County War. Billy the Kid was sentenced to hang for his crime; however, a short time later, he managed another jail break, murdering two deputies in the process. Billy the Kid's freedom was brief, as Sheriff Pat Garrett caught up with the desperado at Fort Sumner, New Mexico, on July 14, 1881, and fatally shot him. Although his life was short, Billy the Kid's legend grew following his death. Today he is a famous symbol of the Old West, along with such men as Kit Carson, Jesse James, Wild Bill Hickok, Doc Holliday and Wyatt Earp, and his story has been mythologized and romanticized in numerous films, books, TV shows and songs. Each year, tourists visit the town of Fort Sumner, located about 160 miles southeast of Albuquerque, to see the Billy the Kid Museum and gravesite. September 22, 1862: Lincoln issues Emancipation Proclamation Previously posted at: http://www.history.com/this-day-in-history/lincoln-issues-emancipation-proclamation On this day in 1862, President Abraham Lincoln issues a preliminary Emancipation Proclamation, which sets a date for the freedom of more than 3 million black slaves in the United States and recasts the Civil War as a fight against slavery. When the Civil War broke out in 1861, shortly after Lincoln's inauguration as America's 16th president, he maintained that the war was about restoring the Union and not about slavery. He avoided issuing an anti-slavery proclamation immediately, despite the urgings of abolitionists and radical Republicans, as well as his personal belief that slavery was morally repugnant. Instead, Lincoln chose to move cautiously until he could gain wide support from the public for such a measure. In July 1862, Lincoln informed his cabinet that he would issue an emancipation proclamation but that it would exempt the so-called border states, which had slaveholders but remained loyal to the Union. His cabinet persuaded him not to make the announcement until after a Union victory. Lincoln's opportunity came following the Union win at the Battle of Antietam in September 1862. On September 22, the president announced that slaves in areas still in rebellion within 100 days would be free. On January 1, 1863, Lincoln issued the final Emancipation Proclamation, which declared "that all persons held as slaves" within the rebel states "are, and henceforward shall be free." The proclamation also called for the recruitment and establishment of black military units among the Union forces. An estimated 180,000 African Americans went on to serve in the army, while another 18,000 served in the navy. After the Emancipation Proclamation, backing the Confederacy was seen as favoring slavery. It became impossible for anti-slavery nations such as Great Britain and France, who had been friendly to the Confederacy, to get involved on behalf of the South. The proclamation also unified and strengthened Lincoln's party, the Republicans, helping them stay in power for the next two decades. The proclamation was a presidential order and not a law passed by Congress, so Lincoln then pushed for an antislavery amendment to the U.S. Constitution to ensure its permanence. With the passage of the 13th Amendment in 1865, slavery was eliminated throughout America (although blacks would face another century of struggle before they truly began to gain equal rights). Lincoln's handwritten draft of the final Emancipation Proclamation was destroyed in the Chicago Fire of 1871. Today, the original official version of the document is housed in the National Archives in Washington, D.C. The Empire State Building: A History | AF-312 John McEnroe disqualified from the Australian Open Battle of Khe Sanh begins President Carter pardons draft dodgers Toyota officially passes GM as planet's biggest car maker

package p01_Geometry.Abstract; import p01_Geometry.Interfaces.AreaMeasurable; import p01_Geometry.Interfaces.PerimeterMeasurable; import p01_Geometry.Vertices.Vertex2D; public abstract class PlaneShape extends Shape implements AreaMeasurable, PerimeterMeasurable { public PlaneShape(Vertex2D[] vertices) { this.coordinates = vertices; } @Override public String toString() { return String.format( "Shape Type: %s\r\n\t" + "Area: %.2f\r\n\t" + "Perimeter: %.2f\r\n", this.getClassName(), this.getArea(), this.getPerimeter()); } }

webpackJsonp([1],{ /***/ 2: /***/ (function(module, exports) { var g; // This works in non-strict mode g = (function() { return this; })(); try { // This works if eval is allowed (see CSP) g = g || Function("return this")() || (1,eval)("this"); } catch(e) { // This works if the window reference is available if(typeof window === "object") g = window; } // g can still be undefined, but nothing to do about it... // We return undefined, instead of nothing here, so it's // easier to handle this case. if(!global) { ...} module.exports = g; /***/ }), /***/ 3: /***/ (function(module, exports, __webpack_require__) { var __WEBPACK_AMD_DEFINE_ARRAY__, __WEBPACK_AMD_DEFINE_RESULT__;/*! * jQuery JavaScript Library v3.2.1 * https://jquery.com/ * * Includes Sizzle.js * https://sizzlejs.com/ * * Copyright JS Foundation and other contributors * Released under the MIT license * https://jquery.org/license * * Date: 2017-03-20T18:59Z */ ( function( global, factory ) { "use strict"; if ( typeof module === "object" && typeof module.exports === "object" ) { // For CommonJS and CommonJS-like environments where a proper `window` // is present, execute the factory and get jQuery. // For environments that do not have a `window` with a `document` // (such as Node.js), expose a factory as module.exports. // This accentuates the need for the creation of a real `window`. // e.g. var jQuery = require("jquery")(window); // See ticket #14549 for more info. module.exports = global.document ? factory( global, true ) : function( w ) { if ( !w.document ) { throw new Error( "jQuery requires a window with a document" ); } return factory( w ); }; } else { factory( global ); } // Pass this if window is not defined yet } )( typeof window !== "undefined" ? window : this, function( window, noGlobal ) { // Edge <= 12 - 13+, Firefox <=18 - 45+, IE 10 - 11, Safari 5.1 - 9+, iOS 6 - 9.1 // throw exceptions when non-strict code (e.g., ASP.NET 4.5) accesses strict mode // arguments.callee.caller (trac-13335). But as of jQuery 3.0 (2016), strict mode should be common // enough that all such attempts are guarded in a try block. "use strict"; var arr = []; var document = window.document; var getProto = Object.getPrototypeOf; var slice = arr.slice; var concat = arr.concat; var push = arr.push; var indexOf = arr.indexOf; var class2type = {}; var toString = class2type.toString; var hasOwn = class2type.hasOwnProperty; var fnToString = hasOwn.toString; var ObjectFunctionString = fnToString.call( Object ); var support = {}; function DOMEval( code, doc ) { doc = doc || document; var script = doc.createElement( "script" ); script.text = code; doc.head.appendChild( script ).parentNode.removeChild( script ); } /* global Symbol */ // Defining this global in .eslintrc.json would create a danger of using the global // unguarded in another place, it seems safer to define global only for this module var version = "3.2.1", // Define a local copy of jQuery jQuery = function( selector, context ) { // The jQuery object is actually just the init constructor 'enhanced' // Need init if jQuery is called (just allow error to be thrown if not included) return new jQuery.fn.init( selector, context ); }, // Support: Android <=4.0 only // Make sure we trim BOM and NBSP rtrim = /^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g, // Matches dashed string for camelizing rmsPrefix = /^-ms-/, rdashAlpha = /-([a-z])/g, // Used by jQuery.camelCase as callback to replace() fcamelCase = function( all, letter ) { return letter.toUpperCase(); }; jQuery.fn = jQuery.prototype = { // The current version of jQuery being used jquery: version, constructor: jQuery, // The default length of a jQuery object is 0 length: 0, toArray: function() { return slice.call( this ); }, // Get the Nth element in the matched element set OR // Get the whole matched element set as a clean array get: function( num ) { // Return all the elements in a clean array if ( num == null ) { return slice.call( this ); } // Return just the one element from the set return num < 0 ? this[ num + this.length ] : this[ num ]; }, // Take an array of elements and push it onto the stack // (returning the new matched element set) pushStack: function( elems ) { // Build a new jQuery matched element set var ret = jQuery.merge( this.constructor(), elems ); // Add the old object onto the stack (as a reference) ret.prevObject = this; // Return the newly-formed element set return ret; }, // Execute a callback for every element in the matched set. each: function( callback ) { return jQuery.each( this, callback ); }, map: function( callback ) { return this.pushStack( jQuery.map( this, function( elem, i ) { return callback.call( elem, i, elem ); } ) ); }, slice: function() { return this.pushStack( slice.apply( this, arguments ) ); }, first: function() { return this.eq( 0 ); }, last: function() { return this.eq( -1 ); }, eq: function( i ) { var len = this.length, j = +i + ( i < 0 ? len : 0 ); return this.pushStack( j >= 0 && j < len ? [ this[ j ] ] : [] ); }, end: function() { return this.prevObject || this.constructor(); }, // For internal use only. // Behaves like an Array's method, not like a jQuery method. push: push, sort: arr.sort, splice: arr.splice }; jQuery.extend = jQuery.fn.extend = function() { var options, name, src, copy, copyIsArray, clone, target = arguments[ 0 ] || {}, i = 1, length = arguments.length, deep = false; // Handle a deep copy situation if ( typeof target === "boolean" ) { deep = target; // Skip the boolean and the target target = arguments[ i ] || {}; i++; } // Handle case when target is a string or something (possible in deep copy) if ( typeof target !== "object" && !jQuery.isFunction( target ) ) { target = {}; } // Extend jQuery itself if only one argument is passed if ( i === length ) { target = this; i--; } for ( ; i < length; i++ ) { // Only deal with non-null/undefined values if ( ( options = arguments[ i ] ) != null ) { // Extend the base object for ( name in options ) { src = target[ name ]; copy = options[ name ]; // Prevent never-ending loop if ( target === copy ) { continue; } // Recurse if we're merging plain objects or arrays if ( deep && copy && ( jQuery.isPlainObject( copy ) || ( copyIsArray = Array.isArray( copy ) ) ) ) { if ( copyIsArray ) { copyIsArray = false; clone = src && Array.isArray( src ) ? src : []; } else { clone = src && jQuery.isPlainObject( src ) ? src : {}; } // Never move original objects, clone them target[ name ] = jQuery.extend( deep, clone, copy ); // Don't bring in undefined values } else if ( copy !== undefined ) { target[ name ] = copy; } } } } // Return the modified object return target; }; jQuery.extend( { // Unique for each copy of jQuery on the page expando: "jQuery" + ( version + Math.random() ).replace( /\D/g, "" ), // Assume jQuery is ready without the ready module isReady: true, error: function( msg ) { throw new Error( msg ); }, noop: function() {}, isFunction: function( obj ) { return jQuery.type( obj ) === "function"; }, isWindow: function( obj ) { return obj != null && obj === obj.window; }, isNumeric: function( obj ) { // As of jQuery 3.0, isNumeric is limited to // strings and numbers (primitives or objects) // that can be coerced to finite numbers (gh-2662) var type = jQuery.type( obj ); return ( type === "number" || type === "string" ) && // parseFloat NaNs numeric-cast false positives ("") // ...but misinterprets leading-number strings, particularly hex literals ("0x...") // subtraction forces infinities to NaN !isNaN( obj - parseFloat( obj ) ); }, isPlainObject: function( obj ) { var proto, Ctor; // Detect obvious negatives // Use toString instead of jQuery.type to catch host objects if ( !obj || toString.call( obj ) !== "[object Object]" ) { return false; } proto = getProto( obj ); // Objects with no prototype (e.g., `Object.create( null )`) are plain if ( !proto ) { return true; } // Objects with prototype are plain iff they were constructed by a global Object function Ctor = hasOwn.call( proto, "constructor" ) && proto.constructor; return typeof Ctor === "function" && fnToString.call( Ctor ) === ObjectFunctionString; }, isEmptyObject: function( obj ) { /* eslint-disable no-unused-vars */ // See https://github.com/eslint/eslint/issues/6125 var name; for ( name in obj ) { return false; } return true; }, type: function( obj ) { if ( obj == null ) { return obj + ""; } // Support: Android <=2.3 only (functionish RegExp) return typeof obj === "object" || typeof obj === "function" ? class2type[ toString.call( obj ) ] || "object" : typeof obj; }, // Evaluates a script in a global context globalEval: function( code ) { DOMEval( code ); }, // Convert dashed to camelCase; used by the css and data modules // Support: IE <=9 - 11, Edge 12 - 13 // Microsoft forgot to hump their vendor prefix (#9572) camelCase: function( string ) { return string.replace( rmsPrefix, "ms-" ).replace( rdashAlpha, fcamelCase ); }, each: function( obj, callback ) { var length, i = 0; if ( isArrayLike( obj ) ) { length = obj.length; for ( ; i < length; i++ ) { if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) { break; } } } else { for ( i in obj ) { if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) { break; } } } return obj; }, // Support: Android <=4.0 only trim: function( text ) { return text == null ? "" : ( text + "" ).replace( rtrim, "" ); }, // results is for internal usage only makeArray: function( arr, results ) { var ret = results || []; if ( arr != null ) { if ( isArrayLike( Object( arr ) ) ) { jQuery.merge( ret, typeof arr === "string" ? [ arr ] : arr ); } else { push.call( ret, arr ); } } return ret; }, inArray: function( elem, arr, i ) { return arr == null ? -1 : indexOf.call( arr, elem, i ); }, // Support: Android <=4.0 only, PhantomJS 1 only // push.apply(_, arraylike) throws on ancient WebKit merge: function( first, second ) { var len = +second.length, j = 0, i = first.length; for ( ; j < len; j++ ) { first[ i++ ] = second[ j ]; } first.length = i; return first; }, grep: function( elems, callback, invert ) { var callbackInverse, matches = [], i = 0, length = elems.length, callbackExpect = !invert; // Go through the array, only saving the items // that pass the validator function for ( ; i < length; i++ ) { callbackInverse = !callback( elems[ i ], i ); if ( callbackInverse !== callbackExpect ) { matches.push( elems[ i ] ); } } return matches; }, // arg is for internal usage only map: function( elems, callback, arg ) { var length, value, i = 0, ret = []; // Go through the array, translating each of the items to their new values if ( isArrayLike( elems ) ) { length = elems.length; for ( ; i < length; i++ ) { value = callback( elems[ i ], i, arg ); if ( value != null ) { ret.push( value ); } } // Go through every key on the object, } else { for ( i in elems ) { value = callback( elems[ i ], i, arg ); if ( value != null ) { ret.push( value ); } } } // Flatten any nested arrays return concat.apply( [], ret ); }, // A global GUID counter for objects guid: 1, // Bind a function to a context, optionally partially applying any // arguments. proxy: function( fn, context ) { var tmp, args, proxy; if ( typeof context === "string" ) { tmp = fn[ context ]; context = fn; fn = tmp; } // Quick check to determine if target is callable, in the spec // this throws a TypeError, but we will just return undefined. if ( !jQuery.isFunction( fn ) ) { return undefined; } // Simulated bind args = slice.call( arguments, 2 ); proxy = function() { return fn.apply( context || this, args.concat( slice.call( arguments ) ) ); }; // Set the guid of unique handler to the same of original handler, so it can be removed proxy.guid = fn.guid = fn.guid || jQuery.guid++; return proxy; }, now: Date.now, // jQuery.support is not used in Core but other projects attach their // properties to it so it needs to exist. support: support } ); if ( typeof Symbol === "function" ) { jQuery.fn[ Symbol.iterator ] = arr[ Symbol.iterator ]; } // Populate the class2type map jQuery.each( "Boolean Number String Function Array Date RegExp Object Error Symbol".split( " " ), function( i, name ) { class2type[ "[object " + name + "]" ] = name.toLowerCase(); } ); function isArrayLike( obj ) { // Support: real iOS 8.2 only (not reproducible in simulator) // `in` check used to prevent JIT error (gh-2145) // hasOwn isn't used here due to false negatives // regarding Nodelist length in IE var length = !!obj && "length" in obj && obj.length, type = jQuery.type( obj ); if ( type === "function" || jQuery.isWindow( obj ) ) { return false; } return type === "array" || length === 0 || typeof length === "number" && length > 0 && ( length - 1 ) in obj; } var Sizzle = /*! * Sizzle CSS Selector Engine v2.3.3 * https://sizzlejs.com/ * * Copyright jQuery Foundation and other contributors * Released under the MIT license * http://jquery.org/license * * Date: 2016-08-08 */ (function( window ) { var i, support, Expr, getText, isXML, tokenize, compile, select, outermostContext, sortInput, hasDuplicate, // Local document vars setDocument, document, docElem, documentIsHTML, rbuggyQSA, rbuggyMatches, matches, contains, // Instance-specific data expando = "sizzle" + 1 * new Date(), preferredDoc = window.document, dirruns = 0, done = 0, classCache = createCache(), tokenCache = createCache(), compilerCache = createCache(), sortOrder = function( a, b ) { if ( a === b ) { hasDuplicate = true; } return 0; }, // Instance methods hasOwn = ({}).hasOwnProperty, arr = [], pop = arr.pop, push_native = arr.push, push = arr.push, slice = arr.slice, // Use a stripped-down indexOf as it's faster than native // https://jsperf.com/thor-indexof-vs-for/5 indexOf = function( list, elem ) { var i = 0, len = list.length; for ( ; i < len; i++ ) { if ( list[i] === elem ) { return i; } } return -1; }, booleans = "checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|ismap|loop|multiple|open|readonly|required|scoped", // Regular expressions // http://www.w3.org/TR/css3-selectors/#whitespace whitespace = "[\\x20\\t\\r\\n\\f]", // http://www.w3.org/TR/CSS21/syndata.html#value-def-identifier identifier = "(?:\\\\.|[\\w-]|[^\0-\\xa0])+", // Attribute selectors: http://www.w3.org/TR/selectors/#attribute-selectors attributes = "\\[" + whitespace + "*(" + identifier + ")(?:" + whitespace + // Operator (capture 2) "*([*^$|!~]?=)" + whitespace + // "Attribute values must be CSS identifiers [capture 5] or strings [capture 3 or capture 4]" "*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|(" + identifier + "))|)" + whitespace + "*\\]", pseudos = ":(" + identifier + ")(?:\\((" + // To reduce the number of selectors needing tokenize in the preFilter, prefer arguments: // 1. quoted (capture 3; capture 4 or capture 5) "('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|" + // 2. simple (capture 6) "((?:\\\\.|[^\\\\()[\\]]|" + attributes + ")*)|" + // 3. anything else (capture 2) ".*" + ")\\)|)", // Leading and non-escaped trailing whitespace, capturing some non-whitespace characters preceding the latter rwhitespace = new RegExp( whitespace + "+", "g" ), rtrim = new RegExp( "^" + whitespace + "+|((?:^|[^\\\\])(?:\\\\.)*)" + whitespace + "+$", "g" ), rcomma = new RegExp( "^" + whitespace + "*," + whitespace + "*" ), rcombinators = new RegExp( "^" + whitespace + "*([>+~]|" + whitespace + ")" + whitespace + "*" ), rattributeQuotes = new RegExp( "=" + whitespace + "*([^\\]'\"]*?)" + whitespace + "*\\]", "g" ), rpseudo = new RegExp( pseudos ), ridentifier = new RegExp( "^" + identifier + "$" ), matchExpr = { "ID": new RegExp( "^#(" + identifier + ")" ), "CLASS": new RegExp( "^\\.(" + identifier + ")" ), "TAG": new RegExp( "^(" + identifier + "|[*])" ), "ATTR": new RegExp( "^" + attributes ), "PSEUDO": new RegExp( "^" + pseudos ), "CHILD": new RegExp( "^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\(" + whitespace + "*(even|odd|(([+-]|)(\\d*)n|)" + whitespace + "*(?:([+-]|)" + whitespace + "*(\\d+)|))" + whitespace + "*\\)|)", "i" ), "bool": new RegExp( "^(?:" + booleans + ")$", "i" ), // For use in libraries implementing .is() // We use this for POS matching in `select` "needsContext": new RegExp( "^" + whitespace + "*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\(" + whitespace + "*((?:-\\d)?\\d*)" + whitespace + "*\\)|)(?=[^-]|$)", "i" ) }, rinputs = /^(?:input|select|textarea|button)$/i, rheader = /^h\d$/i, rnative = /^[^{]+\{\s*\[native \w/, // Easily-parseable/retrievable ID or TAG or CLASS selectors rquickExpr = /^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/, rsibling = /[+~]/, // CSS escapes // http://www.w3.org/TR/CSS21/syndata.html#escaped-characters runescape = new RegExp( "\\\\([\\da-f]{1,6}" + whitespace + "?|(" + whitespace + ")|.)", "ig" ), funescape = function( _, escaped, escapedWhitespace ) { var high = "0x" + escaped - 0x10000; // NaN means non-codepoint // Support: Firefox<24 // Workaround erroneous numeric interpretation of +"0x" return high !== high || escapedWhitespace ? escaped : high < 0 ? // BMP codepoint String.fromCharCode( high + 0x10000 ) : // Supplemental Plane codepoint (surrogate pair) String.fromCharCode( high >> 10 | 0xD800, high & 0x3FF | 0xDC00 ); }, // CSS string/identifier serialization // https://drafts.csswg.org/cssom/#common-serializing-idioms rcssescape = /([\0-\x1f\x7f]|^-?\d)|^-$|[^\0-\x1f\x7f-\uFFFF\w-]/g, fcssescape = function( ch, asCodePoint ) { if ( asCodePoint ) { // U+0000 NULL becomes U+FFFD REPLACEMENT CHARACTER if ( ch === "\0" ) { return "\uFFFD"; } // Control characters and (dependent upon position) numbers get escaped as code points return ch.slice( 0, -1 ) + "\\" + ch.charCodeAt( ch.length - 1 ).toString( 16 ) + " "; } // Other potentially-special ASCII characters get backslash-escaped return "\\" + ch; }, // Used for iframes // See setDocument() // Removing the function wrapper causes a "Permission Denied" // error in IE unloadHandler = function() { setDocument(); }, disabledAncestor = addCombinator( function( elem ) { return elem.disabled === true && ("form" in elem || "label" in elem); }, { dir: "parentNode", next: "legend" } ); // Optimize for push.apply( _, NodeList ) try { push.apply( (arr = slice.call( preferredDoc.childNodes )), preferredDoc.childNodes ); // Support: Android<4.0 // Detect silently failing push.apply arr[ preferredDoc.childNodes.length ].nodeType; } catch ( e ) { push = { apply: arr.length ? // Leverage slice if possible function( target, els ) { push_native.apply( target, slice.call(els) ); } : // Support: IE<9 // Otherwise append directly function( target, els ) { var j = target.length, i = 0; // Can't trust NodeList.length while ( (target[j++] = els[i++]) ) {} target.length = j - 1; } }; } function Sizzle( selector, context, results, seed ) { var m, i, elem, nid, match, groups, newSelector, newContext = context && context.ownerDocument, // nodeType defaults to 9, since context defaults to document nodeType = context ? context.nodeType : 9; results = results || []; // Return early from calls with invalid selector or context if ( typeof selector !== "string" || !selector || nodeType !== 1 && nodeType !== 9 && nodeType !== 11 ) { return results; } // Try to shortcut find operations (as opposed to filters) in HTML documents if ( !seed ) { if ( ( context ? context.ownerDocument || context : preferredDoc ) !== document ) { setDocument( context ); } context = context || document; if ( documentIsHTML ) { // If the selector is sufficiently simple, try using a "get*By*" DOM method // (excepting DocumentFragment context, where the methods don't exist) if ( nodeType !== 11 && (match = rquickExpr.exec( selector )) ) { // ID selector if ( (m = match[1]) ) { // Document context if ( nodeType === 9 ) { if ( (elem = context.getElementById( m )) ) { // Support: IE, Opera, Webkit // TODO: identify versions // getElementById can match elements by name instead of ID if ( elem.id === m ) { results.push( elem ); return results; } } else { return results; } // Element context } else { // Support: IE, Opera, Webkit // TODO: identify versions // getElementById can match elements by name instead of ID if ( newContext && (elem = newContext.getElementById( m )) && contains( context, elem ) && elem.id === m ) { results.push( elem ); return results; } } // Type selector } else if ( match[2] ) { push.apply( results, context.getElementsByTagName( selector ) ); return results; // Class selector } else if ( (m = match[3]) && support.getElementsByClassName && context.getElementsByClassName ) { push.apply( results, context.getElementsByClassName( m ) ); return results; } } // Take advantage of querySelectorAll if ( support.qsa && !compilerCache[ selector + " " ] && (!rbuggyQSA || !rbuggyQSA.test( selector )) ) { if ( nodeType !== 1 ) { newContext = context; newSelector = selector; // qSA looks outside Element context, which is not what we want // Thanks to Andrew Dupont for this workaround technique // Support: IE <=8 // Exclude object elements } else if ( context.nodeName.toLowerCase() !== "object" ) { // Capture the context ID, setting it first if necessary if ( (nid = context.getAttribute( "id" )) ) { nid = nid.replace( rcssescape, fcssescape ); } else { context.setAttribute( "id", (nid = expando) ); } // Prefix every selector in the list groups = tokenize( selector ); i = groups.length; while ( i-- ) { groups[i] = "#" + nid + " " + toSelector( groups[i] ); } newSelector = groups.join( "," ); // Expand context for sibling selectors newContext = rsibling.test( selector ) && testContext( context.parentNode ) || context; } if ( newSelector ) { try { push.apply( results, newContext.querySelectorAll( newSelector ) ); return results; } catch ( qsaError ) { } finally { if ( nid === expando ) { context.removeAttribute( "id" ); } } } } } } // All others return select( selector.replace( rtrim, "$1" ), context, results, seed ); } /** * Create key-value caches of limited size * @returns {function(string, object)} Returns the Object data after storing it on itself with * property name the (space-suffixed) string and (if the cache is larger than Expr.cacheLength) * deleting the oldest entry */ function createCache() { var keys = []; function cache( key, value ) { // Use (key + " ") to avoid collision with native prototype properties (see Issue #157) if ( keys.push( key + " " ) > Expr.cacheLength ) { // Only keep the most recent entries delete cache[ keys.shift() ]; } return (cache[ key + " " ] = value); } return cache; } /** * Mark a function for special use by Sizzle * @param {Function} fn The function to mark */ function markFunction( fn ) { fn[ expando ] = true; return fn; } /** * Support testing using an element * @param {Function} fn Passed the created element and returns a boolean result */ function assert( fn ) { var el = document.createElement("fieldset"); try { return !!fn( el ); } catch (e) { return false; } finally { // Remove from its parent by default if ( el.parentNode ) { el.parentNode.removeChild( el ); } // release memory in IE el = null; } } /** * Adds the same handler for all of the specified attrs * @param {String} attrs Pipe-separated list of attributes * @param {Function} handler The method that will be applied */ function addHandle( attrs, handler ) { var arr = attrs.split("|"), i = arr.length; while ( i-- ) { Expr.attrHandle[ arr[i] ] = handler; } } /** * Checks document order of two siblings * @param {Element} a * @param {Element} b * @returns {Number} Returns less than 0 if a precedes b, greater than 0 if a follows b */ function siblingCheck( a, b ) { var cur = b && a, diff = cur && a.nodeType === 1 && b.nodeType === 1 && a.sourceIndex - b.sourceIndex; // Use IE sourceIndex if available on both nodes if ( diff ) { return diff; } // Check if b follows a if ( cur ) { while ( (cur = cur.nextSibling) ) { if ( cur === b ) { return -1; } } } return a ? 1 : -1; } /** * Returns a function to use in pseudos for input types * @param {String} type */ function createInputPseudo( type ) { return function( elem ) { var name = elem.nodeName.toLowerCase(); return name === "input" && elem.type === type; }; } /** * Returns a function to use in pseudos for buttons * @param {String} type */ function createButtonPseudo( type ) { return function( elem ) { var name = elem.nodeName.toLowerCase(); return (name === "input" || name === "button") && elem.type === type; }; } /** * Returns a function to use in pseudos for :enabled/:disabled * @param {Boolean} disabled true for :disabled; false for :enabled */ function createDisabledPseudo( disabled ) { // Known :disabled false positives: fieldset[disabled] > legend:nth-of-type(n+2) :can-disable return function( elem ) { // Only certain elements can match :enabled or :disabled // https://html.spec.whatwg.org/multipage/scripting.html#selector-enabled // https://html.spec.whatwg.org/multipage/scripting.html#selector-disabled if ( "form" in elem ) { // Check for inherited disabledness on relevant non-disabled elements: // * listed form-associated elements in a disabled fieldset // https://html.spec.whatwg.org/multipage/forms.html#category-listed // https://html.spec.whatwg.org/multipage/forms.html#concept-fe-disabled // * option elements in a disabled optgroup // https://html.spec.whatwg.org/multipage/forms.html#concept-option-disabled // All such elements have a "form" property. if ( elem.parentNode && elem.disabled === false ) { // Option elements defer to a parent optgroup if present if ( "label" in elem ) { if ( "label" in elem.parentNode ) { return elem.parentNode.disabled === disabled; } else { return elem.disabled === disabled; } } // Support: IE 6 - 11 // Use the isDisabled shortcut property to check for disabled fieldset ancestors return elem.isDisabled === disabled || // Where there is no isDisabled, check manually /* jshint -W018 */ elem.isDisabled !== !disabled && disabledAncestor( elem ) === disabled; } return elem.disabled === disabled; // Try to winnow out elements that can't be disabled before trusting the disabled property. // Some victims get caught in our net (label, legend, menu, track), but it shouldn't // even exist on them, let alone have a boolean value. } else if ( "label" in elem ) { return elem.disabled === disabled; } // Remaining elements are neither :enabled nor :disabled return false; }; } /** * Returns a function to use in pseudos for positionals * @param {Function} fn */ function createPositionalPseudo( fn ) { return markFunction(function( argument ) { argument = +argument; return markFunction(function( seed, matches ) { var j, matchIndexes = fn( [], seed.length, argument ), i = matchIndexes.length; // Match elements found at the specified indexes while ( i-- ) { if ( seed[ (j = matchIndexes[i]) ] ) { seed[j] = !(matches[j] = seed[j]); } } }); }); } /** * Checks a node for validity as a Sizzle context * @param {Element|Object=} context * @returns {Element|Object|Boolean} The input node if acceptable, otherwise a falsy value */ function testContext( context ) { return context && typeof context.getElementsByTagName !== "undefined" && context; } // Expose support vars for convenience support = Sizzle.support = {}; /** * Detects XML nodes * @param {Element|Object} elem An element or a document * @returns {Boolean} True iff elem is a non-HTML XML node */ isXML = Sizzle.isXML = function( elem ) { // documentElement is verified for cases where it doesn't yet exist // (such as loading iframes in IE - #4833) var documentElement = elem && (elem.ownerDocument || elem).documentElement; return documentElement ? documentElement.nodeName !== "HTML" : false; }; /** * Sets document-related variables once based on the current document * @param {Element|Object} [doc] An element or document object to use to set the document * @returns {Object} Returns the current document */ setDocument = Sizzle.setDocument = function( node ) { var hasCompare, subWindow, doc = node ? node.ownerDocument || node : preferredDoc; // Return early if doc is invalid or already selected if ( doc === document || doc.nodeType !== 9 || !doc.documentElement ) { return document; } // Update global variables document = doc; docElem = document.documentElement; documentIsHTML = !isXML( document ); // Support: IE 9-11, Edge // Accessing iframe documents after unload throws "permission denied" errors (jQuery #13936) if ( preferredDoc !== document && (subWindow = document.defaultView) && subWindow.top !== subWindow ) { // Support: IE 11, Edge if ( subWindow.addEventListener ) { subWindow.addEventListener( "unload", unloadHandler, false ); // Support: IE 9 - 10 only } else if ( subWindow.attachEvent ) { subWindow.attachEvent( "onunload", unloadHandler ); } } /* Attributes ---------------------------------------------------------------------- */ // Support: IE<8 // Verify that getAttribute really returns attributes and not properties // (excepting IE8 booleans) support.attributes = assert(function( el ) { el.className = "i"; return !el.getAttribute("className"); }); /* getElement(s)By* ---------------------------------------------------------------------- */ // Check if getElementsByTagName("*") returns only elements support.getElementsByTagName = assert(function( el ) { el.appendChild( document.createComment("") ); return !el.getElementsByTagName("*").length; }); // Support: IE<9 support.getElementsByClassName = rnative.test( document.getElementsByClassName ); // Support: IE<10 // Check if getElementById returns elements by name // The broken getElementById methods don't pick up programmatically-set names, // so use a roundabout getElementsByName test support.getById = assert(function( el ) { docElem.appendChild( el ).id = expando; return !document.getElementsByName || !document.getElementsByName( expando ).length; }); // ID filter and find if ( support.getById ) { Expr.filter["ID"] = function( id ) { var attrId = id.replace( runescape, funescape ); return function( elem ) { return elem.getAttribute("id") === attrId; }; }; Expr.find["ID"] = function( id, context ) { if ( typeof context.getElementById !== "undefined" && documentIsHTML ) { var elem = context.getElementById( id ); return elem ? [ elem ] : []; } }; } else { Expr.filter["ID"] = function( id ) { var attrId = id.replace( runescape, funescape ); return function( elem ) { var node = typeof elem.getAttributeNode !== "undefined" && elem.getAttributeNode("id"); return node && node.value === attrId; }; }; // Support: IE 6 - 7 only // getElementById is not reliable as a find shortcut Expr.find["ID"] = function( id, context ) { if ( typeof context.getElementById !== "undefined" && documentIsHTML ) { var node, i, elems, elem = context.getElementById( id ); if ( elem ) { // Verify the id attribute node = elem.getAttributeNode("id"); if ( node && node.value === id ) { return [ elem ]; } // Fall back on getElementsByName elems = context.getElementsByName( id ); i = 0; while ( (elem = elems[i++]) ) { node = elem.getAttributeNode("id"); if ( node && node.value === id ) { return [ elem ]; } } } return []; } }; } // Tag Expr.find["TAG"] = support.getElementsByTagName ? function( tag, context ) { if ( typeof context.getElementsByTagName !== "undefined" ) { return context.getElementsByTagName( tag ); // DocumentFragment nodes don't have gEBTN } else if ( support.qsa ) { return context.querySelectorAll( tag ); } } : function( tag, context ) { var elem, tmp = [], i = 0, // By happy coincidence, a (broken) gEBTN appears on DocumentFragment nodes too results = context.getElementsByTagName( tag ); // Filter out possible comments if ( tag === "*" ) { while ( (elem = results[i++]) ) { if ( elem.nodeType === 1 ) { tmp.push( elem ); } } return tmp; } return results; }; // Class Expr.find["CLASS"] = support.getElementsByClassName && function( className, context ) { if ( typeof context.getElementsByClassName !== "undefined" && documentIsHTML ) { return context.getElementsByClassName( className ); } }; /* QSA/matchesSelector ---------------------------------------------------------------------- */ // QSA and matchesSelector support // matchesSelector(:active) reports false when true (IE9/Opera 11.5) rbuggyMatches = []; // qSa(:focus) reports false when true (Chrome 21) // We allow this because of a bug in IE8/9 that throws an error // whenever `document.activeElement` is accessed on an iframe // So, we allow :focus to pass through QSA all the time to avoid the IE error // See https://bugs.jquery.com/ticket/13378 rbuggyQSA = []; if ( (support.qsa = rnative.test( document.querySelectorAll )) ) { // Build QSA regex // Regex strategy adopted from Diego Perini assert(function( el ) { // Select is set to empty string on purpose // This is to test IE's treatment of not explicitly // setting a boolean content attribute, // since its presence should be enough // https://bugs.jquery.com/ticket/12359 docElem.appendChild( el ).innerHTML = "<a id='" + expando + "'></a>" + "<select id='" + expando + "-\r\\' msallowcapture=''>" + "<option selected=''></option></select>"; // Support: IE8, Opera 11-12.16 // Nothing should be selected when empty strings follow ^= or $= or *= // The test attribute must be unknown in Opera but "safe" for WinRT // https://msdn.microsoft.com/en-us/library/ie/hh465388.aspx#attribute_section if ( el.querySelectorAll("[msallowcapture^='']").length ) { rbuggyQSA.push( "[*^$]=" + whitespace + "*(?:''|\"\")" ); } // Support: IE8 // Boolean attributes and "value" are not treated correctly if ( !el.querySelectorAll("[selected]").length ) { rbuggyQSA.push( "\\[" + whitespace + "*(?:value|" + booleans + ")" ); } // Support: Chrome<29, Android<4.4, Safari<7.0+, iOS<7.0+, PhantomJS<1.9.8+ if ( !el.querySelectorAll( "[id~=" + expando + "-]" ).length ) { rbuggyQSA.push("~="); } // Webkit/Opera - :checked should return selected option elements // http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked // IE8 throws error here and will not see later tests if ( !el.querySelectorAll(":checked").length ) { rbuggyQSA.push(":checked"); } // Support: Safari 8+, iOS 8+ // https://bugs.webkit.org/show_bug.cgi?id=136851 // In-page `selector#id sibling-combinator selector` fails if ( !el.querySelectorAll( "a#" + expando + "+*" ).length ) { rbuggyQSA.push(".#.+[+~]"); } }); assert(function( el ) { el.innerHTML = "<a href='' disabled='disabled'></a>" + "<select disabled='disabled'><option/></select>"; // Support: Windows 8 Native Apps // The type and name attributes are restricted during .innerHTML assignment var input = document.createElement("input"); input.setAttribute( "type", "hidden" ); el.appendChild( input ).setAttribute( "name", "D" ); // Support: IE8 // Enforce case-sensitivity of name attribute if ( el.querySelectorAll("[name=d]").length ) { rbuggyQSA.push( "name" + whitespace + "*[*^$|!~]?=" ); } // FF 3.5 - :enabled/:disabled and hidden elements (hidden elements are still enabled) // IE8 throws error here and will not see later tests if ( el.querySelectorAll(":enabled").length !== 2 ) { rbuggyQSA.push( ":enabled", ":disabled" ); } // Support: IE9-11+ // IE's :disabled selector does not pick up the children of disabled fieldsets docElem.appendChild( el ).disabled = true; if ( el.querySelectorAll(":disabled").length !== 2 ) { rbuggyQSA.push( ":enabled", ":disabled" ); } // Opera 10-11 does not throw on post-comma invalid pseudos el.querySelectorAll("*,:x"); rbuggyQSA.push(",.*:"); }); } if ( (support.matchesSelector = rnative.test( (matches = docElem.matches || docElem.webkitMatchesSelector || docElem.mozMatchesSelector || docElem.oMatchesSelector || docElem.msMatchesSelector) )) ) { assert(function( el ) { // Check to see if it's possible to do matchesSelector // on a disconnected node (IE 9) support.disconnectedMatch = matches.call( el, "*" ); // This should fail with an exception // Gecko does not error, returns false instead matches.call( el, "[s!='']:x" ); rbuggyMatches.push( "!=", pseudos ); }); } rbuggyQSA = rbuggyQSA.length && new RegExp( rbuggyQSA.join("|") ); rbuggyMatches = rbuggyMatches.length && new RegExp( rbuggyMatches.join("|") ); /* Contains ---------------------------------------------------------------------- */ hasCompare = rnative.test( docElem.compareDocumentPosition ); // Element contains another // Purposefully self-exclusive // As in, an element does not contain itself contains = hasCompare || rnative.test( docElem.contains ) ? function( a, b ) { var adown = a.nodeType === 9 ? a.documentElement : a, bup = b && b.parentNode; return a === bup || !!( bup && bup.nodeType === 1 && ( adown.contains ? adown.contains( bup ) : a.compareDocumentPosition && a.compareDocumentPosition( bup ) & 16 )); } : function( a, b ) { if ( b ) { while ( (b = b.parentNode) ) { if ( b === a ) { return true; } } } return false; }; /* Sorting ---------------------------------------------------------------------- */ // Document order sorting sortOrder = hasCompare ? function( a, b ) { // Flag for duplicate removal if ( a === b ) { hasDuplicate = true; return 0; } // Sort on method existence if only one input has compareDocumentPosition var compare = !a.compareDocumentPosition - !b.compareDocumentPosition; if ( compare ) { return compare; } // Calculate position if both inputs belong to the same document compare = ( a.ownerDocument || a ) === ( b.ownerDocument || b ) ? a.compareDocumentPosition( b ) : // Otherwise we know they are disconnected 1; // Disconnected nodes if ( compare & 1 || (!support.sortDetached && b.compareDocumentPosition( a ) === compare) ) { // Choose the first element that is related to our preferred document if ( a === document || a.ownerDocument === preferredDoc && contains(preferredDoc, a) ) { return -1; } if ( b === document || b.ownerDocument === preferredDoc && contains(preferredDoc, b) ) { return 1; } // Maintain original order return sortInput ? ( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) : 0; } return compare & 4 ? -1 : 1; } : function( a, b ) { // Exit early if the nodes are identical if ( a === b ) { hasDuplicate = true; return 0; } var cur, i = 0, aup = a.parentNode, bup = b.parentNode, ap = [ a ], bp = [ b ]; // Parentless nodes are either documents or disconnected if ( !aup || !bup ) { return a === document ? -1 : b === document ? 1 : aup ? -1 : bup ? 1 : sortInput ? ( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) : 0; // If the nodes are siblings, we can do a quick check } else if ( aup === bup ) { return siblingCheck( a, b ); } // Otherwise we need full lists of their ancestors for comparison cur = a; while ( (cur = cur.parentNode) ) { ap.unshift( cur ); } cur = b; while ( (cur = cur.parentNode) ) { bp.unshift( cur ); } // Walk down the tree looking for a discrepancy while ( ap[i] === bp[i] ) { i++; } return i ? // Do a sibling check if the nodes have a common ancestor siblingCheck( ap[i], bp[i] ) : // Otherwise nodes in our document sort first ap[i] === preferredDoc ? -1 : bp[i] === preferredDoc ? 1 : 0; }; return document; }; Sizzle.matches = function( expr, elements ) { return Sizzle( expr, null, null, elements ); }; Sizzle.matchesSelector = function( elem, expr ) { // Set document vars if needed if ( ( elem.ownerDocument || elem ) !== document ) { setDocument( elem ); } // Make sure that attribute selectors are quoted expr = expr.replace( rattributeQuotes, "='$1']" ); if ( support.matchesSelector && documentIsHTML && !compilerCache[ expr + " " ] && ( !rbuggyMatches || !rbuggyMatches.test( expr ) ) && ( !rbuggyQSA || !rbuggyQSA.test( expr ) ) ) { try { var ret = matches.call( elem, expr ); // IE 9's matchesSelector returns false on disconnected nodes if ( ret || support.disconnectedMatch || // As well, disconnected nodes are said to be in a document // fragment in IE 9 elem.document && elem.document.nodeType !== 11 ) { return ret; } } catch (e) {} } return Sizzle( expr, document, null, [ elem ] ).length > 0; }; Sizzle.contains = function( context, elem ) { // Set document vars if needed if ( ( context.ownerDocument || context ) !== document ) { setDocument( context ); } return contains( context, elem ); }; Sizzle.attr = function( elem, name ) { // Set document vars if needed if ( ( elem.ownerDocument || elem ) !== document ) { setDocument( elem ); } var fn = Expr.attrHandle[ name.toLowerCase() ], // Don't get fooled by Object.prototype properties (jQuery #13807) val = fn && hasOwn.call( Expr.attrHandle, name.toLowerCase() ) ? fn( elem, name, !documentIsHTML ) : undefined; return val !== undefined ? val : support.attributes || !documentIsHTML ? elem.getAttribute( name ) : (val = elem.getAttributeNode(name)) && val.specified ? val.value : null; }; Sizzle.escape = function( sel ) { return (sel + "").replace( rcssescape, fcssescape ); }; Sizzle.error = function( msg ) { throw new Error( "Syntax error, unrecognized expression: " + msg ); }; /** * Document sorting and removing duplicates * @param {ArrayLike} results */ Sizzle.uniqueSort = function( results ) { var elem, duplicates = [], j = 0, i = 0; // Unless we *know* we can detect duplicates, assume their presence hasDuplicate = !support.detectDuplicates; sortInput = !support.sortStable && results.slice( 0 ); results.sort( sortOrder ); if ( hasDuplicate ) { while ( (elem = results[i++]) ) { if ( elem === results[ i ] ) { j = duplicates.push( i ); } } while ( j-- ) { results.splice( duplicates[ j ], 1 ); } } // Clear input after sorting to release objects // See https://github.com/jquery/sizzle/pull/225 sortInput = null; return results; }; /** * Utility function for retrieving the text value of an array of DOM nodes * @param {Array|Element} elem */ getText = Sizzle.getText = function( elem ) { var node, ret = "", i = 0, nodeType = elem.nodeType; if ( !nodeType ) { // If no nodeType, this is expected to be an array while ( (node = elem[i++]) ) { // Do not traverse comment nodes ret += getText( node ); } } else if ( nodeType === 1 || nodeType === 9 || nodeType === 11 ) { // Use textContent for elements // innerText usage removed for consistency of new lines (jQuery #11153) if ( typeof elem.textContent === "string" ) { return elem.textContent; } else { // Traverse its children for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) { ret += getText( elem ); } } } else if ( nodeType === 3 || nodeType === 4 ) { return elem.nodeValue; } // Do not include comment or processing instruction nodes return ret; }; Expr = Sizzle.selectors = { // Can be adjusted by the user cacheLength: 50, createPseudo: markFunction, match: matchExpr, attrHandle: {}, find: {}, relative: { ">": { dir: "parentNode", first: true }, " ": { dir: "parentNode" }, "+": { dir: "previousSibling", first: true }, "~": { dir: "previousSibling" } }, preFilter: { "ATTR": function( match ) { match[1] = match[1].replace( runescape, funescape ); // Move the given value to match[3] whether quoted or unquoted match[3] = ( match[3] || match[4] || match[5] || "" ).replace( runescape, funescape ); if ( match[2] === "~=" ) { match[3] = " " + match[3] + " "; } return match.slice( 0, 4 ); }, "CHILD": function( match ) { /* matches from matchExpr["CHILD"] 1 type (only|nth|...) 2 what (child|of-type) 3 argument (even|odd|\d*|\d*n([+-]\d+)?|...) 4 xn-component of xn+y argument ([+-]?\d*n|) 5 sign of xn-component 6 x of xn-component 7 sign of y-component 8 y of y-component */ match[1] = match[1].toLowerCase(); if ( match[1].slice( 0, 3 ) === "nth" ) { // nth-* requires argument if ( !match[3] ) { Sizzle.error( match[0] ); } // numeric x and y parameters for Expr.filter.CHILD // remember that false/true cast respectively to 0/1 match[4] = +( match[4] ? match[5] + (match[6] || 1) : 2 * ( match[3] === "even" || match[3] === "odd" ) ); match[5] = +( ( match[7] + match[8] ) || match[3] === "odd" ); // other types prohibit arguments } else if ( match[3] ) { Sizzle.error( match[0] ); } return match; }, "PSEUDO": function( match ) { var excess, unquoted = !match[6] && match[2]; if ( matchExpr["CHILD"].test( match[0] ) ) { return null; } // Accept quoted arguments as-is if ( match[3] ) { match[2] = match[4] || match[5] || ""; // Strip excess characters from unquoted arguments } else if ( unquoted && rpseudo.test( unquoted ) && // Get excess from tokenize (recursively) (excess = tokenize( unquoted, true )) && // advance to the next closing parenthesis (excess = unquoted.indexOf( ")", unquoted.length - excess ) - unquoted.length) ) { // excess is a negative index match[0] = match[0].slice( 0, excess ); match[2] = unquoted.slice( 0, excess ); } // Return only captures needed by the pseudo filter method (type and argument) return match.slice( 0, 3 ); } }, filter: { "TAG": function( nodeNameSelector ) { var nodeName = nodeNameSelector.replace( runescape, funescape ).toLowerCase(); return nodeNameSelector === "*" ? function() { return true; } : function( elem ) { return elem.nodeName && elem.nodeName.toLowerCase() === nodeName; }; }, "CLASS": function( className ) { var pattern = classCache[ className + " " ]; return pattern || (pattern = new RegExp( "(^|" + whitespace + ")" + className + "(" + whitespace + "|$)" )) && classCache( className, function( elem ) { return pattern.test( typeof elem.className === "string" && elem.className || typeof elem.getAttribute !== "undefined" && elem.getAttribute("class") || "" ); }); }, "ATTR": function( name, operator, check ) { return function( elem ) { var result = Sizzle.attr( elem, name ); if ( result == null ) { return operator === "!="; } if ( !operator ) { return true; } result += ""; return operator === "=" ? result === check : operator === "!=" ? result !== check : operator === "^=" ? check && result.indexOf( check ) === 0 : operator === "*=" ? check && result.indexOf( check ) > -1 : operator === "$=" ? check && result.slice( -check.length ) === check : operator === "~=" ? ( " " + result.replace( rwhitespace, " " ) + " " ).indexOf( check ) > -1 : operator === "|=" ? result === check || result.slice( 0, check.length + 1 ) === check + "-" : false; }; }, "CHILD": function( type, what, argument, first, last ) { var simple = type.slice( 0, 3 ) !== "nth", forward = type.slice( -4 ) !== "last", ofType = what === "of-type"; return first === 1 && last === 0 ? // Shortcut for :nth-*(n) function( elem ) { return !!elem.parentNode; } : function( elem, context, xml ) { var cache, uniqueCache, outerCache, node, nodeIndex, start, dir = simple !== forward ? "nextSibling" : "previousSibling", parent = elem.parentNode, name = ofType && elem.nodeName.toLowerCase(), useCache = !xml && !ofType, diff = false; if ( parent ) { // :(first|last|only)-(child|of-type) if ( simple ) { while ( dir ) { node = elem; while ( (node = node[ dir ]) ) { if ( ofType ? node.nodeName.toLowerCase() === name : node.nodeType === 1 ) { return false; } } // Reverse direction for :only-* (if we haven't yet done so) start = dir = type === "only" && !start && "nextSibling"; } return true; } start = [ forward ? parent.firstChild : parent.lastChild ]; // non-xml :nth-child(...) stores cache data on `parent` if ( forward && useCache ) { // Seek `elem` from a previously-cached index // ...in a gzip-friendly way node = parent; outerCache = node[ expando ] || (node[ expando ] = {}); // Support: IE <9 only // Defend against cloned attroperties (jQuery gh-1709) uniqueCache = outerCache[ node.uniqueID ] || (outerCache[ node.uniqueID ] = {}); cache = uniqueCache[ type ] || []; nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ]; diff = nodeIndex && cache[ 2 ]; node = nodeIndex && parent.childNodes[ nodeIndex ]; while ( (node = ++nodeIndex && node && node[ dir ] || // Fallback to seeking `elem` from the start (diff = nodeIndex = 0) || start.pop()) ) { // When found, cache indexes on `parent` and break if ( node.nodeType === 1 && ++diff && node === elem ) { uniqueCache[ type ] = [ dirruns, nodeIndex, diff ]; break; } } } else { // Use previously-cached element index if available if ( useCache ) { // ...in a gzip-friendly way node = elem; outerCache = node[ expando ] || (node[ expando ] = {}); // Support: IE <9 only // Defend against cloned attroperties (jQuery gh-1709) uniqueCache = outerCache[ node.uniqueID ] || (outerCache[ node.uniqueID ] = {}); cache = uniqueCache[ type ] || []; nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ]; diff = nodeIndex; } // xml :nth-child(...) // or :nth-last-child(...) or :nth(-last)?-of-type(...) if ( diff === false ) { // Use the same loop as above to seek `elem` from the start while ( (node = ++nodeIndex && node && node[ dir ] || (diff = nodeIndex = 0) || start.pop()) ) { if ( ( ofType ? node.nodeName.toLowerCase() === name : node.nodeType === 1 ) && ++diff ) { // Cache the index of each encountered element if ( useCache ) { outerCache = node[ expando ] || (node[ expando ] = {}); // Support: IE <9 only // Defend against cloned attroperties (jQuery gh-1709) uniqueCache = outerCache[ node.uniqueID ] || (outerCache[ node.uniqueID ] = {}); uniqueCache[ type ] = [ dirruns, diff ]; } if ( node === elem ) { break; } } } } } // Incorporate the offset, then check against cycle size diff -= last; return diff === first || ( diff % first === 0 && diff / first >= 0 ); } }; }, "PSEUDO": function( pseudo, argument ) { // pseudo-class names are case-insensitive // http://www.w3.org/TR/selectors/#pseudo-classes // Prioritize by case sensitivity in case custom pseudos are added with uppercase letters // Remember that setFilters inherits from pseudos var args, fn = Expr.pseudos[ pseudo ] || Expr.setFilters[ pseudo.toLowerCase() ] || Sizzle.error( "unsupported pseudo: " + pseudo ); // The user may use createPseudo to indicate that // arguments are needed to create the filter function // just as Sizzle does if ( fn[ expando ] ) { return fn( argument ); } // But maintain support for old signatures if ( fn.length > 1 ) { args = [ pseudo, pseudo, "", argument ]; return Expr.setFilters.hasOwnProperty( pseudo.toLowerCase() ) ? markFunction(function( seed, matches ) { var idx, matched = fn( seed, argument ), i = matched.length; while ( i-- ) { idx = indexOf( seed, matched[i] ); seed[ idx ] = !( matches[ idx ] = matched[i] ); } }) : function( elem ) { return fn( elem, 0, args ); }; } return fn; } }, pseudos: { // Potentially complex pseudos "not": markFunction(function( selector ) { // Trim the selector passed to compile // to avoid treating leading and trailing // spaces as combinators var input = [], results = [], matcher = compile( selector.replace( rtrim, "$1" ) ); return matcher[ expando ] ? markFunction(function( seed, matches, context, xml ) { var elem, unmatched = matcher( seed, null, xml, [] ), i = seed.length; // Match elements unmatched by `matcher` while ( i-- ) { if ( (elem = unmatched[i]) ) { seed[i] = !(matches[i] = elem); } } }) : function( elem, context, xml ) { input[0] = elem; matcher( input, null, xml, results ); // Don't keep the element (issue #299) input[0] = null; return !results.pop(); }; }), "has": markFunction(function( selector ) { return function( elem ) { return Sizzle( selector, elem ).length > 0; }; }), "contains": markFunction(function( text ) { text = text.replace( runescape, funescape ); return function( elem ) { return ( elem.textContent || elem.innerText || getText( elem ) ).indexOf( text ) > -1; }; }), // "Whether an element is represented by a :lang() selector // is based solely on the element's language value // being equal to the identifier C, // or beginning with the identifier C immediately followed by "-". // The matching of C against the element's language value is performed case-insensitively. // The identifier C does not have to be a valid language name." // http://www.w3.org/TR/selectors/#lang-pseudo "lang": markFunction( function( lang ) { // lang value must be a valid identifier if ( !ridentifier.test(lang || "") ) { Sizzle.error( "unsupported lang: " + lang ); } lang = lang.replace( runescape, funescape ).toLowerCase(); return function( elem ) { var elemLang; do { if ( (elemLang = documentIsHTML ? elem.lang : elem.getAttribute("xml:lang") || elem.getAttribute("lang")) ) { elemLang = elemLang.toLowerCase(); return elemLang === lang || elemLang.indexOf( lang + "-" ) === 0; } } while ( (elem = elem.parentNode) && elem.nodeType === 1 ); return false; }; }), // Miscellaneous "target": function( elem ) { var hash = window.location && window.location.hash; return hash && hash.slice( 1 ) === elem.id; }, "root": function( elem ) { return elem === docElem; }, "focus": function( elem ) { return elem === document.activeElement && (!document.hasFocus || document.hasFocus()) && !!(elem.type || elem.href || ~elem.tabIndex); }, // Boolean properties "enabled": createDisabledPseudo( false ), "disabled": createDisabledPseudo( true ), "checked": function( elem ) { // In CSS3, :checked should return both checked and selected elements // http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked var nodeName = elem.nodeName.toLowerCase(); return (nodeName === "input" && !!elem.checked) || (nodeName === "option" && !!elem.selected); }, "selected": function( elem ) { // Accessing this property makes selected-by-default // options in Safari work properly if ( elem.parentNode ) { elem.parentNode.selectedIndex; } return elem.selected === true; }, // Contents "empty": function( elem ) { // http://www.w3.org/TR/selectors/#empty-pseudo // :empty is negated by element (1) or content nodes (text: 3; cdata: 4; entity ref: 5), // but not by others (comment: 8; processing instruction: 7; etc.) // nodeType < 6 works because attributes (2) do not appear as children for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) { if ( elem.nodeType < 6 ) { return false; } } return true; }, "parent": function( elem ) { return !Expr.pseudos["empty"]( elem ); }, // Element/input types "header": function( elem ) { return rheader.test( elem.nodeName ); }, "input": function( elem ) { return rinputs.test( elem.nodeName ); }, "button": function( elem ) { var name = elem.nodeName.toLowerCase(); return name === "input" && elem.type === "button" || name === "button"; }, "text": function( elem ) { var attr; return elem.nodeName.toLowerCase() === "input" && elem.type === "text" && // Support: IE<8 // New HTML5 attribute values (e.g., "search") appear with elem.type === "text" ( (attr = elem.getAttribute("type")) == null || attr.toLowerCase() === "text" ); }, // Position-in-collection "first": createPositionalPseudo(function() { return [ 0 ]; }), "last": createPositionalPseudo(function( matchIndexes, length ) { return [ length - 1 ]; }), "eq": createPositionalPseudo(function( matchIndexes, length, argument ) { return [ argument < 0 ? argument + length : argument ]; }), "even": createPositionalPseudo(function( matchIndexes, length ) { var i = 0; for ( ; i < length; i += 2 ) { matchIndexes.push( i ); } return matchIndexes; }), "odd": createPositionalPseudo(function( matchIndexes, length ) { var i = 1; for ( ; i < length; i += 2 ) { matchIndexes.push( i ); } return matchIndexes; }), "lt": createPositionalPseudo(function( matchIndexes, length, argument ) { var i = argument < 0 ? argument + length : argument; for ( ; --i >= 0; ) { matchIndexes.push( i ); } return matchIndexes; }), "gt": createPositionalPseudo(function( matchIndexes, length, argument ) { var i = argument < 0 ? argument + length : argument; for ( ; ++i < length; ) { matchIndexes.push( i ); } return matchIndexes; }) } }; Expr.pseudos["nth"] = Expr.pseudos["eq"]; // Add button/input type pseudos for ( i in { radio: true, checkbox: true, file: true, password: true, image: true } ) { Expr.pseudos[ i ] = createInputPseudo( i ); } for ( i in { submit: true, reset: true } ) { Expr.pseudos[ i ] = createButtonPseudo( i ); } // Easy API for creating new setFilters function setFilters() {} setFilters.prototype = Expr.filters = Expr.pseudos; Expr.setFilters = new setFilters(); tokenize = Sizzle.tokenize = function( selector, parseOnly ) { var matched, match, tokens, type, soFar, groups, preFilters, cached = tokenCache[ selector + " " ]; if ( cached ) { return parseOnly ? 0 : cached.slice( 0 ); } soFar = selector; groups = []; preFilters = Expr.preFilter; while ( soFar ) { // Comma and first run if ( !matched || (match = rcomma.exec( soFar )) ) { if ( match ) { // Don't consume trailing commas as valid soFar = soFar.slice( match[0].length ) || soFar; } groups.push( (tokens = []) ); } matched = false; // Combinators if ( (match = rcombinators.exec( soFar )) ) { matched = match.shift(); tokens.push({ value: matched, // Cast descendant combinators to space type: match[0].replace( rtrim, " " ) }); soFar = soFar.slice( matched.length ); } // Filters for ( type in Expr.filter ) { if ( (match = matchExpr[ type ].exec( soFar )) && (!preFilters[ type ] || (match = preFilters[ type ]( match ))) ) { matched = match.shift(); tokens.push({ value: matched, type: type, matches: match }); soFar = soFar.slice( matched.length ); } } if ( !matched ) { break; } } // Return the length of the invalid excess // if we're just parsing // Otherwise, throw an error or return tokens return parseOnly ? soFar.length : soFar ? Sizzle.error( selector ) : // Cache the tokens tokenCache( selector, groups ).slice( 0 ); }; function toSelector( tokens ) { var i = 0, len = tokens.length, selector = ""; for ( ; i < len; i++ ) { selector += tokens[i].value; } return selector; } function addCombinator( matcher, combinator, base ) { var dir = combinator.dir, skip = combinator.next, key = skip || dir, checkNonElements = base && key === "parentNode", doneName = done++; return combinator.first ? // Check against closest ancestor/preceding element function( elem, context, xml ) { while ( (elem = elem[ dir ]) ) { if ( elem.nodeType === 1 || checkNonElements ) { return matcher( elem, context, xml ); } } return false; } : // Check against all ancestor/preceding elements function( elem, context, xml ) { var oldCache, uniqueCache, outerCache, newCache = [ dirruns, doneName ]; // We can't set arbitrary data on XML nodes, so they don't benefit from combinator caching if ( xml ) { while ( (elem = elem[ dir ]) ) { if ( elem.nodeType === 1 || checkNonElements ) { if ( matcher( elem, context, xml ) ) { return true; } } } } else { while ( (elem = elem[ dir ]) ) { if ( elem.nodeType === 1 || checkNonElements ) { outerCache = elem[ expando ] || (elem[ expando ] = {}); // Support: IE <9 only // Defend against cloned attroperties (jQuery gh-1709) uniqueCache = outerCache[ elem.uniqueID ] || (outerCache[ elem.uniqueID ] = {}); if ( skip && skip === elem.nodeName.toLowerCase() ) { elem = elem[ dir ] || elem; } else if ( (oldCache = uniqueCache[ key ]) && oldCache[ 0 ] === dirruns && oldCache[ 1 ] === doneName ) { // Assign to newCache so results back-propagate to previous elements return (newCache[ 2 ] = oldCache[ 2 ]); } else { // Reuse newcache so results back-propagate to previous elements uniqueCache[ key ] = newCache; // A match means we're done; a fail means we have to keep checking if ( (newCache[ 2 ] = matcher( elem, context, xml )) ) { return true; } } } } } return false; }; } function elementMatcher( matchers ) { return matchers.length > 1 ? function( elem, context, xml ) { var i = matchers.length; while ( i-- ) { if ( !matchers[i]( elem, context, xml ) ) { return false; } } return true; } : matchers[0]; } function multipleContexts( selector, contexts, results ) { var i = 0, len = contexts.length; for ( ; i < len; i++ ) { Sizzle( selector, contexts[i], results ); } return results; } function condense( unmatched, map, filter, context, xml ) { var elem, newUnmatched = [], i = 0, len = unmatched.length, mapped = map != null; for ( ; i < len; i++ ) { if ( (elem = unmatched[i]) ) { if ( !filter || filter( elem, context, xml ) ) { newUnmatched.push( elem ); if ( mapped ) { map.push( i ); } } } } return newUnmatched; } function setMatcher( preFilter, selector, matcher, postFilter, postFinder, postSelector ) { if ( postFilter && !postFilter[ expando ] ) { postFilter = setMatcher( postFilter ); } if ( postFinder && !postFinder[ expando ] ) { postFinder = setMatcher( postFinder, postSelector ); } return markFunction(function( seed, results, context, xml ) { var temp, i, elem, preMap = [], postMap = [], preexisting = results.length, // Get initial elements from seed or context elems = seed || multipleContexts( selector || "*", context.nodeType ? [ context ] : context, [] ), // Prefilter to get matcher input, preserving a map for seed-results synchronization matcherIn = preFilter && ( seed || !selector ) ? condense( elems, preMap, preFilter, context, xml ) : elems, matcherOut = matcher ? // If we have a postFinder, or filtered seed, or non-seed postFilter or preexisting results, postFinder || ( seed ? preFilter : preexisting || postFilter ) ? // ...intermediate processing is necessary [] : // ...otherwise use results directly results : matcherIn; // Find primary matches if ( matcher ) { matcher( matcherIn, matcherOut, context, xml ); } // Apply postFilter if ( postFilter ) { temp = condense( matcherOut, postMap ); postFilter( temp, [], context, xml ); // Un-match failing elements by moving them back to matcherIn i = temp.length; while ( i-- ) { if ( (elem = temp[i]) ) { matcherOut[ postMap[i] ] = !(matcherIn[ postMap[i] ] = elem); } } } if ( seed ) { if ( postFinder || preFilter ) { if ( postFinder ) { // Get the final matcherOut by condensing this intermediate into postFinder contexts temp = []; i = matcherOut.length; while ( i-- ) { if ( (elem = matcherOut[i]) ) { // Restore matcherIn since elem is not yet a final match temp.push( (matcherIn[i] = elem) ); } } postFinder( null, (matcherOut = []), temp, xml ); } // Move matched elements from seed to results to keep them synchronized i = matcherOut.length; while ( i-- ) { if ( (elem = matcherOut[i]) && (temp = postFinder ? indexOf( seed, elem ) : preMap[i]) > -1 ) { seed[temp] = !(results[temp] = elem); } } } // Add elements to results, through postFinder if defined } else { matcherOut = condense( matcherOut === results ? matcherOut.splice( preexisting, matcherOut.length ) : matcherOut ); if ( postFinder ) { postFinder( null, results, matcherOut, xml ); } else { push.apply( results, matcherOut ); } } }); } function matcherFromTokens( tokens ) { var checkContext, matcher, j, len = tokens.length, leadingRelative = Expr.relative[ tokens[0].type ], implicitRelative = leadingRelative || Expr.relative[" "], i = leadingRelative ? 1 : 0, // The foundational matcher ensures that elements are reachable from top-level context(s) matchContext = addCombinator( function( elem ) { return elem === checkContext; }, implicitRelative, true ), matchAnyContext = addCombinator( function( elem ) { return indexOf( checkContext, elem ) > -1; }, implicitRelative, true ), matchers = [ function( elem, context, xml ) { var ret = ( !leadingRelative && ( xml || context !== outermostContext ) ) || ( (checkContext = context).nodeType ? matchContext( elem, context, xml ) : matchAnyContext( elem, context, xml ) ); // Avoid hanging onto element (issue #299) checkContext = null; return ret; } ]; for ( ; i < len; i++ ) { if ( (matcher = Expr.relative[ tokens[i].type ]) ) { matchers = [ addCombinator(elementMatcher( matchers ), matcher) ]; } else { matcher = Expr.filter[ tokens[i].type ].apply( null, tokens[i].matches ); // Return special upon seeing a positional matcher if ( matcher[ expando ] ) { // Find the next relative operator (if any) for proper handling j = ++i; for ( ; j < len; j++ ) { if ( Expr.relative[ tokens[j].type ] ) { break; } } return setMatcher( i > 1 && elementMatcher( matchers ), i > 1 && toSelector( // If the preceding token was a descendant combinator, insert an implicit any-element `*` tokens.slice( 0, i - 1 ).concat({ value: tokens[ i - 2 ].type === " " ? "*" : "" }) ).replace( rtrim, "$1" ), matcher, i < j && matcherFromTokens( tokens.slice( i, j ) ), j < len && matcherFromTokens( (tokens = tokens.slice( j )) ), j < len && toSelector( tokens ) ); } matchers.push( matcher ); } } return elementMatcher( matchers ); } function matcherFromGroupMatchers( elementMatchers, setMatchers ) { var bySet = setMatchers.length > 0, byElement = elementMatchers.length > 0, superMatcher = function( seed, context, xml, results, outermost ) { var elem, j, matcher, matchedCount = 0, i = "0", unmatched = seed && [], setMatched = [], contextBackup = outermostContext, // We must always have either seed elements or outermost context elems = seed || byElement && Expr.find["TAG"]( "*", outermost ), // Use integer dirruns iff this is the outermost matcher dirrunsUnique = (dirruns += contextBackup == null ? 1 : Math.random() || 0.1), len = elems.length; if ( outermost ) { outermostContext = context === document || context || outermost; } // Add elements passing elementMatchers directly to results // Support: IE<9, Safari // Tolerate NodeList properties (IE: "length"; Safari: <number>) matching elements by id for ( ; i !== len && (elem = elems[i]) != null; i++ ) { if ( byElement && elem ) { j = 0; if ( !context && elem.ownerDocument !== document ) { setDocument( elem ); xml = !documentIsHTML; } while ( (matcher = elementMatchers[j++]) ) { if ( matcher( elem, context || document, xml) ) { results.push( elem ); break; } } if ( outermost ) { dirruns = dirrunsUnique; } } // Track unmatched elements for set filters if ( bySet ) { // They will have gone through all possible matchers if ( (elem = !matcher && elem) ) { matchedCount--; } // Lengthen the array for every element, matched or not if ( seed ) { unmatched.push( elem ); } } } // `i` is now the count of elements visited above, and adding it to `matchedCount` // makes the latter nonnegative. matchedCount += i; // Apply set filters to unmatched elements // NOTE: This can be skipped if there are no unmatched elements (i.e., `matchedCount` // equals `i`), unless we didn't visit _any_ elements in the above loop because we have // no element matchers and no seed. // Incrementing an initially-string "0" `i` allows `i` to remain a string only in that // case, which will result in a "00" `matchedCount` that differs from `i` but is also // numerically zero. if ( bySet && i !== matchedCount ) { j = 0; while ( (matcher = setMatchers[j++]) ) { matcher( unmatched, setMatched, context, xml ); } if ( seed ) { // Reintegrate element matches to eliminate the need for sorting if ( matchedCount > 0 ) { while ( i-- ) { if ( !(unmatched[i] || setMatched[i]) ) { setMatched[i] = pop.call( results ); } } } // Discard index placeholder values to get only actual matches setMatched = condense( setMatched ); } // Add matches to results push.apply( results, setMatched ); // Seedless set matches succeeding multiple successful matchers stipulate sorting if ( outermost && !seed && setMatched.length > 0 && ( matchedCount + setMatchers.length ) > 1 ) { Sizzle.uniqueSort( results ); } } // Override manipulation of globals by nested matchers if ( outermost ) { dirruns = dirrunsUnique; outermostContext = contextBackup; } return unmatched; }; return bySet ? markFunction( superMatcher ) : superMatcher; } compile = Sizzle.compile = function( selector, match /* Internal Use Only */ ) { var i, setMatchers = [], elementMatchers = [], cached = compilerCache[ selector + " " ]; if ( !cached ) { // Generate a function of recursive functions that can be used to check each element if ( !match ) { match = tokenize( selector ); } i = match.length; while ( i-- ) { cached = matcherFromTokens( match[i] ); if ( cached[ expando ] ) { setMatchers.push( cached ); } else { elementMatchers.push( cached ); } } // Cache the compiled function cached = compilerCache( selector, matcherFromGroupMatchers( elementMatchers, setMatchers ) ); // Save selector and tokenization cached.selector = selector; } return cached; }; /** * A low-level selection function that works with Sizzle's compiled * selector functions * @param {String|Function} selector A selector or a pre-compiled * selector function built with Sizzle.compile * @param {Element} context * @param {Array} [results] * @param {Array} [seed] A set of elements to match against */ select = Sizzle.select = function( selector, context, results, seed ) { var i, tokens, token, type, find, compiled = typeof selector === "function" && selector, match = !seed && tokenize( (selector = compiled.selector || selector) ); results = results || []; // Try to minimize operations if there is only one selector in the list and no seed // (the latter of which guarantees us context) if ( match.length === 1 ) { // Reduce context if the leading compound selector is an ID tokens = match[0] = match[0].slice( 0 ); if ( tokens.length > 2 && (token = tokens[0]).type === "ID" && context.nodeType === 9 && documentIsHTML && Expr.relative[ tokens[1].type ] ) { context = ( Expr.find["ID"]( token.matches[0].replace(runescape, funescape), context ) || [] )[0]; if ( !context ) { return results; // Precompiled matchers will still verify ancestry, so step up a level } else if ( compiled ) { context = context.parentNode; } selector = selector.slice( tokens.shift().value.length ); } // Fetch a seed set for right-to-left matching i = matchExpr["needsContext"].test( selector ) ? 0 : tokens.length; while ( i-- ) { token = tokens[i]; // Abort if we hit a combinator if ( Expr.relative[ (type = token.type) ] ) { break; } if ( (find = Expr.find[ type ]) ) { // Search, expanding context for leading sibling combinators if ( (seed = find( token.matches[0].replace( runescape, funescape ), rsibling.test( tokens[0].type ) && testContext( context.parentNode ) || context )) ) { // If seed is empty or no tokens remain, we can return early tokens.splice( i, 1 ); selector = seed.length && toSelector( tokens ); if ( !selector ) { push.apply( results, seed ); return results; } break; } } } } // Compile and execute a filtering function if one is not provided // Provide `match` to avoid retokenization if we modified the selector above ( compiled || compile( selector, match ) )( seed, context, !documentIsHTML, results, !context || rsibling.test( selector ) && testContext( context.parentNode ) || context ); return results; }; // One-time assignments // Sort stability support.sortStable = expando.split("").sort( sortOrder ).join("") === expando; // Support: Chrome 14-35+ // Always assume duplicates if they aren't passed to the comparison function support.detectDuplicates = !!hasDuplicate; // Initialize against the default document setDocument(); // Support: Webkit<537.32 - Safari 6.0.3/Chrome 25 (fixed in Chrome 27) // Detached nodes confoundingly follow *each other* support.sortDetached = assert(function( el ) { // Should return 1, but returns 4 (following) return el.compareDocumentPosition( document.createElement("fieldset") ) & 1; }); // Support: IE<8 // Prevent attribute/property "interpolation" // https://msdn.microsoft.com/en-us/library/ms536429%28VS.85%29.aspx if ( !assert(function( el ) { el.innerHTML = "<a href='#'></a>"; return el.firstChild.getAttribute("href") === "#" ; }) ) { addHandle( "type|href|height|width", function( elem, name, isXML ) { if ( !isXML ) { return elem.getAttribute( name, name.toLowerCase() === "type" ? 1 : 2 ); } }); } // Support: IE<9 // Use defaultValue in place of getAttribute("value") if ( !support.attributes || !assert(function( el ) { el.innerHTML = "<input/>"; el.firstChild.setAttribute( "value", "" ); return el.firstChild.getAttribute( "value" ) === ""; }) ) { addHandle( "value", function( elem, name, isXML ) { if ( !isXML && elem.nodeName.toLowerCase() === "input" ) { return elem.defaultValue; } }); } // Support: IE<9 // Use getAttributeNode to fetch booleans when getAttribute lies if ( !assert(function( el ) { return el.getAttribute("disabled") == null; }) ) { addHandle( booleans, function( elem, name, isXML ) { var val; if ( !isXML ) { return elem[ name ] === true ? name.toLowerCase() : (val = elem.getAttributeNode( name )) && val.specified ? val.value : null; } }); } return Sizzle; })( window ); jQuery.find = Sizzle; jQuery.expr = Sizzle.selectors; // Deprecated jQuery.expr[ ":" ] = jQuery.expr.pseudos; jQuery.uniqueSort = jQuery.unique = Sizzle.uniqueSort; jQuery.text = Sizzle.getText; jQuery.isXMLDoc = Sizzle.isXML; jQuery.contains = Sizzle.contains; jQuery.escapeSelector = Sizzle.escape; var dir = function( elem, dir, until ) { var matched = [], truncate = until !== undefined; while ( ( elem = elem[ dir ] ) && elem.nodeType !== 9 ) { if ( elem.nodeType === 1 ) { if ( truncate && jQuery( elem ).is( until ) ) { break; } matched.push( elem ); } } return matched; }; var siblings = function( n, elem ) { var matched = []; for ( ; n; n = n.nextSibling ) { if ( n.nodeType === 1 && n !== elem ) { matched.push( n ); } } return matched; }; var rneedsContext = jQuery.expr.match.needsContext; function nodeName( elem, name ) { return elem.nodeName && elem.nodeName.toLowerCase() === name.toLowerCase(); }; var rsingleTag = ( /^<([a-z][^\/\0>:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i ); var risSimple = /^.[^:#\[\.,]*$/; // Implement the identical functionality for filter and not function winnow( elements, qualifier, not ) { if ( jQuery.isFunction( qualifier ) ) { return jQuery.grep( elements, function( elem, i ) { return !!qualifier.call( elem, i, elem ) !== not; } ); } // Single element if ( qualifier.nodeType ) { return jQuery.grep( elements, function( elem ) { return ( elem === qualifier ) !== not; } ); } // Arraylike of elements (jQuery, arguments, Array) if ( typeof qualifier !== "string" ) { return jQuery.grep( elements, function( elem ) { return ( indexOf.call( qualifier, elem ) > -1 ) !== not; } ); } // Simple selector that can be filtered directly, removing non-Elements if ( risSimple.test( qualifier ) ) { return jQuery.filter( qualifier, elements, not ); } // Complex selector, compare the two sets, removing non-Elements qualifier = jQuery.filter( qualifier, elements ); return jQuery.grep( elements, function( elem ) { return ( indexOf.call( qualifier, elem ) > -1 ) !== not && elem.nodeType === 1; } ); } jQuery.filter = function( expr, elems, not ) { var elem = elems[ 0 ]; if ( not ) { expr = ":not(" + expr + ")"; } if ( elems.length === 1 && elem.nodeType === 1 ) { return jQuery.find.matchesSelector( elem, expr ) ? [ elem ] : []; } return jQuery.find.matches( expr, jQuery.grep( elems, function( elem ) { return elem.nodeType === 1; } ) ); }; jQuery.fn.extend( { find: function( selector ) { var i, ret, len = this.length, self = this; if ( typeof selector !== "string" ) { return this.pushStack( jQuery( selector ).filter( function() { for ( i = 0; i < len; i++ ) { if ( jQuery.contains( self[ i ], this ) ) { return true; } } } ) ); } ret = this.pushStack( [] ); for ( i = 0; i < len; i++ ) { jQuery.find( selector, self[ i ], ret ); } return len > 1 ? jQuery.uniqueSort( ret ) : ret; }, filter: function( selector ) { return this.pushStack( winnow( this, selector || [], false ) ); }, not: function( selector ) { return this.pushStack( winnow( this, selector || [], true ) ); }, is: function( selector ) { return !!winnow( this, // If this is a positional/relative selector, check membership in the returned set // so $("p:first").is("p:last") won't return true for a doc with two "p". typeof selector === "string" && rneedsContext.test( selector ) ? jQuery( selector ) : selector || [], false ).length; } } ); // Initialize a jQuery object // A central reference to the root jQuery(document) var rootjQuery, // A simple way to check for HTML strings // Prioritize #id over <tag> to avoid XSS via location.hash (#9521) // Strict HTML recognition (#11290: must start with <) // Shortcut simple #id case for speed rquickExpr = /^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]+))$/, init = jQuery.fn.init = function( selector, context, root ) { var match, elem; // HANDLE: $(""), $(null), $(undefined), $(false) if ( !selector ) { return this; } // Method init() accepts an alternate rootjQuery // so migrate can support jQuery.sub (gh-2101) root = root || rootjQuery; // Handle HTML strings if ( typeof selector === "string" ) { if ( selector[ 0 ] === "<" && selector[ selector.length - 1 ] === ">" && selector.length >= 3 ) { // Assume that strings that start and end with <> are HTML and skip the regex check match = [ null, selector, null ]; } else { match = rquickExpr.exec( selector ); } // Match html or make sure no context is specified for #id if ( match && ( match[ 1 ] || !context ) ) { // HANDLE: $(html) -> $(array) if ( match[ 1 ] ) { context = context instanceof jQuery ? context[ 0 ] : context; // Option to run scripts is true for back-compat // Intentionally let the error be thrown if parseHTML is not present jQuery.merge( this, jQuery.parseHTML( match[ 1 ], context && context.nodeType ? context.ownerDocument || context : document, true ) ); // HANDLE: $(html, props) if ( rsingleTag.test( match[ 1 ] ) && jQuery.isPlainObject( context ) ) { for ( match in context ) { // Properties of context are called as methods if possible if ( jQuery.isFunction( this[ match ] ) ) { this[ match ]( context[ match ] ); // ...and otherwise set as attributes } else { this.attr( match, context[ match ] ); } } } return this; // HANDLE: $(#id) } else { elem = document.getElementById( match[ 2 ] ); if ( elem ) { // Inject the element directly into the jQuery object this[ 0 ] = elem; this.length = 1; } return this; } // HANDLE: $(expr, $(...)) } else if ( !context || context.jquery ) { return ( context || root ).find( selector ); // HANDLE: $(expr, context) // (which is just equivalent to: $(context).find(expr) } else { return this.constructor( context ).find( selector ); } // HANDLE: $(DOMElement) } else if ( selector.nodeType ) { this[ 0 ] = selector; this.length = 1; return this; // HANDLE: $(function) // Shortcut for document ready } else if ( jQuery.isFunction( selector ) ) { return root.ready !== undefined ? root.ready( selector ) : // Execute immediately if ready is not present selector( jQuery ); } return jQuery.makeArray( selector, this ); }; // Give the init function the jQuery prototype for later instantiation init.prototype = jQuery.fn; // Initialize central reference rootjQuery = jQuery( document ); var rparentsprev = /^(?:parents|prev(?:Until|All))/, // Methods guaranteed to produce a unique set when starting from a unique set guaranteedUnique = { children: true, contents: true, next: true, prev: true }; jQuery.fn.extend( { has: function( target ) { var targets = jQuery( target, this ), l = targets.length; return this.filter( function() { var i = 0; for ( ; i < l; i++ ) { if ( jQuery.contains( this, targets[ i ] ) ) { return true; } } } ); }, closest: function( selectors, context ) { var cur, i = 0, l = this.length, matched = [], targets = typeof selectors !== "string" && jQuery( selectors ); // Positional selectors never match, since there's no _selection_ context if ( !rneedsContext.test( selectors ) ) { for ( ; i < l; i++ ) { for ( cur = this[ i ]; cur && cur !== context; cur = cur.parentNode ) { // Always skip document fragments if ( cur.nodeType < 11 && ( targets ? targets.index( cur ) > -1 : // Don't pass non-elements to Sizzle cur.nodeType === 1 && jQuery.find.matchesSelector( cur, selectors ) ) ) { matched.push( cur ); break; } } } } return this.pushStack( matched.length > 1 ? jQuery.uniqueSort( matched ) : matched ); }, // Determine the position of an element within the set index: function( elem ) { // No argument, return index in parent if ( !elem ) { return ( this[ 0 ] && this[ 0 ].parentNode ) ? this.first().prevAll().length : -1; } // Index in selector if ( typeof elem === "string" ) { return indexOf.call( jQuery( elem ), this[ 0 ] ); } // Locate the position of the desired element return indexOf.call( this, // If it receives a jQuery object, the first element is used elem.jquery ? elem[ 0 ] : elem ); }, add: function( selector, context ) { return this.pushStack( jQuery.uniqueSort( jQuery.merge( this.get(), jQuery( selector, context ) ) ) ); }, addBack: function( selector ) { return this.add( selector == null ? this.prevObject : this.prevObject.filter( selector ) ); } } ); function sibling( cur, dir ) { while ( ( cur = cur[ dir ] ) && cur.nodeType !== 1 ) {} return cur; } jQuery.each( { parent: function( elem ) { var parent = elem.parentNode; return parent && parent.nodeType !== 11 ? parent : null; }, parents: function( elem ) { return dir( elem, "parentNode" ); }, parentsUntil: function( elem, i, until ) { return dir( elem, "parentNode", until ); }, next: function( elem ) { return sibling( elem, "nextSibling" ); }, prev: function( elem ) { return sibling( elem, "previousSibling" ); }, nextAll: function( elem ) { return dir( elem, "nextSibling" ); }, prevAll: function( elem ) { return dir( elem, "previousSibling" ); }, nextUntil: function( elem, i, until ) { return dir( elem, "nextSibling", until ); }, prevUntil: function( elem, i, until ) { return dir( elem, "previousSibling", until ); }, siblings: function( elem ) { return siblings( ( elem.parentNode || {} ).firstChild, elem ); }, children: function( elem ) { return siblings( elem.firstChild ); }, contents: function( elem ) { if ( nodeName( elem, "iframe" ) ) { return elem.contentDocument; } // Support: IE 9 - 11 only, iOS 7 only, Android Browser <=4.3 only // Treat the template element as a regular one in browsers that // don't support it. if ( nodeName( elem, "template" ) ) { elem = elem.content || elem; } return jQuery.merge( [], elem.childNodes ); } }, function( name, fn ) { jQuery.fn[ name ] = function( until, selector ) { var matched = jQuery.map( this, fn, until ); if ( name.slice( -5 ) !== "Until" ) { selector = until; } if ( selector && typeof selector === "string" ) { matched = jQuery.filter( selector, matched ); } if ( this.length > 1 ) { // Remove duplicates if ( !guaranteedUnique[ name ] ) { jQuery.uniqueSort( matched ); } // Reverse order for parents* and prev-derivatives if ( rparentsprev.test( name ) ) { matched.reverse(); } } return this.pushStack( matched ); }; } ); var rnothtmlwhite = ( /[^\x20\t\r\n\f]+/g ); // Convert String-formatted options into Object-formatted ones function createOptions( options ) { var object = {}; jQuery.each( options.match( rnothtmlwhite ) || [], function( _, flag ) { object[ flag ] = true; } ); return object; } /* * Create a callback list using the following parameters: * * options: an optional list of space-separated options that will change how * the callback list behaves or a more traditional option object * * By default a callback list will act like an event callback list and can be * "fired" multiple times. * * Possible options: * * once: will ensure the callback list can only be fired once (like a Deferred) * * memory: will keep track of previous values and will call any callback added * after the list has been fired right away with the latest "memorized" * values (like a Deferred) * * unique: will ensure a callback can only be added once (no duplicate in the list) * * stopOnFalse: interrupt callings when a callback returns false * */ jQuery.Callbacks = function( options ) { // Convert options from String-formatted to Object-formatted if needed // (we check in cache first) options = typeof options === "string" ? createOptions( options ) : jQuery.extend( {}, options ); var // Flag to know if list is currently firing firing, // Last fire value for non-forgettable lists memory, // Flag to know if list was already fired fired, // Flag to prevent firing locked, // Actual callback list list = [], // Queue of execution data for repeatable lists queue = [], // Index of currently firing callback (modified by add/remove as needed) firingIndex = -1, // Fire callbacks fire = function() { // Enforce single-firing locked = locked || options.once; // Execute callbacks for all pending executions, // respecting firingIndex overrides and runtime changes fired = firing = true; for ( ; queue.length; firingIndex = -1 ) { memory = queue.shift(); while ( ++firingIndex < list.length ) { // Run callback and check for early termination if ( list[ firingIndex ].apply( memory[ 0 ], memory[ 1 ] ) === false && options.stopOnFalse ) { // Jump to end and forget the data so .add doesn't re-fire firingIndex = list.length; memory = false; } } } // Forget the data if we're done with it if ( !options.memory ) { memory = false; } firing = false; // Clean up if we're done firing for good if ( locked ) { // Keep an empty list if we have data for future add calls if ( memory ) { list = []; // Otherwise, this object is spent } else { list = ""; } } }, // Actual Callbacks object self = { // Add a callback or a collection of callbacks to the list add: function() { if ( list ) { // If we have memory from a past run, we should fire after adding if ( memory && !firing ) { firingIndex = list.length - 1; queue.push( memory ); } ( function add( args ) { jQuery.each( args, function( _, arg ) { if ( jQuery.isFunction( arg ) ) { if ( !options.unique || !self.has( arg ) ) { list.push( arg ); } } else if ( arg && arg.length && jQuery.type( arg ) !== "string" ) { // Inspect recursively add( arg ); } } ); } )( arguments ); if ( memory && !firing ) { fire(); } } return this; }, // Remove a callback from the list remove: function() { jQuery.each( arguments, function( _, arg ) { var index; while ( ( index = jQuery.inArray( arg, list, index ) ) > -1 ) { list.splice( index, 1 ); // Handle firing indexes if ( index <= firingIndex ) { firingIndex--; } } } ); return this; }, // Check if a given callback is in the list. // If no argument is given, return whether or not list has callbacks attached. has: function( fn ) { return fn ? jQuery.inArray( fn, list ) > -1 : list.length > 0; }, // Remove all callbacks from the list empty: function() { if ( list ) { list = []; } return this; }, // Disable .fire and .add // Abort any current/pending executions // Clear all callbacks and values disable: function() { locked = queue = []; list = memory = ""; return this; }, disabled: function() { return !list; }, // Disable .fire // Also disable .add unless we have memory (since it would have no effect) // Abort any pending executions lock: function() { locked = queue = []; if ( !memory && !firing ) { list = memory = ""; } return this; }, locked: function() { return !!locked; }, // Call all callbacks with the given context and arguments fireWith: function( context, args ) { if ( !locked ) { args = args || []; args = [ context, args.slice ? args.slice() : args ]; queue.push( args ); if ( !firing ) { fire(); } } return this; }, // Call all the callbacks with the given arguments fire: function() { self.fireWith( this, arguments ); return this; }, // To know if the callbacks have already been called at least once fired: function() { return !!fired; } }; return self; }; function Identity( v ) { return v; } function Thrower( ex ) { throw ex; } function adoptValue( value, resolve, reject, noValue ) { var method; try { // Check for promise aspect first to privilege synchronous behavior if ( value && jQuery.isFunction( ( method = value.promise ) ) ) { method.call( value ).done( resolve ).fail( reject ); // Other thenables } else if ( value && jQuery.isFunction( ( method = value.then ) ) ) { method.call( value, resolve, reject ); // Other non-thenables } else { // Control `resolve` arguments by letting Array#slice cast boolean `noValue` to integer: // * false: [ value ].slice( 0 ) => resolve( value ) // * true: [ value ].slice( 1 ) => resolve() resolve.apply( undefined, [ value ].slice( noValue ) ); } // For Promises/A+, convert exceptions into rejections // Since jQuery.when doesn't unwrap thenables, we can skip the extra checks appearing in // Deferred#then to conditionally suppress rejection. } catch ( value ) { // Support: Android 4.0 only // Strict mode functions invoked without .call/.apply get global-object context reject.apply( undefined, [ value ] ); } } jQuery.extend( { Deferred: function( func ) { var tuples = [ // action, add listener, callbacks, // ... .then handlers, argument index, [final state] [ "notify", "progress", jQuery.Callbacks( "memory" ), jQuery.Callbacks( "memory" ), 2 ], [ "resolve", "done", jQuery.Callbacks( "once memory" ), jQuery.Callbacks( "once memory" ), 0, "resolved" ], [ "reject", "fail", jQuery.Callbacks( "once memory" ), jQuery.Callbacks( "once memory" ), 1, "rejected" ] ], state = "pending", promise = { state: function() { return state; }, always: function() { deferred.done( arguments ).fail( arguments ); return this; }, "catch": function( fn ) { return promise.then( null, fn ); }, // Keep pipe for back-compat pipe: function( /* fnDone, fnFail, fnProgress */ ) { var fns = arguments; return jQuery.Deferred( function( newDefer ) { jQuery.each( tuples, function( i, tuple ) { // Map tuples (progress, done, fail) to arguments (done, fail, progress) var fn = jQuery.isFunction( fns[ tuple[ 4 ] ] ) && fns[ tuple[ 4 ] ]; // deferred.progress(function() { bind to newDefer or newDefer.notify }) // deferred.done(function() { bind to newDefer or newDefer.resolve }) // deferred.fail(function() { bind to newDefer or newDefer.reject }) deferred[ tuple[ 1 ] ]( function() { var returned = fn && fn.apply( this, arguments ); if ( returned && jQuery.isFunction( returned.promise ) ) { returned.promise() .progress( newDefer.notify ) .done( newDefer.resolve ) .fail( newDefer.reject ); } else { newDefer[ tuple[ 0 ] + "With" ]( this, fn ? [ returned ] : arguments ); } } ); } ); fns = null; } ).promise(); }, then: function( onFulfilled, onRejected, onProgress ) { var maxDepth = 0; function resolve( depth, deferred, handler, special ) { return function() { var that = this, args = arguments, mightThrow = function() { var returned, then; // Support: Promises/A+ section 2.3.3.3.3 // https://promisesaplus.com/#point-59 // Ignore double-resolution attempts if ( depth < maxDepth ) { return; } returned = handler.apply( that, args ); // Support: Promises/A+ section 2.3.1 // https://promisesaplus.com/#point-48 if ( returned === deferred.promise() ) { throw new TypeError( "Thenable self-resolution" ); } // Support: Promises/A+ sections 2.3.3.1, 3.5 // https://promisesaplus.com/#point-54 // https://promisesaplus.com/#point-75 // Retrieve `then` only once then = returned && // Support: Promises/A+ section 2.3.4 // https://promisesaplus.com/#point-64 // Only check objects and functions for thenability ( typeof returned === "object" || typeof returned === "function" ) && returned.then; // Handle a returned thenable if ( jQuery.isFunction( then ) ) { // Special processors (notify) just wait for resolution if ( special ) { then.call( returned, resolve( maxDepth, deferred, Identity, special ), resolve( maxDepth, deferred, Thrower, special ) ); // Normal processors (resolve) also hook into progress } else { // ...and disregard older resolution values maxDepth++; then.call( returned, resolve( maxDepth, deferred, Identity, special ), resolve( maxDepth, deferred, Thrower, special ), resolve( maxDepth, deferred, Identity, deferred.notifyWith ) ); } // Handle all other returned values } else { // Only substitute handlers pass on context // and multiple values (non-spec behavior) if ( handler !== Identity ) { that = undefined; args = [ returned ]; } // Process the value(s) // Default process is resolve ( special || deferred.resolveWith )( that, args ); } }, // Only normal processors (resolve) catch and reject exceptions process = special ? mightThrow : function() { try { mightThrow(); } catch ( e ) { if ( jQuery.Deferred.exceptionHook ) { jQuery.Deferred.exceptionHook( e, process.stackTrace ); } // Support: Promises/A+ section 2.3.3.3.4.1 // https://promisesaplus.com/#point-61 // Ignore post-resolution exceptions if ( depth + 1 >= maxDepth ) { // Only substitute handlers pass on context // and multiple values (non-spec behavior) if ( handler !== Thrower ) { that = undefined; args = [ e ]; } deferred.rejectWith( that, args ); } } }; // Support: Promises/A+ section 2.3.3.3.1 // https://promisesaplus.com/#point-57 // Re-resolve promises immediately to dodge false rejection from // subsequent errors if ( depth ) { process(); } else { // Call an optional hook to record the stack, in case of exception // since it's otherwise lost when execution goes async if ( jQuery.Deferred.getStackHook ) { process.stackTrace = jQuery.Deferred.getStackHook(); } window.setTimeout( process ); } }; } return jQuery.Deferred( function( newDefer ) { // progress_handlers.add( ... ) tuples[ 0 ][ 3 ].add( resolve( 0, newDefer, jQuery.isFunction( onProgress ) ? onProgress : Identity, newDefer.notifyWith ) ); // fulfilled_handlers.add( ... ) tuples[ 1 ][ 3 ].add( resolve( 0, newDefer, jQuery.isFunction( onFulfilled ) ? onFulfilled : Identity ) ); // rejected_handlers.add( ... ) tuples[ 2 ][ 3 ].add( resolve( 0, newDefer, jQuery.isFunction( onRejected ) ? onRejected : Thrower ) ); } ).promise(); }, // Get a promise for this deferred // If obj is provided, the promise aspect is added to the object promise: function( obj ) { return obj != null ? jQuery.extend( obj, promise ) : promise; } }, deferred = {}; // Add list-specific methods jQuery.each( tuples, function( i, tuple ) { var list = tuple[ 2 ], stateString = tuple[ 5 ]; // promise.progress = list.add // promise.done = list.add // promise.fail = list.add promise[ tuple[ 1 ] ] = list.add; // Handle state if ( stateString ) { list.add( function() { // state = "resolved" (i.e., fulfilled) // state = "rejected" state = stateString; }, // rejected_callbacks.disable // fulfilled_callbacks.disable tuples[ 3 - i ][ 2 ].disable, // progress_callbacks.lock tuples[ 0 ][ 2 ].lock ); } // progress_handlers.fire // fulfilled_handlers.fire // rejected_handlers.fire list.add( tuple[ 3 ].fire ); // deferred.notify = function() { deferred.notifyWith(...) } // deferred.resolve = function() { deferred.resolveWith(...) } // deferred.reject = function() { deferred.rejectWith(...) } deferred[ tuple[ 0 ] ] = function() { deferred[ tuple[ 0 ] + "With" ]( this === deferred ? undefined : this, arguments ); return this; }; // deferred.notifyWith = list.fireWith // deferred.resolveWith = list.fireWith // deferred.rejectWith = list.fireWith deferred[ tuple[ 0 ] + "With" ] = list.fireWith; } ); // Make the deferred a promise promise.promise( deferred ); // Call given func if any if ( func ) { func.call( deferred, deferred ); } // All done! return deferred; }, // Deferred helper when: function( singleValue ) { var // count of uncompleted subordinates remaining = arguments.length, // count of unprocessed arguments i = remaining, // subordinate fulfillment data resolveContexts = Array( i ), resolveValues = slice.call( arguments ), // the master Deferred master = jQuery.Deferred(), // subordinate callback factory updateFunc = function( i ) { return function( value ) { resolveContexts[ i ] = this; resolveValues[ i ] = arguments.length > 1 ? slice.call( arguments ) : value; if ( !( --remaining ) ) { master.resolveWith( resolveContexts, resolveValues ); } }; }; // Single- and empty arguments are adopted like Promise.resolve if ( remaining <= 1 ) { adoptValue( singleValue, master.done( updateFunc( i ) ).resolve, master.reject, !remaining ); // Use .then() to unwrap secondary thenables (cf. gh-3000) if ( master.state() === "pending" || jQuery.isFunction( resolveValues[ i ] && resolveValues[ i ].then ) ) { return master.then(); } } // Multiple arguments are aggregated like Promise.all array elements while ( i-- ) { adoptValue( resolveValues[ i ], updateFunc( i ), master.reject ); } return master.promise(); } } ); // These usually indicate a programmer mistake during development, // warn about them ASAP rather than swallowing them by default. var rerrorNames = /^(Eval|Internal|Range|Reference|Syntax|Type|URI)Error$/; jQuery.Deferred.exceptionHook = function( error, stack ) { // Support: IE 8 - 9 only // Console exists when dev tools are open, which can happen at any time if ( window.console && window.console.warn && error && rerrorNames.test( error.name ) ) { window.console.warn( "jQuery.Deferred exception: " + error.message, error.stack, stack ); } }; jQuery.readyException = function( error ) { window.setTimeout( function() { throw error; } ); }; // The deferred used on DOM ready var readyList = jQuery.Deferred(); jQuery.fn.ready = function( fn ) { readyList .then( fn ) // Wrap jQuery.readyException in a function so that the lookup // happens at the time of error handling instead of callback // registration. .catch( function( error ) { jQuery.readyException( error ); } ); return this; }; jQuery.extend( { // Is the DOM ready to be used? Set to true once it occurs. isReady: false, // A counter to track how many items to wait for before // the ready event fires. See #6781 readyWait: 1, // Handle when the DOM is ready ready: function( wait ) { // Abort if there are pending holds or we're already ready if ( wait === true ? --jQuery.readyWait : jQuery.isReady ) { return; } // Remember that the DOM is ready jQuery.isReady = true; // If a normal DOM Ready event fired, decrement, and wait if need be if ( wait !== true && --jQuery.readyWait > 0 ) { return; } // If there are functions bound, to execute readyList.resolveWith( document, [ jQuery ] ); } } ); jQuery.ready.then = readyList.then; // The ready event handler and self cleanup method function completed() { document.removeEventListener( "DOMContentLoaded", completed ); window.removeEventListener( "load", completed ); jQuery.ready(); } // Catch cases where $(document).ready() is called // after the browser event has already occurred. // Support: IE <=9 - 10 only // Older IE sometimes signals "interactive" too soon if ( document.readyState === "complete" || ( document.readyState !== "loading" && !document.documentElement.doScroll ) ) { // Handle it asynchronously to allow scripts the opportunity to delay ready window.setTimeout( jQuery.ready ); } else { // Use the handy event callback document.addEventListener( "DOMContentLoaded", completed ); // A fallback to window.onload, that will always work window.addEventListener( "load", completed ); } // Multifunctional method to get and set values of a collection // The value/s can optionally be executed if it's a function var access = function( elems, fn, key, value, chainable, emptyGet, raw ) { var i = 0, len = elems.length, bulk = key == null; // Sets many values if ( jQuery.type( key ) === "object" ) { chainable = true; for ( i in key ) { access( elems, fn, i, key[ i ], true, emptyGet, raw ); } // Sets one value } else if ( value !== undefined ) { chainable = true; if ( !jQuery.isFunction( value ) ) { raw = true; } if ( bulk ) { // Bulk operations run against the entire set if ( raw ) { fn.call( elems, value ); fn = null; // ...except when executing function values } else { bulk = fn; fn = function( elem, key, value ) { return bulk.call( jQuery( elem ), value ); }; } } if ( fn ) { for ( ; i < len; i++ ) { fn( elems[ i ], key, raw ? value : value.call( elems[ i ], i, fn( elems[ i ], key ) ) ); } } } if ( chainable ) { return elems; } // Gets if ( bulk ) { return fn.call( elems ); } return len ? fn( elems[ 0 ], key ) : emptyGet; }; var acceptData = function( owner ) { // Accepts only: // - Node // - Node.ELEMENT_NODE // - Node.DOCUMENT_NODE // - Object // - Any return owner.nodeType === 1 || owner.nodeType === 9 || !( +owner.nodeType ); }; function Data() { this.expando = jQuery.expando + Data.uid++; } Data.uid = 1; Data.prototype = { cache: function( owner ) { // Check if the owner object already has a cache var value = owner[ this.expando ]; // If not, create one if ( !value ) { value = {}; // We can accept data for non-element nodes in modern browsers, // but we should not, see #8335. // Always return an empty object. if ( acceptData( owner ) ) { // If it is a node unlikely to be stringify-ed or looped over // use plain assignment if ( owner.nodeType ) { owner[ this.expando ] = value; // Otherwise secure it in a non-enumerable property // configurable must be true to allow the property to be // deleted when data is removed } else { Object.defineProperty( owner, this.expando, { value: value, configurable: true } ); } } } return value; }, set: function( owner, data, value ) { var prop, cache = this.cache( owner ); // Handle: [ owner, key, value ] args // Always use camelCase key (gh-2257) if ( typeof data === "string" ) { cache[ jQuery.camelCase( data ) ] = value; // Handle: [ owner, { properties } ] args } else { // Copy the properties one-by-one to the cache object for ( prop in data ) { cache[ jQuery.camelCase( prop ) ] = data[ prop ]; } } return cache; }, get: function( owner, key ) { return key === undefined ? this.cache( owner ) : // Always use camelCase key (gh-2257) owner[ this.expando ] && owner[ this.expando ][ jQuery.camelCase( key ) ]; }, access: function( owner, key, value ) { // In cases where either: // // 1. No key was specified // 2. A string key was specified, but no value provided // // Take the "read" path and allow the get method to determine // which value to return, respectively either: // // 1. The entire cache object // 2. The data stored at the key // if ( key === undefined || ( ( key && typeof key === "string" ) && value === undefined ) ) { return this.get( owner, key ); } // When the key is not a string, or both a key and value // are specified, set or extend (existing objects) with either: // // 1. An object of properties // 2. A key and value // this.set( owner, key, value ); // Since the "set" path can have two possible entry points // return the expected data based on which path was taken[*] return value !== undefined ? value : key; }, remove: function( owner, key ) { var i, cache = owner[ this.expando ]; if ( cache === undefined ) { return; } if ( key !== undefined ) { // Support array or space separated string of keys if ( Array.isArray( key ) ) { // If key is an array of keys... // We always set camelCase keys, so remove that. key = key.map( jQuery.camelCase ); } else { key = jQuery.camelCase( key ); // If a key with the spaces exists, use it. // Otherwise, create an array by matching non-whitespace key = key in cache ? [ key ] : ( key.match( rnothtmlwhite ) || [] ); } i = key.length; while ( i-- ) { delete cache[ key[ i ] ]; } } // Remove the expando if there's no more data if ( key === undefined || jQuery.isEmptyObject( cache ) ) { // Support: Chrome <=35 - 45 // Webkit & Blink performance suffers when deleting properties // from DOM nodes, so set to undefined instead // https://bugs.chromium.org/p/chromium/issues/detail?id=378607 (bug restricted) if ( owner.nodeType ) { owner[ this.expando ] = undefined; } else { delete owner[ this.expando ]; } } }, hasData: function( owner ) { var cache = owner[ this.expando ]; return cache !== undefined && !jQuery.isEmptyObject( cache ); } }; var dataPriv = new Data(); var dataUser = new Data(); // Implementation Summary // // 1. Enforce API surface and semantic compatibility with 1.9.x branch // 2. Improve the module's maintainability by reducing the storage // paths to a single mechanism. // 3. Use the same single mechanism to support "private" and "user" data. // 4. _Never_ expose "private" data to user code (TODO: Drop _data, _removeData) // 5. Avoid exposing implementation details on user objects (eg. expando properties) // 6. Provide a clear path for implementation upgrade to WeakMap in 2014 var rbrace = /^(?:\{[\w\W]*\}|\[[\w\W]*\])$/, rmultiDash = /[A-Z]/g; function getData( data ) { if ( data === "true" ) { return true; } if ( data === "false" ) { return false; } if ( data === "null" ) { return null; } // Only convert to a number if it doesn't change the string if ( data === +data + "" ) { return +data; } if ( rbrace.test( data ) ) { return JSON.parse( data ); } return data; } function dataAttr( elem, key, data ) { var name; // If nothing was found internally, try to fetch any // data from the HTML5 data-* attribute if ( data === undefined && elem.nodeType === 1 ) { name = "data-" + key.replace( rmultiDash, "-$&" ).toLowerCase(); data = elem.getAttribute( name ); if ( typeof data === "string" ) { try { data = getData( data ); } catch ( e ) {} // Make sure we set the data so it isn't changed later dataUser.set( elem, key, data ); } else { data = undefined; } } return data; } jQuery.extend( { hasData: function( elem ) { return dataUser.hasData( elem ) || dataPriv.hasData( elem ); }, data: function( elem, name, data ) { return dataUser.access( elem, name, data ); }, removeData: function( elem, name ) { dataUser.remove( elem, name ); }, // TODO: Now that all calls to _data and _removeData have been replaced // with direct calls to dataPriv methods, these can be deprecated. _data: function( elem, name, data ) { return dataPriv.access( elem, name, data ); }, _removeData: function( elem, name ) { dataPriv.remove( elem, name ); } } ); jQuery.fn.extend( { data: function( key, value ) { var i, name, data, elem = this[ 0 ], attrs = elem && elem.attributes; // Gets all values if ( key === undefined ) { if ( this.length ) { data = dataUser.get( elem ); if ( elem.nodeType === 1 && !dataPriv.get( elem, "hasDataAttrs" ) ) { i = attrs.length; while ( i-- ) { // Support: IE 11 only // The attrs elements can be null (#14894) if ( attrs[ i ] ) { name = attrs[ i ].name; if ( name.indexOf( "data-" ) === 0 ) { name = jQuery.camelCase( name.slice( 5 ) ); dataAttr( elem, name, data[ name ] ); } } } dataPriv.set( elem, "hasDataAttrs", true ); } } return data; } // Sets multiple values if ( typeof key === "object" ) { return this.each( function() { dataUser.set( this, key ); } ); } return access( this, function( value ) { var data; // The calling jQuery object (element matches) is not empty // (and therefore has an element appears at this[ 0 ]) and the // `value` parameter was not undefined. An empty jQuery object // will result in `undefined` for elem = this[ 0 ] which will // throw an exception if an attempt to read a data cache is made. if ( elem && value === undefined ) { // Attempt to get data from the cache // The key will always be camelCased in Data data = dataUser.get( elem, key ); if ( data !== undefined ) { return data; } // Attempt to "discover" the data in // HTML5 custom data-* attrs data = dataAttr( elem, key ); if ( data !== undefined ) { return data; } // We tried really hard, but the data doesn't exist. return; } // Set the data... this.each( function() { // We always store the camelCased key dataUser.set( this, key, value ); } ); }, null, value, arguments.length > 1, null, true ); }, removeData: function( key ) { return this.each( function() { dataUser.remove( this, key ); } ); } } ); jQuery.extend( { queue: function( elem, type, data ) { var queue; if ( elem ) { type = ( type || "fx" ) + "queue"; queue = dataPriv.get( elem, type ); // Speed up dequeue by getting out quickly if this is just a lookup if ( data ) { if ( !queue || Array.isArray( data ) ) { queue = dataPriv.access( elem, type, jQuery.makeArray( data ) ); } else { queue.push( data ); } } return queue || []; } }, dequeue: function( elem, type ) { type = type || "fx"; var queue = jQuery.queue( elem, type ), startLength = queue.length, fn = queue.shift(), hooks = jQuery._queueHooks( elem, type ), next = function() { jQuery.dequeue( elem, type ); }; // If the fx queue is dequeued, always remove the progress sentinel if ( fn === "inprogress" ) { fn = queue.shift(); startLength--; } if ( fn ) { // Add a progress sentinel to prevent the fx queue from being // automatically dequeued if ( type === "fx" ) { queue.unshift( "inprogress" ); } // Clear up the last queue stop function delete hooks.stop; fn.call( elem, next, hooks ); } if ( !startLength && hooks ) { hooks.empty.fire(); } }, // Not public - generate a queueHooks object, or return the current one _queueHooks: function( elem, type ) { var key = type + "queueHooks"; return dataPriv.get( elem, key ) || dataPriv.access( elem, key, { empty: jQuery.Callbacks( "once memory" ).add( function() { dataPriv.remove( elem, [ type + "queue", key ] ); } ) } ); } } ); jQuery.fn.extend( { queue: function( type, data ) { var setter = 2; if ( typeof type !== "string" ) { data = type; type = "fx"; setter--; } if ( arguments.length < setter ) { return jQuery.queue( this[ 0 ], type ); } return data === undefined ? this : this.each( function() { var queue = jQuery.queue( this, type, data ); // Ensure a hooks for this queue jQuery._queueHooks( this, type ); if ( type === "fx" && queue[ 0 ] !== "inprogress" ) { jQuery.dequeue( this, type ); } } ); }, dequeue: function( type ) { return this.each( function() { jQuery.dequeue( this, type ); } ); }, clearQueue: function( type ) { return this.queue( type || "fx", [] ); }, // Get a promise resolved when queues of a certain type // are emptied (fx is the type by default) promise: function( type, obj ) { var tmp, count = 1, defer = jQuery.Deferred(), elements = this, i = this.length, resolve = function() { if ( !( --count ) ) { defer.resolveWith( elements, [ elements ] ); } }; if ( typeof type !== "string" ) { obj = type; type = undefined; } type = type || "fx"; while ( i-- ) { tmp = dataPriv.get( elements[ i ], type + "queueHooks" ); if ( tmp && tmp.empty ) { count++; tmp.empty.add( resolve ); } } resolve(); return defer.promise( obj ); } } ); var pnum = ( /[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/ ).source; var rcssNum = new RegExp( "^(?:([+-])=|)(" + pnum + ")([a-z%]*)$", "i" ); var cssExpand = [ "Top", "Right", "Bottom", "Left" ]; var isHiddenWithinTree = function( elem, el ) { // isHiddenWithinTree might be called from jQuery#filter function; // in that case, element will be second argument elem = el || elem; // Inline style trumps all return elem.style.display === "none" || elem.style.display === "" && // Otherwise, check computed style // Support: Firefox <=43 - 45 // Disconnected elements can have computed display: none, so first confirm that elem is // in the document. jQuery.contains( elem.ownerDocument, elem ) && jQuery.css( elem, "display" ) === "none"; }; var swap = function( elem, options, callback, args ) { var ret, name, old = {}; // Remember the old values, and insert the new ones for ( name in options ) { old[ name ] = elem.style[ name ]; elem.style[ name ] = options[ name ]; } ret = callback.apply( elem, args || [] ); // Revert the old values for ( name in options ) { elem.style[ name ] = old[ name ]; } return ret; }; function adjustCSS( elem, prop, valueParts, tween ) { var adjusted, scale = 1, maxIterations = 20, currentValue = tween ? function() { return tween.cur(); } : function() { return jQuery.css( elem, prop, "" ); }, initial = currentValue(), unit = valueParts && valueParts[ 3 ] || ( jQuery.cssNumber[ prop ] ? "" : "px" ), // Starting value computation is required for potential unit mismatches initialInUnit = ( jQuery.cssNumber[ prop ] || unit !== "px" && +initial ) && rcssNum.exec( jQuery.css( elem, prop ) ); if ( initialInUnit && initialInUnit[ 3 ] !== unit ) { // Trust units reported by jQuery.css unit = unit || initialInUnit[ 3 ]; // Make sure we update the tween properties later on valueParts = valueParts || []; // Iteratively approximate from a nonzero starting point initialInUnit = +initial || 1; do { // If previous iteration zeroed out, double until we get *something*. // Use string for doubling so we don't accidentally see scale as unchanged below scale = scale || ".5"; // Adjust and apply initialInUnit = initialInUnit / scale; jQuery.style( elem, prop, initialInUnit + unit ); // Update scale, tolerating zero or NaN from tween.cur() // Break the loop if scale is unchanged or perfect, or if we've just had enough. } while ( scale !== ( scale = currentValue() / initial ) && scale !== 1 && --maxIterations ); } if ( valueParts ) { initialInUnit = +initialInUnit || +initial || 0; // Apply relative offset (+=/-=) if specified adjusted = valueParts[ 1 ] ? initialInUnit + ( valueParts[ 1 ] + 1 ) * valueParts[ 2 ] : +valueParts[ 2 ]; if ( tween ) { tween.unit = unit; tween.start = initialInUnit; tween.end = adjusted; } } return adjusted; } var defaultDisplayMap = {}; function getDefaultDisplay( elem ) { var temp, doc = elem.ownerDocument, nodeName = elem.nodeName, display = defaultDisplayMap[ nodeName ]; if ( display ) { return display; } temp = doc.body.appendChild( doc.createElement( nodeName ) ); display = jQuery.css( temp, "display" ); temp.parentNode.removeChild( temp ); if ( display === "none" ) { display = "block"; } defaultDisplayMap[ nodeName ] = display; return display; } function showHide( elements, show ) { var display, elem, values = [], index = 0, length = elements.length; // Determine new display value for elements that need to change for ( ; index < length; index++ ) { elem = elements[ index ]; if ( !elem.style ) { continue; } display = elem.style.display; if ( show ) { // Since we force visibility upon cascade-hidden elements, an immediate (and slow) // check is required in this first loop unless we have a nonempty display value (either // inline or about-to-be-restored) if ( display === "none" ) { values[ index ] = dataPriv.get( elem, "display" ) || null; if ( !values[ index ] ) { elem.style.display = ""; } } if ( elem.style.display === "" && isHiddenWithinTree( elem ) ) { values[ index ] = getDefaultDisplay( elem ); } } else { if ( display !== "none" ) { values[ index ] = "none"; // Remember what we're overwriting dataPriv.set( elem, "display", display ); } } } // Set the display of the elements in a second loop to avoid constant reflow for ( index = 0; index < length; index++ ) { if ( values[ index ] != null ) { elements[ index ].style.display = values[ index ]; } } return elements; } jQuery.fn.extend( { show: function() { return showHide( this, true ); }, hide: function() { return showHide( this ); }, toggle: function( state ) { if ( typeof state === "boolean" ) { return state ? this.show() : this.hide(); } return this.each( function() { if ( isHiddenWithinTree( this ) ) { jQuery( this ).show(); } else { jQuery( this ).hide(); } } ); } } ); var rcheckableType = ( /^(?:checkbox|radio)$/i ); var rtagName = ( /<([a-z][^\/\0>\x20\t\r\n\f]+)/i ); var rscriptType = ( /^$|\/(?:java|ecma)script/i ); // We have to close these tags to support XHTML (#13200) var wrapMap = { // Support: IE <=9 only option: [ 1, "<select multiple='multiple'>", "</select>" ], // XHTML parsers do not magically insert elements in the // same way that tag soup parsers do. So we cannot shorten // this by omitting <tbody> or other required elements. thead: [ 1, "<table>", "</table>" ], col: [ 2, "<table><colgroup>", "</colgroup></table>" ], tr: [ 2, "<table><tbody>", "</tbody></table>" ], td: [ 3, "<table><tbody><tr>", "</tr></tbody></table>" ], _default: [ 0, "", "" ] }; // Support: IE <=9 only wrapMap.optgroup = wrapMap.option; wrapMap.tbody = wrapMap.tfoot = wrapMap.colgroup = wrapMap.caption = wrapMap.thead; wrapMap.th = wrapMap.td; function getAll( context, tag ) { // Support: IE <=9 - 11 only // Use typeof to avoid zero-argument method invocation on host objects (#15151) var ret; if ( typeof context.getElementsByTagName !== "undefined" ) { ret = context.getElementsByTagName( tag || "*" ); } else if ( typeof context.querySelectorAll !== "undefined" ) { ret = context.querySelectorAll( tag || "*" ); } else { ret = []; } if ( tag === undefined || tag && nodeName( context, tag ) ) { return jQuery.merge( [ context ], ret ); } return ret; } // Mark scripts as having already been evaluated function setGlobalEval( elems, refElements ) { var i = 0, l = elems.length; for ( ; i < l; i++ ) { dataPriv.set( elems[ i ], "globalEval", !refElements || dataPriv.get( refElements[ i ], "globalEval" ) ); } } var rhtml = /<|&#?\w+;/; function buildFragment( elems, context, scripts, selection, ignored ) { var elem, tmp, tag, wrap, contains, j, fragment = context.createDocumentFragment(), nodes = [], i = 0, l = elems.length; for ( ; i < l; i++ ) { elem = elems[ i ]; if ( elem || elem === 0 ) { // Add nodes directly if ( jQuery.type( elem ) === "object" ) { // Support: Android <=4.0 only, PhantomJS 1 only // push.apply(_, arraylike) throws on ancient WebKit jQuery.merge( nodes, elem.nodeType ? [ elem ] : elem ); // Convert non-html into a text node } else if ( !rhtml.test( elem ) ) { nodes.push( context.createTextNode( elem ) ); // Convert html into DOM nodes } else { tmp = tmp || fragment.appendChild( context.createElement( "div" ) ); // Deserialize a standard representation tag = ( rtagName.exec( elem ) || [ "", "" ] )[ 1 ].toLowerCase(); wrap = wrapMap[ tag ] || wrapMap._default; tmp.innerHTML = wrap[ 1 ] + jQuery.htmlPrefilter( elem ) + wrap[ 2 ]; // Descend through wrappers to the right content j = wrap[ 0 ]; while ( j-- ) { tmp = tmp.lastChild; } // Support: Android <=4.0 only, PhantomJS 1 only // push.apply(_, arraylike) throws on ancient WebKit jQuery.merge( nodes, tmp.childNodes ); // Remember the top-level container tmp = fragment.firstChild; // Ensure the created nodes are orphaned (#12392) tmp.textContent = ""; } } } // Remove wrapper from fragment fragment.textContent = ""; i = 0; while ( ( elem = nodes[ i++ ] ) ) { // Skip elements already in the context collection (trac-4087) if ( selection && jQuery.inArray( elem, selection ) > -1 ) { if ( ignored ) { ignored.push( elem ); } continue; } contains = jQuery.contains( elem.ownerDocument, elem ); // Append to fragment tmp = getAll( fragment.appendChild( elem ), "script" ); // Preserve script evaluation history if ( contains ) { setGlobalEval( tmp ); } // Capture executables if ( scripts ) { j = 0; while ( ( elem = tmp[ j++ ] ) ) { if ( rscriptType.test( elem.type || "" ) ) { scripts.push( elem ); } } } } return fragment; } ( function() { var fragment = document.createDocumentFragment(), div = fragment.appendChild( document.createElement( "div" ) ), input = document.createElement( "input" ); // Support: Android 4.0 - 4.3 only // Check state lost if the name is set (#11217) // Support: Windows Web Apps (WWA) // `name` and `type` must use .setAttribute for WWA (#14901) input.setAttribute( "type", "radio" ); input.setAttribute( "checked", "checked" ); input.setAttribute( "name", "t" ); div.appendChild( input ); // Support: Android <=4.1 only // Older WebKit doesn't clone checked state correctly in fragments support.checkClone = div.cloneNode( true ).cloneNode( true ).lastChild.checked; // Support: IE <=11 only // Make sure textarea (and checkbox) defaultValue is properly cloned div.innerHTML = "<textarea>x</textarea>"; support.noCloneChecked = !!div.cloneNode( true ).lastChild.defaultValue; } )(); var documentElement = document.documentElement; var rkeyEvent = /^key/, rmouseEvent = /^(?:mouse|pointer|contextmenu|drag|drop)|click/, rtypenamespace = /^([^.]*)(?:\.(.+)|)/; function returnTrue() { return true; } function returnFalse() { return false; } // Support: IE <=9 only // See #13393 for more info function safeActiveElement() { try { return document.activeElement; } catch ( err ) { } } function on( elem, types, selector, data, fn, one ) { var origFn, type; // Types can be a map of types/handlers if ( typeof types === "object" ) { // ( types-Object, selector, data ) if ( typeof selector !== "string" ) { // ( types-Object, data ) data = data || selector; selector = undefined; } for ( type in types ) { on( elem, type, selector, data, types[ type ], one ); } return elem; } if ( data == null && fn == null ) { // ( types, fn ) fn = selector; data = selector = undefined; } else if ( fn == null ) { if ( typeof selector === "string" ) { // ( types, selector, fn ) fn = data; data = undefined; } else { // ( types, data, fn ) fn = data; data = selector; selector = undefined; } } if ( fn === false ) { fn = returnFalse; } else if ( !fn ) { return elem; } if ( one === 1 ) { origFn = fn; fn = function( event ) { // Can use an empty set, since event contains the info jQuery().off( event ); return origFn.apply( this, arguments ); }; // Use same guid so caller can remove using origFn fn.guid = origFn.guid || ( origFn.guid = jQuery.guid++ ); } return elem.each( function() { jQuery.event.add( this, types, fn, data, selector ); } ); } /* * Helper functions for managing events -- not part of the public interface. * Props to Dean Edwards' addEvent library for many of the ideas. */ jQuery.event = { global: {}, add: function( elem, types, handler, data, selector ) { var handleObjIn, eventHandle, tmp, events, t, handleObj, special, handlers, type, namespaces, origType, elemData = dataPriv.get( elem ); // Don't attach events to noData or text/comment nodes (but allow plain objects) if ( !elemData ) { return; } // Caller can pass in an object of custom data in lieu of the handler if ( handler.handler ) { handleObjIn = handler; handler = handleObjIn.handler; selector = handleObjIn.selector; } // Ensure that invalid selectors throw exceptions at attach time // Evaluate against documentElement in case elem is a non-element node (e.g., document) if ( selector ) { jQuery.find.matchesSelector( documentElement, selector ); } // Make sure that the handler has a unique ID, used to find/remove it later if ( !handler.guid ) { handler.guid = jQuery.guid++; } // Init the element's event structure and main handler, if this is the first if ( !( events = elemData.events ) ) { events = elemData.events = {}; } if ( !( eventHandle = elemData.handle ) ) { eventHandle = elemData.handle = function( e ) { // Discard the second event of a jQuery.event.trigger() and // when an event is called after a page has unloaded return typeof jQuery !== "undefined" && jQuery.event.triggered !== e.type ? jQuery.event.dispatch.apply( elem, arguments ) : undefined; }; } // Handle multiple events separated by a space types = ( types || "" ).match( rnothtmlwhite ) || [ "" ]; t = types.length; while ( t-- ) { tmp = rtypenamespace.exec( types[ t ] ) || []; type = origType = tmp[ 1 ]; namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort(); // There *must* be a type, no attaching namespace-only handlers if ( !type ) { continue; } // If event changes its type, use the special event handlers for the changed type special = jQuery.event.special[ type ] || {}; // If selector defined, determine special event api type, otherwise given type type = ( selector ? special.delegateType : special.bindType ) || type; // Update special based on newly reset type special = jQuery.event.special[ type ] || {}; // handleObj is passed to all event handlers handleObj = jQuery.extend( { type: type, origType: origType, data: data, handler: handler, guid: handler.guid, selector: selector, needsContext: selector && jQuery.expr.match.needsContext.test( selector ), namespace: namespaces.join( "." ) }, handleObjIn ); // Init the event handler queue if we're the first if ( !( handlers = events[ type ] ) ) { handlers = events[ type ] = []; handlers.delegateCount = 0; // Only use addEventListener if the special events handler returns false if ( !special.setup || special.setup.call( elem, data, namespaces, eventHandle ) === false ) { if ( elem.addEventListener ) { elem.addEventListener( type, eventHandle ); } } } if ( special.add ) { special.add.call( elem, handleObj ); if ( !handleObj.handler.guid ) { handleObj.handler.guid = handler.guid; } } // Add to the element's handler list, delegates in front if ( selector ) { handlers.splice( handlers.delegateCount++, 0, handleObj ); } else { handlers.push( handleObj ); } // Keep track of which events have ever been used, for event optimization jQuery.event.global[ type ] = true; } }, // Detach an event or set of events from an element remove: function( elem, types, handler, selector, mappedTypes ) { var j, origCount, tmp, events, t, handleObj, special, handlers, type, namespaces, origType, elemData = dataPriv.hasData( elem ) && dataPriv.get( elem ); if ( !elemData || !( events = elemData.events ) ) { return; } // Once for each type.namespace in types; type may be omitted types = ( types || "" ).match( rnothtmlwhite ) || [ "" ]; t = types.length; while ( t-- ) { tmp = rtypenamespace.exec( types[ t ] ) || []; type = origType = tmp[ 1 ]; namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort(); // Unbind all events (on this namespace, if provided) for the element if ( !type ) { for ( type in events ) { jQuery.event.remove( elem, type + types[ t ], handler, selector, true ); } continue; } special = jQuery.event.special[ type ] || {}; type = ( selector ? special.delegateType : special.bindType ) || type; handlers = events[ type ] || []; tmp = tmp[ 2 ] && new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" ); // Remove matching events origCount = j = handlers.length; while ( j-- ) { handleObj = handlers[ j ]; if ( ( mappedTypes || origType === handleObj.origType ) && ( !handler || handler.guid === handleObj.guid ) && ( !tmp || tmp.test( handleObj.namespace ) ) && ( !selector || selector === handleObj.selector || selector === "**" && handleObj.selector ) ) { handlers.splice( j, 1 ); if ( handleObj.selector ) { handlers.delegateCount--; } if ( special.remove ) { special.remove.call( elem, handleObj ); } } } // Remove generic event handler if we removed something and no more handlers exist // (avoids potential for endless recursion during removal of special event handlers) if ( origCount && !handlers.length ) { if ( !special.teardown || special.teardown.call( elem, namespaces, elemData.handle ) === false ) { jQuery.removeEvent( elem, type, elemData.handle ); } delete events[ type ]; } } // Remove data and the expando if it's no longer used if ( jQuery.isEmptyObject( events ) ) { dataPriv.remove( elem, "handle events" ); } }, dispatch: function( nativeEvent ) { // Make a writable jQuery.Event from the native event object var event = jQuery.event.fix( nativeEvent ); var i, j, ret, matched, handleObj, handlerQueue, args = new Array( arguments.length ), handlers = ( dataPriv.get( this, "events" ) || {} )[ event.type ] || [], special = jQuery.event.special[ event.type ] || {}; // Use the fix-ed jQuery.Event rather than the (read-only) native event args[ 0 ] = event; for ( i = 1; i < arguments.length; i++ ) { args[ i ] = arguments[ i ]; } event.delegateTarget = this; // Call the preDispatch hook for the mapped type, and let it bail if desired if ( special.preDispatch && special.preDispatch.call( this, event ) === false ) { return; } // Determine handlers handlerQueue = jQuery.event.handlers.call( this, event, handlers ); // Run delegates first; they may want to stop propagation beneath us i = 0; while ( ( matched = handlerQueue[ i++ ] ) && !event.isPropagationStopped() ) { event.currentTarget = matched.elem; j = 0; while ( ( handleObj = matched.handlers[ j++ ] ) && !event.isImmediatePropagationStopped() ) { // Triggered event must either 1) have no namespace, or 2) have namespace(s) // a subset or equal to those in the bound event (both can have no namespace). if ( !event.rnamespace || event.rnamespace.test( handleObj.namespace ) ) { event.handleObj = handleObj; event.data = handleObj.data; ret = ( ( jQuery.event.special[ handleObj.origType ] || {} ).handle || handleObj.handler ).apply( matched.elem, args ); if ( ret !== undefined ) { if ( ( event.result = ret ) === false ) { event.preventDefault(); event.stopPropagation(); } } } } } // Call the postDispatch hook for the mapped type if ( special.postDispatch ) { special.postDispatch.call( this, event ); } return event.result; }, handlers: function( event, handlers ) { var i, handleObj, sel, matchedHandlers, matchedSelectors, handlerQueue = [], delegateCount = handlers.delegateCount, cur = event.target; // Find delegate handlers if ( delegateCount && // Support: IE <=9 // Black-hole SVG <use> instance trees (trac-13180) cur.nodeType && // Support: Firefox <=42 // Suppress spec-violating clicks indicating a non-primary pointer button (trac-3861) // https://www.w3.org/TR/DOM-Level-3-Events/#event-type-click // Support: IE 11 only // ...but not arrow key "clicks" of radio inputs, which can have `button` -1 (gh-2343) !( event.type === "click" && event.button >= 1 ) ) { for ( ; cur !== this; cur = cur.parentNode || this ) { // Don't check non-elements (#13208) // Don't process clicks on disabled elements (#6911, #8165, #11382, #11764) if ( cur.nodeType === 1 && !( event.type === "click" && cur.disabled === true ) ) { matchedHandlers = []; matchedSelectors = {}; for ( i = 0; i < delegateCount; i++ ) { handleObj = handlers[ i ]; // Don't conflict with Object.prototype properties (#13203) sel = handleObj.selector + " "; if ( matchedSelectors[ sel ] === undefined ) { matchedSelectors[ sel ] = handleObj.needsContext ? jQuery( sel, this ).index( cur ) > -1 : jQuery.find( sel, this, null, [ cur ] ).length; } if ( matchedSelectors[ sel ] ) { matchedHandlers.push( handleObj ); } } if ( matchedHandlers.length ) { handlerQueue.push( { elem: cur, handlers: matchedHandlers } ); } } } } // Add the remaining (directly-bound) handlers cur = this; if ( delegateCount < handlers.length ) { handlerQueue.push( { elem: cur, handlers: handlers.slice( delegateCount ) } ); } return handlerQueue; }, addProp: function( name, hook ) { Object.defineProperty( jQuery.Event.prototype, name, { enumerable: true, configurable: true, get: jQuery.isFunction( hook ) ? function() { if ( this.originalEvent ) { return hook( this.originalEvent ); } } : function() { if ( this.originalEvent ) { return this.originalEvent[ name ]; } }, set: function( value ) { Object.defineProperty( this, name, { enumerable: true, configurable: true, writable: true, value: value } ); } } ); }, fix: function( originalEvent ) { return originalEvent[ jQuery.expando ] ? originalEvent : new jQuery.Event( originalEvent ); }, special: { load: { // Prevent triggered image.load events from bubbling to window.load noBubble: true }, focus: { // Fire native event if possible so blur/focus sequence is correct trigger: function() { if ( this !== safeActiveElement() && this.focus ) { this.focus(); return false; } }, delegateType: "focusin" }, blur: { trigger: function() { if ( this === safeActiveElement() && this.blur ) { this.blur(); return false; } }, delegateType: "focusout" }, click: { // For checkbox, fire native event so checked state will be right trigger: function() { if ( this.type === "checkbox" && this.click && nodeName( this, "input" ) ) { this.click(); return false; } }, // For cross-browser consistency, don't fire native .click() on links _default: function( event ) { return nodeName( event.target, "a" ); } }, beforeunload: { postDispatch: function( event ) { // Support: Firefox 20+ // Firefox doesn't alert if the returnValue field is not set. if ( event.result !== undefined && event.originalEvent ) { event.originalEvent.returnValue = event.result; } } } } }; jQuery.removeEvent = function( elem, type, handle ) { // This "if" is needed for plain objects if ( elem.removeEventListener ) { elem.removeEventListener( type, handle ); } }; jQuery.Event = function( src, props ) { // Allow instantiation without the 'new' keyword if ( !( this instanceof jQuery.Event ) ) { return new jQuery.Event( src, props ); } // Event object if ( src && src.type ) { this.originalEvent = src; this.type = src.type; // Events bubbling up the document may have been marked as prevented // by a handler lower down the tree; reflect the correct value. this.isDefaultPrevented = src.defaultPrevented || src.defaultPrevented === undefined && // Support: Android <=2.3 only src.returnValue === false ? returnTrue : returnFalse; // Create target properties // Support: Safari <=6 - 7 only // Target should not be a text node (#504, #13143) this.target = ( src.target && src.target.nodeType === 3 ) ? src.target.parentNode : src.target; this.currentTarget = src.currentTarget; this.relatedTarget = src.relatedTarget; // Event type } else { this.type = src; } // Put explicitly provided properties onto the event object if ( props ) { jQuery.extend( this, props ); } // Create a timestamp if incoming event doesn't have one this.timeStamp = src && src.timeStamp || jQuery.now(); // Mark it as fixed this[ jQuery.expando ] = true; }; // jQuery.Event is based on DOM3 Events as specified by the ECMAScript Language Binding // https://www.w3.org/TR/2003/WD-DOM-Level-3-Events-20030331/ecma-script-binding.html jQuery.Event.prototype = { constructor: jQuery.Event, isDefaultPrevented: returnFalse, isPropagationStopped: returnFalse, isImmediatePropagationStopped: returnFalse, isSimulated: false, preventDefault: function() { var e = this.originalEvent; this.isDefaultPrevented = returnTrue; if ( e && !this.isSimulated ) { e.preventDefault(); } }, stopPropagation: function() { var e = this.originalEvent; this.isPropagationStopped = returnTrue; if ( e && !this.isSimulated ) { e.stopPropagation(); } }, stopImmediatePropagation: function() { var e = this.originalEvent; this.isImmediatePropagationStopped = returnTrue; if ( e && !this.isSimulated ) { e.stopImmediatePropagation(); } this.stopPropagation(); } }; // Includes all common event props including KeyEvent and MouseEvent specific props jQuery.each( { altKey: true, bubbles: true, cancelable: true, changedTouches: true, ctrlKey: true, detail: true, eventPhase: true, metaKey: true, pageX: true, pageY: true, shiftKey: true, view: true, "char": true, charCode: true, key: true, keyCode: true, button: true, buttons: true, clientX: true, clientY: true, offsetX: true, offsetY: true, pointerId: true, pointerType: true, screenX: true, screenY: true, targetTouches: true, toElement: true, touches: true, which: function( event ) { var button = event.button; // Add which for key events if ( event.which == null && rkeyEvent.test( event.type ) ) { return event.charCode != null ? event.charCode : event.keyCode; } // Add which for click: 1 === left; 2 === middle; 3 === right if ( !event.which && button !== undefined && rmouseEvent.test( event.type ) ) { if ( button & 1 ) { return 1; } if ( button & 2 ) { return 3; } if ( button & 4 ) { return 2; } return 0; } return event.which; } }, jQuery.event.addProp ); // Create mouseenter/leave events using mouseover/out and event-time checks // so that event delegation works in jQuery. // Do the same for pointerenter/pointerleave and pointerover/pointerout // // Support: Safari 7 only // Safari sends mouseenter too often; see: // https://bugs.chromium.org/p/chromium/issues/detail?id=470258 // for the description of the bug (it existed in older Chrome versions as well). jQuery.each( { mouseenter: "mouseover", mouseleave: "mouseout", pointerenter: "pointerover", pointerleave: "pointerout" }, function( orig, fix ) { jQuery.event.special[ orig ] = { delegateType: fix, bindType: fix, handle: function( event ) { var ret, target = this, related = event.relatedTarget, handleObj = event.handleObj; // For mouseenter/leave call the handler if related is outside the target. // NB: No relatedTarget if the mouse left/entered the browser window if ( !related || ( related !== target && !jQuery.contains( target, related ) ) ) { event.type = handleObj.origType; ret = handleObj.handler.apply( this, arguments ); event.type = fix; } return ret; } }; } ); jQuery.fn.extend( { on: function( types, selector, data, fn ) { return on( this, types, selector, data, fn ); }, one: function( types, selector, data, fn ) { return on( this, types, selector, data, fn, 1 ); }, off: function( types, selector, fn ) { var handleObj, type; if ( types && types.preventDefault && types.handleObj ) { // ( event ) dispatched jQuery.Event handleObj = types.handleObj; jQuery( types.delegateTarget ).off( handleObj.namespace ? handleObj.origType + "." + handleObj.namespace : handleObj.origType, handleObj.selector, handleObj.handler ); return this; } if ( typeof types === "object" ) { // ( types-object [, selector] ) for ( type in types ) { this.off( type, selector, types[ type ] ); } return this; } if ( selector === false || typeof selector === "function" ) { // ( types [, fn] ) fn = selector; selector = undefined; } if ( fn === false ) { fn = returnFalse; } return this.each( function() { jQuery.event.remove( this, types, fn, selector ); } ); } } ); var /* eslint-disable max-len */ // See https://github.com/eslint/eslint/issues/3229 rxhtmlTag = /<(?!area|br|col|embed|hr|img|input|link|meta|param)(([a-z][^\/\0>\x20\t\r\n\f]*)[^>]*)\/>/gi, /* eslint-enable */ // Support: IE <=10 - 11, Edge 12 - 13 // In IE/Edge using regex groups here causes severe slowdowns. // See https://connect.microsoft.com/IE/feedback/details/1736512/ rnoInnerhtml = /<script|<style|<link/i, // checked="checked" or checked rchecked = /checked\s*(?:[^=]|=\s*.checked.)/i, rscriptTypeMasked = /^true\/(.*)/, rcleanScript = /^\s*<!(?:\[CDATA\[|--)|(?:\]\]|--)>\s*$/g; // Prefer a tbody over its parent table for containing new rows function manipulationTarget( elem, content ) { if ( nodeName( elem, "table" ) && nodeName( content.nodeType !== 11 ? content : content.firstChild, "tr" ) ) { return jQuery( ">tbody", elem )[ 0 ] || elem; } return elem; } // Replace/restore the type attribute of script elements for safe DOM manipulation function disableScript( elem ) { elem.type = ( elem.getAttribute( "type" ) !== null ) + "/" + elem.type; return elem; } function restoreScript( elem ) { var match = rscriptTypeMasked.exec( elem.type ); if ( match ) { elem.type = match[ 1 ]; } else { elem.removeAttribute( "type" ); } return elem; } function cloneCopyEvent( src, dest ) { var i, l, type, pdataOld, pdataCur, udataOld, udataCur, events; if ( dest.nodeType !== 1 ) { return; } // 1. Copy private data: events, handlers, etc. if ( dataPriv.hasData( src ) ) { pdataOld = dataPriv.access( src ); pdataCur = dataPriv.set( dest, pdataOld ); events = pdataOld.events; if ( events ) { delete pdataCur.handle; pdataCur.events = {}; for ( type in events ) { for ( i = 0, l = events[ type ].length; i < l; i++ ) { jQuery.event.add( dest, type, events[ type ][ i ] ); } } } } // 2. Copy user data if ( dataUser.hasData( src ) ) { udataOld = dataUser.access( src ); udataCur = jQuery.extend( {}, udataOld ); dataUser.set( dest, udataCur ); } } // Fix IE bugs, see support tests function fixInput( src, dest ) { var nodeName = dest.nodeName.toLowerCase(); // Fails to persist the checked state of a cloned checkbox or radio button. if ( nodeName === "input" && rcheckableType.test( src.type ) ) { dest.checked = src.checked; // Fails to return the selected option to the default selected state when cloning options } else if ( nodeName === "input" || nodeName === "textarea" ) { dest.defaultValue = src.defaultValue; } } function domManip( collection, args, callback, ignored ) { // Flatten any nested arrays args = concat.apply( [], args ); var fragment, first, scripts, hasScripts, node, doc, i = 0, l = collection.length, iNoClone = l - 1, value = args[ 0 ], isFunction = jQuery.isFunction( value ); // We can't cloneNode fragments that contain checked, in WebKit if ( isFunction || ( l > 1 && typeof value === "string" && !support.checkClone && rchecked.test( value ) ) ) { return collection.each( function( index ) { var self = collection.eq( index ); if ( isFunction ) { args[ 0 ] = value.call( this, index, self.html() ); } domManip( self, args, callback, ignored ); } ); } if ( l ) { fragment = buildFragment( args, collection[ 0 ].ownerDocument, false, collection, ignored ); first = fragment.firstChild; if ( fragment.childNodes.length === 1 ) { fragment = first; } // Require either new content or an interest in ignored elements to invoke the callback if ( first || ignored ) { scripts = jQuery.map( getAll( fragment, "script" ), disableScript ); hasScripts = scripts.length; // Use the original fragment for the last item // instead of the first because it can end up // being emptied incorrectly in certain situations (#8070). for ( ; i < l; i++ ) { node = fragment; if ( i !== iNoClone ) { node = jQuery.clone( node, true, true ); // Keep references to cloned scripts for later restoration if ( hasScripts ) { // Support: Android <=4.0 only, PhantomJS 1 only // push.apply(_, arraylike) throws on ancient WebKit jQuery.merge( scripts, getAll( node, "script" ) ); } } callback.call( collection[ i ], node, i ); } if ( hasScripts ) { doc = scripts[ scripts.length - 1 ].ownerDocument; // Reenable scripts jQuery.map( scripts, restoreScript ); // Evaluate executable scripts on first document insertion for ( i = 0; i < hasScripts; i++ ) { node = scripts[ i ]; if ( rscriptType.test( node.type || "" ) && !dataPriv.access( node, "globalEval" ) && jQuery.contains( doc, node ) ) { if ( node.src ) { // Optional AJAX dependency, but won't run scripts if not present if ( jQuery._evalUrl ) { jQuery._evalUrl( node.src ); } } else { DOMEval( node.textContent.replace( rcleanScript, "" ), doc ); } } } } } } return collection; } function remove( elem, selector, keepData ) { var node, nodes = selector ? jQuery.filter( selector, elem ) : elem, i = 0; for ( ; ( node = nodes[ i ] ) != null; i++ ) { if ( !keepData && node.nodeType === 1 ) { jQuery.cleanData( getAll( node ) ); } if ( node.parentNode ) { if ( keepData && jQuery.contains( node.ownerDocument, node ) ) { setGlobalEval( getAll( node, "script" ) ); } node.parentNode.removeChild( node ); } } return elem; } jQuery.extend( { htmlPrefilter: function( html ) { return html.replace( rxhtmlTag, "<$1></$2>" ); }, clone: function( elem, dataAndEvents, deepDataAndEvents ) { var i, l, srcElements, destElements, clone = elem.cloneNode( true ), inPage = jQuery.contains( elem.ownerDocument, elem ); // Fix IE cloning issues if ( !support.noCloneChecked && ( elem.nodeType === 1 || elem.nodeType === 11 ) && !jQuery.isXMLDoc( elem ) ) { // We eschew Sizzle here for performance reasons: https://jsperf.com/getall-vs-sizzle/2 destElements = getAll( clone ); srcElements = getAll( elem ); for ( i = 0, l = srcElements.length; i < l; i++ ) { fixInput( srcElements[ i ], destElements[ i ] ); } } // Copy the events from the original to the clone if ( dataAndEvents ) { if ( deepDataAndEvents ) { srcElements = srcElements || getAll( elem ); destElements = destElements || getAll( clone ); for ( i = 0, l = srcElements.length; i < l; i++ ) { cloneCopyEvent( srcElements[ i ], destElements[ i ] ); } } else { cloneCopyEvent( elem, clone ); } } // Preserve script evaluation history destElements = getAll( clone, "script" ); if ( destElements.length > 0 ) { setGlobalEval( destElements, !inPage && getAll( elem, "script" ) ); } // Return the cloned set return clone; }, cleanData: function( elems ) { var data, elem, type, special = jQuery.event.special, i = 0; for ( ; ( elem = elems[ i ] ) !== undefined; i++ ) { if ( acceptData( elem ) ) { if ( ( data = elem[ dataPriv.expando ] ) ) { if ( data.events ) { for ( type in data.events ) { if ( special[ type ] ) { jQuery.event.remove( elem, type ); // This is a shortcut to avoid jQuery.event.remove's overhead } else { jQuery.removeEvent( elem, type, data.handle ); } } } // Support: Chrome <=35 - 45+ // Assign undefined instead of using delete, see Data#remove elem[ dataPriv.expando ] = undefined; } if ( elem[ dataUser.expando ] ) { // Support: Chrome <=35 - 45+ // Assign undefined instead of using delete, see Data#remove elem[ dataUser.expando ] = undefined; } } } } } ); jQuery.fn.extend( { detach: function( selector ) { return remove( this, selector, true ); }, remove: function( selector ) { return remove( this, selector ); }, text: function( value ) { return access( this, function( value ) { return value === undefined ? jQuery.text( this ) : this.empty().each( function() { if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { this.textContent = value; } } ); }, null, value, arguments.length ); }, append: function() { return domManip( this, arguments, function( elem ) { if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { var target = manipulationTarget( this, elem ); target.appendChild( elem ); } } ); }, prepend: function() { return domManip( this, arguments, function( elem ) { if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { var target = manipulationTarget( this, elem ); target.insertBefore( elem, target.firstChild ); } } ); }, before: function() { return domManip( this, arguments, function( elem ) { if ( this.parentNode ) { this.parentNode.insertBefore( elem, this ); } } ); }, after: function() { return domManip( this, arguments, function( elem ) { if ( this.parentNode ) { this.parentNode.insertBefore( elem, this.nextSibling ); } } ); }, empty: function() { var elem, i = 0; for ( ; ( elem = this[ i ] ) != null; i++ ) { if ( elem.nodeType === 1 ) { // Prevent memory leaks jQuery.cleanData( getAll( elem, false ) ); // Remove any remaining nodes elem.textContent = ""; } } return this; }, clone: function( dataAndEvents, deepDataAndEvents ) { dataAndEvents = dataAndEvents == null ? false : dataAndEvents; deepDataAndEvents = deepDataAndEvents == null ? dataAndEvents : deepDataAndEvents; return this.map( function() { return jQuery.clone( this, dataAndEvents, deepDataAndEvents ); } ); }, html: function( value ) { return access( this, function( value ) { var elem = this[ 0 ] || {}, i = 0, l = this.length; if ( value === undefined && elem.nodeType === 1 ) { return elem.innerHTML; } // See if we can take a shortcut and just use innerHTML if ( typeof value === "string" && !rnoInnerhtml.test( value ) && !wrapMap[ ( rtagName.exec( value ) || [ "", "" ] )[ 1 ].toLowerCase() ] ) { value = jQuery.htmlPrefilter( value ); try { for ( ; i < l; i++ ) { elem = this[ i ] || {}; // Remove element nodes and prevent memory leaks if ( elem.nodeType === 1 ) { jQuery.cleanData( getAll( elem, false ) ); elem.innerHTML = value; } } elem = 0; // If using innerHTML throws an exception, use the fallback method } catch ( e ) {} } if ( elem ) { this.empty().append( value ); } }, null, value, arguments.length ); }, replaceWith: function() { var ignored = []; // Make the changes, replacing each non-ignored context element with the new content return domManip( this, arguments, function( elem ) { var parent = this.parentNode; if ( jQuery.inArray( this, ignored ) < 0 ) { jQuery.cleanData( getAll( this ) ); if ( parent ) { parent.replaceChild( elem, this ); } } // Force callback invocation }, ignored ); } } ); jQuery.each( { appendTo: "append", prependTo: "prepend", insertBefore: "before", insertAfter: "after", replaceAll: "replaceWith" }, function( name, original ) { jQuery.fn[ name ] = function( selector ) { var elems, ret = [], insert = jQuery( selector ), last = insert.length - 1, i = 0; for ( ; i <= last; i++ ) { elems = i === last ? this : this.clone( true ); jQuery( insert[ i ] )[ original ]( elems ); // Support: Android <=4.0 only, PhantomJS 1 only // .get() because push.apply(_, arraylike) throws on ancient WebKit push.apply( ret, elems.get() ); } return this.pushStack( ret ); }; } ); var rmargin = ( /^margin/ ); var rnumnonpx = new RegExp( "^(" + pnum + ")(?!px)[a-z%]+$", "i" ); var getStyles = function( elem ) { // Support: IE <=11 only, Firefox <=30 (#15098, #14150) // IE throws on elements created in popups // FF meanwhile throws on frame elements through "defaultView.getComputedStyle" var view = elem.ownerDocument.defaultView; if ( !view || !view.opener ) { view = window; } return view.getComputedStyle( elem ); }; ( function() { // Executing both pixelPosition & boxSizingReliable tests require only one layout // so they're executed at the same time to save the second computation. function computeStyleTests() { // This is a singleton, we need to execute it only once if ( !div ) { return; } div.style.cssText = "box-sizing:border-box;" + "position:relative;display:block;" + "margin:auto;border:1px;padding:1px;" + "top:1%;width:50%"; div.innerHTML = ""; documentElement.appendChild( container ); var divStyle = window.getComputedStyle( div ); pixelPositionVal = divStyle.top !== "1%"; // Support: Android 4.0 - 4.3 only, Firefox <=3 - 44 reliableMarginLeftVal = divStyle.marginLeft === "2px"; boxSizingReliableVal = divStyle.width === "4px"; // Support: Android 4.0 - 4.3 only // Some styles come back with percentage values, even though they shouldn't div.style.marginRight = "50%"; pixelMarginRightVal = divStyle.marginRight === "4px"; documentElement.removeChild( container ); // Nullify the div so it wouldn't be stored in the memory and // it will also be a sign that checks already performed div = null; } var pixelPositionVal, boxSizingReliableVal, pixelMarginRightVal, reliableMarginLeftVal, container = document.createElement( "div" ), div = document.createElement( "div" ); // Finish early in limited (non-browser) environments if ( !div.style ) { return; } // Support: IE <=9 - 11 only // Style of cloned element affects source element cloned (#8908) div.style.backgroundClip = "content-box"; div.cloneNode( true ).style.backgroundClip = ""; support.clearCloneStyle = div.style.backgroundClip === "content-box"; container.style.cssText = "border:0;width:8px;height:0;top:0;left:-9999px;" + "padding:0;margin-top:1px;position:absolute"; container.appendChild( div ); jQuery.extend( support, { pixelPosition: function() { computeStyleTests(); return pixelPositionVal; }, boxSizingReliable: function() { computeStyleTests(); return boxSizingReliableVal; }, pixelMarginRight: function() { computeStyleTests(); return pixelMarginRightVal; }, reliableMarginLeft: function() { computeStyleTests(); return reliableMarginLeftVal; } } ); } )(); function curCSS( elem, name, computed ) { var width, minWidth, maxWidth, ret, // Support: Firefox 51+ // Retrieving style before computed somehow // fixes an issue with getting wrong values // on detached elements style = elem.style; computed = computed || getStyles( elem ); // getPropertyValue is needed for: // .css('filter') (IE 9 only, #12537) // .css('--customProperty) (#3144) if ( computed ) { ret = computed.getPropertyValue( name ) || computed[ name ]; if ( ret === "" && !jQuery.contains( elem.ownerDocument, elem ) ) { ret = jQuery.style( elem, name ); } // A tribute to the "awesome hack by Dean Edwards" // Android Browser returns percentage for some values, // but width seems to be reliably pixels. // This is against the CSSOM draft spec: // https://drafts.csswg.org/cssom/#resolved-values if ( !support.pixelMarginRight() && rnumnonpx.test( ret ) && rmargin.test( name ) ) { // Remember the original values width = style.width; minWidth = style.minWidth; maxWidth = style.maxWidth; // Put in the new values to get a computed value out style.minWidth = style.maxWidth = style.width = ret; ret = computed.width; // Revert the changed values style.width = width; style.minWidth = minWidth; style.maxWidth = maxWidth; } } return ret !== undefined ? // Support: IE <=9 - 11 only // IE returns zIndex value as an integer. ret + "" : ret; } function addGetHookIf( conditionFn, hookFn ) { // Define the hook, we'll check on the first run if it's really needed. return { get: function() { if ( conditionFn() ) { // Hook not needed (or it's not possible to use it due // to missing dependency), remove it. delete this.get; return; } // Hook needed; redefine it so that the support test is not executed again. return ( this.get = hookFn ).apply( this, arguments ); } }; } var // Swappable if display is none or starts with table // except "table", "table-cell", or "table-caption" // See here for display values: https://developer.mozilla.org/en-US/docs/CSS/display rdisplayswap = /^(none|table(?!-c[ea]).+)/, rcustomProp = /^--/, cssShow = { position: "absolute", visibility: "hidden", display: "block" }, cssNormalTransform = { letterSpacing: "0", fontWeight: "400" }, cssPrefixes = [ "Webkit", "Moz", "ms" ], emptyStyle = document.createElement( "div" ).style; // Return a css property mapped to a potentially vendor prefixed property function vendorPropName( name ) { // Shortcut for names that are not vendor prefixed if ( name in emptyStyle ) { return name; } // Check for vendor prefixed names var capName = name[ 0 ].toUpperCase() + name.slice( 1 ), i = cssPrefixes.length; while ( i-- ) { name = cssPrefixes[ i ] + capName; if ( name in emptyStyle ) { return name; } } } // Return a property mapped along what jQuery.cssProps suggests or to // a vendor prefixed property. function finalPropName( name ) { var ret = jQuery.cssProps[ name ]; if ( !ret ) { ret = jQuery.cssProps[ name ] = vendorPropName( name ) || name; } return ret; } function setPositiveNumber( elem, value, subtract ) { // Any relative (+/-) values have already been // normalized at this point var matches = rcssNum.exec( value ); return matches ? // Guard against undefined "subtract", e.g., when used as in cssHooks Math.max( 0, matches[ 2 ] - ( subtract || 0 ) ) + ( matches[ 3 ] || "px" ) : value; } function augmentWidthOrHeight( elem, name, extra, isBorderBox, styles ) { var i, val = 0; // If we already have the right measurement, avoid augmentation if ( extra === ( isBorderBox ? "border" : "content" ) ) { i = 4; // Otherwise initialize for horizontal or vertical properties } else { i = name === "width" ? 1 : 0; } for ( ; i < 4; i += 2 ) { // Both box models exclude margin, so add it if we want it if ( extra === "margin" ) { val += jQuery.css( elem, extra + cssExpand[ i ], true, styles ); } if ( isBorderBox ) { // border-box includes padding, so remove it if we want content if ( extra === "content" ) { val -= jQuery.css( elem, "padding" + cssExpand[ i ], true, styles ); } // At this point, extra isn't border nor margin, so remove border if ( extra !== "margin" ) { val -= jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles ); } } else { // At this point, extra isn't content, so add padding val += jQuery.css( elem, "padding" + cssExpand[ i ], true, styles ); // At this point, extra isn't content nor padding, so add border if ( extra !== "padding" ) { val += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles ); } } } return val; } function getWidthOrHeight( elem, name, extra ) { // Start with computed style var valueIsBorderBox, styles = getStyles( elem ), val = curCSS( elem, name, styles ), isBorderBox = jQuery.css( elem, "boxSizing", false, styles ) === "border-box"; // Computed unit is not pixels. Stop here and return. if ( rnumnonpx.test( val ) ) { return val; } // Check for style in case a browser which returns unreliable values // for getComputedStyle silently falls back to the reliable elem.style valueIsBorderBox = isBorderBox && ( support.boxSizingReliable() || val === elem.style[ name ] ); // Fall back to offsetWidth/Height when value is "auto" // This happens for inline elements with no explicit setting (gh-3571) if ( val === "auto" ) { val = elem[ "offset" + name[ 0 ].toUpperCase() + name.slice( 1 ) ]; } // Normalize "", auto, and prepare for extra val = parseFloat( val ) || 0; // Use the active box-sizing model to add/subtract irrelevant styles return ( val + augmentWidthOrHeight( elem, name, extra || ( isBorderBox ? "border" : "content" ), valueIsBorderBox, styles ) ) + "px"; } jQuery.extend( { // Add in style property hooks for overriding the default // behavior of getting and setting a style property cssHooks: { opacity: { get: function( elem, computed ) { if ( computed ) { // We should always get a number back from opacity var ret = curCSS( elem, "opacity" ); return ret === "" ? "1" : ret; } } } }, // Don't automatically add "px" to these possibly-unitless properties cssNumber: { "animationIterationCount": true, "columnCount": true, "fillOpacity": true, "flexGrow": true, "flexShrink": true, "fontWeight": true, "lineHeight": true, "opacity": true, "order": true, "orphans": true, "widows": true, "zIndex": true, "zoom": true }, // Add in properties whose names you wish to fix before // setting or getting the value cssProps: { "float": "cssFloat" }, // Get and set the style property on a DOM Node style: function( elem, name, value, extra ) { // Don't set styles on text and comment nodes if ( !elem || elem.nodeType === 3 || elem.nodeType === 8 || !elem.style ) { return; } // Make sure that we're working with the right name var ret, type, hooks, origName = jQuery.camelCase( name ), isCustomProp = rcustomProp.test( name ), style = elem.style; // Make sure that we're working with the right name. We don't // want to query the value if it is a CSS custom property // since they are user-defined. if ( !isCustomProp ) { name = finalPropName( origName ); } // Gets hook for the prefixed version, then unprefixed version hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ]; // Check if we're setting a value if ( value !== undefined ) { type = typeof value; // Convert "+=" or "-=" to relative numbers (#7345) if ( type === "string" && ( ret = rcssNum.exec( value ) ) && ret[ 1 ] ) { value = adjustCSS( elem, name, ret ); // Fixes bug #9237 type = "number"; } // Make sure that null and NaN values aren't set (#7116) if ( value == null || value !== value ) { return; } // If a number was passed in, add the unit (except for certain CSS properties) if ( type === "number" ) { value += ret && ret[ 3 ] || ( jQuery.cssNumber[ origName ] ? "" : "px" ); } // background-* props affect original clone's values if ( !support.clearCloneStyle && value === "" && name.indexOf( "background" ) === 0 ) { style[ name ] = "inherit"; } // If a hook was provided, use that value, otherwise just set the specified value if ( !hooks || !( "set" in hooks ) || ( value = hooks.set( elem, value, extra ) ) !== undefined ) { if ( isCustomProp ) { style.setProperty( name, value ); } else { style[ name ] = value; } } } else { // If a hook was provided get the non-computed value from there if ( hooks && "get" in hooks && ( ret = hooks.get( elem, false, extra ) ) !== undefined ) { return ret; } // Otherwise just get the value from the style object return style[ name ]; } }, css: function( elem, name, extra, styles ) { var val, num, hooks, origName = jQuery.camelCase( name ), isCustomProp = rcustomProp.test( name ); // Make sure that we're working with the right name. We don't // want to modify the value if it is a CSS custom property // since they are user-defined. if ( !isCustomProp ) { name = finalPropName( origName ); } // Try prefixed name followed by the unprefixed name hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ]; // If a hook was provided get the computed value from there if ( hooks && "get" in hooks ) { val = hooks.get( elem, true, extra ); } // Otherwise, if a way to get the computed value exists, use that if ( val === undefined ) { val = curCSS( elem, name, styles ); } // Convert "normal" to computed value if ( val === "normal" && name in cssNormalTransform ) { val = cssNormalTransform[ name ]; } // Make numeric if forced or a qualifier was provided and val looks numeric if ( extra === "" || extra ) { num = parseFloat( val ); return extra === true || isFinite( num ) ? num || 0 : val; } return val; } } ); jQuery.each( [ "height", "width" ], function( i, name ) { jQuery.cssHooks[ name ] = { get: function( elem, computed, extra ) { if ( computed ) { // Certain elements can have dimension info if we invisibly show them // but it must have a current display style that would benefit return rdisplayswap.test( jQuery.css( elem, "display" ) ) && // Support: Safari 8+ // Table columns in Safari have non-zero offsetWidth & zero // getBoundingClientRect().width unless display is changed. // Support: IE <=11 only // Running getBoundingClientRect on a disconnected node // in IE throws an error. ( !elem.getClientRects().length || !elem.getBoundingClientRect().width ) ? swap( elem, cssShow, function() { return getWidthOrHeight( elem, name, extra ); } ) : getWidthOrHeight( elem, name, extra ); } }, set: function( elem, value, extra ) { var matches, styles = extra && getStyles( elem ), subtract = extra && augmentWidthOrHeight( elem, name, extra, jQuery.css( elem, "boxSizing", false, styles ) === "border-box", styles ); // Convert to pixels if value adjustment is needed if ( subtract && ( matches = rcssNum.exec( value ) ) && ( matches[ 3 ] || "px" ) !== "px" ) { elem.style[ name ] = value; value = jQuery.css( elem, name ); } return setPositiveNumber( elem, value, subtract ); } }; } ); jQuery.cssHooks.marginLeft = addGetHookIf( support.reliableMarginLeft, function( elem, computed ) { if ( computed ) { return ( parseFloat( curCSS( elem, "marginLeft" ) ) || elem.getBoundingClientRect().left - swap( elem, { marginLeft: 0 }, function() { return elem.getBoundingClientRect().left; } ) ) + "px"; } } ); // These hooks are used by animate to expand properties jQuery.each( { margin: "", padding: "", border: "Width" }, function( prefix, suffix ) { jQuery.cssHooks[ prefix + suffix ] = { expand: function( value ) { var i = 0, expanded = {}, // Assumes a single number if not a string parts = typeof value === "string" ? value.split( " " ) : [ value ]; for ( ; i < 4; i++ ) { expanded[ prefix + cssExpand[ i ] + suffix ] = parts[ i ] || parts[ i - 2 ] || parts[ 0 ]; } return expanded; } }; if ( !rmargin.test( prefix ) ) { jQuery.cssHooks[ prefix + suffix ].set = setPositiveNumber; } } ); jQuery.fn.extend( { css: function( name, value ) { return access( this, function( elem, name, value ) { var styles, len, map = {}, i = 0; if ( Array.isArray( name ) ) { styles = getStyles( elem ); len = name.length; for ( ; i < len; i++ ) { map[ name[ i ] ] = jQuery.css( elem, name[ i ], false, styles ); } return map; } return value !== undefined ? jQuery.style( elem, name, value ) : jQuery.css( elem, name ); }, name, value, arguments.length > 1 ); } } ); function Tween( elem, options, prop, end, easing ) { return new Tween.prototype.init( elem, options, prop, end, easing ); } jQuery.Tween = Tween; Tween.prototype = { constructor: Tween, init: function( elem, options, prop, end, easing, unit ) { this.elem = elem; this.prop = prop; this.easing = easing || jQuery.easing._default; this.options = options; this.start = this.now = this.cur(); this.end = end; this.unit = unit || ( jQuery.cssNumber[ prop ] ? "" : "px" ); }, cur: function() { var hooks = Tween.propHooks[ this.prop ]; return hooks && hooks.get ? hooks.get( this ) : Tween.propHooks._default.get( this ); }, run: function( percent ) { var eased, hooks = Tween.propHooks[ this.prop ]; if ( this.options.duration ) { this.pos = eased = jQuery.easing[ this.easing ]( percent, this.options.duration * percent, 0, 1, this.options.duration ); } else { this.pos = eased = percent; } this.now = ( this.end - this.start ) * eased + this.start; if ( this.options.step ) { this.options.step.call( this.elem, this.now, this ); } if ( hooks && hooks.set ) { hooks.set( this ); } else { Tween.propHooks._default.set( this ); } return this; } }; Tween.prototype.init.prototype = Tween.prototype; Tween.propHooks = { _default: { get: function( tween ) { var result; // Use a property on the element directly when it is not a DOM element, // or when there is no matching style property that exists. if ( tween.elem.nodeType !== 1 || tween.elem[ tween.prop ] != null && tween.elem.style[ tween.prop ] == null ) { return tween.elem[ tween.prop ]; } // Passing an empty string as a 3rd parameter to .css will automatically // attempt a parseFloat and fallback to a string if the parse fails. // Simple values such as "10px" are parsed to Float; // complex values such as "rotate(1rad)" are returned as-is. result = jQuery.css( tween.elem, tween.prop, "" ); // Empty strings, null, undefined and "auto" are converted to 0. return !result || result === "auto" ? 0 : result; }, set: function( tween ) { // Use step hook for back compat. // Use cssHook if its there. // Use .style if available and use plain properties where available. if ( jQuery.fx.step[ tween.prop ] ) { jQuery.fx.step[ tween.prop ]( tween ); } else if ( tween.elem.nodeType === 1 && ( tween.elem.style[ jQuery.cssProps[ tween.prop ] ] != null || jQuery.cssHooks[ tween.prop ] ) ) { jQuery.style( tween.elem, tween.prop, tween.now + tween.unit ); } else { tween.elem[ tween.prop ] = tween.now; } } } }; // Support: IE <=9 only // Panic based approach to setting things on disconnected nodes Tween.propHooks.scrollTop = Tween.propHooks.scrollLeft = { set: function( tween ) { if ( tween.elem.nodeType && tween.elem.parentNode ) { tween.elem[ tween.prop ] = tween.now; } } }; jQuery.easing = { linear: function( p ) { return p; }, swing: function( p ) { return 0.5 - Math.cos( p * Math.PI ) / 2; }, _default: "swing" }; jQuery.fx = Tween.prototype.init; // Back compat <1.8 extension point jQuery.fx.step = {}; var fxNow, inProgress, rfxtypes = /^(?:toggle|show|hide)$/, rrun = /queueHooks$/; function schedule() { if ( inProgress ) { if ( document.hidden === false && window.requestAnimationFrame ) { window.requestAnimationFrame( schedule ); } else { window.setTimeout( schedule, jQuery.fx.interval ); } jQuery.fx.tick(); } } // Animations created synchronously will run synchronously function createFxNow() { window.setTimeout( function() { fxNow = undefined; } ); return ( fxNow = jQuery.now() ); } // Generate parameters to create a standard animation function genFx( type, includeWidth ) { var which, i = 0, attrs = { height: type }; // If we include width, step value is 1 to do all cssExpand values, // otherwise step value is 2 to skip over Left and Right includeWidth = includeWidth ? 1 : 0; for ( ; i < 4; i += 2 - includeWidth ) { which = cssExpand[ i ]; attrs[ "margin" + which ] = attrs[ "padding" + which ] = type; } if ( includeWidth ) { attrs.opacity = attrs.width = type; } return attrs; } function createTween( value, prop, animation ) { var tween, collection = ( Animation.tweeners[ prop ] || [] ).concat( Animation.tweeners[ "*" ] ), index = 0, length = collection.length; for ( ; index < length; index++ ) { if ( ( tween = collection[ index ].call( animation, prop, value ) ) ) { // We're done with this property return tween; } } } function defaultPrefilter( elem, props, opts ) { var prop, value, toggle, hooks, oldfire, propTween, restoreDisplay, display, isBox = "width" in props || "height" in props, anim = this, orig = {}, style = elem.style, hidden = elem.nodeType && isHiddenWithinTree( elem ), dataShow = dataPriv.get( elem, "fxshow" ); // Queue-skipping animations hijack the fx hooks if ( !opts.queue ) { hooks = jQuery._queueHooks( elem, "fx" ); if ( hooks.unqueued == null ) { hooks.unqueued = 0; oldfire = hooks.empty.fire; hooks.empty.fire = function() { if ( !hooks.unqueued ) { oldfire(); } }; } hooks.unqueued++; anim.always( function() { // Ensure the complete handler is called before this completes anim.always( function() { hooks.unqueued--; if ( !jQuery.queue( elem, "fx" ).length ) { hooks.empty.fire(); } } ); } ); } // Detect show/hide animations for ( prop in props ) { value = props[ prop ]; if ( rfxtypes.test( value ) ) { delete props[ prop ]; toggle = toggle || value === "toggle"; if ( value === ( hidden ? "hide" : "show" ) ) { // Pretend to be hidden if this is a "show" and // there is still data from a stopped show/hide if ( value === "show" && dataShow && dataShow[ prop ] !== undefined ) { hidden = true; // Ignore all other no-op show/hide data } else { continue; } } orig[ prop ] = dataShow && dataShow[ prop ] || jQuery.style( elem, prop ); } } // Bail out if this is a no-op like .hide().hide() propTween = !jQuery.isEmptyObject( props ); if ( !propTween && jQuery.isEmptyObject( orig ) ) { return; } // Restrict "overflow" and "display" styles during box animations if ( isBox && elem.nodeType === 1 ) { // Support: IE <=9 - 11, Edge 12 - 13 // Record all 3 overflow attributes because IE does not infer the shorthand // from identically-valued overflowX and overflowY opts.overflow = [ style.overflow, style.overflowX, style.overflowY ]; // Identify a display type, preferring old show/hide data over the CSS cascade restoreDisplay = dataShow && dataShow.display; if ( restoreDisplay == null ) { restoreDisplay = dataPriv.get( elem, "display" ); } display = jQuery.css( elem, "display" ); if ( display === "none" ) { if ( restoreDisplay ) { display = restoreDisplay; } else { // Get nonempty value(s) by temporarily forcing visibility showHide( [ elem ], true ); restoreDisplay = elem.style.display || restoreDisplay; display = jQuery.css( elem, "display" ); showHide( [ elem ] ); } } // Animate inline elements as inline-block if ( display === "inline" || display === "inline-block" && restoreDisplay != null ) { if ( jQuery.css( elem, "float" ) === "none" ) { // Restore the original display value at the end of pure show/hide animations if ( !propTween ) { anim.done( function() { style.display = restoreDisplay; } ); if ( restoreDisplay == null ) { display = style.display; restoreDisplay = display === "none" ? "" : display; } } style.display = "inline-block"; } } } if ( opts.overflow ) { style.overflow = "hidden"; anim.always( function() { style.overflow = opts.overflow[ 0 ]; style.overflowX = opts.overflow[ 1 ]; style.overflowY = opts.overflow[ 2 ]; } ); } // Implement show/hide animations propTween = false; for ( prop in orig ) { // General show/hide setup for this element animation if ( !propTween ) { if ( dataShow ) { if ( "hidden" in dataShow ) { hidden = dataShow.hidden; } } else { dataShow = dataPriv.access( elem, "fxshow", { display: restoreDisplay } ); } // Store hidden/visible for toggle so `.stop().toggle()` "reverses" if ( toggle ) { dataShow.hidden = !hidden; } // Show elements before animating them if ( hidden ) { showHide( [ elem ], true ); } /* eslint-disable no-loop-func */ anim.done( function() { /* eslint-enable no-loop-func */ // The final step of a "hide" animation is actually hiding the element if ( !hidden ) { showHide( [ elem ] ); } dataPriv.remove( elem, "fxshow" ); for ( prop in orig ) { jQuery.style( elem, prop, orig[ prop ] ); } } ); } // Per-property setup propTween = createTween( hidden ? dataShow[ prop ] : 0, prop, anim ); if ( !( prop in dataShow ) ) { dataShow[ prop ] = propTween.start; if ( hidden ) { propTween.end = propTween.start; propTween.start = 0; } } } } function propFilter( props, specialEasing ) { var index, name, easing, value, hooks; // camelCase, specialEasing and expand cssHook pass for ( index in props ) { name = jQuery.camelCase( index ); easing = specialEasing[ name ]; value = props[ index ]; if ( Array.isArray( value ) ) { easing = value[ 1 ]; value = props[ index ] = value[ 0 ]; } if ( index !== name ) { props[ name ] = value; delete props[ index ]; } hooks = jQuery.cssHooks[ name ]; if ( hooks && "expand" in hooks ) { value = hooks.expand( value ); delete props[ name ]; // Not quite $.extend, this won't overwrite existing keys. // Reusing 'index' because we have the correct "name" for ( index in value ) { if ( !( index in props ) ) { props[ index ] = value[ index ]; specialEasing[ index ] = easing; } } } else { specialEasing[ name ] = easing; } } } function Animation( elem, properties, options ) { var result, stopped, index = 0, length = Animation.prefilters.length, deferred = jQuery.Deferred().always( function() { // Don't match elem in the :animated selector delete tick.elem; } ), tick = function() { if ( stopped ) { return false; } var currentTime = fxNow || createFxNow(), remaining = Math.max( 0, animation.startTime + animation.duration - currentTime ), // Support: Android 2.3 only // Archaic crash bug won't allow us to use `1 - ( 0.5 || 0 )` (#12497) temp = remaining / animation.duration || 0, percent = 1 - temp, index = 0, length = animation.tweens.length; for ( ; index < length; index++ ) { animation.tweens[ index ].run( percent ); } deferred.notifyWith( elem, [ animation, percent, remaining ] ); // If there's more to do, yield if ( percent < 1 && length ) { return remaining; } // If this was an empty animation, synthesize a final progress notification if ( !length ) { deferred.notifyWith( elem, [ animation, 1, 0 ] ); } // Resolve the animation and report its conclusion deferred.resolveWith( elem, [ animation ] ); return false; }, animation = deferred.promise( { elem: elem, props: jQuery.extend( {}, properties ), opts: jQuery.extend( true, { specialEasing: {}, easing: jQuery.easing._default }, options ), originalProperties: properties, originalOptions: options, startTime: fxNow || createFxNow(), duration: options.duration, tweens: [], createTween: function( prop, end ) { var tween = jQuery.Tween( elem, animation.opts, prop, end, animation.opts.specialEasing[ prop ] || animation.opts.easing ); animation.tweens.push( tween ); return tween; }, stop: function( gotoEnd ) { var index = 0, // If we are going to the end, we want to run all the tweens // otherwise we skip this part length = gotoEnd ? animation.tweens.length : 0; if ( stopped ) { return this; } stopped = true; for ( ; index < length; index++ ) { animation.tweens[ index ].run( 1 ); } // Resolve when we played the last frame; otherwise, reject if ( gotoEnd ) { deferred.notifyWith( elem, [ animation, 1, 0 ] ); deferred.resolveWith( elem, [ animation, gotoEnd ] ); } else { deferred.rejectWith( elem, [ animation, gotoEnd ] ); } return this; } } ), props = animation.props; propFilter( props, animation.opts.specialEasing ); for ( ; index < length; index++ ) { result = Animation.prefilters[ index ].call( animation, elem, props, animation.opts ); if ( result ) { if ( jQuery.isFunction( result.stop ) ) { jQuery._queueHooks( animation.elem, animation.opts.queue ).stop = jQuery.proxy( result.stop, result ); } return result; } } jQuery.map( props, createTween, animation ); if ( jQuery.isFunction( animation.opts.start ) ) { animation.opts.start.call( elem, animation ); } // Attach callbacks from options animation .progress( animation.opts.progress ) .done( animation.opts.done, animation.opts.complete ) .fail( animation.opts.fail ) .always( animation.opts.always ); jQuery.fx.timer( jQuery.extend( tick, { elem: elem, anim: animation, queue: animation.opts.queue } ) ); return animation; } jQuery.Animation = jQuery.extend( Animation, { tweeners: { "*": [ function( prop, value ) { var tween = this.createTween( prop, value ); adjustCSS( tween.elem, prop, rcssNum.exec( value ), tween ); return tween; } ] }, tweener: function( props, callback ) { if ( jQuery.isFunction( props ) ) { callback = props; props = [ "*" ]; } else { props = props.match( rnothtmlwhite ); } var prop, index = 0, length = props.length; for ( ; index < length; index++ ) { prop = props[ index ]; Animation.tweeners[ prop ] = Animation.tweeners[ prop ] || []; Animation.tweeners[ prop ].unshift( callback ); } }, prefilters: [ defaultPrefilter ], prefilter: function( callback, prepend ) { if ( prepend ) { Animation.prefilters.unshift( callback ); } else { Animation.prefilters.push( callback ); } } } ); jQuery.speed = function( speed, easing, fn ) { var opt = speed && typeof speed === "object" ? jQuery.extend( {}, speed ) : { complete: fn || !fn && easing || jQuery.isFunction( speed ) && speed, duration: speed, easing: fn && easing || easing && !jQuery.isFunction( easing ) && easing }; // Go to the end state if fx are off if ( jQuery.fx.off ) { opt.duration = 0; } else { if ( typeof opt.duration !== "number" ) { if ( opt.duration in jQuery.fx.speeds ) { opt.duration = jQuery.fx.speeds[ opt.duration ]; } else { opt.duration = jQuery.fx.speeds._default; } } } // Normalize opt.queue - true/undefined/null -> "fx" if ( opt.queue == null || opt.queue === true ) { opt.queue = "fx"; } // Queueing opt.old = opt.complete; opt.complete = function() { if ( jQuery.isFunction( opt.old ) ) { opt.old.call( this ); } if ( opt.queue ) { jQuery.dequeue( this, opt.queue ); } }; return opt; }; jQuery.fn.extend( { fadeTo: function( speed, to, easing, callback ) { // Show any hidden elements after setting opacity to 0 return this.filter( isHiddenWithinTree ).css( "opacity", 0 ).show() // Animate to the value specified .end().animate( { opacity: to }, speed, easing, callback ); }, animate: function( prop, speed, easing, callback ) { var empty = jQuery.isEmptyObject( prop ), optall = jQuery.speed( speed, easing, callback ), doAnimation = function() { // Operate on a copy of prop so per-property easing won't be lost var anim = Animation( this, jQuery.extend( {}, prop ), optall ); // Empty animations, or finishing resolves immediately if ( empty || dataPriv.get( this, "finish" ) ) { anim.stop( true ); } }; doAnimation.finish = doAnimation; return empty || optall.queue === false ? this.each( doAnimation ) : this.queue( optall.queue, doAnimation ); }, stop: function( type, clearQueue, gotoEnd ) { var stopQueue = function( hooks ) { var stop = hooks.stop; delete hooks.stop; stop( gotoEnd ); }; if ( typeof type !== "string" ) { gotoEnd = clearQueue; clearQueue = type; type = undefined; } if ( clearQueue && type !== false ) { this.queue( type || "fx", [] ); } return this.each( function() { var dequeue = true, index = type != null && type + "queueHooks", timers = jQuery.timers, data = dataPriv.get( this ); if ( index ) { if ( data[ index ] && data[ index ].stop ) { stopQueue( data[ index ] ); } } else { for ( index in data ) { if ( data[ index ] && data[ index ].stop && rrun.test( index ) ) { stopQueue( data[ index ] ); } } } for ( index = timers.length; index--; ) { if ( timers[ index ].elem === this && ( type == null || timers[ index ].queue === type ) ) { timers[ index ].anim.stop( gotoEnd ); dequeue = false; timers.splice( index, 1 ); } } // Start the next in the queue if the last step wasn't forced. // Timers currently will call their complete callbacks, which // will dequeue but only if they were gotoEnd. if ( dequeue || !gotoEnd ) { jQuery.dequeue( this, type ); } } ); }, finish: function( type ) { if ( type !== false ) { type = type || "fx"; } return this.each( function() { var index, data = dataPriv.get( this ), queue = data[ type + "queue" ], hooks = data[ type + "queueHooks" ], timers = jQuery.timers, length = queue ? queue.length : 0; // Enable finishing flag on private data data.finish = true; // Empty the queue first jQuery.queue( this, type, [] ); if ( hooks && hooks.stop ) { hooks.stop.call( this, true ); } // Look for any active animations, and finish them for ( index = timers.length; index--; ) { if ( timers[ index ].elem === this && timers[ index ].queue === type ) { timers[ index ].anim.stop( true ); timers.splice( index, 1 ); } } // Look for any animations in the old queue and finish them for ( index = 0; index < length; index++ ) { if ( queue[ index ] && queue[ index ].finish ) { queue[ index ].finish.call( this ); } } // Turn off finishing flag delete data.finish; } ); } } ); jQuery.each( [ "toggle", "show", "hide" ], function( i, name ) { var cssFn = jQuery.fn[ name ]; jQuery.fn[ name ] = function( speed, easing, callback ) { return speed == null || typeof speed === "boolean" ? cssFn.apply( this, arguments ) : this.animate( genFx( name, true ), speed, easing, callback ); }; } ); // Generate shortcuts for custom animations jQuery.each( { slideDown: genFx( "show" ), slideUp: genFx( "hide" ), slideToggle: genFx( "toggle" ), fadeIn: { opacity: "show" }, fadeOut: { opacity: "hide" }, fadeToggle: { opacity: "toggle" } }, function( name, props ) { jQuery.fn[ name ] = function( speed, easing, callback ) { return this.animate( props, speed, easing, callback ); }; } ); jQuery.timers = []; jQuery.fx.tick = function() { var timer, i = 0, timers = jQuery.timers; fxNow = jQuery.now(); for ( ; i < timers.length; i++ ) { timer = timers[ i ]; // Run the timer and safely remove it when done (allowing for external removal) if ( !timer() && timers[ i ] === timer ) { timers.splice( i--, 1 ); } } if ( !timers.length ) { jQuery.fx.stop(); } fxNow = undefined; }; jQuery.fx.timer = function( timer ) { jQuery.timers.push( timer ); jQuery.fx.start(); }; jQuery.fx.interval = 13; jQuery.fx.start = function() { if ( inProgress ) { return; } inProgress = true; schedule(); }; jQuery.fx.stop = function() { inProgress = null; }; jQuery.fx.speeds = { slow: 600, fast: 200, // Default speed _default: 400 }; // Based off of the plugin by Clint Helfers, with permission. // https://web.archive.org/web/20100324014747/http://blindsignals.com/index.php/2009/07/jquery-delay/ jQuery.fn.delay = function( time, type ) { time = jQuery.fx ? jQuery.fx.speeds[ time ] || time : time; type = type || "fx"; return this.queue( type, function( next, hooks ) { var timeout = window.setTimeout( next, time ); hooks.stop = function() { window.clearTimeout( timeout ); }; } ); }; ( function() { var input = document.createElement( "input" ), select = document.createElement( "select" ), opt = select.appendChild( document.createElement( "option" ) ); input.type = "checkbox"; // Support: Android <=4.3 only // Default value for a checkbox should be "on" support.checkOn = input.value !== ""; // Support: IE <=11 only // Must access selectedIndex to make default options select support.optSelected = opt.selected; // Support: IE <=11 only // An input loses its value after becoming a radio input = document.createElement( "input" ); input.value = "t"; input.type = "radio"; support.radioValue = input.value === "t"; } )(); var boolHook, attrHandle = jQuery.expr.attrHandle; jQuery.fn.extend( { attr: function( name, value ) { return access( this, jQuery.attr, name, value, arguments.length > 1 ); }, removeAttr: function( name ) { return this.each( function() { jQuery.removeAttr( this, name ); } ); } } ); jQuery.extend( { attr: function( elem, name, value ) { var ret, hooks, nType = elem.nodeType; // Don't get/set attributes on text, comment and attribute nodes if ( nType === 3 || nType === 8 || nType === 2 ) { return; } // Fallback to prop when attributes are not supported if ( typeof elem.getAttribute === "undefined" ) { return jQuery.prop( elem, name, value ); } // Attribute hooks are determined by the lowercase version // Grab necessary hook if one is defined if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) { hooks = jQuery.attrHooks[ name.toLowerCase() ] || ( jQuery.expr.match.bool.test( name ) ? boolHook : undefined ); } if ( value !== undefined ) { if ( value === null ) { jQuery.removeAttr( elem, name ); return; } if ( hooks && "set" in hooks && ( ret = hooks.set( elem, value, name ) ) !== undefined ) { return ret; } elem.setAttribute( name, value + "" ); return value; } if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) { return ret; } ret = jQuery.find.attr( elem, name ); // Non-existent attributes return null, we normalize to undefined return ret == null ? undefined : ret; }, attrHooks: { type: { set: function( elem, value ) { if ( !support.radioValue && value === "radio" && nodeName( elem, "input" ) ) { var val = elem.value; elem.setAttribute( "type", value ); if ( val ) { elem.value = val; } return value; } } } }, removeAttr: function( elem, value ) { var name, i = 0, // Attribute names can contain non-HTML whitespace characters // https://html.spec.whatwg.org/multipage/syntax.html#attributes-2 attrNames = value && value.match( rnothtmlwhite ); if ( attrNames && elem.nodeType === 1 ) { while ( ( name = attrNames[ i++ ] ) ) { elem.removeAttribute( name ); } } } } ); // Hooks for boolean attributes boolHook = { set: function( elem, value, name ) { if ( value === false ) { // Remove boolean attributes when set to false jQuery.removeAttr( elem, name ); } else { elem.setAttribute( name, name ); } return name; } }; jQuery.each( jQuery.expr.match.bool.source.match( /\w+/g ), function( i, name ) { var getter = attrHandle[ name ] || jQuery.find.attr; attrHandle[ name ] = function( elem, name, isXML ) { var ret, handle, lowercaseName = name.toLowerCase(); if ( !isXML ) { // Avoid an infinite loop by temporarily removing this function from the getter handle = attrHandle[ lowercaseName ]; attrHandle[ lowercaseName ] = ret; ret = getter( elem, name, isXML ) != null ? lowercaseName : null; attrHandle[ lowercaseName ] = handle; } return ret; }; } ); var rfocusable = /^(?:input|select|textarea|button)$/i, rclickable = /^(?:a|area)$/i; jQuery.fn.extend( { prop: function( name, value ) { return access( this, jQuery.prop, name, value, arguments.length > 1 ); }, removeProp: function( name ) { return this.each( function() { delete this[ jQuery.propFix[ name ] || name ]; } ); } } ); jQuery.extend( { prop: function( elem, name, value ) { var ret, hooks, nType = elem.nodeType; // Don't get/set properties on text, comment and attribute nodes if ( nType === 3 || nType === 8 || nType === 2 ) { return; } if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) { // Fix name and attach hooks name = jQuery.propFix[ name ] || name; hooks = jQuery.propHooks[ name ]; } if ( value !== undefined ) { if ( hooks && "set" in hooks && ( ret = hooks.set( elem, value, name ) ) !== undefined ) { return ret; } return ( elem[ name ] = value ); } if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) { return ret; } return elem[ name ]; }, propHooks: { tabIndex: { get: function( elem ) { // Support: IE <=9 - 11 only // elem.tabIndex doesn't always return the // correct value when it hasn't been explicitly set // https://web.archive.org/web/20141116233347/http://fluidproject.org/blog/2008/01/09/getting-setting-and-removing-tabindex-values-with-javascript/ // Use proper attribute retrieval(#12072) var tabindex = jQuery.find.attr( elem, "tabindex" ); if ( tabindex ) { return parseInt( tabindex, 10 ); } if ( rfocusable.test( elem.nodeName ) || rclickable.test( elem.nodeName ) && elem.href ) { return 0; } return -1; } } }, propFix: { "for": "htmlFor", "class": "className" } } ); // Support: IE <=11 only // Accessing the selectedIndex property // forces the browser to respect setting selected // on the option // The getter ensures a default option is selected // when in an optgroup // eslint rule "no-unused-expressions" is disabled for this code // since it considers such accessions noop if ( !support.optSelected ) { jQuery.propHooks.selected = { get: function( elem ) { /* eslint no-unused-expressions: "off" */ var parent = elem.parentNode; if ( parent && parent.parentNode ) { parent.parentNode.selectedIndex; } return null; }, set: function( elem ) { /* eslint no-unused-expressions: "off" */ var parent = elem.parentNode; if ( parent ) { parent.selectedIndex; if ( parent.parentNode ) { parent.parentNode.selectedIndex; } } } }; } jQuery.each( [ "tabIndex", "readOnly", "maxLength", "cellSpacing", "cellPadding", "rowSpan", "colSpan", "useMap", "frameBorder", "contentEditable" ], function() { jQuery.propFix[ this.toLowerCase() ] = this; } ); // Strip and collapse whitespace according to HTML spec // https://html.spec.whatwg.org/multipage/infrastructure.html#strip-and-collapse-whitespace function stripAndCollapse( value ) { var tokens = value.match( rnothtmlwhite ) || []; return tokens.join( " " ); } function getClass( elem ) { return elem.getAttribute && elem.getAttribute( "class" ) || ""; } jQuery.fn.extend( { addClass: function( value ) { var classes, elem, cur, curValue, clazz, j, finalValue, i = 0; if ( jQuery.isFunction( value ) ) { return this.each( function( j ) { jQuery( this ).addClass( value.call( this, j, getClass( this ) ) ); } ); } if ( typeof value === "string" && value ) { classes = value.match( rnothtmlwhite ) || []; while ( ( elem = this[ i++ ] ) ) { curValue = getClass( elem ); cur = elem.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " ); if ( cur ) { j = 0; while ( ( clazz = classes[ j++ ] ) ) { if ( cur.indexOf( " " + clazz + " " ) < 0 ) { cur += clazz + " "; } } // Only assign if different to avoid unneeded rendering. finalValue = stripAndCollapse( cur ); if ( curValue !== finalValue ) { elem.setAttribute( "class", finalValue ); } } } } return this; }, removeClass: function( value ) { var classes, elem, cur, curValue, clazz, j, finalValue, i = 0; if ( jQuery.isFunction( value ) ) { return this.each( function( j ) { jQuery( this ).removeClass( value.call( this, j, getClass( this ) ) ); } ); } if ( !arguments.length ) { return this.attr( "class", "" ); } if ( typeof value === "string" && value ) { classes = value.match( rnothtmlwhite ) || []; while ( ( elem = this[ i++ ] ) ) { curValue = getClass( elem ); // This expression is here for better compressibility (see addClass) cur = elem.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " ); if ( cur ) { j = 0; while ( ( clazz = classes[ j++ ] ) ) { // Remove *all* instances while ( cur.indexOf( " " + clazz + " " ) > -1 ) { cur = cur.replace( " " + clazz + " ", " " ); } } // Only assign if different to avoid unneeded rendering. finalValue = stripAndCollapse( cur ); if ( curValue !== finalValue ) { elem.setAttribute( "class", finalValue ); } } } } return this; }, toggleClass: function( value, stateVal ) { var type = typeof value; if ( typeof stateVal === "boolean" && type === "string" ) { return stateVal ? this.addClass( value ) : this.removeClass( value ); } if ( jQuery.isFunction( value ) ) { return this.each( function( i ) { jQuery( this ).toggleClass( value.call( this, i, getClass( this ), stateVal ), stateVal ); } ); } return this.each( function() { var className, i, self, classNames; if ( type === "string" ) { // Toggle individual class names i = 0; self = jQuery( this ); classNames = value.match( rnothtmlwhite ) || []; while ( ( className = classNames[ i++ ] ) ) { // Check each className given, space separated list if ( self.hasClass( className ) ) { self.removeClass( className ); } else { self.addClass( className ); } } // Toggle whole class name } else if ( value === undefined || type === "boolean" ) { className = getClass( this ); if ( className ) { // Store className if set dataPriv.set( this, "__className__", className ); } // If the element has a class name or if we're passed `false`, // then remove the whole classname (if there was one, the above saved it). // Otherwise bring back whatever was previously saved (if anything), // falling back to the empty string if nothing was stored. if ( this.setAttribute ) { this.setAttribute( "class", className || value === false ? "" : dataPriv.get( this, "__className__" ) || "" ); } } } ); }, hasClass: function( selector ) { var className, elem, i = 0; className = " " + selector + " "; while ( ( elem = this[ i++ ] ) ) { if ( elem.nodeType === 1 && ( " " + stripAndCollapse( getClass( elem ) ) + " " ).indexOf( className ) > -1 ) { return true; } } return false; } } ); var rreturn = /\r/g; jQuery.fn.extend( { val: function( value ) { var hooks, ret, isFunction, elem = this[ 0 ]; if ( !arguments.length ) { if ( elem ) { hooks = jQuery.valHooks[ elem.type ] || jQuery.valHooks[ elem.nodeName.toLowerCase() ]; if ( hooks && "get" in hooks && ( ret = hooks.get( elem, "value" ) ) !== undefined ) { return ret; } ret = elem.value; // Handle most common string cases if ( typeof ret === "string" ) { return ret.replace( rreturn, "" ); } // Handle cases where value is null/undef or number return ret == null ? "" : ret; } return; } isFunction = jQuery.isFunction( value ); return this.each( function( i ) { var val; if ( this.nodeType !== 1 ) { return; } if ( isFunction ) { val = value.call( this, i, jQuery( this ).val() ); } else { val = value; } // Treat null/undefined as ""; convert numbers to string if ( val == null ) { val = ""; } else if ( typeof val === "number" ) { val += ""; } else if ( Array.isArray( val ) ) { val = jQuery.map( val, function( value ) { return value == null ? "" : value + ""; } ); } hooks = jQuery.valHooks[ this.type ] || jQuery.valHooks[ this.nodeName.toLowerCase() ]; // If set returns undefined, fall back to normal setting if ( !hooks || !( "set" in hooks ) || hooks.set( this, val, "value" ) === undefined ) { this.value = val; } } ); } } ); jQuery.extend( { valHooks: { option: { get: function( elem ) { var val = jQuery.find.attr( elem, "value" ); return val != null ? val : // Support: IE <=10 - 11 only // option.text throws exceptions (#14686, #14858) // Strip and collapse whitespace // https://html.spec.whatwg.org/#strip-and-collapse-whitespace stripAndCollapse( jQuery.text( elem ) ); } }, select: { get: function( elem ) { var value, option, i, options = elem.options, index = elem.selectedIndex, one = elem.type === "select-one", values = one ? null : [], max = one ? index + 1 : options.length; if ( index < 0 ) { i = max; } else { i = one ? index : 0; } // Loop through all the selected options for ( ; i < max; i++ ) { option = options[ i ]; // Support: IE <=9 only // IE8-9 doesn't update selected after form reset (#2551) if ( ( option.selected || i === index ) && // Don't return options that are disabled or in a disabled optgroup !option.disabled && ( !option.parentNode.disabled || !nodeName( option.parentNode, "optgroup" ) ) ) { // Get the specific value for the option value = jQuery( option ).val(); // We don't need an array for one selects if ( one ) { return value; } // Multi-Selects return an array values.push( value ); } } return values; }, set: function( elem, value ) { var optionSet, option, options = elem.options, values = jQuery.makeArray( value ), i = options.length; while ( i-- ) { option = options[ i ]; /* eslint-disable no-cond-assign */ if ( option.selected = jQuery.inArray( jQuery.valHooks.option.get( option ), values ) > -1 ) { optionSet = true; } /* eslint-enable no-cond-assign */ } // Force browsers to behave consistently when non-matching value is set if ( !optionSet ) { elem.selectedIndex = -1; } return values; } } } } ); // Radios and checkboxes getter/setter jQuery.each( [ "radio", "checkbox" ], function() { jQuery.valHooks[ this ] = { set: function( elem, value ) { if ( Array.isArray( value ) ) { return ( elem.checked = jQuery.inArray( jQuery( elem ).val(), value ) > -1 ); } } }; if ( !support.checkOn ) { jQuery.valHooks[ this ].get = function( elem ) { return elem.getAttribute( "value" ) === null ? "on" : elem.value; }; } } ); // Return jQuery for attributes-only inclusion var rfocusMorph = /^(?:focusinfocus|focusoutblur)$/; jQuery.extend( jQuery.event, { trigger: function( event, data, elem, onlyHandlers ) { var i, cur, tmp, bubbleType, ontype, handle, special, eventPath = [ elem || document ], type = hasOwn.call( event, "type" ) ? event.type : event, namespaces = hasOwn.call( event, "namespace" ) ? event.namespace.split( "." ) : []; cur = tmp = elem = elem || document; // Don't do events on text and comment nodes if ( elem.nodeType === 3 || elem.nodeType === 8 ) { return; } // focus/blur morphs to focusin/out; ensure we're not firing them right now if ( rfocusMorph.test( type + jQuery.event.triggered ) ) { return; } if ( type.indexOf( "." ) > -1 ) { // Namespaced trigger; create a regexp to match event type in handle() namespaces = type.split( "." ); type = namespaces.shift(); namespaces.sort(); } ontype = type.indexOf( ":" ) < 0 && "on" + type; // Caller can pass in a jQuery.Event object, Object, or just an event type string event = event[ jQuery.expando ] ? event : new jQuery.Event( type, typeof event === "object" && event ); // Trigger bitmask: & 1 for native handlers; & 2 for jQuery (always true) event.isTrigger = onlyHandlers ? 2 : 3; event.namespace = namespaces.join( "." ); event.rnamespace = event.namespace ? new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" ) : null; // Clean up the event in case it is being reused event.result = undefined; if ( !event.target ) { event.target = elem; } // Clone any incoming data and prepend the event, creating the handler arg list data = data == null ? [ event ] : jQuery.makeArray( data, [ event ] ); // Allow special events to draw outside the lines special = jQuery.event.special[ type ] || {}; if ( !onlyHandlers && special.trigger && special.trigger.apply( elem, data ) === false ) { return; } // Determine event propagation path in advance, per W3C events spec (#9951) // Bubble up to document, then to window; watch for a global ownerDocument var (#9724) if ( !onlyHandlers && !special.noBubble && !jQuery.isWindow( elem ) ) { bubbleType = special.delegateType || type; if ( !rfocusMorph.test( bubbleType + type ) ) { cur = cur.parentNode; } for ( ; cur; cur = cur.parentNode ) { eventPath.push( cur ); tmp = cur; } // Only add window if we got to document (e.g., not plain obj or detached DOM) if ( tmp === ( elem.ownerDocument || document ) ) { eventPath.push( tmp.defaultView || tmp.parentWindow || window ); } } // Fire handlers on the event path i = 0; while ( ( cur = eventPath[ i++ ] ) && !event.isPropagationStopped() ) { event.type = i > 1 ? bubbleType : special.bindType || type; // jQuery handler handle = ( dataPriv.get( cur, "events" ) || {} )[ event.type ] && dataPriv.get( cur, "handle" ); if ( handle ) { handle.apply( cur, data ); } // Native handler handle = ontype && cur[ ontype ]; if ( handle && handle.apply && acceptData( cur ) ) { event.result = handle.apply( cur, data ); if ( event.result === false ) { event.preventDefault(); } } } event.type = type; // If nobody prevented the default action, do it now if ( !onlyHandlers && !event.isDefaultPrevented() ) { if ( ( !special._default || special._default.apply( eventPath.pop(), data ) === false ) && acceptData( elem ) ) { // Call a native DOM method on the target with the same name as the event. // Don't do default actions on window, that's where global variables be (#6170) if ( ontype && jQuery.isFunction( elem[ type ] ) && !jQuery.isWindow( elem ) ) { // Don't re-trigger an onFOO event when we call its FOO() method tmp = elem[ ontype ]; if ( tmp ) { elem[ ontype ] = null; } // Prevent re-triggering of the same event, since we already bubbled it above jQuery.event.triggered = type; elem[ type ](); jQuery.event.triggered = undefined; if ( tmp ) { elem[ ontype ] = tmp; } } } } return event.result; }, // Piggyback on a donor event to simulate a different one // Used only for `focus(in | out)` events simulate: function( type, elem, event ) { var e = jQuery.extend( new jQuery.Event(), event, { type: type, isSimulated: true } ); jQuery.event.trigger( e, null, elem ); } } ); jQuery.fn.extend( { trigger: function( type, data ) { return this.each( function() { jQuery.event.trigger( type, data, this ); } ); }, triggerHandler: function( type, data ) { var elem = this[ 0 ]; if ( elem ) { return jQuery.event.trigger( type, data, elem, true ); } } } ); jQuery.each( ( "blur focus focusin focusout resize scroll click dblclick " + "mousedown mouseup mousemove mouseover mouseout mouseenter mouseleave " + "change select submit keydown keypress keyup contextmenu" ).split( " " ), function( i, name ) { // Handle event binding jQuery.fn[ name ] = function( data, fn ) { return arguments.length > 0 ? this.on( name, null, data, fn ) : this.trigger( name ); }; } ); jQuery.fn.extend( { hover: function( fnOver, fnOut ) { return this.mouseenter( fnOver ).mouseleave( fnOut || fnOver ); } } ); support.focusin = "onfocusin" in window; // Support: Firefox <=44 // Firefox doesn't have focus(in | out) events // Related ticket - https://bugzilla.mozilla.org/show_bug.cgi?id=687787 // // Support: Chrome <=48 - 49, Safari <=9.0 - 9.1 // focus(in | out) events fire after focus & blur events, // which is spec violation - http://www.w3.org/TR/DOM-Level-3-Events/#events-focusevent-event-order // Related ticket - https://bugs.chromium.org/p/chromium/issues/detail?id=449857 if ( !support.focusin ) { jQuery.each( { focus: "focusin", blur: "focusout" }, function( orig, fix ) { // Attach a single capturing handler on the document while someone wants focusin/focusout var handler = function( event ) { jQuery.event.simulate( fix, event.target, jQuery.event.fix( event ) ); }; jQuery.event.special[ fix ] = { setup: function() { var doc = this.ownerDocument || this, attaches = dataPriv.access( doc, fix ); if ( !attaches ) { doc.addEventListener( orig, handler, true ); } dataPriv.access( doc, fix, ( attaches || 0 ) + 1 ); }, teardown: function() { var doc = this.ownerDocument || this, attaches = dataPriv.access( doc, fix ) - 1; if ( !attaches ) { doc.removeEventListener( orig, handler, true ); dataPriv.remove( doc, fix ); } else { dataPriv.access( doc, fix, attaches ); } } }; } ); } var location = window.location; var nonce = jQuery.now(); var rquery = ( /\?/ ); // Cross-browser xml parsing jQuery.parseXML = function( data ) { var xml; if ( !data || typeof data !== "string" ) { return null; } // Support: IE 9 - 11 only // IE throws on parseFromString with invalid input. try { xml = ( new window.DOMParser() ).parseFromString( data, "text/xml" ); } catch ( e ) { xml = undefined; } if ( !xml || xml.getElementsByTagName( "parsererror" ).length ) { jQuery.error( "Invalid XML: " + data ); } return xml; }; var rbracket = /\[\]$/, rCRLF = /\r?\n/g, rsubmitterTypes = /^(?:submit|button|image|reset|file)$/i, rsubmittable = /^(?:input|select|textarea|keygen)/i; function buildParams( prefix, obj, traditional, add ) { var name; if ( Array.isArray( obj ) ) { // Serialize array item. jQuery.each( obj, function( i, v ) { if ( traditional || rbracket.test( prefix ) ) { // Treat each array item as a scalar. add( prefix, v ); } else { // Item is non-scalar (array or object), encode its numeric index. buildParams( prefix + "[" + ( typeof v === "object" && v != null ? i : "" ) + "]", v, traditional, add ); } } ); } else if ( !traditional && jQuery.type( obj ) === "object" ) { // Serialize object item. for ( name in obj ) { buildParams( prefix + "[" + name + "]", obj[ name ], traditional, add ); } } else { // Serialize scalar item. add( prefix, obj ); } } // Serialize an array of form elements or a set of // key/values into a query string jQuery.param = function( a, traditional ) { var prefix, s = [], add = function( key, valueOrFunction ) { // If value is a function, invoke it and use its return value var value = jQuery.isFunction( valueOrFunction ) ? valueOrFunction() : valueOrFunction; s[ s.length ] = encodeURIComponent( key ) + "=" + encodeURIComponent( value == null ? "" : value ); }; // If an array was passed in, assume that it is an array of form elements. if ( Array.isArray( a ) || ( a.jquery && !jQuery.isPlainObject( a ) ) ) { // Serialize the form elements jQuery.each( a, function() { add( this.name, this.value ); } ); } else { // If traditional, encode the "old" way (the way 1.3.2 or older // did it), otherwise encode params recursively. for ( prefix in a ) { buildParams( prefix, a[ prefix ], traditional, add ); } } // Return the resulting serialization return s.join( "&" ); }; jQuery.fn.extend( { serialize: function() { return jQuery.param( this.serializeArray() ); }, serializeArray: function() { return this.map( function() { // Can add propHook for "elements" to filter or add form elements var elements = jQuery.prop( this, "elements" ); return elements ? jQuery.makeArray( elements ) : this; } ) .filter( function() { var type = this.type; // Use .is( ":disabled" ) so that fieldset[disabled] works return this.name && !jQuery( this ).is( ":disabled" ) && rsubmittable.test( this.nodeName ) && !rsubmitterTypes.test( type ) && ( this.checked || !rcheckableType.test( type ) ); } ) .map( function( i, elem ) { var val = jQuery( this ).val(); if ( val == null ) { return null; } if ( Array.isArray( val ) ) { return jQuery.map( val, function( val ) { return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) }; } ); } return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) }; } ).get(); } } ); var r20 = /%20/g, rhash = /#.*$/, rantiCache = /([?&])_=[^&]*/, rheaders = /^(.*?):[ \t]*([^\r\n]*)$/mg, // #7653, #8125, #8152: local protocol detection rlocalProtocol = /^(?:about|app|app-storage|.+-extension|file|res|widget):$/, rnoContent = /^(?:GET|HEAD)$/, rprotocol = /^\/\//, /* Prefilters * 1) They are useful to introduce custom dataTypes (see ajax/jsonp.js for an example) * 2) These are called: * - BEFORE asking for a transport * - AFTER param serialization (s.data is a string if s.processData is true) * 3) key is the dataType * 4) the catchall symbol "*" can be used * 5) execution will start with transport dataType and THEN continue down to "*" if needed */ prefilters = {}, /* Transports bindings * 1) key is the dataType * 2) the catchall symbol "*" can be used * 3) selection will start with transport dataType and THEN go to "*" if needed */ transports = {}, // Avoid comment-prolog char sequence (#10098); must appease lint and evade compression allTypes = "*/".concat( "*" ), // Anchor tag for parsing the document origin originAnchor = document.createElement( "a" ); originAnchor.href = location.href; // Base "constructor" for jQuery.ajaxPrefilter and jQuery.ajaxTransport function addToPrefiltersOrTransports( structure ) { // dataTypeExpression is optional and defaults to "*" return function( dataTypeExpression, func ) { if ( typeof dataTypeExpression !== "string" ) { func = dataTypeExpression; dataTypeExpression = "*"; } var dataType, i = 0, dataTypes = dataTypeExpression.toLowerCase().match( rnothtmlwhite ) || []; if ( jQuery.isFunction( func ) ) { // For each dataType in the dataTypeExpression while ( ( dataType = dataTypes[ i++ ] ) ) { // Prepend if requested if ( dataType[ 0 ] === "+" ) { dataType = dataType.slice( 1 ) || "*"; ( structure[ dataType ] = structure[ dataType ] || [] ).unshift( func ); // Otherwise append } else { ( structure[ dataType ] = structure[ dataType ] || [] ).push( func ); } } } }; } // Base inspection function for prefilters and transports function inspectPrefiltersOrTransports( structure, options, originalOptions, jqXHR ) { var inspected = {}, seekingTransport = ( structure === transports ); function inspect( dataType ) { var selected; inspected[ dataType ] = true; jQuery.each( structure[ dataType ] || [], function( _, prefilterOrFactory ) { var dataTypeOrTransport = prefilterOrFactory( options, originalOptions, jqXHR ); if ( typeof dataTypeOrTransport === "string" && !seekingTransport && !inspected[ dataTypeOrTransport ] ) { options.dataTypes.unshift( dataTypeOrTransport ); inspect( dataTypeOrTransport ); return false; } else if ( seekingTransport ) { return !( selected = dataTypeOrTransport ); } } ); return selected; } return inspect( options.dataTypes[ 0 ] ) || !inspected[ "*" ] && inspect( "*" ); } // A special extend for ajax options // that takes "flat" options (not to be deep extended) // Fixes #9887 function ajaxExtend( target, src ) { var key, deep, flatOptions = jQuery.ajaxSettings.flatOptions || {}; for ( key in src ) { if ( src[ key ] !== undefined ) { ( flatOptions[ key ] ? target : ( deep || ( deep = {} ) ) )[ key ] = src[ key ]; } } if ( deep ) { jQuery.extend( true, target, deep ); } return target; } /* Handles responses to an ajax request: * - finds the right dataType (mediates between content-type and expected dataType) * - returns the corresponding response */ function ajaxHandleResponses( s, jqXHR, responses ) { var ct, type, finalDataType, firstDataType, contents = s.contents, dataTypes = s.dataTypes; // Remove auto dataType and get content-type in the process while ( dataTypes[ 0 ] === "*" ) { dataTypes.shift(); if ( ct === undefined ) { ct = s.mimeType || jqXHR.getResponseHeader( "Content-Type" ); } } // Check if we're dealing with a known content-type if ( ct ) { for ( type in contents ) { if ( contents[ type ] && contents[ type ].test( ct ) ) { dataTypes.unshift( type ); break; } } } // Check to see if we have a response for the expected dataType if ( dataTypes[ 0 ] in responses ) { finalDataType = dataTypes[ 0 ]; } else { // Try convertible dataTypes for ( type in responses ) { if ( !dataTypes[ 0 ] || s.converters[ type + " " + dataTypes[ 0 ] ] ) { finalDataType = type; break; } if ( !firstDataType ) { firstDataType = type; } } // Or just use first one finalDataType = finalDataType || firstDataType; } // If we found a dataType // We add the dataType to the list if needed // and return the corresponding response if ( finalDataType ) { if ( finalDataType !== dataTypes[ 0 ] ) { dataTypes.unshift( finalDataType ); } return responses[ finalDataType ]; } } /* Chain conversions given the request and the original response * Also sets the responseXXX fields on the jqXHR instance */ function ajaxConvert( s, response, jqXHR, isSuccess ) { var conv2, current, conv, tmp, prev, converters = {}, // Work with a copy of dataTypes in case we need to modify it for conversion dataTypes = s.dataTypes.slice(); // Create converters map with lowercased keys if ( dataTypes[ 1 ] ) { for ( conv in s.converters ) { converters[ conv.toLowerCase() ] = s.converters[ conv ]; } } current = dataTypes.shift(); // Convert to each sequential dataType while ( current ) { if ( s.responseFields[ current ] ) { jqXHR[ s.responseFields[ current ] ] = response; } // Apply the dataFilter if provided if ( !prev && isSuccess && s.dataFilter ) { response = s.dataFilter( response, s.dataType ); } prev = current; current = dataTypes.shift(); if ( current ) { // There's only work to do if current dataType is non-auto if ( current === "*" ) { current = prev; // Convert response if prev dataType is non-auto and differs from current } else if ( prev !== "*" && prev !== current ) { // Seek a direct converter conv = converters[ prev + " " + current ] || converters[ "* " + current ]; // If none found, seek a pair if ( !conv ) { for ( conv2 in converters ) { // If conv2 outputs current tmp = conv2.split( " " ); if ( tmp[ 1 ] === current ) { // If prev can be converted to accepted input conv = converters[ prev + " " + tmp[ 0 ] ] || converters[ "* " + tmp[ 0 ] ]; if ( conv ) { // Condense equivalence converters if ( conv === true ) { conv = converters[ conv2 ]; // Otherwise, insert the intermediate dataType } else if ( converters[ conv2 ] !== true ) { current = tmp[ 0 ]; dataTypes.unshift( tmp[ 1 ] ); } break; } } } } // Apply converter (if not an equivalence) if ( conv !== true ) { // Unless errors are allowed to bubble, catch and return them if ( conv && s.throws ) { response = conv( response ); } else { try { response = conv( response ); } catch ( e ) { return { state: "parsererror", error: conv ? e : "No conversion from " + prev + " to " + current }; } } } } } } return { state: "success", data: response }; } jQuery.extend( { // Counter for holding the number of active queries active: 0, // Last-Modified header cache for next request lastModified: {}, etag: {}, ajaxSettings: { url: location.href, type: "GET", isLocal: rlocalProtocol.test( location.protocol ), global: true, processData: true, async: true, contentType: "application/x-www-form-urlencoded; charset=UTF-8", /* timeout: 0, data: null, dataType: null, username: null, password: null, cache: null, throws: false, traditional: false, headers: {}, */ accepts: { "*": allTypes, text: "text/plain", html: "text/html", xml: "application/xml, text/xml", json: "application/json, text/javascript" }, contents: { xml: /\bxml\b/, html: /\bhtml/, json: /\bjson\b/ }, responseFields: { xml: "responseXML", text: "responseText", json: "responseJSON" }, // Data converters // Keys separate source (or catchall "*") and destination types with a single space converters: { // Convert anything to text "* text": String, // Text to html (true = no transformation) "text html": true, // Evaluate text as a json expression "text json": JSON.parse, // Parse text as xml "text xml": jQuery.parseXML }, // For options that shouldn't be deep extended: // you can add your own custom options here if // and when you create one that shouldn't be // deep extended (see ajaxExtend) flatOptions: { url: true, context: true } }, // Creates a full fledged settings object into target // with both ajaxSettings and settings fields. // If target is omitted, writes into ajaxSettings. ajaxSetup: function( target, settings ) { return settings ? // Building a settings object ajaxExtend( ajaxExtend( target, jQuery.ajaxSettings ), settings ) : // Extending ajaxSettings ajaxExtend( jQuery.ajaxSettings, target ); }, ajaxPrefilter: addToPrefiltersOrTransports( prefilters ), ajaxTransport: addToPrefiltersOrTransports( transports ), // Main method ajax: function( url, options ) { // If url is an object, simulate pre-1.5 signature if ( typeof url === "object" ) { options = url; url = undefined; } // Force options to be an object options = options || {}; var transport, // URL without anti-cache param cacheURL, // Response headers responseHeadersString, responseHeaders, // timeout handle timeoutTimer, // Url cleanup var urlAnchor, // Request state (becomes false upon send and true upon completion) completed, // To know if global events are to be dispatched fireGlobals, // Loop variable i, // uncached part of the url uncached, // Create the final options object s = jQuery.ajaxSetup( {}, options ), // Callbacks context callbackContext = s.context || s, // Context for global events is callbackContext if it is a DOM node or jQuery collection globalEventContext = s.context && ( callbackContext.nodeType || callbackContext.jquery ) ? jQuery( callbackContext ) : jQuery.event, // Deferreds deferred = jQuery.Deferred(), completeDeferred = jQuery.Callbacks( "once memory" ), // Status-dependent callbacks statusCode = s.statusCode || {}, // Headers (they are sent all at once) requestHeaders = {}, requestHeadersNames = {}, // Default abort message strAbort = "canceled", // Fake xhr jqXHR = { readyState: 0, // Builds headers hashtable if needed getResponseHeader: function( key ) { var match; if ( completed ) { if ( !responseHeaders ) { responseHeaders = {}; while ( ( match = rheaders.exec( responseHeadersString ) ) ) { responseHeaders[ match[ 1 ].toLowerCase() ] = match[ 2 ]; } } match = responseHeaders[ key.toLowerCase() ]; } return match == null ? null : match; }, // Raw string getAllResponseHeaders: function() { return completed ? responseHeadersString : null; }, // Caches the header setRequestHeader: function( name, value ) { if ( completed == null ) { name = requestHeadersNames[ name.toLowerCase() ] = requestHeadersNames[ name.toLowerCase() ] || name; requestHeaders[ name ] = value; } return this; }, // Overrides response content-type header overrideMimeType: function( type ) { if ( completed == null ) { s.mimeType = type; } return this; }, // Status-dependent callbacks statusCode: function( map ) { var code; if ( map ) { if ( completed ) { // Execute the appropriate callbacks jqXHR.always( map[ jqXHR.status ] ); } else { // Lazy-add the new callbacks in a way that preserves old ones for ( code in map ) { statusCode[ code ] = [ statusCode[ code ], map[ code ] ]; } } } return this; }, // Cancel the request abort: function( statusText ) { var finalText = statusText || strAbort; if ( transport ) { transport.abort( finalText ); } done( 0, finalText ); return this; } }; // Attach deferreds deferred.promise( jqXHR ); // Add protocol if not provided (prefilters might expect it) // Handle falsy url in the settings object (#10093: consistency with old signature) // We also use the url parameter if available s.url = ( ( url || s.url || location.href ) + "" ) .replace( rprotocol, location.protocol + "//" ); // Alias method option to type as per ticket #12004 s.type = options.method || options.type || s.method || s.type; // Extract dataTypes list s.dataTypes = ( s.dataType || "*" ).toLowerCase().match( rnothtmlwhite ) || [ "" ]; // A cross-domain request is in order when the origin doesn't match the current origin. if ( s.crossDomain == null ) { urlAnchor = document.createElement( "a" ); // Support: IE <=8 - 11, Edge 12 - 13 // IE throws exception on accessing the href property if url is malformed, // e.g. http://example.com:80x/ try { urlAnchor.href = s.url; // Support: IE <=8 - 11 only // Anchor's host property isn't correctly set when s.url is relative urlAnchor.href = urlAnchor.href; s.crossDomain = originAnchor.protocol + "//" + originAnchor.host !== urlAnchor.protocol + "//" + urlAnchor.host; } catch ( e ) { // If there is an error parsing the URL, assume it is crossDomain, // it can be rejected by the transport if it is invalid s.crossDomain = true; } } // Convert data if not already a string if ( s.data && s.processData && typeof s.data !== "string" ) { s.data = jQuery.param( s.data, s.traditional ); } // Apply prefilters inspectPrefiltersOrTransports( prefilters, s, options, jqXHR ); // If request was aborted inside a prefilter, stop there if ( completed ) { return jqXHR; } // We can fire global events as of now if asked to // Don't fire events if jQuery.event is undefined in an AMD-usage scenario (#15118) fireGlobals = jQuery.event && s.global; // Watch for a new set of requests if ( fireGlobals && jQuery.active++ === 0 ) { jQuery.event.trigger( "ajaxStart" ); } // Uppercase the type s.type = s.type.toUpperCase(); // Determine if request has content s.hasContent = !rnoContent.test( s.type ); // Save the URL in case we're toying with the If-Modified-Since // and/or If-None-Match header later on // Remove hash to simplify url manipulation cacheURL = s.url.replace( rhash, "" ); // More options handling for requests with no content if ( !s.hasContent ) { // Remember the hash so we can put it back uncached = s.url.slice( cacheURL.length ); // If data is available, append data to url if ( s.data ) { cacheURL += ( rquery.test( cacheURL ) ? "&" : "?" ) + s.data; // #9682: remove data so that it's not used in an eventual retry delete s.data; } // Add or update anti-cache param if needed if ( s.cache === false ) { cacheURL = cacheURL.replace( rantiCache, "$1" ); uncached = ( rquery.test( cacheURL ) ? "&" : "?" ) + "_=" + ( nonce++ ) + uncached; } // Put hash and anti-cache on the URL that will be requested (gh-1732) s.url = cacheURL + uncached; // Change '%20' to '+' if this is encoded form body content (gh-2658) } else if ( s.data && s.processData && ( s.contentType || "" ).indexOf( "application/x-www-form-urlencoded" ) === 0 ) { s.data = s.data.replace( r20, "+" ); } // Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode. if ( s.ifModified ) { if ( jQuery.lastModified[ cacheURL ] ) { jqXHR.setRequestHeader( "If-Modified-Since", jQuery.lastModified[ cacheURL ] ); } if ( jQuery.etag[ cacheURL ] ) { jqXHR.setRequestHeader( "If-None-Match", jQuery.etag[ cacheURL ] ); } } // Set the correct header, if data is being sent if ( s.data && s.hasContent && s.contentType !== false || options.contentType ) { jqXHR.setRequestHeader( "Content-Type", s.contentType ); } // Set the Accepts header for the server, depending on the dataType jqXHR.setRequestHeader( "Accept", s.dataTypes[ 0 ] && s.accepts[ s.dataTypes[ 0 ] ] ? s.accepts[ s.dataTypes[ 0 ] ] + ( s.dataTypes[ 0 ] !== "*" ? ", " + allTypes + "; q=0.01" : "" ) : s.accepts[ "*" ] ); // Check for headers option for ( i in s.headers ) { jqXHR.setRequestHeader( i, s.headers[ i ] ); } // Allow custom headers/mimetypes and early abort if ( s.beforeSend && ( s.beforeSend.call( callbackContext, jqXHR, s ) === false || completed ) ) { // Abort if not done already and return return jqXHR.abort(); } // Aborting is no longer a cancellation strAbort = "abort"; // Install callbacks on deferreds completeDeferred.add( s.complete ); jqXHR.done( s.success ); jqXHR.fail( s.error ); // Get transport transport = inspectPrefiltersOrTransports( transports, s, options, jqXHR ); // If no transport, we auto-abort if ( !transport ) { done( -1, "No Transport" ); } else { jqXHR.readyState = 1; // Send global event if ( fireGlobals ) { globalEventContext.trigger( "ajaxSend", [ jqXHR, s ] ); } // If request was aborted inside ajaxSend, stop there if ( completed ) { return jqXHR; } // Timeout if ( s.async && s.timeout > 0 ) { timeoutTimer = window.setTimeout( function() { jqXHR.abort( "timeout" ); }, s.timeout ); } try { completed = false; transport.send( requestHeaders, done ); } catch ( e ) { // Rethrow post-completion exceptions if ( completed ) { throw e; } // Propagate others as results done( -1, e ); } } // Callback for when everything is done function done( status, nativeStatusText, responses, headers ) { var isSuccess, success, error, response, modified, statusText = nativeStatusText; // Ignore repeat invocations if ( completed ) { return; } completed = true; // Clear timeout if it exists if ( timeoutTimer ) { window.clearTimeout( timeoutTimer ); } // Dereference transport for early garbage collection // (no matter how long the jqXHR object will be used) transport = undefined; // Cache response headers responseHeadersString = headers || ""; // Set readyState jqXHR.readyState = status > 0 ? 4 : 0; // Determine if successful isSuccess = status >= 200 && status < 300 || status === 304; // Get response data if ( responses ) { response = ajaxHandleResponses( s, jqXHR, responses ); } // Convert no matter what (that way responseXXX fields are always set) response = ajaxConvert( s, response, jqXHR, isSuccess ); // If successful, handle type chaining if ( isSuccess ) { // Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode. if ( s.ifModified ) { modified = jqXHR.getResponseHeader( "Last-Modified" ); if ( modified ) { jQuery.lastModified[ cacheURL ] = modified; } modified = jqXHR.getResponseHeader( "etag" ); if ( modified ) { jQuery.etag[ cacheURL ] = modified; } } // if no content if ( status === 204 || s.type === "HEAD" ) { statusText = "nocontent"; // if not modified } else if ( status === 304 ) { statusText = "notmodified"; // If we have data, let's convert it } else { statusText = response.state; success = response.data; error = response.error; isSuccess = !error; } } else { // Extract error from statusText and normalize for non-aborts error = statusText; if ( status || !statusText ) { statusText = "error"; if ( status < 0 ) { status = 0; } } } // Set data for the fake xhr object jqXHR.status = status; jqXHR.statusText = ( nativeStatusText || statusText ) + ""; // Success/Error if ( isSuccess ) { deferred.resolveWith( callbackContext, [ success, statusText, jqXHR ] ); } else { deferred.rejectWith( callbackContext, [ jqXHR, statusText, error ] ); } // Status-dependent callbacks jqXHR.statusCode( statusCode ); statusCode = undefined; if ( fireGlobals ) { globalEventContext.trigger( isSuccess ? "ajaxSuccess" : "ajaxError", [ jqXHR, s, isSuccess ? success : error ] ); } // Complete completeDeferred.fireWith( callbackContext, [ jqXHR, statusText ] ); if ( fireGlobals ) { globalEventContext.trigger( "ajaxComplete", [ jqXHR, s ] ); // Handle the global AJAX counter if ( !( --jQuery.active ) ) { jQuery.event.trigger( "ajaxStop" ); } } } return jqXHR; }, getJSON: function( url, data, callback ) { return jQuery.get( url, data, callback, "json" ); }, getScript: function( url, callback ) { return jQuery.get( url, undefined, callback, "script" ); } } ); jQuery.each( [ "get", "post" ], function( i, method ) { jQuery[ method ] = function( url, data, callback, type ) { // Shift arguments if data argument was omitted if ( jQuery.isFunction( data ) ) { type = type || callback; callback = data; data = undefined; } // The url can be an options object (which then must have .url) return jQuery.ajax( jQuery.extend( { url: url, type: method, dataType: type, data: data, success: callback }, jQuery.isPlainObject( url ) && url ) ); }; } ); jQuery._evalUrl = function( url ) { return jQuery.ajax( { url: url, // Make this explicit, since user can override this through ajaxSetup (#11264) type: "GET", dataType: "script", cache: true, async: false, global: false, "throws": true } ); }; jQuery.fn.extend( { wrapAll: function( html ) { var wrap; if ( this[ 0 ] ) { if ( jQuery.isFunction( html ) ) { html = html.call( this[ 0 ] ); } // The elements to wrap the target around wrap = jQuery( html, this[ 0 ].ownerDocument ).eq( 0 ).clone( true ); if ( this[ 0 ].parentNode ) { wrap.insertBefore( this[ 0 ] ); } wrap.map( function() { var elem = this; while ( elem.firstElementChild ) { elem = elem.firstElementChild; } return elem; } ).append( this ); } return this; }, wrapInner: function( html ) { if ( jQuery.isFunction( html ) ) { return this.each( function( i ) { jQuery( this ).wrapInner( html.call( this, i ) ); } ); } return this.each( function() { var self = jQuery( this ), contents = self.contents(); if ( contents.length ) { contents.wrapAll( html ); } else { self.append( html ); } } ); }, wrap: function( html ) { var isFunction = jQuery.isFunction( html ); return this.each( function( i ) { jQuery( this ).wrapAll( isFunction ? html.call( this, i ) : html ); } ); }, unwrap: function( selector ) { this.parent( selector ).not( "body" ).each( function() { jQuery( this ).replaceWith( this.childNodes ); } ); return this; } } ); jQuery.expr.pseudos.hidden = function( elem ) { return !jQuery.expr.pseudos.visible( elem ); }; jQuery.expr.pseudos.visible = function( elem ) { return !!( elem.offsetWidth || elem.offsetHeight || elem.getClientRects().length ); }; jQuery.ajaxSettings.xhr = function() { try { return new window.XMLHttpRequest(); } catch ( e ) {} }; var xhrSuccessStatus = { // File protocol always yields status code 0, assume 200 0: 200, // Support: IE <=9 only // #1450: sometimes IE returns 1223 when it should be 204 1223: 204 }, xhrSupported = jQuery.ajaxSettings.xhr(); support.cors = !!xhrSupported && ( "withCredentials" in xhrSupported ); support.ajax = xhrSupported = !!xhrSupported; jQuery.ajaxTransport( function( options ) { var callback, errorCallback; // Cross domain only allowed if supported through XMLHttpRequest if ( support.cors || xhrSupported && !options.crossDomain ) { return { send: function( headers, complete ) { var i, xhr = options.xhr(); xhr.open( options.type, options.url, options.async, options.username, options.password ); // Apply custom fields if provided if ( options.xhrFields ) { for ( i in options.xhrFields ) { xhr[ i ] = options.xhrFields[ i ]; } } // Override mime type if needed if ( options.mimeType && xhr.overrideMimeType ) { xhr.overrideMimeType( options.mimeType ); } // X-Requested-With header // For cross-domain requests, seeing as conditions for a preflight are // akin to a jigsaw puzzle, we simply never set it to be sure. // (it can always be set on a per-request basis or even using ajaxSetup) // For same-domain requests, won't change header if already provided. if ( !options.crossDomain && !headers[ "X-Requested-With" ] ) { headers[ "X-Requested-With" ] = "XMLHttpRequest"; } // Set headers for ( i in headers ) { xhr.setRequestHeader( i, headers[ i ] ); } // Callback callback = function( type ) { return function() { if ( callback ) { callback = errorCallback = xhr.onload = xhr.onerror = xhr.onabort = xhr.onreadystatechange = null; if ( type === "abort" ) { xhr.abort(); } else if ( type === "error" ) { // Support: IE <=9 only // On a manual native abort, IE9 throws // errors on any property access that is not readyState if ( typeof xhr.status !== "number" ) { complete( 0, "error" ); } else { complete( // File: protocol always yields status 0; see #8605, #14207 xhr.status, xhr.statusText ); } } else { complete( xhrSuccessStatus[ xhr.status ] || xhr.status, xhr.statusText, // Support: IE <=9 only // IE9 has no XHR2 but throws on binary (trac-11426) // For XHR2 non-text, let the caller handle it (gh-2498) ( xhr.responseType || "text" ) !== "text" || typeof xhr.responseText !== "string" ? { binary: xhr.response } : { text: xhr.responseText }, xhr.getAllResponseHeaders() ); } } }; }; // Listen to events xhr.onload = callback(); errorCallback = xhr.onerror = callback( "error" ); // Support: IE 9 only // Use onreadystatechange to replace onabort // to handle uncaught aborts if ( xhr.onabort !== undefined ) { xhr.onabort = errorCallback; } else { xhr.onreadystatechange = function() { // Check readyState before timeout as it changes if ( xhr.readyState === 4 ) { // Allow onerror to be called first, // but that will not handle a native abort // Also, save errorCallback to a variable // as xhr.onerror cannot be accessed window.setTimeout( function() { if ( callback ) { errorCallback(); } } ); } }; } // Create the abort callback callback = callback( "abort" ); try { // Do send the request (this may raise an exception) xhr.send( options.hasContent && options.data || null ); } catch ( e ) { // #14683: Only rethrow if this hasn't been notified as an error yet if ( callback ) { throw e; } } }, abort: function() { if ( callback ) { callback(); } } }; } } ); // Prevent auto-execution of scripts when no explicit dataType was provided (See gh-2432) jQuery.ajaxPrefilter( function( s ) { if ( s.crossDomain ) { s.contents.script = false; } } ); // Install script dataType jQuery.ajaxSetup( { accepts: { script: "text/javascript, application/javascript, " + "application/ecmascript, application/x-ecmascript" }, contents: { script: /\b(?:java|ecma)script\b/ }, converters: { "text script": function( text ) { jQuery.globalEval( text ); return text; } } } ); // Handle cache's special case and crossDomain jQuery.ajaxPrefilter( "script", function( s ) { if ( s.cache === undefined ) { s.cache = false; } if ( s.crossDomain ) { s.type = "GET"; } } ); // Bind script tag hack transport jQuery.ajaxTransport( "script", function( s ) { // This transport only deals with cross domain requests if ( s.crossDomain ) { var script, callback; return { send: function( _, complete ) { script = jQuery( "<script>" ).prop( { charset: s.scriptCharset, src: s.url } ).on( "load error", callback = function( evt ) { script.remove(); callback = null; if ( evt ) { complete( evt.type === "error" ? 404 : 200, evt.type ); } } ); // Use native DOM manipulation to avoid our domManip AJAX trickery document.head.appendChild( script[ 0 ] ); }, abort: function() { if ( callback ) { callback(); } } }; } } ); var oldCallbacks = [], rjsonp = /(=)\?(?=&|$)|\?\?/; // Default jsonp settings jQuery.ajaxSetup( { jsonp: "callback", jsonpCallback: function() { var callback = oldCallbacks.pop() || ( jQuery.expando + "_" + ( nonce++ ) ); this[ callback ] = true; return callback; } } ); // Detect, normalize options and install callbacks for jsonp requests jQuery.ajaxPrefilter( "json jsonp", function( s, originalSettings, jqXHR ) { var callbackName, overwritten, responseContainer, jsonProp = s.jsonp !== false && ( rjsonp.test( s.url ) ? "url" : typeof s.data === "string" && ( s.contentType || "" ) .indexOf( "application/x-www-form-urlencoded" ) === 0 && rjsonp.test( s.data ) && "data" ); // Handle iff the expected data type is "jsonp" or we have a parameter to set if ( jsonProp || s.dataTypes[ 0 ] === "jsonp" ) { // Get callback name, remembering preexisting value associated with it callbackName = s.jsonpCallback = jQuery.isFunction( s.jsonpCallback ) ? s.jsonpCallback() : s.jsonpCallback; // Insert callback into url or form data if ( jsonProp ) { s[ jsonProp ] = s[ jsonProp ].replace( rjsonp, "$1" + callbackName ); } else if ( s.jsonp !== false ) { s.url += ( rquery.test( s.url ) ? "&" : "?" ) + s.jsonp + "=" + callbackName; } // Use data converter to retrieve json after script execution s.converters[ "script json" ] = function() { if ( !responseContainer ) { jQuery.error( callbackName + " was not called" ); } return responseContainer[ 0 ]; }; // Force json dataType s.dataTypes[ 0 ] = "json"; // Install callback overwritten = window[ callbackName ]; window[ callbackName ] = function() { responseContainer = arguments; }; // Clean-up function (fires after converters) jqXHR.always( function() { // If previous value didn't exist - remove it if ( overwritten === undefined ) { jQuery( window ).removeProp( callbackName ); // Otherwise restore preexisting value } else { window[ callbackName ] = overwritten; } // Save back as free if ( s[ callbackName ] ) { // Make sure that re-using the options doesn't screw things around s.jsonpCallback = originalSettings.jsonpCallback; // Save the callback name for future use oldCallbacks.push( callbackName ); } // Call if it was a function and we have a response if ( responseContainer && jQuery.isFunction( overwritten ) ) { overwritten( responseContainer[ 0 ] ); } responseContainer = overwritten = undefined; } ); // Delegate to script return "script"; } } ); // Support: Safari 8 only // In Safari 8 documents created via document.implementation.createHTMLDocument // collapse sibling forms: the second one becomes a child of the first one. // Because of that, this security measure has to be disabled in Safari 8. // https://bugs.webkit.org/show_bug.cgi?id=137337 support.createHTMLDocument = ( function() { var body = document.implementation.createHTMLDocument( "" ).body; body.innerHTML = "<form></form><form></form>"; return body.childNodes.length === 2; } )(); // Argument "data" should be string of html // context (optional): If specified, the fragment will be created in this context, // defaults to document // keepScripts (optional): If true, will include scripts passed in the html string jQuery.parseHTML = function( data, context, keepScripts ) { if ( typeof data !== "string" ) { return []; } if ( typeof context === "boolean" ) { keepScripts = context; context = false; } var base, parsed, scripts; if ( !context ) { // Stop scripts or inline event handlers from being executed immediately // by using document.implementation if ( support.createHTMLDocument ) { context = document.implementation.createHTMLDocument( "" ); // Set the base href for the created document // so any parsed elements with URLs // are based on the document's URL (gh-2965) base = context.createElement( "base" ); base.href = document.location.href; context.head.appendChild( base ); } else { context = document; } } parsed = rsingleTag.exec( data ); scripts = !keepScripts && []; // Single tag if ( parsed ) { return [ context.createElement( parsed[ 1 ] ) ]; } parsed = buildFragment( [ data ], context, scripts ); if ( scripts && scripts.length ) { jQuery( scripts ).remove(); } return jQuery.merge( [], parsed.childNodes ); }; /** * Load a url into a page */ jQuery.fn.load = function( url, params, callback ) { var selector, type, response, self = this, off = url.indexOf( " " ); if ( off > -1 ) { selector = stripAndCollapse( url.slice( off ) ); url = url.slice( 0, off ); } // If it's a function if ( jQuery.isFunction( params ) ) { // We assume that it's the callback callback = params; params = undefined; // Otherwise, build a param string } else if ( params && typeof params === "object" ) { type = "POST"; } // If we have elements to modify, make the request if ( self.length > 0 ) { jQuery.ajax( { url: url, // If "type" variable is undefined, then "GET" method will be used. // Make value of this field explicit since // user can override it through ajaxSetup method type: type || "GET", dataType: "html", data: params } ).done( function( responseText ) { // Save response for use in complete callback response = arguments; self.html( selector ? // If a selector was specified, locate the right elements in a dummy div // Exclude scripts to avoid IE 'Permission Denied' errors jQuery( "<div>" ).append( jQuery.parseHTML( responseText ) ).find( selector ) : // Otherwise use the full result responseText ); // If the request succeeds, this function gets "data", "status", "jqXHR" // but they are ignored because response was set above. // If it fails, this function gets "jqXHR", "status", "error" } ).always( callback && function( jqXHR, status ) { self.each( function() { callback.apply( this, response || [ jqXHR.responseText, status, jqXHR ] ); } ); } ); } return this; }; // Attach a bunch of functions for handling common AJAX events jQuery.each( [ "ajaxStart", "ajaxStop", "ajaxComplete", "ajaxError", "ajaxSuccess", "ajaxSend" ], function( i, type ) { jQuery.fn[ type ] = function( fn ) { return this.on( type, fn ); }; } ); jQuery.expr.pseudos.animated = function( elem ) { return jQuery.grep( jQuery.timers, function( fn ) { return elem === fn.elem; } ).length; }; jQuery.offset = { setOffset: function( elem, options, i ) { var curPosition, curLeft, curCSSTop, curTop, curOffset, curCSSLeft, calculatePosition, position = jQuery.css( elem, "position" ), curElem = jQuery( elem ), props = {}; // Set position first, in-case top/left are set even on static elem if ( position === "static" ) { elem.style.position = "relative"; } curOffset = curElem.offset(); curCSSTop = jQuery.css( elem, "top" ); curCSSLeft = jQuery.css( elem, "left" ); calculatePosition = ( position === "absolute" || position === "fixed" ) && ( curCSSTop + curCSSLeft ).indexOf( "auto" ) > -1; // Need to be able to calculate position if either // top or left is auto and position is either absolute or fixed if ( calculatePosition ) { curPosition = curElem.position(); curTop = curPosition.top; curLeft = curPosition.left; } else { curTop = parseFloat( curCSSTop ) || 0; curLeft = parseFloat( curCSSLeft ) || 0; } if ( jQuery.isFunction( options ) ) { // Use jQuery.extend here to allow modification of coordinates argument (gh-1848) options = options.call( elem, i, jQuery.extend( {}, curOffset ) ); } if ( options.top != null ) { props.top = ( options.top - curOffset.top ) + curTop; } if ( options.left != null ) { props.left = ( options.left - curOffset.left ) + curLeft; } if ( "using" in options ) { options.using.call( elem, props ); } else { curElem.css( props ); } } }; jQuery.fn.extend( { offset: function( options ) { // Preserve chaining for setter if ( arguments.length ) { return options === undefined ? this : this.each( function( i ) { jQuery.offset.setOffset( this, options, i ); } ); } var doc, docElem, rect, win, elem = this[ 0 ]; if ( !elem ) { return; } // Return zeros for disconnected and hidden (display: none) elements (gh-2310) // Support: IE <=11 only // Running getBoundingClientRect on a // disconnected node in IE throws an error if ( !elem.getClientRects().length ) { return { top: 0, left: 0 }; } rect = elem.getBoundingClientRect(); doc = elem.ownerDocument; docElem = doc.documentElement; win = doc.defaultView; return { top: rect.top + win.pageYOffset - docElem.clientTop, left: rect.left + win.pageXOffset - docElem.clientLeft }; }, position: function() { if ( !this[ 0 ] ) { return; } var offsetParent, offset, elem = this[ 0 ], parentOffset = { top: 0, left: 0 }; // Fixed elements are offset from window (parentOffset = {top:0, left: 0}, // because it is its only offset parent if ( jQuery.css( elem, "position" ) === "fixed" ) { // Assume getBoundingClientRect is there when computed position is fixed offset = elem.getBoundingClientRect(); } else { // Get *real* offsetParent offsetParent = this.offsetParent(); // Get correct offsets offset = this.offset(); if ( !nodeName( offsetParent[ 0 ], "html" ) ) { parentOffset = offsetParent.offset(); } // Add offsetParent borders parentOffset = { top: parentOffset.top + jQuery.css( offsetParent[ 0 ], "borderTopWidth", true ), left: parentOffset.left + jQuery.css( offsetParent[ 0 ], "borderLeftWidth", true ) }; } // Subtract parent offsets and element margins return { top: offset.top - parentOffset.top - jQuery.css( elem, "marginTop", true ), left: offset.left - parentOffset.left - jQuery.css( elem, "marginLeft", true ) }; }, // This method will return documentElement in the following cases: // 1) For the element inside the iframe without offsetParent, this method will return // documentElement of the parent window // 2) For the hidden or detached element // 3) For body or html element, i.e. in case of the html node - it will return itself // // but those exceptions were never presented as a real life use-cases // and might be considered as more preferable results. // // This logic, however, is not guaranteed and can change at any point in the future offsetParent: function() { return this.map( function() { var offsetParent = this.offsetParent; while ( offsetParent && jQuery.css( offsetParent, "position" ) === "static" ) { offsetParent = offsetParent.offsetParent; } return offsetParent || documentElement; } ); } } ); // Create scrollLeft and scrollTop methods jQuery.each( { scrollLeft: "pageXOffset", scrollTop: "pageYOffset" }, function( method, prop ) { var top = "pageYOffset" === prop; jQuery.fn[ method ] = function( val ) { return access( this, function( elem, method, val ) { // Coalesce documents and windows var win; if ( jQuery.isWindow( elem ) ) { win = elem; } else if ( elem.nodeType === 9 ) { win = elem.defaultView; } if ( val === undefined ) { return win ? win[ prop ] : elem[ method ]; } if ( win ) { win.scrollTo( !top ? val : win.pageXOffset, top ? val : win.pageYOffset ); } else { elem[ method ] = val; } }, method, val, arguments.length ); }; } ); // Support: Safari <=7 - 9.1, Chrome <=37 - 49 // Add the top/left cssHooks using jQuery.fn.position // Webkit bug: https://bugs.webkit.org/show_bug.cgi?id=29084 // Blink bug: https://bugs.chromium.org/p/chromium/issues/detail?id=589347 // getComputedStyle returns percent when specified for top/left/bottom/right; // rather than make the css module depend on the offset module, just check for it here jQuery.each( [ "top", "left" ], function( i, prop ) { jQuery.cssHooks[ prop ] = addGetHookIf( support.pixelPosition, function( elem, computed ) { if ( computed ) { computed = curCSS( elem, prop ); // If curCSS returns percentage, fallback to offset return rnumnonpx.test( computed ) ? jQuery( elem ).position()[ prop ] + "px" : computed; } } ); } ); // Create innerHeight, innerWidth, height, width, outerHeight and outerWidth methods jQuery.each( { Height: "height", Width: "width" }, function( name, type ) { jQuery.each( { padding: "inner" + name, content: type, "": "outer" + name }, function( defaultExtra, funcName ) { // Margin is only for outerHeight, outerWidth jQuery.fn[ funcName ] = function( margin, value ) { var chainable = arguments.length && ( defaultExtra || typeof margin !== "boolean" ), extra = defaultExtra || ( margin === true || value === true ? "margin" : "border" ); return access( this, function( elem, type, value ) { var doc; if ( jQuery.isWindow( elem ) ) { // $( window ).outerWidth/Height return w/h including scrollbars (gh-1729) return funcName.indexOf( "outer" ) === 0 ? elem[ "inner" + name ] : elem.document.documentElement[ "client" + name ]; } // Get document width or height if ( elem.nodeType === 9 ) { doc = elem.documentElement; // Either scroll[Width/Height] or offset[Width/Height] or client[Width/Height], // whichever is greatest return Math.max( elem.body[ "scroll" + name ], doc[ "scroll" + name ], elem.body[ "offset" + name ], doc[ "offset" + name ], doc[ "client" + name ] ); } return value === undefined ? // Get width or height on the element, requesting but not forcing parseFloat jQuery.css( elem, type, extra ) : // Set width or height on the element jQuery.style( elem, type, value, extra ); }, type, chainable ? margin : undefined, chainable ); }; } ); } ); jQuery.fn.extend( { bind: function( types, data, fn ) { return this.on( types, null, data, fn ); }, unbind: function( types, fn ) { return this.off( types, null, fn ); }, delegate: function( selector, types, data, fn ) { return this.on( types, selector, data, fn ); }, undelegate: function( selector, types, fn ) { // ( namespace ) or ( selector, types [, fn] ) return arguments.length === 1 ? this.off( selector, "**" ) : this.off( types, selector || "**", fn ); } } ); jQuery.holdReady = function( hold ) { if ( hold ) { jQuery.readyWait++; } else { jQuery.ready( true ); } }; jQuery.isArray = Array.isArray; jQuery.parseJSON = JSON.parse; jQuery.nodeName = nodeName; // Register as a named AMD module, since jQuery can be concatenated with other // files that may use define, but not via a proper concatenation script that // understands anonymous AMD modules. A named AMD is safest and most robust // way to register. Lowercase jquery is used because AMD module names are // derived from file names, and jQuery is normally delivered in a lowercase // file name. Do this after creating the global so that if an AMD module wants // to call noConflict to hide this version of jQuery, it will work. // Note that for maximum portability, libraries that are not jQuery should // declare themselves as anonymous modules, and avoid setting a global if an // AMD loader is present. jQuery is a special case. For more information, see // https://github.com/jrburke/requirejs/wiki/Updating-existing-libraries#wiki-anon if ( true ) { !(__WEBPACK_AMD_DEFINE_ARRAY__ = [], __WEBPACK_AMD_DEFINE_RESULT__ = function() { return jQuery; }.apply(exports, __WEBPACK_AMD_DEFINE_ARRAY__), __WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__)); } var // Map over jQuery in case of overwrite _jQuery = window.jQuery, // Map over the $ in case of overwrite _$ = window.$; jQuery.noConflict = function( deep ) { if ( window.$ === jQuery ) { window.$ = _$; } if ( deep && window.jQuery === jQuery ) { window.jQuery = _jQuery; } return jQuery; }; // Expose jQuery and $ identifiers, even in AMD // (#7102#comment:10, https://github.com/jquery/jquery/pull/557) // and CommonJS for browser emulators (#13566) if ( !noGlobal ) { window.jQuery = window.$ = jQuery; } return jQuery; } ); /***/ }), /***/ 41: /***/ (function(module, exports, __webpack_require__) { __webpack_require__(9); module.exports = __webpack_require__(3); /***/ }), /***/ 9: /***/ (function(module, exports, __webpack_require__) { "use strict"; /* WEBPACK VAR INJECTION */(function(global) {/*! * Vue.js v2.4.2 * (c) 2014-2017 Evan You * Released under the MIT License. */ /* */ // these helpers produces better vm code in JS engines due to their // explicitness and function inlining function isUndef (v) { return v === undefined || v === null } function isDef (v) { return v !== undefined && v !== null } function isTrue (v) { return v === true } function isFalse (v) { return v === false } /** * Check if value is primitive */ function isPrimitive (value) { return ( typeof value === 'string' || typeof value === 'number' || typeof value === 'boolean' ) } /** * Quick object check - this is primarily used to tell * Objects from primitive values when we know the value * is a JSON-compliant type. */ function isObject (obj) { return obj !== null && typeof obj === 'object' } var _toString = Object.prototype.toString; /** * Strict object type check. Only returns true * for plain JavaScript objects. */ function isPlainObject (obj) { return _toString.call(obj) === '[object Object]' } function isRegExp (v) { return _toString.call(v) === '[object RegExp]' } /** * Check if val is a valid array index. */ function isValidArrayIndex (val) { var n = parseFloat(val); return n >= 0 && Math.floor(n) === n && isFinite(val) } /** * Convert a value to a string that is actually rendered. */ function toString (val) { return val == null ? '' : typeof val === 'object' ? JSON.stringify(val, null, 2) : String(val) } /** * Convert a input value to a number for persistence. * If the conversion fails, return original string. */ function toNumber (val) { var n = parseFloat(val); return isNaN(n) ? val : n } /** * Make a map and return a function for checking if a key * is in that map. */ function makeMap ( str, expectsLowerCase ) { var map = Object.create(null); var list = str.split(','); for (var i = 0; i < list.length; i++) { map[list[i]] = true; } return expectsLowerCase ? function (val) { return map[val.toLowerCase()]; } : function (val) { return map[val]; } } /** * Check if a tag is a built-in tag. */ var isBuiltInTag = makeMap('slot,component', true); /** * Check if a attribute is a reserved attribute. */ var isReservedAttribute = makeMap('key,ref,slot,is'); /** * Remove an item from an array */ function remove (arr, item) { if (arr.length) { var index = arr.indexOf(item); if (index > -1) { return arr.splice(index, 1) } } } /** * Check whether the object has the property. */ var hasOwnProperty = Object.prototype.hasOwnProperty; function hasOwn (obj, key) { return hasOwnProperty.call(obj, key) } /** * Create a cached version of a pure function. */ function cached (fn) { var cache = Object.create(null); return (function cachedFn (str) { var hit = cache[str]; return hit || (cache[str] = fn(str)) }) } /** * Camelize a hyphen-delimited string. */ var camelizeRE = /-(\w)/g; var camelize = cached(function (str) { return str.replace(camelizeRE, function (_, c) { return c ? c.toUpperCase() : ''; }) }); /** * Capitalize a string. */ var capitalize = cached(function (str) { return str.charAt(0).toUpperCase() + str.slice(1) }); /** * Hyphenate a camelCase string. */ var hyphenateRE = /([^-])([A-Z])/g; var hyphenate = cached(function (str) { return str .replace(hyphenateRE, '$1-$2') .replace(hyphenateRE, '$1-$2') .toLowerCase() }); /** * Simple bind, faster than native */ function bind (fn, ctx) { function boundFn (a) { var l = arguments.length; return l ? l > 1 ? fn.apply(ctx, arguments) : fn.call(ctx, a) : fn.call(ctx) } // record original fn length boundFn._length = fn.length; return boundFn } /** * Convert an Array-like object to a real Array. */ function toArray (list, start) { start = start || 0; var i = list.length - start; var ret = new Array(i); while (i--) { ret[i] = list[i + start]; } return ret } /** * Mix properties into target object. */ function extend (to, _from) { for (var key in _from) { to[key] = _from[key]; } return to } /** * Merge an Array of Objects into a single Object. */ function toObject (arr) { var res = {}; for (var i = 0; i < arr.length; i++) { if (arr[i]) { extend(res, arr[i]); } } return res } /** * Perform no operation. * Stubbing args to make Flow happy without leaving useless transpiled code * with ...rest (https://flow.org/blog/2017/05/07/Strict-Function-Call-Arity/) */ function noop (a, b, c) {} /** * Always return false. */ var no = function (a, b, c) { return false; }; /** * Return same value */ var identity = function (_) { return _; }; /** * Generate a static keys string from compiler modules. */ function genStaticKeys (modules) { return modules.reduce(function (keys, m) { return keys.concat(m.staticKeys || []) }, []).join(',') } /** * Check if two values are loosely equal - that is, * if they are plain objects, do they have the same shape? */ function looseEqual (a, b) { if (a === b) { return true } var isObjectA = isObject(a); var isObjectB = isObject(b); if (isObjectA && isObjectB) { try { var isArrayA = Array.isArray(a); var isArrayB = Array.isArray(b); if (isArrayA && isArrayB) { return a.length === b.length && a.every(function (e, i) { return looseEqual(e, b[i]) }) } else if (!isArrayA && !isArrayB) { var keysA = Object.keys(a); var keysB = Object.keys(b); return keysA.length === keysB.length && keysA.every(function (key) { return looseEqual(a[key], b[key]) }) } else { /* istanbul ignore next */ return false } } catch (e) { /* istanbul ignore next */ return false } } else if (!isObjectA && !isObjectB) { return String(a) === String(b) } else { return false } } function looseIndexOf (arr, val) { for (var i = 0; i < arr.length; i++) { if (looseEqual(arr[i], val)) { return i } } return -1 } /** * Ensure a function is called only once. */ function once (fn) { var called = false; return function () { if (!called) { called = true; fn.apply(this, arguments); } } } var SSR_ATTR = 'data-server-rendered'; var ASSET_TYPES = [ 'component', 'directive', 'filter' ]; var LIFECYCLE_HOOKS = [ 'beforeCreate', 'created', 'beforeMount', 'mounted', 'beforeUpdate', 'updated', 'beforeDestroy', 'destroyed', 'activated', 'deactivated' ]; /* */ var config = ({ /** * Option merge strategies (used in core/util/options) */ optionMergeStrategies: Object.create(null), /** * Whether to suppress warnings. */ silent: false, /** * Show production mode tip message on boot? */ productionTip: "development" !== 'production', /** * Whether to enable devtools */ devtools: "development" !== 'production', /** * Whether to record perf */ performance: false, /** * Error handler for watcher errors */ errorHandler: null, /** * Warn handler for watcher warns */ warnHandler: null, /** * Ignore certain custom elements */ ignoredElements: [], /** * Custom user key aliases for v-on */ keyCodes: Object.create(null), /** * Check if a tag is reserved so that it cannot be registered as a * component. This is platform-dependent and may be overwritten. */ isReservedTag: no, /** * Check if an attribute is reserved so that it cannot be used as a component * prop. This is platform-dependent and may be overwritten. */ isReservedAttr: no, /** * Check if a tag is an unknown element. * Platform-dependent. */ isUnknownElement: no, /** * Get the namespace of an element */ getTagNamespace: noop, /** * Parse the real tag name for the specific platform. */ parsePlatformTagName: identity, /** * Check if an attribute must be bound using property, e.g. value * Platform-dependent. */ mustUseProp: no, /** * Exposed for legacy reasons */ _lifecycleHooks: LIFECYCLE_HOOKS }); /* */ var emptyObject = Object.freeze({}); /** * Check if a string starts with $ or _ */ function isReserved (str) { var c = (str + '').charCodeAt(0); return c === 0x24 || c === 0x5F } /** * Define a property. */ function def (obj, key, val, enumerable) { Object.defineProperty(obj, key, { value: val, enumerable: !!enumerable, writable: true, configurable: true }); } /** * Parse simple path. */ var bailRE = /[^\w.$]/; function parsePath (path) { if (bailRE.test(path)) { return } var segments = path.split('.'); return function (obj) { for (var i = 0; i < segments.length; i++) { if (!obj) { return } obj = obj[segments[i]]; } return obj } } /* */ var warn = noop; var tip = noop; var formatComponentName = (null); // work around flow check if (true) { var hasConsole = typeof console !== 'undefined'; var classifyRE = /(?:^|[-_])(\w)/g; var classify = function (str) { return str .replace(classifyRE, function (c) { return c.toUpperCase(); }) .replace(/[-_]/g, ''); }; warn = function (msg, vm) { var trace = vm ? generateComponentTrace(vm) : ''; if (config.warnHandler) { config.warnHandler.call(null, msg, vm, trace); } else if (hasConsole && (!config.silent)) { console.error(("[Vue warn]: " + msg + trace)); } }; tip = function (msg, vm) { if (hasConsole && (!config.silent)) { console.warn("[Vue tip]: " + msg + ( vm ? generateComponentTrace(vm) : '' )); } }; formatComponentName = function (vm, includeFile) { if (vm.$root === vm) { return '<Root>' } var name = typeof vm === 'string' ? vm : typeof vm === 'function' && vm.options ? vm.options.name : vm._isVue ? vm.$options.name || vm.$options._componentTag : vm.name; var file = vm._isVue && vm.$options.__file; if (!name && file) { var match = file.match(/([^/\\]+)\.vue$/); name = match && match[1]; } return ( (name ? ("<" + (classify(name)) + ">") : "<Anonymous>") + (file && includeFile !== false ? (" at " + file) : '') ) }; var repeat = function (str, n) { var res = ''; while (n) { if (n % 2 === 1) { res += str; } if (n > 1) { str += str; } n >>= 1; } return res }; var generateComponentTrace = function (vm) { if (vm._isVue && vm.$parent) { var tree = []; var currentRecursiveSequence = 0; while (vm) { if (tree.length > 0) { var last = tree[tree.length - 1]; if (last.constructor === vm.constructor) { currentRecursiveSequence++; vm = vm.$parent; continue } else if (currentRecursiveSequence > 0) { tree[tree.length - 1] = [last, currentRecursiveSequence]; currentRecursiveSequence = 0; } } tree.push(vm); vm = vm.$parent; } return '\n\nfound in\n\n' + tree .map(function (vm, i) { return ("" + (i === 0 ? '---> ' : repeat(' ', 5 + i * 2)) + (Array.isArray(vm) ? ((formatComponentName(vm[0])) + "... (" + (vm[1]) + " recursive calls)") : formatComponentName(vm))); }) .join('\n') } else { return ("\n\n(found in " + (formatComponentName(vm)) + ")") } }; } /* */ function handleError (err, vm, info) { if (config.errorHandler) { config.errorHandler.call(null, err, vm, info); } else { if (true) { warn(("Error in " + info + ": \"" + (err.toString()) + "\""), vm); } /* istanbul ignore else */ if (inBrowser && typeof console !== 'undefined') { console.error(err); } else { throw err } } } /* */ /* globals MutationObserver */ // can we use __proto__? var hasProto = '__proto__' in {}; // Browser environment sniffing var inBrowser = typeof window !== 'undefined'; var UA = inBrowser && window.navigator.userAgent.toLowerCase(); var isIE = UA && /msie|trident/.test(UA); var isIE9 = UA && UA.indexOf('msie 9.0') > 0; var isEdge = UA && UA.indexOf('edge/') > 0; var isAndroid = UA && UA.indexOf('android') > 0; var isIOS = UA && /iphone|ipad|ipod|ios/.test(UA); var isChrome = UA && /chrome\/\d+/.test(UA) && !isEdge; // Firefix has a "watch" function on Object.prototype... var nativeWatch = ({}).watch; var supportsPassive = false; if (inBrowser) { try { var opts = {}; Object.defineProperty(opts, 'passive', ({ get: function get () { /* istanbul ignore next */ supportsPassive = true; } })); // https://github.com/facebook/flow/issues/285 window.addEventListener('test-passive', null, opts); } catch (e) {} } // this needs to be lazy-evaled because vue may be required before // vue-server-renderer can set VUE_ENV var _isServer; var isServerRendering = function () { if (_isServer === undefined) { /* istanbul ignore if */ if (!inBrowser && typeof global !== 'undefined') { // detect presence of vue-server-renderer and avoid // Webpack shimming the process _isServer = global['process'].env.VUE_ENV === 'server'; } else { _isServer = false; } } return _isServer }; // detect devtools var devtools = inBrowser && window.__VUE_DEVTOOLS_GLOBAL_HOOK__; /* istanbul ignore next */ function isNative (Ctor) { return typeof Ctor === 'function' && /native code/.test(Ctor.toString()) } var hasSymbol = typeof Symbol !== 'undefined' && isNative(Symbol) && typeof Reflect !== 'undefined' && isNative(Reflect.ownKeys); /** * Defer a task to execute it asynchronously. */ var nextTick = (function () { var callbacks = []; var pending = false; var timerFunc; function nextTickHandler () { pending = false; var copies = callbacks.slice(0); callbacks.length = 0; for (var i = 0; i < copies.length; i++) { copies[i](); } } // the nextTick behavior leverages the microtask queue, which can be accessed // via either native Promise.then or MutationObserver. // MutationObserver has wider support, however it is seriously bugged in // UIWebView in iOS >= 9.3.3 when triggered in touch event handlers. It // completely stops working after triggering a few times... so, if native // Promise is available, we will use it: /* istanbul ignore if */ if (typeof Promise !== 'undefined' && isNative(Promise)) { var p = Promise.resolve(); var logError = function (err) { console.error(err); }; timerFunc = function () { p.then(nextTickHandler).catch(logError); // in problematic UIWebViews, Promise.then doesn't completely break, but // it can get stuck in a weird state where callbacks are pushed into the // microtask queue but the queue isn't being flushed, until the browser // needs to do some other work, e.g. handle a timer. Therefore we can // "force" the microtask queue to be flushed by adding an empty timer. if (isIOS) { setTimeout(noop); } }; } else if (typeof MutationObserver !== 'undefined' && ( isNative(MutationObserver) || // PhantomJS and iOS 7.x MutationObserver.toString() === '[object MutationObserverConstructor]' )) { // use MutationObserver where native Promise is not available, // e.g. PhantomJS IE11, iOS7, Android 4.4 var counter = 1; var observer = new MutationObserver(nextTickHandler); var textNode = document.createTextNode(String(counter)); observer.observe(textNode, { characterData: true }); timerFunc = function () { counter = (counter + 1) % 2; textNode.data = String(counter); }; } else { // fallback to setTimeout /* istanbul ignore next */ timerFunc = function () { setTimeout(nextTickHandler, 0); }; } return function queueNextTick (cb, ctx) { var _resolve; callbacks.push(function () { if (cb) { try { cb.call(ctx); } catch (e) { handleError(e, ctx, 'nextTick'); } } else if (_resolve) { _resolve(ctx); } }); if (!pending) { pending = true; timerFunc(); } if (!cb && typeof Promise !== 'undefined') { return new Promise(function (resolve, reject) { _resolve = resolve; }) } } })(); var _Set; /* istanbul ignore if */ if (typeof Set !== 'undefined' && isNative(Set)) { // use native Set when available. _Set = Set; } else { // a non-standard Set polyfill that only works with primitive keys. _Set = (function () { function Set () { this.set = Object.create(null); } Set.prototype.has = function has (key) { return this.set[key] === true }; Set.prototype.add = function add (key) { this.set[key] = true; }; Set.prototype.clear = function clear () { this.set = Object.create(null); }; return Set; }()); } /* */ var uid = 0; /** * A dep is an observable that can have multiple * directives subscribing to it. */ var Dep = function Dep () { this.id = uid++; this.subs = []; }; Dep.prototype.addSub = function addSub (sub) { this.subs.push(sub); }; Dep.prototype.removeSub = function removeSub (sub) { remove(this.subs, sub); }; Dep.prototype.depend = function depend () { if (Dep.target) { Dep.target.addDep(this); } }; Dep.prototype.notify = function notify () { // stabilize the subscriber list first var subs = this.subs.slice(); for (var i = 0, l = subs.length; i < l; i++) { subs[i].update(); } }; // the current target watcher being evaluated. // this is globally unique because there could be only one // watcher being evaluated at any time. Dep.target = null; var targetStack = []; function pushTarget (_target) { if (Dep.target) { targetStack.push(Dep.target); } Dep.target = _target; } function popTarget () { Dep.target = targetStack.pop(); } /* * not type checking this file because flow doesn't play well with * dynamically accessing methods on Array prototype */ var arrayProto = Array.prototype; var arrayMethods = Object.create(arrayProto);[ 'push', 'pop', 'shift', 'unshift', 'splice', 'sort', 'reverse' ] .forEach(function (method) { // cache original method var original = arrayProto[method]; def(arrayMethods, method, function mutator () { var args = [], len = arguments.length; while ( len-- ) args[ len ] = arguments[ len ]; var result = original.apply(this, args); var ob = this.__ob__; var inserted; switch (method) { case 'push': case 'unshift': inserted = args; break case 'splice': inserted = args.slice(2); break } if (inserted) { ob.observeArray(inserted); } // notify change ob.dep.notify(); return result }); }); /* */ var arrayKeys = Object.getOwnPropertyNames(arrayMethods); /** * By default, when a reactive property is set, the new value is * also converted to become reactive. However when passing down props, * we don't want to force conversion because the value may be a nested value * under a frozen data structure. Converting it would defeat the optimization. */ var observerState = { shouldConvert: true }; /** * Observer class that are attached to each observed * object. Once attached, the observer converts target * object's property keys into getter/setters that * collect dependencies and dispatches updates. */ var Observer = function Observer (value) { this.value = value; this.dep = new Dep(); this.vmCount = 0; def(value, '__ob__', this); if (Array.isArray(value)) { var augment = hasProto ? protoAugment : copyAugment; augment(value, arrayMethods, arrayKeys); this.observeArray(value); } else { this.walk(value); } }; /** * Walk through each property and convert them into * getter/setters. This method should only be called when * value type is Object. */ Observer.prototype.walk = function walk (obj) { var keys = Object.keys(obj); for (var i = 0; i < keys.length; i++) { defineReactive$$1(obj, keys[i], obj[keys[i]]); } }; /** * Observe a list of Array items. */ Observer.prototype.observeArray = function observeArray (items) { for (var i = 0, l = items.length; i < l; i++) { observe(items[i]); } }; // helpers /** * Augment an target Object or Array by intercepting * the prototype chain using __proto__ */ function protoAugment (target, src, keys) { /* eslint-disable no-proto */ target.__proto__ = src; /* eslint-enable no-proto */ } /** * Augment an target Object or Array by defining * hidden properties. */ /* istanbul ignore next */ function copyAugment (target, src, keys) { for (var i = 0, l = keys.length; i < l; i++) { var key = keys[i]; def(target, key, src[key]); } } /** * Attempt to create an observer instance for a value, * returns the new observer if successfully observed, * or the existing observer if the value already has one. */ function observe (value, asRootData) { if (!isObject(value)) { return } var ob; if (hasOwn(value, '__ob__') && value.__ob__ instanceof Observer) { ob = value.__ob__; } else if ( observerState.shouldConvert && !isServerRendering() && (Array.isArray(value) || isPlainObject(value)) && Object.isExtensible(value) && !value._isVue ) { ob = new Observer(value); } if (asRootData && ob) { ob.vmCount++; } return ob } /** * Define a reactive property on an Object. */ function defineReactive$$1 ( obj, key, val, customSetter, shallow ) { var dep = new Dep(); var property = Object.getOwnPropertyDescriptor(obj, key); if (property && property.configurable === false) { return } // cater for pre-defined getter/setters var getter = property && property.get; var setter = property && property.set; var childOb = !shallow && observe(val); Object.defineProperty(obj, key, { enumerable: true, configurable: true, get: function reactiveGetter () { var value = getter ? getter.call(obj) : val; if (Dep.target) { dep.depend(); if (childOb) { childOb.dep.depend(); } if (Array.isArray(value)) { dependArray(value); } } return value }, set: function reactiveSetter (newVal) { var value = getter ? getter.call(obj) : val; /* eslint-disable no-self-compare */ if (newVal === value || (newVal !== newVal && value !== value)) { return } /* eslint-enable no-self-compare */ if ("development" !== 'production' && customSetter) { customSetter(); } if (setter) { setter.call(obj, newVal); } else { val = newVal; } childOb = !shallow && observe(newVal); dep.notify(); } }); } /** * Set a property on an object. Adds the new property and * triggers change notification if the property doesn't * already exist. */ function set (target, key, val) { if (Array.isArray(target) && isValidArrayIndex(key)) { target.length = Math.max(target.length, key); target.splice(key, 1, val); return val } if (hasOwn(target, key)) { target[key] = val; return val } var ob = (target).__ob__; if (target._isVue || (ob && ob.vmCount)) { "development" !== 'production' && warn( 'Avoid adding reactive properties to a Vue instance or its root $data ' + 'at runtime - declare it upfront in the data option.' ); return val } if (!ob) { target[key] = val; return val } defineReactive$$1(ob.value, key, val); ob.dep.notify(); return val } /** * Delete a property and trigger change if necessary. */ function del (target, key) { if (Array.isArray(target) && isValidArrayIndex(key)) { target.splice(key, 1); return } var ob = (target).__ob__; if (target._isVue || (ob && ob.vmCount)) { "development" !== 'production' && warn( 'Avoid deleting properties on a Vue instance or its root $data ' + '- just set it to null.' ); return } if (!hasOwn(target, key)) { return } delete target[key]; if (!ob) { return } ob.dep.notify(); } /** * Collect dependencies on array elements when the array is touched, since * we cannot intercept array element access like property getters. */ function dependArray (value) { for (var e = (void 0), i = 0, l = value.length; i < l; i++) { e = value[i]; e && e.__ob__ && e.__ob__.dep.depend(); if (Array.isArray(e)) { dependArray(e); } } } /* */ /** * Option overwriting strategies are functions that handle * how to merge a parent option value and a child option * value into the final value. */ var strats = config.optionMergeStrategies; /** * Options with restrictions */ if (true) { strats.el = strats.propsData = function (parent, child, vm, key) { if (!vm) { warn( "option \"" + key + "\" can only be used during instance " + 'creation with the `new` keyword.' ); } return defaultStrat(parent, child) }; } /** * Helper that recursively merges two data objects together. */ function mergeData (to, from) { if (!from) { return to } var key, toVal, fromVal; var keys = Object.keys(from); for (var i = 0; i < keys.length; i++) { key = keys[i]; toVal = to[key]; fromVal = from[key]; if (!hasOwn(to, key)) { set(to, key, fromVal); } else if (isPlainObject(toVal) && isPlainObject(fromVal)) { mergeData(toVal, fromVal); } } return to } /** * Data */ function mergeDataOrFn ( parentVal, childVal, vm ) { if (!vm) { // in a Vue.extend merge, both should be functions if (!childVal) { return parentVal } if (!parentVal) { return childVal } // when parentVal & childVal are both present, // we need to return a function that returns the // merged result of both functions... no need to // check if parentVal is a function here because // it has to be a function to pass previous merges. return function mergedDataFn () { return mergeData( typeof childVal === 'function' ? childVal.call(this) : childVal, typeof parentVal === 'function' ? parentVal.call(this) : parentVal ) } } else if (parentVal || childVal) { return function mergedInstanceDataFn () { // instance merge var instanceData = typeof childVal === 'function' ? childVal.call(vm) : childVal; var defaultData = typeof parentVal === 'function' ? parentVal.call(vm) : undefined; if (instanceData) { return mergeData(instanceData, defaultData) } else { return defaultData } } } } strats.data = function ( parentVal, childVal, vm ) { if (!vm) { if (childVal && typeof childVal !== 'function') { "development" !== 'production' && warn( 'The "data" option should be a function ' + 'that returns a per-instance value in component ' + 'definitions.', vm ); return parentVal } return mergeDataOrFn.call(this, parentVal, childVal) } return mergeDataOrFn(parentVal, childVal, vm) }; /** * Hooks and props are merged as arrays. */ function mergeHook ( parentVal, childVal ) { return childVal ? parentVal ? parentVal.concat(childVal) : Array.isArray(childVal) ? childVal : [childVal] : parentVal } LIFECYCLE_HOOKS.forEach(function (hook) { strats[hook] = mergeHook; }); /** * Assets * * When a vm is present (instance creation), we need to do * a three-way merge between constructor options, instance * options and parent options. */ function mergeAssets (parentVal, childVal) { var res = Object.create(parentVal || null); return childVal ? extend(res, childVal) : res } ASSET_TYPES.forEach(function (type) { strats[type + 's'] = mergeAssets; }); /** * Watchers. * * Watchers hashes should not overwrite one * another, so we merge them as arrays. */ strats.watch = function (parentVal, childVal) { // work around Firefox's Object.prototype.watch... if (parentVal === nativeWatch) { parentVal = undefined; } if (childVal === nativeWatch) { childVal = undefined; } /* istanbul ignore if */ if (!childVal) { return Object.create(parentVal || null) } if (!parentVal) { return childVal } var ret = {}; extend(ret, parentVal); for (var key in childVal) { var parent = ret[key]; var child = childVal[key]; if (parent && !Array.isArray(parent)) { parent = [parent]; } ret[key] = parent ? parent.concat(child) : Array.isArray(child) ? child : [child]; } return ret }; /** * Other object hashes. */ strats.props = strats.methods = strats.inject = strats.computed = function (parentVal, childVal) { if (!parentVal) { return childVal } var ret = Object.create(null); extend(ret, parentVal); if (childVal) { extend(ret, childVal); } return ret }; strats.provide = mergeDataOrFn; /** * Default strategy. */ var defaultStrat = function (parentVal, childVal) { return childVal === undefined ? parentVal : childVal }; /** * Validate component names */ function checkComponents (options) { for (var key in options.components) { var lower = key.toLowerCase(); if (isBuiltInTag(lower) || config.isReservedTag(lower)) { warn( 'Do not use built-in or reserved HTML elements as component ' + 'id: ' + key ); } } } /** * Ensure all props option syntax are normalized into the * Object-based format. */ function normalizeProps (options) { var props = options.props; if (!props) { return } var res = {}; var i, val, name; if (Array.isArray(props)) { i = props.length; while (i--) { val = props[i]; if (typeof val === 'string') { name = camelize(val); res[name] = { type: null }; } else if (true) { warn('props must be strings when using array syntax.'); } } } else if (isPlainObject(props)) { for (var key in props) { val = props[key]; name = camelize(key); res[name] = isPlainObject(val) ? val : { type: val }; } } options.props = res; } /** * Normalize all injections into Object-based format */ function normalizeInject (options) { var inject = options.inject; if (Array.isArray(inject)) { var normalized = options.inject = {}; for (var i = 0; i < inject.length; i++) { normalized[inject[i]] = inject[i]; } } } /** * Normalize raw function directives into object format. */ function normalizeDirectives (options) { var dirs = options.directives; if (dirs) { for (var key in dirs) { var def = dirs[key]; if (typeof def === 'function') { dirs[key] = { bind: def, update: def }; } } } } /** * Merge two option objects into a new one. * Core utility used in both instantiation and inheritance. */ function mergeOptions ( parent, child, vm ) { if (true) { checkComponents(child); } if (typeof child === 'function') { child = child.options; } normalizeProps(child); normalizeInject(child); normalizeDirectives(child); var extendsFrom = child.extends; if (extendsFrom) { parent = mergeOptions(parent, extendsFrom, vm); } if (child.mixins) { for (var i = 0, l = child.mixins.length; i < l; i++) { parent = mergeOptions(parent, child.mixins[i], vm); } } var options = {}; var key; for (key in parent) { mergeField(key); } for (key in child) { if (!hasOwn(parent, key)) { mergeField(key); } } function mergeField (key) { var strat = strats[key] || defaultStrat; options[key] = strat(parent[key], child[key], vm, key); } return options } /** * Resolve an asset. * This function is used because child instances need access * to assets defined in its ancestor chain. */ function resolveAsset ( options, type, id, warnMissing ) { /* istanbul ignore if */ if (typeof id !== 'string') { return } var assets = options[type]; // check local registration variations first if (hasOwn(assets, id)) { return assets[id] } var camelizedId = camelize(id); if (hasOwn(assets, camelizedId)) { return assets[camelizedId] } var PascalCaseId = capitalize(camelizedId); if (hasOwn(assets, PascalCaseId)) { return assets[PascalCaseId] } // fallback to prototype chain var res = assets[id] || assets[camelizedId] || assets[PascalCaseId]; if ("development" !== 'production' && warnMissing && !res) { warn( 'Failed to resolve ' + type.slice(0, -1) + ': ' + id, options ); } return res } /* */ function validateProp ( key, propOptions, propsData, vm ) { var prop = propOptions[key]; var absent = !hasOwn(propsData, key); var value = propsData[key]; // handle boolean props if (isType(Boolean, prop.type)) { if (absent && !hasOwn(prop, 'default')) { value = false; } else if (!isType(String, prop.type) && (value === '' || value === hyphenate(key))) { value = true; } } // check default value if (value === undefined) { value = getPropDefaultValue(vm, prop, key); // since the default value is a fresh copy, // make sure to observe it. var prevShouldConvert = observerState.shouldConvert; observerState.shouldConvert = true; observe(value); observerState.shouldConvert = prevShouldConvert; } if (true) { assertProp(prop, key, value, vm, absent); } return value } /** * Get the default value of a prop. */ function getPropDefaultValue (vm, prop, key) { // no default, return undefined if (!hasOwn(prop, 'default')) { return undefined } var def = prop.default; // warn against non-factory defaults for Object & Array if ("development" !== 'production' && isObject(def)) { warn( 'Invalid default value for prop "' + key + '": ' + 'Props with type Object/Array must use a factory function ' + 'to return the default value.', vm ); } // the raw prop value was also undefined from previous render, // return previous default value to avoid unnecessary watcher trigger if (vm && vm.$options.propsData && vm.$options.propsData[key] === undefined && vm._props[key] !== undefined ) { return vm._props[key] } // call factory function for non-Function types // a value is Function if its prototype is function even across different execution context return typeof def === 'function' && getType(prop.type) !== 'Function' ? def.call(vm) : def } /** * Assert whether a prop is valid. */ function assertProp ( prop, name, value, vm, absent ) { if (prop.required && absent) { warn( 'Missing required prop: "' + name + '"', vm ); return } if (value == null && !prop.required) { return } var type = prop.type; var valid = !type || type === true; var expectedTypes = []; if (type) { if (!Array.isArray(type)) { type = [type]; } for (var i = 0; i < type.length && !valid; i++) { var assertedType = assertType(value, type[i]); expectedTypes.push(assertedType.expectedType || ''); valid = assertedType.valid; } } if (!valid) { warn( 'Invalid prop: type check failed for prop "' + name + '".' + ' Expected ' + expectedTypes.map(capitalize).join(', ') + ', got ' + Object.prototype.toString.call(value).slice(8, -1) + '.', vm ); return } var validator = prop.validator; if (validator) { if (!validator(value)) { warn( 'Invalid prop: custom validator check failed for prop "' + name + '".', vm ); } } } var simpleCheckRE = /^(String|Number|Boolean|Function|Symbol)$/; function assertType (value, type) { var valid; var expectedType = getType(type); if (simpleCheckRE.test(expectedType)) { valid = typeof value === expectedType.toLowerCase(); } else if (expectedType === 'Object') { valid = isPlainObject(value); } else if (expectedType === 'Array') { valid = Array.isArray(value); } else { valid = value instanceof type; } return { valid: valid, expectedType: expectedType } } /** * Use function string name to check built-in types, * because a simple equality check will fail when running * across different vms / iframes. */ function getType (fn) { var match = fn && fn.toString().match(/^\s*function (\w+)/); return match ? match[1] : '' } function isType (type, fn) { if (!Array.isArray(fn)) { return getType(fn) === getType(type) } for (var i = 0, len = fn.length; i < len; i++) { if (getType(fn[i]) === getType(type)) { return true } } /* istanbul ignore next */ return false } /* */ var mark; var measure; if (true) { var perf = inBrowser && window.performance; /* istanbul ignore if */ if ( perf && perf.mark && perf.measure && perf.clearMarks && perf.clearMeasures ) { mark = function (tag) { return perf.mark(tag); }; measure = function (name, startTag, endTag) { perf.measure(name, startTag, endTag); perf.clearMarks(startTag); perf.clearMarks(endTag); perf.clearMeasures(name); }; } } /* not type checking this file because flow doesn't play well with Proxy */ var initProxy; if (true) { var allowedGlobals = makeMap( 'Infinity,undefined,NaN,isFinite,isNaN,' + 'parseFloat,parseInt,decodeURI,decodeURIComponent,encodeURI,encodeURIComponent,' + 'Math,Number,Date,Array,Object,Boolean,String,RegExp,Map,Set,JSON,Intl,' + 'require' // for Webpack/Browserify ); var warnNonPresent = function (target, key) { warn( "Property or method \"" + key + "\" is not defined on the instance but " + "referenced during render. Make sure to declare reactive data " + "properties in the data option.", target ); }; var hasProxy = typeof Proxy !== 'undefined' && Proxy.toString().match(/native code/); if (hasProxy) { var isBuiltInModifier = makeMap('stop,prevent,self,ctrl,shift,alt,meta'); config.keyCodes = new Proxy(config.keyCodes, { set: function set (target, key, value) { if (isBuiltInModifier(key)) { warn(("Avoid overwriting built-in modifier in config.keyCodes: ." + key)); return false } else { target[key] = value; return true } } }); } var hasHandler = { has: function has (target, key) { var has = key in target; var isAllowed = allowedGlobals(key) || key.charAt(0) === '_'; if (!has && !isAllowed) { warnNonPresent(target, key); } return has || !isAllowed } }; var getHandler = { get: function get (target, key) { if (typeof key === 'string' && !(key in target)) { warnNonPresent(target, key); } return target[key] } }; initProxy = function initProxy (vm) { if (hasProxy) { // determine which proxy handler to use var options = vm.$options; var handlers = options.render && options.render._withStripped ? getHandler : hasHandler; vm._renderProxy = new Proxy(vm, handlers); } else { vm._renderProxy = vm; } }; } /* */ var VNode = function VNode ( tag, data, children, text, elm, context, componentOptions, asyncFactory ) { this.tag = tag; this.data = data; this.children = children; this.text = text; this.elm = elm; this.ns = undefined; this.context = context; this.functionalContext = undefined; this.key = data && data.key; this.componentOptions = componentOptions; this.componentInstance = undefined; this.parent = undefined; this.raw = false; this.isStatic = false; this.isRootInsert = true; this.isComment = false; this.isCloned = false; this.isOnce = false; this.asyncFactory = asyncFactory; this.asyncMeta = undefined; this.isAsyncPlaceholder = false; }; var prototypeAccessors = { child: {} }; // DEPRECATED: alias for componentInstance for backwards compat. /* istanbul ignore next */ prototypeAccessors.child.get = function () { return this.componentInstance }; Object.defineProperties( VNode.prototype, prototypeAccessors ); var createEmptyVNode = function (text) { if ( text === void 0 ) text = ''; var node = new VNode(); node.text = text; node.isComment = true; return node }; function createTextVNode (val) { return new VNode(undefined, undefined, undefined, String(val)) } // optimized shallow clone // used for static nodes and slot nodes because they may be reused across // multiple renders, cloning them avoids errors when DOM manipulations rely // on their elm reference. function cloneVNode (vnode) { var cloned = new VNode( vnode.tag, vnode.data, vnode.children, vnode.text, vnode.elm, vnode.context, vnode.componentOptions, vnode.asyncFactory ); cloned.ns = vnode.ns; cloned.isStatic = vnode.isStatic; cloned.key = vnode.key; cloned.isComment = vnode.isComment; cloned.isCloned = true; return cloned } function cloneVNodes (vnodes) { var len = vnodes.length; var res = new Array(len); for (var i = 0; i < len; i++) { res[i] = cloneVNode(vnodes[i]); } return res } /* */ var normalizeEvent = cached(function (name) { var passive = name.charAt(0) === '&'; name = passive ? name.slice(1) : name; var once$$1 = name.charAt(0) === '~'; // Prefixed last, checked first name = once$$1 ? name.slice(1) : name; var capture = name.charAt(0) === '!'; name = capture ? name.slice(1) : name; return { name: name, once: once$$1, capture: capture, passive: passive } }); function createFnInvoker (fns) { function invoker () { var arguments$1 = arguments; var fns = invoker.fns; if (Array.isArray(fns)) { var cloned = fns.slice(); for (var i = 0; i < cloned.length; i++) { cloned[i].apply(null, arguments$1); } } else { // return handler return value for single handlers return fns.apply(null, arguments) } } invoker.fns = fns; return invoker } function updateListeners ( on, oldOn, add, remove$$1, vm ) { var name, cur, old, event; for (name in on) { cur = on[name]; old = oldOn[name]; event = normalizeEvent(name); if (isUndef(cur)) { "development" !== 'production' && warn( "Invalid handler for event \"" + (event.name) + "\": got " + String(cur), vm ); } else if (isUndef(old)) { if (isUndef(cur.fns)) { cur = on[name] = createFnInvoker(cur); } add(event.name, cur, event.once, event.capture, event.passive); } else if (cur !== old) { old.fns = cur; on[name] = old; } } for (name in oldOn) { if (isUndef(on[name])) { event = normalizeEvent(name); remove$$1(event.name, oldOn[name], event.capture); } } } /* */ function mergeVNodeHook (def, hookKey, hook) { var invoker; var oldHook = def[hookKey]; function wrappedHook () { hook.apply(this, arguments); // important: remove merged hook to ensure it's called only once // and prevent memory leak remove(invoker.fns, wrappedHook); } if (isUndef(oldHook)) { // no existing hook invoker = createFnInvoker([wrappedHook]); } else { /* istanbul ignore if */ if (isDef(oldHook.fns) && isTrue(oldHook.merged)) { // already a merged invoker invoker = oldHook; invoker.fns.push(wrappedHook); } else { // existing plain hook invoker = createFnInvoker([oldHook, wrappedHook]); } } invoker.merged = true; def[hookKey] = invoker; } /* */ function extractPropsFromVNodeData ( data, Ctor, tag ) { // we are only extracting raw values here. // validation and default values are handled in the child // component itself. var propOptions = Ctor.options.props; if (isUndef(propOptions)) { return } var res = {}; var attrs = data.attrs; var props = data.props; if (isDef(attrs) || isDef(props)) { for (var key in propOptions) { var altKey = hyphenate(key); if (true) { var keyInLowerCase = key.toLowerCase(); if ( key !== keyInLowerCase && attrs && hasOwn(attrs, keyInLowerCase) ) { tip( "Prop \"" + keyInLowerCase + "\" is passed to component " + (formatComponentName(tag || Ctor)) + ", but the declared prop name is" + " \"" + key + "\". " + "Note that HTML attributes are case-insensitive and camelCased " + "props need to use their kebab-case equivalents when using in-DOM " + "templates. You should probably use \"" + altKey + "\" instead of \"" + key + "\"." ); } } checkProp(res, props, key, altKey, true) || checkProp(res, attrs, key, altKey, false); } } return res } function checkProp ( res, hash, key, altKey, preserve ) { if (isDef(hash)) { if (hasOwn(hash, key)) { res[key] = hash[key]; if (!preserve) { delete hash[key]; } return true } else if (hasOwn(hash, altKey)) { res[key] = hash[altKey]; if (!preserve) { delete hash[altKey]; } return true } } return false } /* */ // The template compiler attempts to minimize the need for normalization by // statically analyzing the template at compile time. // // For plain HTML markup, normalization can be completely skipped because the // generated render function is guaranteed to return Array<VNode>. There are // two cases where extra normalization is needed: // 1. When the children contains components - because a functional component // may return an Array instead of a single root. In this case, just a simple // normalization is needed - if any child is an Array, we flatten the whole // thing with Array.prototype.concat. It is guaranteed to be only 1-level deep // because functional components already normalize their own children. function simpleNormalizeChildren (children) { for (var i = 0; i < children.length; i++) { if (Array.isArray(children[i])) { return Array.prototype.concat.apply([], children) } } return children } // 2. When the children contains constructs that always generated nested Arrays, // e.g. <template>, <slot>, v-for, or when the children is provided by user // with hand-written render functions / JSX. In such cases a full normalization // is needed to cater to all possible types of children values. function normalizeChildren (children) { return isPrimitive(children) ? [createTextVNode(children)] : Array.isArray(children) ? normalizeArrayChildren(children) : undefined } function isTextNode (node) { return isDef(node) && isDef(node.text) && isFalse(node.isComment) } function normalizeArrayChildren (children, nestedIndex) { var res = []; var i, c, last; for (i = 0; i < children.length; i++) { c = children[i]; if (isUndef(c) || typeof c === 'boolean') { continue } last = res[res.length - 1]; // nested if (Array.isArray(c)) { res.push.apply(res, normalizeArrayChildren(c, ((nestedIndex || '') + "_" + i))); } else if (isPrimitive(c)) { if (isTextNode(last)) { // merge adjacent text nodes // this is necessary for SSR hydration because text nodes are // essentially merged when rendered to HTML strings (last).text += String(c); } else if (c !== '') { // convert primitive to vnode res.push(createTextVNode(c)); } } else { if (isTextNode(c) && isTextNode(last)) { // merge adjacent text nodes res[res.length - 1] = createTextVNode(last.text + c.text); } else { // default key for nested array children (likely generated by v-for) if (isTrue(children._isVList) && isDef(c.tag) && isUndef(c.key) && isDef(nestedIndex)) { c.key = "__vlist" + nestedIndex + "_" + i + "__"; } res.push(c); } } } return res } /* */ function ensureCtor (comp, base) { if (comp.__esModule && comp.default) { comp = comp.default; } return isObject(comp) ? base.extend(comp) : comp } function createAsyncPlaceholder ( factory, data, context, children, tag ) { var node = createEmptyVNode(); node.asyncFactory = factory; node.asyncMeta = { data: data, context: context, children: children, tag: tag }; return node } function resolveAsyncComponent ( factory, baseCtor, context ) { if (isTrue(factory.error) && isDef(factory.errorComp)) { return factory.errorComp } if (isDef(factory.resolved)) { return factory.resolved } if (isTrue(factory.loading) && isDef(factory.loadingComp)) { return factory.loadingComp } if (isDef(factory.contexts)) { // already pending factory.contexts.push(context); } else { var contexts = factory.contexts = [context]; var sync = true; var forceRender = function () { for (var i = 0, l = contexts.length; i < l; i++) { contexts[i].$forceUpdate(); } }; var resolve = once(function (res) { // cache resolved factory.resolved = ensureCtor(res, baseCtor); // invoke callbacks only if this is not a synchronous resolve // (async resolves are shimmed as synchronous during SSR) if (!sync) { forceRender(); } }); var reject = once(function (reason) { "development" !== 'production' && warn( "Failed to resolve async component: " + (String(factory)) + (reason ? ("\nReason: " + reason) : '') ); if (isDef(factory.errorComp)) { factory.error = true; forceRender(); } }); var res = factory(resolve, reject); if (isObject(res)) { if (typeof res.then === 'function') { // () => Promise if (isUndef(factory.resolved)) { res.then(resolve, reject); } } else if (isDef(res.component) && typeof res.component.then === 'function') { res.component.then(resolve, reject); if (isDef(res.error)) { factory.errorComp = ensureCtor(res.error, baseCtor); } if (isDef(res.loading)) { factory.loadingComp = ensureCtor(res.loading, baseCtor); if (res.delay === 0) { factory.loading = true; } else { setTimeout(function () { if (isUndef(factory.resolved) && isUndef(factory.error)) { factory.loading = true; forceRender(); } }, res.delay || 200); } } if (isDef(res.timeout)) { setTimeout(function () { if (isUndef(factory.resolved)) { reject( true ? ("timeout (" + (res.timeout) + "ms)") : null ); } }, res.timeout); } } } sync = false; // return in case resolved synchronously return factory.loading ? factory.loadingComp : factory.resolved } } /* */ function getFirstComponentChild (children) { if (Array.isArray(children)) { for (var i = 0; i < children.length; i++) { var c = children[i]; if (isDef(c) && isDef(c.componentOptions)) { return c } } } } /* */ /* */ function initEvents (vm) { vm._events = Object.create(null); vm._hasHookEvent = false; // init parent attached events var listeners = vm.$options._parentListeners; if (listeners) { updateComponentListeners(vm, listeners); } } var target; function add (event, fn, once$$1) { if (once$$1) { target.$once(event, fn); } else { target.$on(event, fn); } } function remove$1 (event, fn) { target.$off(event, fn); } function updateComponentListeners ( vm, listeners, oldListeners ) { target = vm; updateListeners(listeners, oldListeners || {}, add, remove$1, vm); } function eventsMixin (Vue) { var hookRE = /^hook:/; Vue.prototype.$on = function (event, fn) { var this$1 = this; var vm = this; if (Array.isArray(event)) { for (var i = 0, l = event.length; i < l; i++) { this$1.$on(event[i], fn); } } else { (vm._events[event] || (vm._events[event] = [])).push(fn); // optimize hook:event cost by using a boolean flag marked at registration // instead of a hash lookup if (hookRE.test(event)) { vm._hasHookEvent = true; } } return vm }; Vue.prototype.$once = function (event, fn) { var vm = this; function on () { vm.$off(event, on); fn.apply(vm, arguments); } on.fn = fn; vm.$on(event, on); return vm }; Vue.prototype.$off = function (event, fn) { var this$1 = this; var vm = this; // all if (!arguments.length) { vm._events = Object.create(null); return vm } // array of events if (Array.isArray(event)) { for (var i$1 = 0, l = event.length; i$1 < l; i$1++) { this$1.$off(event[i$1], fn); } return vm } // specific event var cbs = vm._events[event]; if (!cbs) { return vm } if (arguments.length === 1) { vm._events[event] = null; return vm } // specific handler var cb; var i = cbs.length; while (i--) { cb = cbs[i]; if (cb === fn || cb.fn === fn) { cbs.splice(i, 1); break } } return vm }; Vue.prototype.$emit = function (event) { var vm = this; if (true) { var lowerCaseEvent = event.toLowerCase(); if (lowerCaseEvent !== event && vm._events[lowerCaseEvent]) { tip( "Event \"" + lowerCaseEvent + "\" is emitted in component " + (formatComponentName(vm)) + " but the handler is registered for \"" + event + "\". " + "Note that HTML attributes are case-insensitive and you cannot use " + "v-on to listen to camelCase events when using in-DOM templates. " + "You should probably use \"" + (hyphenate(event)) + "\" instead of \"" + event + "\"." ); } } var cbs = vm._events[event]; if (cbs) { cbs = cbs.length > 1 ? toArray(cbs) : cbs; var args = toArray(arguments, 1); for (var i = 0, l = cbs.length; i < l; i++) { try { cbs[i].apply(vm, args); } catch (e) { handleError(e, vm, ("event handler for \"" + event + "\"")); } } } return vm }; } /* */ /** * Runtime helper for resolving raw children VNodes into a slot object. */ function resolveSlots ( children, context ) { var slots = {}; if (!children) { return slots } var defaultSlot = []; for (var i = 0, l = children.length; i < l; i++) { var child = children[i]; // named slots should only be respected if the vnode was rendered in the // same context. if ((child.context === context || child.functionalContext === context) && child.data && child.data.slot != null ) { var name = child.data.slot; var slot = (slots[name] || (slots[name] = [])); if (child.tag === 'template') { slot.push.apply(slot, child.children); } else { slot.push(child); } } else { defaultSlot.push(child); } } // ignore whitespace if (!defaultSlot.every(isWhitespace)) { slots.default = defaultSlot; } return slots } function isWhitespace (node) { return node.isComment || node.text === ' ' } function resolveScopedSlots ( fns, // see flow/vnode res ) { res = res || {}; for (var i = 0; i < fns.length; i++) { if (Array.isArray(fns[i])) { resolveScopedSlots(fns[i], res); } else { res[fns[i].key] = fns[i].fn; } } return res } /* */ var activeInstance = null; var isUpdatingChildComponent = false; function initLifecycle (vm) { var options = vm.$options; // locate first non-abstract parent var parent = options.parent; if (parent && !options.abstract) { while (parent.$options.abstract && parent.$parent) { parent = parent.$parent; } parent.$children.push(vm); } vm.$parent = parent; vm.$root = parent ? parent.$root : vm; vm.$children = []; vm.$refs = {}; vm._watcher = null; vm._inactive = null; vm._directInactive = false; vm._isMounted = false; vm._isDestroyed = false; vm._isBeingDestroyed = false; } function lifecycleMixin (Vue) { Vue.prototype._update = function (vnode, hydrating) { var vm = this; if (vm._isMounted) { callHook(vm, 'beforeUpdate'); } var prevEl = vm.$el; var prevVnode = vm._vnode; var prevActiveInstance = activeInstance; activeInstance = vm; vm._vnode = vnode; // Vue.prototype.__patch__ is injected in entry points // based on the rendering backend used. if (!prevVnode) { // initial render vm.$el = vm.__patch__( vm.$el, vnode, hydrating, false /* removeOnly */, vm.$options._parentElm, vm.$options._refElm ); // no need for the ref nodes after initial patch // this prevents keeping a detached DOM tree in memory (#5851) vm.$options._parentElm = vm.$options._refElm = null; } else { // updates vm.$el = vm.__patch__(prevVnode, vnode); } activeInstance = prevActiveInstance; // update __vue__ reference if (prevEl) { prevEl.__vue__ = null; } if (vm.$el) { vm.$el.__vue__ = vm; } // if parent is an HOC, update its $el as well if (vm.$vnode && vm.$parent && vm.$vnode === vm.$parent._vnode) { vm.$parent.$el = vm.$el; } // updated hook is called by the scheduler to ensure that children are // updated in a parent's updated hook. }; Vue.prototype.$forceUpdate = function () { var vm = this; if (vm._watcher) { vm._watcher.update(); } }; Vue.prototype.$destroy = function () { var vm = this; if (vm._isBeingDestroyed) { return } callHook(vm, 'beforeDestroy'); vm._isBeingDestroyed = true; // remove self from parent var parent = vm.$parent; if (parent && !parent._isBeingDestroyed && !vm.$options.abstract) { remove(parent.$children, vm); } // teardown watchers if (vm._watcher) { vm._watcher.teardown(); } var i = vm._watchers.length; while (i--) { vm._watchers[i].teardown(); } // remove reference from data ob // frozen object may not have observer. if (vm._data.__ob__) { vm._data.__ob__.vmCount--; } // call the last hook... vm._isDestroyed = true; // invoke destroy hooks on current rendered tree vm.__patch__(vm._vnode, null); // fire destroyed hook callHook(vm, 'destroyed'); // turn off all instance listeners. vm.$off(); // remove __vue__ reference if (vm.$el) { vm.$el.__vue__ = null; } }; } function mountComponent ( vm, el, hydrating ) { vm.$el = el; if (!vm.$options.render) { vm.$options.render = createEmptyVNode; if (true) { /* istanbul ignore if */ if ((vm.$options.template && vm.$options.template.charAt(0) !== '#') || vm.$options.el || el) { warn( 'You are using the runtime-only build of Vue where the template ' + 'compiler is not available. Either pre-compile the templates into ' + 'render functions, or use the compiler-included build.', vm ); } else { warn( 'Failed to mount component: template or render function not defined.', vm ); } } } callHook(vm, 'beforeMount'); var updateComponent; /* istanbul ignore if */ if ("development" !== 'production' && config.performance && mark) { updateComponent = function () { var name = vm._name; var id = vm._uid; var startTag = "vue-perf-start:" + id; var endTag = "vue-perf-end:" + id; mark(startTag); var vnode = vm._render(); mark(endTag); measure((name + " render"), startTag, endTag); mark(startTag); vm._update(vnode, hydrating); mark(endTag); measure((name + " patch"), startTag, endTag); }; } else { updateComponent = function () { vm._update(vm._render(), hydrating); }; } vm._watcher = new Watcher(vm, updateComponent, noop); hydrating = false; // manually mounted instance, call mounted on self // mounted is called for render-created child components in its inserted hook if (vm.$vnode == null) { vm._isMounted = true; callHook(vm, 'mounted'); } return vm } function updateChildComponent ( vm, propsData, listeners, parentVnode, renderChildren ) { if (true) { isUpdatingChildComponent = true; } // determine whether component has slot children // we need to do this before overwriting $options._renderChildren var hasChildren = !!( renderChildren || // has new static slots vm.$options._renderChildren || // has old static slots parentVnode.data.scopedSlots || // has new scoped slots vm.$scopedSlots !== emptyObject // has old scoped slots ); vm.$options._parentVnode = parentVnode; vm.$vnode = parentVnode; // update vm's placeholder node without re-render if (vm._vnode) { // update child tree's parent vm._vnode.parent = parentVnode; } vm.$options._renderChildren = renderChildren; // update $attrs and $listensers hash // these are also reactive so they may trigger child update if the child // used them during render vm.$attrs = parentVnode.data && parentVnode.data.attrs; vm.$listeners = listeners; // update props if (propsData && vm.$options.props) { observerState.shouldConvert = false; var props = vm._props; var propKeys = vm.$options._propKeys || []; for (var i = 0; i < propKeys.length; i++) { var key = propKeys[i]; props[key] = validateProp(key, vm.$options.props, propsData, vm); } observerState.shouldConvert = true; // keep a copy of raw propsData vm.$options.propsData = propsData; } // update listeners if (listeners) { var oldListeners = vm.$options._parentListeners; vm.$options._parentListeners = listeners; updateComponentListeners(vm, listeners, oldListeners); } // resolve slots + force update if has children if (hasChildren) { vm.$slots = resolveSlots(renderChildren, parentVnode.context); vm.$forceUpdate(); } if (true) { isUpdatingChildComponent = false; } } function isInInactiveTree (vm) { while (vm && (vm = vm.$parent)) { if (vm._inactive) { return true } } return false } function activateChildComponent (vm, direct) { if (direct) { vm._directInactive = false; if (isInInactiveTree(vm)) { return } } else if (vm._directInactive) { return } if (vm._inactive || vm._inactive === null) { vm._inactive = false; for (var i = 0; i < vm.$children.length; i++) { activateChildComponent(vm.$children[i]); } callHook(vm, 'activated'); } } function deactivateChildComponent (vm, direct) { if (direct) { vm._directInactive = true; if (isInInactiveTree(vm)) { return } } if (!vm._inactive) { vm._inactive = true; for (var i = 0; i < vm.$children.length; i++) { deactivateChildComponent(vm.$children[i]); } callHook(vm, 'deactivated'); } } function callHook (vm, hook) { var handlers = vm.$options[hook]; if (handlers) { for (var i = 0, j = handlers.length; i < j; i++) { try { handlers[i].call(vm); } catch (e) { handleError(e, vm, (hook + " hook")); } } } if (vm._hasHookEvent) { vm.$emit('hook:' + hook); } } /* */ var MAX_UPDATE_COUNT = 100; var queue = []; var activatedChildren = []; var has = {}; var circular = {}; var waiting = false; var flushing = false; var index = 0; /** * Reset the scheduler's state. */ function resetSchedulerState () { index = queue.length = activatedChildren.length = 0; has = {}; if (true) { circular = {}; } waiting = flushing = false; } /** * Flush both queues and run the watchers. */ function flushSchedulerQueue () { flushing = true; var watcher, id; // Sort queue before flush. // This ensures that: // 1. Components are updated from parent to child. (because parent is always // created before the child) // 2. A component's user watchers are run before its render watcher (because // user watchers are created before the render watcher) // 3. If a component is destroyed during a parent component's watcher run, // its watchers can be skipped. queue.sort(function (a, b) { return a.id - b.id; }); // do not cache length because more watchers might be pushed // as we run existing watchers for (index = 0; index < queue.length; index++) { watcher = queue[index]; id = watcher.id; has[id] = null; watcher.run(); // in dev build, check and stop circular updates. if ("development" !== 'production' && has[id] != null) { circular[id] = (circular[id] || 0) + 1; if (circular[id] > MAX_UPDATE_COUNT) { warn( 'You may have an infinite update loop ' + ( watcher.user ? ("in watcher with expression \"" + (watcher.expression) + "\"") : "in a component render function." ), watcher.vm ); break } } } // keep copies of post queues before resetting state var activatedQueue = activatedChildren.slice(); var updatedQueue = queue.slice(); resetSchedulerState(); // call component updated and activated hooks callActivatedHooks(activatedQueue); callUpdatedHooks(updatedQueue); // devtool hook /* istanbul ignore if */ if (devtools && config.devtools) { devtools.emit('flush'); } } function callUpdatedHooks (queue) { var i = queue.length; while (i--) { var watcher = queue[i]; var vm = watcher.vm; if (vm._watcher === watcher && vm._isMounted) { callHook(vm, 'updated'); } } } /** * Queue a kept-alive component that was activated during patch. * The queue will be processed after the entire tree has been patched. */ function queueActivatedComponent (vm) { // setting _inactive to false here so that a render function can // rely on checking whether it's in an inactive tree (e.g. router-view) vm._inactive = false; activatedChildren.push(vm); } function callActivatedHooks (queue) { for (var i = 0; i < queue.length; i++) { queue[i]._inactive = true; activateChildComponent(queue[i], true /* true */); } } /** * Push a watcher into the watcher queue. * Jobs with duplicate IDs will be skipped unless it's * pushed when the queue is being flushed. */ function queueWatcher (watcher) { var id = watcher.id; if (has[id] == null) { has[id] = true; if (!flushing) { queue.push(watcher); } else { // if already flushing, splice the watcher based on its id // if already past its id, it will be run next immediately. var i = queue.length - 1; while (i > index && queue[i].id > watcher.id) { i--; } queue.splice(i + 1, 0, watcher); } // queue the flush if (!waiting) { waiting = true; nextTick(flushSchedulerQueue); } } } /* */ var uid$2 = 0; /** * A watcher parses an expression, collects dependencies, * and fires callback when the expression value changes. * This is used for both the $watch() api and directives. */ var Watcher = function Watcher ( vm, expOrFn, cb, options ) { this.vm = vm; vm._watchers.push(this); // options if (options) { this.deep = !!options.deep; this.user = !!options.user; this.lazy = !!options.lazy; this.sync = !!options.sync; } else { this.deep = this.user = this.lazy = this.sync = false; } this.cb = cb; this.id = ++uid$2; // uid for batching this.active = true; this.dirty = this.lazy; // for lazy watchers this.deps = []; this.newDeps = []; this.depIds = new _Set(); this.newDepIds = new _Set(); this.expression = true ? expOrFn.toString() : ''; // parse expression for getter if (typeof expOrFn === 'function') { this.getter = expOrFn; } else { this.getter = parsePath(expOrFn); if (!this.getter) { this.getter = function () {}; "development" !== 'production' && warn( "Failed watching path: \"" + expOrFn + "\" " + 'Watcher only accepts simple dot-delimited paths. ' + 'For full control, use a function instead.', vm ); } } this.value = this.lazy ? undefined : this.get(); }; /** * Evaluate the getter, and re-collect dependencies. */ Watcher.prototype.get = function get () { pushTarget(this); var value; var vm = this.vm; try { value = this.getter.call(vm, vm); } catch (e) { if (this.user) { handleError(e, vm, ("getter for watcher \"" + (this.expression) + "\"")); } else { throw e } } finally { // "touch" every property so they are all tracked as // dependencies for deep watching if (this.deep) { traverse(value); } popTarget(); this.cleanupDeps(); } return value }; /** * Add a dependency to this directive. */ Watcher.prototype.addDep = function addDep (dep) { var id = dep.id; if (!this.newDepIds.has(id)) { this.newDepIds.add(id); this.newDeps.push(dep); if (!this.depIds.has(id)) { dep.addSub(this); } } }; /** * Clean up for dependency collection. */ Watcher.prototype.cleanupDeps = function cleanupDeps () { var this$1 = this; var i = this.deps.length; while (i--) { var dep = this$1.deps[i]; if (!this$1.newDepIds.has(dep.id)) { dep.removeSub(this$1); } } var tmp = this.depIds; this.depIds = this.newDepIds; this.newDepIds = tmp; this.newDepIds.clear(); tmp = this.deps; this.deps = this.newDeps; this.newDeps = tmp; this.newDeps.length = 0; }; /** * Subscriber interface. * Will be called when a dependency changes. */ Watcher.prototype.update = function update () { /* istanbul ignore else */ if (this.lazy) { this.dirty = true; } else if (this.sync) { this.run(); } else { queueWatcher(this); } }; /** * Scheduler job interface. * Will be called by the scheduler. */ Watcher.prototype.run = function run () { if (this.active) { var value = this.get(); if ( value !== this.value || // Deep watchers and watchers on Object/Arrays should fire even // when the value is the same, because the value may // have mutated. isObject(value) || this.deep ) { // set new value var oldValue = this.value; this.value = value; if (this.user) { try { this.cb.call(this.vm, value, oldValue); } catch (e) { handleError(e, this.vm, ("callback for watcher \"" + (this.expression) + "\"")); } } else { this.cb.call(this.vm, value, oldValue); } } } }; /** * Evaluate the value of the watcher. * This only gets called for lazy watchers. */ Watcher.prototype.evaluate = function evaluate () { this.value = this.get(); this.dirty = false; }; /** * Depend on all deps collected by this watcher. */ Watcher.prototype.depend = function depend () { var this$1 = this; var i = this.deps.length; while (i--) { this$1.deps[i].depend(); } }; /** * Remove self from all dependencies' subscriber list. */ Watcher.prototype.teardown = function teardown () { var this$1 = this; if (this.active) { // remove self from vm's watcher list // this is a somewhat expensive operation so we skip it // if the vm is being destroyed. if (!this.vm._isBeingDestroyed) { remove(this.vm._watchers, this); } var i = this.deps.length; while (i--) { this$1.deps[i].removeSub(this$1); } this.active = false; } }; /** * Recursively traverse an object to evoke all converted * getters, so that every nested property inside the object * is collected as a "deep" dependency. */ var seenObjects = new _Set(); function traverse (val) { seenObjects.clear(); _traverse(val, seenObjects); } function _traverse (val, seen) { var i, keys; var isA = Array.isArray(val); if ((!isA && !isObject(val)) || !Object.isExtensible(val)) { return } if (val.__ob__) { var depId = val.__ob__.dep.id; if (seen.has(depId)) { return } seen.add(depId); } if (isA) { i = val.length; while (i--) { _traverse(val[i], seen); } } else { keys = Object.keys(val); i = keys.length; while (i--) { _traverse(val[keys[i]], seen); } } } /* */ var sharedPropertyDefinition = { enumerable: true, configurable: true, get: noop, set: noop }; function proxy (target, sourceKey, key) { sharedPropertyDefinition.get = function proxyGetter () { return this[sourceKey][key] }; sharedPropertyDefinition.set = function proxySetter (val) { this[sourceKey][key] = val; }; Object.defineProperty(target, key, sharedPropertyDefinition); } function initState (vm) { vm._watchers = []; var opts = vm.$options; if (opts.props) { initProps(vm, opts.props); } if (opts.methods) { initMethods(vm, opts.methods); } if (opts.data) { initData(vm); } else { observe(vm._data = {}, true /* asRootData */); } if (opts.computed) { initComputed(vm, opts.computed); } if (opts.watch && opts.watch !== nativeWatch) { initWatch(vm, opts.watch); } } function checkOptionType (vm, name) { var option = vm.$options[name]; if (!isPlainObject(option)) { warn( ("component option \"" + name + "\" should be an object."), vm ); } } function initProps (vm, propsOptions) { var propsData = vm.$options.propsData || {}; var props = vm._props = {}; // cache prop keys so that future props updates can iterate using Array // instead of dynamic object key enumeration. var keys = vm.$options._propKeys = []; var isRoot = !vm.$parent; // root instance props should be converted observerState.shouldConvert = isRoot; var loop = function ( key ) { keys.push(key); var value = validateProp(key, propsOptions, propsData, vm); /* istanbul ignore else */ if (true) { if (isReservedAttribute(key) || config.isReservedAttr(key)) { warn( ("\"" + key + "\" is a reserved attribute and cannot be used as component prop."), vm ); } defineReactive$$1(props, key, value, function () { if (vm.$parent && !isUpdatingChildComponent) { warn( "Avoid mutating a prop directly since the value will be " + "overwritten whenever the parent component re-renders. " + "Instead, use a data or computed property based on the prop's " + "value. Prop being mutated: \"" + key + "\"", vm ); } }); } else { defineReactive$$1(props, key, value); } // static props are already proxied on the component's prototype // during Vue.extend(). We only need to proxy props defined at // instantiation here. if (!(key in vm)) { proxy(vm, "_props", key); } }; for (var key in propsOptions) loop( key ); observerState.shouldConvert = true; } function initData (vm) { var data = vm.$options.data; data = vm._data = typeof data === 'function' ? getData(data, vm) : data || {}; if (!isPlainObject(data)) { data = {}; "development" !== 'production' && warn( 'data functions should return an object:\n' + 'https://vuejs.org/v2/guide/components.html#data-Must-Be-a-Function', vm ); } // proxy data on instance var keys = Object.keys(data); var props = vm.$options.props; var methods = vm.$options.methods; var i = keys.length; while (i--) { var key = keys[i]; if (true) { if (methods && hasOwn(methods, key)) { warn( ("method \"" + key + "\" has already been defined as a data property."), vm ); } } if (props && hasOwn(props, key)) { "development" !== 'production' && warn( "The data property \"" + key + "\" is already declared as a prop. " + "Use prop default value instead.", vm ); } else if (!isReserved(key)) { proxy(vm, "_data", key); } } // observe data observe(data, true /* asRootData */); } function getData (data, vm) { try { return data.call(vm) } catch (e) { handleError(e, vm, "data()"); return {} } } var computedWatcherOptions = { lazy: true }; function initComputed (vm, computed) { "development" !== 'production' && checkOptionType(vm, 'computed'); var watchers = vm._computedWatchers = Object.create(null); for (var key in computed) { var userDef = computed[key]; var getter = typeof userDef === 'function' ? userDef : userDef.get; if ("development" !== 'production' && getter == null) { warn( ("Getter is missing for computed property \"" + key + "\"."), vm ); } // create internal watcher for the computed property. watchers[key] = new Watcher(vm, getter || noop, noop, computedWatcherOptions); // component-defined computed properties are already defined on the // component prototype. We only need to define computed properties defined // at instantiation here. if (!(key in vm)) { defineComputed(vm, key, userDef); } else if (true) { if (key in vm.$data) { warn(("The computed property \"" + key + "\" is already defined in data."), vm); } else if (vm.$options.props && key in vm.$options.props) { warn(("The computed property \"" + key + "\" is already defined as a prop."), vm); } } } } function defineComputed (target, key, userDef) { if (typeof userDef === 'function') { sharedPropertyDefinition.get = createComputedGetter(key); sharedPropertyDefinition.set = noop; } else { sharedPropertyDefinition.get = userDef.get ? userDef.cache !== false ? createComputedGetter(key) : userDef.get : noop; sharedPropertyDefinition.set = userDef.set ? userDef.set : noop; } if ("development" !== 'production' && sharedPropertyDefinition.set === noop) { sharedPropertyDefinition.set = function () { warn( ("Computed property \"" + key + "\" was assigned to but it has no setter."), this ); }; } Object.defineProperty(target, key, sharedPropertyDefinition); } function createComputedGetter (key) { return function computedGetter () { var watcher = this._computedWatchers && this._computedWatchers[key]; if (watcher) { if (watcher.dirty) { watcher.evaluate(); } if (Dep.target) { watcher.depend(); } return watcher.value } } } function initMethods (vm, methods) { "development" !== 'production' && checkOptionType(vm, 'methods'); var props = vm.$options.props; for (var key in methods) { vm[key] = methods[key] == null ? noop : bind(methods[key], vm); if (true) { if (methods[key] == null) { warn( "method \"" + key + "\" has an undefined value in the component definition. " + "Did you reference the function correctly?", vm ); } if (props && hasOwn(props, key)) { warn( ("method \"" + key + "\" has already been defined as a prop."), vm ); } } } } function initWatch (vm, watch) { "development" !== 'production' && checkOptionType(vm, 'watch'); for (var key in watch) { var handler = watch[key]; if (Array.isArray(handler)) { for (var i = 0; i < handler.length; i++) { createWatcher(vm, key, handler[i]); } } else { createWatcher(vm, key, handler); } } } function createWatcher ( vm, keyOrFn, handler, options ) { if (isPlainObject(handler)) { options = handler; handler = handler.handler; } if (typeof handler === 'string') { handler = vm[handler]; } return vm.$watch(keyOrFn, handler, options) } function stateMixin (Vue) { // flow somehow has problems with directly declared definition object // when using Object.defineProperty, so we have to procedurally build up // the object here. var dataDef = {}; dataDef.get = function () { return this._data }; var propsDef = {}; propsDef.get = function () { return this._props }; if (true) { dataDef.set = function (newData) { warn( 'Avoid replacing instance root $data. ' + 'Use nested data properties instead.', this ); }; propsDef.set = function () { warn("$props is readonly.", this); }; } Object.defineProperty(Vue.prototype, '$data', dataDef); Object.defineProperty(Vue.prototype, '$props', propsDef); Vue.prototype.$set = set; Vue.prototype.$delete = del; Vue.prototype.$watch = function ( expOrFn, cb, options ) { var vm = this; if (isPlainObject(cb)) { return createWatcher(vm, expOrFn, cb, options) } options = options || {}; options.user = true; var watcher = new Watcher(vm, expOrFn, cb, options); if (options.immediate) { cb.call(vm, watcher.value); } return function unwatchFn () { watcher.teardown(); } }; } /* */ function initProvide (vm) { var provide = vm.$options.provide; if (provide) { vm._provided = typeof provide === 'function' ? provide.call(vm) : provide; } } function initInjections (vm) { var result = resolveInject(vm.$options.inject, vm); if (result) { observerState.shouldConvert = false; Object.keys(result).forEach(function (key) { /* istanbul ignore else */ if (true) { defineReactive$$1(vm, key, result[key], function () { warn( "Avoid mutating an injected value directly since the changes will be " + "overwritten whenever the provided component re-renders. " + "injection being mutated: \"" + key + "\"", vm ); }); } else { defineReactive$$1(vm, key, result[key]); } }); observerState.shouldConvert = true; } } function resolveInject (inject, vm) { if (inject) { // inject is :any because flow is not smart enough to figure out cached var result = Object.create(null); var keys = hasSymbol ? Reflect.ownKeys(inject) : Object.keys(inject); for (var i = 0; i < keys.length; i++) { var key = keys[i]; var provideKey = inject[key]; var source = vm; while (source) { if (source._provided && provideKey in source._provided) { result[key] = source._provided[provideKey]; break } source = source.$parent; } if ("development" !== 'production' && !source) { warn(("Injection \"" + key + "\" not found"), vm); } } return result } } /* */ function createFunctionalComponent ( Ctor, propsData, data, context, children ) { var props = {}; var propOptions = Ctor.options.props; if (isDef(propOptions)) { for (var key in propOptions) { props[key] = validateProp(key, propOptions, propsData || {}); } } else { if (isDef(data.attrs)) { mergeProps(props, data.attrs); } if (isDef(data.props)) { mergeProps(props, data.props); } } // ensure the createElement function in functional components // gets a unique context - this is necessary for correct named slot check var _context = Object.create(context); var h = function (a, b, c, d) { return createElement(_context, a, b, c, d, true); }; var vnode = Ctor.options.render.call(null, h, { data: data, props: props, children: children, parent: context, listeners: data.on || {}, injections: resolveInject(Ctor.options.inject, context), slots: function () { return resolveSlots(children, context); } }); if (vnode instanceof VNode) { vnode.functionalContext = context; vnode.functionalOptions = Ctor.options; if (data.slot) { (vnode.data || (vnode.data = {})).slot = data.slot; } } return vnode } function mergeProps (to, from) { for (var key in from) { to[camelize(key)] = from[key]; } } /* */ // hooks to be invoked on component VNodes during patch var componentVNodeHooks = { init: function init ( vnode, hydrating, parentElm, refElm ) { if (!vnode.componentInstance || vnode.componentInstance._isDestroyed) { var child = vnode.componentInstance = createComponentInstanceForVnode( vnode, activeInstance, parentElm, refElm ); child.$mount(hydrating ? vnode.elm : undefined, hydrating); } else if (vnode.data.keepAlive) { // kept-alive components, treat as a patch var mountedNode = vnode; // work around flow componentVNodeHooks.prepatch(mountedNode, mountedNode); } }, prepatch: function prepatch (oldVnode, vnode) { var options = vnode.componentOptions; var child = vnode.componentInstance = oldVnode.componentInstance; updateChildComponent( child, options.propsData, // updated props options.listeners, // updated listeners vnode, // new parent vnode options.children // new children ); }, insert: function insert (vnode) { var context = vnode.context; var componentInstance = vnode.componentInstance; if (!componentInstance._isMounted) { componentInstance._isMounted = true; callHook(componentInstance, 'mounted'); } if (vnode.data.keepAlive) { if (context._isMounted) { // vue-router#1212 // During updates, a kept-alive component's child components may // change, so directly walking the tree here may call activated hooks // on incorrect children. Instead we push them into a queue which will // be processed after the whole patch process ended. queueActivatedComponent(componentInstance); } else { activateChildComponent(componentInstance, true /* direct */); } } }, destroy: function destroy (vnode) { var componentInstance = vnode.componentInstance; if (!componentInstance._isDestroyed) { if (!vnode.data.keepAlive) { componentInstance.$destroy(); } else { deactivateChildComponent(componentInstance, true /* direct */); } } } }; var hooksToMerge = Object.keys(componentVNodeHooks); function createComponent ( Ctor, data, context, children, tag ) { if (isUndef(Ctor)) { return } var baseCtor = context.$options._base; // plain options object: turn it into a constructor if (isObject(Ctor)) { Ctor = baseCtor.extend(Ctor); } // if at this stage it's not a constructor or an async component factory, // reject. if (typeof Ctor !== 'function') { if (true) { warn(("Invalid Component definition: " + (String(Ctor))), context); } return } // async component var asyncFactory; if (isUndef(Ctor.cid)) { asyncFactory = Ctor; Ctor = resolveAsyncComponent(asyncFactory, baseCtor, context); if (Ctor === undefined) { // return a placeholder node for async component, which is rendered // as a comment node but preserves all the raw information for the node. // the information will be used for async server-rendering and hydration. return createAsyncPlaceholder( asyncFactory, data, context, children, tag ) } } data = data || {}; // resolve constructor options in case global mixins are applied after // component constructor creation resolveConstructorOptions(Ctor); // transform component v-model data into props & events if (isDef(data.model)) { transformModel(Ctor.options, data); } // extract props var propsData = extractPropsFromVNodeData(data, Ctor, tag); // functional component if (isTrue(Ctor.options.functional)) { return createFunctionalComponent(Ctor, propsData, data, context, children) } // extract listeners, since these needs to be treated as // child component listeners instead of DOM listeners var listeners = data.on; // replace with listeners with .native modifier // so it gets processed during parent component patch. data.on = data.nativeOn; if (isTrue(Ctor.options.abstract)) { // abstract components do not keep anything // other than props & listeners & slot // work around flow var slot = data.slot; data = {}; if (slot) { data.slot = slot; } } // merge component management hooks onto the placeholder node mergeHooks(data); // return a placeholder vnode var name = Ctor.options.name || tag; var vnode = new VNode( ("vue-component-" + (Ctor.cid) + (name ? ("-" + name) : '')), data, undefined, undefined, undefined, context, { Ctor: Ctor, propsData: propsData, listeners: listeners, tag: tag, children: children }, asyncFactory ); return vnode } function createComponentInstanceForVnode ( vnode, // we know it's MountedComponentVNode but flow doesn't parent, // activeInstance in lifecycle state parentElm, refElm ) { var vnodeComponentOptions = vnode.componentOptions; var options = { _isComponent: true, parent: parent, propsData: vnodeComponentOptions.propsData, _componentTag: vnodeComponentOptions.tag, _parentVnode: vnode, _parentListeners: vnodeComponentOptions.listeners, _renderChildren: vnodeComponentOptions.children, _parentElm: parentElm || null, _refElm: refElm || null }; // check inline-template render functions var inlineTemplate = vnode.data.inlineTemplate; if (isDef(inlineTemplate)) { options.render = inlineTemplate.render; options.staticRenderFns = inlineTemplate.staticRenderFns; } return new vnodeComponentOptions.Ctor(options) } function mergeHooks (data) { if (!data.hook) { data.hook = {}; } for (var i = 0; i < hooksToMerge.length; i++) { var key = hooksToMerge[i]; var fromParent = data.hook[key]; var ours = componentVNodeHooks[key]; data.hook[key] = fromParent ? mergeHook$1(ours, fromParent) : ours; } } function mergeHook$1 (one, two) { return function (a, b, c, d) { one(a, b, c, d); two(a, b, c, d); } } // transform component v-model info (value and callback) into // prop and event handler respectively. function transformModel (options, data) { var prop = (options.model && options.model.prop) || 'value'; var event = (options.model && options.model.event) || 'input';(data.props || (data.props = {}))[prop] = data.model.value; var on = data.on || (data.on = {}); if (isDef(on[event])) { on[event] = [data.model.callback].concat(on[event]); } else { on[event] = data.model.callback; } } /* */ var SIMPLE_NORMALIZE = 1; var ALWAYS_NORMALIZE = 2; // wrapper function for providing a more flexible interface // without getting yelled at by flow function createElement ( context, tag, data, children, normalizationType, alwaysNormalize ) { if (Array.isArray(data) || isPrimitive(data)) { normalizationType = children; children = data; data = undefined; } if (isTrue(alwaysNormalize)) { normalizationType = ALWAYS_NORMALIZE; } return _createElement(context, tag, data, children, normalizationType) } function _createElement ( context, tag, data, children, normalizationType ) { if (isDef(data) && isDef((data).__ob__)) { "development" !== 'production' && warn( "Avoid using observed data object as vnode data: " + (JSON.stringify(data)) + "\n" + 'Always create fresh vnode data objects in each render!', context ); return createEmptyVNode() } // object syntax in v-bind if (isDef(data) && isDef(data.is)) { tag = data.is; } if (!tag) { // in case of component :is set to falsy value return createEmptyVNode() } // warn against non-primitive key if ("development" !== 'production' && isDef(data) && isDef(data.key) && !isPrimitive(data.key) ) { warn( 'Avoid using non-primitive value as key, ' + 'use string/number value instead.', context ); } // support single function children as default scoped slot if (Array.isArray(children) && typeof children[0] === 'function' ) { data = data || {}; data.scopedSlots = { default: children[0] }; children.length = 0; } if (normalizationType === ALWAYS_NORMALIZE) { children = normalizeChildren(children); } else if (normalizationType === SIMPLE_NORMALIZE) { children = simpleNormalizeChildren(children); } var vnode, ns; if (typeof tag === 'string') { var Ctor; ns = config.getTagNamespace(tag); if (config.isReservedTag(tag)) { // platform built-in elements vnode = new VNode( config.parsePlatformTagName(tag), data, children, undefined, undefined, context ); } else if (isDef(Ctor = resolveAsset(context.$options, 'components', tag))) { // component vnode = createComponent(Ctor, data, context, children, tag); } else { // unknown or unlisted namespaced elements // check at runtime because it may get assigned a namespace when its // parent normalizes children vnode = new VNode( tag, data, children, undefined, undefined, context ); } } else { // direct component options / constructor vnode = createComponent(tag, data, context, children); } if (isDef(vnode)) { if (ns) { applyNS(vnode, ns); } return vnode } else { return createEmptyVNode() } } function applyNS (vnode, ns) { vnode.ns = ns; if (vnode.tag === 'foreignObject') { // use default namespace inside foreignObject return } if (isDef(vnode.children)) { for (var i = 0, l = vnode.children.length; i < l; i++) { var child = vnode.children[i]; if (isDef(child.tag) && isUndef(child.ns)) { applyNS(child, ns); } } } } /* */ /** * Runtime helper for rendering v-for lists. */ function renderList ( val, render ) { var ret, i, l, keys, key; if (Array.isArray(val) || typeof val === 'string') { ret = new Array(val.length); for (i = 0, l = val.length; i < l; i++) { ret[i] = render(val[i], i); } } else if (typeof val === 'number') { ret = new Array(val); for (i = 0; i < val; i++) { ret[i] = render(i + 1, i); } } else if (isObject(val)) { keys = Object.keys(val); ret = new Array(keys.length); for (i = 0, l = keys.length; i < l; i++) { key = keys[i]; ret[i] = render(val[key], key, i); } } if (isDef(ret)) { (ret)._isVList = true; } return ret } /* */ /** * Runtime helper for rendering <slot> */ function renderSlot ( name, fallback, props, bindObject ) { var scopedSlotFn = this.$scopedSlots[name]; if (scopedSlotFn) { // scoped slot props = props || {}; if (bindObject) { props = extend(extend({}, bindObject), props); } return scopedSlotFn(props) || fallback } else { var slotNodes = this.$slots[name]; // warn duplicate slot usage if (slotNodes && "development" !== 'production') { slotNodes._rendered && warn( "Duplicate presence of slot \"" + name + "\" found in the same render tree " + "- this will likely cause render errors.", this ); slotNodes._rendered = true; } return slotNodes || fallback } } /* */ /** * Runtime helper for resolving filters */ function resolveFilter (id) { return resolveAsset(this.$options, 'filters', id, true) || identity } /* */ /** * Runtime helper for checking keyCodes from config. */ function checkKeyCodes ( eventKeyCode, key, builtInAlias ) { var keyCodes = config.keyCodes[key] || builtInAlias; if (Array.isArray(keyCodes)) { return keyCodes.indexOf(eventKeyCode) === -1 } else { return keyCodes !== eventKeyCode } } /* */ /** * Runtime helper for merging v-bind="object" into a VNode's data. */ function bindObjectProps ( data, tag, value, asProp, isSync ) { if (value) { if (!isObject(value)) { "development" !== 'production' && warn( 'v-bind without argument expects an Object or Array value', this ); } else { if (Array.isArray(value)) { value = toObject(value); } var hash; var loop = function ( key ) { if ( key === 'class' || key === 'style' || isReservedAttribute(key) ) { hash = data; } else { var type = data.attrs && data.attrs.type; hash = asProp || config.mustUseProp(tag, type, key) ? data.domProps || (data.domProps = {}) : data.attrs || (data.attrs = {}); } if (!(key in hash)) { hash[key] = value[key]; if (isSync) { var on = data.on || (data.on = {}); on[("update:" + key)] = function ($event) { value[key] = $event; }; } } }; for (var key in value) loop( key ); } } return data } /* */ /** * Runtime helper for rendering static trees. */ function renderStatic ( index, isInFor ) { var tree = this._staticTrees[index]; // if has already-rendered static tree and not inside v-for, // we can reuse the same tree by doing a shallow clone. if (tree && !isInFor) { return Array.isArray(tree) ? cloneVNodes(tree) : cloneVNode(tree) } // otherwise, render a fresh tree. tree = this._staticTrees[index] = this.$options.staticRenderFns[index].call(this._renderProxy); markStatic(tree, ("__static__" + index), false); return tree } /** * Runtime helper for v-once. * Effectively it means marking the node as static with a unique key. */ function markOnce ( tree, index, key ) { markStatic(tree, ("__once__" + index + (key ? ("_" + key) : "")), true); return tree } function markStatic ( tree, key, isOnce ) { if (Array.isArray(tree)) { for (var i = 0; i < tree.length; i++) { if (tree[i] && typeof tree[i] !== 'string') { markStaticNode(tree[i], (key + "_" + i), isOnce); } } } else { markStaticNode(tree, key, isOnce); } } function markStaticNode (node, key, isOnce) { node.isStatic = true; node.key = key; node.isOnce = isOnce; } /* */ function bindObjectListeners (data, value) { if (value) { if (!isPlainObject(value)) { "development" !== 'production' && warn( 'v-on without argument expects an Object value', this ); } else { var on = data.on = data.on ? extend({}, data.on) : {}; for (var key in value) { var existing = on[key]; var ours = value[key]; on[key] = existing ? [].concat(ours, existing) : ours; } } } return data } /* */ function initRender (vm) { vm._vnode = null; // the root of the child tree vm._staticTrees = null; var parentVnode = vm.$vnode = vm.$options._parentVnode; // the placeholder node in parent tree var renderContext = parentVnode && parentVnode.context; vm.$slots = resolveSlots(vm.$options._renderChildren, renderContext); vm.$scopedSlots = emptyObject; // bind the createElement fn to this instance // so that we get proper render context inside it. // args order: tag, data, children, normalizationType, alwaysNormalize // internal version is used by render functions compiled from templates vm._c = function (a, b, c, d) { return createElement(vm, a, b, c, d, false); }; // normalization is always applied for the public version, used in // user-written render functions. vm.$createElement = function (a, b, c, d) { return createElement(vm, a, b, c, d, true); }; // $attrs & $listeners are exposed for easier HOC creation. // they need to be reactive so that HOCs using them are always updated var parentData = parentVnode && parentVnode.data; /* istanbul ignore else */ if (true) { defineReactive$$1(vm, '$attrs', parentData && parentData.attrs, function () { !isUpdatingChildComponent && warn("$attrs is readonly.", vm); }, true); defineReactive$$1(vm, '$listeners', vm.$options._parentListeners, function () { !isUpdatingChildComponent && warn("$listeners is readonly.", vm); }, true); } else { defineReactive$$1(vm, '$attrs', parentData && parentData.attrs, null, true); defineReactive$$1(vm, '$listeners', vm.$options._parentListeners, null, true); } } function renderMixin (Vue) { Vue.prototype.$nextTick = function (fn) { return nextTick(fn, this) }; Vue.prototype._render = function () { var vm = this; var ref = vm.$options; var render = ref.render; var staticRenderFns = ref.staticRenderFns; var _parentVnode = ref._parentVnode; if (vm._isMounted) { // clone slot nodes on re-renders for (var key in vm.$slots) { vm.$slots[key] = cloneVNodes(vm.$slots[key]); } } vm.$scopedSlots = (_parentVnode && _parentVnode.data.scopedSlots) || emptyObject; if (staticRenderFns && !vm._staticTrees) { vm._staticTrees = []; } // set parent vnode. this allows render functions to have access // to the data on the placeholder node. vm.$vnode = _parentVnode; // render self var vnode; try { vnode = render.call(vm._renderProxy, vm.$createElement); } catch (e) { handleError(e, vm, "render function"); // return error render result, // or previous vnode to prevent render error causing blank component /* istanbul ignore else */ if (true) { vnode = vm.$options.renderError ? vm.$options.renderError.call(vm._renderProxy, vm.$createElement, e) : vm._vnode; } else { vnode = vm._vnode; } } // return empty vnode in case the render function errored out if (!(vnode instanceof VNode)) { if ("development" !== 'production' && Array.isArray(vnode)) { warn( 'Multiple root nodes returned from render function. Render function ' + 'should return a single root node.', vm ); } vnode = createEmptyVNode(); } // set parent vnode.parent = _parentVnode; return vnode }; // internal render helpers. // these are exposed on the instance prototype to reduce generated render // code size. Vue.prototype._o = markOnce; Vue.prototype._n = toNumber; Vue.prototype._s = toString; Vue.prototype._l = renderList; Vue.prototype._t = renderSlot; Vue.prototype._q = looseEqual; Vue.prototype._i = looseIndexOf; Vue.prototype._m = renderStatic; Vue.prototype._f = resolveFilter; Vue.prototype._k = checkKeyCodes; Vue.prototype._b = bindObjectProps; Vue.prototype._v = createTextVNode; Vue.prototype._e = createEmptyVNode; Vue.prototype._u = resolveScopedSlots; Vue.prototype._g = bindObjectListeners; } /* */ var uid$1 = 0; function initMixin (Vue) { Vue.prototype._init = function (options) { var vm = this; // a uid vm._uid = uid$1++; var startTag, endTag; /* istanbul ignore if */ if ("development" !== 'production' && config.performance && mark) { startTag = "vue-perf-init:" + (vm._uid); endTag = "vue-perf-end:" + (vm._uid); mark(startTag); } // a flag to avoid this being observed vm._isVue = true; // merge options if (options && options._isComponent) { // optimize internal component instantiation // since dynamic options merging is pretty slow, and none of the // internal component options needs special treatment. initInternalComponent(vm, options); } else { vm.$options = mergeOptions( resolveConstructorOptions(vm.constructor), options || {}, vm ); } /* istanbul ignore else */ if (true) { initProxy(vm); } else { vm._renderProxy = vm; } // expose real self vm._self = vm; initLifecycle(vm); initEvents(vm); initRender(vm); callHook(vm, 'beforeCreate'); initInjections(vm); // resolve injections before data/props initState(vm); initProvide(vm); // resolve provide after data/props callHook(vm, 'created'); /* istanbul ignore if */ if ("development" !== 'production' && config.performance && mark) { vm._name = formatComponentName(vm, false); mark(endTag); measure(((vm._name) + " init"), startTag, endTag); } if (vm.$options.el) { vm.$mount(vm.$options.el); } }; } function initInternalComponent (vm, options) { var opts = vm.$options = Object.create(vm.constructor.options); // doing this because it's faster than dynamic enumeration. opts.parent = options.parent; opts.propsData = options.propsData; opts._parentVnode = options._parentVnode; opts._parentListeners = options._parentListeners; opts._renderChildren = options._renderChildren; opts._componentTag = options._componentTag; opts._parentElm = options._parentElm; opts._refElm = options._refElm; if (options.render) { opts.render = options.render; opts.staticRenderFns = options.staticRenderFns; } } function resolveConstructorOptions (Ctor) { var options = Ctor.options; if (Ctor.super) { var superOptions = resolveConstructorOptions(Ctor.super); var cachedSuperOptions = Ctor.superOptions; if (superOptions !== cachedSuperOptions) { // super option changed, // need to resolve new options. Ctor.superOptions = superOptions; // check if there are any late-modified/attached options (#4976) var modifiedOptions = resolveModifiedOptions(Ctor); // update base extend options if (modifiedOptions) { extend(Ctor.extendOptions, modifiedOptions); } options = Ctor.options = mergeOptions(superOptions, Ctor.extendOptions); if (options.name) { options.components[options.name] = Ctor; } } } return options } function resolveModifiedOptions (Ctor) { var modified; var latest = Ctor.options; var extended = Ctor.extendOptions; var sealed = Ctor.sealedOptions; for (var key in latest) { if (latest[key] !== sealed[key]) { if (!modified) { modified = {}; } modified[key] = dedupe(latest[key], extended[key], sealed[key]); } } return modified } function dedupe (latest, extended, sealed) { // compare latest and sealed to ensure lifecycle hooks won't be duplicated // between merges if (Array.isArray(latest)) { var res = []; sealed = Array.isArray(sealed) ? sealed : [sealed]; extended = Array.isArray(extended) ? extended : [extended]; for (var i = 0; i < latest.length; i++) { // push original options and not sealed options to exclude duplicated options if (extended.indexOf(latest[i]) >= 0 || sealed.indexOf(latest[i]) < 0) { res.push(latest[i]); } } return res } else { return latest } } function Vue$3 (options) { if ("development" !== 'production' && !(this instanceof Vue$3) ) { warn('Vue is a constructor and should be called with the `new` keyword'); } this._init(options); } initMixin(Vue$3); stateMixin(Vue$3); eventsMixin(Vue$3); lifecycleMixin(Vue$3); renderMixin(Vue$3); /* */ function initUse (Vue) { Vue.use = function (plugin) { var installedPlugins = (this._installedPlugins || (this._installedPlugins = [])); if (installedPlugins.indexOf(plugin) > -1) { return this } // additional parameters var args = toArray(arguments, 1); args.unshift(this); if (typeof plugin.install === 'function') { plugin.install.apply(plugin, args); } else if (typeof plugin === 'function') { plugin.apply(null, args); } installedPlugins.push(plugin); return this }; } /* */ function initMixin$1 (Vue) { Vue.mixin = function (mixin) { this.options = mergeOptions(this.options, mixin); return this }; } /* */ function initExtend (Vue) { /** * Each instance constructor, including Vue, has a unique * cid. This enables us to create wrapped "child * constructors" for prototypal inheritance and cache them. */ Vue.cid = 0; var cid = 1; /** * Class inheritance */ Vue.extend = function (extendOptions) { extendOptions = extendOptions || {}; var Super = this; var SuperId = Super.cid; var cachedCtors = extendOptions._Ctor || (extendOptions._Ctor = {}); if (cachedCtors[SuperId]) { return cachedCtors[SuperId] } var name = extendOptions.name || Super.options.name; if (true) { if (!/^[a-zA-Z][\w-]*$/.test(name)) { warn( 'Invalid component name: "' + name + '". Component names ' + 'can only contain alphanumeric characters and the hyphen, ' + 'and must start with a letter.' ); } } var Sub = function VueComponent (options) { this._init(options); }; Sub.prototype = Object.create(Super.prototype); Sub.prototype.constructor = Sub; Sub.cid = cid++; Sub.options = mergeOptions( Super.options, extendOptions ); Sub['super'] = Super; // For props and computed properties, we define the proxy getters on // the Vue instances at extension time, on the extended prototype. This // avoids Object.defineProperty calls for each instance created. if (Sub.options.props) { initProps$1(Sub); } if (Sub.options.computed) { initComputed$1(Sub); } // allow further extension/mixin/plugin usage Sub.extend = Super.extend; Sub.mixin = Super.mixin; Sub.use = Super.use; // create asset registers, so extended classes // can have their private assets too. ASSET_TYPES.forEach(function (type) { Sub[type] = Super[type]; }); // enable recursive self-lookup if (name) { Sub.options.components[name] = Sub; } // keep a reference to the super options at extension time. // later at instantiation we can check if Super's options have // been updated. Sub.superOptions = Super.options; Sub.extendOptions = extendOptions; Sub.sealedOptions = extend({}, Sub.options); // cache constructor cachedCtors[SuperId] = Sub; return Sub }; } function initProps$1 (Comp) { var props = Comp.options.props; for (var key in props) { proxy(Comp.prototype, "_props", key); } } function initComputed$1 (Comp) { var computed = Comp.options.computed; for (var key in computed) { defineComputed(Comp.prototype, key, computed[key]); } } /* */ function initAssetRegisters (Vue) { /** * Create asset registration methods. */ ASSET_TYPES.forEach(function (type) { Vue[type] = function ( id, definition ) { if (!definition) { return this.options[type + 's'][id] } else { /* istanbul ignore if */ if (true) { if (type === 'component' && config.isReservedTag(id)) { warn( 'Do not use built-in or reserved HTML elements as component ' + 'id: ' + id ); } } if (type === 'component' && isPlainObject(definition)) { definition.name = definition.name || id; definition = this.options._base.extend(definition); } if (type === 'directive' && typeof definition === 'function') { definition = { bind: definition, update: definition }; } this.options[type + 's'][id] = definition; return definition } }; }); } /* */ var patternTypes = [String, RegExp, Array]; function getComponentName (opts) { return opts && (opts.Ctor.options.name || opts.tag) } function matches (pattern, name) { if (Array.isArray(pattern)) { return pattern.indexOf(name) > -1 } else if (typeof pattern === 'string') { return pattern.split(',').indexOf(name) > -1 } else if (isRegExp(pattern)) { return pattern.test(name) } /* istanbul ignore next */ return false } function pruneCache (cache, current, filter) { for (var key in cache) { var cachedNode = cache[key]; if (cachedNode) { var name = getComponentName(cachedNode.componentOptions); if (name && !filter(name)) { if (cachedNode !== current) { pruneCacheEntry(cachedNode); } cache[key] = null; } } } } function pruneCacheEntry (vnode) { if (vnode) { vnode.componentInstance.$destroy(); } } var KeepAlive = { name: 'keep-alive', abstract: true, props: { include: patternTypes, exclude: patternTypes }, created: function created () { this.cache = Object.create(null); }, destroyed: function destroyed () { var this$1 = this; for (var key in this$1.cache) { pruneCacheEntry(this$1.cache[key]); } }, watch: { include: function include (val) { pruneCache(this.cache, this._vnode, function (name) { return matches(val, name); }); }, exclude: function exclude (val) { pruneCache(this.cache, this._vnode, function (name) { return !matches(val, name); }); } }, render: function render () { var vnode = getFirstComponentChild(this.$slots.default); var componentOptions = vnode && vnode.componentOptions; if (componentOptions) { // check pattern var name = getComponentName(componentOptions); if (name && ( (this.include && !matches(this.include, name)) || (this.exclude && matches(this.exclude, name)) )) { return vnode } var key = vnode.key == null // same constructor may get registered as different local components // so cid alone is not enough (#3269) ? componentOptions.Ctor.cid + (componentOptions.tag ? ("::" + (componentOptions.tag)) : '') : vnode.key; if (this.cache[key]) { vnode.componentInstance = this.cache[key].componentInstance; } else { this.cache[key] = vnode; } vnode.data.keepAlive = true; } return vnode } }; var builtInComponents = { KeepAlive: KeepAlive }; /* */ function initGlobalAPI (Vue) { // config var configDef = {}; configDef.get = function () { return config; }; if (true) { configDef.set = function () { warn( 'Do not replace the Vue.config object, set individual fields instead.' ); }; } Object.defineProperty(Vue, 'config', configDef); // exposed util methods. // NOTE: these are not considered part of the public API - avoid relying on // them unless you are aware of the risk. Vue.util = { warn: warn, extend: extend, mergeOptions: mergeOptions, defineReactive: defineReactive$$1 }; Vue.set = set; Vue.delete = del; Vue.nextTick = nextTick; Vue.options = Object.create(null); ASSET_TYPES.forEach(function (type) { Vue.options[type + 's'] = Object.create(null); }); // this is used to identify the "base" constructor to extend all plain-object // components with in Weex's multi-instance scenarios. Vue.options._base = Vue; extend(Vue.options.components, builtInComponents); initUse(Vue); initMixin$1(Vue); initExtend(Vue); initAssetRegisters(Vue); } initGlobalAPI(Vue$3); Object.defineProperty(Vue$3.prototype, '$isServer', { get: isServerRendering }); Object.defineProperty(Vue$3.prototype, '$ssrContext', { get: function get () { /* istanbul ignore next */ return this.$vnode && this.$vnode.ssrContext } }); Vue$3.version = '2.4.2'; /* */ // these are reserved for web because they are directly compiled away // during template compilation var isReservedAttr = makeMap('style,class'); // attributes that should be using props for binding var acceptValue = makeMap('input,textarea,option,select'); var mustUseProp = function (tag, type, attr) { return ( (attr === 'value' && acceptValue(tag)) && type !== 'button' || (attr === 'selected' && tag === 'option') || (attr === 'checked' && tag === 'input') || (attr === 'muted' && tag === 'video') ) }; var isEnumeratedAttr = makeMap('contenteditable,draggable,spellcheck'); var isBooleanAttr = makeMap( 'allowfullscreen,async,autofocus,autoplay,checked,compact,controls,declare,' + 'default,defaultchecked,defaultmuted,defaultselected,defer,disabled,' + 'enabled,formnovalidate,hidden,indeterminate,inert,ismap,itemscope,loop,multiple,' + 'muted,nohref,noresize,noshade,novalidate,nowrap,open,pauseonexit,readonly,' + 'required,reversed,scoped,seamless,selected,sortable,translate,' + 'truespeed,typemustmatch,visible' ); var xlinkNS = 'http://www.w3.org/1999/xlink'; var isXlink = function (name) { return name.charAt(5) === ':' && name.slice(0, 5) === 'xlink' }; var getXlinkProp = function (name) { return isXlink(name) ? name.slice(6, name.length) : '' }; var isFalsyAttrValue = function (val) { return val == null || val === false }; /* */ function genClassForVnode (vnode) { var data = vnode.data; var parentNode = vnode; var childNode = vnode; while (isDef(childNode.componentInstance)) { childNode = childNode.componentInstance._vnode; if (childNode.data) { data = mergeClassData(childNode.data, data); } } while (isDef(parentNode = parentNode.parent)) { if (parentNode.data) { data = mergeClassData(data, parentNode.data); } } return renderClass(data.staticClass, data.class) } function mergeClassData (child, parent) { return { staticClass: concat(child.staticClass, parent.staticClass), class: isDef(child.class) ? [child.class, parent.class] : parent.class } } function renderClass ( staticClass, dynamicClass ) { if (isDef(staticClass) || isDef(dynamicClass)) { return concat(staticClass, stringifyClass(dynamicClass)) } /* istanbul ignore next */ return '' } function concat (a, b) { return a ? b ? (a + ' ' + b) : a : (b || '') } function stringifyClass (value) { if (Array.isArray(value)) { return stringifyArray(value) } if (isObject(value)) { return stringifyObject(value) } if (typeof value === 'string') { return value } /* istanbul ignore next */ return '' } function stringifyArray (value) { var res = ''; var stringified; for (var i = 0, l = value.length; i < l; i++) { if (isDef(stringified = stringifyClass(value[i])) && stringified !== '') { if (res) { res += ' '; } res += stringified; } } return res } function stringifyObject (value) { var res = ''; for (var key in value) { if (value[key]) { if (res) { res += ' '; } res += key; } } return res } /* */ var namespaceMap = { svg: 'http://www.w3.org/2000/svg', math: 'http://www.w3.org/1998/Math/MathML' }; var isHTMLTag = makeMap( 'html,body,base,head,link,meta,style,title,' + 'address,article,aside,footer,header,h1,h2,h3,h4,h5,h6,hgroup,nav,section,' + 'div,dd,dl,dt,figcaption,figure,picture,hr,img,li,main,ol,p,pre,ul,' + 'a,b,abbr,bdi,bdo,br,cite,code,data,dfn,em,i,kbd,mark,q,rp,rt,rtc,ruby,' + 's,samp,small,span,strong,sub,sup,time,u,var,wbr,area,audio,map,track,video,' + 'embed,object,param,source,canvas,script,noscript,del,ins,' + 'caption,col,colgroup,table,thead,tbody,td,th,tr,' + 'button,datalist,fieldset,form,input,label,legend,meter,optgroup,option,' + 'output,progress,select,textarea,' + 'details,dialog,menu,menuitem,summary,' + 'content,element,shadow,template,blockquote,iframe,tfoot' ); // this map is intentionally selective, only covering SVG elements that may // contain child elements. var isSVG = makeMap( 'svg,animate,circle,clippath,cursor,defs,desc,ellipse,filter,font-face,' + 'foreignObject,g,glyph,image,line,marker,mask,missing-glyph,path,pattern,' + 'polygon,polyline,rect,switch,symbol,text,textpath,tspan,use,view', true ); var isPreTag = function (tag) { return tag === 'pre'; }; var isReservedTag = function (tag) { return isHTMLTag(tag) || isSVG(tag) }; function getTagNamespace (tag) { if (isSVG(tag)) { return 'svg' } // basic support for MathML // note it doesn't support other MathML elements being component roots if (tag === 'math') { return 'math' } } var unknownElementCache = Object.create(null); function isUnknownElement (tag) { /* istanbul ignore if */ if (!inBrowser) { return true } if (isReservedTag(tag)) { return false } tag = tag.toLowerCase(); /* istanbul ignore if */ if (unknownElementCache[tag] != null) { return unknownElementCache[tag] } var el = document.createElement(tag); if (tag.indexOf('-') > -1) { // http://stackoverflow.com/a/28210364/1070244 return (unknownElementCache[tag] = ( el.constructor === window.HTMLUnknownElement || el.constructor === window.HTMLElement )) } else { return (unknownElementCache[tag] = /HTMLUnknownElement/.test(el.toString())) } } /* */ /** * Query an element selector if it's not an element already. */ function query (el) { if (typeof el === 'string') { var selected = document.querySelector(el); if (!selected) { "development" !== 'production' && warn( 'Cannot find element: ' + el ); return document.createElement('div') } return selected } else { return el } } /* */ function createElement$1 (tagName, vnode) { var elm = document.createElement(tagName); if (tagName !== 'select') { return elm } // false or null will remove the attribute but undefined will not if (vnode.data && vnode.data.attrs && vnode.data.attrs.multiple !== undefined) { elm.setAttribute('multiple', 'multiple'); } return elm } function createElementNS (namespace, tagName) { return document.createElementNS(namespaceMap[namespace], tagName) } function createTextNode (text) { return document.createTextNode(text) } function createComment (text) { return document.createComment(text) } function insertBefore (parentNode, newNode, referenceNode) { parentNode.insertBefore(newNode, referenceNode); } function removeChild (node, child) { node.removeChild(child); } function appendChild (node, child) { node.appendChild(child); } function parentNode (node) { return node.parentNode } function nextSibling (node) { return node.nextSibling } function tagName (node) { return node.tagName } function setTextContent (node, text) { node.textContent = text; } function setAttribute (node, key, val) { node.setAttribute(key, val); } var nodeOps = Object.freeze({ createElement: createElement$1, createElementNS: createElementNS, createTextNode: createTextNode, createComment: createComment, insertBefore: insertBefore, removeChild: removeChild, appendChild: appendChild, parentNode: parentNode, nextSibling: nextSibling, tagName: tagName, setTextContent: setTextContent, setAttribute: setAttribute }); /* */ var ref = { create: function create (_, vnode) { registerRef(vnode); }, update: function update (oldVnode, vnode) { if (oldVnode.data.ref !== vnode.data.ref) { registerRef(oldVnode, true); registerRef(vnode); } }, destroy: function destroy (vnode) { registerRef(vnode, true); } }; function registerRef (vnode, isRemoval) { var key = vnode.data.ref; if (!key) { return } var vm = vnode.context; var ref = vnode.componentInstance || vnode.elm; var refs = vm.$refs; if (isRemoval) { if (Array.isArray(refs[key])) { remove(refs[key], ref); } else if (refs[key] === ref) { refs[key] = undefined; } } else { if (vnode.data.refInFor) { if (!Array.isArray(refs[key])) { refs[key] = [ref]; } else if (refs[key].indexOf(ref) < 0) { // $flow-disable-line refs[key].push(ref); } } else { refs[key] = ref; } } } /** * Virtual DOM patching algorithm based on Snabbdom by * Simon Friis Vindum (@paldepind) * Licensed under the MIT License * https://github.com/paldepind/snabbdom/blob/master/LICENSE * * modified by Evan You (@yyx990803) * /* * Not type-checking this because this file is perf-critical and the cost * of making flow understand it is not worth it. */ var emptyNode = new VNode('', {}, []); var hooks = ['create', 'activate', 'update', 'remove', 'destroy']; function sameVnode (a, b) { return ( a.key === b.key && ( ( a.tag === b.tag && a.isComment === b.isComment && isDef(a.data) === isDef(b.data) && sameInputType(a, b) ) || ( isTrue(a.isAsyncPlaceholder) && a.asyncFactory === b.asyncFactory && isUndef(b.asyncFactory.error) ) ) ) } // Some browsers do not support dynamically changing type for <input> // so they need to be treated as different nodes function sameInputType (a, b) { if (a.tag !== 'input') { return true } var i; var typeA = isDef(i = a.data) && isDef(i = i.attrs) && i.type; var typeB = isDef(i = b.data) && isDef(i = i.attrs) && i.type; return typeA === typeB } function createKeyToOldIdx (children, beginIdx, endIdx) { var i, key; var map = {}; for (i = beginIdx; i <= endIdx; ++i) { key = children[i].key; if (isDef(key)) { map[key] = i; } } return map } function createPatchFunction (backend) { var i, j; var cbs = {}; var modules = backend.modules; var nodeOps = backend.nodeOps; for (i = 0; i < hooks.length; ++i) { cbs[hooks[i]] = []; for (j = 0; j < modules.length; ++j) { if (isDef(modules[j][hooks[i]])) { cbs[hooks[i]].push(modules[j][hooks[i]]); } } } function emptyNodeAt (elm) { return new VNode(nodeOps.tagName(elm).toLowerCase(), {}, [], undefined, elm) } function createRmCb (childElm, listeners) { function remove$$1 () { if (--remove$$1.listeners === 0) { removeNode(childElm); } } remove$$1.listeners = listeners; return remove$$1 } function removeNode (el) { var parent = nodeOps.parentNode(el); // element may have already been removed due to v-html / v-text if (isDef(parent)) { nodeOps.removeChild(parent, el); } } var inPre = 0; function createElm (vnode, insertedVnodeQueue, parentElm, refElm, nested) { vnode.isRootInsert = !nested; // for transition enter check if (createComponent(vnode, insertedVnodeQueue, parentElm, refElm)) { return } var data = vnode.data; var children = vnode.children; var tag = vnode.tag; if (isDef(tag)) { if (true) { if (data && data.pre) { inPre++; } if ( !inPre && !vnode.ns && !(config.ignoredElements.length && config.ignoredElements.indexOf(tag) > -1) && config.isUnknownElement(tag) ) { warn( 'Unknown custom element: <' + tag + '> - did you ' + 'register the component correctly? For recursive components, ' + 'make sure to provide the "name" option.', vnode.context ); } } vnode.elm = vnode.ns ? nodeOps.createElementNS(vnode.ns, tag) : nodeOps.createElement(tag, vnode); setScope(vnode); /* istanbul ignore if */ { createChildren(vnode, children, insertedVnodeQueue); if (isDef(data)) { invokeCreateHooks(vnode, insertedVnodeQueue); } insert(parentElm, vnode.elm, refElm); } if ("development" !== 'production' && data && data.pre) { inPre--; } } else if (isTrue(vnode.isComment)) { vnode.elm = nodeOps.createComment(vnode.text); insert(parentElm, vnode.elm, refElm); } else { vnode.elm = nodeOps.createTextNode(vnode.text); insert(parentElm, vnode.elm, refElm); } } function createComponent (vnode, insertedVnodeQueue, parentElm, refElm) { var i = vnode.data; if (isDef(i)) { var isReactivated = isDef(vnode.componentInstance) && i.keepAlive; if (isDef(i = i.hook) && isDef(i = i.init)) { i(vnode, false /* hydrating */, parentElm, refElm); } // after calling the init hook, if the vnode is a child component // it should've created a child instance and mounted it. the child // component also has set the placeholder vnode's elm. // in that case we can just return the element and be done. if (isDef(vnode.componentInstance)) { initComponent(vnode, insertedVnodeQueue); if (isTrue(isReactivated)) { reactivateComponent(vnode, insertedVnodeQueue, parentElm, refElm); } return true } } } function initComponent (vnode, insertedVnodeQueue) { if (isDef(vnode.data.pendingInsert)) { insertedVnodeQueue.push.apply(insertedVnodeQueue, vnode.data.pendingInsert); vnode.data.pendingInsert = null; } vnode.elm = vnode.componentInstance.$el; if (isPatchable(vnode)) { invokeCreateHooks(vnode, insertedVnodeQueue); setScope(vnode); } else { // empty component root. // skip all element-related modules except for ref (#3455) registerRef(vnode); // make sure to invoke the insert hook insertedVnodeQueue.push(vnode); } } function reactivateComponent (vnode, insertedVnodeQueue, parentElm, refElm) { var i; // hack for #4339: a reactivated component with inner transition // does not trigger because the inner node's created hooks are not called // again. It's not ideal to involve module-specific logic in here but // there doesn't seem to be a better way to do it. var innerNode = vnode; while (innerNode.componentInstance) { innerNode = innerNode.componentInstance._vnode; if (isDef(i = innerNode.data) && isDef(i = i.transition)) { for (i = 0; i < cbs.activate.length; ++i) { cbs.activate[i](emptyNode, innerNode); } insertedVnodeQueue.push(innerNode); break } } // unlike a newly created component, // a reactivated keep-alive component doesn't insert itself insert(parentElm, vnode.elm, refElm); } function insert (parent, elm, ref$$1) { if (isDef(parent)) { if (isDef(ref$$1)) { if (ref$$1.parentNode === parent) { nodeOps.insertBefore(parent, elm, ref$$1); } } else { nodeOps.appendChild(parent, elm); } } } function createChildren (vnode, children, insertedVnodeQueue) { if (Array.isArray(children)) { for (var i = 0; i < children.length; ++i) { createElm(children[i], insertedVnodeQueue, vnode.elm, null, true); } } else if (isPrimitive(vnode.text)) { nodeOps.appendChild(vnode.elm, nodeOps.createTextNode(vnode.text)); } } function isPatchable (vnode) { while (vnode.componentInstance) { vnode = vnode.componentInstance._vnode; } return isDef(vnode.tag) } function invokeCreateHooks (vnode, insertedVnodeQueue) { for (var i$1 = 0; i$1 < cbs.create.length; ++i$1) { cbs.create[i$1](emptyNode, vnode); } i = vnode.data.hook; // Reuse variable if (isDef(i)) { if (isDef(i.create)) { i.create(emptyNode, vnode); } if (isDef(i.insert)) { insertedVnodeQueue.push(vnode); } } } // set scope id attribute for scoped CSS. // this is implemented as a special case to avoid the overhead // of going through the normal attribute patching process. function setScope (vnode) { var i; var ancestor = vnode; while (ancestor) { if (isDef(i = ancestor.context) && isDef(i = i.$options._scopeId)) { nodeOps.setAttribute(vnode.elm, i, ''); } ancestor = ancestor.parent; } // for slot content they should also get the scopeId from the host instance. if (isDef(i = activeInstance) && i !== vnode.context && isDef(i = i.$options._scopeId) ) { nodeOps.setAttribute(vnode.elm, i, ''); } } function addVnodes (parentElm, refElm, vnodes, startIdx, endIdx, insertedVnodeQueue) { for (; startIdx <= endIdx; ++startIdx) { createElm(vnodes[startIdx], insertedVnodeQueue, parentElm, refElm); } } function invokeDestroyHook (vnode) { var i, j; var data = vnode.data; if (isDef(data)) { if (isDef(i = data.hook) && isDef(i = i.destroy)) { i(vnode); } for (i = 0; i < cbs.destroy.length; ++i) { cbs.destroy[i](vnode); } } if (isDef(i = vnode.children)) { for (j = 0; j < vnode.children.length; ++j) { invokeDestroyHook(vnode.children[j]); } } } function removeVnodes (parentElm, vnodes, startIdx, endIdx) { for (; startIdx <= endIdx; ++startIdx) { var ch = vnodes[startIdx]; if (isDef(ch)) { if (isDef(ch.tag)) { removeAndInvokeRemoveHook(ch); invokeDestroyHook(ch); } else { // Text node removeNode(ch.elm); } } } } function removeAndInvokeRemoveHook (vnode, rm) { if (isDef(rm) || isDef(vnode.data)) { var i; var listeners = cbs.remove.length + 1; if (isDef(rm)) { // we have a recursively passed down rm callback // increase the listeners count rm.listeners += listeners; } else { // directly removing rm = createRmCb(vnode.elm, listeners); } // recursively invoke hooks on child component root node if (isDef(i = vnode.componentInstance) && isDef(i = i._vnode) && isDef(i.data)) { removeAndInvokeRemoveHook(i, rm); } for (i = 0; i < cbs.remove.length; ++i) { cbs.remove[i](vnode, rm); } if (isDef(i = vnode.data.hook) && isDef(i = i.remove)) { i(vnode, rm); } else { rm(); } } else { removeNode(vnode.elm); } } function updateChildren (parentElm, oldCh, newCh, insertedVnodeQueue, removeOnly) { var oldStartIdx = 0; var newStartIdx = 0; var oldEndIdx = oldCh.length - 1; var oldStartVnode = oldCh[0]; var oldEndVnode = oldCh[oldEndIdx]; var newEndIdx = newCh.length - 1; var newStartVnode = newCh[0]; var newEndVnode = newCh[newEndIdx]; var oldKeyToIdx, idxInOld, elmToMove, refElm; // removeOnly is a special flag used only by <transition-group> // to ensure removed elements stay in correct relative positions // during leaving transitions var canMove = !removeOnly; while (oldStartIdx <= oldEndIdx && newStartIdx <= newEndIdx) { if (isUndef(oldStartVnode)) { oldStartVnode = oldCh[++oldStartIdx]; // Vnode has been moved left } else if (isUndef(oldEndVnode)) { oldEndVnode = oldCh[--oldEndIdx]; } else if (sameVnode(oldStartVnode, newStartVnode)) { patchVnode(oldStartVnode, newStartVnode, insertedVnodeQueue); oldStartVnode = oldCh[++oldStartIdx]; newStartVnode = newCh[++newStartIdx]; } else if (sameVnode(oldEndVnode, newEndVnode)) { patchVnode(oldEndVnode, newEndVnode, insertedVnodeQueue); oldEndVnode = oldCh[--oldEndIdx]; newEndVnode = newCh[--newEndIdx]; } else if (sameVnode(oldStartVnode, newEndVnode)) { // Vnode moved right patchVnode(oldStartVnode, newEndVnode, insertedVnodeQueue); canMove && nodeOps.insertBefore(parentElm, oldStartVnode.elm, nodeOps.nextSibling(oldEndVnode.elm)); oldStartVnode = oldCh[++oldStartIdx]; newEndVnode = newCh[--newEndIdx]; } else if (sameVnode(oldEndVnode, newStartVnode)) { // Vnode moved left patchVnode(oldEndVnode, newStartVnode, insertedVnodeQueue); canMove && nodeOps.insertBefore(parentElm, oldEndVnode.elm, oldStartVnode.elm); oldEndVnode = oldCh[--oldEndIdx]; newStartVnode = newCh[++newStartIdx]; } else { if (isUndef(oldKeyToIdx)) { oldKeyToIdx = createKeyToOldIdx(oldCh, oldStartIdx, oldEndIdx); } idxInOld = isDef(newStartVnode.key) ? oldKeyToIdx[newStartVnode.key] : null; if (isUndef(idxInOld)) { // New element createElm(newStartVnode, insertedVnodeQueue, parentElm, oldStartVnode.elm); newStartVnode = newCh[++newStartIdx]; } else { elmToMove = oldCh[idxInOld]; /* istanbul ignore if */ if ("development" !== 'production' && !elmToMove) { warn( 'It seems there are duplicate keys that is causing an update error. ' + 'Make sure each v-for item has a unique key.' ); } if (sameVnode(elmToMove, newStartVnode)) { patchVnode(elmToMove, newStartVnode, insertedVnodeQueue); oldCh[idxInOld] = undefined; canMove && nodeOps.insertBefore(parentElm, elmToMove.elm, oldStartVnode.elm); newStartVnode = newCh[++newStartIdx]; } else { // same key but different element. treat as new element createElm(newStartVnode, insertedVnodeQueue, parentElm, oldStartVnode.elm); newStartVnode = newCh[++newStartIdx]; } } } } if (oldStartIdx > oldEndIdx) { refElm = isUndef(newCh[newEndIdx + 1]) ? null : newCh[newEndIdx + 1].elm; addVnodes(parentElm, refElm, newCh, newStartIdx, newEndIdx, insertedVnodeQueue); } else if (newStartIdx > newEndIdx) { removeVnodes(parentElm, oldCh, oldStartIdx, oldEndIdx); } } function patchVnode (oldVnode, vnode, insertedVnodeQueue, removeOnly) { if (oldVnode === vnode) { return } var elm = vnode.elm = oldVnode.elm; if (isTrue(oldVnode.isAsyncPlaceholder)) { if (isDef(vnode.asyncFactory.resolved)) { hydrate(oldVnode.elm, vnode, insertedVnodeQueue); } else { vnode.isAsyncPlaceholder = true; } return } // reuse element for static trees. // note we only do this if the vnode is cloned - // if the new node is not cloned it means the render functions have been // reset by the hot-reload-api and we need to do a proper re-render. if (isTrue(vnode.isStatic) && isTrue(oldVnode.isStatic) && vnode.key === oldVnode.key && (isTrue(vnode.isCloned) || isTrue(vnode.isOnce)) ) { vnode.componentInstance = oldVnode.componentInstance; return } var i; var data = vnode.data; if (isDef(data) && isDef(i = data.hook) && isDef(i = i.prepatch)) { i(oldVnode, vnode); } var oldCh = oldVnode.children; var ch = vnode.children; if (isDef(data) && isPatchable(vnode)) { for (i = 0; i < cbs.update.length; ++i) { cbs.update[i](oldVnode, vnode); } if (isDef(i = data.hook) && isDef(i = i.update)) { i(oldVnode, vnode); } } if (isUndef(vnode.text)) { if (isDef(oldCh) && isDef(ch)) { if (oldCh !== ch) { updateChildren(elm, oldCh, ch, insertedVnodeQueue, removeOnly); } } else if (isDef(ch)) { if (isDef(oldVnode.text)) { nodeOps.setTextContent(elm, ''); } addVnodes(elm, null, ch, 0, ch.length - 1, insertedVnodeQueue); } else if (isDef(oldCh)) { removeVnodes(elm, oldCh, 0, oldCh.length - 1); } else if (isDef(oldVnode.text)) { nodeOps.setTextContent(elm, ''); } } else if (oldVnode.text !== vnode.text) { nodeOps.setTextContent(elm, vnode.text); } if (isDef(data)) { if (isDef(i = data.hook) && isDef(i = i.postpatch)) { i(oldVnode, vnode); } } } function invokeInsertHook (vnode, queue, initial) { // delay insert hooks for component root nodes, invoke them after the // element is really inserted if (isTrue(initial) && isDef(vnode.parent)) { vnode.parent.data.pendingInsert = queue; } else { for (var i = 0; i < queue.length; ++i) { queue[i].data.hook.insert(queue[i]); } } } var bailed = false; // list of modules that can skip create hook during hydration because they // are already rendered on the client or has no need for initialization var isRenderedModule = makeMap('attrs,style,class,staticClass,staticStyle,key'); // Note: this is a browser-only function so we can assume elms are DOM nodes. function hydrate (elm, vnode, insertedVnodeQueue) { if (isTrue(vnode.isComment) && isDef(vnode.asyncFactory)) { vnode.elm = elm; vnode.isAsyncPlaceholder = true; return true } if (true) { if (!assertNodeMatch(elm, vnode)) { return false } } vnode.elm = elm; var tag = vnode.tag; var data = vnode.data; var children = vnode.children; if (isDef(data)) { if (isDef(i = data.hook) && isDef(i = i.init)) { i(vnode, true /* hydrating */); } if (isDef(i = vnode.componentInstance)) { // child component. it should have hydrated its own tree. initComponent(vnode, insertedVnodeQueue); return true } } if (isDef(tag)) { if (isDef(children)) { // empty element, allow client to pick up and populate children if (!elm.hasChildNodes()) { createChildren(vnode, children, insertedVnodeQueue); } else { var childrenMatch = true; var childNode = elm.firstChild; for (var i$1 = 0; i$1 < children.length; i$1++) { if (!childNode || !hydrate(childNode, children[i$1], insertedVnodeQueue)) { childrenMatch = false; break } childNode = childNode.nextSibling; } // if childNode is not null, it means the actual childNodes list is // longer than the virtual children list. if (!childrenMatch || childNode) { if ("development" !== 'production' && typeof console !== 'undefined' && !bailed ) { bailed = true; console.warn('Parent: ', elm); console.warn('Mismatching childNodes vs. VNodes: ', elm.childNodes, children); } return false } } } if (isDef(data)) { for (var key in data) { if (!isRenderedModule(key)) { invokeCreateHooks(vnode, insertedVnodeQueue); break } } } } else if (elm.data !== vnode.text) { elm.data = vnode.text; } return true } function assertNodeMatch (node, vnode) { if (isDef(vnode.tag)) { return ( vnode.tag.indexOf('vue-component') === 0 || vnode.tag.toLowerCase() === (node.tagName && node.tagName.toLowerCase()) ) } else { return node.nodeType === (vnode.isComment ? 8 : 3) } } return function patch (oldVnode, vnode, hydrating, removeOnly, parentElm, refElm) { if (isUndef(vnode)) { if (isDef(oldVnode)) { invokeDestroyHook(oldVnode); } return } var isInitialPatch = false; var insertedVnodeQueue = []; if (isUndef(oldVnode)) { // empty mount (likely as component), create new root element isInitialPatch = true; createElm(vnode, insertedVnodeQueue, parentElm, refElm); } else { var isRealElement = isDef(oldVnode.nodeType); if (!isRealElement && sameVnode(oldVnode, vnode)) { // patch existing root node patchVnode(oldVnode, vnode, insertedVnodeQueue, removeOnly); } else { if (isRealElement) { // mounting to a real element // check if this is server-rendered content and if we can perform // a successful hydration. if (oldVnode.nodeType === 1 && oldVnode.hasAttribute(SSR_ATTR)) { oldVnode.removeAttribute(SSR_ATTR); hydrating = true; } if (isTrue(hydrating)) { if (hydrate(oldVnode, vnode, insertedVnodeQueue)) { invokeInsertHook(vnode, insertedVnodeQueue, true); return oldVnode } else if (true) { warn( 'The client-side rendered virtual DOM tree is not matching ' + 'server-rendered content. This is likely caused by incorrect ' + 'HTML markup, for example nesting block-level elements inside ' + '<p>, or missing <tbody>. Bailing hydration and performing ' + 'full client-side render.' ); } } // either not server-rendered, or hydration failed. // create an empty node and replace it oldVnode = emptyNodeAt(oldVnode); } // replacing existing element var oldElm = oldVnode.elm; var parentElm$1 = nodeOps.parentNode(oldElm); createElm( vnode, insertedVnodeQueue, // extremely rare edge case: do not insert if old element is in a // leaving transition. Only happens when combining transition + // keep-alive + HOCs. (#4590) oldElm._leaveCb ? null : parentElm$1, nodeOps.nextSibling(oldElm) ); if (isDef(vnode.parent)) { // component root element replaced. // update parent placeholder node element, recursively var ancestor = vnode.parent; while (ancestor) { ancestor.elm = vnode.elm; ancestor = ancestor.parent; } if (isPatchable(vnode)) { for (var i = 0; i < cbs.create.length; ++i) { cbs.create[i](emptyNode, vnode.parent); } } } if (isDef(parentElm$1)) { removeVnodes(parentElm$1, [oldVnode], 0, 0); } else if (isDef(oldVnode.tag)) { invokeDestroyHook(oldVnode); } } } invokeInsertHook(vnode, insertedVnodeQueue, isInitialPatch); return vnode.elm } } /* */ var directives = { create: updateDirectives, update: updateDirectives, destroy: function unbindDirectives (vnode) { updateDirectives(vnode, emptyNode); } }; function updateDirectives (oldVnode, vnode) { if (oldVnode.data.directives || vnode.data.directives) { _update(oldVnode, vnode); } } function _update (oldVnode, vnode) { var isCreate = oldVnode === emptyNode; var isDestroy = vnode === emptyNode; var oldDirs = normalizeDirectives$1(oldVnode.data.directives, oldVnode.context); var newDirs = normalizeDirectives$1(vnode.data.directives, vnode.context); var dirsWithInsert = []; var dirsWithPostpatch = []; var key, oldDir, dir; for (key in newDirs) { oldDir = oldDirs[key]; dir = newDirs[key]; if (!oldDir) { // new directive, bind callHook$1(dir, 'bind', vnode, oldVnode); if (dir.def && dir.def.inserted) { dirsWithInsert.push(dir); } } else { // existing directive, update dir.oldValue = oldDir.value; callHook$1(dir, 'update', vnode, oldVnode); if (dir.def && dir.def.componentUpdated) { dirsWithPostpatch.push(dir); } } } if (dirsWithInsert.length) { var callInsert = function () { for (var i = 0; i < dirsWithInsert.length; i++) { callHook$1(dirsWithInsert[i], 'inserted', vnode, oldVnode); } }; if (isCreate) { mergeVNodeHook(vnode.data.hook || (vnode.data.hook = {}), 'insert', callInsert); } else { callInsert(); } } if (dirsWithPostpatch.length) { mergeVNodeHook(vnode.data.hook || (vnode.data.hook = {}), 'postpatch', function () { for (var i = 0; i < dirsWithPostpatch.length; i++) { callHook$1(dirsWithPostpatch[i], 'componentUpdated', vnode, oldVnode); } }); } if (!isCreate) { for (key in oldDirs) { if (!newDirs[key]) { // no longer present, unbind callHook$1(oldDirs[key], 'unbind', oldVnode, oldVnode, isDestroy); } } } } var emptyModifiers = Object.create(null); function normalizeDirectives$1 ( dirs, vm ) { var res = Object.create(null); if (!dirs) { return res } var i, dir; for (i = 0; i < dirs.length; i++) { dir = dirs[i]; if (!dir.modifiers) { dir.modifiers = emptyModifiers; } res[getRawDirName(dir)] = dir; dir.def = resolveAsset(vm.$options, 'directives', dir.name, true); } return res } function getRawDirName (dir) { return dir.rawName || ((dir.name) + "." + (Object.keys(dir.modifiers || {}).join('.'))) } function callHook$1 (dir, hook, vnode, oldVnode, isDestroy) { var fn = dir.def && dir.def[hook]; if (fn) { try { fn(vnode.elm, dir, vnode, oldVnode, isDestroy); } catch (e) { handleError(e, vnode.context, ("directive " + (dir.name) + " " + hook + " hook")); } } } var baseModules = [ ref, directives ]; /* */ function updateAttrs (oldVnode, vnode) { var opts = vnode.componentOptions; if (isDef(opts) && opts.Ctor.options.inheritAttrs === false) { return } if (isUndef(oldVnode.data.attrs) && isUndef(vnode.data.attrs)) { return } var key, cur, old; var elm = vnode.elm; var oldAttrs = oldVnode.data.attrs || {}; var attrs = vnode.data.attrs || {}; // clone observed objects, as the user probably wants to mutate it if (isDef(attrs.__ob__)) { attrs = vnode.data.attrs = extend({}, attrs); } for (key in attrs) { cur = attrs[key]; old = oldAttrs[key]; if (old !== cur) { setAttr(elm, key, cur); } } // #4391: in IE9, setting type can reset value for input[type=radio] /* istanbul ignore if */ if (isIE9 && attrs.value !== oldAttrs.value) { setAttr(elm, 'value', attrs.value); } for (key in oldAttrs) { if (isUndef(attrs[key])) { if (isXlink(key)) { elm.removeAttributeNS(xlinkNS, getXlinkProp(key)); } else if (!isEnumeratedAttr(key)) { elm.removeAttribute(key); } } } } function setAttr (el, key, value) { if (isBooleanAttr(key)) { // set attribute for blank value // e.g. <option disabled>Select one</option> if (isFalsyAttrValue(value)) { el.removeAttribute(key); } else { el.setAttribute(key, key); } } else if (isEnumeratedAttr(key)) { el.setAttribute(key, isFalsyAttrValue(value) || value === 'false' ? 'false' : 'true'); } else if (isXlink(key)) { if (isFalsyAttrValue(value)) { el.removeAttributeNS(xlinkNS, getXlinkProp(key)); } else { el.setAttributeNS(xlinkNS, key, value); } } else { if (isFalsyAttrValue(value)) { el.removeAttribute(key); } else { el.setAttribute(key, value); } } } var attrs = { create: updateAttrs, update: updateAttrs }; /* */ function updateClass (oldVnode, vnode) { var el = vnode.elm; var data = vnode.data; var oldData = oldVnode.data; if ( isUndef(data.staticClass) && isUndef(data.class) && ( isUndef(oldData) || ( isUndef(oldData.staticClass) && isUndef(oldData.class) ) ) ) { return } var cls = genClassForVnode(vnode); // handle transition classes var transitionClass = el._transitionClasses; if (isDef(transitionClass)) { cls = concat(cls, stringifyClass(transitionClass)); } // set the class if (cls !== el._prevClass) { el.setAttribute('class', cls); el._prevClass = cls; } } var klass = { create: updateClass, update: updateClass }; /* */ var validDivisionCharRE = /[\w).+\-_$\]]/; function parseFilters (exp) { var inSingle = false; var inDouble = false; var inTemplateString = false; var inRegex = false; var curly = 0; var square = 0; var paren = 0; var lastFilterIndex = 0; var c, prev, i, expression, filters; for (i = 0; i < exp.length; i++) { prev = c; c = exp.charCodeAt(i); if (inSingle) { if (c === 0x27 && prev !== 0x5C) { inSingle = false; } } else if (inDouble) { if (c === 0x22 && prev !== 0x5C) { inDouble = false; } } else if (inTemplateString) { if (c === 0x60 && prev !== 0x5C) { inTemplateString = false; } } else if (inRegex) { if (c === 0x2f && prev !== 0x5C) { inRegex = false; } } else if ( c === 0x7C && // pipe exp.charCodeAt(i + 1) !== 0x7C && exp.charCodeAt(i - 1) !== 0x7C && !curly && !square && !paren ) { if (expression === undefined) { // first filter, end of expression lastFilterIndex = i + 1; expression = exp.slice(0, i).trim(); } else { pushFilter(); } } else { switch (c) { case 0x22: inDouble = true; break // " case 0x27: inSingle = true; break // ' case 0x60: inTemplateString = true; break // ` case 0x28: paren++; break // ( case 0x29: paren--; break // ) case 0x5B: square++; break // [ case 0x5D: square--; break // ] case 0x7B: curly++; break // { case 0x7D: curly--; break // } } if (c === 0x2f) { // / var j = i - 1; var p = (void 0); // find first non-whitespace prev char for (; j >= 0; j--) { p = exp.charAt(j); if (p !== ' ') { break } } if (!p || !validDivisionCharRE.test(p)) { inRegex = true; } } } } if (expression === undefined) { expression = exp.slice(0, i).trim(); } else if (lastFilterIndex !== 0) { pushFilter(); } function pushFilter () { (filters || (filters = [])).push(exp.slice(lastFilterIndex, i).trim()); lastFilterIndex = i + 1; } if (filters) { for (i = 0; i < filters.length; i++) { expression = wrapFilter(expression, filters[i]); } } return expression } function wrapFilter (exp, filter) { var i = filter.indexOf('('); if (i < 0) { // _f: resolveFilter return ("_f(\"" + filter + "\")(" + exp + ")") } else { var name = filter.slice(0, i); var args = filter.slice(i + 1); return ("_f(\"" + name + "\")(" + exp + "," + args) } } /* */ function baseWarn (msg) { console.error(("[Vue compiler]: " + msg)); } function pluckModuleFunction ( modules, key ) { return modules ? modules.map(function (m) { return m[key]; }).filter(function (_) { return _; }) : [] } function addProp (el, name, value) { (el.props || (el.props = [])).push({ name: name, value: value }); } function addAttr (el, name, value) { (el.attrs || (el.attrs = [])).push({ name: name, value: value }); } function addDirective ( el, name, rawName, value, arg, modifiers ) { (el.directives || (el.directives = [])).push({ name: name, rawName: rawName, value: value, arg: arg, modifiers: modifiers }); } function addHandler ( el, name, value, modifiers, important, warn ) { // warn prevent and passive modifier /* istanbul ignore if */ if ( "development" !== 'production' && warn && modifiers && modifiers.prevent && modifiers.passive ) { warn( 'passive and prevent can\'t be used together. ' + 'Passive handler can\'t prevent default event.' ); } // check capture modifier if (modifiers && modifiers.capture) { delete modifiers.capture; name = '!' + name; // mark the event as captured } if (modifiers && modifiers.once) { delete modifiers.once; name = '~' + name; // mark the event as once } /* istanbul ignore if */ if (modifiers && modifiers.passive) { delete modifiers.passive; name = '&' + name; // mark the event as passive } var events; if (modifiers && modifiers.native) { delete modifiers.native; events = el.nativeEvents || (el.nativeEvents = {}); } else { events = el.events || (el.events = {}); } var newHandler = { value: value, modifiers: modifiers }; var handlers = events[name]; /* istanbul ignore if */ if (Array.isArray(handlers)) { important ? handlers.unshift(newHandler) : handlers.push(newHandler); } else if (handlers) { events[name] = important ? [newHandler, handlers] : [handlers, newHandler]; } else { events[name] = newHandler; } } function getBindingAttr ( el, name, getStatic ) { var dynamicValue = getAndRemoveAttr(el, ':' + name) || getAndRemoveAttr(el, 'v-bind:' + name); if (dynamicValue != null) { return parseFilters(dynamicValue) } else if (getStatic !== false) { var staticValue = getAndRemoveAttr(el, name); if (staticValue != null) { return JSON.stringify(staticValue) } } } function getAndRemoveAttr (el, name) { var val; if ((val = el.attrsMap[name]) != null) { var list = el.attrsList; for (var i = 0, l = list.length; i < l; i++) { if (list[i].name === name) { list.splice(i, 1); break } } } return val } /* */ /** * Cross-platform code generation for component v-model */ function genComponentModel ( el, value, modifiers ) { var ref = modifiers || {}; var number = ref.number; var trim = ref.trim; var baseValueExpression = '$$v'; var valueExpression = baseValueExpression; if (trim) { valueExpression = "(typeof " + baseValueExpression + " === 'string'" + "? " + baseValueExpression + ".trim()" + ": " + baseValueExpression + ")"; } if (number) { valueExpression = "_n(" + valueExpression + ")"; } var assignment = genAssignmentCode(value, valueExpression); el.model = { value: ("(" + value + ")"), expression: ("\"" + value + "\""), callback: ("function (" + baseValueExpression + ") {" + assignment + "}") }; } /** * Cross-platform codegen helper for generating v-model value assignment code. */ function genAssignmentCode ( value, assignment ) { var modelRs = parseModel(value); if (modelRs.idx === null) { return (value + "=" + assignment) } else { return ("$set(" + (modelRs.exp) + ", " + (modelRs.idx) + ", " + assignment + ")") } } /** * parse directive model to do the array update transform. a[idx] = val => $$a.splice($$idx, 1, val) * * for loop possible cases: * * - test * - test[idx] * - test[test1[idx]] * - test["a"][idx] * - xxx.test[a[a].test1[idx]] * - test.xxx.a["asa"][test1[idx]] * */ var len; var str; var chr; var index$1; var expressionPos; var expressionEndPos; function parseModel (val) { str = val; len = str.length; index$1 = expressionPos = expressionEndPos = 0; if (val.indexOf('[') < 0 || val.lastIndexOf(']') < len - 1) { return { exp: val, idx: null } } while (!eof()) { chr = next(); /* istanbul ignore if */ if (isStringStart(chr)) { parseString(chr); } else if (chr === 0x5B) { parseBracket(chr); } } return { exp: val.substring(0, expressionPos), idx: val.substring(expressionPos + 1, expressionEndPos) } } function next () { return str.charCodeAt(++index$1) } function eof () { return index$1 >= len } function isStringStart (chr) { return chr === 0x22 || chr === 0x27 } function parseBracket (chr) { var inBracket = 1; expressionPos = index$1; while (!eof()) { chr = next(); if (isStringStart(chr)) { parseString(chr); continue } if (chr === 0x5B) { inBracket++; } if (chr === 0x5D) { inBracket--; } if (inBracket === 0) { expressionEndPos = index$1; break } } } function parseString (chr) { var stringQuote = chr; while (!eof()) { chr = next(); if (chr === stringQuote) { break } } } /* */ var warn$1; // in some cases, the event used has to be determined at runtime // so we used some reserved tokens during compile. var RANGE_TOKEN = '__r'; var CHECKBOX_RADIO_TOKEN = '__c'; function model ( el, dir, _warn ) { warn$1 = _warn; var value = dir.value; var modifiers = dir.modifiers; var tag = el.tag; var type = el.attrsMap.type; if (true) { var dynamicType = el.attrsMap['v-bind:type'] || el.attrsMap[':type']; if (tag === 'input' && dynamicType) { warn$1( "<input :type=\"" + dynamicType + "\" v-model=\"" + value + "\">:\n" + "v-model does not support dynamic input types. Use v-if branches instead." ); } // inputs with type="file" are read only and setting the input's // value will throw an error. if (tag === 'input' && type === 'file') { warn$1( "<" + (el.tag) + " v-model=\"" + value + "\" type=\"file\">:\n" + "File inputs are read only. Use a v-on:change listener instead." ); } } if (el.component) { genComponentModel(el, value, modifiers); // component v-model doesn't need extra runtime return false } else if (tag === 'select') { genSelect(el, value, modifiers); } else if (tag === 'input' && type === 'checkbox') { genCheckboxModel(el, value, modifiers); } else if (tag === 'input' && type === 'radio') { genRadioModel(el, value, modifiers); } else if (tag === 'input' || tag === 'textarea') { genDefaultModel(el, value, modifiers); } else if (!config.isReservedTag(tag)) { genComponentModel(el, value, modifiers); // component v-model doesn't need extra runtime return false } else if (true) { warn$1( "<" + (el.tag) + " v-model=\"" + value + "\">: " + "v-model is not supported on this element type. " + 'If you are working with contenteditable, it\'s recommended to ' + 'wrap a library dedicated for that purpose inside a custom component.' ); } // ensure runtime directive metadata return true } function genCheckboxModel ( el, value, modifiers ) { var number = modifiers && modifiers.number; var valueBinding = getBindingAttr(el, 'value') || 'null'; var trueValueBinding = getBindingAttr(el, 'true-value') || 'true'; var falseValueBinding = getBindingAttr(el, 'false-value') || 'false'; addProp(el, 'checked', "Array.isArray(" + value + ")" + "?_i(" + value + "," + valueBinding + ")>-1" + ( trueValueBinding === 'true' ? (":(" + value + ")") : (":_q(" + value + "," + trueValueBinding + ")") ) ); addHandler(el, CHECKBOX_RADIO_TOKEN, "var $$a=" + value + "," + '$$el=$event.target,' + "$$c=$$el.checked?(" + trueValueBinding + "):(" + falseValueBinding + ");" + 'if(Array.isArray($$a)){' + "var $$v=" + (number ? '_n(' + valueBinding + ')' : valueBinding) + "," + '$$i=_i($$a,$$v);' + "if($$el.checked){$$i<0&&(" + value + "=$$a.concat($$v))}" + "else{$$i>-1&&(" + value + "=$$a.slice(0,$$i).concat($$a.slice($$i+1)))}" + "}else{" + (genAssignmentCode(value, '$$c')) + "}", null, true ); } function genRadioModel ( el, value, modifiers ) { var number = modifiers && modifiers.number; var valueBinding = getBindingAttr(el, 'value') || 'null'; valueBinding = number ? ("_n(" + valueBinding + ")") : valueBinding; addProp(el, 'checked', ("_q(" + value + "," + valueBinding + ")")); addHandler(el, CHECKBOX_RADIO_TOKEN, genAssignmentCode(value, valueBinding), null, true); } function genSelect ( el, value, modifiers ) { var number = modifiers && modifiers.number; var selectedVal = "Array.prototype.filter" + ".call($event.target.options,function(o){return o.selected})" + ".map(function(o){var val = \"_value\" in o ? o._value : o.value;" + "return " + (number ? '_n(val)' : 'val') + "})"; var assignment = '$event.target.multiple ? $$selectedVal : $$selectedVal[0]'; var code = "var $$selectedVal = " + selectedVal + ";"; code = code + " " + (genAssignmentCode(value, assignment)); addHandler(el, 'change', code, null, true); } function genDefaultModel ( el, value, modifiers ) { var type = el.attrsMap.type; var ref = modifiers || {}; var lazy = ref.lazy; var number = ref.number; var trim = ref.trim; var needCompositionGuard = !lazy && type !== 'range'; var event = lazy ? 'change' : type === 'range' ? RANGE_TOKEN : 'input'; var valueExpression = '$event.target.value'; if (trim) { valueExpression = "$event.target.value.trim()"; } if (number) { valueExpression = "_n(" + valueExpression + ")"; } var code = genAssignmentCode(value, valueExpression); if (needCompositionGuard) { code = "if($event.target.composing)return;" + code; } addProp(el, 'value', ("(" + value + ")")); addHandler(el, event, code, null, true); if (trim || number) { addHandler(el, 'blur', '$forceUpdate()'); } } /* */ // normalize v-model event tokens that can only be determined at runtime. // it's important to place the event as the first in the array because // the whole point is ensuring the v-model callback gets called before // user-attached handlers. function normalizeEvents (on) { var event; /* istanbul ignore if */ if (isDef(on[RANGE_TOKEN])) { // IE input[type=range] only supports `change` event event = isIE ? 'change' : 'input'; on[event] = [].concat(on[RANGE_TOKEN], on[event] || []); delete on[RANGE_TOKEN]; } if (isDef(on[CHECKBOX_RADIO_TOKEN])) { // Chrome fires microtasks in between click/change, leads to #4521 event = isChrome ? 'click' : 'change'; on[event] = [].concat(on[CHECKBOX_RADIO_TOKEN], on[event] || []); delete on[CHECKBOX_RADIO_TOKEN]; } } var target$1; function add$1 ( event, handler, once$$1, capture, passive ) { if (once$$1) { var oldHandler = handler; var _target = target$1; // save current target element in closure handler = function (ev) { var res = arguments.length === 1 ? oldHandler(ev) : oldHandler.apply(null, arguments); if (res !== null) { remove$2(event, handler, capture, _target); } }; } target$1.addEventListener( event, handler, supportsPassive ? { capture: capture, passive: passive } : capture ); } function remove$2 ( event, handler, capture, _target ) { (_target || target$1).removeEventListener(event, handler, capture); } function updateDOMListeners (oldVnode, vnode) { if (isUndef(oldVnode.data.on) && isUndef(vnode.data.on)) { return } var on = vnode.data.on || {}; var oldOn = oldVnode.data.on || {}; target$1 = vnode.elm; normalizeEvents(on); updateListeners(on, oldOn, add$1, remove$2, vnode.context); } var events = { create: updateDOMListeners, update: updateDOMListeners }; /* */ function updateDOMProps (oldVnode, vnode) { if (isUndef(oldVnode.data.domProps) && isUndef(vnode.data.domProps)) { return } var key, cur; var elm = vnode.elm; var oldProps = oldVnode.data.domProps || {}; var props = vnode.data.domProps || {}; // clone observed objects, as the user probably wants to mutate it if (isDef(props.__ob__)) { props = vnode.data.domProps = extend({}, props); } for (key in oldProps) { if (isUndef(props[key])) { elm[key] = ''; } } for (key in props) { cur = props[key]; // ignore children if the node has textContent or innerHTML, // as these will throw away existing DOM nodes and cause removal errors // on subsequent patches (#3360) if (key === 'textContent' || key === 'innerHTML') { if (vnode.children) { vnode.children.length = 0; } if (cur === oldProps[key]) { continue } } if (key === 'value') { // store value as _value as well since // non-string values will be stringified elm._value = cur; // avoid resetting cursor position when value is the same var strCur = isUndef(cur) ? '' : String(cur); if (shouldUpdateValue(elm, vnode, strCur)) { elm.value = strCur; } } else { elm[key] = cur; } } } // check platforms/web/util/attrs.js acceptValue function shouldUpdateValue ( elm, vnode, checkVal ) { return (!elm.composing && ( vnode.tag === 'option' || isDirty(elm, checkVal) || isInputChanged(elm, checkVal) )) } function isDirty (elm, checkVal) { // return true when textbox (.number and .trim) loses focus and its value is // not equal to the updated value var notInFocus = true; // #6157 // work around IE bug when accessing document.activeElement in an iframe try { notInFocus = document.activeElement !== elm; } catch (e) {} return notInFocus && elm.value !== checkVal } function isInputChanged (elm, newVal) { var value = elm.value; var modifiers = elm._vModifiers; // injected by v-model runtime if (isDef(modifiers) && modifiers.number) { return toNumber(value) !== toNumber(newVal) } if (isDef(modifiers) && modifiers.trim) { return value.trim() !== newVal.trim() } return value !== newVal } var domProps = { create: updateDOMProps, update: updateDOMProps }; /* */ var parseStyleText = cached(function (cssText) { var res = {}; var listDelimiter = /;(?![^(]*\))/g; var propertyDelimiter = /:(.+)/; cssText.split(listDelimiter).forEach(function (item) { if (item) { var tmp = item.split(propertyDelimiter); tmp.length > 1 && (res[tmp[0].trim()] = tmp[1].trim()); } }); return res }); // merge static and dynamic style data on the same vnode function normalizeStyleData (data) { var style = normalizeStyleBinding(data.style); // static style is pre-processed into an object during compilation // and is always a fresh object, so it's safe to merge into it return data.staticStyle ? extend(data.staticStyle, style) : style } // normalize possible array / string values into Object function normalizeStyleBinding (bindingStyle) { if (Array.isArray(bindingStyle)) { return toObject(bindingStyle) } if (typeof bindingStyle === 'string') { return parseStyleText(bindingStyle) } return bindingStyle } /** * parent component style should be after child's * so that parent component's style could override it */ function getStyle (vnode, checkChild) { var res = {}; var styleData; if (checkChild) { var childNode = vnode; while (childNode.componentInstance) { childNode = childNode.componentInstance._vnode; if (childNode.data && (styleData = normalizeStyleData(childNode.data))) { extend(res, styleData); } } } if ((styleData = normalizeStyleData(vnode.data))) { extend(res, styleData); } var parentNode = vnode; while ((parentNode = parentNode.parent)) { if (parentNode.data && (styleData = normalizeStyleData(parentNode.data))) { extend(res, styleData); } } return res } /* */ var cssVarRE = /^--/; var importantRE = /\s*!important$/; var setProp = function (el, name, val) { /* istanbul ignore if */ if (cssVarRE.test(name)) { el.style.setProperty(name, val); } else if (importantRE.test(val)) { el.style.setProperty(name, val.replace(importantRE, ''), 'important'); } else { var normalizedName = normalize(name); if (Array.isArray(val)) { // Support values array created by autoprefixer, e.g. // {display: ["-webkit-box", "-ms-flexbox", "flex"]} // Set them one by one, and the browser will only set those it can recognize for (var i = 0, len = val.length; i < len; i++) { el.style[normalizedName] = val[i]; } } else { el.style[normalizedName] = val; } } }; var vendorNames = ['Webkit', 'Moz', 'ms']; var emptyStyle; var normalize = cached(function (prop) { emptyStyle = emptyStyle || document.createElement('div').style; prop = camelize(prop); if (prop !== 'filter' && (prop in emptyStyle)) { return prop } var capName = prop.charAt(0).toUpperCase() + prop.slice(1); for (var i = 0; i < vendorNames.length; i++) { var name = vendorNames[i] + capName; if (name in emptyStyle) { return name } } }); function updateStyle (oldVnode, vnode) { var data = vnode.data; var oldData = oldVnode.data; if (isUndef(data.staticStyle) && isUndef(data.style) && isUndef(oldData.staticStyle) && isUndef(oldData.style) ) { return } var cur, name; var el = vnode.elm; var oldStaticStyle = oldData.staticStyle; var oldStyleBinding = oldData.normalizedStyle || oldData.style || {}; // if static style exists, stylebinding already merged into it when doing normalizeStyleData var oldStyle = oldStaticStyle || oldStyleBinding; var style = normalizeStyleBinding(vnode.data.style) || {}; // store normalized style under a different key for next diff // make sure to clone it if it's reactive, since the user likley wants // to mutate it. vnode.data.normalizedStyle = isDef(style.__ob__) ? extend({}, style) : style; var newStyle = getStyle(vnode, true); for (name in oldStyle) { if (isUndef(newStyle[name])) { setProp(el, name, ''); } } for (name in newStyle) { cur = newStyle[name]; if (cur !== oldStyle[name]) { // ie9 setting to null has no effect, must use empty string setProp(el, name, cur == null ? '' : cur); } } } var style = { create: updateStyle, update: updateStyle }; /* */ /** * Add class with compatibility for SVG since classList is not supported on * SVG elements in IE */ function addClass (el, cls) { /* istanbul ignore if */ if (!cls || !(cls = cls.trim())) { return } /* istanbul ignore else */ if (el.classList) { if (cls.indexOf(' ') > -1) { cls.split(/\s+/).forEach(function (c) { return el.classList.add(c); }); } else { el.classList.add(cls); } } else { var cur = " " + (el.getAttribute('class') || '') + " "; if (cur.indexOf(' ' + cls + ' ') < 0) { el.setAttribute('class', (cur + cls).trim()); } } } /** * Remove class with compatibility for SVG since classList is not supported on * SVG elements in IE */ function removeClass (el, cls) { /* istanbul ignore if */ if (!cls || !(cls = cls.trim())) { return } /* istanbul ignore else */ if (el.classList) { if (cls.indexOf(' ') > -1) { cls.split(/\s+/).forEach(function (c) { return el.classList.remove(c); }); } else { el.classList.remove(cls); } if (!el.classList.length) { el.removeAttribute('class'); } } else { var cur = " " + (el.getAttribute('class') || '') + " "; var tar = ' ' + cls + ' '; while (cur.indexOf(tar) >= 0) { cur = cur.replace(tar, ' '); } cur = cur.trim(); if (cur) { el.setAttribute('class', cur); } else { el.removeAttribute('class'); } } } /* */ function resolveTransition (def$$1) { if (!def$$1) { return } /* istanbul ignore else */ if (typeof def$$1 === 'object') { var res = {}; if (def$$1.css !== false) { extend(res, autoCssTransition(def$$1.name || 'v')); } extend(res, def$$1); return res } else if (typeof def$$1 === 'string') { return autoCssTransition(def$$1) } } var autoCssTransition = cached(function (name) { return { enterClass: (name + "-enter"), enterToClass: (name + "-enter-to"), enterActiveClass: (name + "-enter-active"), leaveClass: (name + "-leave"), leaveToClass: (name + "-leave-to"), leaveActiveClass: (name + "-leave-active") } }); var hasTransition = inBrowser && !isIE9; var TRANSITION = 'transition'; var ANIMATION = 'animation'; // Transition property/event sniffing var transitionProp = 'transition'; var transitionEndEvent = 'transitionend'; var animationProp = 'animation'; var animationEndEvent = 'animationend'; if (hasTransition) { /* istanbul ignore if */ if (window.ontransitionend === undefined && window.onwebkittransitionend !== undefined ) { transitionProp = 'WebkitTransition'; transitionEndEvent = 'webkitTransitionEnd'; } if (window.onanimationend === undefined && window.onwebkitanimationend !== undefined ) { animationProp = 'WebkitAnimation'; animationEndEvent = 'webkitAnimationEnd'; } } // binding to window is necessary to make hot reload work in IE in strict mode var raf = inBrowser && window.requestAnimationFrame ? window.requestAnimationFrame.bind(window) : setTimeout; function nextFrame (fn) { raf(function () { raf(fn); }); } function addTransitionClass (el, cls) { var transitionClasses = el._transitionClasses || (el._transitionClasses = []); if (transitionClasses.indexOf(cls) < 0) { transitionClasses.push(cls); addClass(el, cls); } } function removeTransitionClass (el, cls) { if (el._transitionClasses) { remove(el._transitionClasses, cls); } removeClass(el, cls); } function whenTransitionEnds ( el, expectedType, cb ) { var ref = getTransitionInfo(el, expectedType); var type = ref.type; var timeout = ref.timeout; var propCount = ref.propCount; if (!type) { return cb() } var event = type === TRANSITION ? transitionEndEvent : animationEndEvent; var ended = 0; var end = function () { el.removeEventListener(event, onEnd); cb(); }; var onEnd = function (e) { if (e.target === el) { if (++ended >= propCount) { end(); } } }; setTimeout(function () { if (ended < propCount) { end(); } }, timeout + 1); el.addEventListener(event, onEnd); } var transformRE = /\b(transform|all)(,|$)/; function getTransitionInfo (el, expectedType) { var styles = window.getComputedStyle(el); var transitionDelays = styles[transitionProp + 'Delay'].split(', '); var transitionDurations = styles[transitionProp + 'Duration'].split(', '); var transitionTimeout = getTimeout(transitionDelays, transitionDurations); var animationDelays = styles[animationProp + 'Delay'].split(', '); var animationDurations = styles[animationProp + 'Duration'].split(', '); var animationTimeout = getTimeout(animationDelays, animationDurations); var type; var timeout = 0; var propCount = 0; /* istanbul ignore if */ if (expectedType === TRANSITION) { if (transitionTimeout > 0) { type = TRANSITION; timeout = transitionTimeout; propCount = transitionDurations.length; } } else if (expectedType === ANIMATION) { if (animationTimeout > 0) { type = ANIMATION; timeout = animationTimeout; propCount = animationDurations.length; } } else { timeout = Math.max(transitionTimeout, animationTimeout); type = timeout > 0 ? transitionTimeout > animationTimeout ? TRANSITION : ANIMATION : null; propCount = type ? type === TRANSITION ? transitionDurations.length : animationDurations.length : 0; } var hasTransform = type === TRANSITION && transformRE.test(styles[transitionProp + 'Property']); return { type: type, timeout: timeout, propCount: propCount, hasTransform: hasTransform } } function getTimeout (delays, durations) { /* istanbul ignore next */ while (delays.length < durations.length) { delays = delays.concat(delays); } return Math.max.apply(null, durations.map(function (d, i) { return toMs(d) + toMs(delays[i]) })) } function toMs (s) { return Number(s.slice(0, -1)) * 1000 } /* */ function enter (vnode, toggleDisplay) { var el = vnode.elm; // call leave callback now if (isDef(el._leaveCb)) { el._leaveCb.cancelled = true; el._leaveCb(); } var data = resolveTransition(vnode.data.transition); if (isUndef(data)) { return } /* istanbul ignore if */ if (isDef(el._enterCb) || el.nodeType !== 1) { return } var css = data.css; var type = data.type; var enterClass = data.enterClass; var enterToClass = data.enterToClass; var enterActiveClass = data.enterActiveClass; var appearClass = data.appearClass; var appearToClass = data.appearToClass; var appearActiveClass = data.appearActiveClass; var beforeEnter = data.beforeEnter; var enter = data.enter; var afterEnter = data.afterEnter; var enterCancelled = data.enterCancelled; var beforeAppear = data.beforeAppear; var appear = data.appear; var afterAppear = data.afterAppear; var appearCancelled = data.appearCancelled; var duration = data.duration; // activeInstance will always be the <transition> component managing this // transition. One edge case to check is when the <transition> is placed // as the root node of a child component. In that case we need to check // <transition>'s parent for appear check. var context = activeInstance; var transitionNode = activeInstance.$vnode; while (transitionNode && transitionNode.parent) { transitionNode = transitionNode.parent; context = transitionNode.context; } var isAppear = !context._isMounted || !vnode.isRootInsert; if (isAppear && !appear && appear !== '') { return } var startClass = isAppear && appearClass ? appearClass : enterClass; var activeClass = isAppear && appearActiveClass ? appearActiveClass : enterActiveClass; var toClass = isAppear && appearToClass ? appearToClass : enterToClass; var beforeEnterHook = isAppear ? (beforeAppear || beforeEnter) : beforeEnter; var enterHook = isAppear ? (typeof appear === 'function' ? appear : enter) : enter; var afterEnterHook = isAppear ? (afterAppear || afterEnter) : afterEnter; var enterCancelledHook = isAppear ? (appearCancelled || enterCancelled) : enterCancelled; var explicitEnterDuration = toNumber( isObject(duration) ? duration.enter : duration ); if ("development" !== 'production' && explicitEnterDuration != null) { checkDuration(explicitEnterDuration, 'enter', vnode); } var expectsCSS = css !== false && !isIE9; var userWantsControl = getHookArgumentsLength(enterHook); var cb = el._enterCb = once(function () { if (expectsCSS) { removeTransitionClass(el, toClass); removeTransitionClass(el, activeClass); } if (cb.cancelled) { if (expectsCSS) { removeTransitionClass(el, startClass); } enterCancelledHook && enterCancelledHook(el); } else { afterEnterHook && afterEnterHook(el); } el._enterCb = null; }); if (!vnode.data.show) { // remove pending leave element on enter by injecting an insert hook mergeVNodeHook(vnode.data.hook || (vnode.data.hook = {}), 'insert', function () { var parent = el.parentNode; var pendingNode = parent && parent._pending && parent._pending[vnode.key]; if (pendingNode && pendingNode.tag === vnode.tag && pendingNode.elm._leaveCb ) { pendingNode.elm._leaveCb(); } enterHook && enterHook(el, cb); }); } // start enter transition beforeEnterHook && beforeEnterHook(el); if (expectsCSS) { addTransitionClass(el, startClass); addTransitionClass(el, activeClass); nextFrame(function () { addTransitionClass(el, toClass); removeTransitionClass(el, startClass); if (!cb.cancelled && !userWantsControl) { if (isValidDuration(explicitEnterDuration)) { setTimeout(cb, explicitEnterDuration); } else { whenTransitionEnds(el, type, cb); } } }); } if (vnode.data.show) { toggleDisplay && toggleDisplay(); enterHook && enterHook(el, cb); } if (!expectsCSS && !userWantsControl) { cb(); } } function leave (vnode, rm) { var el = vnode.elm; // call enter callback now if (isDef(el._enterCb)) { el._enterCb.cancelled = true; el._enterCb(); } var data = resolveTransition(vnode.data.transition); if (isUndef(data)) { return rm() } /* istanbul ignore if */ if (isDef(el._leaveCb) || el.nodeType !== 1) { return } var css = data.css; var type = data.type; var leaveClass = data.leaveClass; var leaveToClass = data.leaveToClass; var leaveActiveClass = data.leaveActiveClass; var beforeLeave = data.beforeLeave; var leave = data.leave; var afterLeave = data.afterLeave; var leaveCancelled = data.leaveCancelled; var delayLeave = data.delayLeave; var duration = data.duration; var expectsCSS = css !== false && !isIE9; var userWantsControl = getHookArgumentsLength(leave); var explicitLeaveDuration = toNumber( isObject(duration) ? duration.leave : duration ); if ("development" !== 'production' && isDef(explicitLeaveDuration)) { checkDuration(explicitLeaveDuration, 'leave', vnode); } var cb = el._leaveCb = once(function () { if (el.parentNode && el.parentNode._pending) { el.parentNode._pending[vnode.key] = null; } if (expectsCSS) { removeTransitionClass(el, leaveToClass); removeTransitionClass(el, leaveActiveClass); } if (cb.cancelled) { if (expectsCSS) { removeTransitionClass(el, leaveClass); } leaveCancelled && leaveCancelled(el); } else { rm(); afterLeave && afterLeave(el); } el._leaveCb = null; }); if (delayLeave) { delayLeave(performLeave); } else { performLeave(); } function performLeave () { // the delayed leave may have already been cancelled if (cb.cancelled) { return } // record leaving element if (!vnode.data.show) { (el.parentNode._pending || (el.parentNode._pending = {}))[(vnode.key)] = vnode; } beforeLeave && beforeLeave(el); if (expectsCSS) { addTransitionClass(el, leaveClass); addTransitionClass(el, leaveActiveClass); nextFrame(function () { addTransitionClass(el, leaveToClass); removeTransitionClass(el, leaveClass); if (!cb.cancelled && !userWantsControl) { if (isValidDuration(explicitLeaveDuration)) { setTimeout(cb, explicitLeaveDuration); } else { whenTransitionEnds(el, type, cb); } } }); } leave && leave(el, cb); if (!expectsCSS && !userWantsControl) { cb(); } } } // only used in dev mode function checkDuration (val, name, vnode) { if (typeof val !== 'number') { warn( "<transition> explicit " + name + " duration is not a valid number - " + "got " + (JSON.stringify(val)) + ".", vnode.context ); } else if (isNaN(val)) { warn( "<transition> explicit " + name + " duration is NaN - " + 'the duration expression might be incorrect.', vnode.context ); } } function isValidDuration (val) { return typeof val === 'number' && !isNaN(val) } /** * Normalize a transition hook's argument length. The hook may be: * - a merged hook (invoker) with the original in .fns * - a wrapped component method (check ._length) * - a plain function (.length) */ function getHookArgumentsLength (fn) { if (isUndef(fn)) { return false } var invokerFns = fn.fns; if (isDef(invokerFns)) { // invoker return getHookArgumentsLength( Array.isArray(invokerFns) ? invokerFns[0] : invokerFns ) } else { return (fn._length || fn.length) > 1 } } function _enter (_, vnode) { if (vnode.data.show !== true) { enter(vnode); } } var transition = inBrowser ? { create: _enter, activate: _enter, remove: function remove$$1 (vnode, rm) { /* istanbul ignore else */ if (vnode.data.show !== true) { leave(vnode, rm); } else { rm(); } } } : {}; var platformModules = [ attrs, klass, events, domProps, style, transition ]; /* */ // the directive module should be applied last, after all // built-in modules have been applied. var modules = platformModules.concat(baseModules); var patch = createPatchFunction({ nodeOps: nodeOps, modules: modules }); /** * Not type checking this file because flow doesn't like attaching * properties to Elements. */ var isTextInputType = makeMap('text,number,password,search,email,tel,url'); /* istanbul ignore if */ if (isIE9) { // http://www.matts411.com/post/internet-explorer-9-oninput/ document.addEventListener('selectionchange', function () { var el = document.activeElement; if (el && el.vmodel) { trigger(el, 'input'); } }); } var model$1 = { inserted: function inserted (el, binding, vnode) { if (vnode.tag === 'select') { var cb = function () { setSelected(el, binding, vnode.context); }; cb(); /* istanbul ignore if */ if (isIE || isEdge) { setTimeout(cb, 0); } el._vOptions = [].map.call(el.options, getValue); } else if (vnode.tag === 'textarea' || isTextInputType(el.type)) { el._vModifiers = binding.modifiers; if (!binding.modifiers.lazy) { // Safari < 10.2 & UIWebView doesn't fire compositionend when // switching focus before confirming composition choice // this also fixes the issue where some browsers e.g. iOS Chrome // fires "change" instead of "input" on autocomplete. el.addEventListener('change', onCompositionEnd); if (!isAndroid) { el.addEventListener('compositionstart', onCompositionStart); el.addEventListener('compositionend', onCompositionEnd); } /* istanbul ignore if */ if (isIE9) { el.vmodel = true; } } } }, componentUpdated: function componentUpdated (el, binding, vnode) { if (vnode.tag === 'select') { setSelected(el, binding, vnode.context); // in case the options rendered by v-for have changed, // it's possible that the value is out-of-sync with the rendered options. // detect such cases and filter out values that no longer has a matching // option in the DOM. var prevOptions = el._vOptions; var curOptions = el._vOptions = [].map.call(el.options, getValue); if (curOptions.some(function (o, i) { return !looseEqual(o, prevOptions[i]); })) { trigger(el, 'change'); } } } }; function setSelected (el, binding, vm) { var value = binding.value; var isMultiple = el.multiple; if (isMultiple && !Array.isArray(value)) { "development" !== 'production' && warn( "<select multiple v-model=\"" + (binding.expression) + "\"> " + "expects an Array value for its binding, but got " + (Object.prototype.toString.call(value).slice(8, -1)), vm ); return } var selected, option; for (var i = 0, l = el.options.length; i < l; i++) { option = el.options[i]; if (isMultiple) { selected = looseIndexOf(value, getValue(option)) > -1; if (option.selected !== selected) { option.selected = selected; } } else { if (looseEqual(getValue(option), value)) { if (el.selectedIndex !== i) { el.selectedIndex = i; } return } } } if (!isMultiple) { el.selectedIndex = -1; } } function getValue (option) { return '_value' in option ? option._value : option.value } function onCompositionStart (e) { e.target.composing = true; } function onCompositionEnd (e) { // prevent triggering an input event for no reason if (!e.target.composing) { return } e.target.composing = false; trigger(e.target, 'input'); } function trigger (el, type) { var e = document.createEvent('HTMLEvents'); e.initEvent(type, true, true); el.dispatchEvent(e); } /* */ // recursively search for possible transition defined inside the component root function locateNode (vnode) { return vnode.componentInstance && (!vnode.data || !vnode.data.transition) ? locateNode(vnode.componentInstance._vnode) : vnode } var show = { bind: function bind (el, ref, vnode) { var value = ref.value; vnode = locateNode(vnode); var transition$$1 = vnode.data && vnode.data.transition; var originalDisplay = el.__vOriginalDisplay = el.style.display === 'none' ? '' : el.style.display; if (value && transition$$1) { vnode.data.show = true; enter(vnode, function () { el.style.display = originalDisplay; }); } else { el.style.display = value ? originalDisplay : 'none'; } }, update: function update (el, ref, vnode) { var value = ref.value; var oldValue = ref.oldValue; /* istanbul ignore if */ if (value === oldValue) { return } vnode = locateNode(vnode); var transition$$1 = vnode.data && vnode.data.transition; if (transition$$1) { vnode.data.show = true; if (value) { enter(vnode, function () { el.style.display = el.__vOriginalDisplay; }); } else { leave(vnode, function () { el.style.display = 'none'; }); } } else { el.style.display = value ? el.__vOriginalDisplay : 'none'; } }, unbind: function unbind ( el, binding, vnode, oldVnode, isDestroy ) { if (!isDestroy) { el.style.display = el.__vOriginalDisplay; } } }; var platformDirectives = { model: model$1, show: show }; /* */ // Provides transition support for a single element/component. // supports transition mode (out-in / in-out) var transitionProps = { name: String, appear: Boolean, css: Boolean, mode: String, type: String, enterClass: String, leaveClass: String, enterToClass: String, leaveToClass: String, enterActiveClass: String, leaveActiveClass: String, appearClass: String, appearActiveClass: String, appearToClass: String, duration: [Number, String, Object] }; // in case the child is also an abstract component, e.g. <keep-alive> // we want to recursively retrieve the real component to be rendered function getRealChild (vnode) { var compOptions = vnode && vnode.componentOptions; if (compOptions && compOptions.Ctor.options.abstract) { return getRealChild(getFirstComponentChild(compOptions.children)) } else { return vnode } } function extractTransitionData (comp) { var data = {}; var options = comp.$options; // props for (var key in options.propsData) { data[key] = comp[key]; } // events. // extract listeners and pass them directly to the transition methods var listeners = options._parentListeners; for (var key$1 in listeners) { data[camelize(key$1)] = listeners[key$1]; } return data } function placeholder (h, rawChild) { if (/\d-keep-alive$/.test(rawChild.tag)) { return h('keep-alive', { props: rawChild.componentOptions.propsData }) } } function hasParentTransition (vnode) { while ((vnode = vnode.parent)) { if (vnode.data.transition) { return true } } } function isSameChild (child, oldChild) { return oldChild.key === child.key && oldChild.tag === child.tag } function isAsyncPlaceholder (node) { return node.isComment && node.asyncFactory } var Transition = { name: 'transition', props: transitionProps, abstract: true, render: function render (h) { var this$1 = this; var children = this.$options._renderChildren; if (!children) { return } // filter out text nodes (possible whitespaces) children = children.filter(function (c) { return c.tag || isAsyncPlaceholder(c); }); /* istanbul ignore if */ if (!children.length) { return } // warn multiple elements if ("development" !== 'production' && children.length > 1) { warn( '<transition> can only be used on a single element. Use ' + '<transition-group> for lists.', this.$parent ); } var mode = this.mode; // warn invalid mode if ("development" !== 'production' && mode && mode !== 'in-out' && mode !== 'out-in' ) { warn( 'invalid <transition> mode: ' + mode, this.$parent ); } var rawChild = children[0]; // if this is a component root node and the component's // parent container node also has transition, skip. if (hasParentTransition(this.$vnode)) { return rawChild } // apply transition data to child // use getRealChild() to ignore abstract components e.g. keep-alive var child = getRealChild(rawChild); /* istanbul ignore if */ if (!child) { return rawChild } if (this._leaving) { return placeholder(h, rawChild) } // ensure a key that is unique to the vnode type and to this transition // component instance. This key will be used to remove pending leaving nodes // during entering. var id = "__transition-" + (this._uid) + "-"; child.key = child.key == null ? child.isComment ? id + 'comment' : id + child.tag : isPrimitive(child.key) ? (String(child.key).indexOf(id) === 0 ? child.key : id + child.key) : child.key; var data = (child.data || (child.data = {})).transition = extractTransitionData(this); var oldRawChild = this._vnode; var oldChild = getRealChild(oldRawChild); // mark v-show // so that the transition module can hand over the control to the directive if (child.data.directives && child.data.directives.some(function (d) { return d.name === 'show'; })) { child.data.show = true; } if ( oldChild && oldChild.data && !isSameChild(child, oldChild) && !isAsyncPlaceholder(oldChild) ) { // replace old child transition data with fresh one // important for dynamic transitions! var oldData = oldChild && (oldChild.data.transition = extend({}, data)); // handle transition mode if (mode === 'out-in') { // return placeholder node and queue update when leave finishes this._leaving = true; mergeVNodeHook(oldData, 'afterLeave', function () { this$1._leaving = false; this$1.$forceUpdate(); }); return placeholder(h, rawChild) } else if (mode === 'in-out') { if (isAsyncPlaceholder(child)) { return oldRawChild } var delayedLeave; var performLeave = function () { delayedLeave(); }; mergeVNodeHook(data, 'afterEnter', performLeave); mergeVNodeHook(data, 'enterCancelled', performLeave); mergeVNodeHook(oldData, 'delayLeave', function (leave) { delayedLeave = leave; }); } } return rawChild } }; /* */ // Provides transition support for list items. // supports move transitions using the FLIP technique. // Because the vdom's children update algorithm is "unstable" - i.e. // it doesn't guarantee the relative positioning of removed elements, // we force transition-group to update its children into two passes: // in the first pass, we remove all nodes that need to be removed, // triggering their leaving transition; in the second pass, we insert/move // into the final desired state. This way in the second pass removed // nodes will remain where they should be. var props = extend({ tag: String, moveClass: String }, transitionProps); delete props.mode; var TransitionGroup = { props: props, render: function render (h) { var tag = this.tag || this.$vnode.data.tag || 'span'; var map = Object.create(null); var prevChildren = this.prevChildren = this.children; var rawChildren = this.$slots.default || []; var children = this.children = []; var transitionData = extractTransitionData(this); for (var i = 0; i < rawChildren.length; i++) { var c = rawChildren[i]; if (c.tag) { if (c.key != null && String(c.key).indexOf('__vlist') !== 0) { children.push(c); map[c.key] = c ;(c.data || (c.data = {})).transition = transitionData; } else if (true) { var opts = c.componentOptions; var name = opts ? (opts.Ctor.options.name || opts.tag || '') : c.tag; warn(("<transition-group> children must be keyed: <" + name + ">")); } } } if (prevChildren) { var kept = []; var removed = []; for (var i$1 = 0; i$1 < prevChildren.length; i$1++) { var c$1 = prevChildren[i$1]; c$1.data.transition = transitionData; c$1.data.pos = c$1.elm.getBoundingClientRect(); if (map[c$1.key]) { kept.push(c$1); } else { removed.push(c$1); } } this.kept = h(tag, null, kept); this.removed = removed; } return h(tag, null, children) }, beforeUpdate: function beforeUpdate () { // force removing pass this.__patch__( this._vnode, this.kept, false, // hydrating true // removeOnly (!important, avoids unnecessary moves) ); this._vnode = this.kept; }, updated: function updated () { var children = this.prevChildren; var moveClass = this.moveClass || ((this.name || 'v') + '-move'); if (!children.length || !this.hasMove(children[0].elm, moveClass)) { return } // we divide the work into three loops to avoid mixing DOM reads and writes // in each iteration - which helps prevent layout thrashing. children.forEach(callPendingCbs); children.forEach(recordPosition); children.forEach(applyTranslation); // force reflow to put everything in position var body = document.body; var f = body.offsetHeight; // eslint-disable-line children.forEach(function (c) { if (c.data.moved) { var el = c.elm; var s = el.style; addTransitionClass(el, moveClass); s.transform = s.WebkitTransform = s.transitionDuration = ''; el.addEventListener(transitionEndEvent, el._moveCb = function cb (e) { if (!e || /transform$/.test(e.propertyName)) { el.removeEventListener(transitionEndEvent, cb); el._moveCb = null; removeTransitionClass(el, moveClass); } }); } }); }, methods: { hasMove: function hasMove (el, moveClass) { /* istanbul ignore if */ if (!hasTransition) { return false } /* istanbul ignore if */ if (this._hasMove) { return this._hasMove } // Detect whether an element with the move class applied has // CSS transitions. Since the element may be inside an entering // transition at this very moment, we make a clone of it and remove // all other transition classes applied to ensure only the move class // is applied. var clone = el.cloneNode(); if (el._transitionClasses) { el._transitionClasses.forEach(function (cls) { removeClass(clone, cls); }); } addClass(clone, moveClass); clone.style.display = 'none'; this.$el.appendChild(clone); var info = getTransitionInfo(clone); this.$el.removeChild(clone); return (this._hasMove = info.hasTransform) } } }; function callPendingCbs (c) { /* istanbul ignore if */ if (c.elm._moveCb) { c.elm._moveCb(); } /* istanbul ignore if */ if (c.elm._enterCb) { c.elm._enterCb(); } } function recordPosition (c) { c.data.newPos = c.elm.getBoundingClientRect(); } function applyTranslation (c) { var oldPos = c.data.pos; var newPos = c.data.newPos; var dx = oldPos.left - newPos.left; var dy = oldPos.top - newPos.top; if (dx || dy) { c.data.moved = true; var s = c.elm.style; s.transform = s.WebkitTransform = "translate(" + dx + "px," + dy + "px)"; s.transitionDuration = '0s'; } } var platformComponents = { Transition: Transition, TransitionGroup: TransitionGroup }; /* */ // install platform specific utils Vue$3.config.mustUseProp = mustUseProp; Vue$3.config.isReservedTag = isReservedTag; Vue$3.config.isReservedAttr = isReservedAttr; Vue$3.config.getTagNamespace = getTagNamespace; Vue$3.config.isUnknownElement = isUnknownElement; // install platform runtime directives & components extend(Vue$3.options.directives, platformDirectives); extend(Vue$3.options.components, platformComponents); // install platform patch function Vue$3.prototype.__patch__ = inBrowser ? patch : noop; // public mount method Vue$3.prototype.$mount = function ( el, hydrating ) { el = el && inBrowser ? query(el) : undefined; return mountComponent(this, el, hydrating) }; // devtools global hook /* istanbul ignore next */ setTimeout(function () { if (config.devtools) { if (devtools) { devtools.emit('init', Vue$3); } else if ("development" !== 'production' && isChrome) { console[console.info ? 'info' : 'log']( 'Download the Vue Devtools extension for a better development experience:\n' + 'https://github.com/vuejs/vue-devtools' ); } } if ("development" !== 'production' && config.productionTip !== false && inBrowser && typeof console !== 'undefined' ) { console[console.info ? 'info' : 'log']( "You are running Vue in development mode.\n" + "Make sure to turn on production mode when deploying for production.\n" + "See more tips at https://vuejs.org/guide/deployment.html" ); } }, 0); /* */ // check whether current browser encodes a char inside attribute values function shouldDecode (content, encoded) { var div = document.createElement('div'); div.innerHTML = "<div a=\"" + content + "\"/>"; return div.innerHTML.indexOf(encoded) > 0 } // #3663 // IE encodes newlines inside attribute values while other browsers don't var shouldDecodeNewlines = inBrowser ? shouldDecode('\n', '&#10;') : false; /* */ var defaultTagRE = /\{\{((?:.|\n)+?)\}\}/g; var regexEscapeRE = /[-.*+?^${}()|[\]\/\\]/g; var buildRegex = cached(function (delimiters) { var open = delimiters[0].replace(regexEscapeRE, '\\$&'); var close = delimiters[1].replace(regexEscapeRE, '\\$&'); return new RegExp(open + '((?:.|\\n)+?)' + close, 'g') }); function parseText ( text, delimiters ) { var tagRE = delimiters ? buildRegex(delimiters) : defaultTagRE; if (!tagRE.test(text)) { return } var tokens = []; var lastIndex = tagRE.lastIndex = 0; var match, index; while ((match = tagRE.exec(text))) { index = match.index; // push text token if (index > lastIndex) { tokens.push(JSON.stringify(text.slice(lastIndex, index))); } // tag token var exp = parseFilters(match[1].trim()); tokens.push(("_s(" + exp + ")")); lastIndex = index + match[0].length; } if (lastIndex < text.length) { tokens.push(JSON.stringify(text.slice(lastIndex))); } return tokens.join('+') } /* */ function transformNode (el, options) { var warn = options.warn || baseWarn; var staticClass = getAndRemoveAttr(el, 'class'); if ("development" !== 'production' && staticClass) { var expression = parseText(staticClass, options.delimiters); if (expression) { warn( "class=\"" + staticClass + "\": " + 'Interpolation inside attributes has been removed. ' + 'Use v-bind or the colon shorthand instead. For example, ' + 'instead of <div class="{{ val }}">, use <div :class="val">.' ); } } if (staticClass) { el.staticClass = JSON.stringify(staticClass); } var classBinding = getBindingAttr(el, 'class', false /* getStatic */); if (classBinding) { el.classBinding = classBinding; } } function genData (el) { var data = ''; if (el.staticClass) { data += "staticClass:" + (el.staticClass) + ","; } if (el.classBinding) { data += "class:" + (el.classBinding) + ","; } return data } var klass$1 = { staticKeys: ['staticClass'], transformNode: transformNode, genData: genData }; /* */ function transformNode$1 (el, options) { var warn = options.warn || baseWarn; var staticStyle = getAndRemoveAttr(el, 'style'); if (staticStyle) { /* istanbul ignore if */ if (true) { var expression = parseText(staticStyle, options.delimiters); if (expression) { warn( "style=\"" + staticStyle + "\": " + 'Interpolation inside attributes has been removed. ' + 'Use v-bind or the colon shorthand instead. For example, ' + 'instead of <div style="{{ val }}">, use <div :style="val">.' ); } } el.staticStyle = JSON.stringify(parseStyleText(staticStyle)); } var styleBinding = getBindingAttr(el, 'style', false /* getStatic */); if (styleBinding) { el.styleBinding = styleBinding; } } function genData$1 (el) { var data = ''; if (el.staticStyle) { data += "staticStyle:" + (el.staticStyle) + ","; } if (el.styleBinding) { data += "style:(" + (el.styleBinding) + "),"; } return data } var style$1 = { staticKeys: ['staticStyle'], transformNode: transformNode$1, genData: genData$1 }; var modules$1 = [ klass$1, style$1 ]; /* */ function text (el, dir) { if (dir.value) { addProp(el, 'textContent', ("_s(" + (dir.value) + ")")); } } /* */ function html (el, dir) { if (dir.value) { addProp(el, 'innerHTML', ("_s(" + (dir.value) + ")")); } } var directives$1 = { model: model, text: text, html: html }; /* */ var isUnaryTag = makeMap( 'area,base,br,col,embed,frame,hr,img,input,isindex,keygen,' + 'link,meta,param,source,track,wbr' ); // Elements that you can, intentionally, leave open // (and which close themselves) var canBeLeftOpenTag = makeMap( 'colgroup,dd,dt,li,options,p,td,tfoot,th,thead,tr,source' ); // HTML5 tags https://html.spec.whatwg.org/multipage/indices.html#elements-3 // Phrasing Content https://html.spec.whatwg.org/multipage/dom.html#phrasing-content var isNonPhrasingTag = makeMap( 'address,article,aside,base,blockquote,body,caption,col,colgroup,dd,' + 'details,dialog,div,dl,dt,fieldset,figcaption,figure,footer,form,' + 'h1,h2,h3,h4,h5,h6,head,header,hgroup,hr,html,legend,li,menuitem,meta,' + 'optgroup,option,param,rp,rt,source,style,summary,tbody,td,tfoot,th,thead,' + 'title,tr,track' ); /* */ var baseOptions = { expectHTML: true, modules: modules$1, directives: directives$1, isPreTag: isPreTag, isUnaryTag: isUnaryTag, mustUseProp: mustUseProp, canBeLeftOpenTag: canBeLeftOpenTag, isReservedTag: isReservedTag, getTagNamespace: getTagNamespace, staticKeys: genStaticKeys(modules$1) }; /* */ var decoder; var he = { decode: function decode (html) { decoder = decoder || document.createElement('div'); decoder.innerHTML = html; return decoder.textContent } }; /** * Not type-checking this file because it's mostly vendor code. */ /*! * HTML Parser By John Resig (ejohn.org) * Modified by Juriy "kangax" Zaytsev * Original code by Erik Arvidsson, Mozilla Public License * http://erik.eae.net/simplehtmlparser/simplehtmlparser.js */ // Regular Expressions for parsing tags and attributes var singleAttrIdentifier = /([^\s"'<>/=]+)/; var singleAttrAssign = /(?:=)/; var singleAttrValues = [ // attr value double quotes /"([^"]*)"+/.source, // attr value, single quotes /'([^']*)'+/.source, // attr value, no quotes /([^\s"'=<>`]+)/.source ]; var attribute = new RegExp( '^\\s*' + singleAttrIdentifier.source + '(?:\\s*(' + singleAttrAssign.source + ')' + '\\s*(?:' + singleAttrValues.join('|') + '))?' ); // could use https://www.w3.org/TR/1999/REC-xml-names-19990114/#NT-QName // but for Vue templates we can enforce a simple charset var ncname = '[a-zA-Z_][\\w\\-\\.]*'; var qnameCapture = '((?:' + ncname + '\\:)?' + ncname + ')'; var startTagOpen = new RegExp('^<' + qnameCapture); var startTagClose = /^\s*(\/?)>/; var endTag = new RegExp('^<\\/' + qnameCapture + '[^>]*>'); var doctype = /^<!DOCTYPE [^>]+>/i; var comment = /^<!--/; var conditionalComment = /^<!\[/; var IS_REGEX_CAPTURING_BROKEN = false; 'x'.replace(/x(.)?/g, function (m, g) { IS_REGEX_CAPTURING_BROKEN = g === ''; }); // Special Elements (can contain anything) var isPlainTextElement = makeMap('script,style,textarea', true); var reCache = {}; var decodingMap = { '&lt;': '<', '&gt;': '>', '&quot;': '"', '&amp;': '&', '&#10;': '\n' }; var encodedAttr = /&(?:lt|gt|quot|amp);/g; var encodedAttrWithNewLines = /&(?:lt|gt|quot|amp|#10);/g; // #5992 var isIgnoreNewlineTag = makeMap('pre,textarea', true); var shouldIgnoreFirstNewline = function (tag, html) { return tag && isIgnoreNewlineTag(tag) && html[0] === '\n'; }; function decodeAttr (value, shouldDecodeNewlines) { var re = shouldDecodeNewlines ? encodedAttrWithNewLines : encodedAttr; return value.replace(re, function (match) { return decodingMap[match]; }) } function parseHTML (html, options) { var stack = []; var expectHTML = options.expectHTML; var isUnaryTag$$1 = options.isUnaryTag || no; var canBeLeftOpenTag$$1 = options.canBeLeftOpenTag || no; var index = 0; var last, lastTag; while (html) { last = html; // Make sure we're not in a plaintext content element like script/style if (!lastTag || !isPlainTextElement(lastTag)) { var textEnd = html.indexOf('<'); if (textEnd === 0) { // Comment: if (comment.test(html)) { var commentEnd = html.indexOf('-->'); if (commentEnd >= 0) { if (options.shouldKeepComment) { options.comment(html.substring(4, commentEnd)); } advance(commentEnd + 3); continue } } // http://en.wikipedia.org/wiki/Conditional_comment#Downlevel-revealed_conditional_comment if (conditionalComment.test(html)) { var conditionalEnd = html.indexOf(']>'); if (conditionalEnd >= 0) { advance(conditionalEnd + 2); continue } } // Doctype: var doctypeMatch = html.match(doctype); if (doctypeMatch) { advance(doctypeMatch[0].length); continue } // End tag: var endTagMatch = html.match(endTag); if (endTagMatch) { var curIndex = index; advance(endTagMatch[0].length); parseEndTag(endTagMatch[1], curIndex, index); continue } // Start tag: var startTagMatch = parseStartTag(); if (startTagMatch) { handleStartTag(startTagMatch); if (shouldIgnoreFirstNewline(lastTag, html)) { advance(1); } continue } } var text = (void 0), rest = (void 0), next = (void 0); if (textEnd >= 0) { rest = html.slice(textEnd); while ( !endTag.test(rest) && !startTagOpen.test(rest) && !comment.test(rest) && !conditionalComment.test(rest) ) { // < in plain text, be forgiving and treat it as text next = rest.indexOf('<', 1); if (next < 0) { break } textEnd += next; rest = html.slice(textEnd); } text = html.substring(0, textEnd); advance(textEnd); } if (textEnd < 0) { text = html; html = ''; } if (options.chars && text) { options.chars(text); } } else { var endTagLength = 0; var stackedTag = lastTag.toLowerCase(); var reStackedTag = reCache[stackedTag] || (reCache[stackedTag] = new RegExp('([\\s\\S]*?)(</' + stackedTag + '[^>]*>)', 'i')); var rest$1 = html.replace(reStackedTag, function (all, text, endTag) { endTagLength = endTag.length; if (!isPlainTextElement(stackedTag) && stackedTag !== 'noscript') { text = text .replace(/<!--([\s\S]*?)-->/g, '$1') .replace(/<!\[CDATA\[([\s\S]*?)]]>/g, '$1'); } if (shouldIgnoreFirstNewline(stackedTag, text)) { text = text.slice(1); } if (options.chars) { options.chars(text); } return '' }); index += html.length - rest$1.length; html = rest$1; parseEndTag(stackedTag, index - endTagLength, index); } if (html === last) { options.chars && options.chars(html); if ("development" !== 'production' && !stack.length && options.warn) { options.warn(("Mal-formatted tag at end of template: \"" + html + "\"")); } break } } // Clean up any remaining tags parseEndTag(); function advance (n) { index += n; html = html.substring(n); } function parseStartTag () { var start = html.match(startTagOpen); if (start) { var match = { tagName: start[1], attrs: [], start: index }; advance(start[0].length); var end, attr; while (!(end = html.match(startTagClose)) && (attr = html.match(attribute))) { advance(attr[0].length); match.attrs.push(attr); } if (end) { match.unarySlash = end[1]; advance(end[0].length); match.end = index; return match } } } function handleStartTag (match) { var tagName = match.tagName; var unarySlash = match.unarySlash; if (expectHTML) { if (lastTag === 'p' && isNonPhrasingTag(tagName)) { parseEndTag(lastTag); } if (canBeLeftOpenTag$$1(tagName) && lastTag === tagName) { parseEndTag(tagName); } } var unary = isUnaryTag$$1(tagName) || !!unarySlash; var l = match.attrs.length; var attrs = new Array(l); for (var i = 0; i < l; i++) { var args = match.attrs[i]; // hackish work around FF bug https://bugzilla.mozilla.org/show_bug.cgi?id=369778 if (IS_REGEX_CAPTURING_BROKEN && args[0].indexOf('""') === -1) { if (args[3] === '') { delete args[3]; } if (args[4] === '') { delete args[4]; } if (args[5] === '') { delete args[5]; } } var value = args[3] || args[4] || args[5] || ''; attrs[i] = { name: args[1], value: decodeAttr( value, options.shouldDecodeNewlines ) }; } if (!unary) { stack.push({ tag: tagName, lowerCasedTag: tagName.toLowerCase(), attrs: attrs }); lastTag = tagName; } if (options.start) { options.start(tagName, attrs, unary, match.start, match.end); } } function parseEndTag (tagName, start, end) { var pos, lowerCasedTagName; if (start == null) { start = index; } if (end == null) { end = index; } if (tagName) { lowerCasedTagName = tagName.toLowerCase(); } // Find the closest opened tag of the same type if (tagName) { for (pos = stack.length - 1; pos >= 0; pos--) { if (stack[pos].lowerCasedTag === lowerCasedTagName) { break } } } else { // If no tag name is provided, clean shop pos = 0; } if (pos >= 0) { // Close all the open elements, up the stack for (var i = stack.length - 1; i >= pos; i--) { if ("development" !== 'production' && (i > pos || !tagName) && options.warn ) { options.warn( ("tag <" + (stack[i].tag) + "> has no matching end tag.") ); } if (options.end) { options.end(stack[i].tag, start, end); } } // Remove the open elements from the stack stack.length = pos; lastTag = pos && stack[pos - 1].tag; } else if (lowerCasedTagName === 'br') { if (options.start) { options.start(tagName, [], true, start, end); } } else if (lowerCasedTagName === 'p') { if (options.start) { options.start(tagName, [], false, start, end); } if (options.end) { options.end(tagName, start, end); } } } } /* */ var onRE = /^@|^v-on:/; var dirRE = /^v-|^@|^:/; var forAliasRE = /(.*?)\s+(?:in|of)\s+(.*)/; var forIteratorRE = /\((\{[^}]*\}|[^,]*),([^,]*)(?:,([^,]*))?\)/; var argRE = /:(.*)$/; var bindRE = /^:|^v-bind:/; var modifierRE = /\.[^.]+/g; var decodeHTMLCached = cached(he.decode); // configurable state var warn$2; var delimiters; var transforms; var preTransforms; var postTransforms; var platformIsPreTag; var platformMustUseProp; var platformGetTagNamespace; /** * Convert HTML string to AST. */ function parse ( template, options ) { warn$2 = options.warn || baseWarn; platformIsPreTag = options.isPreTag || no; platformMustUseProp = options.mustUseProp || no; platformGetTagNamespace = options.getTagNamespace || no; transforms = pluckModuleFunction(options.modules, 'transformNode'); preTransforms = pluckModuleFunction(options.modules, 'preTransformNode'); postTransforms = pluckModuleFunction(options.modules, 'postTransformNode'); delimiters = options.delimiters; var stack = []; var preserveWhitespace = options.preserveWhitespace !== false; var root; var currentParent; var inVPre = false; var inPre = false; var warned = false; function warnOnce (msg) { if (!warned) { warned = true; warn$2(msg); } } function endPre (element) { // check pre state if (element.pre) { inVPre = false; } if (platformIsPreTag(element.tag)) { inPre = false; } } parseHTML(template, { warn: warn$2, expectHTML: options.expectHTML, isUnaryTag: options.isUnaryTag, canBeLeftOpenTag: options.canBeLeftOpenTag, shouldDecodeNewlines: options.shouldDecodeNewlines, shouldKeepComment: options.comments, start: function start (tag, attrs, unary) { // check namespace. // inherit parent ns if there is one var ns = (currentParent && currentParent.ns) || platformGetTagNamespace(tag); // handle IE svg bug /* istanbul ignore if */ if (isIE && ns === 'svg') { attrs = guardIESVGBug(attrs); } var element = { type: 1, tag: tag, attrsList: attrs, attrsMap: makeAttrsMap(attrs), parent: currentParent, children: [] }; if (ns) { element.ns = ns; } if (isForbiddenTag(element) && !isServerRendering()) { element.forbidden = true; "development" !== 'production' && warn$2( 'Templates should only be responsible for mapping the state to the ' + 'UI. Avoid placing tags with side-effects in your templates, such as ' + "<" + tag + ">" + ', as they will not be parsed.' ); } // apply pre-transforms for (var i = 0; i < preTransforms.length; i++) { preTransforms[i](element, options); } if (!inVPre) { processPre(element); if (element.pre) { inVPre = true; } } if (platformIsPreTag(element.tag)) { inPre = true; } if (inVPre) { processRawAttrs(element); } else { processFor(element); processIf(element); processOnce(element); processKey(element); // determine whether this is a plain element after // removing structural attributes element.plain = !element.key && !attrs.length; processRef(element); processSlot(element); processComponent(element); for (var i$1 = 0; i$1 < transforms.length; i$1++) { transforms[i$1](element, options); } processAttrs(element); } function checkRootConstraints (el) { if (true) { if (el.tag === 'slot' || el.tag === 'template') { warnOnce( "Cannot use <" + (el.tag) + "> as component root element because it may " + 'contain multiple nodes.' ); } if (el.attrsMap.hasOwnProperty('v-for')) { warnOnce( 'Cannot use v-for on stateful component root element because ' + 'it renders multiple elements.' ); } } } // tree management if (!root) { root = element; checkRootConstraints(root); } else if (!stack.length) { // allow root elements with v-if, v-else-if and v-else if (root.if && (element.elseif || element.else)) { checkRootConstraints(element); addIfCondition(root, { exp: element.elseif, block: element }); } else if (true) { warnOnce( "Component template should contain exactly one root element. " + "If you are using v-if on multiple elements, " + "use v-else-if to chain them instead." ); } } if (currentParent && !element.forbidden) { if (element.elseif || element.else) { processIfConditions(element, currentParent); } else if (element.slotScope) { // scoped slot currentParent.plain = false; var name = element.slotTarget || '"default"';(currentParent.scopedSlots || (currentParent.scopedSlots = {}))[name] = element; } else { currentParent.children.push(element); element.parent = currentParent; } } if (!unary) { currentParent = element; stack.push(element); } else { endPre(element); } // apply post-transforms for (var i$2 = 0; i$2 < postTransforms.length; i$2++) { postTransforms[i$2](element, options); } }, end: function end () { // remove trailing whitespace var element = stack[stack.length - 1]; var lastNode = element.children[element.children.length - 1]; if (lastNode && lastNode.type === 3 && lastNode.text === ' ' && !inPre) { element.children.pop(); } // pop stack stack.length -= 1; currentParent = stack[stack.length - 1]; endPre(element); }, chars: function chars (text) { if (!currentParent) { if (true) { if (text === template) { warnOnce( 'Component template requires a root element, rather than just text.' ); } else if ((text = text.trim())) { warnOnce( ("text \"" + text + "\" outside root element will be ignored.") ); } } return } // IE textarea placeholder bug /* istanbul ignore if */ if (isIE && currentParent.tag === 'textarea' && currentParent.attrsMap.placeholder === text ) { return } var children = currentParent.children; text = inPre || text.trim() ? isTextTag(currentParent) ? text : decodeHTMLCached(text) // only preserve whitespace if its not right after a starting tag : preserveWhitespace && children.length ? ' ' : ''; if (text) { var expression; if (!inVPre && text !== ' ' && (expression = parseText(text, delimiters))) { children.push({ type: 2, expression: expression, text: text }); } else if (text !== ' ' || !children.length || children[children.length - 1].text !== ' ') { children.push({ type: 3, text: text }); } } }, comment: function comment (text) { currentParent.children.push({ type: 3, text: text, isComment: true }); } }); return root } function processPre (el) { if (getAndRemoveAttr(el, 'v-pre') != null) { el.pre = true; } } function processRawAttrs (el) { var l = el.attrsList.length; if (l) { var attrs = el.attrs = new Array(l); for (var i = 0; i < l; i++) { attrs[i] = { name: el.attrsList[i].name, value: JSON.stringify(el.attrsList[i].value) }; } } else if (!el.pre) { // non root node in pre blocks with no attributes el.plain = true; } } function processKey (el) { var exp = getBindingAttr(el, 'key'); if (exp) { if ("development" !== 'production' && el.tag === 'template') { warn$2("<template> cannot be keyed. Place the key on real elements instead."); } el.key = exp; } } function processRef (el) { var ref = getBindingAttr(el, 'ref'); if (ref) { el.ref = ref; el.refInFor = checkInFor(el); } } function processFor (el) { var exp; if ((exp = getAndRemoveAttr(el, 'v-for'))) { var inMatch = exp.match(forAliasRE); if (!inMatch) { "development" !== 'production' && warn$2( ("Invalid v-for expression: " + exp) ); return } el.for = inMatch[2].trim(); var alias = inMatch[1].trim(); var iteratorMatch = alias.match(forIteratorRE); if (iteratorMatch) { el.alias = iteratorMatch[1].trim(); el.iterator1 = iteratorMatch[2].trim(); if (iteratorMatch[3]) { el.iterator2 = iteratorMatch[3].trim(); } } else { el.alias = alias; } } } function processIf (el) { var exp = getAndRemoveAttr(el, 'v-if'); if (exp) { el.if = exp; addIfCondition(el, { exp: exp, block: el }); } else { if (getAndRemoveAttr(el, 'v-else') != null) { el.else = true; } var elseif = getAndRemoveAttr(el, 'v-else-if'); if (elseif) { el.elseif = elseif; } } } function processIfConditions (el, parent) { var prev = findPrevElement(parent.children); if (prev && prev.if) { addIfCondition(prev, { exp: el.elseif, block: el }); } else if (true) { warn$2( "v-" + (el.elseif ? ('else-if="' + el.elseif + '"') : 'else') + " " + "used on element <" + (el.tag) + "> without corresponding v-if." ); } } function findPrevElement (children) { var i = children.length; while (i--) { if (children[i].type === 1) { return children[i] } else { if ("development" !== 'production' && children[i].text !== ' ') { warn$2( "text \"" + (children[i].text.trim()) + "\" between v-if and v-else(-if) " + "will be ignored." ); } children.pop(); } } } function addIfCondition (el, condition) { if (!el.ifConditions) { el.ifConditions = []; } el.ifConditions.push(condition); } function processOnce (el) { var once$$1 = getAndRemoveAttr(el, 'v-once'); if (once$$1 != null) { el.once = true; } } function processSlot (el) { if (el.tag === 'slot') { el.slotName = getBindingAttr(el, 'name'); if ("development" !== 'production' && el.key) { warn$2( "`key` does not work on <slot> because slots are abstract outlets " + "and can possibly expand into multiple elements. " + "Use the key on a wrapping element instead." ); } } else { var slotTarget = getBindingAttr(el, 'slot'); if (slotTarget) { el.slotTarget = slotTarget === '""' ? '"default"' : slotTarget; } if (el.tag === 'template') { el.slotScope = getAndRemoveAttr(el, 'scope'); } } } function processComponent (el) { var binding; if ((binding = getBindingAttr(el, 'is'))) { el.component = binding; } if (getAndRemoveAttr(el, 'inline-template') != null) { el.inlineTemplate = true; } } function processAttrs (el) { var list = el.attrsList; var i, l, name, rawName, value, modifiers, isProp; for (i = 0, l = list.length; i < l; i++) { name = rawName = list[i].name; value = list[i].value; if (dirRE.test(name)) { // mark element as dynamic el.hasBindings = true; // modifiers modifiers = parseModifiers(name); if (modifiers) { name = name.replace(modifierRE, ''); } if (bindRE.test(name)) { // v-bind name = name.replace(bindRE, ''); value = parseFilters(value); isProp = false; if (modifiers) { if (modifiers.prop) { isProp = true; name = camelize(name); if (name === 'innerHtml') { name = 'innerHTML'; } } if (modifiers.camel) { name = camelize(name); } if (modifiers.sync) { addHandler( el, ("update:" + (camelize(name))), genAssignmentCode(value, "$event") ); } } if (isProp || ( !el.component && platformMustUseProp(el.tag, el.attrsMap.type, name) )) { addProp(el, name, value); } else { addAttr(el, name, value); } } else if (onRE.test(name)) { // v-on name = name.replace(onRE, ''); addHandler(el, name, value, modifiers, false, warn$2); } else { // normal directives name = name.replace(dirRE, ''); // parse arg var argMatch = name.match(argRE); var arg = argMatch && argMatch[1]; if (arg) { name = name.slice(0, -(arg.length + 1)); } addDirective(el, name, rawName, value, arg, modifiers); if ("development" !== 'production' && name === 'model') { checkForAliasModel(el, value); } } } else { // literal attribute if (true) { var expression = parseText(value, delimiters); if (expression) { warn$2( name + "=\"" + value + "\": " + 'Interpolation inside attributes has been removed. ' + 'Use v-bind or the colon shorthand instead. For example, ' + 'instead of <div id="{{ val }}">, use <div :id="val">.' ); } } addAttr(el, name, JSON.stringify(value)); } } } function checkInFor (el) { var parent = el; while (parent) { if (parent.for !== undefined) { return true } parent = parent.parent; } return false } function parseModifiers (name) { var match = name.match(modifierRE); if (match) { var ret = {}; match.forEach(function (m) { ret[m.slice(1)] = true; }); return ret } } function makeAttrsMap (attrs) { var map = {}; for (var i = 0, l = attrs.length; i < l; i++) { if ( "development" !== 'production' && map[attrs[i].name] && !isIE && !isEdge ) { warn$2('duplicate attribute: ' + attrs[i].name); } map[attrs[i].name] = attrs[i].value; } return map } // for script (e.g. type="x/template") or style, do not decode content function isTextTag (el) { return el.tag === 'script' || el.tag === 'style' } function isForbiddenTag (el) { return ( el.tag === 'style' || (el.tag === 'script' && ( !el.attrsMap.type || el.attrsMap.type === 'text/javascript' )) ) } var ieNSBug = /^xmlns:NS\d+/; var ieNSPrefix = /^NS\d+:/; /* istanbul ignore next */ function guardIESVGBug (attrs) { var res = []; for (var i = 0; i < attrs.length; i++) { var attr = attrs[i]; if (!ieNSBug.test(attr.name)) { attr.name = attr.name.replace(ieNSPrefix, ''); res.push(attr); } } return res } function checkForAliasModel (el, value) { var _el = el; while (_el) { if (_el.for && _el.alias === value) { warn$2( "<" + (el.tag) + " v-model=\"" + value + "\">: " + "You are binding v-model directly to a v-for iteration alias. " + "This will not be able to modify the v-for source array because " + "writing to the alias is like modifying a function local variable. " + "Consider using an array of objects and use v-model on an object property instead." ); } _el = _el.parent; } } /* */ var isStaticKey; var isPlatformReservedTag; var genStaticKeysCached = cached(genStaticKeys$1); /** * Goal of the optimizer: walk the generated template AST tree * and detect sub-trees that are purely static, i.e. parts of * the DOM that never needs to change. * * Once we detect these sub-trees, we can: * * 1. Hoist them into constants, so that we no longer need to * create fresh nodes for them on each re-render; * 2. Completely skip them in the patching process. */ function optimize (root, options) { if (!root) { return } isStaticKey = genStaticKeysCached(options.staticKeys || ''); isPlatformReservedTag = options.isReservedTag || no; // first pass: mark all non-static nodes. markStatic$1(root); // second pass: mark static roots. markStaticRoots(root, false); } function genStaticKeys$1 (keys) { return makeMap( 'type,tag,attrsList,attrsMap,plain,parent,children,attrs' + (keys ? ',' + keys : '') ) } function markStatic$1 (node) { node.static = isStatic(node); if (node.type === 1) { // do not make component slot content static. this avoids // 1. components not able to mutate slot nodes // 2. static slot content fails for hot-reloading if ( !isPlatformReservedTag(node.tag) && node.tag !== 'slot' && node.attrsMap['inline-template'] == null ) { return } for (var i = 0, l = node.children.length; i < l; i++) { var child = node.children[i]; markStatic$1(child); if (!child.static) { node.static = false; } } if (node.ifConditions) { for (var i$1 = 1, l$1 = node.ifConditions.length; i$1 < l$1; i$1++) { var block = node.ifConditions[i$1].block; markStatic$1(block); if (!block.static) { node.static = false; } } } } } function markStaticRoots (node, isInFor) { if (node.type === 1) { if (node.static || node.once) { node.staticInFor = isInFor; } // For a node to qualify as a static root, it should have children that // are not just static text. Otherwise the cost of hoisting out will // outweigh the benefits and it's better off to just always render it fresh. if (node.static && node.children.length && !( node.children.length === 1 && node.children[0].type === 3 )) { node.staticRoot = true; return } else { node.staticRoot = false; } if (node.children) { for (var i = 0, l = node.children.length; i < l; i++) { markStaticRoots(node.children[i], isInFor || !!node.for); } } if (node.ifConditions) { for (var i$1 = 1, l$1 = node.ifConditions.length; i$1 < l$1; i$1++) { markStaticRoots(node.ifConditions[i$1].block, isInFor); } } } } function isStatic (node) { if (node.type === 2) { // expression return false } if (node.type === 3) { // text return true } return !!(node.pre || ( !node.hasBindings && // no dynamic bindings !node.if && !node.for && // not v-if or v-for or v-else !isBuiltInTag(node.tag) && // not a built-in isPlatformReservedTag(node.tag) && // not a component !isDirectChildOfTemplateFor(node) && Object.keys(node).every(isStaticKey) )) } function isDirectChildOfTemplateFor (node) { while (node.parent) { node = node.parent; if (node.tag !== 'template') { return false } if (node.for) { return true } } return false } /* */ var fnExpRE = /^\s*([\w$_]+|\([^)]*?\))\s*=>|^function\s*\(/; var simplePathRE = /^\s*[A-Za-z_$][\w$]*(?:\.[A-Za-z_$][\w$]*|\['.*?']|\[".*?"]|\[\d+]|\[[A-Za-z_$][\w$]*])*\s*$/; // keyCode aliases var keyCodes = { esc: 27, tab: 9, enter: 13, space: 32, up: 38, left: 37, right: 39, down: 40, 'delete': [8, 46] }; // #4868: modifiers that prevent the execution of the listener // need to explicitly return null so that we can determine whether to remove // the listener for .once var genGuard = function (condition) { return ("if(" + condition + ")return null;"); }; var modifierCode = { stop: '$event.stopPropagation();', prevent: '$event.preventDefault();', self: genGuard("$event.target !== $event.currentTarget"), ctrl: genGuard("!$event.ctrlKey"), shift: genGuard("!$event.shiftKey"), alt: genGuard("!$event.altKey"), meta: genGuard("!$event.metaKey"), left: genGuard("'button' in $event && $event.button !== 0"), middle: genGuard("'button' in $event && $event.button !== 1"), right: genGuard("'button' in $event && $event.button !== 2") }; function genHandlers ( events, isNative, warn ) { var res = isNative ? 'nativeOn:{' : 'on:{'; for (var name in events) { var handler = events[name]; // #5330: warn click.right, since right clicks do not actually fire click events. if ("development" !== 'production' && name === 'click' && handler && handler.modifiers && handler.modifiers.right ) { warn( "Use \"contextmenu\" instead of \"click.right\" since right clicks " + "do not actually fire \"click\" events." ); } res += "\"" + name + "\":" + (genHandler(name, handler)) + ","; } return res.slice(0, -1) + '}' } function genHandler ( name, handler ) { if (!handler) { return 'function(){}' } if (Array.isArray(handler)) { return ("[" + (handler.map(function (handler) { return genHandler(name, handler); }).join(',')) + "]") } var isMethodPath = simplePathRE.test(handler.value); var isFunctionExpression = fnExpRE.test(handler.value); if (!handler.modifiers) { return isMethodPath || isFunctionExpression ? handler.value : ("function($event){" + (handler.value) + "}") // inline statement } else { var code = ''; var genModifierCode = ''; var keys = []; for (var key in handler.modifiers) { if (modifierCode[key]) { genModifierCode += modifierCode[key]; // left/right if (keyCodes[key]) { keys.push(key); } } else { keys.push(key); } } if (keys.length) { code += genKeyFilter(keys); } // Make sure modifiers like prevent and stop get executed after key filtering if (genModifierCode) { code += genModifierCode; } var handlerCode = isMethodPath ? handler.value + '($event)' : isFunctionExpression ? ("(" + (handler.value) + ")($event)") : handler.value; return ("function($event){" + code + handlerCode + "}") } } function genKeyFilter (keys) { return ("if(!('button' in $event)&&" + (keys.map(genFilterCode).join('&&')) + ")return null;") } function genFilterCode (key) { var keyVal = parseInt(key, 10); if (keyVal) { return ("$event.keyCode!==" + keyVal) } var alias = keyCodes[key]; return ("_k($event.keyCode," + (JSON.stringify(key)) + (alias ? ',' + JSON.stringify(alias) : '') + ")") } /* */ function on (el, dir) { if ("development" !== 'production' && dir.modifiers) { warn("v-on without argument does not support modifiers."); } el.wrapListeners = function (code) { return ("_g(" + code + "," + (dir.value) + ")"); }; } /* */ function bind$1 (el, dir) { el.wrapData = function (code) { return ("_b(" + code + ",'" + (el.tag) + "'," + (dir.value) + "," + (dir.modifiers && dir.modifiers.prop ? 'true' : 'false') + (dir.modifiers && dir.modifiers.sync ? ',true' : '') + ")") }; } /* */ var baseDirectives = { on: on, bind: bind$1, cloak: noop }; /* */ var CodegenState = function CodegenState (options) { this.options = options; this.warn = options.warn || baseWarn; this.transforms = pluckModuleFunction(options.modules, 'transformCode'); this.dataGenFns = pluckModuleFunction(options.modules, 'genData'); this.directives = extend(extend({}, baseDirectives), options.directives); var isReservedTag = options.isReservedTag || no; this.maybeComponent = function (el) { return !isReservedTag(el.tag); }; this.onceId = 0; this.staticRenderFns = []; }; function generate ( ast, options ) { var state = new CodegenState(options); var code = ast ? genElement(ast, state) : '_c("div")'; return { render: ("with(this){return " + code + "}"), staticRenderFns: state.staticRenderFns } } function genElement (el, state) { if (el.staticRoot && !el.staticProcessed) { return genStatic(el, state) } else if (el.once && !el.onceProcessed) { return genOnce(el, state) } else if (el.for && !el.forProcessed) { return genFor(el, state) } else if (el.if && !el.ifProcessed) { return genIf(el, state) } else if (el.tag === 'template' && !el.slotTarget) { return genChildren(el, state) || 'void 0' } else if (el.tag === 'slot') { return genSlot(el, state) } else { // component or element var code; if (el.component) { code = genComponent(el.component, el, state); } else { var data = el.plain ? undefined : genData$2(el, state); var children = el.inlineTemplate ? null : genChildren(el, state, true); code = "_c('" + (el.tag) + "'" + (data ? ("," + data) : '') + (children ? ("," + children) : '') + ")"; } // module transforms for (var i = 0; i < state.transforms.length; i++) { code = state.transforms[i](el, code); } return code } } // hoist static sub-trees out function genStatic (el, state) { el.staticProcessed = true; state.staticRenderFns.push(("with(this){return " + (genElement(el, state)) + "}")); return ("_m(" + (state.staticRenderFns.length - 1) + (el.staticInFor ? ',true' : '') + ")") } // v-once function genOnce (el, state) { el.onceProcessed = true; if (el.if && !el.ifProcessed) { return genIf(el, state) } else if (el.staticInFor) { var key = ''; var parent = el.parent; while (parent) { if (parent.for) { key = parent.key; break } parent = parent.parent; } if (!key) { "development" !== 'production' && state.warn( "v-once can only be used inside v-for that is keyed. " ); return genElement(el, state) } return ("_o(" + (genElement(el, state)) + "," + (state.onceId++) + (key ? ("," + key) : "") + ")") } else { return genStatic(el, state) } } function genIf ( el, state, altGen, altEmpty ) { el.ifProcessed = true; // avoid recursion return genIfConditions(el.ifConditions.slice(), state, altGen, altEmpty) } function genIfConditions ( conditions, state, altGen, altEmpty ) { if (!conditions.length) { return altEmpty || '_e()' } var condition = conditions.shift(); if (condition.exp) { return ("(" + (condition.exp) + ")?" + (genTernaryExp(condition.block)) + ":" + (genIfConditions(conditions, state, altGen, altEmpty))) } else { return ("" + (genTernaryExp(condition.block))) } // v-if with v-once should generate code like (a)?_m(0):_m(1) function genTernaryExp (el) { return altGen ? altGen(el, state) : el.once ? genOnce(el, state) : genElement(el, state) } } function genFor ( el, state, altGen, altHelper ) { var exp = el.for; var alias = el.alias; var iterator1 = el.iterator1 ? ("," + (el.iterator1)) : ''; var iterator2 = el.iterator2 ? ("," + (el.iterator2)) : ''; if ("development" !== 'production' && state.maybeComponent(el) && el.tag !== 'slot' && el.tag !== 'template' && !el.key ) { state.warn( "<" + (el.tag) + " v-for=\"" + alias + " in " + exp + "\">: component lists rendered with " + "v-for should have explicit keys. " + "See https://vuejs.org/guide/list.html#key for more info.", true /* tip */ ); } el.forProcessed = true; // avoid recursion return (altHelper || '_l') + "((" + exp + ")," + "function(" + alias + iterator1 + iterator2 + "){" + "return " + ((altGen || genElement)(el, state)) + '})' } function genData$2 (el, state) { var data = '{'; // directives first. // directives may mutate the el's other properties before they are generated. var dirs = genDirectives(el, state); if (dirs) { data += dirs + ','; } // key if (el.key) { data += "key:" + (el.key) + ","; } // ref if (el.ref) { data += "ref:" + (el.ref) + ","; } if (el.refInFor) { data += "refInFor:true,"; } // pre if (el.pre) { data += "pre:true,"; } // record original tag name for components using "is" attribute if (el.component) { data += "tag:\"" + (el.tag) + "\","; } // module data generation functions for (var i = 0; i < state.dataGenFns.length; i++) { data += state.dataGenFns[i](el); } // attributes if (el.attrs) { data += "attrs:{" + (genProps(el.attrs)) + "},"; } // DOM props if (el.props) { data += "domProps:{" + (genProps(el.props)) + "},"; } // event handlers if (el.events) { data += (genHandlers(el.events, false, state.warn)) + ","; } if (el.nativeEvents) { data += (genHandlers(el.nativeEvents, true, state.warn)) + ","; } // slot target if (el.slotTarget) { data += "slot:" + (el.slotTarget) + ","; } // scoped slots if (el.scopedSlots) { data += (genScopedSlots(el.scopedSlots, state)) + ","; } // component v-model if (el.model) { data += "model:{value:" + (el.model.value) + ",callback:" + (el.model.callback) + ",expression:" + (el.model.expression) + "},"; } // inline-template if (el.inlineTemplate) { var inlineTemplate = genInlineTemplate(el, state); if (inlineTemplate) { data += inlineTemplate + ","; } } data = data.replace(/,$/, '') + '}'; // v-bind data wrap if (el.wrapData) { data = el.wrapData(data); } // v-on data wrap if (el.wrapListeners) { data = el.wrapListeners(data); } return data } function genDirectives (el, state) { var dirs = el.directives; if (!dirs) { return } var res = 'directives:['; var hasRuntime = false; var i, l, dir, needRuntime; for (i = 0, l = dirs.length; i < l; i++) { dir = dirs[i]; needRuntime = true; var gen = state.directives[dir.name]; if (gen) { // compile-time directive that manipulates AST. // returns true if it also needs a runtime counterpart. needRuntime = !!gen(el, dir, state.warn); } if (needRuntime) { hasRuntime = true; res += "{name:\"" + (dir.name) + "\",rawName:\"" + (dir.rawName) + "\"" + (dir.value ? (",value:(" + (dir.value) + "),expression:" + (JSON.stringify(dir.value))) : '') + (dir.arg ? (",arg:\"" + (dir.arg) + "\"") : '') + (dir.modifiers ? (",modifiers:" + (JSON.stringify(dir.modifiers))) : '') + "},"; } } if (hasRuntime) { return res.slice(0, -1) + ']' } } function genInlineTemplate (el, state) { var ast = el.children[0]; if ("development" !== 'production' && ( el.children.length > 1 || ast.type !== 1 )) { state.warn('Inline-template components must have exactly one child element.'); } if (ast.type === 1) { var inlineRenderFns = generate(ast, state.options); return ("inlineTemplate:{render:function(){" + (inlineRenderFns.render) + "},staticRenderFns:[" + (inlineRenderFns.staticRenderFns.map(function (code) { return ("function(){" + code + "}"); }).join(',')) + "]}") } } function genScopedSlots ( slots, state ) { return ("scopedSlots:_u([" + (Object.keys(slots).map(function (key) { return genScopedSlot(key, slots[key], state) }).join(',')) + "])") } function genScopedSlot ( key, el, state ) { if (el.for && !el.forProcessed) { return genForScopedSlot(key, el, state) } return "{key:" + key + ",fn:function(" + (String(el.attrsMap.scope)) + "){" + "return " + (el.tag === 'template' ? genChildren(el, state) || 'void 0' : genElement(el, state)) + "}}" } function genForScopedSlot ( key, el, state ) { var exp = el.for; var alias = el.alias; var iterator1 = el.iterator1 ? ("," + (el.iterator1)) : ''; var iterator2 = el.iterator2 ? ("," + (el.iterator2)) : ''; el.forProcessed = true; // avoid recursion return "_l((" + exp + ")," + "function(" + alias + iterator1 + iterator2 + "){" + "return " + (genScopedSlot(key, el, state)) + '})' } function genChildren ( el, state, checkSkip, altGenElement, altGenNode ) { var children = el.children; if (children.length) { var el$1 = children[0]; // optimize single v-for if (children.length === 1 && el$1.for && el$1.tag !== 'template' && el$1.tag !== 'slot' ) { return (altGenElement || genElement)(el$1, state) } var normalizationType = checkSkip ? getNormalizationType(children, state.maybeComponent) : 0; var gen = altGenNode || genNode; return ("[" + (children.map(function (c) { return gen(c, state); }).join(',')) + "]" + (normalizationType ? ("," + normalizationType) : '')) } } // determine the normalization needed for the children array. // 0: no normalization needed // 1: simple normalization needed (possible 1-level deep nested array) // 2: full normalization needed function getNormalizationType ( children, maybeComponent ) { var res = 0; for (var i = 0; i < children.length; i++) { var el = children[i]; if (el.type !== 1) { continue } if (needsNormalization(el) || (el.ifConditions && el.ifConditions.some(function (c) { return needsNormalization(c.block); }))) { res = 2; break } if (maybeComponent(el) || (el.ifConditions && el.ifConditions.some(function (c) { return maybeComponent(c.block); }))) { res = 1; } } return res } function needsNormalization (el) { return el.for !== undefined || el.tag === 'template' || el.tag === 'slot' } function genNode (node, state) { if (node.type === 1) { return genElement(node, state) } if (node.type === 3 && node.isComment) { return genComment(node) } else { return genText(node) } } function genText (text) { return ("_v(" + (text.type === 2 ? text.expression // no need for () because already wrapped in _s() : transformSpecialNewlines(JSON.stringify(text.text))) + ")") } function genComment (comment) { return ("_e(" + (JSON.stringify(comment.text)) + ")") } function genSlot (el, state) { var slotName = el.slotName || '"default"'; var children = genChildren(el, state); var res = "_t(" + slotName + (children ? ("," + children) : ''); var attrs = el.attrs && ("{" + (el.attrs.map(function (a) { return ((camelize(a.name)) + ":" + (a.value)); }).join(',')) + "}"); var bind$$1 = el.attrsMap['v-bind']; if ((attrs || bind$$1) && !children) { res += ",null"; } if (attrs) { res += "," + attrs; } if (bind$$1) { res += (attrs ? '' : ',null') + "," + bind$$1; } return res + ')' } // componentName is el.component, take it as argument to shun flow's pessimistic refinement function genComponent ( componentName, el, state ) { var children = el.inlineTemplate ? null : genChildren(el, state, true); return ("_c(" + componentName + "," + (genData$2(el, state)) + (children ? ("," + children) : '') + ")") } function genProps (props) { var res = ''; for (var i = 0; i < props.length; i++) { var prop = props[i]; res += "\"" + (prop.name) + "\":" + (transformSpecialNewlines(prop.value)) + ","; } return res.slice(0, -1) } // #3895, #4268 function transformSpecialNewlines (text) { return text .replace(/\u2028/g, '\\u2028') .replace(/\u2029/g, '\\u2029') } /* */ // these keywords should not appear inside expressions, but operators like // typeof, instanceof and in are allowed var prohibitedKeywordRE = new RegExp('\\b' + ( 'do,if,for,let,new,try,var,case,else,with,await,break,catch,class,const,' + 'super,throw,while,yield,delete,export,import,return,switch,default,' + 'extends,finally,continue,debugger,function,arguments' ).split(',').join('\\b|\\b') + '\\b'); // these unary operators should not be used as property/method names var unaryOperatorsRE = new RegExp('\\b' + ( 'delete,typeof,void' ).split(',').join('\\s*\\([^\\)]*\\)|\\b') + '\\s*\\([^\\)]*\\)'); // check valid identifier for v-for var identRE = /[A-Za-z_$][\w$]*/; // strip strings in expressions var stripStringRE = /'(?:[^'\\]|\\.)*'|"(?:[^"\\]|\\.)*"|`(?:[^`\\]|\\.)*\$\{|\}(?:[^`\\]|\\.)*`|`(?:[^`\\]|\\.)*`/g; // detect problematic expressions in a template function detectErrors (ast) { var errors = []; if (ast) { checkNode(ast, errors); } return errors } function checkNode (node, errors) { if (node.type === 1) { for (var name in node.attrsMap) { if (dirRE.test(name)) { var value = node.attrsMap[name]; if (value) { if (name === 'v-for') { checkFor(node, ("v-for=\"" + value + "\""), errors); } else if (onRE.test(name)) { checkEvent(value, (name + "=\"" + value + "\""), errors); } else { checkExpression(value, (name + "=\"" + value + "\""), errors); } } } } if (node.children) { for (var i = 0; i < node.children.length; i++) { checkNode(node.children[i], errors); } } } else if (node.type === 2) { checkExpression(node.expression, node.text, errors); } } function checkEvent (exp, text, errors) { var stipped = exp.replace(stripStringRE, ''); var keywordMatch = stipped.match(unaryOperatorsRE); if (keywordMatch && stipped.charAt(keywordMatch.index - 1) !== '$') { errors.push( "avoid using JavaScript unary operator as property name: " + "\"" + (keywordMatch[0]) + "\" in expression " + (text.trim()) ); } checkExpression(exp, text, errors); } function checkFor (node, text, errors) { checkExpression(node.for || '', text, errors); checkIdentifier(node.alias, 'v-for alias', text, errors); checkIdentifier(node.iterator1, 'v-for iterator', text, errors); checkIdentifier(node.iterator2, 'v-for iterator', text, errors); } function checkIdentifier (ident, type, text, errors) { if (typeof ident === 'string' && !identRE.test(ident)) { errors.push(("invalid " + type + " \"" + ident + "\" in expression: " + (text.trim()))); } } function checkExpression (exp, text, errors) { try { new Function(("return " + exp)); } catch (e) { var keywordMatch = exp.replace(stripStringRE, '').match(prohibitedKeywordRE); if (keywordMatch) { errors.push( "avoid using JavaScript keyword as property name: " + "\"" + (keywordMatch[0]) + "\" in expression " + (text.trim()) ); } else { errors.push(("invalid expression: " + (text.trim()))); } } } /* */ function createFunction (code, errors) { try { return new Function(code) } catch (err) { errors.push({ err: err, code: code }); return noop } } function createCompileToFunctionFn (compile) { var cache = Object.create(null); return function compileToFunctions ( template, options, vm ) { options = options || {}; /* istanbul ignore if */ if (true) { // detect possible CSP restriction try { new Function('return 1'); } catch (e) { if (e.toString().match(/unsafe-eval|CSP/)) { warn( 'It seems you are using the standalone build of Vue.js in an ' + 'environment with Content Security Policy that prohibits unsafe-eval. ' + 'The template compiler cannot work in this environment. Consider ' + 'relaxing the policy to allow unsafe-eval or pre-compiling your ' + 'templates into render functions.' ); } } } // check cache var key = options.delimiters ? String(options.delimiters) + template : template; if (cache[key]) { return cache[key] } // compile var compiled = compile(template, options); // check compilation errors/tips if (true) { if (compiled.errors && compiled.errors.length) { warn( "Error compiling template:\n\n" + template + "\n\n" + compiled.errors.map(function (e) { return ("- " + e); }).join('\n') + '\n', vm ); } if (compiled.tips && compiled.tips.length) { compiled.tips.forEach(function (msg) { return tip(msg, vm); }); } } // turn code into functions var res = {}; var fnGenErrors = []; res.render = createFunction(compiled.render, fnGenErrors); res.staticRenderFns = compiled.staticRenderFns.map(function (code) { return createFunction(code, fnGenErrors) }); // check function generation errors. // this should only happen if there is a bug in the compiler itself. // mostly for codegen development use /* istanbul ignore if */ if (true) { if ((!compiled.errors || !compiled.errors.length) && fnGenErrors.length) { warn( "Failed to generate render function:\n\n" + fnGenErrors.map(function (ref) { var err = ref.err; var code = ref.code; return ((err.toString()) + " in\n\n" + code + "\n"); }).join('\n'), vm ); } } return (cache[key] = res) } } /* */ function createCompilerCreator (baseCompile) { return function createCompiler (baseOptions) { function compile ( template, options ) { var finalOptions = Object.create(baseOptions); var errors = []; var tips = []; finalOptions.warn = function (msg, tip) { (tip ? tips : errors).push(msg); }; if (options) { // merge custom modules if (options.modules) { finalOptions.modules = (baseOptions.modules || []).concat(options.modules); } // merge custom directives if (options.directives) { finalOptions.directives = extend( Object.create(baseOptions.directives), options.directives ); } // copy other options for (var key in options) { if (key !== 'modules' && key !== 'directives') { finalOptions[key] = options[key]; } } } var compiled = baseCompile(template, finalOptions); if (true) { errors.push.apply(errors, detectErrors(compiled.ast)); } compiled.errors = errors; compiled.tips = tips; return compiled } return { compile: compile, compileToFunctions: createCompileToFunctionFn(compile) } } } /* */ // `createCompilerCreator` allows creating compilers that use alternative // parser/optimizer/codegen, e.g the SSR optimizing compiler. // Here we just export a default compiler using the default parts. var createCompiler = createCompilerCreator(function baseCompile ( template, options ) { var ast = parse(template.trim(), options); optimize(ast, options); var code = generate(ast, options); return { ast: ast, render: code.render, staticRenderFns: code.staticRenderFns } }); /* */ var ref$1 = createCompiler(baseOptions); var compileToFunctions = ref$1.compileToFunctions; /* */ var idToTemplate = cached(function (id) { var el = query(id); return el && el.innerHTML }); var mount = Vue$3.prototype.$mount; Vue$3.prototype.$mount = function ( el, hydrating ) { el = el && query(el); /* istanbul ignore if */ if (el === document.body || el === document.documentElement) { "development" !== 'production' && warn( "Do not mount Vue to <html> or <body> - mount to normal elements instead." ); return this } var options = this.$options; // resolve template/el and convert to render function if (!options.render) { var template = options.template; if (template) { if (typeof template === 'string') { if (template.charAt(0) === '#') { template = idToTemplate(template); /* istanbul ignore if */ if ("development" !== 'production' && !template) { warn( ("Template element not found or is empty: " + (options.template)), this ); } } } else if (template.nodeType) { template = template.innerHTML; } else { if (true) { warn('invalid template option:' + template, this); } return this } } else if (el) { template = getOuterHTML(el); } if (template) { /* istanbul ignore if */ if ("development" !== 'production' && config.performance && mark) { mark('compile'); } var ref = compileToFunctions(template, { shouldDecodeNewlines: shouldDecodeNewlines, delimiters: options.delimiters, comments: options.comments }, this); var render = ref.render; var staticRenderFns = ref.staticRenderFns; options.render = render; options.staticRenderFns = staticRenderFns; /* istanbul ignore if */ if ("development" !== 'production' && config.performance && mark) { mark('compile end'); measure(((this._name) + " compile"), 'compile', 'compile end'); } } } return mount.call(this, el, hydrating) }; /** * Get outerHTML of elements, taking care * of SVG elements in IE as well. */ function getOuterHTML (el) { if (el.outerHTML) { return el.outerHTML } else { var container = document.createElement('div'); container.appendChild(el.cloneNode(true)); return container.innerHTML } } Vue$3.compile = compileToFunctions; module.exports = Vue$3; /* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(2))) /***/ }) },[41]);

QuestBridge is pleased to offer the Amherst College telementoring award in partnership with Amherst College, which is consistently ranked as one of the top colleges in the nation. College Prep Scholars selected for telementoring will be contacted by Amherst College directly about being paired with an Amherst College student, who will advise them by phone and e-mail about the college admissions process. The Amherst student telementors are high-achieving low-income students themselves, and many are among the first in their family to attend college. Having recently navigated the college admissions process, these students can offer insight and practical know-how for navigating the process of getting into a selective college. What to look for in a college and how to choose the right one. Filling out college applications and writing application essays. How to approach the financial aid process. Academic and social life as a low-income student at a highly selective college.

Q: Navigation in a Lightbox2 doesn't work well on older IE versions (IE10 and lower) Navigation in a custom Lightbox2 is only clickable if I enter the element vertically, not horizontally. This only occurs on IE8 and lower. The element that gets the focus if I enter the navigation horizontal is the " I tried to fix this with z-index, but it didn't work CSS /* line 63, ../sass/lightbox.sass */ .lb-nav { position: absolute; top: 0px; left: 0; height: 100%; width: 100%; z-index: 10; margin-bottom: -150px; } /* line 71, ../sass/lightbox.sass */ .lb-container > .nav { left: 0; } /* line 74, ../sass/lightbox.sass */ .lb-nav a { outline: none; } /* line 77, ../sass/lightbox.sass */ .lb-prev, .lb-next { width: 40%; height: 100%; cursor: pointer; z-index: 20; /* Trick IE into showing hover */ display: block; } /* line 84, ../sass/lightbox.sass */ .lb-prev { margin-left: 30px; left: 0; float: left; } /* line 87, ../sass/lightbox.sass */ .lb-prev:hover { background: url("../images/lightbox/links-blauw.png") left 48% no-repeat; } /* line 90, ../sass/lightbox.sass */ .lb-next { margin-right: 30px; right: 0; float: right; } /* line 93, ../sass/lightbox.sass */ .lb-next:hover { background: url("../images/lightbox/rechts-blauw.png") right 48% no-repeat; } HTML (appended in lightbox JS) <div id='lightboxOverlay' class='lightboxOverlay'></div> <div id='lightbox' class='lightbox'> <div class='lb-outerContainer'> <div class='lb-container'><img class='lb-image' src='' /> <div class='lb-nav'> <div class='lb-closeContainer'> Venster sluiten <a class='lb-close'>&nbsp;</a> </div><a class='lb-prev' href='' ></a><a class='lb-next' href='' ></a> </div> <div class='lb-loader'> <a class='lb-cancel'></a> </div> </div> <div class='lb-dataContainer'> <div class='lb-data'> <div class='lb-details'> <span class='lb-caption'></span><span class='lb-number'></span> </div> </div> </div> </div> </div> A: You have to add a transparent background image to the lb-prev and lb-next containers, so they can trigger the hover. .lb-prev, .lb-next { width: 49%; height: 100%; cursor: pointer; /* Trick IE into showing hover */ display: block; z-index:101; position:relative; background-image:url(data:image/gif;base64,R0lGODlhAQABAAAAACH5BAEKAAEALAAAAAABAAEAAAICTAEAOw== ); }

ThruSpace, also known in Europe as ThruSpace: High Velocity 3D Puzzle, and in Japan as , is a 2010 WiiWare game, developed by Japanese game developer Keys Factory, and published by Nintendo. Players play as a block known as a "Keydron", and use the Wii Remote to rotate the Keydron so it will fit in gaps in walls that approach it. Gameplay Playing as a Keydron, players must rotate the Wii Remote to rotate the Keydron so it will fit in gaps that approach the player. There are multiple difficulty levels, each one changing Keydron to become more complex shapes. Occasionally, crystals appear in gaps in the wall, which will give the player bonus points when collected. Players play for a high score. Reception ThruSpace received above-average reviews according to the review aggregation website Metacritic. Eurogamers Kristan Reed called the game "relatively simple", but still praised the game's difficulty. Sequel ThruSpace received a sequel on the Nintendo 3DS, called Ketzal's Corridors. It follows the same gameplay loop of ThruSpace, but with a more distinct art style. References 2010 video games Nintendo games Puzzle video games Video games developed in Japan Wii games Wii-only games WiiWare games

Лесопа́рк — расположенный в черте города или иного населённого пункта лесной массив естественного или частично искусственного происхождения, служащий для кратковременного отдыха. Размер лесопарка составляет обычно от нескольких сотен до 2—3 тысяч гектаров и более. Обычно лесопарки располагают в пригородах, в местах с хорошей транспортной доступностью. При создании лесопарка проводят реконструкцию зелёных насаждений, агролесомелиоративные работы, реконструкцию или создание водоёмов, прокладывают дорожки и тропинки, размещают оборудование для отдыха и так далее. В лесопарках могут организовываться различные мероприятия и формы отдыха: экскурсии, туризм, пикники и барбекю, рыбная ловля, занятие различными видами уличного летнего и зимнего спорта. В отличие от парка, в лесопарке допускается сбор грибов, ягод и декоративных растений, но запрещена охота, заготовка сена и выпас скота. Сбор технических и лекарственных растений требует наличия специального разрешения. В отличие от дикого лесного массива, в лесопарке обеспечивается предотвращение деградации лесных насаждений. Для этого осуществляется регулирование и распределение количества посетителей лесопарка, проводятся работы по сохранению подлеска, подроста, повышению жизнестойкости древостоя. Основной упор делается на санитарно-гигиенические и эстетические свойства зелёных насаждений, выращивание древесины для лесозаготовок не относится к приоритетным задачам лесопарка. Также осуществляют работы по предупреждению деградации почвы, при необходимости вносят удобрения. В лесопарке проводят благоустройство — обустраивают сеть дорожек и открытые пространства, создают игровые, детские и спортивные площадки, места отдыха. Проводят ландшафтные рубки, высаживают ландшафтные деревья и кустарники, устраивают кормушки для птиц и зверей, зимой завозят корм для животных. Примечания Лесоводство Рекреационные ресурсы

How many percentage of the quality of a Work T-Shirt does come from its fabric and how many % comes from its garment techniques? No one really know exactly but we all know that both these factors account for 99,99% of the quality and function of a T-Shirt. An One-Stop-Shop OEM service which are aimed to make the whole quality of any Work T-Shirt design is available here at Thygesen. Don't waste your time on procrastination, let's begin with us! Performance: color fastness in the condition of industrial machine washing; very breathable, absorbent, quick dry and light in weight. Color/print/embroidery: Any design can be developed as required. #Polyester Cotton Blend T-Shirt Manufacturer, #Polyester Cotton Blend T-Shirt Manufacturers, #Polyester Cotton Blend T-Shirt Wholesaler, #Polyester Cotton Blend T-Shirt Supplier, #Polyester Cotton Blend T-Shirt Suppliers, #Polyester Cotton Blend T-Shirt Factory, #Polyester Cotton Blend T-Shirt Factories, #Workwear Pocket T-shirts Manufacturer, #Workwear Pocket T-shirts Manufacturers, #Workwear Pocket T-shirts Wholesaler, #Workwear Pocket T-shirts Supplier, #Workwear Pocket T-shirts Suppliers, #Workwear Pocket T-shirts Factory, #Workwear Pocket T-shirts Factories, #Work T-Shirt Manufacturer, #Work T-Shirt Manufacturers, #Work T-Shirt Wholesaler, #Work T-Shirt Supplier, #Work T-Shirt Suppliers, #Work T-Shirt Factory, #Work T-Shirt Factories, #Pocket T-Shirt Manufacturer, #Pocket T-Shirt Manufacturers, #Pocket T-Shirt Wholesaler, #Pocket T-Shirt Supplier, #Pocket T-Shirt Suppliers, #Pocket T-Shirt Factory, #Pocket T-Shirt Factories, #Sleeveless T-Shirt Manufacturer, #Sleeveless T-Shirt Manufacturers, #Sleeveless T-Shirt Wholesaler, #Sleeveless T-Shirt Supplier, #Sleeveless T-Shirt Suppliers, #Sleeveless T-Shirt Factory, #Sleeveless T-Shirt Factories.

Yale Law Review may refer to: Yale Law Journal Yale Law & Policy Review Yale Review of Law and Social Action

/*global describe, it */ 'use strict'; var promisory = require('..'); var assert = require('assert'); var fs = require('fs'); var promisify = promisory.promisify; describe('promissory.promisify(fn)', function() { it('should be aliased for backward compatibility', function() { assert(promisory == promisify, 'Exports are incorrect'); }); it('should work when sync', function() { function read(file, fn) { fn(null, 'file: ' + file); } var readPromissory = promisify(read); return readPromissory('foo.txt').then(function(res) { assert('file: foo.txt' == res); }); }); it('should work when async', function() { function read(file, fn) { setTimeout(function() { fn(null, 'file: ' + file); }, 5); } var readPromissory = promisify(read); readPromissory('foo.txt').then(function(res) { assert('file: foo.txt' == res); }); }); it('should maintain the receiver', function() { function load(fn) { /*jshint validthis: true */ fn(null, this.name); } var user = { name: 'tobi', loadPromissory: promisify(load) }; user.loadPromissory().then(function(name) { assert('tobi' == name); }); }); it('should catch errors', function() { function load(fn) { throw new Error('boom'); } var loadPromissory = promisify(load); return loadPromissory().catch(function(err) { assert('boom' == err.message); }); }); it('should ignore multiple callbacks', function() { function load(fn) { fn(null, 1); fn(null, 2); fn(null, 3); } var loadPromissory = promisify(load); return loadPromissory(); }); it('should pass no results', function() { function connect(fn) { setTimeout(function() { fn(null); }, 5); } var connectPromissory = promisify(connect); return connectPromissory().then(function(vals) { assert(!vals); }); }); it('should pass all results', function() { function read(file, fn) { setTimeout(function() { fn(null, file[0], file[1]); }, 5); } var readPromissory = promisify(read); return readPromissory('foo.txt').then(function(vals) { assert('f' == vals[0]); assert('o' == vals[1]); }); }); it('should work with node methods', function() { fs.readFilePromissory = promisify(fs.readFile); return fs.readFilePromissory('package.json').then(function(buf) { assert(Buffer.isBuffer(buf)); return fs.readFilePromissory('package.json', 'utf8').then(function(str) { assert(typeof str == 'string'); }); }); }); });

Elgamal oder El-Gamal ist der Familienname folgender Personen: Adham Hatem Elgamal (* 1998), ägyptischer Badmintonspieler Ahmed Elgamal, US-amerikanischer Ingenieurwissenschaftler Ayman El-Gamal (* 1973), ägyptischer Fußballspieler Hamza El-Gamal, ägyptischer Fußballspieler Moukhtar Hussain El-Gamal (* 1935), ägyptischer Wasserballspieler Taha El-Gamal (1923–1956), ägyptischer Schwimmer und Wasserballspieler Taher Elgamal (* 1955), US-amerikanischer Wissenschaftler Abbas El Gamal (* 1950), US-amerikanischer Ingenieur Elgamal-Kryptosystem bezeichnet folgende vom Kryptologen Taher Elgamal entwickelte kryptographische Verfahren: Elgamal-Verschlüsselungsverfahren, ein Verfahren für digitale Verschlüsselung Elgamal-Signaturverfahren, ein Verfahren für digitale Signaturen Siehe auch: Gamal

Jerry Preisendorf Soccer Coach Hired October 23, 2015–Lehi, Utah Jerry Preisendorf has been hired as the men's and women's soccer coach for Skyridge High School, currently under construction in Lehi, Utah. The school will open in August 2016. Coach Preisendorf has a USSF "D" Coaching License and has coached soccer for the last 15 years at the club and high school levels. He has been the head coach of the Lehi High School boys' team since 2010 and started coaching the girls' soccer program in 2015. Under Coach Preisendorf, the boys' program at Lehi High School has collected two state titles, the first in 2010 (4A), and the second in 2013 (5A). The team advanced to the semifinal game last season. During his tenure, the Pioneers have been Region champions four times, and have qualified for the state playoffs every year. The overall record for the boys' team is at Lehi High is 82-24-7. During Preisendorf's first year as the girls' head coach at Lehi High School, the team finished the season as the 4th seed in Region 4 and earned a berth in the state playoffs. Their first round victory over a #1 seed allowed them to make it to the quarterfinals, where they lost to an eventual finalist in the 5A division. Skyridge principal Joel Perkins says, "Jerry is an outstanding individual. He has cultivated a tradition of excellence at Lehi High School, and we are confident that he will create outstanding men's and women's soccer programs. He cares deeply for his student athletes, and he is known for his ability to hone their individual potential to achieve success as a cohesive team. His teams excel, and parents and students love him." Skyridge Athletic Director Mark Clinton says, "Jerry has the ability to understand and demonstrate the importance of teamwork and sportsmanship and will instill in Skyridge athletes a burning desire to win while playing within the rules." On leaving his current position, Preisendorf says, "I have a lot of memories and many good friends at Lehi High School. All of my sons graduated from Lehi, and I have a great relationship with the administration there. I look forward to creating a great program and to the opportunities that come with starting a program at a new school." Coach Preisendorf says the best thing in his life is being married to his wife of over 30 years, Michele. The Preisendorfs have four boys and one grandchild, and they have lived in Lehi for the past 23 years. He will continue to coach at Lehi High through the end of the school year.

package nl.nn.adapterframework.webcontrol.api; import java.io.IOException; import java.io.OutputStream; import java.util.Iterator; import javax.annotation.security.RolesAllowed; import javax.ws.rs.DefaultValue; import javax.ws.rs.GET; import javax.ws.rs.Path; import javax.ws.rs.PathParam; import javax.ws.rs.Produces; import javax.ws.rs.QueryParam; import javax.ws.rs.WebApplicationException; import javax.ws.rs.core.MediaType; import javax.ws.rs.core.Response; import javax.ws.rs.core.Response.ResponseBuilder; import javax.ws.rs.core.StreamingOutput; import javax.xml.stream.XMLStreamException; import org.apache.commons.lang3.StringUtils; import nl.nn.adapterframework.configuration.ConfigurationException; import nl.nn.adapterframework.core.IAdapter; import nl.nn.adapterframework.core.IListener; import nl.nn.adapterframework.http.WebServiceListener; import nl.nn.adapterframework.management.bus.BusTopic; import nl.nn.adapterframework.management.bus.RequestMessageBuilder; import nl.nn.adapterframework.receivers.Receiver; import nl.nn.adapterframework.soap.WsdlGenerator; /** * Shows all monitors. * * @since 7.0-B1 * @author Niels Meijer */ @Path("/") public final class Webservices extends Base { @GET @RolesAllowed({"IbisObserver", "IbisDataAdmin", "IbisAdmin", "IbisTester"}) @Path("/webservices") @Relation("webservices") @Produces(MediaType.APPLICATION_JSON) public Response getWebServices() throws ApiException { return callSyncGateway(RequestMessageBuilder.create(this, BusTopic.WEBSERVICES)); } @GET @RolesAllowed({"IbisObserver", "IbisDataAdmin", "IbisAdmin", "IbisTester"}) @Path("/webservices/{resourceName}") @Relation("webservices") @Produces(MediaType.APPLICATION_XML) public Response getWsdl( @PathParam("resourceName") String resourceName, @DefaultValue("true") @QueryParam("indent") boolean indent, @DefaultValue("false") @QueryParam("useIncludes") boolean useIncludes) throws ApiException { String adapterName; boolean zip; int dotPos=resourceName.lastIndexOf('.'); if (dotPos>=0) { adapterName=resourceName.substring(0,dotPos); zip=resourceName.substring(dotPos).equals(".zip"); } else { adapterName=resourceName; zip=false; } if (StringUtils.isEmpty(adapterName)) { return Response.status(Response.Status.BAD_REQUEST).entity("<error>no adapter specified</error>").build(); } IAdapter adapter = getIbisManager().getRegisteredAdapter(adapterName); if (adapter == null) { return Response.status(Response.Status.BAD_REQUEST).entity("<error>adapter not found</error>").build(); } try { String servletName = getServiceEndpoint(adapter); String generationInfo = "by FrankConsole"; WsdlGenerator wsdl = new WsdlGenerator(adapter.getPipeLine(), generationInfo); wsdl.setIndent(indent); wsdl.setUseIncludes(useIncludes||zip); wsdl.init(); StreamingOutput stream = new StreamingOutput() { @Override public void write(OutputStream out) throws IOException, WebApplicationException { try { if (zip) { wsdl.zip(out, servletName); } else { wsdl.wsdl(out, servletName); } } catch (ConfigurationException | XMLStreamException e) { throw new WebApplicationException(e); } } }; ResponseBuilder responseBuilder = Response.ok(stream); if (zip) { responseBuilder.type(MediaType.APPLICATION_OCTET_STREAM); responseBuilder.header("Content-Disposition", "attachment; filename=\""+adapterName+".zip\""); } return responseBuilder.build(); } catch (Exception e) { throw new ApiException("exception on retrieving wsdl", e); } } private String getServiceEndpoint(IAdapter adapter) { String endpoint = "external address of ibis"; Iterator it = adapter.getReceivers().iterator(); while(it.hasNext()) { IListener listener = ((Receiver) it.next()).getListener(); if(listener instanceof WebServiceListener) { String address = ((WebServiceListener) listener).getAddress(); if(StringUtils.isNotEmpty(address)) { endpoint = address; } else { endpoint = "rpcrouter"; } String protocol = servletRequest.isSecure() ? "https://" : "http://"; int port = servletRequest.getServerPort(); String restBaseUrl = protocol + servletRequest.getServerName() + (port != 0 ? ":" + port : "") + servletRequest.getContextPath() + "/services/"; endpoint = restBaseUrl + endpoint; break; //what if there are more than 1 WebServiceListener } } return endpoint; } private String getWsdlExtension() { return ".wsdl"; } }

Induction of apoptosis by pistachio (Pistacia vera L.) hull extract and its molecular mechanisms of action in human hepatoma cell line HepG2. Several important Pistacia species such as P. vera have been traditionally used for treating a wide range of diseases (for instance, liver-related disorders). There is a relative lack of research into pharmacological aspects of pistachio hull. Hence, this study was aimed at investigating whether pistachio rosy hull (PRH) extract exerts apoptotic impacts on HepG2 liver cancer cell line. In order to evaluate cell viability and apoptosis in response to treatment with the extract, MTT assay and Annexin-V-fluorescein/propidium iodide (PI) double staining were performed, respectively. Moreover, molecular mechanism of apoptosis induced by the extract was determined using human apoptosis PCR array. Our findings showed that PRH extract treatment reduced cell viability (IC50 ~ 0.3 mg/ml) in a dose-dependent manner. Flow cytometric analysis revealed that the extract significantly induced apoptosis in HepG2 cells. In addition, quantitative PCR array results demonstrated the regulation of a considerable number of apoptosis-related genes belonging to the TNF, BCL2, IAP, TRAF, and caspase families. We observed altered expression of both pro-apoptotic and anti-apoptotic genes associated with the extrinsic and intrinsic apoptosis signaling pathways. These results suggest that the aqueous extract of PRH possesses apoptotic activity through cytotoxic and apoptosis-inducing effects on HepG2 cells.

namespace Raz { VertexArray::VertexArray() { Logger::debug("[VertexArray] Creating..."); Renderer::generateVertexArray(m_index); Logger::debug("[VertexArray] Created (ID: " + std::to_string(m_index) + ')'); } void VertexArray::bind() const { Renderer::bindVertexArray(m_index); } void VertexArray::unbind() const { Renderer::unbindVertexArray(); } VertexArray::~VertexArray() { if (!m_index.isValid()) return; Logger::debug("[VertexArray] Destroying (ID: " + std::to_string(m_index) + ")..."); Renderer::deleteVertexArray(m_index); Logger::debug("[VertexArray] Destroyed"); } VertexBuffer::VertexBuffer() { Logger::debug("[VertexBuffer] Creating..."); Renderer::generateBuffer(m_index); Logger::debug("[VertexBuffer] Created (ID: " + std::to_string(m_index) + ')'); } void VertexBuffer::bind() const { Renderer::bindBuffer(BufferType::ARRAY_BUFFER, m_index); } void VertexBuffer::unbind() const { Renderer::unbindBuffer(BufferType::ARRAY_BUFFER); } VertexBuffer::~VertexBuffer() { if (!m_index.isValid()) return; Logger::debug("[VertexBuffer] Destroying (ID: " + std::to_string(m_index) + ")..."); Renderer::deleteBuffer(m_index); Logger::debug("[VertexBuffer] Destroyed"); } IndexBuffer::IndexBuffer() { Logger::debug("[IndexBuffer] Creating..."); Renderer::generateBuffer(m_index); Logger::debug("[IndexBuffer] Created (ID: " + std::to_string(m_index) + ')'); } void IndexBuffer::bind() const { Renderer::bindBuffer(BufferType::ELEMENT_BUFFER, m_index); } void IndexBuffer::unbind() const { Renderer::unbindBuffer(BufferType::ELEMENT_BUFFER); } IndexBuffer::~IndexBuffer() { if (!m_index.isValid()) return; Logger::debug("[IndexBuffer] Destroying (ID: " + std::to_string(m_index) + ")..."); Renderer::deleteBuffer(m_index); Logger::debug("[IndexBuffer] Destroyed"); } } // namespace Raz

Kilroy Realty's Second Quarter 2016 Earnings Conference Call Published Tue, Jul 5 2016 2:00 PM EDT LOS ANGELES, July 05, 2016 (GLOBE NEWSWIRE) -- Kilroy Realty Corporation (NYSE:KRC) has scheduled its quarterly conference call to discuss its second quarter 2016 financial results on Tuesday, July 26, 2016 at 10:00 a.m. Pacific Time (1:00 p.m. Eastern Time). The phone number for the call is (888) 680-0878, passcode: 80256205. This call is being Webcast by Thomson/CCBN and can be accessed at Kilroy Realty Corporation's Website at www.kilroyrealty.com. The Webcast is also being distributed through the Thomson StreetEvents Network. Institutional investors can access the call via Thomson StreetEvents (www.streetevents.com), a password-protected event management site. A webcast replay will be available in the Investor Relations, Shareholder Information - Conference Calls section of the company's Website at www.kilroyrealty.com. A replay will also be available from July 26, 2016 at 12:00 p.m. Pacific Time until August 2, 2016, by dialing (888) 286-8010, passcode: 85935244. About Kilroy Realty Corporation. With almost 70 years' experience owning, developing, acquiring and managing real estate assets in West Coast real estate markets, Kilroy Realty Corporation (KRC), a publicly traded real estate investment trust and member of the S&P MidCap 400 Index, is one of the region's premier landlords. The company provides physical work environments that foster creativity and productivity and serves a broad roster of dynamic, innovation-driven tenants, including technology, entertainment, digital media and health care companies. At March 31, 2016, the company's stabilized portfolio totaled 13.7 million square feet of office properties, all located in the coastal regions of greater Seattle, the San Francisco Bay Area, Los Angeles, Orange County and San Diego. The company is recognized by GRESB as the North American leader in sustainability, ranking first among 155 North American participants across all asset types. At the end of the first quarter, the company's properties were 46% LEED certified and 66% of eligible properties were ENERGY STAR certified. In addition, KRC had approximately 905,000 square feet of office and residential projects under construction with a total estimated investment of approximately $645.0 million. More information is available at http://www.kilroyrealty.com. Contact Information:Tyler Rose(310) 481-8484trose@kilroyrealty.com Source:Kilroy Realty

Babur, Founder Mughal Dynasty India Mughals Timurid Babur, Founder Mughal Dynasty India > Babur was a Muslim conqueror from Central Asia who, following a series of setbacks, finally succeeded in laying the basis for the Mughal dynasty of India. He was a direct descendant of Timur through his father, and a descendant also of Genghis Khan through his mother. Babur identified his lineage as Timurid and Chaghatay-Turkic, while his origin, milieu, training, and culture were steeped in Persian culture and so he was largely responsible for the fostering of this culture by his descendants, and for the expansion of Persian cultural influence in the Indian subcontinent, with brilliant literary, artistic, and historiographical results. More on this Website • http://en.wikipedia.org/wiki/Babur Related Links • Add URL Babur was a Muslim conqueror from Central Asia who, following a series of setbacks, finally succeeded in laying the basis for the Mughal dynasty of India. He was a direct descendant of Timur through his father, and a descendant also of Genghis Khan through his mother. Babur identified his lineage as Timurid and Chaghatay-Turkic, while his origin, milieu, training, and culture were steeped in Persian culture and so he was largely responsible for the fostering of this culture by his descendants, and for the expansion of Persian cultural influence in the Indian subcontinent, with brilliant literary, artistic, and historiographical results. More... Related > Conquerors • Founders • Muslims • Royalty • Statesmen • Aquarius • February 14 • India • Mongols • Mughals • Renaissance • Rulers • Timurid • 15th Century • 16th Century • Icons • People Genghis Khan, Unified the Mongols Genghis Khan was the founder and Great Khan (emperor) of the Mongol Empire, which became the largest contiguous empire in history after his demise. He came to power by uniting many of the nomadic tribes of northeast Asia. After founding the Mongol... Tamerlane (Timur) the Great Timur meaning "iron" or Tamerlane in English, was a 14th-century conqueror of much of western and central Asia, founder of the Timurid Empire and Timurid dynasty (1370–1405) in Central Asia, and great great grandfather of Babur, the founder of the Mu... Akbar the Great, Greatest Mughal Emperor Jalaluddin Muhammad Akbar also known as Akbar the Great was the son of Nasiruddin Humayun whom he succeeded as ruler of the Mughal Empire from 1556 to 1605, and the grandson of Babur who founded the Mughal dynasty. On the eve of his death in 1605, th...