diff --git "a/train/github-03-6929175.jsonl" "b/train/github-03-6929175.jsonl" new file mode 100644--- /dev/null +++ "b/train/github-03-6929175.jsonl" @@ -0,0 +1,1045 @@ +{"text": "package alidns\n\n//Licensed under the Apache License, Version 2.0 (the \"License\");\n//you may not use this file except in compliance with the License.\n//You may obtain a copy of the License at\n//\n//http://www.apache.org/licenses/LICENSE-2.0\n//\n//Unless required by applicable law or agreed to in writing, software\n//distributed under the License is distributed on an \"AS IS\" BASIS,\n//WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n//See the License for the specific language governing permissions and\n//limitations under the License.\n//\n// Code generated by Alibaba Cloud SDK Code Generator.\n// Changes may cause incorrect behavior and will be lost if the code is regenerated.\n\nimport (\n\t\"github.com/aliyun/alibaba-cloud-sdk-go/sdk/requests\"\n\t\"github.com/aliyun/alibaba-cloud-sdk-go/sdk/responses\"\n)\n\n// TagResources invokes the alidns.TagResources API synchronously\n// api document: https://help.aliyun.com/api/alidns/tagresources.html\nfunc (client *Client) TagResources(request *TagResourcesRequest) (response *TagResourcesResponse, err error) {\n\tresponse = CreateTagResourcesResponse()\n\terr = client.DoAction(request, response)\n\treturn\n}\n\n// TagResourcesWithChan invokes the alidns.TagResources API asynchronously\n// api document: https://help.aliyun.com/api/alidns/tagresources.html\n// asynchronous document: https://help.aliyun.com/document_detail/66220.html\nfunc (client *Client) TagResourcesWithChan(request *TagResourcesRequest) (<-chan *TagResourcesResponse, <-chan error) {\n\tresponseChan := make(chan *TagResourcesResponse, 1)\n\terrChan := make(chan error, 1)\n\terr := client.AddAsyncTask(func() {\n\t\tdefer close(responseChan)\n\t\tdefer close(errChan)\n\t\tresponse, err := client.TagResources(request)\n\t\tif err != nil {\n\t\t\terrChan <- err\n\t\t} else {\n\t\t\tresponseChan <- response\n\t\t}\n\t})\n\tif err != nil {\n\t\terrChan <- err\n\t\tclose(responseChan)\n\t\tclose(errChan)\n\t}\n\treturn responseChan, errChan\n}\n\n// TagResourcesWithCallback invokes the alidns.TagResources API asynchronously\n// api document: https://help.aliyun.com/api/alidns/tagresources.html\n// asynchronous document: https://help.aliyun.com/document_detail/66220.html\nfunc (client *Client) TagResourcesWithCallback(request *TagResourcesRequest, callback func(response *TagResourcesResponse, err error)) <-chan int {\n\tresult := make(chan int, 1)\n\terr := client.AddAsyncTask(func() {\n\t\tvar response *TagResourcesResponse\n\t\tvar err error\n\t\tdefer close(result)\n\t\tresponse, err = client.TagResources(request)\n\t\tcallback(response, err)\n\t\tresult <- 1\n\t})\n\tif err != nil {\n\t\tdefer close(result)\n\t\tcallback(nil, err)\n\t\tresult <- 0\n\t}\n\treturn result\n}\n\n// TagResourcesRequest is the request struct for api TagResources\ntype TagResourcesRequest struct {\n\t*requests.RpcRequest\n\tResourceId *[]string `position:\"Query\" name:\"ResourceId\" type:\"Repeated\"`\n\tResourceType string `position:\"Query\" name:\"ResourceType\"`\n\tUserClientIp string `position:\"Query\" name:\"UserClientIp\"`\n\tTag *[]TagResourcesTag `position:\"Query\" name:\"Tag\" type:\"Repeated\"`\n\tLang string `position:\"Query\" name:\"Lang\"`\n\tOverWrite requests.Boolean `position:\"Query\" name:\"OverWrite\"`\n}\n\n// TagResourcesTag is a repeated param struct in TagResourcesRequest\ntype TagResourcesTag struct {\n\tValue string `name:\"Value\"`\n\tKey string `name:\"Key\"`\n}\n\n// TagResourcesResponse is the response struct for api TagResources\ntype TagResourcesResponse struct {\n\t*responses.BaseResponse\n\tRequestId string `json:\"RequestId\" xml:\"RequestId\"`\n}\n\n// CreateTagResourcesRequest creates a request to invoke TagResources API\nfunc CreateTagResourcesRequest() (request *TagResourcesRequest) {\n\trequest = &TagResourcesRequest{\n\t\tRpcRequest: &requests.RpcRequest{},\n\t}\n\trequest.InitWithApiInfo(\"Alidns\", \"2015-01-09\", \"TagResources\", \"alidns\", \"openAPI\")\n\treturn\n}\n\n// CreateTagResourcesResponse creates a response to parse from TagResources response\nfunc CreateTagResourcesResponse() (response *TagResourcesResponse) {\n\tresponse = &TagResourcesResponse{\n\t\tBaseResponse: &responses.BaseResponse{},\n\t}\n\treturn\n}\n"} +{"text": "\n\n
\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n
\n"} +{"text": "fileFormatVersion: 2\nguid: 48d55aa41e71c794487ce3bef63001e9\nAssemblyDefinitionImporter:\n externalObjects: {}\n userData: \n assetBundleName: \n assetBundleVariant: \n"} +{"text": "\n\n\t\n\t\t\n\t\n\t\n\t\t\n\n\t\n\tUltrasensitive Surface Plasmon Resonance Detection of Trinitrotoluene by a Bis-aniline-Cross-Linked Au Nanoparticles Composite\n\t\n\n\t\n\tMichael Riskin, Ran Tel-Vered, Oleg Lioubashevski, and Itamar Willner* \n\t\n\n\t\n\tInstitute of Chemistry, The Hebrew UniVersity of Jerusalem,\n\t\n\n\t
Jerusalem 91904, Israel
\n\n\tReceived January 11, 2009\n\n\t; E-mail:\n\twillnea@vms.huji.ac.il\n\n\tAbstract:\n\t
A bis-aniline-cross-linked Au nanoparticles (NPs) composite is electropolymerized on Au surfaces. The association of trinitrotoluene, TNT, to the bis-aniline bridging units via π-donor-acceptor interactions allows the amplified detection of TNT by following the surface plasmon resonance (SPR) reflectance changes as a result of the coupling between the localized plasmon of the AuNPs and the surface plasmon wave associated with the gold surface. The detection limit for analyzing TNT by this method is ∼10 pM. The electropolymerization of the bis-aniline-cross-linked AuNPs composite in the presence of picric acid results in a molecular-imprinted matrix for the enhanced binding of TNT. The imprinted AuNPs composite enabled the sensing of TNT with a detection limit that corresponded to 10 fM. Analysis of the SPR reflectance changes in the presence of different concentrations of TNT revealed a two-step calibration curve that included the ultrasensitive detection of TNT by the imprinted sites in the composite, K ass I . for the association of TNT to the imprinted sites, 6.4 × 10 12 M -1 , followed by a less sensitive detection of TNT by the nonimprinted π-donor bis-aniline sites (K ass. NI ) 3.9 × 10 9 M -1 ). The imprinted AuNPs composite reveals impressive selectivity. The structural and functional features of the bis-aniline-cross-linked AuNPs composites were characterized by different methods including ellipsometry, AFM, and electrochemical means. The dielectric properties of the AuNPs composite in the presence of different concentrations of TNT were evaluated by the theoretical fitting of the respective experimental SPR curves. The ultrasensitive detection of the TNT by the AuNPs composite was attributed to the changes of the dielectric properties of the composite, as a result of the formation of the π-donor-acceptor complexes between TNT and the bis-aniline units. These changes in the dielectric properties lead to a change in the conductivity of the AuNPs matrix.
\n\n\tPublished on Web \n\t05/08/2009 \n\n\t10.1021/ja9001212 \n\n\tCCC: $40.75\n\n\t 2009 American Chemical Society\n\n\t\t\n\t\n\n"} +{"text": "% fancyheadings.sty version 1.0\n% Fancy headers and footers.\n% Piet van Oostrum, Dept of Computer Science, University of Utrecht\n% Padualaan 14, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands\n% Telephone: +31-30-531806. piet@cs.ruu.nl (mcvax!hp4nl!ruuinf!piet)\n% March, 1989.\n\n% Here is a documentstylestyle option that allows you to customize your\n% page headers and footers in an easy way. It combines features that were\n% separately available in other pagestyles, without introducing much\n% complexity. You can define:\n% - three-part headers and footers\n% - rules in header and footer\n% - headers and footers wider than \\textwidth\n% - multiline headers and footers\n% - separate headers and footers for even and odd pages\n% - separate headers and footers for chapter pages\n% \n% To use this pagestyle, you must include the ``fancyheadings'' style\n% option in your \\documentstyle, and issue the \\pagestyle{fancy} command.\n% The \\pagestyle{fancy} command should be issued after any changes made to\n% \\textwidth.\n% \n% The page layout will be as follows:\n% \n% \t\tLHEAD CHEAD RHEAD\n% \t\t----------------------------------- (rule)\n% \n% \t\t\t page body\n% \n% \n% \t\t----------------------------------- (rule)\n% \t\tLFOOT\t CFOOT\t RFOOT\n% \n% The L-fields will be leftadjusted, the C-fields centered and the\n% R-fields rightadjusted.\n% Each of the six fields and the two rules can be defined separately.\n% \n% Simple use:\n% \n% The header and footer fields can be defined by commands \\lhead{LHEAD}\n% and so on for the other fields. If the field depends on something in the\n% document (e.g. section titles) you must in general use the \\markboth and\n% \\markright commands, otherwise a title may end on the wrong page. You\n% can do this e.g. by redefining the commands \\chaptermark, \\sectionmark\n% and so on (see example below). The defaults for these marks are as in\n% the standard pagestyles. The marks can be put into a header or footer\n% field by referencing \\leftmark and \\rightmark.\n% \n% Rules in header and footer\n% \n% The thickness of the rules below the header and above the footer can be\n% changed by redefining the length parameters \\headrulewidth (default\n% 0.4pt) and \\footrulewidth (default 0). These may be redefined by the\n% \\setlength command. A thickness of 0pt makes the rule invisible.\n% If you want to make more complicated changes, you have to redefine the\n% commands \\headrule and/or \\footrule.\n% \n% Headers and footers wider than \\textwidth\n% \n% The headers and footers are set in a box of width \\headwidth. The\n% default for this is the value of \\textwidth. You can make it wider (or\n% smaller) by redefining \\headwidth with the \\setlength or \\addtolength\n% command. The headers and footers will stick out the page on the same\n% side as the marginal notes. For example to include the marginal notes,\n% add both \\marginparsep and \\marginparwidth to \\headwidth (see also the\n% example below).\n% \n% Multiline headers and footers\n% \n% Each of the six fields is set in an appropriate parbox, so you can put a\n% multiline part in it with the \\\\ command. It is also possible to put\n% extra space in it with the \\vspace command. Note that if you do this you\n% will probably have to increase the \\headheight or \\footskip lengths.\n% \n% Separate headers and footers for even and odd pages\n% \n% If you want the headers and footers to be different on even- and\n% odd-numbered pages in the ``twoside'' style, the field-defining macros\n% can be given an optional argument, to be used on the even-numbered\n% pages, like \\lhead[EVEN-LHEAD]{ODD-RHEAD}.\n% \n% Separate headers and footers for chapter pages\n% \n% LaTeX gives a \\thispagestyle{plain} command for the first page of the\n% document, the first page of each chapter and a couple of other pages. It\n% might be incompatible with your pagestyle. In this case you can use a\n% slightly different version of the pagestyle, called \\pagestyle{fancyplain}. \n% This pagestyle redefines the pagestyle ``plain'' to also use pagestyle\n% ``fancy'' with the following modifications:\n% - the thicknesses of the rules is defined by \\plainheadrulewidth and\n% \\plainfootrulewidth (both default 0).\n% - the 6 fields may be defined separately for the plain pages by\n% giving them the value \\fancyplain{PLAIN-VALUE}{NORMAL-VALUE}. This\n% construct may be used in both the optional argument and the normal\n% argument. Thus \\lhead[\\fancyplain{F1}{F2}]{\\fancyplain{F3}{F4}}\n% specifies the LHEAD value in a two-sided document:\n% \tF1 on an even-numbered ``plain'' page\n% \tF2 on an even-numbered normal page\n% \tF3 on an odd-numbered ``plain'' page\n% \tF4 on an odd-numbered normal page.\n% \n% Defaults:\n% \n% \\headrulewidth \t 0.4pt\n% \\footrulewidth\t\t0pt\n% \\plainheadrulewidth\t0pt\n% \\plainfootrulewidth\t0pt\n% \n% \\lhead[\\fancyplain{}{\\sl\\rightmark}]{\\fancyplain{}{\\sl\\leftmark}}\n% % i.e. empty on ``plain'' pages \\rightmark on even, \\leftmark on odd pages\n% \\chead{}\n% \\rhead[\\fancyplain{}{\\sl\\leftmark}]{\\fancyplain{}{\\sl\\rightmark}}\n% % i.e. empty on ``plain'' pages \\leftmark on even, \\rightmark on odd pages\n% \\lfoot{}\n% \\cfoot{\\rm\\thepage} % page number\n% \\rfoot{}\n% \n% Examples:\n% \n% To put two lines containing the section title and the subsection title\n% in the righthandside corner, use:\n% \n% \\documentstyle[fancyheadings]{article}\n% \\pagestyle{fancy}\n% \\renewcommand{\\sectionmark}[1]{\\markboth{#1}{}}\n% \\renewcommand{\\subsectionmark}[1]{\\markright{#1}}\n% \\rfoot{\\leftmark\\\\\\rightmark}\n% \n% The following definitions give an approximation of the style used in the\n% LaTeX book:\n% \n% \\documentstyle[fancyheadings]{book}\n% \\pagestyle{fancyplain}\n% \\addtolength{\\headwidth}{\\marginparsep}\n% \\addtolength{\\headwidth}{\\marginparwidth}\n% \\renewcommand{\\chaptermark}[1]{\\markboth{#1}{#1}} % remember chapter title\n% \\renewcommand{\\sectionmark}[1]{\\markright{\\thesection\\ #1}}\n% % section number and title\n% \\lhead[\\fancyplain{}{\\bf\\thepage}]{\\fancyplain{}{\\bf\\rightmark}}\n% \\rhead[\\fancyplain{}{\\bf\\leftmark}]{\\fancyplain{}{\\bf\\thepage}}\n% \\cfoot{}\n\n%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\n\\def\\lhead{\\@ifnextchar[{\\@xlhead}{\\@ylhead}}\n\\def\\@xlhead[#1]#2{\\gdef\\@elhead{#1}\\gdef\\@olhead{#2}}\n\\def\\@ylhead#1{\\gdef\\@elhead{#1}\\gdef\\@olhead{#1}}\n\n\\def\\chead{\\@ifnextchar[{\\@xchead}{\\@ychead}}\n\\def\\@xchead[#1]#2{\\gdef\\@echead{#1}\\gdef\\@ochead{#2}}\n\\def\\@ychead#1{\\gdef\\@echead{#1}\\gdef\\@ochead{#1}}\n\n\\def\\rhead{\\@ifnextchar[{\\@xrhead}{\\@yrhead}}\n\\def\\@xrhead[#1]#2{\\gdef\\@erhead{#1}\\gdef\\@orhead{#2}}\n\\def\\@yrhead#1{\\gdef\\@erhead{#1}\\gdef\\@orhead{#1}}\n\n\\def\\lfoot{\\@ifnextchar[{\\@xlfoot}{\\@ylfoot}}\n\\def\\@xlfoot[#1]#2{\\gdef\\@elfoot{#1}\\gdef\\@olfoot{#2}}\n\\def\\@ylfoot#1{\\gdef\\@elfoot{#1}\\gdef\\@olfoot{#1}}\n\n\\def\\cfoot{\\@ifnextchar[{\\@xcfoot}{\\@ycfoot}}\n\\def\\@xcfoot[#1]#2{\\gdef\\@ecfoot{#1}\\gdef\\@ocfoot{#2}}\n\\def\\@ycfoot#1{\\gdef\\@ecfoot{#1}\\gdef\\@ocfoot{#1}}\n\n\\def\\rfoot{\\@ifnextchar[{\\@xrfoot}{\\@yrfoot}}\n\\def\\@xrfoot[#1]#2{\\gdef\\@erfoot{#1}\\gdef\\@orfoot{#2}}\n\\def\\@yrfoot#1{\\gdef\\@erfoot{#1}\\gdef\\@orfoot{#1}}\n\n\\newdimen\\headrulewidth\n\\newdimen\\footrulewidth\n\\newdimen\\plainheadrulewidth\n\\newdimen\\plainfootrulewidth\n\\newdimen\\headwidth\n\\newif\\if@fancyplain \\@fancyplainfalse\n\\def\\fancyplain#1#2{\\if@fancyplain#1\\else#2\\fi}\n\n% Initialization of the head and foot text.\n\n\\headrulewidth 0.4pt\n\\footrulewidth\\z@\n\\plainheadrulewidth\\z@\n\\plainfootrulewidth\\z@\n\n\\lhead[\\fancyplain{}{\\sl\\rightmark}]{\\fancyplain{}{\\sl\\leftmark}}\n% i.e. empty on ``plain'' pages \\rightmark on even, \\leftmark on odd pages\n\\chead{}\n\\rhead[\\fancyplain{}{\\sl\\leftmark}]{\\fancyplain{}{\\sl\\rightmark}}\n% i.e. empty on ``plain'' pages \\leftmark on even, \\rightmark on odd pages\n\\lfoot{}\n\\cfoot{\\rm\\thepage} % page number\n\\rfoot{}\n\n% Put together a header or footer given the left, center and\n% right text, fillers at left and right and a rule.\n% The \\lap commands put the text into an hbox of zero size,\n% so overlapping text does not generate an errormessage.\n\n\\def\\@fancyhead#1#2#3#4#5{#1\\hbox to\\headwidth{\\vbox{\\hbox\n{\\rlap{\\parbox[b]{\\headwidth}{\\raggedright#2\\strut}}\\hfill\n\\parbox[b]{\\headwidth}{\\centering#3\\strut}\\hfill\n\\llap{\\parbox[b]{\\headwidth}{\\raggedleft#4\\strut}}}\\headrule}}#5}\n\n\n\\def\\@fancyfoot#1#2#3#4#5{#1\\hbox to\\headwidth{\\vbox{\\footrule\n\\hbox{\\rlap{\\parbox[t]{\\headwidth}{\\raggedright#2\\strut}}\\hfill\n\\parbox[t]{\\headwidth}{\\centering#3\\strut}\\hfill\n\\llap{\\parbox[t]{\\headwidth}{\\raggedleft#4\\strut}}}}}#5}\n\n\\def\\headrule{{\\if@fancyplain\\headrulewidth\\plainheadrulewidth\\fi\n\\hrule\\@height\\headrulewidth\\@width\\headwidth \\vskip-\\headrulewidth}}\n\n\\def\\footrule{{\\if@fancyplain\\footrulewidth\\plainfootrulewidth\\fi\n\\vskip-0.3\\normalbaselineskip\\vskip-\\footrulewidth\n\\hrule\\@width\\headwidth\\@height\\footrulewidth\\vskip0.3\\normalbaselineskip}}\n\n\\def\\ps@fancy{\n\\let\\@mkboth\\markboth\n\\@ifundefined{chapter}{\\def\\sectionmark##1{\\markboth\n{\\uppercase{\\ifnum \\c@secnumdepth>\\z@\n \\thesection\\hskip 1em\\relax \\fi ##1}}{}}\n\\def\\subsectionmark##1{\\markright {\\ifnum \\c@secnumdepth >\\@ne\n \\thesubsection\\hskip 1em\\relax \\fi ##1}}}\n{\\def\\chaptermark##1{\\markboth {\\uppercase{\\ifnum \\c@secnumdepth>\\m@ne\n \\@chapapp\\ \\thechapter. \\ \\fi ##1}}{}}\n\\def\\sectionmark##1{\\markright{\\uppercase{\\ifnum \\c@secnumdepth >\\z@\n \\thesection. \\ \\fi ##1}}}}\n\\def\\@oddhead{\\@fancyhead\\relax\\@olhead\\@ochead\\@orhead\\hss}\n\\def\\@oddfoot{\\@fancyfoot\\relax\\@olfoot\\@ocfoot\\@orfoot\\hss}\n\\def\\@evenhead{\\@fancyhead\\hss\\@elhead\\@echead\\@erhead\\relax}\n\\def\\@evenfoot{\\@fancyfoot\\hss\\@elfoot\\@ecfoot\\@erfoot\\relax}\n\\headwidth\\textwidth}\n\\def\\ps@fancyplain{\\ps@fancy \\let\\ps@plain\\ps@plain@fancy}\n\\def\\ps@plain@fancy{\\@fancyplaintrue\\ps@fancy}\n"} +{"text": "/* Copyright (c) 2002,2003 CrystalClear Software, Inc.\n * Use, modification and distribution is subject to the\n * Boost Software License, Version 1.0. (See accompanying\n * file LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)\n * Author: Jeff Garland, Bart Garst\n * $Date: 2012-09-22 09:04:10 -0700 (Sat, 22 Sep 2012) $\n */\n\n#ifndef NO_BOOST_DATE_TIME_INLINE\n #undef BOOST_DATE_TIME_INLINE\n #define BOOST_DATE_TIME_INLINE inline\n#endif\n\nnamespace boost {\nnamespace date_time {\n //! Return the day of the week (0==Sunday, 1==Monday, etc)\n /*! Converts a year-month-day into a day of the week number\n */\n template\n BOOST_DATE_TIME_INLINE\n unsigned short\n gregorian_calendar_base::day_of_week(const ymd_type& ymd) {\n unsigned short a = static_cast((14-ymd.month)/12);\n unsigned short y = static_cast(ymd.year - a);\n unsigned short m = static_cast(ymd.month + 12*a - 2);\n unsigned short d = static_cast((ymd.day + y + (y/4) - (y/100) + (y/400) + (31*m)/12) % 7);\n //std::cout << year << \"-\" << month << \"-\" << day << \" is day: \" << d << \"\\n\";\n return d;\n }\n\n //!Return the iso week number for the date\n /*!Implements the rules associated with the iso 8601 week number.\n Basically the rule is that Week 1 of the year is the week that contains\n January 4th or the week that contains the first Thursday in January.\n Reference for this algorithm is the Calendar FAQ by Claus Tondering, April 2000.\n */\n template\n BOOST_DATE_TIME_INLINE\n int\n gregorian_calendar_base::week_number(const ymd_type& ymd) {\n unsigned long julianbegin = julian_day_number(ymd_type(ymd.year,1,1));\n unsigned long juliantoday = julian_day_number(ymd);\n unsigned long day = (julianbegin + 3) % 7;\n unsigned long week = (juliantoday + day - julianbegin + 4)/7;\n\n if ((week >= 1) && (week <= 52)) {\n return week;\n }\n\n if (week == 53) {\n if((day==6) ||(day == 5 && is_leap_year(ymd.year))) {\n return week; //under these circumstances week == 53.\n } else {\n return 1; //monday - wednesday is in week 1 of next year\n }\n }\n //if the week is not in current year recalculate using the previous year as the beginning year\n else if (week == 0) {\n julianbegin = julian_day_number(ymd_type(static_cast(ymd.year-1),1,1));\n juliantoday = julian_day_number(ymd);\n day = (julianbegin + 3) % 7;\n week = (juliantoday + day - julianbegin + 4)/7;\n return week;\n }\n\n return week; //not reachable -- well except if day == 5 and is_leap_year != true\n\n }\n\n //! Convert a ymd_type into a day number\n /*! The day number is an absolute number of days since the start of count\n */\n template\n BOOST_DATE_TIME_INLINE\n date_int_type_\n gregorian_calendar_base::day_number(const ymd_type& ymd)\n {\n unsigned short a = static_cast((14-ymd.month)/12);\n unsigned short y = static_cast(ymd.year + 4800 - a);\n unsigned short m = static_cast(ymd.month + 12*a - 3);\n unsigned long d = ymd.day + ((153*m + 2)/5) + 365*y + (y/4) - (y/100) + (y/400) - 32045;\n return d;\n }\n\n //! Convert a year-month-day into the julian day number\n /*! Since this implementation uses julian day internally, this is the same as the day_number.\n */\n template\n BOOST_DATE_TIME_INLINE\n date_int_type_\n gregorian_calendar_base::julian_day_number(const ymd_type& ymd)\n {\n return day_number(ymd);\n }\n\n //! Convert year-month-day into a modified julian day number\n /*! The day number is an absolute number of days.\n * MJD 0 thus started on 17 Nov 1858(Gregorian) at 00:00:00 UTC\n */\n template\n BOOST_DATE_TIME_INLINE\n date_int_type_\n gregorian_calendar_base::modjulian_day_number(const ymd_type& ymd)\n {\n return julian_day_number(ymd)-2400001; //prerounded\n }\n\n //! Change a day number into a year-month-day\n template\n BOOST_DATE_TIME_INLINE\n ymd_type_\n gregorian_calendar_base::from_day_number(date_int_type dayNumber)\n {\n date_int_type a = dayNumber + 32044;\n date_int_type b = (4*a + 3)/146097;\n date_int_type c = a-((146097*b)/4);\n date_int_type d = (4*c + 3)/1461;\n date_int_type e = c - (1461*d)/4;\n date_int_type m = (5*e + 2)/153;\n unsigned short day = static_cast(e - ((153*m + 2)/5) + 1);\n unsigned short month = static_cast(m + 3 - 12 * (m/10));\n year_type year = static_cast(100*b + d - 4800 + (m/10));\n //std::cout << year << \"-\" << month << \"-\" << day << \"\\n\";\n\n return ymd_type(static_cast(year),month,day);\n }\n\n //! Change a day number into a year-month-day\n template\n BOOST_DATE_TIME_INLINE\n ymd_type_\n gregorian_calendar_base::from_julian_day_number(date_int_type dayNumber)\n {\n date_int_type a = dayNumber + 32044;\n date_int_type b = (4*a+3)/146097;\n date_int_type c = a - ((146097*b)/4);\n date_int_type d = (4*c + 3)/1461;\n date_int_type e = c - ((1461*d)/4);\n date_int_type m = (5*e + 2)/153;\n unsigned short day = static_cast(e - ((153*m + 2)/5) + 1);\n unsigned short month = static_cast(m + 3 - 12 * (m/10));\n year_type year = static_cast(100*b + d - 4800 + (m/10));\n //std::cout << year << \"-\" << month << \"-\" << day << \"\\n\";\n\n return ymd_type(year,month,day);\n }\n\n //! Change a modified julian day number into a year-month-day\n template\n BOOST_DATE_TIME_INLINE\n ymd_type_\n gregorian_calendar_base::from_modjulian_day_number(date_int_type dayNumber) {\n date_int_type jd = dayNumber + 2400001; //is 2400000.5 prerounded\n return from_julian_day_number(jd);\n }\n\n //! Determine if the provided year is a leap year\n /*!\n *@return true if year is a leap year, false otherwise\n */\n template\n BOOST_DATE_TIME_INLINE\n bool\n gregorian_calendar_base::is_leap_year(year_type year)\n {\n //divisible by 4, not if divisible by 100, but true if divisible by 400\n return (!(year % 4)) && ((year % 100) || (!(year % 400)));\n }\n\n //! Calculate the last day of the month\n /*! Find the day which is the end of the month given year and month\n * No error checking is performed.\n */\n template\n BOOST_DATE_TIME_INLINE\n unsigned short\n gregorian_calendar_base::end_of_month_day(year_type year,\n month_type month)\n {\n switch (month) {\n case 2:\n if (is_leap_year(year)) {\n return 29;\n } else {\n return 28;\n };\n case 4:\n case 6:\n case 9:\n case 11:\n return 30;\n default:\n return 31;\n };\n\n }\n\n //! Provide the ymd_type specification for the calandar start\n template\n BOOST_DATE_TIME_INLINE\n ymd_type_\n gregorian_calendar_base::epoch()\n {\n return ymd_type(1400,1,1);\n }\n\n //! Defines length of a week for week calculations\n template\n BOOST_DATE_TIME_INLINE\n unsigned short\n gregorian_calendar_base::days_in_week()\n {\n return 7;\n }\n\n\n} } //namespace gregorian\n\n\n"} +{"text": "// Copyright 2012 The Go Authors. All rights reserved.\n// Modified work copyright 2018 Alex Browne. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// embedded types\n\npackage decls3\n\nimport \"unsafe\"\nimport \"fmt\"\n\n// fields with the same name at the same level cancel each other out\n\nfunc _() {\n\ttype (\n\t\tT1 struct { X int }\n\t\tT2 struct { X int }\n\t\tT3 struct { T1; T2 } // X is embedded twice at the same level via T1->X, T2->X\n\t)\n\n\tvar t T3\n\t_ = t /* ERROR \"ambiguous selector\" */ .X\n}\n\nfunc _() {\n\ttype (\n\t\tT1 struct { X int }\n\t\tT2 struct { T1 }\n\t\tT3 struct { T1 }\n\t\tT4 struct { T2; T3 } // X is embedded twice at the same level via T2->T1->X, T3->T1->X\n\t)\n\n\tvar t T4\n\t_ = t /* ERROR \"ambiguous selector\" */ .X\n}\n\nfunc issue4355() {\n\ttype (\n\t T1 struct {X int}\n\t T2 struct {T1}\n\t T3 struct {T2}\n\t T4 struct {T2}\n\t T5 struct {T3; T4} // X is embedded twice at the same level via T3->T2->T1->X, T4->T2->T1->X\n\t)\t\n\n\tvar t T5\n\t_ = t /* ERROR \"ambiguous selector\" */ .X\n}\n\nfunc _() {\n\ttype State int\n\ttype A struct{ State }\n\ttype B struct{ fmt.State }\n\ttype T struct{ A; B }\n\n\tvar t T\n\t_ = t /* ERROR \"ambiguous selector\" */ .State\n}\n\n// Embedded fields can be predeclared types.\n\nfunc _() {\n\ttype T0 struct{\n\t\tint\n\t\tfloat32\n\t\tf int\n\t}\n\tvar x T0\n\t_ = x.int\n\t_ = x.float32\n\t_ = x.f\n\n\ttype T1 struct{\n\t\tT0\n\t}\n\tvar y T1\n\t_ = y.int\n\t_ = y.float32\n\t_ = y.f\n}\n\n// Restrictions on embedded field types.\n\nfunc _() {\n\ttype I1 interface{}\n\ttype I2 interface{}\n\ttype P1 *int\n\ttype P2 *int\n\ttype UP unsafe.Pointer\n\n\ttype T1 struct {\n\t\tI1\n\t\t* /* ERROR \"cannot be a pointer to an interface\" */ I2\n\t\t* /* ERROR \"cannot be a pointer to an interface\" */ error\n\t\tP1 /* ERROR \"cannot be a pointer\" */\n\t\t* /* ERROR \"cannot be a pointer\" */ P2\n\t}\n\n\t// unsafe.Pointers are treated like regular pointers when embedded\n\ttype T2 struct {\n\t\tunsafe /* ERROR \"cannot be unsafe.Pointer\" */ .Pointer\n\t\t*/* ERROR \"cannot be unsafe.Pointer\" */ unsafe.Pointer\n\t\tUP /* ERROR \"cannot be unsafe.Pointer\" */\n\t\t* /* ERROR \"cannot be unsafe.Pointer\" */ UP\n\t}\n}\n\n// Named types that are pointers.\n\ntype S struct{ x int }\nfunc (*S) m() {}\ntype P *S\n\nfunc _() {\n\tvar s *S\n\t_ = s.x\n\t_ = s.m\n\n\tvar p P\n\t_ = p.x\n\t_ = p /* ERROR \"no field or method\" */ .m\n\t_ = P /* ERROR \"no field or method\" */ .m\n}\n\n// Borrowed from the FieldByName test cases in reflect/all_test.go.\n\ntype D1 struct {\n\td int\n}\ntype D2 struct {\n\td int\n}\n\ntype S0 struct {\n\tA, B, C int\n\tD1\n\tD2\n}\n\ntype S1 struct {\n\tB int\n\tS0\n}\n\ntype S2 struct {\n\tA int\n\t*S1\n}\n\ntype S1x struct {\n\tS1\n}\n\ntype S1y struct {\n\tS1\n}\n\ntype S3 struct {\n\tS1x\n\tS2\n\tD, E int\n\t*S1y\n}\n\ntype S4 struct {\n\t*S4\n\tA int\n}\n\n// The X in S6 and S7 annihilate, but they also block the X in S8.S9.\ntype S5 struct {\n\tS6\n\tS7\n\tS8\n}\n\ntype S6 struct {\n\tX int\n}\n\ntype S7 S6\n\ntype S8 struct {\n\tS9\n}\n\ntype S9 struct {\n\tX int\n\tY int\n}\n\n// The X in S11.S6 and S12.S6 annihilate, but they also block the X in S13.S8.S9.\ntype S10 struct {\n\tS11\n\tS12\n\tS13\n}\n\ntype S11 struct {\n\tS6\n}\n\ntype S12 struct {\n\tS6\n}\n\ntype S13 struct {\n\tS8\n}\n\nfunc _() {\n\t_ = struct /* ERROR \"no field or method\" */ {}{}.Foo\n\t_ = S0{}.A\n\t_ = S0 /* ERROR \"no field or method\" */ {}.D\n\t_ = S1{}.A\n\t_ = S1{}.B\n\t_ = S1{}.S0\n\t_ = S1{}.C\n\t_ = S2{}.A\n\t_ = S2{}.S1\n\t_ = S2{}.B\n\t_ = S2{}.C\n\t_ = S2 /* ERROR \"no field or method\" */ {}.D\n\t_ = S3 /* ERROR \"ambiguous selector\" */ {}.S1\n\t_ = S3{}.A\n\t_ = S3 /* ERROR \"ambiguous selector\" */ {}.B\n\t_ = S3{}.D\n\t_ = S3{}.E\n\t_ = S4{}.A\n\t_ = S4 /* ERROR \"no field or method\" */ {}.B\n\t_ = S5 /* ERROR \"ambiguous selector\" */ {}.X\n\t_ = S5{}.Y\n\t_ = S10 /* ERROR \"ambiguous selector\" */ {}.X\n\t_ = S10{}.Y\n}\n\n// Borrowed from the FieldByName benchmark in reflect/all_test.go.\n\ntype R0 struct {\n\t*R1\n\t*R2\n\t*R3\n\t*R4\n}\n\ntype R1 struct {\n\t*R5\n\t*R6\n\t*R7\n\t*R8\n}\n\ntype R2 R1\ntype R3 R1\ntype R4 R1\n\ntype R5 struct {\n\t*R9\n\t*R10\n\t*R11\n\t*R12\n}\n\ntype R6 R5\ntype R7 R5\ntype R8 R5\n\ntype R9 struct {\n\t*R13\n\t*R14\n\t*R15\n\t*R16\n}\n\ntype R10 R9\ntype R11 R9\ntype R12 R9\n\ntype R13 struct {\n\t*R17\n\t*R18\n\t*R19\n\t*R20\n}\n\ntype R14 R13\ntype R15 R13\ntype R16 R13\n\ntype R17 struct {\n\t*R21\n\t*R22\n\t*R23\n\t*R24\n}\n\ntype R18 R17\ntype R19 R17\ntype R20 R17\n\ntype R21 struct {\n\tX int\n}\n\ntype R22 R21\ntype R23 R21\ntype R24 R21\n\nvar _ = R0 /* ERROR \"ambiguous selector\" */ {}.X\n"} +{"text": "package com.twitter.inject.app\n\npackage object internal {\n type ExitFunction = () => Unit\n}\n"} +{"text": "'use strict';\n\nimport { Module } from '@nestjs/common';\nimport { UsersServices } from '../users.service';\nimport { UsersProvider } from '../users.providers';\nimport { DatabaseModule } from '../../database.module';\n\n@Module({\n modules: [DatabaseModule],\n components: [\n UsersServices,\n UsersProvider\n ]\n})\nexport class UsersModule { }"} +{"text": "\n\n\n\n\n\norg.gradle.nativeplatform.test.plugins (Gradle API 3.2)\n\n\n\n\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n
\n\n
\n\n\n
\n\n
\n

Package org.gradle.nativeplatform.test.plugins

\n
\n
Plugin classes for generic support for testing native binaries.
\n
\n

See: Description

\n
\n
\n
    \n
  • \n\n\n\n\n\n\n\n\n\n\n\n\n
    Class Summary 
    ClassDescription
    NativeBinariesTestPlugin\n
    A plugin that sets up the infrastructure for testing native binaries.
    \n
    \n
    • \n
\n\n\n\n

Package org.gradle.nativeplatform.test.plugins Description

\n
Plugin classes for generic support for testing native binaries.
\n
\n\n
\n\n\n\n\n\n
\n
\n\n\n\n
\n\n
\n\n\n
\n\n\n\n"} +{"text": "package com.thomsonreuters.upa.valueadd.domainrep.rdm.dictionary;\n\nimport com.thomsonreuters.upa.codec.Buffer;\nimport com.thomsonreuters.upa.codec.DataDictionary;\nimport com.thomsonreuters.upa.codec.State;\n\n/**\n * The RDM Dictionary Refresh. Used by an OMM Provider to provide the content of\n * a Dictionary.\n * \n * @see DictionaryMsg\n * @see DictionaryRefreshFlags\n */\npublic interface DictionaryRefresh extends DictionaryMsg\n{\n /**\n * Performs a deep copy of {@link DictionaryRefresh} object.\n *\n * @param destRefreshMsg Message to copy dictionary refresh object into. It cannot be null.\n * \n * @return UPA return value indicating success or failure of copy operation.\n */\n public int copy(DictionaryRefresh destRefreshMsg);\n\n /**\n * The RDM Dictionary refresh flags. Populated by {@link DictionaryRefreshFlags}.\n * \n * @return RDM Dictionary refresh flag\n */\n public int flags();\n\n /**\n * The RDM Dictionary refresh flags. Populated by {@link DictionaryRefreshFlags}.\n * \n * @param flags - RDM Dictionary refresh flags\n */\n public void flags(int flags);\n\n /**\n * The verbosity of the dictionary being provided. Populated by\n * DictionaryVerbosityValues.\n * \n * @return verbosity of the dictionary\n * \n * @see com.thomsonreuters.upa.rdm.Dictionary.VerbosityValues\n */\n public int verbosity();\n\n /**\n * The verbosity of the dictionary being provided. Populated by\n * DictionaryVerbosityValues.\n * \n * @param verbosity - verbosity of the dictionary\n * \n * @see com.thomsonreuters.upa.rdm.Dictionary.VerbosityValues\n */\n public void verbosity(int verbosity);\n\n /**\n * Checks presence of the dictionaryId, version, and type fields .\n * \n * Flags may also be bulk-get via {@link #flags()}.\n *\n * @return true - if exists; false if does not exist.\n * @see #flags()\n */\n public boolean checkHasInfo();\n\n /**\n * Applies the flag for presence of the dictionaryId, version, and type\n * members.
\n * \n * This flag is typically not used as this information is automatically\n * added by the encode method when appropriate.\n * \n * Flags may also be bulk-set via {@link #flags(int)}.\n * \n * @see #flags(int)\n * \n */\n public void applyHasInfo();\n\n /**\n * When encoding the message, this points to the dictionary object that is\n * being encoded. When decoding, this is not used.\n * \n * @return DataDictionary\n */\n public DataDictionary dictionary();\n\n /**\n * encDictionary - When encoding the message, this points to the dictionary object that is\n * being encoded. When decoding, this is not used.\n *\n * @param encDictionary the enc dictionary\n */\n public void dictionary(DataDictionary encDictionary);\n\n /**\n * dictionaryName - The name of the dictionary being provided.\n * \n * @return - dictionaryName\n */\n public Buffer dictionaryName();\n \n /**\n * Sets the the dictionaryName field for this message to the user specified\n * buffer. Buffer used by this object's dictionaryName field will be set to\n * passed in buffer's data and position. Note that this creates garbage if\n * buffer is backed by String object.\n *\n * @param dictionaryName the dictionary name\n */\n public void dictionaryName(Buffer dictionaryName);\n\n /**\n * The sequence number of this message.\n * \n * @return sequenceNumber\n */\n public long sequenceNumber();\n\n /**\n * sequenceNumber - The sequence number of this message.\n *\n * @param sequenceNumber the sequence number\n */\n public void sequenceNumber(long sequenceNumber);\n\n /**\n * Checks the presence of sequence number field.\n * \n * Flags may also be bulk-get via {@link #flags()}.\n *\n * @return true - if exists; false if does not exist.\n */\n public boolean checkHasSequenceNumber();\n\n /**\n * Applies the sequence number flag.\n * \n * Flags may also be bulk-set via {@link #flags(int)}.\n */\n public void applyHasSequenceNumber();\n\n /**\n * serviceId - The ID of the service providing the dictionary.\n * \n * @return serviceId\n */\n public int serviceId();\n\n /**\n * serviceId - The ID of the service providing the dictionary.\n *\n * @param serviceId the service id\n */\n public void serviceId(int serviceId);\n\n /**\n * state - The current state of the stream.\n *\n * @return state\n */\n public State state();\n \n /**\n * Sets the state field for the dictionary refresh message.\n *\n * @param state the state\n */\n public void state(State state);\n\n /**\n * The type of the dictionary. Populated by {@link com.thomsonreuters.upa.rdm.Dictionary.Types}.\n * \n * @return dictionaryType\n */\n public int dictionaryType();\n\n /**\n * The type of the dictionary. Populated by {@link com.thomsonreuters.upa.rdm.Dictionary.Types}.\n *\n * @param dictionaryType the dictionary type\n */\n public void dictionaryType(int dictionaryType);\n\n /**\n * When decoding, points to the payload of the message. The application\n * should set the iterator to this buffer and call the appropriate decode\n * method. This will add the data present to the {@link DataDictionary}\n * object. When encoding, this member is not used.\n * \n * @return - payload buffer.\n */\n public Buffer dataBody();\n\n /**\n * This field is initialized with dictionary->minFid and after encoding each\n * part, updated with the start Fid for next encoded part. When decoding,\n * this is not used.\n *\n * @param startFid the start fid\n */\n public void startFid(int startFid);\n\n /**\n * This field is initialized with 0 and after encoding each\n * part, updated with the start Enum Table Count for next encoded part. \n * When decoding, this is not used.\n *\n * @param startEnumTableCount the start enum table count\n */\n public void startEnumTableCount(int startEnumTableCount); \n\n /**\n * This field is initialized with dictionary->minFid and after encoding each\n * part, updated with the start Fid for next encoded part. When decoding,\n * this is not used.\n * \n * @return startFid\n */\n public int startFid();\n \n /**\n * This field is initialized with 0 and after encoding each\n * part, updated with the start Enum Table Count for next encoded part. \n * When decoding, this is not used.\n * \n * @return startEnumTableCount\n */\n public int startEnumTableCount(); \n\n /**\n * Checks the presence of clear cache flag.\n * \n * Flags may also be bulk-get via {@link #flags()}.\n * \n * @return true - if exists; false if does not exist.\n */\n public boolean checkClearCache();\n\n /**\n * Applies clear cache flag.\n * \n * Flags may also be bulk-set via {@link #flags(int)}.\n */\n public void applyClearCache();\n\n /**\n * Checks the presence of refresh complete flag.\n * \n * Flags may also be bulk-get via {@link #flags()}.\n *\n * @return true - if exists; false if does not exist.\n */\n public boolean checkRefreshComplete();\n\n /**\n * Checks the presence of solicited flag.\n * \n * Flags may also be bulk-get via {@link #flags()}.\n * \n * @return true - if exists; false if does not exist.\n */\n public boolean checkSolicited();\n\n /**\n * Applies solicited flag.\n * \n * Flags may also be bulk-set via {@link #flags(int)}.\n */\n public void applySolicited();\n\n /**\n * Applies refresh complete flag.\n * \n * Flags may also be bulk-set via {@link #flags(int)}.\n */\n public void applyRefreshComplete();\n}\n"} +{"text": "This is a generated file for the LaTeX (2e + expl3) validation system.\nDon't change this file in any respect.\n============================================================\nTEST 1: \\l_draw_default_linewidth_dim \n============================================================\n> \\box...=\n\\hbox(284.92755+0.0)x57.30551, direction TLT\n.\\hbox(284.92755+0.0)x57.30551, direction TLT\n..\\glue 0.2\n..\\hbox(0.0+0.0)x0.0, shifted -0.2, direction TLT\n...\\pdfsave\n...\\pdfliteral origin{0.3985 w}\n...\\pdfcolorstack 0 push {0 g 0 G}\n...\\pdfliteral origin{0 J}\n...\\pdfliteral origin{0 j}\n...\\pdfliteral origin{10 M}\n...\\pdfliteral origin{[] 0 d}\n...\\hbox(0.0+0.0)x0.0, direction TLT\n....\\pdfliteral origin{0 0 m}\n....\\pdfliteral origin{28.34647 283.46457 l}\n....\\pdfliteral origin{56.69292 0 l}\n....\\pdfliteral origin{S}\n...\\pdfrestore\n...\\pdfcolorstack 0 pop\n! OK.\n \\l_tmpa_box \nl. ... }\n> \\box...=\n\\hbox(285.52756+0.0)x57.90552, direction TLT\n.\\hbox(285.52756+0.0)x57.90552, direction TLT\n..\\glue 0.5\n..\\hbox(0.0+0.0)x0.0, shifted -0.5, direction TLT\n...\\pdfsave\n...\\pdfliteral origin{0.99626 w}\n...\\pdfcolorstack 0 push {0 g 0 G}\n...\\pdfliteral origin{0 J}\n...\\pdfliteral origin{0 j}\n...\\pdfliteral origin{10 M}\n...\\pdfliteral origin{[] 0 d}\n...\\hbox(0.0+0.0)x0.0, direction TLT\n....\\pdfliteral origin{0 0 m}\n....\\pdfliteral origin{28.34647 283.46457 l}\n....\\pdfliteral origin{56.69292 0 l}\n....\\pdfliteral origin{S}\n...\\pdfrestore\n...\\pdfcolorstack 0 pop\n! OK.\n \\l_tmpa_box \nl. ... }\n============================================================\n============================================================\nTEST 2: \\draw_linewidth:n \n============================================================\n> \\box...=\n\\hbox(285.52756+0.0)x57.90552, direction TLT\n.\\hbox(285.52756+0.0)x57.90552, direction TLT\n..\\glue 0.5\n..\\hbox(0.0+0.0)x0.0, shifted -0.5, direction TLT\n...\\pdfsave\n...\\pdfliteral origin{0.3985 w}\n...\\pdfcolorstack 0 push {0 g 0 G}\n...\\pdfliteral origin{0 J}\n...\\pdfliteral origin{0 j}\n...\\pdfliteral origin{10 M}\n...\\pdfliteral origin{[] 0 d}\n...\\hbox(0.0+0.0)x0.0, direction TLT\n....\\pdfliteral origin{0.99626 w}\n....\\pdfliteral origin{0 0 m}\n....\\pdfliteral origin{28.34647 283.46457 l}\n....\\pdfliteral origin{56.69292 0 l}\n....\\pdfliteral origin{S}\n...\\pdfrestore\n...\\pdfcolorstack 0 pop\n! OK.\n \\l_tmpa_box \nl. ... }\n============================================================\n============================================================\nTEST 3: \\draw_dash_pattern:nn \n============================================================\n> \\box...=\n\\hbox(284.92755+0.0)x57.30551, direction TLT\n.\\hbox(284.92755+0.0)x57.30551, direction TLT\n..\\glue 0.2\n..\\hbox(0.0+0.0)x0.0, shifted -0.2, direction TLT\n...\\pdfsave\n...\\pdfliteral origin{0.3985 w}\n...\\pdfcolorstack 0 push {0 g 0 G}\n...\\pdfliteral origin{0 J}\n...\\pdfliteral origin{0 j}\n...\\pdfliteral origin{10 M}\n...\\pdfliteral origin{[] 0 d}\n...\\hbox(0.0+0.0)x0.0, direction TLT\n....\\pdfliteral origin{[] 0 d}\n....\\pdfliteral origin{0 0 m}\n....\\pdfliteral origin{28.34647 283.46457 l}\n....\\pdfliteral origin{56.69292 0 l}\n....\\pdfliteral origin{S}\n...\\pdfrestore\n...\\pdfcolorstack 0 pop\n! OK.\n \\l_tmpa_box \nl. ... }\n> \\box...=\n\\hbox(284.92755+0.0)x57.30551, direction TLT\n.\\hbox(284.92755+0.0)x57.30551, direction TLT\n..\\glue 0.2\n..\\hbox(0.0+0.0)x0.0, shifted -0.2, direction TLT\n...\\pdfsave\n...\\pdfliteral origin{0.3985 w}\n...\\pdfcolorstack 0 push {0 g 0 G}\n...\\pdfliteral origin{0 J}\n...\\pdfliteral origin{0 j}\n...\\pdfliteral origin{10 M}\n...\\pdfliteral origin{[] 0 d}\n...\\hbox(0.0+0.0)x0.0, direction TLT\n....\\pdfliteral origin{[5.6693 5.6693] 0 d}\n....\\pdfliteral origin{0 0 m}\n....\\pdfliteral origin{28.34647 283.46457 l}\n....\\pdfliteral origin{56.69292 0 l}\n....\\pdfliteral origin{S}\n...\\pdfrestore\n...\\pdfcolorstack 0 pop\n! OK.\n \\l_tmpa_box \nl. ... }\n> \\box...=\n\\hbox(284.92755+0.0)x57.30551, direction TLT\n.\\hbox(284.92755+0.0)x57.30551, direction TLT\n..\\glue 0.2\n..\\hbox(0.0+0.0)x0.0, shifted -0.2, direction TLT\n...\\pdfsave\n...\\pdfliteral origin{0.3985 w}\n...\\pdfcolorstack 0 push {0 g 0 G}\n...\\pdfliteral origin{0 J}\n...\\pdfliteral origin{0 j}\n...\\pdfliteral origin{10 M}\n...\\pdfliteral origin{[] 0 d}\n...\\hbox(0.0+0.0)x0.0, direction TLT\n....\\pdfliteral origin{[5.6693 5.6693] 2.83464 d}\n....\\pdfliteral origin{0 0 m}\n....\\pdfliteral origin{28.34647 283.46457 l}\n....\\pdfliteral origin{56.69292 0 l}\n....\\pdfliteral origin{S}\n...\\pdfrestore\n...\\pdfcolorstack 0 pop\n! OK.\n \\l_tmpa_box \nl. ... }\n============================================================\n============================================================\nTEST 4: \\draw_cap_ ...\n============================================================\n> \\box...=\n\\hbox(284.92755+0.0)x57.30551, direction TLT\n.\\hbox(284.92755+0.0)x57.30551, direction TLT\n..\\glue 0.2\n..\\hbox(0.0+0.0)x0.0, shifted -0.2, direction TLT\n...\\pdfsave\n...\\pdfliteral origin{0.3985 w}\n...\\pdfcolorstack 0 push {0 g 0 G}\n...\\pdfliteral origin{0 J}\n...\\pdfliteral origin{0 j}\n...\\pdfliteral origin{10 M}\n...\\pdfliteral origin{[] 0 d}\n...\\hbox(0.0+0.0)x0.0, direction TLT\n....\\pdfliteral origin{0 J}\n....\\pdfliteral origin{0 0 m}\n....\\pdfliteral origin{28.34647 283.46457 l}\n....\\pdfliteral origin{56.69292 0 l}\n....\\pdfliteral origin{S}\n...\\pdfrestore\n...\\pdfcolorstack 0 pop\n! OK.\n \\l_tmpa_box \nl. ... }\n> \\box...=\n\\hbox(284.92755+0.0)x57.30551, direction TLT\n.\\hbox(284.92755+0.0)x57.30551, direction TLT\n..\\glue 0.2\n..\\hbox(0.0+0.0)x0.0, shifted -0.2, direction TLT\n...\\pdfsave\n...\\pdfliteral origin{0.3985 w}\n...\\pdfcolorstack 0 push {0 g 0 G}\n...\\pdfliteral origin{0 J}\n...\\pdfliteral origin{0 j}\n...\\pdfliteral origin{10 M}\n...\\pdfliteral origin{[] 0 d}\n...\\hbox(0.0+0.0)x0.0, direction TLT\n....\\pdfliteral origin{2 J}\n....\\pdfliteral origin{0 0 m}\n....\\pdfliteral origin{28.34647 283.46457 l}\n....\\pdfliteral origin{56.69292 0 l}\n....\\pdfliteral origin{S}\n...\\pdfrestore\n...\\pdfcolorstack 0 pop\n! OK.\n \\l_tmpa_box \nl. ... }\n> \\box...=\n\\hbox(284.92755+0.0)x57.30551, direction TLT\n.\\hbox(284.92755+0.0)x57.30551, direction TLT\n..\\glue 0.2\n..\\hbox(0.0+0.0)x0.0, shifted -0.2, direction TLT\n...\\pdfsave\n...\\pdfliteral origin{0.3985 w}\n...\\pdfcolorstack 0 push {0 g 0 G}\n...\\pdfliteral origin{0 J}\n...\\pdfliteral origin{0 j}\n...\\pdfliteral origin{10 M}\n...\\pdfliteral origin{[] 0 d}\n...\\hbox(0.0+0.0)x0.0, direction TLT\n....\\pdfliteral origin{1 J}\n....\\pdfliteral origin{0 0 m}\n....\\pdfliteral origin{28.34647 283.46457 l}\n....\\pdfliteral origin{56.69292 0 l}\n....\\pdfliteral origin{S}\n...\\pdfrestore\n...\\pdfcolorstack 0 pop\n! OK.\n \\l_tmpa_box \nl. ... }\n============================================================\n============================================================\nTEST 5: \\draw_join_ ...\n============================================================\n> \\box...=\n\\hbox(284.92755+0.0)x57.30551, direction TLT\n.\\hbox(284.92755+0.0)x57.30551, direction TLT\n..\\glue 0.2\n..\\hbox(0.0+0.0)x0.0, shifted -0.2, direction TLT\n...\\pdfsave\n...\\pdfliteral origin{0.3985 w}\n...\\pdfcolorstack 0 push {0 g 0 G}\n...\\pdfliteral origin{0 J}\n...\\pdfliteral origin{0 j}\n...\\pdfliteral origin{10 M}\n...\\pdfliteral origin{[] 0 d}\n...\\hbox(0.0+0.0)x0.0, direction TLT\n....\\pdfliteral origin{2 j}\n....\\pdfliteral origin{0 0 m}\n....\\pdfliteral origin{28.34647 283.46457 l}\n....\\pdfliteral origin{56.69292 0 l}\n....\\pdfliteral origin{S}\n...\\pdfrestore\n...\\pdfcolorstack 0 pop\n! OK.\n \\l_tmpa_box \nl. ... }\n> \\box...=\n\\hbox(284.92755+0.0)x57.30551, direction TLT\n.\\hbox(284.92755+0.0)x57.30551, direction TLT\n..\\glue 0.2\n..\\hbox(0.0+0.0)x0.0, shifted -0.2, direction TLT\n...\\pdfsave\n...\\pdfliteral origin{0.3985 w}\n...\\pdfcolorstack 0 push {0 g 0 G}\n...\\pdfliteral origin{0 J}\n...\\pdfliteral origin{0 j}\n...\\pdfliteral origin{10 M}\n...\\pdfliteral origin{[] 0 d}\n...\\hbox(0.0+0.0)x0.0, direction TLT\n....\\pdfliteral origin{0 j}\n....\\pdfliteral origin{0 0 m}\n....\\pdfliteral origin{28.34647 283.46457 l}\n....\\pdfliteral origin{56.69292 0 l}\n....\\pdfliteral origin{S}\n...\\pdfrestore\n...\\pdfcolorstack 0 pop\n! OK.\n \\l_tmpa_box \nl. ... }\n> \\box...=\n\\hbox(284.92755+0.0)x57.30551, direction TLT\n.\\hbox(284.92755+0.0)x57.30551, direction TLT\n..\\glue 0.2\n..\\hbox(0.0+0.0)x0.0, shifted -0.2, direction TLT\n...\\pdfsave\n...\\pdfliteral origin{0.3985 w}\n...\\pdfcolorstack 0 push {0 g 0 G}\n...\\pdfliteral origin{0 J}\n...\\pdfliteral origin{0 j}\n...\\pdfliteral origin{10 M}\n...\\pdfliteral origin{[] 0 d}\n...\\hbox(0.0+0.0)x0.0, direction TLT\n....\\pdfliteral origin{1 j}\n....\\pdfliteral origin{0 0 m}\n....\\pdfliteral origin{28.34647 283.46457 l}\n....\\pdfliteral origin{56.69292 0 l}\n....\\pdfliteral origin{S}\n...\\pdfrestore\n...\\pdfcolorstack 0 pop\n! OK.\n \\l_tmpa_box \nl. ... }\n============================================================\n============================================================\nTEST 6: \\draw_miterlimit:n \n============================================================\n> \\box...=\n\\hbox(284.92755+0.0)x57.30551, direction TLT\n.\\hbox(284.92755+0.0)x57.30551, direction TLT\n..\\glue 0.2\n..\\hbox(0.0+0.0)x0.0, shifted -0.2, direction TLT\n...\\pdfsave\n...\\pdfliteral origin{0.3985 w}\n...\\pdfcolorstack 0 push {0 g 0 G}\n...\\pdfliteral origin{0 J}\n...\\pdfliteral origin{0 j}\n...\\pdfliteral origin{10 M}\n...\\pdfliteral origin{[] 0 d}\n...\\hbox(0.0+0.0)x0.0, direction TLT\n....\\pdfliteral origin{1 M}\n....\\pdfliteral origin{0 0 m}\n....\\pdfliteral origin{28.34647 283.46457 l}\n....\\pdfliteral origin{56.69292 0 l}\n....\\pdfliteral origin{S}\n...\\pdfrestore\n...\\pdfcolorstack 0 pop\n! OK.\n \\l_tmpa_box \nl. ... }\n> \\box...=\n\\hbox(284.92755+0.0)x57.30551, direction TLT\n.\\hbox(284.92755+0.0)x57.30551, direction TLT\n..\\glue 0.2\n..\\hbox(0.0+0.0)x0.0, shifted -0.2, direction TLT\n...\\pdfsave\n...\\pdfliteral origin{0.3985 w}\n...\\pdfcolorstack 0 push {0 g 0 G}\n...\\pdfliteral origin{0 J}\n...\\pdfliteral origin{0 j}\n...\\pdfliteral origin{10 M}\n...\\pdfliteral origin{[] 0 d}\n...\\hbox(0.0+0.0)x0.0, direction TLT\n....\\pdfliteral origin{2 M}\n....\\pdfliteral origin{0 0 m}\n....\\pdfliteral origin{28.34647 283.46457 l}\n....\\pdfliteral origin{56.69292 0 l}\n....\\pdfliteral origin{S}\n...\\pdfrestore\n...\\pdfcolorstack 0 pop\n! OK.\n \\l_tmpa_box \nl. ... }\n> \\box...=\n\\hbox(284.92755+0.0)x57.30551, direction TLT\n.\\hbox(284.92755+0.0)x57.30551, direction TLT\n..\\glue 0.2\n..\\hbox(0.0+0.0)x0.0, shifted -0.2, direction TLT\n...\\pdfsave\n...\\pdfliteral origin{0.3985 w}\n...\\pdfcolorstack 0 push {0 g 0 G}\n...\\pdfliteral origin{0 J}\n...\\pdfliteral origin{0 j}\n...\\pdfliteral origin{10 M}\n...\\pdfliteral origin{[] 0 d}\n...\\hbox(0.0+0.0)x0.0, direction TLT\n....\\pdfliteral origin{10 M}\n....\\pdfliteral origin{0 0 m}\n....\\pdfliteral origin{28.34647 283.46457 l}\n....\\pdfliteral origin{56.69292 0 l}\n....\\pdfliteral origin{S}\n...\\pdfrestore\n...\\pdfcolorstack 0 pop\n! OK.\n \\l_tmpa_box \nl. ... }\n============================================================\n============================================================\nTEST 7: \\color_select:n \n============================================================\n> \\box...=\n\\hbox(284.92755+0.0)x57.30551, direction TLT\n.\\hbox(284.92755+0.0)x57.30551, direction TLT\n..\\glue 0.2\n..\\hbox(0.0+0.0)x0.0, shifted -0.2, direction TLT\n...\\pdfsave\n...\\pdfliteral origin{0.3985 w}\n...\\pdfcolorstack 0 push {0 g 0 G}\n...\\pdfliteral origin{0 J}\n...\\pdfliteral origin{0 j}\n...\\pdfliteral origin{10 M}\n...\\pdfliteral origin{[] 0 d}\n...\\hbox(0.0+0.0)x0.0, direction TLT\n....\\pdfcolorstack 0 push {1.0 0.0 0.0 rg 1.0 0.0 0.0 RG}\n....\\pdfliteral origin{0 0 m}\n....\\pdfliteral origin{28.34647 283.46457 l}\n....\\pdfliteral origin{56.69292 0 l}\n....\\pdfliteral origin{S}\n....\\pdfcolorstack 0 pop\n...\\pdfrestore\n...\\pdfcolorstack 0 pop\n! OK.\n \\l_tmpa_box \nl. ... }\n> \\box...=\n\\hbox(284.92755+0.0)x57.30551, direction TLT\n.\\hbox(284.92755+0.0)x57.30551, direction TLT\n..\\glue 0.2\n..\\hbox(0.0+0.0)x0.0, shifted -0.2, direction TLT\n...\\pdfsave\n...\\pdfliteral origin{0.3985 w}\n...\\pdfcolorstack 0 push {0 g 0 G}\n...\\pdfliteral origin{0 J}\n...\\pdfliteral origin{0 j}\n...\\pdfliteral origin{10 M}\n...\\pdfliteral origin{[] 0 d}\n...\\hbox(0.0+0.0)x0.0, direction TLT\n....\\pdfcolorstack 0 push {1.0 0.0 0.0 rg 1.0 0.0 0.0 RG}\n....\\pdfliteral origin{0 0 28.34647 28.34647 re}\n....\\pdfliteral origin{f}\n....\\pdfcolorstack 0 push {1.0 0.0 0.0 rg 1.0 0.0 0.0 RG}\n....\\pdfliteral origin{0 0 28.34647 28.34647 re}\n....\\pdfliteral origin{B}\n....\\pdfcolorstack 0 push {1.0 0.0 0.0 rg 1.0 0.0 0.0 RG}\n....\\pdfliteral origin{0 0 m}\n....\\pdfliteral origin{28.34647 283.46457 l}\n....\\pdfliteral origin{56.69292 0 l}\n....\\pdfliteral origin{S}\n....\\pdfcolorstack 0 pop\n....\\pdfcolorstack 0 pop\n....\\pdfcolorstack 0 pop\n...\\pdfrestore\n...\\pdfcolorstack 0 pop\n! OK.\n \\l_tmpa_box \nl. ... }\n============================================================\n============================================================\nTEST 8: \\color_fill:n \n============================================================\n> \\box...=\n\\hbox(284.92755+0.0)x57.30551, direction TLT\n.\\hbox(284.92755+0.0)x57.30551, direction TLT\n..\\glue 0.2\n..\\hbox(0.0+0.0)x0.0, shifted -0.2, direction TLT\n...\\pdfsave\n...\\pdfliteral origin{0.3985 w}\n...\\pdfcolorstack 0 push {0 g 0 G}\n...\\pdfliteral origin{0 J}\n...\\pdfliteral origin{0 j}\n...\\pdfliteral origin{10 M}\n...\\pdfliteral origin{[] 0 d}\n...\\hbox(0.0+0.0)x0.0, direction TLT\n....\\pdfliteral origin{1.0 0.0 0.0 rg}\n....\\pdfliteral origin{0 0 28.34647 28.34647 re}\n....\\pdfliteral origin{f}\n....\\pdfliteral origin{1.0 0.0 0.0 rg}\n....\\pdfliteral origin{0 0 28.34647 28.34647 re}\n....\\pdfliteral origin{B}\n....\\pdfliteral origin{1.0 0.0 0.0 rg}\n....\\pdfliteral origin{0 0 m}\n....\\pdfliteral origin{28.34647 283.46457 l}\n....\\pdfliteral origin{56.69292 0 l}\n....\\pdfliteral origin{S}\n...\\pdfrestore\n...\\pdfcolorstack 0 pop\n! OK.\n \\l_tmpa_box \nl. ... }\n============================================================\n============================================================\nTEST 9: \\color_stroke:n \n============================================================\n> \\box...=\n\\hbox(284.92755+0.0)x57.30551, direction TLT\n.\\hbox(284.92755+0.0)x57.30551, direction TLT\n..\\glue 0.2\n..\\hbox(0.0+0.0)x0.0, shifted -0.2, direction TLT\n...\\pdfsave\n...\\pdfliteral origin{0.3985 w}\n...\\pdfcolorstack 0 push {0 g 0 G}\n...\\pdfliteral origin{0 J}\n...\\pdfliteral origin{0 j}\n...\\pdfliteral origin{10 M}\n...\\pdfliteral origin{[] 0 d}\n...\\hbox(0.0+0.0)x0.0, direction TLT\n....\\pdfliteral origin{1.0 0.0 0.0 RG}\n....\\pdfliteral origin{0 0 28.34647 28.34647 re}\n....\\pdfliteral origin{f}\n....\\pdfliteral origin{1.0 0.0 0.0 RG}\n....\\pdfliteral origin{0 0 28.34647 28.34647 re}\n....\\pdfliteral origin{B}\n....\\pdfliteral origin{1.0 0.0 0.0 RG}\n....\\pdfliteral origin{0 0 m}\n....\\pdfliteral origin{28.34647 283.46457 l}\n....\\pdfliteral origin{56.69292 0 l}\n....\\pdfliteral origin{S}\n...\\pdfrestore\n...\\pdfcolorstack 0 pop\n! OK.\n \\l_tmpa_box \nl. ... }\n============================================================\n"} +{"text": "sha256:93f857be0d9c7f462604b53b84271a30793c521d7f8ff6a1a678b0f2bd2825ff\n"} +{"text": "class ProfileSet {\n constructor(items, showOnlyMatchingRoles, baseAccountId) {\n // Map that has entries { : }\n this.srcProfileMap = {};\n let destsBySrcMap = {}; // { : [... ] }\n let independentDests = [];\n this.baseAccountId = baseAccountId;\n\n items.forEach(item => {\n if (item.source_profile) {\n if (item.source_profile in destsBySrcMap) {\n destsBySrcMap[item.source_profile].push(item);\n } else {\n destsBySrcMap[item.source_profile] = [item];\n }\n } else if (item.aws_account_id && item.role_name && !item.target_role_name) {\n independentDests.push(item);\n } else {\n this.srcProfileMap[item.aws_account_id] = item;\n }\n });\n\n let complexDests = [];\n let baseProfile = this._getBaseProfile();\n if (baseProfile) {\n complexDests = this._decideComplexDestProfiles(baseProfile, destsBySrcMap, { showOnlyMatchingRoles })\n delete destsBySrcMap[baseProfile.profile];\n }\n\n // To display roles on the list\n this.destProfiles = [].concat(independentDests).concat(complexDests)\n\n // For excluding unrelated profiles from recent history\n this.excludedNames = this._decideExcludedNames(destsBySrcMap)\n }\n\n _getBaseProfile() {\n return this.srcProfileMap[this.baseAccountId];\n }\n\n _decideComplexDestProfiles(baseProfile, destsBySrcMap, { showOnlyMatchingRoles }) {\n let profiles = (destsBySrcMap[baseProfile.profile] || []).map(profile => {\n if (!profile.role_name) {\n profile.role_name = baseProfile.target_role_name\n }\n\n if (!profile.region && baseProfile.target_region) {\n profile.region = baseProfile.target_region\n }\n \n return profile\n })\n\n if (showOnlyMatchingRoles && document.body.className.includes('user-type-federated')) {\n let baseRole = getAssumedRole();\n profiles = profiles.filter(el => el.role_name === baseRole)\n }\n return profiles;\n }\n\n _decideExcludedNames(destsBySrcMap) {\n let result = [];\n for (let name in destsBySrcMap) {\n destsBySrcMap[name].forEach(item => {\n result.push(item.profile);\n });\n }\n return result;\n }\n}\n"} +{"text": "/*\n * Wire\n * Copyright (C) 2018 Wire Swiss GmbH\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see http://www.gnu.org/licenses/.\n *\n */\n\nimport {iterateItem} from 'Util/ArrayUtil';\nimport {KEY} from 'Util/KeyboardUtil';\nimport {formatLocale} from 'Util/TimeUtil';\nimport ko from 'knockout';\nimport {amplify} from 'amplify';\n\nimport {WebAppEvents} from '@wireapp/webapp-events';\nimport {Modal} from '../ui/Modal';\nimport type {MainViewModel} from './MainViewModel';\nimport type {ConversationRepository} from '../conversation/ConversationRepository';\nimport type {AssetRepository} from '../assets/AssetRepository';\nimport type {ActionsViewModel} from './ActionsViewModel';\nimport type {Conversation} from '../entity/Conversation';\nimport type {ContentMessage} from '../entity/message/ContentMessage';\nimport type {MediumImage} from '../entity/message/MediumImage';\n\nexport class ImageDetailViewViewModel {\n elementId: 'detail-view';\n actionsViewModel: ActionsViewModel;\n source: string;\n imageModal: Modal;\n imageSrc: ko.Observable;\n imageVisible: ko.Observable;\n conversationEntity: ko.Observable;\n items: ko.ObservableArray;\n messageEntity: ko.Observable;\n\n constructor(\n mainViewModel: MainViewModel,\n private readonly conversationRepository: ConversationRepository,\n private readonly assetRepository: AssetRepository,\n ) {\n this.elementId = 'detail-view';\n\n this.actionsViewModel = mainViewModel.actions;\n this.source = undefined;\n\n this.imageModal = undefined;\n this.imageSrc = ko.observable();\n this.imageVisible = ko.observable(false);\n\n this.conversationEntity = ko.observable();\n this.items = ko.observableArray();\n this.messageEntity = ko.observable();\n this.messageEntity.subscribe(messageEntity => {\n if (messageEntity) {\n const conversationId = messageEntity.conversation_id;\n const isExpectedId = this.conversationEntity() ? conversationId === this.conversationEntity().id : false;\n if (!isExpectedId) {\n this.conversationRepository\n .get_conversation_by_id(conversationId)\n .then(conversationEntity => this.conversationEntity(conversationEntity));\n }\n }\n });\n\n amplify.subscribe(WebAppEvents.CONVERSATION.DETAIL_VIEW.SHOW, this.show);\n\n ko.applyBindings(this, document.getElementById(this.elementId));\n }\n\n beforeHideCallback = () => {\n this.imageVisible(false);\n };\n\n hideCallback = () => {\n $(document).off('keydown.lightbox');\n window.URL.revokeObjectURL(this.imageSrc());\n\n this.imageSrc(undefined);\n this.items.removeAll();\n this.messageEntity(undefined);\n this.source = undefined;\n\n amplify.unsubscribe(WebAppEvents.CONVERSATION.EPHEMERAL_MESSAGE_TIMEOUT, this.messageExpired);\n amplify.unsubscribe(WebAppEvents.CONVERSATION.MESSAGE.ADDED, this.messageAdded);\n amplify.unsubscribe(WebAppEvents.CONVERSATION.MESSAGE.REMOVED, this.messageRemoved);\n };\n\n show = (messageEntity: ContentMessage, messageEntities: ContentMessage[], source: string) => {\n this.items(messageEntities);\n this.messageEntity(messageEntity);\n this.source = source;\n\n amplify.subscribe(WebAppEvents.CONVERSATION.EPHEMERAL_MESSAGE_TIMEOUT, this.messageExpired);\n amplify.subscribe(WebAppEvents.CONVERSATION.MESSAGE.ADDED, this.messageAdded);\n amplify.subscribe(WebAppEvents.CONVERSATION.MESSAGE.REMOVED, this.messageRemoved);\n\n if (!this.imageModal) {\n this.imageModal = new Modal('#detail-view', this.hideCallback, this.beforeHideCallback);\n }\n\n this.imageModal.show();\n\n this.loadImage();\n $(document).on('keydown.lightbox', keyboardEvent => {\n switch (keyboardEvent.key) {\n case KEY.ESC: {\n this.clickOnClose();\n break;\n }\n\n case KEY.ARROW_DOWN:\n case KEY.ARROW_RIGHT: {\n this.clickOnShowNext(this, (keyboardEvent as unknown) as MouseEvent);\n break;\n }\n\n case KEY.ARROW_LEFT:\n case KEY.ARROW_UP: {\n this.clickOnShowPrevious(this, (keyboardEvent as unknown) as MouseEvent);\n break;\n }\n\n default:\n break;\n }\n });\n };\n\n messageAdded = (messageEntity: ContentMessage) => {\n const isCurrentConversation = this.conversationEntity().id === messageEntity.conversation_id;\n if (isCurrentConversation) {\n this.items.push(messageEntity);\n }\n };\n\n messageExpired = (messageEntity: ContentMessage) => {\n this.messageRemoved(messageEntity.id, messageEntity.conversation_id);\n };\n\n messageRemoved = (messageId: string, conversationId: string) => {\n const isCurrentConversation = this.conversationEntity().id === conversationId;\n if (isCurrentConversation) {\n const isVisibleMessage = this.messageEntity().id === messageId;\n if (isVisibleMessage) {\n return this.imageModal.hide();\n }\n\n this.items.remove(messageEntity => messageEntity.id === messageId);\n }\n };\n\n formatTimestamp = (timestamp: number) => {\n return formatLocale(timestamp, 'P p');\n };\n\n private readonly loadImage = () => {\n this.imageVisible(false);\n this.assetRepository.load((this.messageEntity().get_first_asset() as MediumImage).resource()).then(blob => {\n if (blob) {\n this.imageSrc(window.URL.createObjectURL(blob));\n this.imageVisible(true);\n }\n });\n };\n\n clickOnClose = () => {\n this.imageModal.hide();\n };\n\n clickOnDownload = () => {\n this.messageEntity().download(this.assetRepository);\n };\n\n clickOnLike = () => {\n this.conversationRepository.toggle_like(this.conversationEntity(), this.messageEntity());\n };\n\n clickOnReply = () => {\n amplify.publish(WebAppEvents.CONVERSATION.SHOW, this.conversationEntity());\n amplify.publish(WebAppEvents.CONVERSATION.MESSAGE.REPLY, this.messageEntity());\n this.imageModal.hide();\n };\n\n clickOnShowNext = (imageDetailViewViewModel: unknown, event: MouseEvent) => {\n event.stopPropagation();\n this.iterateImage(true);\n };\n\n clickOnShowPrevious = (imageDetailViewViewModel: unknown, event: MouseEvent) => {\n event.stopPropagation();\n this.iterateImage(false);\n };\n\n private readonly iterateImage = (reverse: boolean) => {\n const messageEntity = iterateItem(this.items(), this.messageEntity(), reverse);\n\n if (messageEntity) {\n this.messageEntity(messageEntity);\n this.loadImage();\n }\n };\n}\n"} +{"text": "(function () {\n var ast, ASTBase, KAL_RESERVED, KAL_RVALUE_OK, JS_RESERVED, JS_RVALUE_OK, KEYWORDS, RVALUE_OK, Nodes, v, ki$3, kobj$3;\n var __hasProp = {}.hasOwnProperty, __extends = function (child, parent) { for (var key in parent) { if (__hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; }\n var k$indexof = [].indexOf || function (item) { for (var i = 0, l = this.length; i < l; i++) { if (i in this && this[i] === item) return i; } return -1; };\n /* Kal Grammar \n ----------- \n \n This file defines the parser grammar in the form of abstract syntax tree classes that inherit from `ASTBase`. Each class implements a `parse` method which, given the token stream, attempts to parse the stream as a particular language construct. \n \n The end result of a call to `parse` is a tree of objects representing a language construct or an error if the particular class could not parse the token stream. \n \n The `ast` module defines the base class for these grammar definitions along with utility methods to recursively create subtrees using these classes. \n */\n ast = require('./ast');\n ASTBase = ast.ASTBase;\n /* \n Reserved Words \n ============== \n \n Reserved words are used to determine whether assignments are valid (for example, you cannot assign a value to `if`). They are also used by other files for REPL autocompletion and by the `sugar` module to determine where to insert implicit parentheses. \n \n **Words that are reserved in Kal and cannot be used for identifiers** \n */\n KAL_RESERVED = ['constructor','true', 'false', 'yes', 'no', 'on', 'off', 'function', 'method', 'task', 'return', 'if', 'else', 'unless', 'except', 'when', 'otherwise', 'and', 'or', 'but', 'xor', 'not', 'nor', 'bitwise', 'mod', 'new', 'while', 'until', 'for', 'class', 'exists', 'doesnt', 'exist', 'is', 'isnt', 'inherits', 'from', 'nothing', 'empty', 'null', 'break', 'continue', 'try', 'catch', 'throw', 'raise', 'fail', 'with', 'arguments', 'of', 'in', 'instanceof', 'property', 'until', 'me', 'this', 'typeof', 'at', 'to'];\n /* \n **Words that are reserved in Kal but can be used as r-values** \n */\n KAL_RVALUE_OK = ['true', 'false', 'yes', 'no', 'on', 'off', 'me', 'this', 'super', 'arguments', 'none', 'nothing'];\n /* \n **JavaScript reserved words** \n \n Note `label` is not included because it can technically be used as an identifier (and it's more useful as a variable name than for its intended purpose). `undefined`, while technically assignable, is included here to avoid confusion and terribleness. \n */\n JS_RESERVED = ['constructor','break', 'case', 'catch', 'continue', 'default', 'delete', 'do', 'else', 'finally', 'for', 'function', 'if', 'in', 'instanceof', 'new', 'return', 'switch', 'this', 'throw', 'try', 'typeof', 'var', 'void', 'while', 'with', 'class', 'enum', 'export', 'extends', 'import', 'super', 'implements', 'interface', 'let', 'package', 'private', 'protected', 'public', 'static', 'yield', 'null', 'true', 'false', 'undefined', 'const'];\n /* \n JavaScript words that are reserved but usable as rvalues. In the future `super` may get added to this list depending on the ES6 spec. \n */\n JS_RVALUE_OK = ['this', 'null', 'true', 'false', 'undefined'];\n /* \n JavaScript keywords are considered reserved in Kal. It's OK if these lists have some duplicates. \n */\n KEYWORDS = KAL_RESERVED.concat(JS_RESERVED);\n RVALUE_OK = KAL_RVALUE_OK.concat(JS_RVALUE_OK);\n /* \n Other modules use these values as well, such as the `sugar` module which checks for reserved words when generating implicit parentheses. \n */\n exports.KEYWORDS = KEYWORDS;\n exports.RVALUE_OK = RVALUE_OK;\n\n /* \n Block \n ===== \n \n `Block : NEWLINE INDENT Statment* DEDENT` \n \n A code block (`Block`) is defined as a newline + indent followed by zero or more `Statment`s, then a dedent. In practice it is impossible to have an indent followed immediately by a dedent, so technically this class requires one or more `Statment`s. \n */\n\n function Block() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(Block,ASTBase);\n\n Block.prototype.parse = function () {\n this.req('NEWLINE');\n this.lock();\n this.req('INDENT');\n this.lock();\n this.statements = [];\n while (!(this.opt('DEDENT'))) {\n this.statements.push(this.req(Statement));\n this.lock();\n }\n }\n\n /* \n File \n ==== \n \n `File: Statement* EOF` \n \n The `File` node shares some code generation with `Block`, so it is a subclass of `Block`. It is defined as zero or more statements followed by the end-of-file token. \n */\n\n function File() {\n return Block.prototype.constructor.apply(this,arguments);\n }\n __extends(File,Block);\n\n File.prototype.parse = function () {\n this.lock();\n this.statements = [];\n while (!(this.opt('EOF'))) {\n this.statements.push(this.req(Statement));\n this.lock();\n }\n }\n\n /* \n BlockWithoutIndent \n ================== \n \n `BlockWithoutIndent: NEWLINE Statement* (?=DEDENT|EOF) \n \n `BlockWithoutIndent` is the same as a block (it shares generator code) but it does not require an indent. This is used for `wait for` statements to separate code after asynchronous calls into its own block. \n */\n\n function BlockWithoutIndent() {\n return Block.prototype.constructor.apply(this,arguments);\n }\n __extends(BlockWithoutIndent,Block);\n\n BlockWithoutIndent.prototype.parse = function () {\n this.req('NEWLINE');\n this.lock();\n this.statements = [];\n while (!(this.opt('DEDENT', 'EOF'))) {\n this.statements.push(this.req(Statement));\n this.lock();\n }\n /* \n Unsee the dedent (don't consume it) since it belongs to our parent block. \n */\n this.ts.prev();\n }\n\n /* \n Statement \n ========= \n \n `Statement: (BlankStatement|TryCatch|ClassDefinition|ReturnStatement|WaitForStatement|SimpleWaitForStatement|PauseForStatement|IfStatement|WhileStatement|ForStatement|ThrowStatement|SuperStatement|RunInParallelBlock|LoopControlStatement|AssignmentStatement|ExpressionStatement)` \n \n The `Statement` node is a generic wrapper for the many types of statment/control constructs that are valid inside a block. Keeping these in one class helps keep the code maintainable when we add new node types. \n \n The order in the `me.req` call is important here for two reasons. One, we want to keep the compiler fast by keeping commonly used constructs first if possible. This avoids unnecessary parsing steps. More importantly, things like `ExpressionStatement` need to go last because some `AssignmentStatement`s and other constructs can parse as valid `ExpressionStatement`s. \n */\n\n function Statement() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(Statement,ASTBase);\n\n Statement.prototype.parse = function () {\n this.statement = this.req(BlankStatement, TryCatch, ClassDefinition, ReturnStatement, WaitForStatement, SimpleWaitForStatement, PauseForStatement, IfStatement, WhileStatement, ForStatement, ThrowStatement, SuperStatement, RunInParallelBlock, LoopControlStatement, DeleteStatement, AssignmentStatement, ExpressionStatement);\n }\n\n /* \n LoopControlStatement \n ==================== \n \n `LoopControlStatement: ('break'|'continue')` \n \n This handles the `break` and `continue` keywords. \n */\n\n function LoopControlStatement() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(LoopControlStatement,ASTBase);\n\n LoopControlStatement.prototype.parse = function () {\n this.control = this.req_val('break', 'continue');\n }\n\n /* \n ThrowStatement \n ============== \n \n `ThrowStatement: ('throw'|'raise'|('fail' 'with')) Expression WhenExpression?` \n \n This handles `throw` and its synonyms followed by an expression and an optional tail conditional. \n */\n\n function ThrowStatement() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(ThrowStatement,ASTBase);\n\n ThrowStatement.prototype.parse = function () {\n var specifier;\n specifier = this.req_val('throw', 'raise', 'fail');\n this.specifier = specifier;\n /* \n At this point we lock because it is definitely a `throw` statement. Failure to parse the expression is a syntax error. \n */\n this.lock();\n (specifier.value === 'fail') ? this.req_val('with') : void 0;\n this.expr = this.req(Expression);\n /* \n We also need to check for tail conditionals (`throw \"help\" if error`) \n */\n this.conditional = this.expr.transform_when_statement();\n }\n\n /* \n ReturnStatement \n =============== \n \n `ReturnStatement: 'return' (Expression [',' Expression]*) WhenExpression?` \n \n This handles simple `return`s, `return value`s, and returns with multiple return values. \n */\n\n function ReturnStatement() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(ReturnStatement,ASTBase);\n\n ReturnStatement.prototype.parse = function () {\n var expr;\n this.req_val('return');\n /* \n Definitely a return statement at this point. \n */\n this.lock();\n /* \n Check for a conditional here in case there is no return value (for example `return if a is 2`) \n */\n this.conditional = this.opt(WhenExpression);\n /* \n Returns can have multiple return values, so we keep grabbing expressions followed by commas. \n */\n this.exprs = [];\n if (!((this.conditional != null))) {\n expr = this.opt(Expression);\n if ((expr != null)) {\n this.exprs.push(expr);\n while (this.opt_val(',')) {\n expr = this.req(Expression);\n this.exprs.push(expr);\n }\n /* \n Check again for a conditional after the expression (`return a if a isnt 2`) \n */\n if ((expr != null)) {\n this.conditional = expr.transform_when_statement();\n }\n }\n }\n }\n\n /* \n DeleteStatement \n =============== \n \n `DeleteStatement: 'delete' ('property' IDENTIFIER|STRING)|('item'|'items' NoBracketListExpression) 'from' UnaryExpression` \n \n This statement deletes a property or set of indexes from an object. It supports property deletion as a string (`delete property \"a\" from obj`) or identifier (`delete property a from obj`). It supports index deletion as for a number or array of numbered indexes (`delete item n from obj` or `delete items 1, 2 from obj` or `delete items 2 to 3 from obj`). \n */\n\n function DeleteStatement() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(DeleteStatement,ASTBase);\n\n DeleteStatement.prototype.parse = function () {\n this.req_val('delete');\n this.lock();\n this.specifier = this.req_val('property', 'item', 'items');\n this.lock();\n if (this.specifier.value === 'property') {\n this.prop = this.req('STRING', 'IDENTIFIER');\n } else {\n this.item_list = this.req(NoBracketListExpression);\n (!((this.item_list.comprehension != null) || ((this.item_list.items != null) ? this.item_list.items.length : void 0) > 0)) ? this.error(\"Expected: index to delete\") : void 0;\n }\n this.lock();\n this.req_val('from');\n this.from_var = this.req(UnaryExpression);\n }\n\n /* \n IfStatement \n =========== \n \n `IfStatement: ('if'|'when'|'unless'|('except' 'when') Expression Block ElseStatement*` \n \n Parses `if` statments and any attached `else`s or `else if`s (including synonyms). \n */\n\n function IfStatement() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(IfStatement,ASTBase);\n\n IfStatement.prototype.parse = function () {\n var keep_going, got_raw_else, new_else;\n this.condition = this.req_val('if', 'unless', 'when', 'except');\n this.lock();\n (this.condition.value === 'except') ? this.req_val('when') : void 0;\n this.conditional = this.req(Expression);\n this.block = this.req(Block, Statement);\n /* \n If statements can have multiple `else if`s, but nothing after the final `else` block. \n */\n this.elses = [];\n keep_going = true;\n got_raw_else = false;\n while (keep_going) {\n new_else = this.opt(ElseStatement);\n if ((new_else == null)) {\n keep_going = false;\n } else {\n this.elses.push(new_else);\n if ((new_else.conditional == null)) {\n keep_going = false;\n }\n }\n }\n }\n\n /* \n ElseStatement \n ============= \n \n `ElseStatement: ('else'|'otherwise') (('if'|'when') Expression) Block` \n \n This covers `else` and `else if`. \n */\n\n function ElseStatement() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(ElseStatement,ASTBase);\n\n ElseStatement.prototype.parse = function () {\n this.req_val('else', 'otherwise');\n this.lock();\n if (this.opt_val('if', 'when')) {\n this.conditional = this.req(Expression);\n }\n this.block = this.req(Block, Statement);\n }\n\n /* \n WhileStatement \n ============== \n \n `WhileStatement: ('while'|'until') Expression Block` \n \n While loops continue executing until the expression is true (or false in the case of `until` loops). \n */\n\n function WhileStatement() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(WhileStatement,ASTBase);\n\n WhileStatement.prototype.parse = function () {\n this.specifier = this.req_val('while', 'until');\n this.lock();\n this.expr = this.req(Expression);\n this.block = this.req(Block);\n }\n\n /* \n ForStatement \n ============ \n \n `ForStatement: 'for' ('parallel'|'series')? Variable ('at' Variable)? ('in'|'of') Expression Block` \n \n For loops can iterate over object properties (`of`) or over an array (`in`). The `parallel` and `series` specifiers only apply if there are asynchronous constructs within the loop (the default is `series`). \n \n The `at` keyword allows the user to specify an index variable for `for in` loops. \n */\n\n function ForStatement() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(ForStatement,ASTBase);\n\n ForStatement.prototype.parse = function () {\n this.req_val('for');\n this.lock();\n this.execution_style = this.opt_val('parallel', 'series');\n this.iterant = this.req(Variable);\n if (this.opt_val('at')) {\n this.index_var = this.req(Variable);\n }\n this.type = this.req_val('in', 'of');\n if ((this.index_var != null) && this.type.value !== 'in') {\n this.error(\"index variables specified with 'at' are only allowed in 'for ... in' loops\");\n }\n this.iterable = this.req(Expression);\n if (this.opt_val('to')) {\n this.iterable_to = this.req(Expression);\n }\n this.loop_block = this.req(Block);\n }\n\n /* \n AssignmentStatement \n =================== \n \n `AssignmentStatement: UnaryExpression ('+'|'-'|'*'|'/')? '=' Expression WhenExpression?` \n \n Note that the `UnaryExpression` must be a valid l-value. \n */\n\n function AssignmentStatement() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(AssignmentStatement,ASTBase);\n\n AssignmentStatement.prototype.parse = function () {\n this.lvalue = this.req(UnaryExpression);\n /* \n We mark this `UnaryExpression` as a possible l-value for later checks. \n */\n this.lvalue.can_be_lvalue = true;\n this.assignOp = this.req('LITERAL');\n (!((k$indexof.call(['+', '-', '*', '/', '='], this.assignOp.value) >= 0))) ? this.error((\"invalid operator \" + (this.assignOp.value))) : void 0;\n if (this.assignOp.value !== '=') {\n this.req_val('=');\n }\n this.lock();\n /* \n Now check that `lvalue` is indeed a valid l-value. \n */\n (!(this.lvalue.is_lvalue())) ? this.error(\"invalid assignment - the left side must be assignable\") : void 0;\n this.rvalue = this.req(Expression);\n this.conditional = this.rvalue.transform_when_statement();\n }\n\n /* \n WaitForStatement \n ================ \n \n `WaitForStatement: 'safe'? 'wait' 'for' MultipleReturnValues 'from' Expression WhenExpression? BlockWithoutIndent` \n \n The `wait for` statement pauses execution asynchronously and waits for the `Expression` to call back. Note that the `Expression` must be a function call. A `WaitForStatement` can optionally be marked `safe` indicating the expression does not use an error callback argument (like node's `http.get`) \n */\n\n function WaitForStatement() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(WaitForStatement,ASTBase);\n\n WaitForStatement.prototype.parse = function () {\n var last_accessor;\n this.no_errors = this.opt_val('safe');\n this.req_val('wait');\n this.req_val('for');\n this.lvalue = this.req(MultipleReturnValues);\n /* \n Mark the return values as possible l-values. \n */\n this.lvalue.can_be_lvalue = true;\n this.req_val('from');\n this.lock();\n /* \n Verify all return values are valid l-values. \n */\n (!(this.lvalue.is_lvalue())) ? this.error(\"invalid assignment - the left side must be assignable\") : void 0;\n this.rvalue = this.req(UnaryExpression);\n /* \n Check for tail conditionals \n */\n this.conditional = this.opt(WhenExpression);\n /* \n Verify that `rvalue` is a function call. \n */\n last_accessor = this.rvalue.accessors[this.rvalue.accessors.length - 1];\n (!(last_accessor instanceof FunctionCall)) ? this.error(\"expected a function call after 'from'\") : void 0;\n this.block = this.req(BlockWithoutIndent);\n }\n\n /* \n SimpleWaitForStatement \n ====================== \n \n `SimpleWaitForStatement: 'safe'? 'wait' 'for' Expression WhenExpression? BlockWithoutIndent` \n \n The same as a `WaitForStatement` but without any return values. \n */\n\n function SimpleWaitForStatement() {\n return WaitForStatement.prototype.constructor.apply(this,arguments);\n }\n __extends(SimpleWaitForStatement,WaitForStatement);\n\n SimpleWaitForStatement.prototype.parse = function () {\n var last_accessor;\n this.no_errors = this.opt_val('safe');\n this.req_val('wait');\n this.lock();\n this.req_val('for');\n /* \n No l-value for this type of `wait for`. \n */\n this.lvalue = null;\n this.rvalue = this.req(UnaryExpression);\n this.conditional = this.opt(WhenExpression);\n last_accessor = this.rvalue.accessors[this.rvalue.accessors.length - 1];\n (!(last_accessor instanceof FunctionCall)) ? this.error(\"expected a function call after 'for'\") : void 0;\n this.block = this.req(BlockWithoutIndent);\n }\n\n /* \n WaitForExpression \n ================= \n \n `WaitForExpression: 'safe'? ('wait' 'for')? MultipleReturnValues? 'from' UnaryExpression WhenExpression? \n \n This is similar to a WaitForStatement except that it is called as part of a `RunInParallelBlock` and does not contain a `BlockWithoutIndent`. \n */\n\n function WaitForExpression() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(WaitForExpression,ASTBase);\n\n WaitForExpression.prototype.parse = function () {\n var explicit, last_accessor;\n this.no_errors = this.opt_val('safe');\n (this.no_errors) ? this.lock() : void 0;\n explicit = this.opt_val('wait');\n (this.explicit) ? this.lock() : void 0;\n (explicit) ? this.req_val('for') : void 0;\n this.lvalue = this.opt(MultipleReturnValues);\n ((this.lvalue != null)) ? this.req_val('from') : void 0;\n this.rvalue = this.req(UnaryExpression);\n this.lock();\n this.conditional = this.opt(WhenExpression);\n last_accessor = this.rvalue.accessors[this.rvalue.accessors.length - 1];\n (!(last_accessor instanceof FunctionCall)) ? this.error(\"expected a function call after 'for'\") : void 0;\n this.req('NEWLINE');\n }\n\n /* \n PauseForStatement \n ================= \n \n `PauseForStatement: 'pause' 'for' Expression ('second'|'seconds')? WhenExpression?` \n \n `PauseForStatement`s asynchronously pause execution for the specified time interval. The suffix `second` or `seconds` is optional and just for readability. \n */\n\n function PauseForStatement() {\n return WaitForStatement.prototype.constructor.apply(this,arguments);\n }\n __extends(PauseForStatement,WaitForStatement);\n\n PauseForStatement.prototype.parse = function () {\n this.req_val('pause');\n this.lock();\n this.req_val('for');\n this.tvalue = this.req(Expression);\n this.opt_val('second', 'seconds');\n this.conditional = this.opt(WhenExpression);\n this.block = this.req(BlockWithoutIndent);\n }\n\n /* \n RunInParallelBlock \n ================== \n \n `RunInParallelBlock: 'run' 'in'? 'parallel' NEWLINE INDENT WaitForExpression* DEDENT` \n \n The `RunInParallelBlock` specifies a set of `WaitForExpression`s to kick off in parallel, delaying execution until all are complete. Only `WaitForExpression`s are allowed in the block. \n */\n\n function RunInParallelBlock() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(RunInParallelBlock,ASTBase);\n\n RunInParallelBlock.prototype.parse = function () {\n this.req_val('run');\n this.opt_val('in');\n this.req_val('parallel');\n this.lock();\n this.req('NEWLINE');\n this.req('INDENT');\n this.wait_fors = this.req_multi(WaitForExpression);\n this.lock();\n this.req('DEDENT');\n }\n\n /* \n MultipleReturnValues \n ==================== \n \n `MultipleReturnValues: '('? UnaryExpression (',' UnaryExpression)* ')'?` \n \n This class is used in `wait for` expressions to specify a list of return values, such as `wait for x, y from f()`. Enclosing parentheses (`wait for (x, y) from f()`) are optional and must come as a pair. \n */\n\n function MultipleReturnValues() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(MultipleReturnValues,ASTBase);\n\n MultipleReturnValues.prototype.is_lvalue = function () {\n var arg, ki$1, kobj$1;\n kobj$1 = this.arguments;\n for (ki$1 = 0; ki$1 < kobj$1.length; ki$1++) {\n arg = kobj$1[ki$1];\n if (!(arg.is_lvalue())) {\n return false;\n }\n }\n return true;\n }\n\n MultipleReturnValues.prototype.parse = function () {\n var left_paren, t, arg;\n left_paren = this.opt_val('(');\n this.arguments = [];\n t = {value: ','};\n while (t.value === ',') {\n arg = this.req(UnaryExpression);\n arg.can_be_lvalue = true;\n this.arguments.push(arg);\n if (left_paren) {\n t = this.req_val(')', ',');\n } else {\n t = this.req_val('from', ',');\n }\n }\n this.ts.prev();\n (left_paren) ? this.req_val(')') : void 0;\n }\n\n /* \n ExpressionStatement \n =================== \n \n `ExpressionStatement: Expression` \n \n `ExpressionStatement`s are statements that are simply an r-value expression (no assignment or control operators). This is most commonly used for function calls (`my_func()` is a valid statement), though technically things like `x` are also valid statments. \n */\n\n function ExpressionStatement() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(ExpressionStatement,ASTBase);\n\n ExpressionStatement.prototype.parse = function () {\n this.expr = this.req(Expression);\n }\n\n /* \n BlankStatement \n ============== \n \n `BlankStatement: ('pass' NEWLINE|EOF)|NEWLINE` \n \n `BlankStatement`s are used to fill in when there are extra newlines or bare function definitions. A blank statement does not generate any output code and has no semantic significance. \n */\n\n function BlankStatement() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(BlankStatement,ASTBase);\n\n BlankStatement.prototype.parse = function () {\n if (this.opt_val('pass')) {\n this.lock();\n this.req('NEWLINE', 'EOF');\n this.ts.prev();\n } else {\n this.req('NEWLINE');\n }\n }\n\n /* \n Variable \n ======== \n \n `Variable: IDENTIFIER` \n \n `Variable` works like an `IDENTIFIER` token except that it also checks to see if the token is a reserved word. \n */\n\n function Variable() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(Variable,ASTBase);\n\n Variable.prototype.parse = function () {\n this.identifier = this.req('IDENTIFIER');\n this.lock();\n /* \n We copy the `value` property over so that `Variable` objects can be drop-in replacements for `IDENTIFIER` tokens. \n */\n this.value = this.identifier.value;\n ((k$indexof.call(KEYWORDS, this.value) >= 0)) ? this.error((\"'\" + (this.value) + \"' is reserved and can't be used as a name\")) : void 0;\n }\n\n /* \n BinOp \n ===== \n \n `BinOp: ('bitwise'? 'and'|'or'|'xor'|'left'|'right'|'not')|('not' 'in'|'of')|('+'|'-'|'*'|'/'|'>'|'<'|'^'|'<='|'>='|'=='|'!='|'and'|'but'|'or'|'xor'|'nor'|'in'|'mod'|('is' 'not'?)|'isnt'|'instanceof'|'of')` \n \n Binary operators can include bitwise operations, the `in` or `of` collection checks, or standard Boolean and arithmetic operators. \n */\n\n function BinOp() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(BinOp,ASTBase);\n\n BinOp.prototype.parse = function () {\n /* \n Some operations (`in` and `of`) can be inverted using the `not` keyword. \n */\n this.invert = false;\n /* \n Bitwise operators have the `bitwise` prefix. \n */\n this.bitwise = this.opt_val('bitwise');\n this.op = this.req('IDENTIFIER', 'LITERAL');\n /* \n A `bitwise` prefix indicates this is definitely a `BinOp` \n */\n (this.bitwise) ? this.lock() : void 0;\n /* \n Literals are limited to the list of valid arithmetic and Boolean operators above. \n */\n if (this.op.type === 'LITERAL') {\n /* \n First we need to fail softly on certain tokens that are not necessarily syntax errors, like closing parens. For example `x[a]` would try to parse for a `BinOp` after `a`, so it must fail cleanly in this case. Note that if `me.bitwise` was set, we are already locked, so this would be a \"hard\" syntax error as expected. \n */\n ((k$indexof.call([')', ']', '}', ';', ':', ','], this.op.value) >= 0) || this.bitwise) ? this.error((\"unexpected operator \" + (this.op.value))) : void 0;\n this.lock();\n /* \n Now we do a \"hard\" check to make sure the operator is in the acceptabled list. \n */\n (!((k$indexof.call(['+', '-', '*', '/', '>', '<', '^', '<=', '>=', '==', '!='], this.op.value) >= 0))) ? this.error((\"unexpected operator \" + (this.op.value))) : void 0;\n } else {\n /* \n For `IDENTIFIER` tokens, we also check the token against the acceptable list. \n \n \n First we need to check if we got a `not` token. In this case we just set the `invert` flag and check that the next token is `in` or `of`. \n */\n if (this.op.value === 'not') {\n this.op = this.req_val('in', 'of');\n this.invert = true;\n } else if (this.op.value === 'is' && this.opt_val('not')) {\n /* \n Also check for `is not`, which we treat as `isnt` rather than `is (not`. \n */\n this.invert = true;\n }\n /* \n Bitwise operators are limited to a smaller list. \n */\n if (this.bitwise) {\n (!((k$indexof.call(['and', 'or', 'xor', 'left', 'right'], this.op.value) >= 0))) ? this.error((\"unexpected operator \" + (this.op.value))) : void 0;\n } else {\n (!((k$indexof.call(['and', 'but', 'or', 'xor', 'nor', 'in', 'mod', 'is', 'isnt', 'instanceof', 'of'], this.op.value) >= 0))) ? this.error((\"unexpected operator \" + (this.op.value))) : void 0;\n }\n }\n }\n\n /* \n Expression \n ========== \n \n `Expression: UnaryExpression (BinOp Expression)? WhenExpression?` \n */\n\n function Expression() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(Expression,ASTBase);\n\n /* \n Parent objects may call `transform_when_statement` to grab the rightmost tail conditional and claim it as their own. For example, in `x = y + 1 when y < 2`, normally the `WhenExpression` would associate with `y + 1`, compiling to something like `x = (y < 2) ? y + 1 : void 0;` when in reality we want `if (y < 2) x = y + 1;`. This method allows parent objects, in this case the `AssignmentStatement` to grab child conditionals by recursing down the tree. \n */\n Expression.prototype.transform_when_statement = function () {\n var rv;\n if ((this.conditional != null) && (this.conditional.false_expr == null)) {\n rv = this.conditional;\n this.conditional = null;\n return rv;\n } else if (this.right instanceof Expression) {\n return this.right.transform_when_statement();\n }\n else {\n return null;\n }\n }\n\n /* */\n Expression.prototype.parse = function () {\n this.left = this.req(UnaryExpression);\n /* \n We flag the `left` `UnaryExpression` as not eligable to be an l-value since it is not being assigned to. \n */\n this.left.can_be_lvalue = false;\n /* \n `FunctionExpression`s define a function and we don't want to allow things like: \n ``` \n function x() \n return 2 \n + 3 \n ``` \n so we don't check for a `BinOp` or right value in these cases. \n */\n if (this.left.base instanceof FunctionExpression) {\n return;\n }\n /* \n Try to parse this as a binary expression. \n */\n this.op = this.opt(BinOp);\n this.lock();\n /* \n If it is binary, get the right side. \n */\n if ((this.op != null)) {\n this.right = this.req(Expression);\n }\n /* \n Don't parse tail conditionals after dedents. This typically is from an `ImplicitMapExpression` followed by an `if` statement (see gh-72). \n */\n if (!(this.ts.peek(-1).type === 'DEDENT')) {\n this.conditional = this.opt(WhenExpression);\n }\n }\n\n /* \n For constant folding, this method returns the numeric value if this is a unary expression with a number constant. Otherwise, it returns null. Only used by the generator for `pause for` statements at this time. \n */\n Expression.prototype.number_constant = function () {\n if ((this.op != null) || (this.conditional != null)) {\n return null;\n } else {\n return this.left.number_constant();\n }\n }\n\n /* \n UnaryExpression \n =============== \n \n `UnaryExpression: (('bitwise' 'not')|'not'|'new'|'-'|'typeof')? ParenExpression|ListExpression|MapExpression|FunctionExpression|ImplicitMapExpression|NumberConstant|StringConstant|RegexConstant|'IDENTIFIER' IndexExpression|FunctionCall|PropertyAccess|ExisentialCheck` \n \n `UnaryExpression` is a container class for the different types of unary expressions supported by the language. It handles the unary prefix operators `not`, `bitwise not`, `new`, `typeof` and unary `-`. This class also handles unary suffix operators such as array/object indexing, funcation calls, property accessors, and existence checks. \n */\n\n function UnaryExpression() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(UnaryExpression,ASTBase);\n\n /* \n This method is used to check if an expression is an l-value when used in assignments. \n */\n UnaryExpression.prototype.is_lvalue = function () {\n var accessor, ki$2, kobj$2;\n /* \n The `can_be_lvalue` flag must be set by the parent node for this check to pass. Things like assignments will set this flag, whereas binary expressions will not. \n */\n if (this.can_be_lvalue === false) {\n return false;\n }\n /* \n Constants can't be l-values \n */\n if ((k$indexof.call([NumberConstant, StringConstant, RegexConstant], this.base.constructor) >= 0)) {\n return false;\n }\n /* \n We only check if the base is a valid r-value if it has no property accessors. In other words, we allow things like `me.a = 1` but not `me = 1`. \n */\n if (this.accessors.length > 0) {\n if (((k$indexof.call(KEYWORDS, this.base.value) >= 0)) && !(((k$indexof.call(RVALUE_OK, this.base.value) >= 0)))) {\n return false;\n }\n } else {\n if ((k$indexof.call(KEYWORDS, this.base.value) >= 0)) {\n return false;\n }\n }\n /* \n Function call results are not assignable (`f() = 2` for example). \n */\n kobj$2 = this.accessors;\n for (ki$2 = 0; ki$2 < kobj$2.length; ki$2++) {\n accessor = kobj$2[ki$2];\n if ((accessor instanceof FunctionCall)) {\n return false;\n }\n }\n /* \n Otherwise, this is a good l-value. \n */\n return true;\n }\n\n /* */\n UnaryExpression.prototype.parse = function () {\n var first;\n this.bitwise = this.opt_val('bitwise');\n this.preop = this.opt_val('not', 'new', '-', 'typeof');\n if (this.bitwise && ((this.preop != null) ? this.preop.value : void 0) !== 'not') {\n this.error(\"expected 'not' after 'bitwise' for a unary expression\");\n }\n this.base = this.req(ParenExpression, ListExpression, MapExpression, FunctionExpression, ImplicitMapExpression, NumberConstant, StringConstant, RegexConstant, 'IDENTIFIER');\n /* \n Next we check for suffix operators (accessors), including property access but also function calls, array/object indexing, and exisentials. \n \n If a paren expression occurs immediately after the function block dedent, this would normally be interpreted as a function call on the function expression. While this may be desired it is usually just confusing, so we explicitly avoid it here. By not checking for `FunctionCall`s on the first accessor. \n */\n if ((this.base instanceof FunctionExpression)) {\n this.accessors = [];\n first = this.opt(IndexExpression, PropertyAccess, ExisentialCheck);\n if ((first != null)) {\n this.accessors.push(first);\n this.accessors = this.accessors.concat(this.opt_multi(IndexExpression, FunctionCall, PropertyAccess, ExisentialCheck));\n }\n } else {\n this.accessors = this.opt_multi(IndexExpression, FunctionCall, PropertyAccess, ExisentialCheck);\n }\n /* */\n this.lock();\n /* \n Check for keyword use as an identifier. \n */\n if ((this.base.value != null) && ((k$indexof.call(KEYWORDS, this.base.value) >= 0)) && !(((k$indexof.call(RVALUE_OK, this.base.value) >= 0)))) {\n this.error((\"'\" + (this.base.value) + \"' is a reserved word and can't be used as a name\"));\n }\n }\n\n /* \n For constant folding, return a numeric value if possible, otherwise `null`. This is used by the `pause for` generator code. \n */\n UnaryExpression.prototype.number_constant = function () {\n var n;\n if ((this.bitwise != null) || (this.preop != null)) {\n return null;\n } else if (this.base instanceof NumberConstant) {\n n = Number(this.base.token.text);\n return (isNaN(n)) ? null : n;\n }\n else {\n return null;\n }\n }\n\n /* \n ExisentialCheck \n =============== \n \n `ExisentialCheck: 'exists'|('doesnt' 'exist')|'?' \n \n This operator indicates a variable's existence (non-nullness and/or variable is defined) should be checked. \n */\n\n function ExisentialCheck() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(ExisentialCheck,ASTBase);\n\n ExisentialCheck.prototype.parse = function () {\n var op;\n op = this.req_val('exists', '?', 'doesnt');\n this.lock();\n if (op.value === 'doesnt') {\n this.req_val('exist');\n this.invert = true;\n } else {\n this.invert = false;\n }\n }\n\n /* \n WhenExpression \n ============== \n \n `WhenExpression: 'when'|'if'|'unless'|('except' 'when') Expression ('otherwise'|'else' Expression)?` \n \n This node can either be used as a ternary operator (`2 if a otherwise 3`) or a tail conditional (`x = 5 if a`). `Expression` objects use the `transform_when_statement` method to pull these nodes to the top level of a statement (see the definition of `transform_when_statement` above). \n */\n\n function WhenExpression() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(WhenExpression,ASTBase);\n\n WhenExpression.prototype.parse = function () {\n this.specifier = this.req_val('when', 'except', 'if', 'unless');\n this.lock();\n (this.specifier.value === 'except') ? this.req_val('when') : void 0;\n this.condition = this.req(Expression);\n if (this.opt_val('otherwise', 'else')) {\n this.false_expr = this.req(Expression);\n }\n }\n\n /* \n NumberConstant \n ============== \n \n `NumberConstant: NUMBER` \n \n A numeric token constant. Can be anything the lexer supports, including scientific notation, integers, floating point, or hex. \n */\n\n function NumberConstant() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(NumberConstant,ASTBase);\n\n NumberConstant.prototype.parse = function () {\n this.token = this.req('NUMBER');\n }\n\n /* \n StringConstant \n ============== \n \n `StringConstant: STRING` \n \n A string token constant. Can be anything the lexer supports, including single or double-quoted strings. Note that the `sugar` module handles double-quoted strings with embedded code by turning it into multiple `STRING` tokens, so we don't have to do anything special here. \n */\n\n function StringConstant() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(StringConstant,ASTBase);\n\n StringConstant.prototype.parse = function () {\n this.token = this.req('STRING', 'BLOCKSTRING');\n }\n\n /* \n RegexConstant \n ============== \n \n `RegexConstant: REGEX` \n \n A regular expression token constant. Can be anything the lexer supports. \n */\n\n function RegexConstant() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(RegexConstant,ASTBase);\n\n RegexConstant.prototype.parse = function () {\n this.token = this.req('REGEX');\n }\n\n /* \n IndexExpression \n ============== \n \n `IndexExpression: '?'? '[' Expression ']'` \n \n Array or object property access. This can be prepended by an exisential check, meaning only attempt access if the underlying object is defined. For example, `a?[2]` won't fail if `a` is `null` or not declared, instead it returns `undefined`. \n */\n\n function IndexExpression() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(IndexExpression,ASTBase);\n\n IndexExpression.prototype.parse = function () {\n var op;\n op = this.req_val('[', '?');\n this.exisential = (op.value === '?');\n (this.exisential) ? this.req_val('[') : void 0;\n this.lock();\n this.expr = this.req(Expression);\n this.req_val(']');\n }\n\n /* \n PropertyAccess \n ============== \n \n `PropertyAccess: '?'? '.' IDENTIFIER` \n \n Object property access. This can be prepended by an exisential check, meaning only attempt access if the underlying object is defined. For example, `a?.prop` won't fail if `a` is `null` or not declared, instead it returns `undefined`. \n */\n\n function PropertyAccess() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(PropertyAccess,ASTBase);\n\n PropertyAccess.prototype.parse = function () {\n var op;\n op = this.req_val('.', '?');\n this.exisential = (op.value === '?');\n (this.exisential) ? this.req_val('.') : void 0;\n this.lock();\n this.expr = this.req('IDENTIFIER');\n }\n\n /* \n FunctionCall \n ============== \n \n `FunctionCall: '?'? '(' FunctionCallArgument* ')'` \n \n Indicates a function call on the preceeding object. This can be prepended by an exisential check, meaning only attempt access if the underlying object is defined. For example, `a?()` won't fail if `a` is `null` or not declared, instead it returns `undefined`. It will fail if `a` is not a function, though this can't be determined at compile time. \n */\n\n function FunctionCall() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(FunctionCall,ASTBase);\n\n FunctionCall.prototype.parse = function () {\n var op;\n op = this.req_val('(', '?');\n this.exisential = (op.value === '?');\n (this.exisential) ? this.req_val('(') : void 0;\n this.lock();\n this.arguments = this.opt_multi(FunctionCallArgument);\n this.req_val(')');\n }\n\n /* \n FunctionCallArgument \n ==================== \n \n `FunctionCallArgument: (Expression ',')* Expression (?=')')` \n \n A single argument to a function call, followed by a comma or close-paren. If it is followed by a close-paren, that token will not be captured. \n */\n\n function FunctionCallArgument() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(FunctionCallArgument,ASTBase);\n\n FunctionCallArgument.prototype.parse = function () {\n this.val = this.req(Expression);\n this.lock();\n if (this.req_val(',', ')').value === ')') {\n this.ts.prev();\n }\n }\n\n /* \n ParenExpression \n ============== \n \n `ParenExpression: '(' Expression ')'` \n \n An expression enclosed by parentheses, like `(a + b)`. \n */\n\n function ParenExpression() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(ParenExpression,ASTBase);\n\n ParenExpression.prototype.parse = function () {\n this.req_val('(');\n this.lock();\n this.expr = this.req(Expression);\n this.req_val(')');\n }\n\n /* \n RangeExpression \n =============== \n \n `RangeExpression: Expression 'to' Expression` \n \n This is used inside array definitions to define a range of values (like `[1 to 4]`). \n */\n\n function RangeExpression() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(RangeExpression,ASTBase);\n\n RangeExpression.prototype.parse = function () {\n this.from_expr = this.req(Expression);\n this.req_val('to');\n this.lock();\n this.to_expr = this.req(Expression);\n }\n\n /* \n ListExpression \n ============== \n \n `ListExpression: '[' ObjectComprehension|ListComprehension|((Expression ',')* Expression)? ']'` \n \n An array definition, such as `[1,2,3]`. Multiline list definitions are handled by the `sugar` module. This also supports comprehensions inside the definition. \n */\n\n function ListExpression() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(ListExpression,ASTBase);\n\n ListExpression.prototype.parse = function () {\n this.req_val('[');\n this.lock();\n this.parse_inside();\n this.req_val(']');\n }\n\n /* */\n ListExpression.prototype.parse_inside = function () {\n var item;\n this.comprehension = this.opt(ObjectComprehension, ListComprehension, RangeExpression);\n if ((this.comprehension == null)) {\n item = this.opt(Expression);\n this.items = [];\n while (item) {\n this.items.push(item);\n if (this.opt_val(',')) {\n item = this.opt(Expression);\n } else {\n item = null;\n }\n }\n }\n }\n\n /* \n NoBracketListExpression \n ======================= \n \n `NoBracketListExpression: ObjectComprehension|ListComprehension|((Expression ',')* Expression)?` \n \n This is the same as a `ListExpression` except that it does not require enclosing brackets. It is used by the `DeleteStatement`. \n */\n\n function NoBracketListExpression() {\n return ListExpression.prototype.constructor.apply(this,arguments);\n }\n __extends(NoBracketListExpression,ListExpression);\n\n NoBracketListExpression.prototype.parse = function () {\n this.parse_inside();\n }\n\n /* \n ListComprehension \n ================= \n \n `ListComprehension: Expression 'for' Variable 'in' Expression` \n \n List comprehensions allow list generation by applying an expression to each member in another list. For example `[a+1 for a in [1,2,3]]` would yield `[2,3,4]`. \n */\n\n function ListComprehension() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(ListComprehension,ASTBase);\n\n ListComprehension.prototype.parse = function () {\n this.iter_expr = this.req(Expression);\n this.req_val('for');\n this.lock();\n this.iterant = this.req(Variable);\n this.req_val('in');\n this.iterable = this.req(Expression);\n this.conditional = this.iterable.transform_when_statement();\n }\n\n /* \n ObjectComprehension \n ================= \n \n `ObjectComprehension: Expression 'for' ('property' Variable)|('property' 'value' Variable)|('property' Variable 'with' 'value' Variable) 'in' Expression` \n \n Object comprehensions allow list generation by applying an expression to each member in an object. It comes in three forms: \n \n `[x for property x of obj]` - returns all the keys (properties) of `obj` as a list. \n `[x for property value x of obj]` - returns all the values (property values) of `obj` as a list. \n `[[w,x for property w with value x of obj]` - returns all the keys (properties) and values (property values) of `obj` as a list of list tuples. \n */\n\n function ObjectComprehension() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(ObjectComprehension,ASTBase);\n\n ObjectComprehension.prototype.parse = function () {\n this.iter_expr = this.req(Expression);\n this.req_val('for');\n this.req_val('property');\n this.lock();\n if (this.opt_val('value')) {\n this.value_iterant = this.req(Variable);\n } else {\n this.property_iterant = this.req(Variable);\n if (this.opt_val('with')) {\n this.req_val('value');\n this.value_iterant = this.req(Variable);\n }\n }\n this.req_val('in');\n this.iterable = this.req(Expression);\n this.conditional = this.iterable.transform_when_statement();\n }\n\n /* \n MapExpression \n ============= \n \n `MapExpression: '{' MapItem* '}'` \n \n Defines an object with a list of key value pairs. This is a JavaScript-style definition. Multiline definitions are supported to some extent by the `sugar` module which removes the newlines and indents: \n \n `x = {a:1,b:2,c:{d:1}}` \n */\n\n function MapExpression() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(MapExpression,ASTBase);\n\n MapExpression.prototype.parse = function () {\n this.req_val('{');\n this.lock();\n this.items = this.opt_multi(MapItem);\n this.req_val('}');\n }\n\n /* \n ImplicitMapExpression \n ===================== \n \n `ImplicitMapExpression: NEWLINE INDENT ImplicitMapItem* DEDENT` \n \n Defines an object with a list of key value pairs. This is a CoffeeScript-style definition: \n ``` \n x = \n a: 1 \n b: 2 \n ``` \n */\n\n function ImplicitMapExpression() {\n return MapExpression.prototype.constructor.apply(this,arguments);\n }\n __extends(ImplicitMapExpression,MapExpression);\n\n ImplicitMapExpression.prototype.parse = function () {\n this.req('NEWLINE');\n this.req('INDENT');\n this.lock();\n this.items = this.req_multi(ImplicitMapItem);\n this.req('DEDENT');\n }\n\n /* \n MapItem \n ======= \n \n `MapItem: IDENTIFIER|STRING|NUMBER ':' Expression ','|(?='}')` \n \n A single definition in a `MapExpression` of a property/value pair. It also tries to consume a comma if one is available and fails if it is not followed by a comma or `}`. \n */\n\n function MapItem() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(MapItem,ASTBase);\n\n MapItem.prototype.parse = function () {\n this.key = this.req('IDENTIFIER', 'STRING', 'NUMBER');\n this.req_val(':');\n this.lock();\n this.val = this.req(Expression);\n this.end_token = this.req_val(',', '}');\n if (this.end_token.value === '}') {\n this.ts.prev();\n }\n }\n\n /* \n ImplicitMapItem \n ======= \n \n `ImplicitMapItem: IDENTIFIER|STRING|NUMBER ':' Expression ','|(?='}')` \n \n A single definition in a `ImplicitMapExpression` of a property/value pair. \n */\n\n function ImplicitMapItem() {\n return MapItem.prototype.constructor.apply(this,arguments);\n }\n __extends(ImplicitMapItem,MapItem);\n\n ImplicitMapItem.prototype.parse = function () {\n this.key = this.req('IDENTIFIER', 'STRING', 'NUMBER');\n this.req_val(':');\n this.lock();\n this.val = this.req(Expression);\n /* \n It requires either a `NEWLINE` or comma unless the value expression is another `ImplicitMapExpression` or a function definition, since these consume the newline for us. \n */\n if (!(((this.val.left != null) ? this.val.left.base : void 0) instanceof ImplicitMapExpression || ((this.val.left != null) ? this.val.left.base : void 0) instanceof FunctionExpression)) {\n this.end_token = this.opt_multi('NEWLINE');\n if (this.end_token.length === 0) {\n this.end_token = this.req_val(',');\n }\n }\n }\n\n /* \n FunctionExpression \n ================== \n \n `FunctionExpression: 'function'|'method'|'task' Variable? '(' FunctionDefArgument* ')' ('of' UnaryExpression)? Block` \n \n Defines a function, method, or task. The `of` suffix allows us to late-bind this function to another class. \n */\n\n function FunctionExpression() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(FunctionExpression,ASTBase);\n\n FunctionExpression.prototype.parse = function () {\n this.specifier = this.req_val('function', 'method', 'task');\n this.lock();\n this.name = this.opt(Variable);\n this.req_val('(');\n this.arguments = this.opt_multi(FunctionDefArgument);\n this.req_val(')');\n this.late_bind = this.opt_val('of');\n if (this.late_bind) {\n this.lock();\n this.bind_to = this.req(UnaryExpression);\n this.bind_to.can_be_lvalue = false;\n }\n this.block = this.req(Block);\n }\n\n /* \n FunctionDefArgument \n =================== \n \n `FunctionDefArgument: Variable ('=' Expression)? ','|(?=')')` \n */\n\n function FunctionDefArgument() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(FunctionDefArgument,ASTBase);\n\n FunctionDefArgument.prototype.parse = function () {\n this.name = this.req(Variable);\n this.lock();\n if (this.opt_val(':')) {\n this.typeName = this.req('IDENTIFIER');\n }\n if (this.opt_val('=')) {\n this.default = this.req(Expression);\n }\n /* \n Require either a comma or ')', but unsee a ')' since the `FunctionExpression` needs it. \n */\n if (this.req_val(',', ')').value === ')') {\n this.ts.prev();\n }\n }\n\n /* \n ClassDefinition \n =============== \n \n `ClassDefinition: class Variable ('inherits' 'from' Variable)? Block` \n \n Defines a new class with an optional parent class. Methods and members go inside the block. \n */\n\n function ClassDefinition() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(ClassDefinition,ASTBase);\n\n ClassDefinition.prototype.parse = function () {\n this.req_val('class');\n this.lock();\n this.name = this.req(Variable);\n if (this.opt_val('inherits')) {\n this.req_val('from');\n this.parent = this.req(Variable);\n }\n this.block = this.req(Block);\n }\n\n /* \n TryCatch \n ======== \n \n `TryCatch: 'try' Block ('catch' Variable? Block)?` \n \n Defines a `try` and `catch` block for trapping exceptions and handling them. `finally` is not supported at this time. The `catch` block and error variable are optional. \n */\n\n function TryCatch() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(TryCatch,ASTBase);\n\n TryCatch.prototype.parse = function () {\n this.req_val('try');\n this.lock();\n this.try_block = this.req(Block);\n if (this.opt_val('catch')) {\n this.lock();\n this.identifier = this.opt(Variable);\n this.catch_block = this.req(Block);\n }\n }\n\n /* \n SuperStatement \n ============== \n \n `SuperStatement: 'super' FunctionCall?` \n \n Within a method, calls the parent class's version of that method. Unlike most function calls, the `()`s are optional even when there are no arguments. \n */\n\n function SuperStatement() {\n return ASTBase.prototype.constructor.apply(this,arguments);\n }\n __extends(SuperStatement,ASTBase);\n\n SuperStatement.prototype.parse = function () {\n this.req_val('super');\n this.lock();\n this.accessor = this.opt(FunctionCall);\n }\n\n /* \n Exports \n ======= \n \n A list of nodes to export. For now, this is the cleanest way to do this in Kal. Perhaps an `export` keyword in the future will make this neater. \n */\n Nodes = [ASTBase, File, Block, Statement, ThrowStatement, ReturnStatement, IfStatement, ElseStatement, WhileStatement, ForStatement, AssignmentStatement, ExpressionStatement, LoopControlStatement, BlankStatement, BinOp, Expression, UnaryExpression, ExisentialCheck, WhenExpression, NumberConstant, StringConstant, RegexConstant, IndexExpression, PropertyAccess, FunctionCallArgument, FunctionCall, ParenExpression, ListExpression, ListComprehension, ObjectComprehension, MapItem, MapExpression, ImplicitMapItem, ImplicitMapExpression, FunctionDefArgument, FunctionExpression, ClassDefinition, TryCatch, SuperStatement, BlockWithoutIndent, SimpleWaitForStatement, WaitForStatement, PauseForStatement, MultipleReturnValues, RunInParallelBlock, WaitForExpression, Variable, RangeExpression, DeleteStatement];\n /* */\n exports.Grammar = {};\n kobj$3 = Nodes;\n for (ki$3 = 0; ki$3 < kobj$3.length; ki$3++) {\n v = kobj$3[ki$3];\n exports.Grammar[v.name] = v;\n }\n exports.GrammarRoot = exports.Grammar.File;\n})()"} +{"text": "/*\n * Copyright 2019 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * https://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\npackage com.google.samples.apps.iosched.ui.info\n\nimport android.os.Bundle\nimport android.view.LayoutInflater\nimport android.view.View\nimport android.view.ViewGroup\nimport androidx.core.view.updatePaddingRelative\nimport androidx.fragment.app.Fragment\nimport com.google.samples.apps.iosched.R\nimport com.google.samples.apps.iosched.util.doOnApplyWindowInsets\nimport dagger.hilt.android.AndroidEntryPoint\n\n@AndroidEntryPoint\nclass FaqFragment : Fragment() {\n\n override fun onCreateView(\n inflater: LayoutInflater,\n container: ViewGroup?,\n savedInstanceState: Bundle?\n ): View? {\n return inflater.inflate(R.layout.fragment_info_faq, container, false)\n }\n\n override fun onViewCreated(view: View, savedInstanceState: Bundle?) {\n super.onViewCreated(view, savedInstanceState)\n\n // Pad the bottom of the ScrollView so that it scrolls up above the nav bar\n view.doOnApplyWindowInsets { v, insets, padding ->\n v.updatePaddingRelative(bottom = padding.bottom + insets.systemWindowInsetBottom)\n }\n }\n}\n"} +{"text": "\n\n \n \n Debug\n Win32\n \n \n Release\n Win32\n \n \n Debug\n x64\n \n \n Release\n x64\n \n \n \n {3FA10D72-C07D-4B85-8C9C-C58E5F875D4D}\n Win32Proj\n IfhLog\n 10.0\n IfhLog\n \n \n \n DynamicLibrary\n true\n v142\n Unicode\n \n \n DynamicLibrary\n false\n v142\n true\n Unicode\n \n \n DynamicLibrary\n true\n v140\n Unicode\n \n \n DynamicLibrary\n false\n v140\n true\n Unicode\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n true\n $(Configuration)\\\n \n \n true\n \n \n false\n $(Configuration)\\\n \n \n false\n \n \n \n Level3\n Disabled\n WIN32;_CRT_SECURE_NO_WARNINGS;_DEBUG;_WINDOWS;_USRDLL;IFH_EXPORTS;WINVER=0x0601;%(PreprocessorDefinitions)\n true\n \n \n Windows\n true\n kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;Shlwapi.lib;%(AdditionalDependencies)\n IfhLog.def\n \n \n \n \n Use\n Level3\n Disabled\n _DEBUG;_WINDOWS;_USRDLL;IFH_EXPORTS;%(PreprocessorDefinitions)\n true\n \n \n Windows\n true\n IfhLog.def\n \n \n \n \n Level3\n MaxSpeed\n true\n true\n WIN32;_CRT_SECURE_NO_WARNINGS;NDEBUG;_WINDOWS;_USRDLL;IFH_EXPORTS;WINVER=0x0601;%(PreprocessorDefinitions)\n true\n MultiThreaded\n \n \n Windows\n true\n true\n true\n kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;Shlwapi.lib;%(AdditionalDependencies)\n IfhLog.def\n \n \n \n \n Level3\n Use\n MaxSpeed\n true\n true\n NDEBUG;_WINDOWS;_USRDLL;IFH_EXPORTS;%(PreprocessorDefinitions)\n true\n \n \n Windows\n true\n true\n true\n IfhLog.def\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n"} +{"text": "\n\n\n\n\nfrom caffe2.python import core, workspace\nfrom caffe2.python.test_util import TestCase\nimport tempfile\n\n\nclass TestCounterOps(TestCase):\n\n def test_counter_ops(self):\n workspace.RunOperatorOnce(core.CreateOperator(\n 'CreateCounter', [], ['c'], init_count=1))\n\n workspace.RunOperatorOnce(core.CreateOperator(\n 'CountDown', ['c'], ['t1'])) # 1 -> 0\n assert not workspace.FetchBlob('t1')\n\n workspace.RunOperatorOnce(core.CreateOperator(\n 'CountDown', ['c'], ['t2'])) # 0 -> -1\n assert workspace.FetchBlob('t2')\n\n workspace.RunOperatorOnce(core.CreateOperator(\n 'CountUp', ['c'], ['t21'])) # -1 -> 0\n assert workspace.FetchBlob('t21') == -1\n workspace.RunOperatorOnce(core.CreateOperator(\n 'RetrieveCount', ['c'], ['t22']))\n assert workspace.FetchBlob('t22') == 0\n\n workspace.RunOperatorOnce(core.CreateOperator(\n 'ResetCounter', ['c'], [], init_count=1)) # -> 1\n workspace.RunOperatorOnce(core.CreateOperator(\n 'CountDown', ['c'], ['t3'])) # 1 -> 0\n assert not workspace.FetchBlob('t3')\n\n workspace.RunOperatorOnce(core.CreateOperator(\n 'ResetCounter', ['c'], ['t31'], init_count=5)) # 0 -> 5\n assert workspace.FetchBlob('t31') == 0\n workspace.RunOperatorOnce(core.CreateOperator(\n 'ResetCounter', ['c'], ['t32'])) # 5 -> 0\n assert workspace.FetchBlob('t32') == 5\n\n workspace.RunOperatorOnce(core.CreateOperator(\n 'ConstantFill', [], ['t4'], value=False, shape=[],\n dtype=core.DataType.BOOL))\n assert workspace.FetchBlob('t4') == workspace.FetchBlob('t1')\n\n workspace.RunOperatorOnce(core.CreateOperator(\n 'ConstantFill', [], ['t5'], value=True, shape=[],\n dtype=core.DataType.BOOL))\n assert workspace.FetchBlob('t5') == workspace.FetchBlob('t2')\n\n assert workspace.RunOperatorOnce(core.CreateOperator(\n 'And', ['t1', 't2'], ['t6']))\n assert not workspace.FetchBlob('t6') # True && False\n\n assert workspace.RunOperatorOnce(core.CreateOperator(\n 'And', ['t2', 't5'], ['t7']))\n assert workspace.FetchBlob('t7') # True && True\n\n workspace.RunOperatorOnce(core.CreateOperator(\n 'CreateCounter', [], ['serialized_c'], init_count=22))\n with tempfile.NamedTemporaryFile() as tmp:\n workspace.RunOperatorOnce(core.CreateOperator(\n 'Save', ['serialized_c'], [], absolute_path=1,\n db_type='minidb', db=tmp.name))\n for i in range(10):\n workspace.RunOperatorOnce(core.CreateOperator(\n 'CountDown', ['serialized_c'], ['t8']))\n workspace.RunOperatorOnce(core.CreateOperator(\n 'RetrieveCount', ['serialized_c'], ['t8']))\n assert workspace.FetchBlob('t8') == 12\n workspace.RunOperatorOnce(core.CreateOperator(\n 'Load', [], ['serialized_c'], absolute_path=1,\n db_type='minidb', db=tmp.name))\n workspace.RunOperatorOnce(core.CreateOperator(\n 'RetrieveCount', ['serialized_c'], ['t8']))\n assert workspace.FetchBlob('t8') == 22\n\nif __name__ == \"__main__\":\n import unittest\n unittest.main()\n"} +{"text": "class Stringer < Sinatra::Base\n def self.test_path(*chunks)\n File.expand_path(File.join(\"..\", *chunks), __FILE__)\n end\n\n get \"/test\" do\n erb File.read(self.class.test_path(\"support\", \"views\", \"index.erb\")), layout: false, locals: {\n js_files: js_files,\n js_templates: js_templates\n }\n end\n\n get \"/spec/*\" do\n send_file self.class.test_path(\"spec\", *params[:splat])\n end\n\n get \"/vendor/*\" do\n send_file self.class.test_path(\"support\", \"vendor\", *params[:splat])\n end\n\n private\n\n def vendor_js_files\n %w(mocha.js sinon.js chai.js chai-changes.js chai-backbone.js sinon-chai.js).map do |name|\n File.join \"vendor\", \"js\", name\n end\n end\n\n def vendor_css_files\n %w(mocha.css).map do |name|\n File.join \"vendor\", \"css\", name\n end\n end\n\n def js_helper_files\n %w(spec_helper.js).map do |name|\n File.join \"spec\", name\n end\n end\n\n def js_lib_files\n base = self.class.test_path(\"..\", \"..\", \"app\", \"public\")\n Dir[File.join(base, \"js\", \"**\", \"*.js\")].map do |lib_file|\n lib_file.sub!(base, \"\")\n end\n end\n\n def js_test_files\n base = self.class.test_path\n Dir[File.join(base, \"**\", \"*_spec.js\")].map do |spec_file|\n spec_file.sub!(base, \"\")\n end\n end\n\n def js_files\n vendor_js_files + js_helper_files + js_test_files\n end\n\n def css_files\n vendor_css_files\n end\n\n def js_templates\n [:story]\n end\nend\n"} +{"text": "package org.zimmob.zimlx.globalsearch.providers\n\nimport android.content.Context\nimport android.content.Intent\nimport android.graphics.drawable.Drawable\nimport androidx.annotation.Keep\nimport com.android.launcher3.LauncherAppState\nimport com.android.launcher3.LauncherState\nimport com.android.launcher3.R\nimport org.zimmob.zimlx.globalsearch.SearchProvider\n\n@Keep\nclass AppSearchSearchProvider(context: Context) : SearchProvider(context) {\n\n override val name = context.getString(R.string.search_provider_appsearch)\n override val supportsVoiceSearch = false\n override val supportsAssistant = false\n override val supportsFeed = false\n\n override fun startSearch(callback: (intent: Intent) -> Unit) {\n val launcher = LauncherAppState.getInstanceNoCreate().launcher\n launcher.stateManager.goToState(LauncherState.ALL_APPS, true) {\n launcher.appsView.searchUiManager.startSearch()\n }\n }\n\n override fun getIcon(): Drawable = context.getDrawable(R.drawable.ic_search)!!.mutate()\n\n}"} +{"text": "---\ntitle: 'Lync Server 2013: PSTN connectivity components'\nms.reviewer: \nms.author: v-lanac\nauthor: lanachin\nf1.keywords:\n- NOCSH\nTOCTitle: PSTN connectivity components\nms:assetid: 6b2a3f7d-760f-4f09-8432-312c98a7e6b7\nms:mtpsurl: https://technet.microsoft.com/en-us/library/Gg398504(v=OCS.15)\nms:contentKeyID: 48184408\nms.date: 07/23/2014\nmanager: serdars\nmtps_version: v=OCS.15\n---\n\n
\n\n
\n\n
\n\n# PSTN connectivity components in Lync Server 2013\n\n
\n\n
\n\n
\n\n \n\n_**Topic Last Modified:** 2012-10-04_\n\nAn enterprise-grade VoIP solution must provide for calls to and from the public switched telephone network (PSTN) without any decline in Quality of Service (QoS). In addition, users should not be aware of the underlying technology when they place and receive calls. From the user's perspective, a call between the Enterprise Voice infrastructure and the PSTN should seem like just another SIP session.\n\nFor PSTN connections, you can either deploy a SIP trunk or a PSTN gateway (with a PBX, also known as a Direct SIP link, or without a PBX).\n\n
\n\n## SIP Trunking\n\nAs an alternative to using PSTN gateways, you can connect your Enterprise Voice solution to the PSTN by using SIP trunking. SIP trunking enables the following scenarios:\n\n - An enterprise user inside or outside the corporate firewall can make a local or long-distance call specified by an E.164-compliant number that is terminated on the PSTN as a service of the corresponding service provider.\n\n - Any PSTN subscriber can contact an enterprise user inside or outside the corporate firewall by dialing a Direct Inward Dialing (DID) number associated with that enterprise user.\n\nThe use of this deployment solution requires a SIP trunking service provider.\n\n
\n\n
\n\n## PSTN gateways\n\nPSTN gateways are third-party devices that translate signaling and media between the Enterprise Voice infrastructure and a PSTN or a PBX. PSTN gateways work with the Mediation Server to present a PSTN or PBX call to an Enterprise Voice client. The Mediation Server also presents calls from Enterprise Voice clients to the PSTN gateway for routing to the PSTN or PBX. For a list of partners who work with Microsoft to provide devices that work with Lync Server, see the Microsoft Unified Communications Partners website at [https://go.microsoft.com/fwlink/p/?linkId=202836](https://go.microsoft.com/fwlink/p/?linkid=202836).\n\n
\n\n
\n\n## Private Branch Exchanges\n\nIf you have an existing voice infrastructure that uses a private branch exchange (PBX), you can use your PBX with Lync Server Enterprise Voice.\n\nThe supported Enterprise Voice-PBX integration scenarios are as follows:\n\n - IP-PBX that supports media bypass, with a Mediation Server.\n\n - IP-PBX that requires a stand-alone PSTN gateway.\n\n - Time division multiplexing (TDM) PBX, with a stand-alone PSTN gateway.\n\n
\n\n\n> [!NOTE] \n> Media bypass will not interoperate with every PSTN gateway, IP-PBX, and SBC. Microsoft has tested a set of PSTN gateways and SBCs with certified partners and has done some testing with Cisco IP-PBXs. Media bypass is supported only with products and versions listed on Unified Communications Open Interoperability Program – Lync Server at https://go.microsoft.com/fwlink/p/?linkId=214406.\n\n\n\n
\n\nFor details about partners who offer Enterprise Voice solutions, see the Microsoft Unified Communications Partners website at [https://go.microsoft.com/fwlink/p/?linkId=202836](https://go.microsoft.com/fwlink/p/?linkid=202836).\n\nFor details about partners who offer Enterprise Voice hardware solutions, including PSTN gateways, see the Microsoft Unified Communications Partners website [https://go.microsoft.com/fwlink/p/?linkId=202836](https://go.microsoft.com/fwlink/p/?linkid=202836).\n\n
\n\n
\n\n \n\n
\n\n
\n\n
\n\n"} +{"text": "// Copyright 2015 Google Inc. All Rights Reserved.\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\n#import \n#import \n#import \n\n@class GCKDevice;\n@class GCKDeviceManager;\n@class GCKMediaControlChannel;\n@class GCKMediaInformation;\n\nextern NSString * const kCastViewController;\n\n@protocol ChromecastDeviceControllerDelegate \n@optional\n\n/**\n * Whether or not the device controller should be displayed.\n *\n * @return YES to display, NO to prevent.\n */\n- (BOOL)shouldDisplayModalDeviceController;\n\n@end\n\n@interface ChromecastDeviceController : NSObject <\n GCKDeviceScannerListener\n>\n\n/**\n * The storyboard contianing the Cast component views used by the controllers in\n * the CastComponents group.\n */\n@property(nonatomic, readonly) UIStoryboard *storyboard;\n\n/**\n * The delegate for this object.\n */\n@property(nonatomic, weak) id delegate;\n\n/**\n * The Cast application ID to launch.\n */\n@property(nonatomic, copy) NSString *applicationID;\n\n/**\n * The device manager used to manage a connection to a Cast device.\n */\n@property(nonatomic, strong) GCKDeviceManager* deviceManager;\n\n/**\n * The device scanner used to detect devices on the network.\n */\n@property(nonatomic, strong) GCKDeviceScanner* deviceScanner;\n\n/**\n * The media information of the loaded media on the device.\n */\n@property(nonatomic, readonly) GCKMediaInformation* mediaInformation;\n\n/** \n * The media control channel for the playing media. \n */\n@property GCKMediaControlChannel *mediaControlChannel;\n\n/**\n * Helper accessor for the media player state of the media on the device.\n */\n@property(nonatomic, readonly) GCKMediaPlayerState playerState;\n\n/**\n * Helper accessor for the duration of the currently casting media.\n */\n@property(nonatomic, readonly) NSTimeInterval streamDuration;\n\n/**\n * The current playback position of the currently casting media.\n */\n@property(nonatomic, readonly) NSTimeInterval streamPosition;\n\n/**\n * Main access point for the class. Use this to retrieve an object you can use.\n *\n * @return ChromecastDeviceController\n */\n+ (instancetype)sharedInstance;\n\n/**\n * Sets the position of the playback on the Cast device.\n *\n * @param newPercent 0.0-1.0\n */\n- (void)setPlaybackPercent:(float)newPercent;\n\n/**\n * Connect to the given Cast device.\n *\n * @param device A GCKDevice from the deviceScanner list.\n */\n- (void)connectToDevice:(GCKDevice *)device;\n\n/**\n * Load media onto the currently connected device.\n *\n * @param media The GCKMediaInformation to play, with the URL as the contentID\n * @param startTime Time to start from if starting a fresh cast\n * @param autoPlay Whether to start playing as soon as the media is loaded.\n *\n * @return YES if we can load the media.\n */\n- (BOOL)loadMedia:(GCKMediaInformation *)media\n startTime:(NSTimeInterval)startTime\n autoPlay:(BOOL)autoPlay;\n\n/** \n * Enable Cast enhancing of the controller by adding icons\n * and other UI elements. Signals that this view controller should be \n * used for presenting UI elements.\n *\n * @param controller The UIViewController to decorate.\n */\n- (void)decorateViewController:(UIViewController *)controller;\n\n@end\n"} +{"text": "template = fread($hd, filesize($template_filename));\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t$this->template = \"SmartTemplate Parser Error: File size is zero byte: '$template_filename'\";\n\t\t\t\t}\n\t\t\t\tfclose($hd);\n\t\t\t\t// Extract the name of the template directory\n\t\t\t\t$this->template_dir = dirname($template_filename);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t$this->template = \"SmartTemplate Parser Error: File not found: '$template_filename'\";\n\t\t\t}\n\t\t}\n\n\t\t/**\n\t\t* Main Template Parser\n\t\t*\n\t\t* @param string $compiled_template_filename Compiled Template Filename\n\t\t* @desc Creates Compiled PHP Template\n\t\t*/\n\t\tfunction compile( $compiled_template_filename = '' )\n\t\t{\n\t\t\tif (empty($this->template))\n\t\t\t{\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t/* Quick hack to allow subtemplates */\n\t\t\tif(eregi(\"/', $this->template, $tvar);\n\t\t\t\t\tforeach($tvar[1] as $subfile)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(file_exists($this->template_dir . \"/$subfile\"))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t$subst = implode('',file($this->template_dir . \"/$subfile\"));\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t$subst = 'SmartTemplate Parser Error: Subtemplate not found: \\''.$subfile.'\\'';\n\t\t\t\t\t\t}\n\t\t\t\t\t\t$this->template = str_replace(\"\", $subst, $this->template);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t//\tEND, ELSE Blocks\n\t\t\t$page = preg_replace(\"//\", \"\", $this->template);\n\t\t\t$page = preg_replace(\"//\", \"\", $page);\n\t\t\t$page = str_replace(\"\", \"\", $page);\n\n\t\t\t//\t'BEGIN - END' Blocks\n\t\t\tif (preg_match_all('//', $page, $var))\n\t\t\t{\n\t\t\t\tforeach ($var[1] as $tag)\n\t\t\t\t{\n\t\t\t\t\tlist($parent, $block) = $this->var_name($tag);\n\t\t\t\t\t$code = \"\\$$parent\".\"['$block']));\\n\"\n\t\t\t\t\t\t\t. \"\\$_tmp_arr_keys=array_keys(\\$$parent\".\"['$block']);\\n\"\n\t\t\t\t\t\t\t. \"if (\\$_tmp_arr_keys[0]!='0')\\n\"\n\t\t\t\t\t\t\t. \"\\$$parent\".\"['$block']=array(0=>\\$$parent\".\"['$block']);\\n\"\n\t\t\t\t\t\t\t. \"\\$_stack[\\$_stack_cnt++]=\\$_obj;\\n\"\n\t\t\t\t\t\t\t. \"foreach (\\$$parent\".\"['$block'] as \\$rowcnt=>\\$$block) {\\n\"\n\t\t\t\t\t\t\t. \"\\$$block\".\"['ROWCNT']=\\$rowcnt;\\n\"\n\t\t\t\t\t\t\t. \"\\$$block\".\"['ALTROW']=\\$rowcnt%2;\\n\"\n\t\t\t\t\t\t\t. \"\\$$block\".\"['ROWBIT']=\\$rowcnt%2;\\n\"\n\t\t\t\t\t\t\t. \"\\$_obj=&\\$$block;\\n?>\";\n\t\t\t\t\t$page = str_replace(\"\", $code, $page);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t//\t'IF nnn=mmm' Blocks\n\t\t\tif (preg_match_all('//', $page, $var))\n\t\t\t{\n\t\t\t\tforeach ($var[2] as $cnt => $tag)\n\t\t\t\t{\n\t\t\t\t\tlist($parent, $block) = $this->var_name($tag);\n\t\t\t\t\t$cmp = $var[3][$cnt];\n\t\t\t\t\t$val = $var[4][$cnt];\n\t\t\t\t\t$else = ($var[1][$cnt] == 'ELSE') ? '} else' : '';\n\t\t\t\t\tif ($cmp == '=')\n\t\t\t\t\t{\n\t\t\t\t\t\t$cmp = '==';\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tif (preg_match('/\"([^\"]*)\"/',$val,$matches))\n\t\t\t\t\t{\n\t\t\t\t\t\t$code = \"\";\n\t\t\t\t\t}\n\t\t\t\t\telseif (preg_match('/([^\"]*)/',$val,$matches))\n\t\t\t\t\t{\n\t\t\t\t\t\tlist($parent_right, $block_right) = $this->var_name($matches[1]);\n\t\t\t\t\t\t$code = \"\";\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\t$page = str_replace($var[0][$cnt], $code, $page);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t//\t'IF nnn' Blocks\n\t\t\tif (preg_match_all('//', $page, $var))\n\t\t\t{\n\t\t\t\tforeach ($var[2] as $cnt => $tag)\n\t\t\t\t{\n\t\t\t\t\t$else = ($var[1][$cnt] == 'ELSE') ? '} else' : '';\n\t\t\t\t\tlist($parent, $block) = $this->var_name($tag);\n\t\t\t\t\t$code = \"\";\n\t\t\t\t\t$page = str_replace($var[0][$cnt], $code, $page);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t//\tReplace Scalars\n\t\t\tif (preg_match_all('/{([a-zA-Z0-9_. >]+)}/', $page, $var))\n\t\t\t{\n\t\t\t\tforeach ($var[1] as $fulltag)\n\t\t\t\t{\n\t\t\t\t\t//\tDetermin Command (echo / $obj[n]=)\n\t\t\t\t\tlist($cmd, $tag) = $this->cmd_name($fulltag);\n\n\t\t\t\t\tlist($block, $skalar) = $this->var_name($tag);\n\t\t\t\t\t$code = \"\\n\";\n\t\t\t\t\t$page = str_replace('{'.$fulltag.'}', $code, $page);\n\t\t\t\t}\n\t\t\t}\n\n\n\t\t\t//\tROSI Special: Replace Translations\n\t\t\tif (preg_match_all('/<\"([a-zA-Z0-9_.]+)\">/', $page, $var))\n\t\t\t{\n\t\t\t\tforeach ($var[1] as $tag)\n\t\t\t\t{\n\t\t\t\t\tlist($block, $skalar) = $this->var_name($tag);\n\t\t\t\t\t$code = \"\\n\";\n\t\t\t\t\t$page = str_replace('<\"'.$tag.'\">', $code, $page);\n\t\t\t\t}\n\t\t\t}\n\n\n\t\t\t//\tInclude Extensions\n\t\t\t$header = '';\n\t\t\tif (preg_match_all('/{([a-zA-Z0-9_]+):([^}]*)}/', $page, $var))\n\t\t\t{\n\t\t\t\tforeach ($var[2] as $cnt => $tag)\n\t\t\t\t{\n\t\t\t\t\t//\tDetermin Command (echo / $obj[n]=)\n\t\t\t\t\tlist($cmd, $tag) = $this->cmd_name($tag);\n\n\t\t\t\t\t$extension = $var[1][$cnt];\n\t\t\t\t\tif (!isset($this->extension_tagged[$extension]))\n\t\t\t\t\t{\n\t\t\t\t\t\t$header .= \"include_once \\\"smarttemplate_extensions/smarttemplate_extension_$extension.php\\\";\\n\";\n\t\t\t\t\t\t$this->extension_tagged[$extension] = true;\n\t\t\t\t\t}\n\t\t\t\t\tif (!strlen($tag))\n\t\t\t\t\t{\n\t\t\t\t\t\t$code = \"\\n\";\n\t\t\t\t\t}\n\t\t\t\t\telseif (substr($tag, 0, 1) == '\"')\n\t\t\t\t\t{\n\t\t\t\t\t\t$code = \"\\n\";\n\t\t\t\t\t}\n\t\t\t\t\telseif (strpos($tag, ','))\n\t\t\t\t\t{\n\t\t\t\t\t\tlist($tag, $addparam) = explode(',', $tag, 2);\n\t\t\t\t\t\tlist($block, $skalar) = $this->var_name($tag);\n\t\t\t\t\t\tif (preg_match('/^([a-zA-Z_]+)/', $addparam, $match))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t$nexttag = $match[1];\n\t\t\t\t\t\t\tlist($nextblock, $nextskalar) = $this->var_name($nexttag);\n\t\t\t\t\t\t\t$addparam = substr($addparam, strlen($nexttag));\n\t\t\t\t\t\t\t$code = \"\\n\";\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t$code = \"\\n\";\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tlist($block, $skalar) = $this->var_name($tag);\n\t\t\t\t\t\t$code = \"\\n\";\n\t\t\t\t\t}\n\t\t\t\t\t$page = str_replace($var[0][$cnt], $code, $page);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t//\tAdd Include Header\n\t\t\tif (isset($header) && !empty($header))\n\t\t\t{\n\t\t\t\t$page = \"$page\";\n\t\t\t}\n\n\t\t\t//\tStore Code to Temp Dir\n\t\t\tif (strlen($compiled_template_filename))\n\t\t\t{\n\t\t if ($hd = fopen($compiled_template_filename, \"w\"))\n\t\t {\n\t\t\t fwrite($hd, $page);\n\t\t\t fclose($hd);\n\t\t\t return true;\n\t\t\t }\n\t\t\t else\n\t\t\t {\n\t\t\t \t$this->error = \"Could not write compiled file.\";\n\t\t\t return false;\n\t\t\t }\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn $page;\n\t\t\t}\n\t\t}\n\n\n\t\t/**\n\t\t* Splits Template-Style Variable Names into an Array-Name/Key-Name Components\n\t\t* {example} : array( \"_obj\", \"example\" ) -> $_obj['example']\n\t\t* {example.value} : array( \"_obj['example']\", \"value\" ) -> $_obj['example']['value']\n\t\t* {example.0.value} : array( \"_obj['example'][0]\", \"value\" ) -> $_obj['example'][0]['value']\n\t\t* {top.example} : array( \"_stack[0]\", \"example\" ) -> $_stack[0]['example']\n\t\t* {parent.example} : array( \"_stack[$_stack_cnt-1]\", \"example\" ) -> $_stack[$_stack_cnt-1]['example']\n\t\t* {parent.parent.example} : array( \"_stack[$_stack_cnt-2]\", \"example\" ) -> $_stack[$_stack_cnt-2]['example']\n\t\t*\n\t\t* @param string $tag Variale Name used in Template\n\t\t* @return array Array Name, Key Name\n\t\t* @access private\n\t\t* @desc Splits Template-Style Variable Names into an Array-Name/Key-Name Components\n\t\t*/\n\t\tfunction var_name($tag)\n\t\t{\n\t\t\t$parent_level = 0;\n\t\t\twhile (substr($tag, 0, 7) == 'parent.')\n\t\t\t{\n\t\t\t\t$tag = substr($tag, 7);\n\t\t\t\t$parent_level++;\n\t\t\t}\n\t\t\tif (substr($tag, 0, 4) == 'top.')\n\t\t\t{\n\t\t\t\t$obj = '_stack[0]';\n\t\t\t\t$tag = substr($tag,4);\n\t\t\t}\n\t\t\telseif ($parent_level)\n\t\t\t{\n\t\t\t\t$obj = '_stack[$_stack_cnt-'.$parent_level.']';\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t$obj = '_obj';\n\t\t\t}\n\t\t\twhile (is_int(strpos($tag, '.')))\n\t\t\t{\n\t\t\t\tlist($parent, $tag) = explode('.', $tag, 2);\n\t\t\t\tif (is_numeric($parent))\n\t\t\t\t{\n\t\t\t\t\t$obj .= \"[\" . $parent . \"]\";\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t$obj .= \"['\" . $parent . \"']\";\n\t\t\t\t}\n\t\t\t}\n\t\t\t$ret = array($obj, $tag);\n\t\t\treturn $ret;\n\t\t}\n\n\n\t\t/**\n\t\t* Determine Template Command from Variable Name\n\t\t* {variable} : array( \"echo\", \"variable\" ) -> echo $_obj['variable']\n\t\t* {variable > new_name} : array( \"_obj['new_name']=\", \"variable\" ) -> $_obj['new_name']= $_obj['variable']\n\t\t*\n\t\t* @param string $tag Variale Name used in Template\n\t\t* @return array Array Command, Variable\n\t\t* @access private\n\t\t* @desc Determine Template Command from Variable Name\n\t\t*/\n\t\tfunction cmd_name($tag)\n\t\t{\n\t\t\tif (preg_match('/^(.+) > ([a-zA-Z0-9_.]+)$/', $tag, $tagvar))\n\t\t\t{\n\t\t\t\t$tag = $tagvar[1];\n\t\t\t\tlist($newblock, $newskalar) = $this->var_name($tagvar[2]);\n\t\t\t\t$cmd = \"\\$$newblock\".\"['$newskalar']=\";\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t$cmd = \"echo\";\n\t\t\t}\n\t\t\t$ret = array($cmd, $tag);\n\t\t\treturn $ret;\n\t\t}\n\n\t\t/**\n\t\t* @return int Number of subtemplate included\n\t\t* @access private\n\t\t* @desc Count number of subtemplates included in current template\n\t\t*/\n\t\tfunction count_subtemplates()\n\t\t{\n\t\t\tpreg_match_all('//', $this->template, $tvar);\n\t\t\t$count_subtemplates = count($tvar[1]);\n\t\t\t$ret = intval($count_subtemplates);\n\t\t\treturn $ret;\n\t\t}\n\t}\n?>"} +{"text": "#\n# BEGIN SONGBIRD GPL\n# \n# This file is part of the Songbird web player.\n#\n# Copyright(c) 2005-2008 POTI, Inc.\n# http://www.songbirdnest.com\n# \n# This file may be licensed under the terms of of the\n# GNU General Public License Version 2 (the “GPL”).\n# \n# Software distributed under the License is distributed \n# on an “AS IS” basis, WITHOUT WARRANTY OF ANY KIND, either \n# express or implied. See the GPL for the specific language \n# governing rights and limitations.\n#\n# You should have received a copy of the GPL along with this \n# program. If not, go to http://www.gnu.org/licenses/gpl.html\n# or write to the Free Software Foundation, Inc., \n# 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n# \n# END SONGBIRD GPL\n#\n\nDEPTH = ../../../..\ntopsrcdir = @top_srcdir@\nsrcdir = @srcdir@\nVPATH = @srcdir@\n\ninclude $(DEPTH)/build/autodefs.mk\n\nSUBDIRS = taglib \\\n $(NULL)\n\nifeq (windows_,$(SB_PLATFORM)_$(SB_WITH_MSVC_EXPRESS))\n SUBDIRS += wma\nendif\n\ninclude $(topsrcdir)/build/rules.mk\n"} +{"text": "//\n// Generated by class-dump 3.5 (64 bit).\n//\n// class-dump is Copyright (C) 1997-1998, 2000-2001, 2004-2013 by Steve Nygard.\n//\n\n#import \"MMObject.h\"\n\n#import \"EditImageToolDelegate.h\"\n\n@class CAShapeLayer, NSString, UIColor, UIImage, UIImageView;\n\n@interface EditImagePenTool : MMObject \n{\n struct CGPath *_path;\n struct CGPoint _initialPoint;\n _Bool _initial;\n CAShapeLayer *slayer;\n UIImageView *tView;\n UIImage *_cacheImg;\n struct CGPath *_subpath;\n _Bool _useLayer;\n struct CGPath *_relayPath;\n CAShapeLayer *_tmpLayer;\n struct CGPath *_tmpPath;\n _Bool _renderDone;\n unsigned int _penCountLimit;\n unsigned int _penCount;\n UIColor *_lineColor;\n double _lineWidth;\n id __delegate;\n}\n\n@property(nonatomic) __weak id _delegate; // @synthesize _delegate=__delegate;\n@property(nonatomic) unsigned int _penCount; // @synthesize _penCount;\n@property(nonatomic) double _lineWidth; // @synthesize _lineWidth;\n@property(retain, nonatomic) UIColor *_lineColor; // @synthesize _lineColor;\n- (void).cxx_destruct;\n- (void)dealloc;\n- (void)drawLayer;\n- (void)updateCachedImage;\n- (struct CGRect)addPathWithP2Point:(struct CGPoint)arg1 withP1Point:(struct CGPoint)arg2 withCPoint:(struct CGPoint)arg3;\n- (void)setInitialPoint:(struct CGPoint)arg1;\n- (id)createView:(struct CGRect)arg1;\n- (id)createLayer:(struct CGRect)arg1;\n- (id)init;\n\n// Remaining properties\n@property(readonly, copy) NSString *debugDescription;\n@property(readonly, copy) NSString *description;\n@property(readonly) unsigned long long hash;\n@property(readonly) Class superclass;\n\n@end\n\n"} +{"text": "\n true\n gui\n lib\n work/processing.exe\n \n \n .\n normal\n http://java.com/download\n \n false\n false\n \n application.ico\n \n processing.app.Base\n lib/pde.jar\n core/library/core.jar\n lib/jna.jar\n lib/jna-platform.jar\n lib/antlr-4.7.2-complete.jar\n lib/ant.jar\n lib/ant-launcher.jar\n \n \n \n java\n \n \n \n -Djna.nosys=true\n \n \n -Dsun.java2d.uiScale.enabled=false\n \n -Djna.boot.library.path=lib\n -Djna.nounpack=true\n \n -Dsun.java2d.d3d=false\n -Dsun.java2d.ddoffscreen=false\n -Dsun.java2d.noddraw=true\n \n 1.8.0_60\n \n 512\n \n \n about.bmp\n true\n 60\n false\n \n \n An error occurred while starting the application.\n This application was configured to use a bundled Java Runtime Environment but the runtime is missing or corrupted. If running from a folder with non-ASCII characters, try moving this folder to another location.\n Required files could not be found. Be sure to first extract the entire Processing folder from the .zip file download. Or if running from a folder with non-ASCII characters, try moving the Processing folder to another location.\n The registry refers to a nonexistent Java installation or the runtime is corrupted.\n An application instance is already running.\n \n\n"} +{"text": "/*\n * Copyright (c) 1997, 2017, Oracle and/or its affiliates. All rights reserved.\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * This code is free software; you can redistribute it and/or modify it\n * under the terms of the GNU General Public License version 2 only, as\n * published by the Free Software Foundation.\n *\n * This code is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License\n * version 2 for more details (a copy is included in the LICENSE file that\n * accompanied this code).\n *\n * You should have received a copy of the GNU General Public License version\n * 2 along with this work; if not, write to the Free Software Foundation,\n * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.\n *\n * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA\n * or visit www.oracle.com if you need additional information or have any\n * questions.\n *\n */\n\n#ifndef SHARE_VM_RUNTIME_INTERFACESUPPORT_INLINE_HPP\n#define SHARE_VM_RUNTIME_INTERFACESUPPORT_INLINE_HPP\n\n#include \"runtime/handles.inline.hpp\"\n#include \"runtime/mutexLocker.hpp\"\n#include \"runtime/orderAccess.hpp\"\n#include \"runtime/os.hpp\"\n#include \"runtime/safepointMechanism.inline.hpp\"\n#include \"runtime/safepointVerifiers.hpp\"\n#include \"runtime/thread.hpp\"\n#include \"runtime/vmOperations.hpp\"\n#include \"utilities/globalDefinitions.hpp\"\n#include \"utilities/macros.hpp\"\n#include \"utilities/preserveException.hpp\"\n\n// Wrapper for all entry points to the virtual machine.\n\n// InterfaceSupport provides functionality used by the VM_LEAF_BASE and\n// VM_ENTRY_BASE macros. These macros are used to guard entry points into\n// the VM and perform checks upon leave of the VM.\n\n\nclass InterfaceSupport: AllStatic {\n# ifdef ASSERT\n public:\n static long _scavenge_alot_counter;\n static long _fullgc_alot_counter;\n static long _number_of_calls;\n static long _fullgc_alot_invocation;\n\n // Helper methods used to implement +ScavengeALot and +FullGCALot\n static void check_gc_alot() { if (ScavengeALot || FullGCALot) gc_alot(); }\n static void gc_alot();\n\n static void walk_stack_from(vframe* start_vf);\n static void walk_stack();\n\n static void zombieAll();\n static void unlinkSymbols();\n static void deoptimizeAll();\n static void verify_stack();\n static void verify_last_frame();\n# endif\n\n public:\n static void serialize_thread_state_with_handler(JavaThread* thread) {\n serialize_thread_state_internal(thread, true);\n }\n\n // Should only call this if we know that we have a proper SEH set up.\n static void serialize_thread_state(JavaThread* thread) {\n serialize_thread_state_internal(thread, false);\n }\n\n private:\n static void serialize_thread_state_internal(JavaThread* thread, bool needs_exception_handler) {\n // Make sure new state is seen by VM thread\n if (os::is_MP()) {\n if (UseMembar) {\n // Force a fence between the write above and read below\n OrderAccess::fence();\n } else {\n // store to serialize page so VM thread can do pseudo remote membar\n if (needs_exception_handler) {\n os::write_memory_serialize_page_with_handler(thread);\n } else {\n os::write_memory_serialize_page(thread);\n }\n }\n }\n }\n};\n\n\n// Basic class for all thread transition classes.\n\nclass ThreadStateTransition : public StackObj {\n protected:\n JavaThread* _thread;\n public:\n ThreadStateTransition(JavaThread *thread) {\n _thread = thread;\n assert(thread != NULL && thread->is_Java_thread(), \"must be Java thread\");\n }\n\n // Change threadstate in a manner, so safepoint can detect changes.\n // Time-critical: called on exit from every runtime routine\n static inline void transition(JavaThread *thread, JavaThreadState from, JavaThreadState to) {\n assert(from != _thread_in_Java, \"use transition_from_java\");\n assert(from != _thread_in_native, \"use transition_from_native\");\n assert((from & 1) == 0 && (to & 1) == 0, \"odd numbers are transitions states\");\n assert(thread->thread_state() == from, \"coming from wrong thread state\");\n // Change to transition state\n thread->set_thread_state((JavaThreadState)(from + 1));\n\n InterfaceSupport::serialize_thread_state(thread);\n\n SafepointMechanism::block_if_requested(thread);\n thread->set_thread_state(to);\n\n CHECK_UNHANDLED_OOPS_ONLY(thread->clear_unhandled_oops();)\n }\n\n // transition_and_fence must be used on any thread state transition\n // where there might not be a Java call stub on the stack, in\n // particular on Windows where the Structured Exception Handler is\n // set up in the call stub. os::write_memory_serialize_page() can\n // fault and we can't recover from it on Windows without a SEH in\n // place.\n static inline void transition_and_fence(JavaThread *thread, JavaThreadState from, JavaThreadState to) {\n assert(thread->thread_state() == from, \"coming from wrong thread state\");\n assert((from & 1) == 0 && (to & 1) == 0, \"odd numbers are transitions states\");\n // Change to transition state\n thread->set_thread_state((JavaThreadState)(from + 1));\n\n InterfaceSupport::serialize_thread_state_with_handler(thread);\n\n SafepointMechanism::block_if_requested(thread);\n thread->set_thread_state(to);\n\n CHECK_UNHANDLED_OOPS_ONLY(thread->clear_unhandled_oops();)\n }\n\n // Same as above, but assumes from = _thread_in_Java. This is simpler, since we\n // never block on entry to the VM. This will break the code, since e.g. preserve arguments\n // have not been setup.\n static inline void transition_from_java(JavaThread *thread, JavaThreadState to) {\n assert(thread->thread_state() == _thread_in_Java, \"coming from wrong thread state\");\n thread->set_thread_state(to);\n }\n\n static inline void transition_from_native(JavaThread *thread, JavaThreadState to) {\n assert((to & 1) == 0, \"odd numbers are transitions states\");\n assert(thread->thread_state() == _thread_in_native, \"coming from wrong thread state\");\n // Change to transition state\n thread->set_thread_state(_thread_in_native_trans);\n\n InterfaceSupport::serialize_thread_state_with_handler(thread);\n\n // We never install asynchronous exceptions when coming (back) in\n // to the runtime from native code because the runtime is not set\n // up to handle exceptions floating around at arbitrary points.\n if (SafepointMechanism::poll(thread) || thread->is_suspend_after_native()) {\n JavaThread::check_safepoint_and_suspend_for_native_trans(thread);\n\n // Clear unhandled oops anywhere where we could block, even if we don't.\n CHECK_UNHANDLED_OOPS_ONLY(thread->clear_unhandled_oops();)\n }\n\n thread->set_thread_state(to);\n }\n protected:\n void trans(JavaThreadState from, JavaThreadState to) { transition(_thread, from, to); }\n void trans_from_java(JavaThreadState to) { transition_from_java(_thread, to); }\n void trans_from_native(JavaThreadState to) { transition_from_native(_thread, to); }\n void trans_and_fence(JavaThreadState from, JavaThreadState to) { transition_and_fence(_thread, from, to); }\n};\n\nclass ThreadInVMForHandshake : public ThreadStateTransition {\n const JavaThreadState _original_state;\n\n void transition_back() {\n // This can be invoked from transition states and must return to the original state properly\n assert(_thread->thread_state() == _thread_in_vm, \"should only call when leaving VM after handshake\");\n _thread->set_thread_state(_thread_in_vm_trans);\n\n InterfaceSupport::serialize_thread_state(_thread);\n\n SafepointMechanism::block_if_requested(_thread);\n\n _thread->set_thread_state(_original_state);\n\n if (_original_state != _thread_blocked_trans && _original_state != _thread_in_vm_trans &&\n _thread->has_special_runtime_exit_condition()) {\n _thread->handle_special_runtime_exit_condition(\n !_thread->is_at_poll_safepoint() && (_original_state != _thread_in_native_trans));\n }\n }\n\n public:\n\n ThreadInVMForHandshake(JavaThread* thread) : ThreadStateTransition(thread),\n _original_state(thread->thread_state()) {\n\n if (thread->has_last_Java_frame()) {\n thread->frame_anchor()->make_walkable(thread);\n }\n\n thread->set_thread_state(_thread_in_vm);\n }\n\n ~ThreadInVMForHandshake() {\n transition_back();\n }\n\n};\n\nclass ThreadInVMfromJava : public ThreadStateTransition {\n public:\n ThreadInVMfromJava(JavaThread* thread) : ThreadStateTransition(thread) {\n trans_from_java(_thread_in_vm);\n }\n ~ThreadInVMfromJava() {\n if (_thread->stack_yellow_reserved_zone_disabled()) {\n _thread->enable_stack_yellow_reserved_zone();\n }\n trans(_thread_in_vm, _thread_in_Java);\n // Check for pending. async. exceptions or suspends.\n if (_thread->has_special_runtime_exit_condition()) _thread->handle_special_runtime_exit_condition();\n }\n};\n\n\nclass ThreadInVMfromUnknown {\n private:\n JavaThread* _thread;\n public:\n ThreadInVMfromUnknown() : _thread(NULL) {\n Thread* t = Thread::current();\n if (t->is_Java_thread()) {\n JavaThread* t2 = (JavaThread*) t;\n if (t2->thread_state() == _thread_in_native) {\n _thread = t2;\n ThreadStateTransition::transition_from_native(t2, _thread_in_vm);\n // Used to have a HandleMarkCleaner but that is dangerous as\n // it could free a handle in our (indirect, nested) caller.\n // We expect any handles will be short lived and figure we\n // don't need an actual HandleMark.\n }\n }\n }\n ~ThreadInVMfromUnknown() {\n if (_thread) {\n ThreadStateTransition::transition_and_fence(_thread, _thread_in_vm, _thread_in_native);\n }\n }\n};\n\n\nclass ThreadInVMfromNative : public ThreadStateTransition {\n public:\n ThreadInVMfromNative(JavaThread* thread) : ThreadStateTransition(thread) {\n trans_from_native(_thread_in_vm);\n }\n ~ThreadInVMfromNative() {\n trans_and_fence(_thread_in_vm, _thread_in_native);\n }\n};\n\n\nclass ThreadToNativeFromVM : public ThreadStateTransition {\n public:\n ThreadToNativeFromVM(JavaThread *thread) : ThreadStateTransition(thread) {\n // We are leaving the VM at this point and going directly to native code.\n // Block, if we are in the middle of a safepoint synchronization.\n assert(!thread->owns_locks(), \"must release all locks when leaving VM\");\n thread->frame_anchor()->make_walkable(thread);\n trans_and_fence(_thread_in_vm, _thread_in_native);\n // Check for pending. async. exceptions or suspends.\n if (_thread->has_special_runtime_exit_condition()) _thread->handle_special_runtime_exit_condition(false);\n }\n\n ~ThreadToNativeFromVM() {\n trans_from_native(_thread_in_vm);\n assert(!_thread->is_pending_jni_exception_check(), \"Pending JNI Exception Check\");\n // We don't need to clear_walkable because it will happen automagically when we return to java\n }\n};\n\n\nclass ThreadBlockInVM : public ThreadStateTransition {\n public:\n ThreadBlockInVM(JavaThread *thread)\n : ThreadStateTransition(thread) {\n // Once we are blocked vm expects stack to be walkable\n thread->frame_anchor()->make_walkable(thread);\n trans_and_fence(_thread_in_vm, _thread_blocked);\n }\n ~ThreadBlockInVM() {\n trans_and_fence(_thread_blocked, _thread_in_vm);\n // We don't need to clear_walkable because it will happen automagically when we return to java\n }\n};\n\n\n// This special transition class is only used to prevent asynchronous exceptions\n// from being installed on vm exit in situations where we can't tolerate them.\n// See bugs: 4324348, 4854693, 4998314, 5040492, 5050705.\nclass ThreadInVMfromJavaNoAsyncException : public ThreadStateTransition {\n public:\n ThreadInVMfromJavaNoAsyncException(JavaThread* thread) : ThreadStateTransition(thread) {\n trans_from_java(_thread_in_vm);\n }\n ~ThreadInVMfromJavaNoAsyncException() {\n if (_thread->stack_yellow_reserved_zone_disabled()) {\n _thread->enable_stack_yellow_reserved_zone();\n }\n trans(_thread_in_vm, _thread_in_Java);\n // NOTE: We do not check for pending. async. exceptions.\n // If we did and moved the pending async exception over into the\n // pending exception field, we would need to deopt (currently C2\n // only). However, to do so would require that we transition back\n // to the _thread_in_vm state. Instead we postpone the handling of\n // the async exception.\n\n\n // Check for pending. suspends only.\n if (_thread->has_special_runtime_exit_condition())\n _thread->handle_special_runtime_exit_condition(false);\n }\n};\n\n// Debug class instantiated in JRT_ENTRY and ITR_ENTRY macro.\n// Can be used to verify properties on enter/exit of the VM.\n\n#ifdef ASSERT\nclass VMEntryWrapper {\n public:\n VMEntryWrapper();\n ~VMEntryWrapper();\n};\n\n\nclass VMNativeEntryWrapper {\n public:\n VMNativeEntryWrapper() {\n if (GCALotAtAllSafepoints) InterfaceSupport::check_gc_alot();\n }\n\n ~VMNativeEntryWrapper() {\n if (GCALotAtAllSafepoints) InterfaceSupport::check_gc_alot();\n }\n};\n\n#endif\n\n\n// VM-internal runtime interface support\n\n// Definitions for JRT (Java (Compiler/Shared) Runtime)\n\n// JRT_LEAF currently can be called from either _thread_in_Java or\n// _thread_in_native mode. In _thread_in_native, it is ok\n// for another thread to trigger GC. The rest of the JRT_LEAF\n// rules apply.\nclass JRTLeafVerifier : public NoSafepointVerifier {\n static bool should_verify_GC();\n public:\n#ifdef ASSERT\n JRTLeafVerifier();\n ~JRTLeafVerifier();\n#else\n JRTLeafVerifier() {}\n ~JRTLeafVerifier() {}\n#endif\n};\n\n#ifdef ASSERT\n\nclass RuntimeHistogramElement : public HistogramElement {\n public:\n RuntimeHistogramElement(const char* name);\n};\n\n#define TRACE_CALL(result_type, header) \\\n InterfaceSupport::_number_of_calls++; \\\n if (CountRuntimeCalls) { \\\n static RuntimeHistogramElement* e = new RuntimeHistogramElement(#header); \\\n if (e != NULL) e->increment_count(); \\\n }\n#else\n#define TRACE_CALL(result_type, header) \\\n /* do nothing */\n#endif\n\n\n// LEAF routines do not lock, GC or throw exceptions\n\n#define VM_LEAF_BASE(result_type, header) \\\n TRACE_CALL(result_type, header) \\\n debug_only(NoHandleMark __hm;) \\\n os::verify_stack_alignment(); \\\n /* begin of body */\n\n#define VM_ENTRY_BASE_FROM_LEAF(result_type, header, thread) \\\n TRACE_CALL(result_type, header) \\\n debug_only(ResetNoHandleMark __rnhm;) \\\n HandleMarkCleaner __hm(thread); \\\n Thread* THREAD = thread; \\\n os::verify_stack_alignment(); \\\n /* begin of body */\n\n\n// ENTRY routines may lock, GC and throw exceptions\n\n#define VM_ENTRY_BASE(result_type, header, thread) \\\n TRACE_CALL(result_type, header) \\\n HandleMarkCleaner __hm(thread); \\\n Thread* THREAD = thread; \\\n os::verify_stack_alignment(); \\\n /* begin of body */\n\n\n// QUICK_ENTRY routines behave like ENTRY but without a handle mark\n\n#define VM_QUICK_ENTRY_BASE(result_type, header, thread) \\\n TRACE_CALL(result_type, header) \\\n debug_only(NoHandleMark __hm;) \\\n Thread* THREAD = thread; \\\n os::verify_stack_alignment(); \\\n /* begin of body */\n\n\n// Definitions for IRT (Interpreter Runtime)\n// (thread is an argument passed in to all these routines)\n\n#define IRT_ENTRY(result_type, header) \\\n result_type header { \\\n ThreadInVMfromJava __tiv(thread); \\\n VM_ENTRY_BASE(result_type, header, thread) \\\n debug_only(VMEntryWrapper __vew;)\n\n\n#define IRT_LEAF(result_type, header) \\\n result_type header { \\\n VM_LEAF_BASE(result_type, header) \\\n debug_only(NoSafepointVerifier __nspv(true);)\n\n\n#define IRT_ENTRY_NO_ASYNC(result_type, header) \\\n result_type header { \\\n ThreadInVMfromJavaNoAsyncException __tiv(thread); \\\n VM_ENTRY_BASE(result_type, header, thread) \\\n debug_only(VMEntryWrapper __vew;)\n\n#define IRT_END }\n\n#define JRT_ENTRY(result_type, header) \\\n result_type header { \\\n ThreadInVMfromJava __tiv(thread); \\\n VM_ENTRY_BASE(result_type, header, thread) \\\n debug_only(VMEntryWrapper __vew;)\n\n\n#define JRT_LEAF(result_type, header) \\\n result_type header { \\\n VM_LEAF_BASE(result_type, header) \\\n debug_only(JRTLeafVerifier __jlv;)\n\n\n#define JRT_ENTRY_NO_ASYNC(result_type, header) \\\n result_type header { \\\n ThreadInVMfromJavaNoAsyncException __tiv(thread); \\\n VM_ENTRY_BASE(result_type, header, thread) \\\n debug_only(VMEntryWrapper __vew;)\n\n// Same as JRT Entry but allows for return value after the safepoint\n// to get back into Java from the VM\n#define JRT_BLOCK_ENTRY(result_type, header) \\\n result_type header { \\\n TRACE_CALL(result_type, header) \\\n HandleMarkCleaner __hm(thread);\n\n#define JRT_BLOCK \\\n { \\\n ThreadInVMfromJava __tiv(thread); \\\n Thread* THREAD = thread; \\\n debug_only(VMEntryWrapper __vew;)\n\n#define JRT_BLOCK_NO_ASYNC \\\n { \\\n ThreadInVMfromJavaNoAsyncException __tiv(thread); \\\n Thread* THREAD = thread; \\\n debug_only(VMEntryWrapper __vew;)\n\n#define JRT_BLOCK_END }\n\n#define JRT_END }\n\n// Definitions for JNI\n\n#define JNI_ENTRY(result_type, header) \\\n JNI_ENTRY_NO_PRESERVE(result_type, header) \\\n WeakPreserveExceptionMark __wem(thread);\n\n#define JNI_ENTRY_NO_PRESERVE(result_type, header) \\\nextern \"C\" { \\\n result_type JNICALL header { \\\n JavaThread* thread=JavaThread::thread_from_jni_environment(env); \\\n assert( !VerifyJNIEnvThread || (thread == Thread::current()), \"JNIEnv is only valid in same thread\"); \\\n ThreadInVMfromNative __tiv(thread); \\\n debug_only(VMNativeEntryWrapper __vew;) \\\n VM_ENTRY_BASE(result_type, header, thread)\n\n\n// Ensure that the VMNativeEntryWrapper constructor, which can cause\n// a GC, is called outside the NoHandleMark (set via VM_QUICK_ENTRY_BASE).\n#define JNI_QUICK_ENTRY(result_type, header) \\\nextern \"C\" { \\\n result_type JNICALL header { \\\n JavaThread* thread=JavaThread::thread_from_jni_environment(env); \\\n assert( !VerifyJNIEnvThread || (thread == Thread::current()), \"JNIEnv is only valid in same thread\"); \\\n ThreadInVMfromNative __tiv(thread); \\\n debug_only(VMNativeEntryWrapper __vew;) \\\n VM_QUICK_ENTRY_BASE(result_type, header, thread)\n\n\n#define JNI_LEAF(result_type, header) \\\nextern \"C\" { \\\n result_type JNICALL header { \\\n JavaThread* thread=JavaThread::thread_from_jni_environment(env); \\\n assert( !VerifyJNIEnvThread || (thread == Thread::current()), \"JNIEnv is only valid in same thread\"); \\\n VM_LEAF_BASE(result_type, header)\n\n\n// Close the routine and the extern \"C\"\n#define JNI_END } }\n\n\n\n// Definitions for JVM\n\n#define JVM_ENTRY(result_type, header) \\\nextern \"C\" { \\\n result_type JNICALL header { \\\n JavaThread* thread=JavaThread::thread_from_jni_environment(env); \\\n ThreadInVMfromNative __tiv(thread); \\\n debug_only(VMNativeEntryWrapper __vew;) \\\n VM_ENTRY_BASE(result_type, header, thread)\n\n\n#define JVM_ENTRY_NO_ENV(result_type, header) \\\nextern \"C\" { \\\n result_type JNICALL header { \\\n JavaThread* thread = JavaThread::current(); \\\n ThreadInVMfromNative __tiv(thread); \\\n debug_only(VMNativeEntryWrapper __vew;) \\\n VM_ENTRY_BASE(result_type, header, thread)\n\n\n#define JVM_QUICK_ENTRY(result_type, header) \\\nextern \"C\" { \\\n result_type JNICALL header { \\\n JavaThread* thread=JavaThread::thread_from_jni_environment(env); \\\n ThreadInVMfromNative __tiv(thread); \\\n debug_only(VMNativeEntryWrapper __vew;) \\\n VM_QUICK_ENTRY_BASE(result_type, header, thread)\n\n\n#define JVM_LEAF(result_type, header) \\\nextern \"C\" { \\\n result_type JNICALL header { \\\n VM_Exit::block_if_vm_exited(); \\\n VM_LEAF_BASE(result_type, header)\n\n\n#define JVM_ENTRY_FROM_LEAF(env, result_type, header) \\\n { { \\\n JavaThread* thread=JavaThread::thread_from_jni_environment(env); \\\n ThreadInVMfromNative __tiv(thread); \\\n debug_only(VMNativeEntryWrapper __vew;) \\\n VM_ENTRY_BASE_FROM_LEAF(result_type, header, thread)\n\n\n#define JVM_END } }\n\n#endif // SHARE_VM_RUNTIME_INTERFACESUPPORT_INLINE_HPP\n"} +{"text": "#\tSteps file for the RSLP stemmer.\n\n# Step 1: Plural Reduction\n{ \"Plural\", 3, 1, {\"s\"}, \n # bons -> bon\n {\"ns\",1,\"n\",{\"luns\",\"furatapóns\",\"furatapons\"}},\n # xamós -> xamón\n {\"ós\",3,\"ón\"},\n # balões -> balón\n {\"ões\",3,\"ón\"},\n # capitães -> capitão\n {\"ães\",1,\"ão\",{\"mães\",\"magalhães\"}},\n # normais -> normal\n {\"ais\",2,\"al\",{\"cais\",\"tais\",\"mais\",\"pais\",\"ademais\"}},\n {\"áis\",2,\"al\",{\"cáis\",\"táis\", \"máis\", \"páis\", \"ademáis\"}},\n # papéis -> papel\n {\"éis\",2,\"el\"},\n # posíbeis -> posíbel\n {\"eis\",2,\"el\"},\n # espanhóis -> espanhol\n {\"óis\",2,\"ol\",{\"escornabóis\"}},\n # caracois -> caracol\n {\"ois\",2,\"ol\",{\"escornabois\"}},\n # cadrís -> cadril\n {\"ís\",2,\"il\",{\"país\"}},\n # cadris -> cadril\n {\"is\",2,\"il\",{\"menfis\",\"pais\",\"kinguis\"}},\n # males -> mal\n {\"les\",2,\"l\",{\"ingles\",\"marselles\",\"montreales\",\"senegales\",\"manizales\",\"móstoles\",\"nápoles\"}},\n # mares -> mar\n {\"res\",3,\"r\",{\"petres\",\"henares\",\"cáceres\",\"baleares\",\"linares\",\"londres\",\"mieres\",\"miraflores\",\"mércores\",\"venres\", \"pires\"}},\n # luces -> luz\n {\"ces\",2,\"z\"},\n # luzes -> luz\n {\"zes\",2,\"z\"},\n # leises -> lei\n {\"ises\",3,\"z\"},\n # animás -> animal\n {\"ás\",1,\"al\",{\"más\"}},\n # gases -> gas\n {\"ses\",2,\"s\"},\n # casas -> casa\n {\"s\",2,\"\",{\"barbadés\",\"barcelonés\",\"cantonés\",\"gabonés\",\"llanés\",\"medinés\",\"escocés\",\"escocês\",\"francês\",\"barcelonês\",\"cantonês\",\"macramés\",\"reves\",\"barcelones\",\"cantones\",\"gabones\",\"llanes\",\"magallanes\",\"medines\",\"escoces\",\"frances\",\"xoves\",\"martes\",\"aliás\",\"pires\",\"lápis\",\"cais\",\"mais\",\"mas\",\"menos\",\"férias\",\"pêsames\",\"crúcis\",\"país\",\"cangas\",\"atenas\",\"asturias\",\"canarias\",\"filipinas\",\"honduras\",\"molucas\",\"caldas\",\"mascareñas\",\"micenas\",\"covarrubias\",\"psoas\",\"óculos\",\"nupcias\",\"xoves\",\"martes\",\"llanes\"}}};\n\n{ \"Unification\", 0, 0, {},\n # cansadísimo -> cansadísimo\n {\"íssimo\",5,\"ísimo\"},\n # cansadísima -> cansadísima\n {\"íssima\",5,\"ísima\"},\n # homaço -> homazo\n {\"aço\",4,\"azo\"},\n # mulheraça -> mulheraza\n {\"aça\",4,\"aza\"},\n # xentuça -> xentuza\n {\"uça\",4,\"uza\"},\n # manilhar -> manillar\n {\"lhar\",2,\"llar\"},\n # colher -> coller\n {\"lher\",2,\"ller\"},\n # melhor -> mellor\n {\"lhor\",2,\"llor\"},\n # alho -> allo\n {\"lho\",1,\"llo\"},\n # linhar -> liñar\n {\"nhar\",2,\"ñar\"},\n # penhor -> peñor\n {\"nhor\",2,\"ñor\"},\n # anho -> año\n {\"nho\",1,\"ño\"},\n # cunha -> cuña\n {\"nha\",1,\"ña\"},\n # hospitalário -> hospitalario\n {\"ário\",3,\"ario\"},\n # bibliotecária -> bibliotecaria\n {\"ária\",3,\"aria\"},\n # agradable -> agradábel\n {\"able\",2,\"ábel\"},\n # agradávele -> agradábel\n {\"ável\",2,\"ábel\"},\n # imposible -> imposíbel\n {\"ible\",2,\"íbel\"},\n # imposível -> imposíbel\n {\"ível\",2,\"íbel\"},\n # imposiçom -> imposición\n {\"çom\",2,\"ción\"},\n # garagem -> garaxe\n {\"agem\",2,\"axe\"},\n # garage -> garaxe\n {\"age\",2,\"axe\"},\n # impressão -> impressón\n {\"ão\",3,\"ón\"},\n # irmao -> irmán\n {\"ao\",1,\"án\"},\n # irmau -> irmán\n {\"au\",1,\"án\"},\n # garrafom -> garrafón\n {\"om\",3,\"ón\"},\n # cantem -> canten\n {\"m\",2,\"n\"}};\n\n{ \"Adverb\", 0, 0, {},\n # felizmente -> feliz\n {\"mente\",4,\"\",{\"experimente\",\"vehemente\",\"sedimente\"}}};\n\n{ \"Augmentative\", 0, 1, {},\n # cansadísimo -> cansad\n {\"dísimo\",5},\n # cansadísima -> cansad\n {\"dísima\",5},\n # amabilísimo -> ama\n {\"bilísimo\",3},\n # amabilísima -> ama\n {\"bilísima\",3},\n # fortísimo -> fort\n {\"ísimo\",3},\n # fortísima -> fort\n {\"ísima\",3},\n # centésimo -> cent\n {\"ésimo\",3},\n # centésima -> cent\n {\"ésima\",3},\n # paupérrimo -> paup\n {\"érrimo\",4},\n # paupérrima -> paup\n {\"érrima\",4},\n # charlatana -> charlat\n {\"ana\",2,\"\",{\"argana\",\"banana\",\"choupana\",\"espadana\",\"faciana\",\"iguana\",\"lantana\",\"macana\",\"membrana\",\"mesana\",\"nirvana\",\"obsidiana\",\"palangana\",\"pavana\",\"persiana\",\"pestana\",\"porcelana\",\"pseudomembrana\",\"roldana\",\"sábana\",\"salangana\",\"saragana\",\"ventana\"}},\n # charlatán -> charlat\n {\"án\",3,\"\",{\"ademán\",\"bardán\",\"barregán\",\"corricán\",\"curricán\",\"faisán\",\"furacán\",\"fustán\",\"gabán\",\"gabián\",\"galán\",\"gañán\",\"lavacán\",\"mazán\",\"mourán\",\"rabadán\",\"serán\",\"serrán\",\"tabán\",\"titán\",\"tobogán\",\"verán\",\"volcán\",\"volován\"}},\n # homazo -> hom\n {\"azo\",4,\"\",{\"abrazo\",\"espazo\",\"andazo\",\"bagazo\",\"balazo\",\"bandazo\",\"cachazo\",\"carazo\",\"denazo\",\"engazo\",\"famazo\",\"lampreazo\",\"pantocazo\",\"pedazo\",\"preñazo\",\"regazo\",\"ribazo\",\"sobrazo\",\"terrazo\",\"trompazo\"}},\n # mulleraza -> muller\n {\"aza\",3,\"\",{\"alcarraza\",\"ameaza\",\"baraza\",\"broucaza\",\"burgaza\",\"cabaza\",\"cachaza\",\"calaza\",\"carpaza\",\"carraza\",\"coiraza\",\"colmaza\",\"fogaza\",\"famaza\",\"labaza\",\"liñaza\",\"melaza\",\"mordaza\",\"paraza\",\"pinaza\",\"rabaza\",\"rapaza\",\"trancaza\"}},\n # cascallo -> casc\n {\"allo\",4,\"\",{\"traballo\"}},\n # xentalla -> xent\n {\"alla\",4},\n # bocarra -> boc\n {\"arra\",3,\"\",{\"cigarra\",\"cinzarra\"}},\n # medicastro -> medic\n {\"astro\",3,\"\",{\"balastro\",\"bimbastro\",\"canastro\",\"retropilastro\"}},\n # poetastra -> poet\n {\"astra\",3,\"\",{\"banastra\",\"canastra\",\"contrapilastra\",\"piastra\",\"pilastra\"}},\n # corpázio -> corp\n {\"ázio\",3,\"\",{\"topázio\"}},\n # soutelo -> sout\n {\"elo\",4,\"\",{\"bacelo\",\"barrelo\",\"bicarelo\",\"biquelo\",\"boquelo\",\"botelo\",\"bouquelo\",\"cacarelo\",\"cachelo\",\"cadrelo\",\"campelo\",\"candelo\",\"cantelo\",\"carabelo\",\"carambelo\",\"caramelo\",\"cercelo\",\"cerebelo\",\"chocarelo\",\"coitelo\",\"conchelo\",\"corbelo\",\"cotobelo\",\"couselo\",\"destelo\",\"desvelo\",\"esfácelo\",\"fandelo\",\"fardelo\",\"farelo\",\"farnelo\",\"flabelo\",\"ganchelo\",\"garfelo\",\"involucelo\",\"mantelo\",\"montelo\",\"outerelo\",\"padicelo\",\"pesadelo\",\"pinguelo\",\"piquelo\",\"rampelo\",\"rastrelo\",\"restelo\",\"tornecelo\",\"trabelo\",\"restrelo\",\"portelo\",\"ourelo\",\"zarapelo\"}},\n # avioneta -> avion\n {\"eta\",3,\"\",{\"arqueta\",\"atleta\",\"avoceta\",\"baioneta\",\"baldeta\",\"banqueta\",\"barraganeta\",\"barreta\",\"borleta\",\"buceta\",\"caceta\",\"calceta\",\"caldeta\",\"cambeta\",\"canaleta\",\"caneta\",\"carreta\",\"cerceta\",\"chaparreta\",\"chapeta\",\"chareta\",\"chincheta\",\"colcheta\",\"cometa\",\"corbeta\",\"corveta\",\"cuneta\",\"desteta\",\"espeta\",\"espoleta\",\"estafeta\",\"esteta\",\"faceta\",\"falanxeta\",\"frasqueta\",\"gaceta\",\"gabeta\",\"galleta\",\"garabeta\",\"gaveta\",\"glorieta\",\"lagareta\",\"lambeta\",\"lanceta\",\"libreta\",\"maceta\",\"macheta\",\"maleta\",\"malleta\",\"mareta\",\"marreta\",\"meseta\",\"mofeta\",\"muleta\",\"peseta\",\"planeta\",\"raqueta\",\"regreta\",\"saqueta\",\"veleta\",\"vendeta\",\"viñeta\"}},\n # guapete -> guap\n {\"ete\",3,\"\",{\"alfinete\",\"ariete\",\"bacinete\",\"banquete\",\"barallete\",\"barrete\",\"billete\",\"binguelete\",\"birrete\",\"bonete\",\"bosquete\",\"bufete\",\"burlete\",\"cabalete\",\"cacahuete\",\"cavinete\",\"capacete\",\"carrete\",\"casarete\",\"casete\",\"chupete\",\"clarinete\",\"colchete\",\"colete\",\"capete\",\"curupete\",\"disquete\",\"estilete\",\"falsete\",\"ferrete\",\"filete\",\"gallardete\",\"gobelete\",\"inglete\",\"machete\",\"miquelete\",\"molete\",\"mosquete\",\"piquete\",\"ribete\",\"rodete\",\"rolete\",\"roquete\",\"sorvete\",\"vedete\",\"vendete\"}},\n # práctica -> práct\n {\"ica\",3,\"\",{\"andarica\",\"botánica\",\"botica\",\"dialéctica\",\"dinámica\",\"física\",\"formica\",\"gráfica\",\"marica\",\"túnica\"}},\n # práctico -> práct\n {\"ico\",3,\"\",{\"conico\",\"acetifico\",\"acidifico\"}},\n # trapexo -> trap\n {\"exo\",3,\"\",{\"arpexo\",\"arquexo\",\"asexo\",\"axexo\",\"azulexo\",\"badexo\",\"bafexo\",\"bocexo\",\"bosquexo\",\"boubexo\",\"cacarexo\",\"carrexo\",\"cascarexo\",\"castrexo\",\"convexo\",\"cotexo\",\"desexo\",\"despexo\",\"forcexo\",\"gabexo\",\"gargarexo\",\"gorgolexo\",\"inconexo\",\"manexo\",\"merexo\",\"narnexo\",\"padexo\",\"patexo\",\"sopexo\",\"varexo\"}},\n {\"exa\",3,\"\",{\"airexa\",\"bandexa\",\"carrexa\",\"envexa\",\"igrexa\",\"larexa\",\"patexa\",\"presexa\",\"sobexa\"}},\n # multidão -> mult\n {\"idão\",3},\n # pequeniño -> pequeno\n {\"iño\",3,\"o\",{\"camiño\",\"cariño\",\"comiño\",\"golfiño\",\"padriño\",\"sobriño\",\"viciño\",\"veciño\"}},\n # pequeniña -> pequena\n {\"iña\",3,\"a\",{\"camariña\",\"campiña\",\"entreliña\",\"espiña\",\"fariña\",\"moriña\",\"valiña\"}},\n # grandito -> grand\n {\"ito\",3,\"\"},\n # grandita -> grand\n {\"ita\",3,\"\"},\n # anomaloide -> animal\n {\"oide\",3,\"\",{\"anaroide\",\"aneroide\",\"asteroide\",\"axoide\",\"cardioide\",\"celuloide\",\"coronoide\",\"discoide\",\"espermatozoide\",\"espiroide\",\"esquizoide\",\"esteroide\",\"glenoide\",\"linfoide\",\"hemorroide\",\"melaloide\",\"sacaroide\",\"tetraploide\",\"varioloide\"}},\n # cazola -> caz\n {\"ola\",3,\"\",{\"aixola\",\"ampola\",\"argola\",\"arola\",\"arteríola\",\"bandola\",\"bítola\",\"bractéola\",\"cachola\",\"carambola\",\"carapola\",\"carola\",\"carrandiola\",\"catrapola\",\"cebola\",\"centola\",\"champola\",\"chatola\",\"cirola\",\"cítola\",\"consola\",\"corola\",\"empola\",\"escarola\",\"esmola\",\"estola\",\"fitola\",\"florícola\",\"garañola\",\"gárgola\",\"garxola\",\"glicocola\",\"góndola\",\"mariola\",\"marola\",\"michola\",\"pirola\",\"rebola\",\"rupícola\",\"saxícola\",\"sémola\",\"tachola\",\"tómbola\"}},\n # pedrolo -> pedr\n {\"olo\",3,\"\",{\"arrolo\",\"babiolo\",\"cacharolo\",\"caixarolo\",\"carolo\",\"carramolo\",\"cascarolo\",\"cirolo\",\"codrolo\",\"correolo\",\"cotrolo\",\"desconsolo\",\"rebolo\",\"repolo\",\"subsolo\",\"tixolo\",\"tómbolo\",\"torolo\",\"trémolo\",\"vacúolo\",\"xermolo\",\"zócolo\"}},\n # vellote -> vell\n {\"ote\",3,\"\",{\"aigote\",\"alcaiote\",\"barbarote\",\"balote\",\"billote\",\"cachote\",\"camarote\",\"capote\",\"cebote\",\"chichote\",\"citote\",\"cocorote\",\"escote\",\"gañote\",\"garrote\",\"gavote\",\"lamote\",\"lapote\",\"larapote\",\"lingote\",\"lítote\",\"magote\",\"marrote\",\"matalote\",\"pandote\",\"paparote\",\"rebote\",\"tagarote\",\"zarrote\"}},\n # mozota -> moz\n {\"ota\",3,\"\",{\"asíntota\",\"caiota\",\"cambota\",\"chacota\",\"compota\",\"creosota\",\"curota\",\"derrota\",\"díspota\",\"gamota\",\"maniota\",\"pelota\",\"picota\",\"pillota\",\"pixota\",\"queirota\",\"remota\"}},\n # gordocho -> gord\n {\"cho\",3,\"\",{\"abrocho\",\"arrocho\",\"carocho\",\"falucho\",\"bombacho\",\"borracho\",\"mostacho\"}},\n # gordecha -> gord\n {\"cha\",3,\"\",{\"borracha\",\"carracha\",\"estacha\",\"garnacha\",\"limacha\",\"remolacha\",\"abrocha\"}},\n # baratuco -> barat\n {\"uco\",4,\"\",{\"caduco\",\"estuco\",\"fachuco\",\"malluco\",\"saluco\",\"trabuco\"}},\n # borrachuzo -> borrach\n {\"uzo\",3,\"\",{\"carriñouzo\",\"fachuzo\",\"mañuzo\",\"mestruzo\",\"tapuzo\"}},\n # xentuza -> xent\n {\"uza\",3,\"\",{\"barruza\",\"chamuza\",\"chapuza\",\"charamuza\",\"conduza\",\"deduza\",\"desluza\",\"entreluza\",\"induza\",\"reluza\",\"seduza\",\"traduza\",\"trasluza\"}},\n # babuxa -> bab\n {\"uxa\",3,\"\",{\"caramuxa\",\"carrabouxa\",\"cartuxa\",\"coruxa\",\"curuxa\",\"gaturuxa\",\"maruxa\",\"meruxa\",\"miruxa\",\"moruxa\",\"muruxa\",\"papuxa\",\"rabuxa\",\"trouxa\"}},\n {\"uxo\",3,\"\",{\"caramuxo\",\"carouxo\",\"carrabouxo\",\"curuxo\",\"debuxo\",\"ganduxo\",\"influxo\",\"negouxo\",\"pertuxo\",\"refluxo\"}},\n # grupello -> grup\n {\"ello\",3,\"\",{\"alborello\",\"artello\",\"botello\",\"cachafello\",\"calello\",\"casarello\",\"cazabello\",\"cercello\",\"cocerello\",\"concello\",\"consello\",\"desparello\",\"escaravello\",\"espello\",\"fedello\",\"fervello\",\"gagafello\",\"gorrobello\",\"nortello\",\"pendello\",\"troupello\",\"trebello\"}},\n # pontella -> pont\n {\"ella\",3,\"\",{\"alborella\",\"bertorella\",\"bocatella\",\"botella\",\"calella\",\"cercella\",\"gadella\",\"grosella\",\"lentella\",\"movella\",\"nocella\",\"noitevella\",\"parella\",\"pelella\",\"percebella\",\"segorella\",\"sabella\"}}};\n\n{ \"Noun\", 0, 0, {},\n # lealdade -> leal \n {\"dade\",3,\"\",{\"acridade\",\"calidade\"}},\n # clarificar -> clar\n {\"ificar\",2},\n # brasileiro->brasil\n {\"eiro\",3,\"\",{\"agoireiro\",\"bardalleiro\",\"braseiro\",\"barreiro\",\"canteiro\",\"capoeiro\",\"carneiro\",\"carteiro\",\"cinceiro\",\"faroleiro\",\"mareiro\",\"preguiceiro\",\"quinteiro\",\"raposeiro\",\"retranqueiro\",\"regueiro\",\"sineiro\",\"troleiro\",\"ventureiro\"}},\n # marisqueira -> marisqu\n {\"eira\",3,\"\",{\"cabeleira\",\"canteira\",\"cocheira\",\"folleira\",\"milleira\"}},\n # hospitalario -> hospital\n {\"ario\",3,\"\",{\"armario\",\"calcario\",\"lionario\",\"salario\"}},\n # bibliotecaria -> bibliotec\n {\"aria\",3,\"\",{\"cetaria\",\"coronaria\",\"fumaria\",\"linaria\",\"lunaria\",\"parietaria\",\"saponaria\",\"serpentaria\"}},\n # humorístico -> humor\n {\"ístico\",3,\"\",{\"balístico\", \"ensaístico\"}},\n # castrista -> castr\n {\"ista\",3,\"\",{\"batista\",\"ciclista\",\"fadista\",\"operista\",\"tenista\",\"verista\"}},\n # lavado -> lav\n {\"ado\",2,\"\",{\"grado\",\"agrado\"}},\n # decanato -> decan\n {\"ato\",2,\"\",{\"agnato\"}},\n # xemido -> xem\n {\"ido\",3,\"\",{\"cándido\",\"cândido\",\"consolido\",\"decidido\",\"duvido\",\"marido\",\"rápido\"}},\n # mantida -> mant\n {\"ida\",3,\"\",{\"bastida\",\"dúbida\",\"dubida\",\"duvida\",\"ermida\",\"éxida\",\"guarida\",\"lapicida\",\"medida\",\"morida\"}},\n {\"ída\",3},\n # mantído -> mant\n {\"ido\",3},\n # orelludo -> orell\n {\"udo\",3,\"\",{\"estudo\",\"escudo\"}},\n # orelluda -> orell\n {\"uda\",3},\n {\"ada\",3,\"\",{\"abada\",\"alhada\",\"allada\",\"pitada\"}},\n # comedela -> come\n {\"dela\",3,\"\",{\"cambadela\",\"cavadela\",\"forcadela\",\"erisipidela\",\"mortadela\",\"espadela\",\"fondedela\",\"picadela\",\"arandela\",\"candela\",\"cordela\",\"escudela\",\"pardela\"}},\n # fontela -> font\n {\"ela\",3,\"\",{\"canela\",\"capela\",\"cotela\",\"cubela\",\"curupela\",\"escarapela\",\"esparrela\",\"estela\",\"fardela\",\"flanela\",\"fornela\",\"franela\",\"gabela\",\"gamela\",\"gavela\",\"glumela\",\"granicela\",\"lamela\",\"lapela\",\"malvela\",\"manela\",\"manganela\",\"mexarela\",\"micela\",\"mistela\",\"novela\",\"ourela\",\"panela\",\"parcela\",\"pasarela\",\"patamela\",\"patela\",\"paxarela\",\"pipela\",\"pitela\",\"postela\",\"pubela\",\"restela\",\"sabela\",\"salmonela\",\"secuela\",\"sentinela\",\"soldanela\",\"subela\",\"temoncela\",\"tesela\",\"tixela\",\"tramela\",\"trapela\",\"varela\",\"vitela\",\"xanela\",\"xestela\"}},\n # agradábel -> agrad\n {\"ábel\",2,\"\",{\"afábel\",\"fiábel\"}},\n # combustíbel -> combust\n {\"íbel\",2,\"\",{\"críbel\",\"imposíbel\",\"posíbel\",\"fisíbel\",\"falíbel\"}},\n # fabricante -> frabrica\n {\"nte\",3,\"\",{\"alimente\",\"adiante\",\"acrescente\",\"elefante\",\"frequente\",\"freqüente\",\"gigante\",\"instante\",\"oriente\",\"permanente\",\"posante\",\"possante\",\"restaurante\"}},\n # ignorancia -> ignora\n {\"ncia\",3},\n # temperanza -> tempera\n {\"nza\",3},\n {\"acia\",3,\"\",{\"acracia\",\"audacia\",\"falacia\",\"farmacia\"}},\n # inmundicia -> inmund\n {\"icia\",3,\"\",{\"caricia\",\"delicia\",\"ledicia\",\"malicia\",\"milicia\",\"noticia\",\"pericia\",\"presbicia\",\"primicia\",\"regalicia\",\"sevicia\",\"tiricia\"}},\n # xustiza -> xust\n {\"iza\",3,\"\",{\"alvariza\",\"baliza\",\"cachiza\",\"caniza\",\"cañiza\",\"carbaliza\",\"carriza\",\"chamariza\",\"chapiza\",\"fraguiza\",\"latiza\",\"longaniza\",\"mañiza\",\"nabiza\",\"peliza\",\"preguiza\",\"rabiza\"}},\n # clarexar -> clar\n {\"exar\",3,\"\",{\"palmexar\"}},\n # administración -> administr\n {\"ación\",2,\"\",{\"aeración\"}},\n # expedición -> exped\n {\"ición\",3,\"\",{\"condición\",\"gornición\",\"monición\",\"nutrición\",\"petición\",\"posición\",\"sedición\",\"volición\"}},\n # excepción -> except\n {\"ción\",3,\"t\"},\n # comprensión -> comprens\n {\"sión\",3,\"s\",{\"abrasión\", \"alusión\"}},\n # doazón -> do\n {\"azón\",2,\"\",{\"armazón\"}},\n # garrafón -> garraf\n {\"ón\",3,\"\",{\"abalón\",\"acordeón\",\"alción\",\"aldrabón\",\"alerón\",\"aliñón\",\"ambón\",\"bombón\",\"calzón\",\"campón\",\"canalón\",\"cantón\",\"capitón\",\"cañón\",\"centón\",\"ciclón\",\"collón\",\"colofón\",\"copón\",\"cotón\",\"cupón\",\"petón\",\"tirón\",\"tourón\",\"turón\",\"unción\",\"versión\",\"zubón\",\"zurrón\"}},\n # lambona -> lamb\n {\"ona\",3,\"\",{\"abandona\",\"acetona\",\"aleurona\",\"amazona\",\"anémona\",\"bombona\",\"cambona\",\"carona\",\"chacona\",\"charamona\",\"cincona\",\"condona\",\"cortisona\",\"cretona\",\"cretona\",\"detona\",\"estona\",\"fitohormona\",\"fregona\",\"gerona\",\"hidroquinona\",\"hormona\",\"lesiona\",\"madona\",\"maratona\",\"matrona\",\"metadona\",\"monótona\",\"neurona\",\"pamplona\",\"peptona\",\"poltrona\",\"proxesterona\",\"quinona\",\"quinona\",\"silicona\",\"sulfona\"}},\n # bretoa -> bretón\n {\"oa\",3,\"\",{\"abandoa\",\"madroa\",\"barbacoa\",\"estoa\",\"airoa\",\"eiroa\",\"amalloa\",\"ámboa\",\"améndoa\",\"anchoa\",\"antinéboa\",\"avéntoa\",\"avoa\",\"bágoa\",\"balboa\",\"bisavoa\",\"boroa\",\"canoa\",\"caroa\",\"comadroa\",\"coroa\",\"éngoa\",\"espácoa\",\"filloa\",\"fírgoa\",\"grañoa\",\"lagoa\",\"lanzoa\",\"magoa\",\"mámoa\",\"morzoa\",\"noiteboa\",\"noraboa\",\"parañoa\",\"persoa\",\"queiroa\",\"rañoa\",\"táboa\",\"tataravoa\",\"teiroa\"}},\n # demoníaco -> demoní\n {\"aco\",3},\n # demoníaca -> demoní\n {\"aca\",3,\"\",{\"alpaca\",\"barraca\",\"bullaca\",\"buraca\",\"carraca\",\"casaca\",\"cavaca\",\"cloaca\",\"entresaca\",\"ervellaca\",\"espinaca\",\"estaca\",\"farraca\",\"millaca\",\"pastinaca\",\"pataca\",\"resaca\",\"urraca\",\"purraca\"}},\n # carballal -> carball\n {\"al\",4,\"\",{\"afinal\",\"animal\",\"estatal\",\"bisexual\",\"bissexual\",\"desleal\",\"fiscal\",\"formal\",\"pessoal\",\"persoal\",\"liberal\",\"postal\",\"virtual\",\"visual\",\"pontual\",\"puntual\",\"homosexual\",\"heterosexual\"}},\n # nadador -> nada\n {\"dor\",2,\"\",{\"abaixador\"}},\n # benfeitor -> benfei\n {\"tor\",3,\"\",{\"autor\",\"motor\",\"pastor\",\"pintor\"}},\n # produtor -> produt\n {\"or\",2,\"\",{\"asesor\",\"assessor\",\"favor\",\"mellor\",\"melhor\",\"redor\",\"rigor\",\"sensor\",\"tambor\",\"tumor\"}},\n # profesora -> profes\n {\"ora\",3,\"\",{\"albacora\",\"anáfora\",\"áncora\",\"apisoadora\",\"ardora\",\"ascospora\",\"aurora\",\"avéspora\",\"bitácora\",\"canéfora\",\"cantimplora\",\"catáfora\",\"cepilladora\",\"demora\",\"descalcificadora\",\"diáspora\",\"empacadora\",\"epífora\",\"ecavadora\",\"escora\",\"eslora\",\"espora\",\"fotocompoñedora\",\"fotocopiadora\",\"grampadora\",\"isícora\",\"lavadora\",\"lixadora\",\"macrospora\",\"madrépora\",\"madrágora\",\"masora\",\"mellora\",\"metáfora\",\"microspora\",\"milépora\",\"milpéndora\",\"nécora\",\"oospora\",\"padeadora\",\"pasiflora\",\"pécora\",\"píldora\",\"pólvora\",\"ratinadora\",\"rémora\",\"retroescavadora\",\"sófora\",\"torradora\",\"trémbora\",\"uredospora\",\"víbora\",\"víncora\",\"zoospora\"}},\n # zapataría -> zapat\n {\"aría\",3,\"\",{\"libraría\"}},\n # etiquetaxe -> etiquet\n {\"axe\",3,\"\",{\"aluaxe\",\"amaraxe\",\"amperaxe\",\"bagaxe\",\"balaxe\",\"barcaxe\",\"borraxe\",\"bescaxe\",\"cabotaxe\",\"carraxe\",\"cartilaxe\",\"chantaxe\",\"colaxe\",\"coraxe\",\"carruaxe\",\"dragaxe\",\"embalaxe\",\"ensilaxe\",\"epistaxe\",\"fagundaxe\",\"fichaxe\",\"fogaxe\",\"forraxe\",\"fretaxe\",\"friaxe\",\"garaxe\",\"homenaxe\",\"leitaxe\",\"liñaxe\",\"listaxe\",\"maraxe\",\"marcaxe\",\"maridaxe\",\"masaxe\",\"miraxe\",\"montaxe\",\"pasaxe\",\"peaxe\",\"portaxe\",\"ramaxe\",\"rebelaxe\",\"rodaxe\",\"romaxe\",\"sintaxe\",\"sondaxe\",\"tiraxe\",\"vantaxe\",\"vendaxe\",\"viraxe\"}},\n # movedizo -> move\n {\"dizo\",3},\n # limpeza -> limp\n {\"eza\",3,\"\",{\"alteza\",\"beleza\",\"fereza\",\"fineza\",\"vasteza\",\"vileza\"}},\n # rixidez -> rixid\n {\"ez\",3,\"\",{\"acidez\",\"adultez\",\"adustez\",\"avidez\",\"candidez\",\"mudez\",\"nenez\",\"nudez\",\"pomez\"}},\n # mullerengo -> muller\n {\"engo\",3},\n # chairego -> chair\n {\"ego\",3,\"\",{\"corego\",\"derrego\",\"entrego\",\"lamego\",\"sarego\",\"sartego\"}},\n # cariñoso -> cariñ\n {\"oso\",3,\"\",{\"afanoso\",\"algoso\",\"caldoso\",\"caloso\",\"cocoso\",\"ditoso\",\"favoso\",\"fogoso\",\"lamoso\",\"mecoso\",\"mocoso\",\"precioso\",\"rixoso\",\"venoso\",\"viroso\",\"xesoso\"}},\n # cariñosa -> cariñ\n {\"osa\",3,\"\",{\"mucosa\",\"glicosa\",\"baldosa\",\"celulosa\",\"isoglosa\",\"nitrocelulosa\",\"levulosa\",\"ortosa\",\"pectosa\",\"preciosa\",\"sacarosa\",\"serosa\",\"ventosa\"}},\n # negrume -> negr\n {\"ume\",3,\"\",{\"agrume\",\"albume\",\"alcume\",\"batume\",\"cacume\",\"cerrume\",\"chorume\",\"churume\",\"costume\",\"curtume\",\"estrume\",\"gafume\",\"legume\",\"perfume\",\"queixume\",\"zarrume\"}},\n # altura -> alt\n {\"ura\",3,\"\",{\"albura\",\"armadura\",\"imatura\",\"costura\"}},\n # cuspiñar -> cusp\n {\"iñar\",3},\n # febril -> febr\n {\"il\",3,\"\",{\"abril\",\"alfil\",\"anil\",\"atril\",\"badil\",\"baril\",\"barril\",\"brasil\",\"cadril\",\"candil\",\"cantil\",\"carril\",\"chamil\",\"chancil\",\"civil\",\"cubil\",\"dátil\",\"difícil\",\"dócil\",\"edil\",\"estéril\",\"fácil\",\"fráxil\",\"funil\",\"fusil\",\"grácil\",\"gradil\",\"hábil\",\"hostil\",\"marfil\"}},\n # principesco -> princip\n {\"esco\",4},\n # mourisco -> mour\n {\"isco\",4},\n # esportivo -> esport\n {\"ivo\",3,\"\",{\"pasivo\",\"positivo\",\"passivo\",\"possessivo\",\"posesivo\",\"pexotarivo\",\"relativo\"}}};\n\n{ \"Verb\", 0, 0, {},\n # amaba -> am\n {\"aba\",2},\n # andabade -> and\n {\"abade\",2},\n # andábade -> and\n {\"ábade\",2},\n # chorabamo -> chor\n {\"abamo\",2},\n # chorábamo -> chor\n {\"ábamo\",2}, \n # moraban -> morab\n {\"aban\",2},\n # andache -> and\n {\"ache\",2},\n # andade -> and\n {\"ade\",2},\n {\"an\",2}, \n # cantando -> cant\n {\"ando\",2},\n # cantar -> cant\n {\"ar\",2,\"\",{\"azar\",\"bazar\",\"patamar\"}}, \n # lembrarade -> lembra\n {\"arade\",2},\n {\"aramo\",2}, \n {\"arán\",2},\n # cantaran -> cant\n {\"aran\",2},\n # convidárade -> convid\n {\"árade\",2},\n # convidaría -> convid\n {\"aría\",2},\n # cantariade -> cant\n {\"ariade\",2},\n # cantaríade -> cant\n {\"aríade\",2},\n # cantarian -> cant \n {\"arian\",2},\n # cantariamo -> cant\n {\"ariamo\",2},\n # pescaron -> pesc\n {\"aron\",2},\n # cantase -> cant\n {\"ase\",2},\n # cantasede -> cant\n {\"asede\",2},\n # cantásede -> cant\n {\"ásede\",2},\n # cantasemo -> cant\n {\"asemo\",2},\n # cantásemo -> cant\n {\"ásemo\",2},\n # cantasen -> cant\n {\"asen\",2},\n # loitavan -> loitav\n {\"avan\",2},\n # cantaríamo -> cant\n {\"aríamo\",2},\n # cantassen -> cant\n {\"assen\",2},\n # cantássemo -> cant\n {\"ássemo\",2},\n # beberíamo -> beb\n {\"eríamo\",2},\n # bebêssemo -> beb\n {\"êssemo\",2},\n # partiríamo -> part\n {\"iríamo\",3},\n # partíssemo -> part\n {\"íssemo\",3},\n # cantáramo -> cant\n {\"áramo\",2},\n # cantárei -> cant\n {\"árei\",2},\n # cantaren -> cant\n {\"aren\",2},\n # cantaremo -> cant\n {\"aremo\",2},\n # cantaríei -> cant\n {\"aríei\",2},\n {\"ássei\",2},\n # cantávamo-> cant\n {\"ávamo\",2},\n # bebêramo -> beb\n {\"êramo\",1},\n # beberemo -> beb\n {\"eremo\",1},\n # beberíei -> beb\n {\"eríei\",1},\n # bebêssei -> beb\n {\"êssei\",1},\n # partiríamo -> part\n {\"íramo\",3},\n # partiremo -> part\n {\"iremo\",3},\n # partiríei -> part\n {\"iríei\",3},\n # partíssei -> part\n {\"íssei\",3},\n # partissen -> part\n {\"issen\",3},\n # bebendo -> beb\n {\"endo\",1},\n # partindo -> part\n {\"indo\",3},\n # propondo -> prop\n {\"ondo\",3},\n # cantarde -> cant\n {\"arde\",2},\n # cantarei -> cant\n {\"arei\",2},\n # cantaria -> cant\n {\"aria\",2},\n # cantarmo -> cant\n {\"armo\",2},\n # cantasse -> cant\n {\"asse\",2},\n {\"aste\",2},\n # cantávei -> cant\n {\"ávei\",2},\n # perderão -> perd\n {\"erão\",1},\n # beberde -> beb\n {\"erde\",1},\n # beberei -> beb\n {\"erei\",1},\n # bebêrei -> beb\n {\"êrei\",1},\n # beberen -> beb\n {\"eren\",2},\n # beberia -> beb\n {\"eria\",1},\n # bebermo -> beb\n {\"ermo\",1},\n # bebeste -> beb\n {\"este\",1,\"\",{\"faroeste\",\"agreste\"}},\n # bebíamo -> beb\n {\"íamo\",1},\n # fuxian -> fux\n {\"ian\",2,\"\",{\"enfian\",\"eloxian\",\"ensaian\"}},\n # partirde -> part\n {\"irde\",2},\n # partírei -> part\n {\"irei\",3,\"\",{\"admirei\"}},\n # partiren -> part\n {\"iren\",3},\n # partiria -> part\n {\"iria\",3},\n # partirmo -> part\n {\"irmo\",3},\n # partisse -> part\n {\"isse\",3},\n # partiste -> part\n {\"iste\",4},\n {\"iava\",1,\"\",{\"ampliava\"}},\n # cantamo -> cant\n {\"amo\",2},\n # funciona -> func\n {\"iona\",3},\n # cantara -> cant\n {\"ara\",2,\"\",{\"arara\",\"prepara\"}},\n # enviará -> envi\n {\"ará\",2,\"\",{\"alvará\",\"bacará\"}},\n # cantare -> cant\n {\"are\",2,\"\",{\"prepare\"}},\n # cantava -> cant\n {\"ava\",2,\"\",{\"agrava\"}},\n # cantemo -> cant\n {\"emo\",2},\n # bebera -> beb\n {\"era\",1,\"\",{\"acelera\",\"espera\"}},\n # beberá -> beb\n {\"erá\",1},\n # bebere -> beb\n {\"ere\",1,\"\",{\"espere\"}},\n # bebíei -> beb\n {\"íei\",1},\n # metin -> met\n {\"in\",3},\n # partimo -> part\n {\"imo\",3,\"\",{\"reprimo\",\"intimo\",\"íntimo\",\"nimo\",\"queimo\",\"ximo\"}},\n # partira -> part\n {\"ira\",3,\"\",{\"fronteira\",\"sátira\"}},\n {\"ído\",3},\n # partirá -> part\n {\"irá\",3},\n # concretizar -> concret\n {\"tizar\",4,\"\",{\"alfabetizar\"}},\n {\"izar\",3,\"\",{\"organizar\"}},\n # saltitar -> salt\n {\"itar\",5,\"\",{\"acreditar\",\"explicitar\",\"estreitar\"}},\n # partire -> part\n {\"ire\",3,\"\",{\"adquire\"}},\n # compomo -> comp\n {\"omo\",3},\n {\"ai\",2},\n # barbear -> barb\n {\"ear\",4,\"\",{\"alardear\",\"nuclear\"}},\n # cheguei -> cheg\n {\"uei\",3},\n {\"uía\",5,\"u\"},\n # cantei -> cant\n {\"ei\",3},\n # beber -> beb\n {\"er\",1,\"\",{\"éter\",\"pier\"}},\n # bebeu -> beb\n {\"eu\",1,\"\",{\"chapeu\"}},\n # bebia -> beb\n {\"ia\",1,\"\",{\"estória\",\"fatia\",\"acia\",\"praia\",\"elogia\",\"mania\",\"lábia\",\"aprecia\",\"polícia\",\"arredia\",\"cheia\",\"ásia\"}},\n # partir -> part\n {\"ir\",3},\n # partiu -> part\n {\"iu\",3},\n # fraqueou -> fraqu\n {\"eou\",5},\n # chegou -> cheg\n {\"ou\",3},\n # bebi -> beb\n {\"i\",1},\n # varrede -> varr\n {\"ede\",1,\"\",{\"rede\",\"bípede\",\"céspede\",\"parede\",\"palmípede\",\"vostede\",\"hóspede\",\"adrede\"}},\n # cantei -> cant\n {\"ei\",3},\n # anden -> and\n {\"en\",2},\n # descerade -> desc\n {\"erade\",1},\n # vivérade -> viv\n {\"érade\",1},\n # beberan -> beb\n {\"eran\",2},\n # colleramo -> coller\n {\"eramo\",1},\n # bebéramo -> beb\n {\"éramo\",1},\n # perderán -> perd\n {\"erán\",1},\n # varrería -> varr\n {\"ería\",1},\n # beberiade -> beb\n {\"eriade\",1},\n # beberíade -> beb\n {\"eríade\",1},\n # beberiamo -> beb\n {\"eriamo\",1},\n # beberian -> beb\n {\"erian\",1},\n # beberían -> beb\n {\"erían\",1},\n # perderon -> perd\n {\"eron\",1},\n # bebese -> beb\n {\"ese\",1},\n # bebesedes -> beb\n {\"esedes\",1},\n # bebésedes -> beb\n {\"ésedes\",1}, \n # bebesemo -> beb\n {\"esemo\",1},\n # bebésemo -> beb\n {\"ésemo\",1},\n # bebesen -> beb\n {\"esen\",1},\n # bebêssede -> beb \n {\"êssede\",1},\n # chovía -> chov\n {\"ía\",1},\n # faciade -> fac\n {\"iade\",1},\n # facíade -> fac\n {\"íade\",1},\n # perdiamo -> perd\n {\"iamo\",1},\n # fuxían -> fux \n {\"ían\",1},\n # corriche -> corr\n {\"iche\",1},\n # partide -> part\n {\"ide\",1},\n # escribirade -> escrib\n {\"irade\",3},\n # parírade -> par\n {\"írade\",3},\n # partiramo -> part\n {\"iramo\",3}, \n # fugirán -> fug\n {\"irán\",3},\n # viviría -> viv\n {\"iría\",3},\n # partiriade -> part\n {\"iriade\",3},\n # partiríade -> part\n {\"iríade\",3},\n # partiriamo -> part\n {\"iriamo\",3}, \n # partirian -> part\n {\"irian\",3},\n # partirían -> part\n {\"irían\",3},\n # reflectiron -> reflect\n {\"iron\",3},\n # partise -> part\n {\"ise\",3},\n # partisede -> part\n {\"isede\",3},\n # partísede -> part\n {\"ísede\",3},\n # partisemo -> part\n {\"isemo\",3},\n # partísemo -> part\n {\"ísemo\",3},\n # partisen -> part\n {\"isen\",3},\n # partíssede -> part\n {\"íssede\",3}, \n {\"tizar\",3,\"\",{\"alfabetizar\"}},\n {\"ondo\",3}};\n\n{ \"Vowel\", 0, 0, {},\n # segue -> seg\n {\"gue\",2,\"g\",{\"azougue\",\"dengue\",\"merengue\",\"nurague\",\"merengue\",\"rengue\"}},\n {\"que\",2,\"c\",{\"alambique\",\"albaricoque\",\"abaroque\",\"alcrique\",\"almadraque\",\"almanaque\",\"arenque\",\"arinque\",\"baduloque\",\"ballestrinque\",\"betoque\",\"bivaque\",\"bloque\",\"bodaque\",\"bosque\",\"breque\",\"buque\",\"cacique\",\"cheque\",\"claque\",\"contradique\",\"coque\",\"croque\",\"dique\",\"duque\",\"enroque\",\"espeque\",\"estoque\",\"estoraque\",\"estraloque\",\"estrinque\",\"milicroque\",\"monicreque\",\"orinque\",\"arinque\",\"palenque\",\"parque\",\"penique\",\"picabeque\",\"pique\",\"psique\",\"raque\",\"remolque\",\"xeque\",\"repenique\",\"roque\",\"sotobosque\",\"tabique\",\"tanque\",\"toque\",\"traque\",\"truque\",\"vivaque\",\"xaque\"}},\n {\"a\",3,\"\",{\"amasadela\",\"cerva\"}},\n {\"e\",3,\"\",{\"marte\"}},\n {\"o\",3,\"\",{\"barro\",\"fado\",\"cabo\",\"libro\",\"cervo\"}},\n {\"â\",3},\n {\"ã\",3,\"\",{\"amanhã\",\"arapuã\",\"fã\",\"divã\",\"manhã\"}},\n {\"ê\",3},\n {\"ô\",3},\n {\"á\",3},\n {\"é\",3},\n {\"ó\",3},\n # munxi -> munx\n {\"i\",3}};\n"} +{"text": "module Types\n module ClubPage\n Layout = Types::Strict::Symbol\n .constructor(&:to_sym)\n .enum(:menu, :none)\n end\nend\n"} +{"text": "\n\n\n Api Documentation\n \n \n \n\n\n \n \n \n\n\n
\n
\n
\n \n\n
\n

\n GET /api/audits/:id\n
\n Mostra una auditoria\n

\n
\n\n
\n\n \n\n\n\n

Examples

\n 
GET /api/audits/980190962\n200\n{\n  "user_id": null,\n  "user_type": null,\n  "user_name": null,\n  "version": 1,\n  "comment": null,\n  "associated_id": 272,\n  "associated_type": "Host",\n  "remote_address": null,\n  "associated_name": null,\n  "created_at": "2009-12-14 08:01:17 UTC",\n  "id": 980190962,\n  "auditable_id": 980190962,\n  "auditable_name": null,\n  "auditable_type": "Host",\n  "action": "update",\n  "audited_changes": {\n    "architecture_id": [\n      10463,\n      10466\n    ]\n  },\n  "locations": [],\n  "organizations": []\n}
\n\n

Params

\n \n \n \n \n \n \n \n \n \n \n \n\n \n\n \n \n \n \n\n \n\n \n \n \n \n\n \n\n \n\n \n
Param NameDescription
\n location_id
\n \n Optional\n \n \n 		\n \n

Set the current location context for the request

\n\n

Validations:

\n
    \n
  • \n

    Must be a Integer

    \n
    • \n
\n\n
\n organization_id
\n \n Optional\n \n \n 		\n \n

Set the current organization context for the request

\n\n

Validations:

\n
    \n
  • \n

    Must be a Integer

    \n
    • \n
\n\n
\n id
\n \n Required\n \n \n 		\n \n

Validations:

\n
    \n
  • \n

    Must be an identifier, string from 1 to 128 characters containing only alphanumeric characters, space, underscore(_), hypen(-) with no leading or trailing space.

    \n
    • \n
\n\n
\n\n\n\n\n
\n\n \n\n \n
\n
\n
\n
\n
\n \n\n\n\n\n\n"} +{"text": "\n\n\n\n\n\n"} +{"text": "\n\n\n\n\n\n \n \n \n \n \n 1:\n 1\n procedure Proc(\n \n \n \n \n \n \n \n \n a\n ,\n b\n \n \n \n )\n\n \n 2:\n 2\n      return 7\n\n \n 3:\n 3\n end procedure\n \n \n \n \n Algorithm 1\n 1\n Algorithm 1\n \n 1Euclid’s algorithm\n Algorithm 1 Euclid’s algorithm\n \n \n 1:\n 1\n procedure Euclid(\n \n \n \n \n \n \n \n \n a\n ,\n b\n \n \n \n )\n \n ▷\n \n The g.c.d. of a and b\n\n \n 2:\n 2\n      \n \n \n ←\n r\n \n mod\n a\n b\n \n \n \n \n\n \n 3:\n 3\n      while \n \n \n ≠\n r\n 0\n \n \n  do\n \n ▷\n \n We have the answer if r is 0\n\n \n 4:\n 4\n          \n \n \n ←\n a\n b\n \n \n \n\n \n 5:\n 5\n          \n \n \n ←\n b\n r\n \n \n \n\n \n 6:\n 6\n          \n \n \n ←\n r\n \n mod\n a\n b\n \n \n \n \n\n \n 7:\n 7\n      end while\n\n \n 8:\n 8\n      return \n \n b\n \n \n \n ▷\n \n The gcd is b\n\n \n 9:\n 9\n end procedure\n \n \n\n"} +{"text": "/*\n * Licensed to the Apache Software Foundation (ASF) under one or more\n * contributor license agreements. See the NOTICE file distributed with\n * this work for additional information regarding copyright ownership.\n * The ASF licenses this file to You under the Apache License, Version 2.0\n * (the \"License\"); you may not use this file except in compliance with\n * the License. You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\npackage org.apache.camel.opentracing;\n\nimport io.opentracing.Span;\nimport org.apache.camel.AsyncCallback;\nimport org.apache.camel.Exchange;\nimport org.apache.camel.Expression;\nimport org.apache.camel.Traceable;\nimport org.apache.camel.spi.IdAware;\nimport org.apache.camel.spi.RouteIdAware;\nimport org.apache.camel.support.AsyncProcessorSupport;\nimport org.apache.camel.tracing.ActiveSpanManager;\nimport org.apache.camel.util.ObjectHelper;\nimport org.slf4j.Logger;\nimport org.slf4j.LoggerFactory;\n\n/**\n * A processor which adds a baggage item on the active {@link Span} with an {@link Expression}\n */\npublic class SetBaggageProcessor extends AsyncProcessorSupport implements Traceable, IdAware, RouteIdAware {\n\n private static final Logger LOG = LoggerFactory.getLogger(SetBaggageProcessor.class);\n\n private String id;\n private String routeId;\n private final String baggageName;\n private final Expression expression;\n\n public SetBaggageProcessor(String baggageName, Expression expression) {\n this.baggageName = baggageName;\n this.expression = expression;\n ObjectHelper.notNull(baggageName, \"baggageName\");\n ObjectHelper.notNull(expression, \"expression\");\n }\n\n @Override\n public boolean process(Exchange exchange, AsyncCallback callback) {\n try {\n OpenTracingSpanAdapter camelSpan = (OpenTracingSpanAdapter) ActiveSpanManager.getSpan(exchange);\n Span span = camelSpan.getOpenTracingSpan();\n if (span != null) {\n String item = expression.evaluate(exchange, String.class);\n span.setBaggageItem(baggageName, item);\n } else {\n LOG.warn(\"OpenTracing: could not find managed span for exchange={}\", exchange);\n }\n } catch (Exception e) {\n exchange.setException(e);\n } finally {\n // callback must be invoked\n callback.done(true);\n }\n\n return true;\n }\n\n @Override\n public String toString() {\n return id;\n }\n\n @Override\n public String getTraceLabel() {\n return \"setBaggage[\" + baggageName + \", \" + expression + \"]\";\n }\n\n @Override\n public String getId() {\n return id;\n }\n\n @Override\n public void setId(String id) {\n this.id = id;\n }\n\n @Override\n public String getRouteId() {\n return routeId;\n }\n\n @Override\n public void setRouteId(String routeId) {\n this.routeId = routeId;\n }\n\n public String getBaggageName() {\n return baggageName.toString();\n }\n\n public Expression getExpression() {\n return expression;\n }\n\n @Override\n protected void doStart() throws Exception {\n // noop\n }\n\n @Override\n protected void doStop() throws Exception {\n // noop\n }\n}\n"} +{"text": "/*\n * Copyright (c) 1992 Stanford University\n * Copyright (c) 1992 Silicon Graphics, Inc.\n *\n * Permission to use, copy, modify, distribute, and sell this software and \n * its documentation for any purpose is hereby granted without fee, provided\n * that (i) the above copyright notices and this permission notice appear in\n * all copies of the software and related documentation, and (ii) the names of\n * Stanford and Silicon Graphics may not be used in any advertising or\n * publicity relating to the software without the specific, prior written\n * permission of Stanford and Silicon Graphics.\n * \n * THE SOFTWARE IS PROVIDED \"AS-IS\" AND WITHOUT WARRANTY OF ANY KIND, \n * EXPRESS, IMPLIED OR OTHERWISE, INCLUDING WITHOUT LIMITATION, ANY \n * WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. \n *\n * IN NO EVENT SHALL STANFORD OR SILICON GRAPHICS BE LIABLE FOR\n * ANY SPECIAL, INCIDENTAL, INDIRECT OR CONSEQUENTIAL DAMAGES OF ANY KIND,\n * OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,\n * WHETHER OR NOT ADVISED OF THE POSSIBILITY OF DAMAGE, AND ON ANY THEORY OF \n * LIABILITY, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE \n * OF THIS SOFTWARE.\n */\n\n#ifndef os_types_h\n#define os_types_h\n\n#include \n\n#if !MAC\n#include \n#endif\n\n#endif\n"} +{"text": "/*\nCopyright 2019 The Kubernetes Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\npackage v1alpha2\n\nimport (\n\tctrl \"sigs.k8s.io/controller-runtime\"\n\tlogf \"sigs.k8s.io/controller-runtime/pkg/log\"\n)\n\n// log is for logging in this package.\nvar _ = logf.Log.WithName(\"clusterlist-resource\")\n\nfunc (r *ClusterList) SetupWebhookWithManager(mgr ctrl.Manager) error {\n\treturn ctrl.NewWebhookManagedBy(mgr).\n\t\tFor(r).\n\t\tComplete()\n}\n"} +{"text": "using WorkflowCore.Interface;\nusing WorkflowCore.Persistence.EntityFramework.Services;\nusing WorkflowCore.Persistence.SqlServer;\nusing WorkflowCore.UnitTests;\nusing Xunit;\n\nnamespace WorkflowCore.Tests.SqlServer\n{\n [Collection(\"SqlServer collection\")]\n public class SqlServerPersistenceProviderFixture : BasePersistenceFixture\n {\n private readonly string _connectionString;\n\n public SqlServerPersistenceProviderFixture(SqlDockerSetup setup)\n {\n _connectionString = SqlDockerSetup.ConnectionString;\n }\n\n protected override IPersistenceProvider Subject\n {\n get\n {\n var db = new EntityFrameworkPersistenceProvider(new SqlContextFactory(_connectionString), true, true);\n db.EnsureStoreExists();\n return db;\n }\n }\n }\n}\n"} +{"text": "/*\n * Copyright 2016 Red Hat, Inc. and/or its affiliates\n * and other contributors as indicated by the @author tags.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\npackage org.keycloak.adapters;\n\nimport org.jboss.logging.Logger;\nimport org.keycloak.adapters.spi.AuthOutcome;\nimport org.keycloak.adapters.spi.HttpFacade;\n\n/**\n * @author Christian Froehlich\n * @author Brad Culley\n * @author John D. Ament\n * @version $Revision: 1 $\n */\npublic class QueryParameterTokenRequestAuthenticator extends BearerTokenRequestAuthenticator {\n public static final String ACCESS_TOKEN = \"access_token\";\n protected Logger log = Logger.getLogger(QueryParameterTokenRequestAuthenticator.class);\n\n public QueryParameterTokenRequestAuthenticator(KeycloakDeployment deployment) {\n super(deployment);\n }\n\n public AuthOutcome authenticate(HttpFacade exchange) {\n if(!deployment.isOAuthQueryParameterEnabled()) {\n return AuthOutcome.NOT_ATTEMPTED;\n }\n tokenString = null;\n tokenString = getAccessTokenFromQueryParameter(exchange);\n if (tokenString == null || tokenString.trim().isEmpty()) {\n challenge = challengeResponse(exchange, OIDCAuthenticationError.Reason.NO_QUERY_PARAMETER_ACCESS_TOKEN, null, null);\n return AuthOutcome.NOT_ATTEMPTED;\n }\n return (authenticateToken(exchange, tokenString));\n }\n\n String getAccessTokenFromQueryParameter(HttpFacade exchange) {\n try {\n if (exchange != null && exchange.getRequest() != null) {\n return exchange.getRequest().getQueryParamValue(ACCESS_TOKEN);\n }\n } catch (Exception ignore) {\n }\n return null;\n }\n}\n"} +{"text": "// Copyright 2016 Google Inc. All Rights Reserved.\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage docker\n\nimport (\n\t\"fmt\"\n\t\"os\"\n\t\"strings\"\n\n\tdockertypes \"github.com/docker/docker/api/types\"\n)\n\nconst (\n\tDockerInfoDriver = \"Driver\"\n\tDockerInfoDriverStatus = \"DriverStatus\"\n\tDriverStatusPoolName = \"Pool Name\"\n\tDriverStatusDataLoopFile = \"Data loop file\"\n\tDriverStatusMetadataFile = \"Metadata file\"\n\tDriverStatusParentDataset = \"Parent Dataset\"\n)\n\nfunc DriverStatusValue(status [][2]string, target string) string {\n\tfor _, v := range status {\n\t\tif strings.EqualFold(v[0], target) {\n\t\t\treturn v[1]\n\t\t}\n\t}\n\n\treturn \"\"\n}\n\nfunc DockerThinPoolName(info dockertypes.Info) (string, error) {\n\tpoolName := DriverStatusValue(info.DriverStatus, DriverStatusPoolName)\n\tif len(poolName) == 0 {\n\t\treturn \"\", fmt.Errorf(\"Could not get devicemapper pool name\")\n\t}\n\n\treturn poolName, nil\n}\n\nfunc DockerMetadataDevice(info dockertypes.Info) (string, error) {\n\tmetadataDevice := DriverStatusValue(info.DriverStatus, DriverStatusMetadataFile)\n\tif len(metadataDevice) != 0 {\n\t\treturn metadataDevice, nil\n\t}\n\n\tpoolName, err := DockerThinPoolName(info)\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\n\tmetadataDevice = fmt.Sprintf(\"/dev/mapper/%s_tmeta\", poolName)\n\n\tif _, err := os.Stat(metadataDevice); err != nil {\n\t\treturn \"\", err\n\t}\n\n\treturn metadataDevice, nil\n}\n\nfunc DockerZfsFilesystem(info dockertypes.Info) (string, error) {\n\tfilesystem := DriverStatusValue(info.DriverStatus, DriverStatusParentDataset)\n\tif len(filesystem) == 0 {\n\t\treturn \"\", fmt.Errorf(\"Could not get zfs filesystem\")\n\t}\n\n\treturn filesystem, nil\n}\n"} +{"text": "# let's spoof Microsoft and Google ^_^\nset dns.spoof.domains microsoft.com, google.com\nset dhcp6.spoof.domains microsoft.com, google.com\n\n# every http request to the spoofed hosts will come to us\n# let's give em some contents\nset http.server.path www\n\n# serve files\nhttp.server on\n# redirect DNS request by spoofing DHCPv6 packets\ndhcp6.spoof on\n# send spoofed DNS replies ^_^\ndns.spoof on\n\n# set a custom prompt for ipv6\nset $ {by}{fw}{cidr} {fb}> {env.iface.ipv6} {reset} {bold}» {reset}\n# clear the events buffer and the screen\nevents.clear\nclear\n"} +{"text": "---\n-api-id: M:Windows.UI.Xaml.Controls.UIElementCollection.RemoveAtEnd\n-api-type: winrt method\n---\n\n\n\n# Windows.UI.Xaml.Controls.UIElementCollection.RemoveAtEnd\n\n## -description\nRemoves the last item in the collection.\n\n## -remarks\nIf successful, calling this method reduces the collection size by one.\n\nIf you are programming using C# or Microsoft Visual Basic, see [RemoveAt](/uwp/api/windows.ui.xaml.controls.uielementcollection.removeat) (pass an *index* value of [Count](/dotnet/api/system.collections.generic.icollection-1.count) minus one).\n\n## -examples\n\n## -see-also\n[RemoveAt](uielementcollection_removeat_1960564133.md), [IndexOf](uielementcollection_indexof_645395357.md)"} +{"text": "badclass.err line 10: A class may only have one 'match if' clause.\n"} +{"text": "// ***************************************************************************\n// *\n// * Copyright (C) 2010 International Business Machines\n// * Corporation and others. All Rights Reserved.\n// * Tool: com.ibm.icu.dev.tool.cldr.LDML2ICUConverter.java\n// * Source File:/common/main/en_TT.xml\n// *\n// ***************************************************************************\nen_TT{\n Currencies{\n TTD{\n \"$\",\n \"Trinidad and Tobago Dollar\",\n }\n USD{\n \"US$\",\n \"US Dollar\",\n }\n }\n Version{\"2.0.41.23\"}\n}\n"} +{"text": "\n\n \n\n \n\n"} +{"text": "gcr.io/google_containers/kube-scheduler-amd64:v1.12.2\n"} +{"text": "// For an explanation of the OWNERS rules and syntax, see:\n// https://github.com/ampproject/amp-github-apps/blob/master/owners/OWNERS.example\n\n{\n rules: [\n {\n owners: [\n {name: 'ampproject/wg-infra'},\n {name: 'ampproject/wg-runtime'},\n {name: 'ampproject/wg-performance'},\n {name: 'erwinmombay', notify: true},\n {name: 'jridgewell', notify: true},\n ],\n },\n ],\n}\n"} +{"text": "{\n \"name\": \"@instructure/ui-expandable\",\n \"version\": \"7.2.0\",\n \"description\": \"A utility component for show/hide functionality\",\n \"author\": \"Instructure, Inc. Engineering and Product Design\",\n \"type\": \"module\",\n \"module\": \"./es/index.js\",\n \"main\": \"./lib/index.js\",\n \"repository\": {\n \"type\": \"git\",\n \"url\": \"https://github.com/instructure/instructure-ui.git\"\n },\n \"homepage\": \"https://instructure.github.io/instructure-ui/\",\n \"bugs\": \"https://github.com/instructure/instructure-ui/issues\",\n \"scripts\": {\n \"lint\": \"ui-test --lint\",\n \"lint:fix\": \"ui-test --lint --fix\",\n \"clean\": \"ui-build --clean\",\n \"build\": \"ui-build --modules es,cjs\",\n \"build:watch\": \"ui-build --watch\",\n \"build:types\": \"ui-scripts --types\"\n },\n \"license\": \"MIT\",\n \"dependencies\": {\n \"@babel/runtime\": \"^7.9.2\",\n \"@instructure/ui-prop-types\": \"^7.2.0\",\n \"@instructure/ui-testable\": \"^7.2.0\",\n \"@instructure/ui-themeable\": \"^7.2.0\",\n \"@instructure/ui-utils\": \"^7.2.0\",\n \"@instructure/uid\": \"^7.2.0\",\n \"prop-types\": \"^15\"\n },\n \"devDependencies\": {\n \"@instructure/ui-babel-preset\": \"^7.2.0\",\n \"@instructure/ui-color-utils\": \"^7.2.0\",\n \"@instructure/ui-test-utils\": \"^7.2.0\"\n },\n \"peerDependencies\": {\n \"react\": \"^16.8\"\n },\n \"publishConfig\": {\n \"access\": \"public\"\n },\n \"sideEffects\": false\n}\n"} +{"text": "\n\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n"} +{"text": "User-agent: *\nDisallow: \n"} +{"text": "# Event 18571 - Shell32_CollectionLock_GetSingleQueueItem\n###### Version: 0\n\n## Description\nNone\n\n## Data Dictionary\n|Standard Name|Field Name|Type|Description|Sample Value|\n|---|---|---|---|---|\n|TBD|TaskID|GUID|None|`None`|\n|TBD|QueueItemCount|Int32|None|`None`|\n\n## Tags\n* etw_level_Informational\n* etw_keywords_Shell\n* etw_task_Shell32_CollectionLock_GetSingleQueueItem"} +{"text": "createQueue();\n}\n\n/**\n * Implements hook_uninstall().\n */\nfunction update_uninstall() {\n // Clear any variables that might be in use\n $variables = array(\n 'update_check_frequency',\n 'update_fetch_url',\n 'update_last_check',\n 'update_last_email_notification',\n 'update_notification_threshold',\n 'update_notify_emails',\n 'update_max_fetch_attempts',\n 'update_max_fetch_time',\n );\n foreach ($variables as $variable) {\n variable_del($variable);\n }\n $queue = DrupalQueue::get('update_fetch_tasks');\n $queue->deleteQueue();\n}\n\n/**\n * Fills in the requirements array.\n *\n * This is shared for both core and contrib to generate the right elements in\n * the array for hook_requirements().\n *\n * @param $project\n * Array of information about the project we're testing as returned by\n * update_calculate_project_data().\n * @param $type\n * What kind of project this is ('core' or 'contrib').\n *\n * @return\n * An array to be included in the nested $requirements array.\n *\n * @see hook_requirements()\n * @see update_requirements()\n * @see update_calculate_project_data()\n */\nfunction _update_requirement_check($project, $type) {\n $requirement = array();\n if ($type == 'core') {\n $requirement['title'] = t('Drupal core update status');\n }\n else {\n $requirement['title'] = t('Module and theme update status');\n }\n $status = $project['status'];\n if ($status != UPDATE_CURRENT) {\n $requirement['reason'] = $status;\n $requirement['description'] = _update_message_text($type, $status, TRUE);\n $requirement['severity'] = REQUIREMENT_ERROR;\n }\n switch ($status) {\n case UPDATE_NOT_SECURE:\n $requirement_label = t('Not secure!');\n break;\n case UPDATE_REVOKED:\n $requirement_label = t('Revoked!');\n break;\n case UPDATE_NOT_SUPPORTED:\n $requirement_label = t('Unsupported release');\n break;\n case UPDATE_NOT_CURRENT:\n $requirement_label = t('Out of date');\n $requirement['severity'] = REQUIREMENT_WARNING;\n break;\n case UPDATE_UNKNOWN:\n case UPDATE_NOT_CHECKED:\n case UPDATE_NOT_FETCHED:\n $requirement_label = isset($project['reason']) ? $project['reason'] : t('Can not determine status');\n $requirement['severity'] = REQUIREMENT_WARNING;\n break;\n default:\n $requirement_label = t('Up to date');\n }\n if ($status != UPDATE_CURRENT && $type == 'core' && isset($project['recommended'])) {\n $requirement_label .= ' ' . t('(version @version available)', array('@version' => $project['recommended']));\n }\n $requirement['value'] = l($requirement_label, update_manager_access() ? 'admin/reports/updates/update' : 'admin/reports/updates');\n return $requirement;\n}\n\n/**\n * @addtogroup updates-6.x-to-7.x\n * @{\n */\n\n/**\n * Create a queue to store tasks for requests to fetch available update data.\n */\nfunction update_update_7000() {\n module_load_include('inc', 'system', 'system.queue');\n $queue = DrupalQueue::get('update_fetch_tasks');\n $queue->createQueue();\n}\n\n/**\n * Recreates cache_update table.\n *\n * Converts fields that hold serialized variables from text to blob.\n * Removes 'headers' column.\n */\nfunction update_update_7001() {\n $schema = system_schema_cache_7054();\n\n db_drop_table('cache_update');\n db_create_table('cache_update', $schema);\n}\n\n/**\n * @} End of \"addtogroup updates-6.x-to-7.x\".\n */\n"} +{"text": "\n\n\n\n<?php echo CHtml::encode($data['type'])?>\n\n\n\n\n\n
\n\t

\n\n\t

\n\t\t\n\t

\n\n\t
\n\t\t

\n\t\trenderSourceCode($data['file'],$data['line'],$this->maxSourceLines); ?>\n\t
\n\n\t
\n\t\t

Stack Trace

\n\t\t\n\t\t\n\t\t $trace): ?>\n\t\tisCoreCode($trace))\n\t\t\t\t$cssClass='core collapsed';\n\t\t\telseif(++$count>3)\n\t\t\t\t$cssClass='app collapsed';\n\t\t\telse\n\t\t\t\t$cssClass='app expanded';\n\t\t\t$hasCode=$trace['file']!=='unknown' && is_file($trace['file']);\n\t\t?>\n\t\t\">\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t
\n\t\t\t\t#\n\t\t\t\n\t\t\t\t
\n\t\t\t\t\t\n\t\t\t\t\t\t
+
\n\t\t\t\t\t\t
–
\n\t\t\t\t\t\n\t\t\t\t\t{$trace['class']}{$trace['type']}\";\n\t\t\t\t\t\techo \"{$trace['function']}(\";\n\t\t\t\t\t\tif(!empty($trace['args']))\n\t\t\t\t\t\t\techo CHtml::encode($this->argumentsToString($trace['args']));\n\t\t\t\t\t\techo ')';\n\t\t\t\t\t?>\n\t\t\t\t
\n\n\t\t\t\trenderSourceCode($trace['file'],$trace['line'],$this->maxTraceSourceLines); ?>\n\t\t\t
\n\t
\n\n\t
\n\t\t\n\t
\n
\n\n\n\n\n\n"} +{"text": "- name: Ensure distro is up to date (once per hour)\n apt: update_cache=yes cache_valid_time=3600 upgrade=dist\n\n- name: Install base packages\n action: apt pkg={{item}} state=installed\n with_items:\n - dnsmasq\n - git\n - htop\n - iftop\n - iotop\n - iptables-persistent\n - iptraf-ng\n - linux-image-extra-virtual-lts-vivid\n - linux-virtual-lts-vivid\n - logtop\n - mtr-tiny\n - ngrep\n - ntpdate\n - tcpdump\n - tmux\n - tzdata\n - vim-nox\n\n- name: Autoremove packages\n command: apt-get -y autoremove\n\n- name: Delete downloaded packages\n command: apt-get -y clean\n"} +{"text": "/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n */\n/*\n * Description : Tests whether an ngram_index is applied to optimize a selection query with ~= using edit-distance on strings.\n * The index should be applied.\n * Success : Yes\n */\n\ndrop dataverse test if exists;\ncreate dataverse test;\n\nuse test;\n\n\ncreate type test.DBLPTypetmp as\n closed {\n id : integer,\n dblpid : string,\n title : string,\n authors : string,\n misc : string\n};\n\ncreate type test.DBLPType as\n closed {\n nested : DBLPTypetmp\n};\n\ncreate dataset DBLP(DBLPType) primary key nested.id;\n\ncreate index ngram_index on DBLP (nested.authors) type ngram (3);\n\nwrite output to asterix_nc1:\"rttest/inverted-index-basic_ngram-fuzzyeq-edit-distance.adm\";\nset `simfunction` `edit-distance`;\n\nset `simthreshold` `1`;\n\nselect element o\nfrom DBLP as o\nwhere (o.nested.authors ~= 'Amihay Motro')\n;\n"} +{"text": "// Copyright 2009 the Sputnik authors. All rights reserved.\n// This code is governed by the BSD license found in the LICENSE file.\n\n/*---\ninfo: >\n The production QuantifierPrefix :: ? evaluates by returning the two\n results 0 and 1\nes5id: 15.10.2.7_A5_T10\ndescription: Execute /ab?c?d?x?y?z/.exec(\"123az789\") and check results\n---*/\n\n__executed = /ab?c?d?x?y?z/.exec(\"123az789\");\n\n__expected = [\"az\"];\n__expected.index = 3;\n__expected.input = \"123az789\";\n\n//CHECK#1\nif (__executed.length !== __expected.length) {\n\t$ERROR('#1: __executed = /ab?c?d?x?y?z/.exec(\"123az789\"); __executed.length === ' + __expected.length + '. Actual: ' + __executed.length);\n}\n\n//CHECK#2\nif (__executed.index !== __expected.index) {\n\t$ERROR('#2: __executed = /ab?c?d?x?y?z/.exec(\"123az789\"); __executed.index === ' + __expected.index + '. Actual: ' + __executed.index);\n}\n\n//CHECK#3\nif (__executed.input !== __expected.input) {\n\t$ERROR('#3: __executed = /ab?c?d?x?y?z/.exec(\"123az789\"); __executed.input === ' + __expected.input + '. Actual: ' + __executed.input);\n}\n\n//CHECK#4\nfor(var index=0; index<__expected.length; index++) {\n\tif (__executed[index] !== __expected[index]) {\n\t\t$ERROR('#4: __executed = /ab?c?d?x?y?z/.exec(\"123az789\"); __executed[' + index + '] === ' + __expected[index] + '. Actual: ' + __executed[index]);\n\t}\n}\n"} +{"text": "\n \n \n PointOperationStatistics\n \n \n \n \n \n \n"} +{"text": " (\n \n Default info notification\n Positive notification\n Warning notification\n Negative notification\n \n);\n"} +{"text": "package env\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"os\"\n\t\"strings\"\n)\n\ntype Environment string\n\nconst (\n\tDev Environment = \"dev\"\n\tQA Environment = \"qa\"\n\tProd Environment = \"prod\"\n\tOnebox Environment = \"onebox\"\n)\n\nconst (\n\tKey = \"APPSCODE_ENV\"\n\tProdApiServer = \"https://api.appscode.com:3443\"\n\tQAApiServer = \"https://api.appscode.info:3443\"\n)\n\nfunc (e Environment) IsPublic() bool {\n\tswitch e {\n\tcase Prod, Onebox:\n\t\treturn true\n\tdefault:\n\t\treturn false\n\t}\n}\n\nfunc (e Environment) IsHosted() bool {\n\tswitch e {\n\tcase Dev, QA, Prod:\n\t\treturn true\n\tdefault:\n\t\treturn false\n\t}\n}\n\nfunc (e Environment) DebugEnabled() bool {\n\tswitch e {\n\tcase Dev, QA:\n\t\treturn true\n\tdefault:\n\t\treturn false\n\t}\n}\n\nfunc (e Environment) DevMode() bool {\n\treturn e == Dev\n}\n\nfunc (e Environment) APIServer() (string, error) {\n\tswitch e {\n\tcase Prod:\n\t\treturn ProdApiServer, nil\n\tcase QA:\n\t\treturn QAApiServer, nil\n\tdefault:\n\t\treturn \"\", fmt.Errorf(\"apiserver unknown for env %v\", e)\n\t}\n}\n\nfunc (e Environment) String() string {\n\treturn string(e)\n}\n\nfunc (e *Environment) MarshalJSON() ([]byte, error) {\n\treturn []byte(`\"` + *e + `\"`), nil\n}\n\nfunc (e *Environment) UnmarshalJSON(data []byte) error {\n\tif e == nil {\n\t\treturn errors.New(\"jsontypes.ArrayOrInt: UnmarshalJSON on nil pointer\")\n\t}\n\t*e = FromString(string(data[1 : len(data)-1]))\n\treturn nil\n}\n\nfunc FromHost() Environment {\n\treturn FromString(strings.ToLower(strings.TrimSpace(os.Getenv(Key))))\n}\n\nfunc FromString(e string) Environment {\n\tswitch e {\n\tcase \"prod\":\n\t\treturn Prod\n\tcase \"onebox\":\n\t\treturn Onebox\n\tcase \"qa\":\n\t\treturn QA\n\tcase \"dev\":\n\t\treturn Dev\n\tdefault:\n\t\tif InCluster() {\n\t\t\treturn Prod\n\t\t} else {\n\t\t\treturn Dev\n\t\t}\n\t}\n}\n\n// Possible returns true if loading an inside-kubernetes-cluster is possible.\n// ref: https://goo.gl/mrlLyr\nfunc InCluster() bool {\n\tfi, err := os.Stat(\"/var/run/secrets/kubernetes.io/serviceaccount/token\")\n\treturn os.Getenv(\"KUBERNETES_SERVICE_HOST\") != \"\" &&\n\t\tos.Getenv(\"KUBERNETES_SERVICE_PORT\") != \"\" &&\n\t\terr == nil && !fi.IsDir()\n}\n"} +{"text": "/*\n**==============================================================================\n**\n** Copyright (c) Microsoft Corporation. All rights reserved. See file LICENSE\n** for license information.\n**\n**==============================================================================\n*/\n\n#include \n#include \"wqlyaccinc.c\"\n\nvoid WQL_ResetParser()\n{\n yydebug = 0;\n yynerrs = 0;\n yyerrflag = 0;\n yychar = 0;\n\n memset(&yyval, 0, sizeof(yyval));\n memset(&yylval, 0, sizeof(yylval));\n}\n\n"} +{"text": "// Copyright 2019 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// +build !go1.12\n\npackage impl\n\nimport \"reflect\"\n\ntype mapIter struct {\n\tv reflect.Value\n\tkeys []reflect.Value\n}\n\n// mapRange provides a less-efficient equivalent to\n// the Go 1.12 reflect.Value.MapRange method.\nfunc mapRange(v reflect.Value) *mapIter {\n\treturn &mapIter{v: v}\n}\n\nfunc (i *mapIter) Next() bool {\n\tif i.keys == nil {\n\t\ti.keys = i.v.MapKeys()\n\t} else {\n\t\ti.keys = i.keys[1:]\n\t}\n\treturn len(i.keys) > 0\n}\n\nfunc (i *mapIter) Key() reflect.Value {\n\treturn i.keys[0]\n}\n\nfunc (i *mapIter) Value() reflect.Value {\n\treturn i.v.MapIndex(i.keys[0])\n}\n"} +{"text": "/**\n * Copyright 2018 The AMP HTML Authors. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS-IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { ChunkTransform } from '../../transform';\nimport { Range } from '../../types';\nimport { parse } from '../../acorn';\nimport MagicString from 'magic-string';\n\nexport default class ASITransform extends ChunkTransform {\n public name = 'ASITransform';\n\n /**\n * Small reduction in semi-colons, removing from end of block statements.\n * @param source source following closure compiler minification\n */\n public async post(fileName: string, source: MagicString): Promise {\n const code = source.toString();\n const program = await parse(fileName, code);\n\n if (program.body) {\n const lastStatement = program.body[program.body.length - 1];\n if (lastStatement) {\n const [start, end] = lastStatement.range as Range;\n if (lastStatement.type === 'EmptyStatement') {\n source.remove(start, end);\n } else {\n const lastStatementSource = code.substring(start, end);\n if (lastStatementSource.endsWith(';')) {\n source.overwrite(start, end, code.substring(start, end - 1));\n }\n }\n }\n }\n\n return source;\n }\n}\n"} +{"text": "/*\n * Copyright (c) 2013, 2019, Oracle and/or its affiliates. All rights reserved.\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * This code is free software; you can redistribute it and/or modify it\n * under the terms of the GNU General Public License version 2 only, as\n * published by the Free Software Foundation.\n *\n * This code is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License\n * version 2 for more details (a copy is included in the LICENSE file that\n * accompanied this code).\n *\n * You should have received a copy of the GNU General Public License version\n * 2 along with this work; if not, write to the Free Software Foundation,\n * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.\n *\n * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA\n * or visit www.oracle.com if you need additional information or have any\n * questions.\n *\n */\n\n#include \"precompiled.hpp\"\n#include \"gc/g1/g1CardTableEntryClosure.hpp\"\n#include \"gc/g1/g1CollectedHeap.inline.hpp\"\n#include \"gc/g1/g1DirtyCardQueue.hpp\"\n#include \"gc/g1/g1HotCardCache.hpp\"\n#include \"runtime/atomic.hpp\"\n\nG1HotCardCache::G1HotCardCache(G1CollectedHeap *g1h):\n _g1h(g1h), _use_cache(false), _card_counts(g1h),\n _hot_cache(NULL), _hot_cache_size(0), _hot_cache_par_chunk_size(0),\n _hot_cache_idx(0), _hot_cache_par_claimed_idx(0), _cache_wrapped_around(false)\n{}\n\nvoid G1HotCardCache::initialize(G1RegionToSpaceMapper* card_counts_storage) {\n if (default_use_cache()) {\n _use_cache = true;\n\n _hot_cache_size = (size_t)1 << G1ConcRSLogCacheSize;\n _hot_cache = ArrayAllocator::allocate(_hot_cache_size, mtGC);\n\n reset_hot_cache_internal();\n\n // For refining the cards in the hot cache in parallel\n _hot_cache_par_chunk_size = ClaimChunkSize;\n _hot_cache_par_claimed_idx = 0;\n\n _cache_wrapped_around = false;\n\n _card_counts.initialize(card_counts_storage);\n }\n}\n\nG1HotCardCache::~G1HotCardCache() {\n if (default_use_cache()) {\n assert(_hot_cache != NULL, \"Logic\");\n ArrayAllocator::free(_hot_cache, _hot_cache_size);\n _hot_cache = NULL;\n }\n}\n\nCardTable::CardValue* G1HotCardCache::insert(CardValue* card_ptr) {\n uint count = _card_counts.add_card_count(card_ptr);\n if (!_card_counts.is_hot(count)) {\n // The card is not hot so do not store it in the cache;\n // return it for immediate refining.\n return card_ptr;\n }\n // Otherwise, the card is hot.\n size_t index = Atomic::fetch_and_add(&_hot_cache_idx, 1u);\n if (index == _hot_cache_size) {\n // Can use relaxed store because all racing threads are writing the same\n // value and there aren't any concurrent readers.\n Atomic::store(&_cache_wrapped_around, true);\n }\n size_t masked_index = index & (_hot_cache_size - 1);\n CardValue* current_ptr = _hot_cache[masked_index];\n\n // Try to store the new card pointer into the cache. Compare-and-swap to guard\n // against the unlikely event of a race resulting in another card pointer to\n // have already been written to the cache. In this case we will return\n // card_ptr in favor of the other option, which would be starting over. This\n // should be OK since card_ptr will likely be the older card already when/if\n // this ever happens.\n CardValue* previous_ptr = Atomic::cmpxchg(&_hot_cache[masked_index],\n current_ptr,\n card_ptr);\n return (previous_ptr == current_ptr) ? previous_ptr : card_ptr;\n}\n\nvoid G1HotCardCache::drain(G1CardTableEntryClosure* cl, uint worker_id) {\n assert(default_use_cache(), \"Drain only necessary if we use the hot card cache.\");\n\n assert(_hot_cache != NULL, \"Logic\");\n assert(!use_cache(), \"cache should be disabled\");\n\n while (_hot_cache_par_claimed_idx < _hot_cache_size) {\n size_t end_idx = Atomic::add(&_hot_cache_par_claimed_idx,\n _hot_cache_par_chunk_size);\n size_t start_idx = end_idx - _hot_cache_par_chunk_size;\n // The current worker has successfully claimed the chunk [start_idx..end_idx)\n end_idx = MIN2(end_idx, _hot_cache_size);\n for (size_t i = start_idx; i < end_idx; i++) {\n CardValue* card_ptr = _hot_cache[i];\n if (card_ptr != NULL) {\n cl->do_card_ptr(card_ptr, worker_id);\n } else {\n break;\n }\n }\n }\n\n // The existing entries in the hot card cache, which were just refined\n // above, are discarded prior to re-enabling the cache near the end of the GC.\n}\n\nvoid G1HotCardCache::reset_card_counts(HeapRegion* hr) {\n _card_counts.clear_region(hr);\n}\n"} +{"text": "; REQUIRES: object-emission\n\n; RUN: %llc_dwarf -O2 -filetype=obj < %s | llvm-dwarfdump -debug-dump=info - | FileCheck %s\n\n; This is a test case that's as reduced as I can get it, though I haven't fully\n; understood the mechanisms by which this bug occurs, so perhaps there's further\n; simplification to be had (it's certainly a bit non-obvious what's going on). I\n; hesitate to hand-craft or otherwise simplify the IR compared to what Clang\n; generates as this is a particular tickling of optimizations and debug location\n; propagation I want a realistic example of.\n\n; Generated with clang-tot -cc1 -g -O2 -w -std=c++11 -fsanitize=address,use-after-return -fcxx-exceptions -fexceptions -x c++ incorrect-variable-debug-loc.cpp -emit-llvm\n\n; struct A {\n; int m_fn1();\n; };\n;\n; struct B {\n; void __attribute__((always_inline)) m_fn2() { i = 0; }\n; int i;\n; };\n;\n; struct C {\n; void m_fn3();\n; int j;\n; B b;\n; };\n;\n; int fn1() {\n; C A;\n; A.b.m_fn2();\n; A.m_fn3();\n; }\n; void C::m_fn3() {\n; A().m_fn1();\n; b.m_fn2();\n; }\n\n; CHECK: DW_TAG_structure_type\n; CHECK-NEXT: DW_AT_name {{.*}} \"C\"\n; CHECK: [[M_FN3_DECL:.*]]: DW_TAG_subprogram\n; CHECK-NOT: {{DW_TAG|NULL}}\n; CHECK: DW_AT_name {{.*}} \"m_fn3\"\n\n; CHECK: DW_AT_specification {{.*}} {[[M_FN3_DECL]]}\n; CHECK-NOT: DW_TAG\n; CHECK: DW_TAG_formal_parameter\n; CHECK-NOT: DW_TAG\n; CHECK: DW_AT_name {{.*}} \"this\"\n\n%struct.C = type { i32, %struct.B }\n%struct.B = type { i32 }\n%struct.A = type { i8 }\n\n@llvm.global_ctors = appending global [1 x { i32, void ()* }] [{ i32, void ()* } { i32 1, void ()* @asan.module_ctor }]\n@__asan_option_detect_stack_use_after_return = external global i32\n@__asan_gen_ = private unnamed_addr constant [11 x i8] c\"1 32 8 1 A\\00\", align 1\n@__asan_gen_1 = private unnamed_addr constant [13 x i8] c\"1 32 1 3 tmp\\00\", align 1\n\n; Function Attrs: noreturn sanitize_address\ndefine i32 @_Z3fn1v() #0 !dbg !22 {\nentry:\n %MyAlloca = alloca [64 x i8], align 32, !dbg !39\n %0 = ptrtoint [64 x i8]* %MyAlloca to i64, !dbg !39\n %1 = load i32, i32* @__asan_option_detect_stack_use_after_return, !dbg !39\n %2 = icmp ne i32 %1, 0, !dbg !39\n br i1 %2, label %3, label %5\n\n;