text
stringlengths 1
22.8M
|
|---|
```sqlpl
DROP TABLE IF EXISTS t1;
DROP TABLE IF EXISTS t2;
CREATE TABLE t1 (x UInt64) ENGINE = TinyLog;
INSERT INTO t1 VALUES (1), (2), (3);
CREATE TABLE t2 (x UInt64, value String) ENGINE = TinyLog;
INSERT INTO t2 VALUES (1, 'a'), (2, 'b'), (2, 'c');
INSERT INTO t2 VALUES (3, 'd'), (3, 'e'), (4, 'f');
SET max_block_size=3;
SET max_joined_block_size_rows = 2;
SET join_algorithm='partial_merge';
SELECT value FROM t1 LEFT JOIN t2 ON t1.x = t2.x ORDER BY value;
```
|
Henry Houry (1874–1972) was a French stage actor. He also appeared in and directed films. He worked for a while in the United States during the silent era, directing the 1918 Corinne Griffith film Love Watches.
Selected filmography
Love Watches (1918)
Koenigsmark (1923)
Heart of an Actress (1924)
Azaïs (1931)
The House of Mystery (1933)
The Crime of Bouif (1933)
The Alibi (1937)
The Woman Who Dared (1944)
Dominique (1950)
The Convict (1951)
References
Bibliography
Waldman, Harry & Slide, Anthony. Hollywood and the Foreign Touch: A Dictionary of Foreign Filmmakers and Their Films from America, 1910-1995. Scarecrow Press, 1996.
External links
1874 births
1972 deaths
French male film actors
French male silent film actors
French male stage actors
Film directors from Paris
20th-century French male actors
|
Cockpit iPads are iPads used in the aviation industry as part of an electronic flight bag to replace paper charts and manuals. This technology is currently being used by both private and commercial aircraft pilots.
History and testing
The iPad has been used in general aviation in conjunction with its paper backup counterpart, which is mandated by the Federal Aviation Administration (FAA). There are many applications available which include everything that would be on the paper charts plus aviation tools including navigation charts, taxi procedures, weather maps, GPS, Minimum Equipment List, Company Policy Manual, Federal Aviation Regulations and flight controls. Although these tools have been used in the private sector, the use of an iPad in commercial aviation is just taking flight.
The Federal Aviation Administration finished a three-month testing project which included putting the device through adverse conditions such as rapid decompression testing and tests to make sure the tablet did not interfere with the avionic equipment. Early in 2011 the FAA authorized charter company Executive Jet Management to use iPad records without the backup paper charts. This helps to make way for the iPad to become an aviation instrument for the rest of the industry. Alaska Airlines, Delta Air Lines, and American Airlines planned test programs.
Practicality
The main motive to use the iPad as a navigation tool is the practicality of the product. The iPad would replace about of paper charts used by pilots that include aircraft flight manuals, approach plate, navigation charts, policy manuals, minimum equipment list and taxi charts. Major airlines based in the United States are mainly paper based, which includes some who have fleets of 900 plus planes. This translates to a lot of paper in the form of charts that could be saved by the iPad. The switch to an electronic system would also make life easier on the pilot. No longer would pilots carry around a heavy flight bag. It would be replaced by the 9.5 by 7.31-inch tablet. When used in conjunction with a specially designed strap, this small size allows them to be used in place of kneeboards. Flight planning is also made easier by the iPad. The pilot would be able to use one device to check everything from weather, other airport facilities and flight plans. All this makes a pilot's life a lot easier.
Safety
The iPad as an electronic flight bag brings several safety advantages into the cockpit. First is the currency and completeness of the charts. Paper chart revisions are issued every two weeks. A pilot can easily misfile a paper chart, remove the wrong one or forget to file the chart altogether by the time of the flight occurs. An outdated or misplaced chart can increase the possibility of accidents.
Secondly, carrying the 40+ pound kitbag that holds all of the navigation charts is a cause of personal injuries of the pilots themselves. According to Patrick O’Keeffe, American Airlines’s vice president of Airline Operations Technology, “[American Airlines has] reduced the single biggest source of pilot injuries: carrying those packs.”
The iPad also allows for a decrease of clutter in the cockpit. This leads to a safer flight for the pilot and passengers. Pilots need not spread out the large charts in the small cockpit, hence they don't obstruct the view. Pilots can quickly swipe their fingers around the chart as well as switch charts in matter of seconds. This give pilots more time to look out the cockpit window and allows them to be able to just take a glance instead of searching around on a map.
A number of potential issues have been brought up including distractions in the cockpit, but the iPads are prohibited from being used for non-flight purposes and pilots are still using onboard GPS instruments. Other potential safety issues included application failure and system failure, but in the three-month test Executive Jet Management conducted, not once did the application shut off or have a failure. Tests did show that if a failure did take place the program could reboot in four to six seconds. Extra iPads in the cockpit are also being talked about as a backup to a system failure. Airlines are also looking into the safety of the placement of the iPads in the cockpit. The most popular placement is on a pilot's kneeboard, a strap that connects to the pilot's upper thigh and makes the device hands free, but many commercial airlines are looking into a dock that is connected to the plane itself.
References
IPad
Avionics
|
The Battle of the Nudes or Battle of the Naked Men, probably dating from 1465–1475, is an engraving by the Florentine goldsmith and sculptor Antonio del Pollaiuolo which is one of the most significant old master prints of the Italian Renaissance. The engraving is large at 42.4 × 60.9 cm, and depicts five men wearing headbands and five men without, fighting in pairs with weapons in front of a dense background of vegetation.
All the figures are posed in different strained and athletic positions, and the print is advanced for the period in this respect. The style is classicizing, although they grimace fiercely, and their musculature is strongly emphasized. The two figures nearest the front of the picture space are in essentially the same pose, seen from in front and behind, and one purpose of the print may have been to give artists poses to copy. An effective and largely original return-stroke engraving technique was employed to model the bodies, with delicate and subtle effect.
The engraving is signed : OPVS ANTONII POLLAIOLI FLORENTINI ("the work of Antonio Pollaiuolo the Florentine") on a tablet at left. Signing a print so prominently was unusual at this period.
Context and reception
Vasari, who praises the engraving highly, says that Pollaiuolo made other prints, but none have survived. Given the rarity of this one, Vasari may well be right, although he was writing many decades later. Alternatively he may have been referring to a number of prints after paintings or drawings of Pollaiuolo, but now universally seen as engraved by different artists to the battle, and now mostly attributed as "School of Pollaiuolo" or similar terms.
As with Andrea Mantegna, the dominant Italian printmaker of the period, based mostly in Mantua, the suggestion has been made that Pollaiuolo may not have engraved the plate himself, but hired a specialist to work from his design. However this remains a minority view. Engraving was an essential skill of the goldsmith, and Pollaiuolo's workshop produced niello engraved plaques. Estimates of the date of the engraving have varied from about 1465 to about 1489. As with most famous prints of the period, a number of direct copies were made in engraving and woodcut, including one by "Johannes of Frankfurt" in about 1490, and it was often borrowed from and imitated, for example in a drawing probably by Raphael. It is the first print to be signed with the artist's full name (on the plaque at the left rear), as opposed to the initials or monograms used by many printmakers.
The print clearly relates to the work of Mantegna, although uncertainty about the dating of the works of both artists means that the direction of influence is unclear. Mantegna made two large engravings of the Battle of the Sea-Gods, and he or his followers produced a number of others of male nudes fighting under various classical titles. Despite the usual attempts by art historians, including in this case Erwin Panofsky, to identify a specific subject for the engraving, it is likely none was intended. The two central figures grasp the ends of a large chain, which may suggest that the figures are to be seen as gladiators.
Vasari wrote of Pollaiuolo:
On the other hand, it has been suggested that Leonardo da Vinci may have had Pollaiuolo partly in mind when he wrote that artists should not
A recent paper suggests that the image depicts a duel between two noblemen that has degenerated into a more widespread confrontation involving the lower classes. It is further posited that Pollaiuolo's contemporaries would have recognised a difference in social class among combatants based on differences in armour, weapons and actions. These and other signifiers can be traced to a literary source, Giovanni da Legnano's legal treatise from the late fourteenth century.
Recent inquiries into the meaning of the work also suggest that this remarkable battle scene had impacted artists even after Mantegna. While the nude figures are idealized through the various poses, the figures can be seen time and time again in other works completed by other Venetian artists such as Jacopo de' Barbari in his "Battle Between Satyrs and Men", completed just before the end of the 15th century.
States
Like most 15th-century prints, the Battle is rare. The unique first-state impression in the print room of the Cleveland Museum of Art is generally accepted as much the finest, and about forty-nine impressions (single examples) survive of the second state, which is actually a high number for a 15th-century print. For the period, the print is very large, which has probably contributed to the small number of surviving impressions – it is clear from the worn state of the plate in many impressions that large numbers, probably running into the hundreds, were printed of the second state. There are no significant differences between the two states, so the plate was probably reworked just because it had worn out from the printing of now lost first-state impressions.
The existence of the first state was only realized in 1967, after Cleveland bought their print from the Liechtenstein collection. The best impression of the second state is in the Fogg Art Museum at Harvard; it appears to be the only one printed before the plate received a scratch, and from the paper and watermark would appear to have been printed close in time to the Cleveland impression. The two woodcut copies can be shown to have been copied from the first state.
Date
Although most art historians have dated the work to the period 1465–1475, in 1984 the suggestion was made that the print draws directly from a Roman sculpture known to have been excavated in Rome in 1489, Three Satyrs strangled by a Serpent (now Graz, Austria). Pollaiuolo was in Rome from 1484, and this would mean the print was executed there. This suggestion remains the subject of debate.
Surviving impressions
There are fifty impressions known to have survived to 1939; their distribution gives an interesting insight into the spread of top-class old master prints. As at the census in Langdale in 2002, there are sixteen in the United States, all apparently arrived since 1890, and mostly during the period 1930–1960. Italy has nine impressions, England five, and Paris three. There were five in Germany in 1939, of which one seems definitely to have been destroyed during World War II, one other "lost" from Bremen, and one lost sight of after the war. The other impressions outside Europe are in Melbourne and Ottawa; in Europe the Albertina in Vienna, the Netherlands (3), Strasbourg (1) and Budapest have impressions. Two of the three impressions in Switzerland are the only ones in the world still in private collections.
Notes
References
Cleveland Museum of Art Very full Cleveland feature on the print accessed 14 June 2014.
Langdale, Shelley, Battle of the Nudes: Pollaiuolo's Renaissance Masterpiece, The Cleveland Museum of Art, 2002.
Levinson; Laurie Smith Fusco in Jay A. Levinson (ed.) Early Italian Engravings from the National Gallery of Art, pp. 66–80, National Gallery of Art, Washington (Catalogue), 1973,LOC 7379624
Metropolitan Museum of Art, New York: "Antonio Pollaiuolo: Battle of Naked Men (17.50.99)". In Timeline of Art History. 2000–8. (October 2006)
Zucker, MJ, in KL Spangeberg (ed), Six Centuries of Master Prints, Cincinnati Art Museum, 1993, no 16,
External links
Khan Academy feature on the print
British Museum, with long curator's comments
Prints by Antonio del Pollaiuolo
15th-century engravings
Renaissance prints
Nude art
Collection of the Cleveland Museum of Art
Collection of the Cincinnati Art Museum
|
The 1934 Wyoming Cowboys football team was an American football team that represented the University of Wyoming in the Rocky Mountain Conference (RMC) during the 1934 college football season. In their second season under head coach Willard Witte, the Cowboys compiled a 3–5 record (2–4 against RMC opponents), finished in eighth place out of 12 teams in the RMC, and were outscored by a total of 109 to 78.
Schedule
References
Wyoming
Wyoming Cowboys football seasons
Wyoming Cowboys football
|
```smalltalk
using Microsoft.Extensions.DependencyInjection;
using Volo.Abp.EntityFrameworkCore;
using Volo.Abp.Modularity;
namespace Volo.Abp.AuditLogging.EntityFrameworkCore;
[DependsOn(typeof(AbpAuditLoggingDomainModule))]
[DependsOn(typeof(AbpEntityFrameworkCoreModule))]
public class AbpAuditLoggingEntityFrameworkCoreModule : AbpModule
{
public override void ConfigureServices(ServiceConfigurationContext context)
{
context.Services.AddAbpDbContext<AbpAuditLoggingDbContext>(options =>
{
options.AddRepository<AuditLog, EfCoreAuditLogRepository>();
});
}
}
```
|
```sqlpl
SET max_memory_usage = 50000000;
SET join_algorithm = 'partial_merge';
SELECT count(1) FROM (
SELECT t2.n FROM numbers(10) t1
JOIN (SELECT toUInt32(1) AS k, number n FROM numbers(100)) t2 ON toUInt32(t1.number) = t2.k
JOIN (SELECT toUInt32(1) AS k, number n FROM numbers(100)) t3 ON t2.k = t3.k
JOIN (SELECT toUInt32(1) AS k, number n FROM numbers(100)) t4 ON t2.k = t4.k
);
```
|
Šibenik () is a settlement in the Municipality of Šentjur, eastern Slovenia. Šibenik is a dispersed settlement, in the hills immediately south of the town of Šentjur. The settlement, and the entire municipality, are included in the Savinja Statistical Region, which is in the Slovenian portion of the historical Duchy of Styria.
References
External links
Šibenik on Geopedia
Populated places in the Municipality of Šentjur
|
Tina Čarman (born 8 January 1978 in Kranj) is a retired Slovenian long jumper. She was selected to compete for the Slovenian Olympic team in the long jump at the 2004 Summer Olympics after recording a personal best of 6.56 metres from a national athletics meet in Dolenjske Toplice. Carman also trained as a member of the athletics squad for the Dolenjske Toplice Sports Club () under her coach Dobrivoje Vučkovič.
Carman qualified for the Slovenian squad in the women's long jump at the 2004 Summer Olympics in Athens. A year before the Games, she jumped 6.56 metres to attain both her personal best and an Olympic B-standard at a national athletics meet in Dolenjske Toplice. During the prelims, Carman fouled in two consecutive attempts until she satisfied her final jump with a spanning distance of 5.72 metres, placing her in the thirty-sixth position against a vast field of thirty-nine long jumpers.
References
External links
1978 births
Living people
Slovenian female long jumpers
Olympic athletes for Slovenia
Athletes (track and field) at the 2004 Summer Olympics
Sportspeople from Kranj
|
```javascript
ace.define("ace/mode/doc_comment_highlight_rules",["require","exports","module","ace/lib/oop","ace/mode/text_highlight_rules"],function(e,t,n){"use strict";var r=e("../lib/oop"),i=e("./text_highlight_rules").TextHighlightRules,s=function(){this.$rules={start:[{token:"comment.doc.tag",regex:"@[\\w\\d_]+"},s.getTagRule(),{defaultToken:"comment.doc",caseInsensitive:!0}]}};r.inherits(s,i),s.getTagRule=function(e){return{token:"comment.doc.tag.storage.type",regex:"\\b(?:TODO|FIXME|XXX|HACK)\\b"}},s.getStartRule=function(e){return{token:"comment.doc",regex:"\\/\\*(?=\\*)",next:e}},s.getEndRule=function(e){return{token:"comment.doc",regex:"\\*\\/",next:e}},t.DocCommentHighlightRules=s}),ace.define("ace/mode/c_cpp_highlight_rules",["require","exports","module","ace/lib/oop","ace/mode/doc_comment_highlight_rules","ace/mode/text_highlight_rules"],function(e,t,n){"use strict";var r=e("../lib/oop"),i=e("./doc_comment_highlight_rules").DocCommentHighlightRules,s=e("./text_highlight_rules").TextHighlightRules,o=t.cFunctions="\\b(?:hypot(?:f|l)?|s(?:scanf|ystem|nprintf|ca(?:nf|lb(?:n(?:f|l)?|ln(?:f|l)?))|i(?:n(?:h(?:f|l)?|f|l)?|gn(?:al|bit))|tr(?:s(?:tr|pn)|nc(?:py|at|mp)|c(?:spn|hr|oll|py|at|mp)|to(?:imax|d|u(?:l(?:l)?|max)|k|f|l(?:d|l)?)|error|pbrk|ftime|len|rchr|xfrm)|printf|et(?:jmp|vbuf|locale|buf)|qrt(?:f|l)?|w(?:scanf|printf)|rand)|n(?:e(?:arbyint(?:f|l)?|xt(?:toward(?:f|l)?|after(?:f|l)?))|an(?:f|l)?)|c(?:s(?:in(?:h(?:f|l)?|f|l)?|qrt(?:f|l)?)|cos(?:h(?:f)?|f|l)?|imag(?:f|l)?|t(?:ime|an(?:h(?:f|l)?|f|l)?)|o(?:s(?:h(?:f|l)?|f|l)?|nj(?:f|l)?|pysign(?:f|l)?)|p(?:ow(?:f|l)?|roj(?:f|l)?)|e(?:il(?:f|l)?|xp(?:f|l)?)|l(?:o(?:ck|g(?:f|l)?)|earerr)|a(?:sin(?:h(?:f|l)?|f|l)?|cos(?:h(?:f|l)?|f|l)?|tan(?:h(?:f|l)?|f|l)?|lloc|rg(?:f|l)?|bs(?:f|l)?)|real(?:f|l)?|brt(?:f|l)?)|t(?:ime|o(?:upper|lower)|an(?:h(?:f|l)?|f|l)?|runc(?:f|l)?|gamma(?:f|l)?|mp(?:nam|file))|i(?:s(?:space|n(?:ormal|an)|cntrl|inf|digit|u(?:nordered|pper)|p(?:unct|rint)|finite|w(?:space|c(?:ntrl|type)|digit|upper|p(?:unct|rint)|lower|al(?:num|pha)|graph|xdigit|blank)|l(?:ower|ess(?:equal|greater)?)|al(?:num|pha)|gr(?:eater(?:equal)?|aph)|xdigit|blank)|logb(?:f|l)?|max(?:div|abs))|di(?:v|fftime)|_Exit|unget(?:c|wc)|p(?:ow(?:f|l)?|ut(?:s|c(?:har)?|wc(?:har)?)|error|rintf)|e(?:rf(?:c(?:f|l)?|f|l)?|x(?:it|p(?:2(?:f|l)?|f|l|m1(?:f|l)?)?))|v(?:s(?:scanf|nprintf|canf|printf|w(?:scanf|printf))|printf|f(?:scanf|printf|w(?:scanf|printf))|w(?:scanf|printf)|a_(?:start|copy|end|arg))|qsort|f(?:s(?:canf|e(?:tpos|ek))|close|tell|open|dim(?:f|l)?|p(?:classify|ut(?:s|c|w(?:s|c))|rintf)|e(?:holdexcept|set(?:e(?:nv|xceptflag)|round)|clearexcept|testexcept|of|updateenv|r(?:aiseexcept|ror)|get(?:e(?:nv|xceptflag)|round))|flush|w(?:scanf|ide|printf|rite)|loor(?:f|l)?|abs(?:f|l)?|get(?:s|c|pos|w(?:s|c))|re(?:open|e|ad|xp(?:f|l)?)|m(?:in(?:f|l)?|od(?:f|l)?|a(?:f|l|x(?:f|l)?)?))|l(?:d(?:iv|exp(?:f|l)?)|o(?:ngjmp|cal(?:time|econv)|g(?:1(?:p(?:f|l)?|0(?:f|l)?)|2(?:f|l)?|f|l|b(?:f|l)?)?)|abs|l(?:div|abs|r(?:int(?:f|l)?|ound(?:f|l)?))|r(?:int(?:f|l)?|ound(?:f|l)?)|gamma(?:f|l)?)|w(?:scanf|c(?:s(?:s(?:tr|pn)|nc(?:py|at|mp)|c(?:spn|hr|oll|py|at|mp)|to(?:imax|d|u(?:l(?:l)?|max)|k|f|l(?:d|l)?|mbs)|pbrk|ftime|len|r(?:chr|tombs)|xfrm)|to(?:b|mb)|rtomb)|printf|mem(?:set|c(?:hr|py|mp)|move))|a(?:s(?:sert|ctime|in(?:h(?:f|l)?|f|l)?)|cos(?:h(?:f|l)?|f|l)?|t(?:o(?:i|f|l(?:l)?)|exit|an(?:h(?:f|l)?|2(?:f|l)?|f|l)?)|b(?:s|ort))|g(?:et(?:s|c(?:har)?|env|wc(?:har)?)|mtime)|r(?:int(?:f|l)?|ound(?:f|l)?|e(?:name|alloc|wind|m(?:ove|quo(?:f|l)?|ainder(?:f|l)?))|a(?:nd|ise))|b(?:search|towc)|m(?:odf(?:f|l)?|em(?:set|c(?:hr|py|mp)|move)|ktime|alloc|b(?:s(?:init|towcs|rtowcs)|towc|len|r(?:towc|len))))\\b",u=function(){var e="break|case|continue|default|do|else|for|goto|if|_Pragma|return|switch|while|catch|operator|try|throw|using",t="asm|__asm__|auto|bool|_Bool|char|_Complex|double|enum|float|_Imaginary|int|long|short|signed|struct|typedef|union|unsigned|void|class|wchar_t|template|char16_t|char32_t",n="const|extern|register|restrict|static|volatile|inline|private|protected|public|friend|explicit|virtual|export|mutable|typename|constexpr|new|delete|alignas|alignof|decltype|noexcept|thread_local",r="and|and_eq|bitand|bitor|compl|not|not_eq|or|or_eq|typeid|xor|xor_eq|const_cast|dynamic_cast|reinterpret_cast|static_cast|sizeof|namespace",s="NULL|true|false|TRUE|FALSE|nullptr",u=this.$keywords=this.createKeywordMapper({"keyword.control":e,"storage.type":t,"storage.modifier":n,"keyword.operator":r,"variable.language":"this","constant.language":s},"identifier"),a="[a-zA-Z\\$_\u00a1-\uffff][a-zA-Z\\d\\$_\u00a1-\uffff]*\\b",f=/\\(?:['"?\\abfnrtv]|[0-7]{1,3}|x[a-fA-F\d]{2}|u[a-fA-F\d]{4}U[a-fA-F\d]{8}|.)/.source,l="%"+/(\d+\$)?/.source+/[#0\- +']*/.source+/[,;:_]?/.source+/((-?\d+)|\*(-?\d+\$)?)?/.source+/(\.((-?\d+)|\*(-?\d+\$)?)?)?/.source+/(hh|h|ll|l|j|t|z|q|L|vh|vl|v|hv|hl)?/.source+/(\[[^"\]]+\]|[diouxXDOUeEfFgGaACcSspn%])/.source;this.$rules={start:[{token:"comment",regex:"//$",next:"start"},{token:"comment",regex:"//",next:"singleLineComment"},i.getStartRule("doc-start"),{token:"comment",regex:"\\/\\*",next:"comment"},{token:"string",regex:"'(?:"+f+"|.)?'"},{token:"string.start",regex:'"',stateName:"qqstring",next:[{token:"string",regex:/\\\s*$/,next:"qqstring"},{token:"constant.language.escape",regex:f},{token:"constant.language.escape",regex:l},{token:"string.end",regex:'"|$',next:"start"},{defaultToken:"string"}]},{token:"string.start",regex:'R"\\(',stateName:"rawString",next:[{token:"string.end",regex:'\\)"',next:"start"},{defaultToken:"string"}]},{token:"constant.numeric",regex:"0[xX][0-9a-fA-F]+(L|l|UL|ul|u|U|F|f|ll|LL|ull|ULL)?\\b"},{token:"constant.numeric",regex:"[+-]?\\d+(?:(?:\\.\\d*)?(?:[eE][+-]?\\d+)?)?(L|l|UL|ul|u|U|F|f|ll|LL|ull|ULL)?\\b"},{token:"keyword",regex:"#\\s*(?:include|import|pragma|line|define|undef)\\b",next:"directive"},{token:"keyword",regex:"#\\s*(?:endif|if|ifdef|else|elif|ifndef)\\b"},{token:"support.function.C99.c",regex:o},{token:u,regex:"[a-zA-Z_$][a-zA-Z0-9_$]*"},{token:"keyword.operator",regex:/--|\+\+|<<=|>>=|>>>=|<>|&&|\|\||\?:|[*%\/+\-&\^|~!<>=]=?/},{token:"punctuation.operator",regex:"\\?|\\:|\\,|\\;|\\."},{token:"paren.lparen",regex:"[[({]"},{token:"paren.rparen",regex:"[\\])}]"},{token:"text",regex:"\\s+"}],comment:[{token:"comment",regex:"\\*\\/",next:"start"},{defaultToken:"comment"}],singleLineComment:[{token:"comment",regex:/\\$/,next:"singleLineComment"},{token:"comment",regex:/$/,next:"start"},{defaultToken:"comment"}],directive:[{token:"constant.other.multiline",regex:/\\/},{token:"constant.other.multiline",regex:/.*\\/},{token:"constant.other",regex:"\\s*<.+?>",next:"start"},{token:"constant.other",regex:'\\s*["](?:(?:\\\\.)|(?:[^"\\\\]))*?["]',next:"start"},{token:"constant.other",regex:"\\s*['](?:(?:\\\\.)|(?:[^'\\\\]))*?[']",next:"start"},{token:"constant.other",regex:/[^\\\/]+/,next:"start"}]},this.embedRules(i,"doc-",[i.getEndRule("start")]),this.normalizeRules()};r.inherits(u,s),t.c_cppHighlightRules=u}),ace.define("ace/mode/matching_brace_outdent",["require","exports","module","ace/range"],function(e,t,n){"use strict";var r=e("../range").Range,i=function(){};(function(){this.checkOutdent=function(e,t){return/^\s+$/.test(e)?/^\s*\}/.test(t):!1},this.autoOutdent=function(e,t){var n=e.getLine(t),i=n.match(/^(\s*\})/);if(!i)return 0;var s=i[1].length,o=e.findMatchingBracket({row:t,column:s});if(!o||o.row==t)return 0;var u=this.$getIndent(e.getLine(o.row));e.replace(new r(t,0,t,s-1),u)},this.$getIndent=function(e){return e.match(/^\s*/)[0]}}).call(i.prototype),t.MatchingBraceOutdent=i}),ace.define("ace/mode/folding/cstyle",["require","exports","module","ace/lib/oop","ace/range","ace/mode/folding/fold_mode"],function(e,t,n){"use strict";var r=e("../../lib/oop"),i=e("../../range").Range,s=e("./fold_mode").FoldMode,o=t.FoldMode=function(e){e&&(this.foldingStartMarker=new RegExp(this.foldingStartMarker.source.replace(/\|[^|]*?$/,"|"+e.start)),this.foldingStopMarker=new RegExp(this.foldingStopMarker.source.replace(/\|[^|]*?$/,"|"+e.end)))};r.inherits(o,s),function(){this.foldingStartMarker=/([\{\[\(])[^\}\]\)]*$|^\s*(\/\*)/,this.foldingStopMarker=/^[^\[\{\(]*([\}\]\)])|^[\s\*]*(\*\/)/,this.singleLineBlockCommentRe=/^\s*(\/\*).*\*\/\s*$/,this.tripleStarBlockCommentRe=/^\s*(\/\*\*\*).*\*\/\s*$/,this.startRegionRe=/^\s*(\/\*|\/\/)#?region\b/,this._getFoldWidgetBase=this.getFoldWidget,this.getFoldWidget=function(e,t,n){var r=e.getLine(n);if(this.singleLineBlockCommentRe.test(r)&&!this.startRegionRe.test(r)&&!this.tripleStarBlockCommentRe.test(r))return"";var i=this._getFoldWidgetBase(e,t,n);return!i&&this.startRegionRe.test(r)?"start":i},this.getFoldWidgetRange=function(e,t,n,r){var i=e.getLine(n);if(this.startRegionRe.test(i))return this.getCommentRegionBlock(e,i,n);var s=i.match(this.foldingStartMarker);if(s){var o=s.index;if(s[1])return this.openingBracketBlock(e,s[1],n,o);var u=e.getCommentFoldRange(n,o+s[0].length,1);return u&&!u.isMultiLine()&&(r?u=this.getSectionRange(e,n):t!="all"&&(u=null)),u}if(t==="markbegin")return;var s=i.match(this.foldingStopMarker);if(s){var o=s.index+s[0].length;return s[1]?this.closingBracketBlock(e,s[1],n,o):e.getCommentFoldRange(n,o,-1)}},this.getSectionRange=function(e,t){var n=e.getLine(t),r=n.search(/\S/),s=t,o=n.length;t+=1;var u=t,a=e.getLength();while(++t<a){n=e.getLine(t);var f=n.search(/\S/);if(f===-1)continue;if(r>f)break;var l=this.getFoldWidgetRange(e,"all",t);if(l){if(l.start.row<=s)break;if(l.isMultiLine())t=l.end.row;else if(r==f)break}u=t}return new i(s,o,u,e.getLine(u).length)},this.getCommentRegionBlock=function(e,t,n){var r=t.search(/\s*$/),s=e.getLength(),o=n,u=/^\s*(?:\/\*|\/\/|--)#?(end)?region\b/,a=1;while(++n<s){t=e.getLine(n);var f=u.exec(t);if(!f)continue;f[1]?a--:a++;if(!a)break}var l=n;if(l>o)return new i(o,r,l,t.length)}}.call(o.prototype)}),ace.define("ace/mode/c_cpp",["require","exports","module","ace/lib/oop","ace/mode/text","ace/mode/c_cpp_highlight_rules","ace/mode/matching_brace_outdent","ace/range","ace/mode/behaviour/cstyle","ace/mode/folding/cstyle"],function(e,t,n){"use strict";var r=e("../lib/oop"),i=e("./text").Mode,s=e("./c_cpp_highlight_rules").c_cppHighlightRules,o=e("./matching_brace_outdent").MatchingBraceOutdent,u=e("../range").Range,a=e("./behaviour/cstyle").CstyleBehaviour,f=e("./folding/cstyle").FoldMode,l=function(){this.HighlightRules=s,this.$outdent=new o,this.$behaviour=new a,this.foldingRules=new f};r.inherits(l,i),function(){this.lineCommentStart="//",this.blockComment={start:"/*",end:"*/"},this.getNextLineIndent=function(e,t,n){var r=this.$getIndent(t),i=this.getTokenizer().getLineTokens(t,e),s=i.tokens,o=i.state;if(s.length&&s[s.length-1].type=="comment")return r;if(e=="start"){var u=t.match(/^.*[\{\(\[]\s*$/);u&&(r+=n)}else if(e=="doc-start"){if(o=="start")return"";var u=t.match(/^\s*(\/?)\*/);u&&(u[1]&&(r+=" "),r+="* ")}return r},this.checkOutdent=function(e,t,n){return this.$outdent.checkOutdent(t,n)},this.autoOutdent=function(e,t,n){this.$outdent.autoOutdent(t,n)},this.$id="ace/mode/c_cpp"}.call(l.prototype),t.Mode=l}),ace.define("ace/mode/glsl_highlight_rules",["require","exports","module","ace/lib/oop","ace/mode/c_cpp_highlight_rules"],function(e,t,n){"use strict";var r=e("../lib/oop"),i=e("./c_cpp_highlight_rules").c_cppHighlightRules,s=function(){var e="attribute|const|uniform|varying|break|continue|do|for|while|if|else|in|out|inout|float|int|void|bool|true|false|lowp|mediump|highp|precision|invariant|discard|return|mat2|mat3|mat4|vec2|vec3|vec4|ivec2|ivec3|ivec4|bvec2|bvec3|bvec4|sampler2D|samplerCube|struct",t="radians|degrees|sin|cos|tan|asin|acos|atan|pow|exp|log|exp2|log2|sqrt|inversesqrt|abs|sign|floor|ceil|fract|mod|min|max|clamp|mix|step|smoothstep|length|distance|dot|cross|normalize|faceforward|reflect|refract|matrixCompMult|lessThan|lessThanEqual|greaterThan|greaterThanEqual|equal|notEqual|any|all|not|dFdx|dFdy|fwidth|texture2D|texture2DProj|texture2DLod|texture2DProjLod|textureCube|textureCubeLod|gl_MaxVertexAttribs|gl_MaxVertexUniformVectors|gl_MaxVaryingVectors|gl_MaxVertexTextureImageUnits|gl_MaxCombinedTextureImageUnits|gl_MaxTextureImageUnits|gl_MaxFragmentUniformVectors|gl_MaxDrawBuffers|gl_DepthRangeParameters|gl_DepthRange|gl_Position|gl_PointSize|gl_FragCoord|gl_FrontFacing|gl_PointCoord|gl_FragColor|gl_FragData",n=this.createKeywordMapper({"variable.language":"this",keyword:e,"constant.language":t},"identifier");this.$rules=(new i).$rules,this.$rules.start.forEach(function(e){typeof e.token=="function"&&(e.token=n)})};r.inherits(s,i),t.glslHighlightRules=s}),ace.define("ace/mode/glsl",["require","exports","module","ace/lib/oop","ace/mode/c_cpp","ace/mode/glsl_highlight_rules","ace/mode/matching_brace_outdent","ace/range","ace/mode/behaviour/cstyle","ace/mode/folding/cstyle"],function(e,t,n){"use strict";var r=e("../lib/oop"),i=e("./c_cpp").Mode,s=e("./glsl_highlight_rules").glslHighlightRules,o=e("./matching_brace_outdent").MatchingBraceOutdent,u=e("../range").Range,a=e("./behaviour/cstyle").CstyleBehaviour,f=e("./folding/cstyle").FoldMode,l=function(){this.HighlightRules=s,this.$outdent=new o,this.$behaviour=new a,this.foldingRules=new f};r.inherits(l,i),function(){this.$id="ace/mode/glsl"}.call(l.prototype),t.Mode=l});
(function() {
ace.require(["ace/mode/glsl"], function(m) {
if (typeof module == "object" && typeof exports == "object" && module) {
module.exports = m;
}
});
})();
```
|
Hechtia carlsoniae is a plant species in the genus Hechtia. This species is endemic to Mexico.
References
carlsoniae
Flora of Mexico
|
The News Is the News was a live news-satire program that aired four episodes on NBC in the summer of 1983.
Creation
Herb Sargent, a TV comedy writer since the days of Broadway Open House in the early 1950s, created and produced the show; it debuted on Wednesday, June 15, 1983, airing for a half hour at 10:00 pm Eastern Time.
Sargent was also producer of the American version of the seminal news-satire program, That Was the Week That Was, which also aired on NBC, from January 1964 to May 1965. Described as a "pseudo-newscast...to lampoon, satirize, bludgeon, incinerate, josh, reduce to ashes, and otherwise play havoc with the real news of the preceding seven days," TNITN featured Karen Dale as the lead anchor, with Michael Davis, Simon Jones, Charlotte Moore, Lynne Thigpen and Trey Wilson as correspondents. Michael Palin also contributed a segment on the first anniversary of the surrender of Argentinian forces in the Falkland Islands.
The News Is the News was also unusual in that it was carried live, from NBC's studios at 30 Rockefeller Plaza in New York (verified by showing actual newspaper front pages from the day of the broadcast); it was, at the time, the only (non-sports) program to air live in prime time on any of the TV networks, and one of the few to do so since the pre-videotape era of the 1950s. But airing up against ABC's hit soap Dynasty, TNITN drew few viewers—its most-seen episode finished a poor 45th for the week, with a 10.8 rating and a 19 percent share—and many of those who did tune in were not impressed (a whopping 86 percent of the mail NBC received about the show was critical). Finally, the show was cancelled after airing only half of its planned eight episodes, because, as NBC president Brandon Tartikoff put it, "it was not very good. In four weeks I saw no sizable growth in terms of the development of the show."
Cancellation
After TNITN (and reruns of Taxi, which had been airing at 10:30 as part of NBC's "New Adult Comedy Hour") were cancelled, the network filled out the summer with re-runs of the series The Family Tree in the time slot.
References
External links
NBC promo for "The News is the News" (starts at 0:19)
1983 American television series debuts
1983 American television series endings
1980s American satirical television series
1980s American television news shows
American news parodies
NBC original programming
English-language television shows
|
Janowa is a village in the administrative district of Gmina Otmuchów, within Nysa County, Opole Voivodeship, in south-western Poland, close to the Czech border. It lies approximately north-west of Otmuchów, west of Nysa, and west of the regional capital Opole.
References
Janowa
|
```c
/*
*
*/
#include <stdbool.h>
#include <stdint.h>
#include <stddef.h>
#include <assert.h>
#include <stdlib.h>
#include "sdkconfig.h"
#include "esp32s2/rom/rtc.h"
#include "soc/rtc.h"
#include "esp_private/rtc_clk.h"
#include "soc/rtc_cntl_reg.h"
#include "soc/rtc_io_reg.h"
#include "soc/soc_caps.h"
#include "esp_rom_sys.h"
#include "esp_hw_log.h"
#include "sdkconfig.h"
#include "hal/clk_tree_ll.h"
static const char *TAG = "rtc_clk";
// Current PLL frequency, in MHZ (320 or 480). Zero if PLL is not enabled.
// On the ESP32-S2, 480MHz PLL is enabled at reset.
static uint32_t s_cur_pll_freq = CLK_LL_PLL_480M_FREQ_MHZ;
static void rtc_clk_cpu_freq_to_xtal(int freq, int div);
static void rtc_clk_cpu_freq_to_8m(void);
void rtc_clk_32k_enable(bool enable)
{
if (enable) {
SET_PERI_REG_MASK(RTC_IO_XTAL_32P_PAD_REG, RTC_IO_X32P_MUX_SEL);
SET_PERI_REG_MASK(RTC_IO_XTAL_32N_PAD_REG, RTC_IO_X32N_MUX_SEL);
clk_ll_xtal32k_enable(CLK_LL_XTAL32K_ENABLE_MODE_CRYSTAL);
} else {
clk_ll_xtal32k_disable();
}
}
void rtc_clk_32k_enable_external(void)
{
SET_PERI_REG_MASK(RTC_IO_XTAL_32P_PAD_REG, RTC_IO_X32P_MUX_SEL);
SET_PERI_REG_MASK(RTC_IO_XTAL_32N_PAD_REG, RTC_IO_X32N_MUX_SEL);
clk_ll_xtal32k_enable(CLK_LL_XTAL32K_ENABLE_MODE_EXTERNAL);
}
void rtc_clk_32k_bootstrap(uint32_t cycle)
{
/* No special bootstrapping needed for ESP32-S2, 'cycle' argument is to keep the signature
* same as for the ESP32. Just enable the XTAL here.
*/
(void)cycle;
rtc_clk_32k_enable(true);
}
bool rtc_clk_32k_enabled(void)
{
return clk_ll_xtal32k_is_enabled();
}
void rtc_clk_8m_enable(bool clk_8m_en, bool d256_en)
{
if (clk_8m_en) {
clk_ll_rc_fast_enable();
esp_rom_delay_us(SOC_DELAY_RC_FAST_ENABLE);
} else {
clk_ll_rc_fast_disable();
}
/* d256 should be independent configured with 8M
* Maybe we can split this function into 8m and dmd256
*/
if (d256_en) {
clk_ll_rc_fast_d256_enable();
} else {
clk_ll_rc_fast_d256_disable();
}
}
bool rtc_clk_8m_enabled(void)
{
return clk_ll_rc_fast_is_enabled();
}
bool rtc_clk_8md256_enabled(void)
{
return clk_ll_rc_fast_d256_is_enabled();
}
void rtc_clk_apll_enable(bool enable)
{
if (enable) {
clk_ll_apll_enable();
} else {
clk_ll_apll_disable();
}
}
uint32_t rtc_clk_apll_coeff_calc(uint32_t freq, uint32_t *_o_div, uint32_t *_sdm0, uint32_t *_sdm1, uint32_t *_sdm2)
{
uint32_t rtc_xtal_freq = (uint32_t)rtc_clk_xtal_freq_get();
if (rtc_xtal_freq == 0) {
// xtal_freq has not set yet
ESP_HW_LOGE(TAG, "Get xtal clock frequency failed, it has not been set yet");
abort();
}
/* Reference formula: apll_freq = xtal_freq * (4 + sdm2 + sdm1/256 + sdm0/65536) / ((o_div + 2) * 2)
* ---------------------------------------------- -----------------
* 350 MHz <= Numerator <= 500 MHz Denominator
*/
int o_div = 0; // range: 0~31
int sdm0 = 0; // range: 0~255
int sdm1 = 0; // range: 0~255
int sdm2 = 0; // range: 0~63
/* Firstly try to satisfy the condition that the operation frequency of numerator should be greater than 350 MHz,
* i.e. xtal_freq * (4 + sdm2 + sdm1/256 + sdm0/65536) >= 350 MHz, '+1' in the following code is to get the ceil value.
* With this condition, as we know the 'o_div' can't be greater than 31, then we can calculate the APLL minimum support frequency is
* 350 MHz / ((31 + 2) * 2) = 5303031 Hz (for ceil) */
o_div = (int)(CLK_LL_APLL_MULTIPLIER_MIN_HZ / (float)(freq * 2) + 1) - 2;
if (o_div > 31) {
ESP_HW_LOGE(TAG, "Expected frequency is too small");
return 0;
}
if (o_div < 0) {
/* Try to satisfy the condition that the operation frequency of numerator should be smaller than 500 MHz,
* i.e. xtal_freq * (4 + sdm2 + sdm1/256 + sdm0/65536) <= 500 MHz, we need to get the floor value in the following code.
* With this condition, as we know the 'o_div' can't be smaller than 0, then we can calculate the APLL maximum support frequency is
* 500 MHz / ((0 + 2) * 2) = 125000000 Hz */
o_div = (int)(CLK_LL_APLL_MULTIPLIER_MAX_HZ / (float)(freq * 2)) - 2;
if (o_div < 0) {
ESP_HW_LOGE(TAG, "Expected frequency is too big");
return 0;
}
}
// sdm2 = (int)(((o_div + 2) * 2) * apll_freq / xtal_freq) - 4
sdm2 = (int)(((o_div + 2) * 2 * freq) / (rtc_xtal_freq * MHZ)) - 4;
// numrator = (((o_div + 2) * 2) * apll_freq / xtal_freq) - 4 - sdm2
float numrator = (((o_div + 2) * 2 * freq) / ((float)rtc_xtal_freq * MHZ)) - 4 - sdm2;
// If numrator is bigger than 255/256 + 255/65536 + (1/65536)/2 = 1 - (1 / 65536)/2, carry bit to sdm2
if (numrator > 1.0 - (1.0 / 65536.0) / 2.0) {
sdm2++;
}
// If numrator is smaller than (1/65536)/2, keep sdm0 = sdm1 = 0, otherwise calculate sdm0 and sdm1
else if (numrator > (1.0 / 65536.0) / 2.0) {
// Get the closest sdm1
sdm1 = (int)(numrator * 65536.0 + 0.5) / 256;
// Get the closest sdm0
sdm0 = (int)(numrator * 65536.0 + 0.5) % 256;
}
uint32_t real_freq = (uint32_t)(rtc_xtal_freq * MHZ * (4 + sdm2 + (float)sdm1/256.0 + (float)sdm0/65536.0) / (((float)o_div + 2) * 2));
*_o_div = o_div;
*_sdm0 = sdm0;
*_sdm1 = sdm1;
*_sdm2 = sdm2;
return real_freq;
}
void rtc_clk_apll_coeff_set(uint32_t o_div, uint32_t sdm0, uint32_t sdm1, uint32_t sdm2)
{
clk_ll_apll_set_config(o_div, sdm0, sdm1, sdm2);
/* calibration */
clk_ll_apll_set_calibration();
/* wait for calibration end */
while (!clk_ll_apll_calibration_is_done()) {
/* use esp_rom_delay_us so the RTC bus doesn't get flooded */
esp_rom_delay_us(1);
}
}
void rtc_clk_slow_src_set(soc_rtc_slow_clk_src_t clk_src)
{
clk_ll_rtc_slow_set_src(clk_src);
/* Why we need to connect this clock to digital?
* Or maybe this clock should be connected to digital when xtal 32k clock is enabled instead?
*/
if (clk_src == SOC_RTC_SLOW_CLK_SRC_XTAL32K) {
clk_ll_xtal32k_digi_enable();
} else {
clk_ll_xtal32k_digi_disable();
}
esp_rom_delay_us(SOC_DELAY_RTC_SLOW_CLK_SWITCH);
}
soc_rtc_slow_clk_src_t rtc_clk_slow_src_get(void)
{
return clk_ll_rtc_slow_get_src();
}
uint32_t rtc_clk_slow_freq_get_hz(void)
{
switch (rtc_clk_slow_src_get()) {
case SOC_RTC_SLOW_CLK_SRC_RC_SLOW: return SOC_CLK_RC_SLOW_FREQ_APPROX;
case SOC_RTC_SLOW_CLK_SRC_XTAL32K: return SOC_CLK_XTAL32K_FREQ_APPROX;
case SOC_RTC_SLOW_CLK_SRC_RC_FAST_D256: return SOC_CLK_RC_FAST_D256_FREQ_APPROX;
default: return 0;
}
}
void rtc_clk_fast_src_set(soc_rtc_fast_clk_src_t clk_src)
{
clk_ll_rtc_fast_set_src(clk_src);
esp_rom_delay_us(SOC_DELAY_RTC_FAST_CLK_SWITCH);
}
soc_rtc_fast_clk_src_t rtc_clk_fast_src_get(void)
{
return clk_ll_rtc_fast_get_src();
}
static void rtc_clk_bbpll_disable(void)
{
clk_ll_bbpll_disable();
s_cur_pll_freq = 0;
}
static void rtc_clk_bbpll_enable(void)
{
clk_ll_bbpll_enable();
}
static void rtc_clk_bbpll_configure(soc_xtal_freq_t xtal_freq, int pll_freq)
{
assert(xtal_freq == SOC_XTAL_FREQ_40M);
/* Digital part */
clk_ll_bbpll_set_freq_mhz(pll_freq);
/* Analog part */
clk_ll_bbpll_set_config(pll_freq, xtal_freq);
// Enable calibration by software
clk_ll_bbpll_calibration_enable();
for (int ext_cap = 0; ext_cap < 16; ext_cap++) {
if (clk_ll_bbpll_calibration_is_done(ext_cap)) {
break;
}
if (ext_cap == 15) {
ESP_HW_LOGE(TAG, "BBPLL SOFTWARE CAL FAIL");
abort();
}
}
s_cur_pll_freq = pll_freq;
}
/**
* Switch to one of PLL-based frequencies. Current frequency can be XTAL or PLL.
* PLL must already be enabled.
* @param cpu_freq new CPU frequency
*/
static void rtc_clk_cpu_freq_to_pll_mhz(int cpu_freq_mhz)
{
/* To avoid the problem of insufficient voltage when the CPU frequency is switched:
* When the CPU frequency is switched from low to high, it is necessary to
* increase the voltage first and then increase the frequency, and the frequency
* needs to wait for the voltage to fully increase before proceeding.
* When the frequency of the CPU is switched from high to low, it is necessary
* to reduce the frequency first and then reduce the voltage.
*/
rtc_cpu_freq_config_t cur_config;
rtc_clk_cpu_freq_get_config(&cur_config);
/* cpu_frequency < 240M: dbias = DIG_DBIAS_XTAL_80M_160M;
* cpu_frequency = 240M: dbias = DIG_DBIAS_240M;
*/
if (cpu_freq_mhz > cur_config.freq_mhz) {
if (cpu_freq_mhz == 240) {
REG_SET_FIELD(RTC_CNTL_REG, RTC_CNTL_DIG_DBIAS_WAK, DIG_DBIAS_240M);
REG_SET_FIELD(RTC_CNTL_REG, RTC_CNTL_DBIAS_WAK, RTC_DBIAS_240M);
esp_rom_delay_us(40);
}
}
clk_ll_cpu_set_freq_mhz_from_pll(cpu_freq_mhz);
clk_ll_cpu_set_divider(1);
clk_ll_cpu_set_src(SOC_CPU_CLK_SRC_PLL);
rtc_clk_apb_freq_update(80 * MHZ);
esp_rom_set_cpu_ticks_per_us(cpu_freq_mhz);
if (cpu_freq_mhz < cur_config.freq_mhz) {
if (cur_config.freq_mhz == 240) {
REG_SET_FIELD(RTC_CNTL_REG, RTC_CNTL_DIG_DBIAS_WAK, DIG_DBIAS_XTAL_80M_160M);
REG_SET_FIELD(RTC_CNTL_REG, RTC_CNTL_DBIAS_WAK, RTC_DBIAS_XTAL_80M_160M);
esp_rom_delay_us(40);
}
}
}
bool rtc_clk_cpu_freq_mhz_to_config(uint32_t freq_mhz, rtc_cpu_freq_config_t* out_config)
{
uint32_t source_freq_mhz;
soc_cpu_clk_src_t source;
uint32_t divider;
uint32_t real_freq_mhz;
uint32_t xtal_freq = CLK_LL_XTAL_FREQ_MHZ;
if (freq_mhz <= xtal_freq && freq_mhz != 0) {
divider = xtal_freq / freq_mhz;
real_freq_mhz = (xtal_freq + divider / 2) / divider; /* round */
if (real_freq_mhz != freq_mhz) {
// no suitable divider
return false;
}
source_freq_mhz = xtal_freq;
source = SOC_CPU_CLK_SRC_XTAL;
} else if (freq_mhz == 80) {
real_freq_mhz = freq_mhz;
source = SOC_CPU_CLK_SRC_PLL;
source_freq_mhz = CLK_LL_PLL_480M_FREQ_MHZ;
divider = 6;
} else if (freq_mhz == 160) {
real_freq_mhz = freq_mhz;
source = SOC_CPU_CLK_SRC_PLL;
source_freq_mhz = CLK_LL_PLL_480M_FREQ_MHZ;
divider = 3;
} else if (freq_mhz == 240) {
real_freq_mhz = freq_mhz;
source = SOC_CPU_CLK_SRC_PLL;
source_freq_mhz = CLK_LL_PLL_480M_FREQ_MHZ;
divider = 2;
} else {
// unsupported frequency
return false;
}
*out_config = (rtc_cpu_freq_config_t) {
.source = source,
.div = divider,
.source_freq_mhz = source_freq_mhz,
.freq_mhz = real_freq_mhz
};
return true;
}
void rtc_clk_cpu_freq_set_config(const rtc_cpu_freq_config_t* config)
{
soc_cpu_clk_src_t old_cpu_clk_src = clk_ll_cpu_get_src();
if (old_cpu_clk_src != SOC_CPU_CLK_SRC_XTAL) {
rtc_clk_cpu_freq_to_xtal(CLK_LL_XTAL_FREQ_MHZ, 1);
}
if (old_cpu_clk_src == SOC_CPU_CLK_SRC_PLL && config->source_freq_mhz != s_cur_pll_freq) {
rtc_clk_bbpll_disable();
}
if (config->source == SOC_CPU_CLK_SRC_XTAL) {
if (config->div > 1) {
rtc_clk_cpu_freq_to_xtal(config->freq_mhz, config->div);
}
} else if (config->source == SOC_CPU_CLK_SRC_PLL) {
rtc_clk_bbpll_enable();
rtc_clk_bbpll_configure((soc_xtal_freq_t)CLK_LL_XTAL_FREQ_MHZ, config->source_freq_mhz);
rtc_clk_cpu_freq_to_pll_mhz(config->freq_mhz);
} else if (config->source == SOC_CPU_CLK_SRC_RC_FAST) {
rtc_clk_cpu_freq_to_8m();
}
}
void rtc_clk_cpu_freq_get_config(rtc_cpu_freq_config_t* out_config)
{
soc_cpu_clk_src_t source = clk_ll_cpu_get_src();
uint32_t source_freq_mhz;
uint32_t div;
uint32_t freq_mhz;
switch (source) {
case SOC_CPU_CLK_SRC_XTAL: {
div = clk_ll_cpu_get_divider();
source_freq_mhz = CLK_LL_XTAL_FREQ_MHZ;
freq_mhz = source_freq_mhz / div;
}
break;
case SOC_CPU_CLK_SRC_PLL: {
freq_mhz = clk_ll_cpu_get_freq_mhz_from_pll();
source_freq_mhz = clk_ll_bbpll_get_freq_mhz();
if (freq_mhz == CLK_LL_PLL_80M_FREQ_MHZ) {
div = (source_freq_mhz == CLK_LL_PLL_480M_FREQ_MHZ) ? 6 : 4;
} else if (freq_mhz == CLK_LL_PLL_160M_FREQ_MHZ) {
div = (source_freq_mhz == CLK_LL_PLL_480M_FREQ_MHZ) ? 3 : 2;
} else if (freq_mhz == CLK_LL_PLL_240M_FREQ_MHZ && source_freq_mhz == CLK_LL_PLL_480M_FREQ_MHZ) {
div = 2;
} else {
ESP_HW_LOGE(TAG, "unsupported frequency configuration");
abort();
}
break;
}
case SOC_CPU_CLK_SRC_RC_FAST:
source_freq_mhz = 8;
div = 1;
freq_mhz = source_freq_mhz;
break;
case SOC_CPU_CLK_SRC_APLL:
default:
ESP_HW_LOGE(TAG, "unsupported frequency configuration");
abort();
}
*out_config = (rtc_cpu_freq_config_t) {
.source = source,
.source_freq_mhz = source_freq_mhz,
.div = div,
.freq_mhz = freq_mhz
};
}
void rtc_clk_cpu_freq_set_config_fast(const rtc_cpu_freq_config_t* config)
{
if (config->source == SOC_CPU_CLK_SRC_XTAL) {
rtc_clk_cpu_freq_to_xtal(config->freq_mhz, config->div);
} else if (config->source == SOC_CPU_CLK_SRC_PLL &&
s_cur_pll_freq == config->source_freq_mhz) {
rtc_clk_cpu_freq_to_pll_mhz(config->freq_mhz);
} else {
/* fallback */
rtc_clk_cpu_freq_set_config(config);
}
}
void rtc_clk_cpu_freq_set_xtal(void)
{
rtc_clk_cpu_set_to_default_config();
/* BBPLL is kept enabled */
}
void rtc_clk_cpu_set_to_default_config(void)
{
rtc_clk_cpu_freq_to_xtal(CLK_LL_XTAL_FREQ_MHZ, 1);
}
/**
* Switch to use XTAL as the CPU clock source.
* Must satisfy: cpu_freq = XTAL_FREQ / div.
* Does not disable the PLL.
*/
static void rtc_clk_cpu_freq_to_xtal(int cpu_freq, int div)
{
rtc_cpu_freq_config_t cur_config;
rtc_clk_cpu_freq_get_config(&cur_config);
esp_rom_set_cpu_ticks_per_us(cpu_freq);
/* Set divider from XTAL to APB clock. Need to set divider to 1 (reg. value 0) first. */
clk_ll_cpu_set_divider(1);
clk_ll_cpu_set_divider(div);
/* no need to adjust the REF_TICK, default register value already set it to 1MHz with any cpu clock source */
/* switch clock source */
clk_ll_cpu_set_src(SOC_CPU_CLK_SRC_XTAL);
rtc_clk_apb_freq_update(cpu_freq * MHZ);
/* lower the voltage
* cpu_frequency < 240M: dbias = DIG_DBIAS_XTAL_80M_160M;
* cpu_frequency = 240M: dbias = DIG_DBIAS_240M;
*/
if (cur_config.freq_mhz == 240) {
REG_SET_FIELD(RTC_CNTL_REG, RTC_CNTL_DIG_DBIAS_WAK, DIG_DBIAS_XTAL_80M_160M);
REG_SET_FIELD(RTC_CNTL_REG, RTC_CNTL_DBIAS_WAK, RTC_DBIAS_XTAL_80M_160M);
esp_rom_delay_us(40);
}
}
static void rtc_clk_cpu_freq_to_8m(void)
{
assert(0 && "LDO dbias need to modified");
esp_rom_set_cpu_ticks_per_us(8);
REG_SET_FIELD(RTC_CNTL_REG, RTC_CNTL_DIG_DBIAS_WAK, DIG_DBIAS_XTAL);
esp_rom_delay_us(40);
clk_ll_cpu_set_divider(1);
clk_ll_cpu_set_src(SOC_CPU_CLK_SRC_RC_FAST);
rtc_clk_apb_freq_update(SOC_CLK_RC_FAST_FREQ_APPROX);
}
soc_xtal_freq_t rtc_clk_xtal_freq_get(void)
{
// Note, inside esp32s2-only code it's better to use CLK_LL_XTAL_FREQ_MHZ constant
return (soc_xtal_freq_t)CLK_LL_XTAL_FREQ_MHZ;
}
void rtc_clk_apb_freq_update(uint32_t apb_freq)
{
clk_ll_apb_store_freq_hz(apb_freq);
}
uint32_t rtc_clk_apb_freq_get(void)
{
return clk_ll_apb_load_freq_hz();
}
void rtc_clk_divider_set(uint32_t div)
{
clk_ll_rc_slow_set_divider(div + 1);
}
void rtc_clk_8m_divider_set(uint32_t div)
{
clk_ll_rc_fast_set_divider(div + 1);
}
void rtc_dig_clk8m_enable(void)
{
clk_ll_rc_fast_digi_enable();
esp_rom_delay_us(SOC_DELAY_RC_FAST_DIGI_SWITCH);
}
void rtc_dig_clk8m_disable(void)
{
clk_ll_rc_fast_digi_disable();
esp_rom_delay_us(SOC_DELAY_RC_FAST_DIGI_SWITCH);
}
bool rtc_dig_8m_enabled(void)
{
return clk_ll_rc_fast_digi_is_enabled();
}
/* Name used in libphy.a:phy_chip_v7.o
* TODO: update the library to use rtc_clk_xtal_freq_get
*/
rtc_xtal_freq_t rtc_get_xtal(void) __attribute__((alias("rtc_clk_xtal_freq_get")));
```
|
Philip Zuchman (; 1942–2021) was an American landscape painter and visual artist living in Philadelphia, Pennsylvania.
Early life
Philip Zuchman was born in Queens, New York and started painting when he was seven years old. At age 14 Zuchman's mother died and he left home to live in various lofts around New York City. At age 18, he and a friend built kayaks for themselves and paddled from Bordentown, N.J. to the Carolina Sea Islands.
Education and writing career
Although Zuchman did not finish high school, Queens College accepted him in 1961. He studied philosophy and writing there, graduating in 1965. He won the Peter Pauper Press Award for two novelettes: Father Never Went to Church But Loved the Soil and A Mass for an Ass. In 1966 Zuchman served as a psychological research specialist and French interpreter in the U.S. Army. While stationed in Monterey, California he wrote a script based on O. Henry’s story "The Gift of the Magi" that was performed by the Presidio Players in 1966 under the direction of Edward Bach.
After his discharge from the army, he returned to Manhattan in 1968 to paint. During this time, he studied with Arthur Foster at the Art Students League of New York. In 1971 the Salmagundi Club awarded him its four-year Young Artist’s Scholarship. Zuchman moved up to a small farmhouse in Walden, Vermont that year to pursue an MA in painting at Goddard College, where he studied with James Gahagan. In 1973 he moved to Philadelphia, PA, where he married fellow artist Deborah Gross.
Painting career
Zuchman served as president of the National Forum of Professional Artists, vice president of Philadelphia Artists Equity, and vice president of the Philadelphia Watercolor Society. He was a Professor of Studio Art and Aesthetics, Emeritus, at the Art Institute of Philadelphia until 2013. Zuchman’s paintings have been exhibited internationally as part of the U.S. State Department’s Art in Embassies Program, for which he was a Cultural Ambassador.
Philip Zuchman spent the final decades of his life living in West Philadelphia with his wife, painter Deborah Gross-Zuchman. The couple restored their 19th century home and studio and occasionally held arts and culture events there up until the onset of the Coronavirus pandemic in 2019. The house features their paintings, carvings, mosaics and murals. In 2013, Philip was named an Honorary Lifetime Member of the Philadelphia Watercolor Society. In 2019, the Puffin Foundation awarded Philip a grant for “Lamentations,” a handmade book dedicated to people, past and present, who have suffered from migration, displacement and exile. Zuchman also received the Albert Nelson Marquis Lifetime Achievement Award in 2020.
Artwork
Zuchman worked primarily with oils and encaustics. For much of his career, he has focused on painting landscapes en plein air. Zuchman explored in his paintings humanity’s interdependence with nature, saying, "Landscapes are political. There are things in landscapes which we don't think of today as symbols—the road that moves through the landscape, the touch of a building, the fence separating borders, the edges of town. All these things combined together give a picture of man's relationship to the environment." His work also explored broader themes such as social ecology, war, and the possibilities of humanism. "Artists work to expose the nature of existence, to communicate feelings, to activate consciousness, increase human knowledge, to promote justice, and education. They are activists and pioneers who struggle in their lives against forces of isolation, poverty, discrimination, bad legislation, and being misunderstood by the public," he wrote in his "Call to Action." His commitment to art as a social practice led to his inclusion in several exhibits, including "Art From Detritus" in NYC and "All of Us or None." In 2002, Zuchman was featured in Wendy Weinberg's TV special "The Art of Activism," where he said, "I'm willing to go to great lengths sometimes to make a point. When issues grab a hold of me personally—issues of taxes that artists have to pay that are prejudicial, issues of censorship—I get to be a troublemaker. And I'm going to go and write letters and make phone calls. I'm going to do whatever I can do to possibly alter that situation. And I think artists should do this, I think this is very important. We should all be doing the critique of the world we live in."
Describing Zuchman’s use of color in his introduction to Summer on a Hill, Peter London writes, "And it is here in his choice of color schemes that Philip is most inventive. The closely matched greens of midsummer are now replaced with a wider range of tones and tints. And these in turn are now given to us in layers of contrasting hues and saturations. The effect of this broadening and layering is to animate the flat surface of the painting to equal the vibrancy of the constantly changing light, the twirling shift of surfaces of the millions of leaves, grasses and clouds, all within yawning depths of space of nature just as it is. The scarlet and rose and mauve and sepia and chartreuse and cerulean of Philip’s palette replace nature’s own infinite variations on green. And how nature forms its own endless variety of twigs, pebbles, leaves and grasses is now replaced by Philip’s wide range of textured application of paint. Smears, glazes, washes, impastos, scumbles, blotches and the like build an uneven surface of the painting making the whole pulsate, again, like the shimmering of the light on any portion of nature’s beauty."
Death
Philip Zuchman was diagnosed with pancreatic cancer in August 2021 and died at home in September.
References
External links
[quote:] This Website is Under Construction! Please Visit
http://www.deborahzuchman.com/ and
http://www.philipzuchman.com/ for more information.
1942 births
2021 deaths
Painters from Philadelphia
Art Students League of New York alumni
|
```css
.cls1 { /*!*/ }
.cls2 {
composes: cls1;
color: red;
width: 75px;
}
@media (min-width: 420px) {
.cls2 {
width: 96px;
height: 96px
}
}
.cls2.primary {
background: white;
color: palevioletred;
}
/*# sourceMappingURL=data:application/json;base64,your_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashOiBwYWxldmlvbGV0cmVkO1xufVxufSJdfQ== */
```
|
```vue
<template lang="pug">
.tabset.elevation-2
ul.tabset-tabs(ref='tabs', role='tablist')
slot(name='tabs')
.tabset-content(ref='content')
slot(name='content')
</template>
<script>
import { customAlphabet } from 'nanoid/non-secure'
const nanoid = customAlphabet('1234567890abcdef', 10)
export default {
data() {
return {
currentTab: 0
}
},
watch: {
currentTab (newValue, oldValue) {
this.setActiveTab()
}
},
methods: {
setActiveTab () {
this.$refs.tabs.childNodes.forEach((node, idx) => {
if (idx === this.currentTab) {
node.className = 'is-active'
node.setAttribute('aria-selected', 'true')
} else {
node.className = ''
node.setAttribute('aria-selected', 'false')
}
})
this.$refs.content.childNodes.forEach((node, idx) => {
if (idx === this.currentTab) {
node.className = 'tabset-panel is-active'
node.removeAttribute('hidden')
} else {
node.className = 'tabset-panel'
node.setAttribute('hidden', '')
}
})
}
},
mounted () {
// Handle scroll to header on load within hidden tab content
if (window.location.hash && window.location.hash.length > 1) {
const headerId = decodeURIComponent(window.location.hash)
let foundIdx = -1
this.$refs.content.childNodes.forEach((node, idx) => {
if (node.querySelector(headerId)) {
foundIdx = idx
}
})
if (foundIdx >= 0) {
this.currentTab = foundIdx
}
}
this.setActiveTab()
const tabRefId = nanoid()
this.$refs.tabs.childNodes.forEach((node, idx) => {
node.setAttribute('id', `${tabRefId}-${idx}`)
node.setAttribute('role', 'tab')
node.setAttribute('aria-controls', `${tabRefId}-${idx}-tab`)
node.setAttribute('tabindex', '0')
node.addEventListener('click', ev => {
this.currentTab = [].indexOf.call(ev.target.parentNode.children, ev.target)
})
node.addEventListener('keydown', ev => {
if (ev.key === 'ArrowLeft' && idx > 0) {
this.currentTab = idx - 1
this.$refs.tabs.childNodes[idx - 1].focus()
} else if (ev.key === 'ArrowRight' && idx < this.$refs.tabs.childNodes.length - 1) {
this.currentTab = idx + 1
this.$refs.tabs.childNodes[idx + 1].focus()
} else if (ev.key === 'Enter' || ev.key === ' ') {
this.currentTab = idx
node.focus()
} else if (ev.key === 'Home') {
this.currentTab = 0
ev.preventDefault()
ev.target.parentNode.children[0].focus()
} else if (ev.key === 'End') {
this.currentTab = this.$refs.tabs.childNodes.length - 1
ev.preventDefault()
ev.target.parentNode.children[this.$refs.tabs.childNodes.length - 1].focus()
}
})
})
this.$refs.content.childNodes.forEach((node, idx) => {
node.setAttribute('id', `${tabRefId}-${idx}-tab`)
node.setAttribute('role', 'tabpanel')
node.setAttribute('aria-labelledby', `${tabRefId}-${idx}`)
node.setAttribute('tabindex', '0')
})
}
}
</script>
<style lang="scss">
.tabset {
border-radius: 5px;
margin-top: 10px;
@at-root .theme--dark & {
background-color: #292929;
}
> .tabset-tabs {
padding-left: 0;
margin: 0;
display: flex;
align-items: stretch;
background: linear-gradient(to bottom, #FFF, #FAFAFA);
box-shadow: inset 0 -1px 0 0 #DDD;
border-radius: 5px 5px 0 0;
overflow: auto;
@at-root .theme--dark & {
background: linear-gradient(to bottom, #424242, #333);
box-shadow: inset 0 -1px 0 0 #555;
}
> li {
display: block;
padding: 16px;
margin-top: 0;
cursor: pointer;
transition: color 1s ease;
border-right: 1px solid #FFF;
font-size: 14px;
font-weight: 500;
margin-bottom: 1px;
user-select: none;
@at-root .theme--dark & {
border-right-color: #555;
}
&.is-active {
background-color: #FFF;
margin-bottom: 0;
padding-bottom: 17px;
padding-top: 13px;
color: mc('blue', '700');
border-top: 3px solid mc('blue', '700');
@at-root .theme--dark & {
background-color: #292929;
color: mc('blue', '300');
}
}
&:last-child {
border-right: none;
&.is-active {
border-right: 1px solid #EEE;
@at-root .theme--dark & {
border-right-color: #555;
}
}
}
&:hover {
background-color: rgba(#CCC, .1);
@at-root .theme--dark & {
background-color: rgba(#222, .25);
}
&.is-active {
background-color: #FFF;
@at-root .theme--dark & {
background-color: #292929;
}
}
}
& + li {
border-left: 1px solid #EEE;
@at-root .theme--dark & {
border-left-color: #222;
}
}
}
}
> .tabset-content {
.tabset-panel {
padding: 2px 16px 16px;
display: none;
&.is-active {
display: block;
}
}
}
}
</style>
```
|
```objective-c
/**
* This file is part of ORB-SLAM2.
*
* For more information see <path_to_url
*
* ORB-SLAM2 is free software: you can redistribute it and/or modify
* (at your option) any later version.
*
* ORB-SLAM2 is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
*
* along with ORB-SLAM2. If not, see <path_to_url
*/
#ifndef MAPDRAWER_H
#define MAPDRAWER_H
#include"Map.h"
#include"MapPoint.h"
#include"KeyFrame.h"
#include<pangolin/pangolin.h>
#include<mutex>
namespace ORB_SLAM2
{
class MapDrawer
{
public:
MapDrawer(Map* pMap, const string &strSettingPath);
Map* mpMap;
void DrawMapPoints();
void DrawKeyFrames(const bool bDrawKF, const bool bDrawGraph);
void DrawCurrentCamera(pangolin::OpenGlMatrix &Twc);
void SetCurrentCameraPose(const cv::Mat &Tcw);
void SetReferenceKeyFrame(KeyFrame *pKF);
void GetCurrentOpenGLCameraMatrix(pangolin::OpenGlMatrix &M);
private:
float mKeyFrameSize;
float mKeyFrameLineWidth;
float mGraphLineWidth;
float mPointSize;
float mCameraSize;
float mCameraLineWidth;
cv::Mat mCameraPose;
std::mutex mMutexCamera;
};
} //namespace ORB_SLAM
#endif // MAPDRAWER_H
```
|
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
// MODULES //
var bench = require( '@stdlib/bench' );
var uniform = require( '@stdlib/random/base/uniform' ).factory;
var isnanf = require( '@stdlib/math/base/assert/is-nanf' );
var pow = require( '@stdlib/math/base/special/pow' );
var Float32Array = require( '@stdlib/array/float32' );
var Uint8Array = require( '@stdlib/array/uint8' );
var pkg = require( './../package.json' ).name;
var smskabs2 = require( './../lib/main.js' );
// VARIABLES //
var rand = uniform( -100.0, 100.0 );
// FUNCTIONS //
/**
* Creates a benchmark function.
*
* @private
* @param {PositiveInteger} len - array length
* @returns {Function} benchmark function
*/
function createBenchmark( len ) {
var x;
var m;
var y;
var i;
x = new Float32Array( len );
m = new Uint8Array( len );
y = new Float32Array( len );
for ( i = 0; i < x.length; i++ ) {
x[ i ] = rand();
}
return benchmark;
/**
* Benchmark function.
*
* @private
* @param {Benchmark} b - benchmark instance
*/
function benchmark( b ) {
var z;
var i;
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
z = smskabs2( x.length, x, 1, m, 1, y, 1 );
if ( isnanf( z[ i%len ] ) ) {
b.fail( 'should not return NaN' );
}
}
b.toc();
if ( isnanf( z[ i%len ] ) ) {
b.fail( 'should not return NaN' );
}
b.pass( 'benchmark finished' );
b.end();
}
}
// MAIN //
/**
* Main execution sequence.
*
* @private
*/
function main() {
var len;
var min;
var max;
var f;
var i;
min = 1; // 10^min
max = 6; // 10^max
for ( i = min; i <= max; i++ ) {
len = pow( 10, i );
f = createBenchmark( len );
bench( pkg+':len='+len, f );
}
}
main();
```
|
The Roa–Hønefoss Line (, formerly ) is a long, single track railway line between Roa and Hønefoss in Norway. At Roa Station, the line connects to the Gjøvik Line, while at Hønefoss Station, it connects to the Randsfjorden Line and the Bergen Line. The line runs through Innlandet and Viken counties and allowed the Bergen Line access to Oslo at Oslo East Station.
The Line was built by the Norwegian State Railways (NSB) and opened on 1 December 1909, along with the last part of the Bergen Line. The line was electrified in 1961. Until 1989, nearly all Oslo–Bergen trains used the line to terminate at Oslo East Station. It was also possible to reach Oslo from Hønefoss via the Randsfjord Line, albeit terminating at Oslo West Station. NSB also ran a local service between Hønefoss and Oslo along the Roa–Hønefoss Line. Oslo–Bergen trains ran via the Randsfjord Line after 1989 and local train services have been terminated. However, the line remains in use for freight trains along the Oslo–Bergen route.
Route
The line starts at Roa Station, which is also located on the Gjøvik Line and is from Oslo Central Station (Oslo S). Located at above mean sea level, Roa has the highest elevation on the whole line. The line runs first west, then south to Jevnaker Station, passing Kalvsjø Station, Grindvoll Station, Gunstad Station, Bjellum Tunnel and Kvellsrud Station, before reaching Jevnaker, which is from Roa. For a long time, Jevnaker had two separate stations located at each end of the town, with the other station serving as the terminus of the Randsfjord Line.
The line then runs south-west, past Bergerfoss and Kistefoss, before reaching Viul. There, there is a branch to a lumber mill. After Viul, the line runs through two tunnels, long. At Hval, located from Roa, there was formerly a spur to a military camp. The line then runs over a bridge over Randselva before passing Hønen and a spur at Hønen and to a Goman bakery. Just before reaching Hønefoss Station, the line runs on a bridge over Begna. At Hønefoss, the Roa–Hønefoss Line and the Randsfjord Line come in from the east while the Randsfjord Line and the Bergen Line continue to the west. Hønefoss is from Oslo via Roa and via Drammen.
History
Hønefoss Station opened on 13 October 1868 as an intermediate station on the Randsfjord Line which connects Randsfjorden to Drammen. The initial proposals for the Bergen Line route went from Hønefoss via Sandvika to Oslo West Station (Oslo V). However, this was met with a combination of political opposition and technical restrictions. During the 1880s and 1890s, all lines that did not connect to Sweden were to be built with narrow gauge. The Drammen Line, which connected Sandvika to Oslo, was narrow gauge, as were the rest of the lines west of Oslo. During the planning of the Gjøvik Line (at the time known as the North Line), military considerations eventually led to the decision to build it with standard gauge. Eventually it was decided that the Bergen Line would also be built with standard gauge. However, to reach Oslo from Hønefoss, a longer route to connect to the Gjøvik Line would have to be built, allowing the line to connect to the more important Oslo East Station. The construction of the Roa–Hønefoss Line and the Bergen Line from Hønefoss to Taugevatn was passed by the Parliament of Norway on 2 June 1898.
The line was built by NSB as part of the Bergen Line project, for which construction across the mountain had commenced in 1895. Construction of the Roa–Hønefoss Line started in 1903. This section is relatively flat and was the easiest part of the project to build. The line was officially opened along with the section of the Bergen Line from Gulsvik to Hønefoss, by King Haakon VII on 27 November 1909. It was taken into ordinary use on 1 December. At the time the line opened, there were stations at Roa, Grindvoll, Jevnaker, Hval and Hønefoss.
To begin with, the line had a single through train from Oslo to Bergen, with an additional summer express—with a limited number of stops. In addition, there were two additional trains from Hønefoss to Oslo. From 1 May 1912, a night train was also introduced and the same year mixed passenger and freight trains were introduced from Ål on the Bergen Line to Oslo. A station was opened at Viul on 16 August 1915, and another at Kistefoss on 1 October. Because of economic impact of World War I, the night train services was reduced to only twice a week from 20 May 1917 until 7 June 1919. In 1930, new stations were established at Kalvsjø, Gunstad, Bergerfoss and Hønen. During World War II from 1940 to 1945, the frequency was reduced to no more than one train per day. During parts of 1940, the Oslo–Bergen line was instead run via the Drammen and Randsfjord Lines. However, two local trains were kept on the route from Hønefoss to Roa.
From 18 November 1945, the daily Oslo–Bergen trains again ran via Roa, while the local trains from Oslo to Hønefoss increased to three daily round trips. Three weekly night trains were introduced from 1946. From 2 January to 1 May 1947, there was four weekly express services from Oslo to Geilo on the Bergen Line. By 1950, the situation had normalized and there were daily day and night trains and three weekly express trains—the latter with no stops between Hønefoss and Oslo. Kvellsrud Station opened on 18 August 1952.
In the 1930s, it was decided that the Bergen Line was to be electrified. After the first section, from Bergen to Voss, was completed in 1954, the Gjøvik Line and the Roa–Hønefoss Line were the next to be electrified. The sections Oslo–Jaren and Roa–Hønefoss opened with electric traction on 1 February 1961. Automatic signaling was put into service on 10 December 1973 and automatic train stop was put into operation on 27 October 1987.
From 3 June 1984, the day train was moved to run via Drammen. Until 1989, the Roa–Hønefoss Line had four daily round trips with a local train from Hønefoss via Roa to Oslo, normally a Class 65 or Class 67 unit. From 1989, this was reduced to a single round trip, with a morning train from Hønefoss to Oslo and a return in the afternoon. Eventually this was taken over by a Class 69 unit and by the late 1990s taken out of service. The Roa–Hønefoss Line remains a pure freight track for long-haul freight trains on the Bergen Line. After the opening of the Oslo Tunnel and Oslo Central Station in 1989, passenger trains run via Drammen; however, the Roa–Hønefoss Line is used as a reserve line for passenger trains when the Drammen Line or Randsfjord Line is out of service.
References
Bibliography
Railway lines in Innlandet
Railway lines in Viken
Bergen Line
Railway lines opened in 1909
Electric railways in Norway
1909 establishments in Norway
Standard gauge railways in Norway
|
House of 9 is a 2004 psychological horror film directed by Steven R. Monroe and starring Dennis Hopper and Kelly Brook. It follows nine strangers who have been abducted and locked inside a house. A mysterious voice called The Watcher (voiced by Jim Carter) tells them that they are to play a game: the last person alive can leave the house and win five million dollars. The film is presented with "live feeds" from hidden surveillance cameras, showing the nine people turning from cooperative escape attempts to a killing fest.
House of 9 premiered at the Cannes Film Festival on 20 May 2004.
Plot
A young woman, Lea, is kidnapped and awakens in a mansion-like house. She leaves her room and finds other people who are still asleep. Attempting to flee, she finds that all of the exits are sealed and panics, resulting in her fainting. Lea is awakened by a priest, and finds that the other seven people have awoken too. A voice comes over a speaker announcing that they are to play a game. The voice states that they must kill one another until only one is left, after which the survivor will go free and be compensated with five million dollars.
The players attempt to escape by breaking down the door using a dining table as a battering ram and digging through the basement, but to no avail. A sound from the kitchen reveals a dumbwaiter with food. In the dining room, the players introduce themselves: Father Duffy is a priest, Jay is a cop with a pistol, Lea is a dancer, Claire is a tennis player, Francis is a musician and Cynthia is his wife, Al B is an ambitious rapper, Shona is a drug addict, and Max is a fashion designer. Shona's ankle bracelet monitor gives some players hope that this may attract outside help. After dinner, the players choose who sleep together in the bedrooms with Cynthia and Francis taking one, Father Duffy getting his own while the others share.
The next morning, an unknown assailant sneaks in and attacks Jay. The stranger flees and Jay and Lea assemble everyone in the hallway where they all argue. Afterwards, Jay confines in Lea that she and Duffy are the only ones he trusts. Soon the group hear noise from outside and try to get their attention, but fail. Disheartened, they open the wine cabinet and get drunk, except for Duffy, Lea, and Jay. When Francis returns, he finds Al B making advances on Cynthia, causing the two men fight. When Cynthia intervenes, Al B pushes her and knocks her head against the stone railing, killing her. As punishment, Jay locks Al B in a room using a pipe to hold the door shut. Later during dinner, Al B screams to be let out. Duffy brings him food, but he escapes and savagely beats Jay with the pipe. Everyone, including Al B, becomes visibly distressed by this. With his dying breath, Jay gives Duffy his gun.
The next day, the six remaining players find food and wine. Francis visits Al B, who is remorseful over what happened with his wife while the former apparently forgives him. Later Father Duffy and Lea find Al B hanging from the ceiling, apparently having killed himself. After another group argument, Francis retreats and show signs of a mental breakdown. Shona and Claire argue in their room, escalating to Claire stabbing Shona with a cork screw. Meanwhile, Francis visits Lea in her room in her bathroom, ripping the light fixture from the wall and throwing it into the sink, electrocuting her. Father Duffy finds Claire, who claims it was self defense. He leaves to look for Lea and finds her on the bathroom floor. Claire goes to get food and finds Max and offers to form an alliance with him.
Francis attacks Father Duffy, but the priest shoots him in the stomach. Father Duffy returns to the foyer and sees Max strangling Claire, causing him to shoot Max in the head. Francis stabs the Father and retrieves the gun, killing Claire and then Father Duffy. Lea, who survived the electrocution, his I a bathroom and discovers the glass shards that Francis had hidden earlier. Francis discovers that Lea is alive and goes after her. As he toys with her, Lea stabs him in the ensuing struggle and runs to a balcony. Francis charges at her and they flip over the railing. Lea lands on top of Francis, but when she gets up, she realizes the shard had pierced Francis in the heart as he dies.
The front door opens, revealing a bright light and a bag on the floor: presumably with the money. She walks through the corridor to another part of the house, finding four others with bags and visibly shaken. The film ends with a fearful Lea realizes that the game is not over.
Alternate endings
The DVD includes an alternate ending.
As Lea steps into the light, she is knocked unconscious and wakes up in her apartment bed. She finds the bag containing money, a small TV set and a videotape. She plays the tape and sees the camera footage of the foyer with the remaining bodies having been removed and the house cleaned up. The Watcher says she has now become a member of the world's most exclusive survival club. The picture then goes to the bedrooms where there are nine new people passed out on the floor. Lea stares at the screen in shock as The Watcher says, "Happy viewing..."
Cast
Dennis Hopper - Father Michael Duffy
Kelly Brook - Lea
Hippolyte Girardot - Francis
Susie Amy - Claire Leevy
Morven Christie - Shona
Peter Capaldi - Max Roy
Asher D - Al B
Raffaello Degruttola- Jay
Julienne Davis - Cynthia
Jim Carter - The Watcher (voice)
Production
Filming for House of 9 took place in Romania.
Reception
House of 9 received mixed reviews from critics and audiences. An especially harsh review from the web site Film Verdicts called the film "preposterous pretentiousness". Dread Central said, "House of 9 does what it sets out to do, and that’s to deliver to its viewers a movie that sucks you in until you cannot breathe." DVD Talk said, "See it for the hotties, for the nasty kill scenes, and for the always-insane Dennis Hopper at his most adorably weird." The Hartford Courant reviewed the film, noting that "As with "Saw II'' (and almost any slasher movie these days), the killings become tedious, something to be endured so you can see how it ends."
Home media
The DVD was released on 14 February 2006 in the US.
References
External links
2004 films
2004 psychological thriller films
British mystery thriller films
British psychological thriller films
Films about death games
English-language French films
English-language German films
English-language Romanian films
Films about kidnapping
Films about murder
Films directed by Steven R. Monroe
Films shot in Bucharest
French mystery films
French psychological thriller films
2000s French-language films
German mystery films
German psychological thriller films
2000s mystery thriller films
Romanian thriller films
2000s British films
2000s French films
2000s German films
|
```objective-c
//===-- EHScopeStack.h - Stack for cleanup IR generation --------*- C++ -*-===//
//
// See path_to_url for license information.
//
//===your_sha256_hash------===//
//
// These classes should be the minimum interface required for other parts of
// CodeGen to emit cleanups. The implementation is in CGCleanup.cpp and other
// implemenentation details that are not widely needed are in CGCleanup.h.
//
//===your_sha256_hash------===//
#ifndef LLVM_CLANG_LIB_CODEGEN_EHSCOPESTACK_H
#define LLVM_CLANG_LIB_CODEGEN_EHSCOPESTACK_H
#include "clang/Basic/LLVM.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/IR/BasicBlock.h"
#include "llvm/IR/Instructions.h"
#include "llvm/IR/Value.h"
namespace clang {
namespace CodeGen {
class CodeGenFunction;
/// A branch fixup. These are required when emitting a goto to a
/// label which hasn't been emitted yet. The goto is optimistically
/// emitted as a branch to the basic block for the label, and (if it
/// occurs in a scope with non-trivial cleanups) a fixup is added to
/// the innermost cleanup. When a (normal) cleanup is popped, any
/// unresolved fixups in that scope are threaded through the cleanup.
struct BranchFixup {
/// The block containing the terminator which needs to be modified
/// into a switch if this fixup is resolved into the current scope.
/// If null, LatestBranch points directly to the destination.
llvm::BasicBlock *OptimisticBranchBlock;
/// The ultimate destination of the branch.
///
/// This can be set to null to indicate that this fixup was
/// successfully resolved.
llvm::BasicBlock *Destination;
/// The destination index value.
unsigned DestinationIndex;
/// The initial branch of the fixup.
llvm::BranchInst *InitialBranch;
};
template <class T> struct InvariantValue {
typedef T type;
typedef T saved_type;
static bool needsSaving(type value) { return false; }
static saved_type save(CodeGenFunction &CGF, type value) { return value; }
static type restore(CodeGenFunction &CGF, saved_type value) { return value; }
};
/// A metaprogramming class for ensuring that a value will dominate an
/// arbitrary position in a function.
template <class T> struct DominatingValue : InvariantValue<T> {};
template <class T, bool mightBeInstruction =
std::is_base_of<llvm::Value, T>::value &&
!std::is_base_of<llvm::Constant, T>::value &&
!std::is_base_of<llvm::BasicBlock, T>::value>
struct DominatingPointer;
template <class T> struct DominatingPointer<T,false> : InvariantValue<T*> {};
// template <class T> struct DominatingPointer<T,true> at end of file
template <class T> struct DominatingValue<T*> : DominatingPointer<T> {};
enum CleanupKind : unsigned {
/// Denotes a cleanup that should run when a scope is exited using exceptional
/// control flow (a throw statement leading to stack unwinding, ).
EHCleanup = 0x1,
/// Denotes a cleanup that should run when a scope is exited using normal
/// control flow (falling off the end of the scope, return, goto, ...).
NormalCleanup = 0x2,
NormalAndEHCleanup = EHCleanup | NormalCleanup,
LifetimeMarker = 0x8,
NormalEHLifetimeMarker = LifetimeMarker | NormalAndEHCleanup,
};
/// A stack of scopes which respond to exceptions, including cleanups
/// and catch blocks.
class EHScopeStack {
public:
/* Should switch to alignof(uint64_t) instead of 8, when EHCleanupScope can */
enum { ScopeStackAlignment = 8 };
/// A saved depth on the scope stack. This is necessary because
/// pushing scopes onto the stack invalidates iterators.
class stable_iterator {
friend class EHScopeStack;
/// Offset from StartOfData to EndOfBuffer.
ptrdiff_t Size;
stable_iterator(ptrdiff_t Size) : Size(Size) {}
public:
static stable_iterator invalid() { return stable_iterator(-1); }
stable_iterator() : Size(-1) {}
bool isValid() const { return Size >= 0; }
/// Returns true if this scope encloses I.
/// Returns false if I is invalid.
/// This scope must be valid.
bool encloses(stable_iterator I) const { return Size <= I.Size; }
/// Returns true if this scope strictly encloses I: that is,
/// if it encloses I and is not I.
/// Returns false is I is invalid.
/// This scope must be valid.
bool strictlyEncloses(stable_iterator I) const { return Size < I.Size; }
friend bool operator==(stable_iterator A, stable_iterator B) {
return A.Size == B.Size;
}
friend bool operator!=(stable_iterator A, stable_iterator B) {
return A.Size != B.Size;
}
};
/// Information for lazily generating a cleanup. Subclasses must be
/// POD-like: cleanups will not be destructed, and they will be
/// allocated on the cleanup stack and freely copied and moved
/// around.
///
/// Cleanup implementations should generally be declared in an
/// anonymous namespace.
class Cleanup {
// Anchor the construction vtable.
virtual void anchor();
protected:
~Cleanup() = default;
public:
Cleanup(const Cleanup &) = default;
Cleanup(Cleanup &&) {}
Cleanup() = default;
virtual bool isRedundantBeforeReturn() { return false; }
/// Generation flags.
class Flags {
enum {
F_IsForEH = 0x1,
F_IsNormalCleanupKind = 0x2,
F_IsEHCleanupKind = 0x4,
F_HasExitSwitch = 0x8,
};
unsigned flags;
public:
Flags() : flags(0) {}
/// isForEH - true if the current emission is for an EH cleanup.
bool isForEHCleanup() const { return flags & F_IsForEH; }
bool isForNormalCleanup() const { return !isForEHCleanup(); }
void setIsForEHCleanup() { flags |= F_IsForEH; }
bool isNormalCleanupKind() const { return flags & F_IsNormalCleanupKind; }
void setIsNormalCleanupKind() { flags |= F_IsNormalCleanupKind; }
/// isEHCleanupKind - true if the cleanup was pushed as an EH
/// cleanup.
bool isEHCleanupKind() const { return flags & F_IsEHCleanupKind; }
void setIsEHCleanupKind() { flags |= F_IsEHCleanupKind; }
bool hasExitSwitch() const { return flags & F_HasExitSwitch; }
void setHasExitSwitch() { flags |= F_HasExitSwitch; }
};
/// Emit the cleanup. For normal cleanups, this is run in the
/// same EH context as when the cleanup was pushed, i.e. the
/// immediately-enclosing context of the cleanup scope. For
/// EH cleanups, this is run in a terminate context.
///
// \param flags cleanup kind.
virtual void Emit(CodeGenFunction &CGF, Flags flags) = 0;
};
/// ConditionalCleanup stores the saved form of its parameters,
/// then restores them and performs the cleanup.
template <class T, class... As>
class ConditionalCleanup final : public Cleanup {
typedef std::tuple<typename DominatingValue<As>::saved_type...> SavedTuple;
SavedTuple Saved;
template <std::size_t... Is>
T restore(CodeGenFunction &CGF, std::index_sequence<Is...>) {
// It's important that the restores are emitted in order. The braced init
// list guarantees that.
return T{DominatingValue<As>::restore(CGF, std::get<Is>(Saved))...};
}
void Emit(CodeGenFunction &CGF, Flags flags) override {
restore(CGF, std::index_sequence_for<As...>()).Emit(CGF, flags);
}
public:
ConditionalCleanup(typename DominatingValue<As>::saved_type... A)
: Saved(A...) {}
ConditionalCleanup(SavedTuple Tuple) : Saved(std::move(Tuple)) {}
};
private:
// The implementation for this class is in CGException.h and
// CGException.cpp; the definition is here because it's used as a
// member of CodeGenFunction.
/// The start of the scope-stack buffer, i.e. the allocated pointer
/// for the buffer. All of these pointers are either simultaneously
/// null or simultaneously valid.
char *StartOfBuffer;
/// The end of the buffer.
char *EndOfBuffer;
/// The first valid entry in the buffer.
char *StartOfData;
/// The innermost normal cleanup on the stack.
stable_iterator InnermostNormalCleanup;
/// The innermost EH scope on the stack.
stable_iterator InnermostEHScope;
/// The CGF this Stack belong to
CodeGenFunction* CGF;
/// The current set of branch fixups. A branch fixup is a jump to
/// an as-yet unemitted label, i.e. a label for which we don't yet
/// know the EH stack depth. Whenever we pop a cleanup, we have
/// to thread all the current branch fixups through it.
///
/// Fixups are recorded as the Use of the respective branch or
/// switch statement. The use points to the final destination.
/// When popping out of a cleanup, these uses are threaded through
/// the cleanup and adjusted to point to the new cleanup.
///
/// Note that branches are allowed to jump into protected scopes
/// in certain situations; e.g. the following code is legal:
/// struct A { ~A(); }; // trivial ctor, non-trivial dtor
/// goto foo;
/// A a;
/// foo:
/// bar();
SmallVector<BranchFixup, 8> BranchFixups;
char *allocate(size_t Size);
void deallocate(size_t Size);
void *pushCleanup(CleanupKind K, size_t DataSize);
public:
EHScopeStack()
: StartOfBuffer(nullptr), EndOfBuffer(nullptr), StartOfData(nullptr),
InnermostNormalCleanup(stable_end()), InnermostEHScope(stable_end()),
CGF(nullptr) {}
~EHScopeStack() { delete[] StartOfBuffer; }
/// Push a lazily-created cleanup on the stack.
template <class T, class... As> void pushCleanup(CleanupKind Kind, As... A) {
static_assert(alignof(T) <= ScopeStackAlignment,
"Cleanup's alignment is too large.");
void *Buffer = pushCleanup(Kind, sizeof(T));
Cleanup *Obj = new (Buffer) T(A...);
(void) Obj;
}
/// Push a lazily-created cleanup on the stack. Tuple version.
template <class T, class... As>
void pushCleanupTuple(CleanupKind Kind, std::tuple<As...> A) {
static_assert(alignof(T) <= ScopeStackAlignment,
"Cleanup's alignment is too large.");
void *Buffer = pushCleanup(Kind, sizeof(T));
Cleanup *Obj = new (Buffer) T(std::move(A));
(void) Obj;
}
// Feel free to add more variants of the following:
/// Push a cleanup with non-constant storage requirements on the
/// stack. The cleanup type must provide an additional static method:
/// static size_t getExtraSize(size_t);
/// The argument to this method will be the value N, which will also
/// be passed as the first argument to the constructor.
///
/// The data stored in the extra storage must obey the same
/// restrictions as normal cleanup member data.
///
/// The pointer returned from this method is valid until the cleanup
/// stack is modified.
template <class T, class... As>
T *pushCleanupWithExtra(CleanupKind Kind, size_t N, As... A) {
static_assert(alignof(T) <= ScopeStackAlignment,
"Cleanup's alignment is too large.");
void *Buffer = pushCleanup(Kind, sizeof(T) + T::getExtraSize(N));
return new (Buffer) T(N, A...);
}
void pushCopyOfCleanup(CleanupKind Kind, const void *Cleanup, size_t Size) {
void *Buffer = pushCleanup(Kind, Size);
std::memcpy(Buffer, Cleanup, Size);
}
void setCGF(CodeGenFunction *inCGF) { CGF = inCGF; }
/// Pops a cleanup scope off the stack. This is private to CGCleanup.cpp.
void popCleanup();
/// Push a set of catch handlers on the stack. The catch is
/// uninitialized and will need to have the given number of handlers
/// set on it.
class EHCatchScope *pushCatch(unsigned NumHandlers);
/// Pops a catch scope off the stack. This is private to CGException.cpp.
void popCatch();
/// Push an exceptions filter on the stack.
class EHFilterScope *pushFilter(unsigned NumFilters);
/// Pops an exceptions filter off the stack.
void popFilter();
/// Push a terminate handler on the stack.
void pushTerminate();
/// Pops a terminate handler off the stack.
void popTerminate();
// Returns true iff the current scope is either empty or contains only
// lifetime markers, i.e. no real cleanup code
bool containsOnlyLifetimeMarkers(stable_iterator Old) const;
/// Determines whether the exception-scopes stack is empty.
bool empty() const { return StartOfData == EndOfBuffer; }
bool requiresLandingPad() const;
/// Determines whether there are any normal cleanups on the stack.
bool hasNormalCleanups() const {
return InnermostNormalCleanup != stable_end();
}
/// Returns the innermost normal cleanup on the stack, or
/// stable_end() if there are no normal cleanups.
stable_iterator getInnermostNormalCleanup() const {
return InnermostNormalCleanup;
}
stable_iterator getInnermostActiveNormalCleanup() const;
stable_iterator getInnermostEHScope() const {
return InnermostEHScope;
}
/// An unstable reference to a scope-stack depth. Invalidated by
/// pushes but not pops.
class iterator;
/// Returns an iterator pointing to the innermost EH scope.
iterator begin() const;
/// Returns an iterator pointing to the outermost EH scope.
iterator end() const;
/// Create a stable reference to the top of the EH stack. The
/// returned reference is valid until that scope is popped off the
/// stack.
stable_iterator stable_begin() const {
return stable_iterator(EndOfBuffer - StartOfData);
}
/// Create a stable reference to the bottom of the EH stack.
static stable_iterator stable_end() {
return stable_iterator(0);
}
/// Translates an iterator into a stable_iterator.
stable_iterator stabilize(iterator it) const;
/// Turn a stable reference to a scope depth into a unstable pointer
/// to the EH stack.
iterator find(stable_iterator save) const;
/// Add a branch fixup to the current cleanup scope.
BranchFixup &addBranchFixup() {
assert(hasNormalCleanups() && "adding fixup in scope without cleanups");
BranchFixups.push_back(BranchFixup());
return BranchFixups.back();
}
unsigned getNumBranchFixups() const { return BranchFixups.size(); }
BranchFixup &getBranchFixup(unsigned I) {
assert(I < getNumBranchFixups());
return BranchFixups[I];
}
/// Pops lazily-removed fixups from the end of the list. This
/// should only be called by procedures which have just popped a
/// cleanup or resolved one or more fixups.
void popNullFixups();
/// Clears the branch-fixups list. This should only be called by
/// ResolveAllBranchFixups.
void clearFixups() { BranchFixups.clear(); }
};
} // namespace CodeGen
} // namespace clang
#endif
```
|
Thomas Mario McDade (July 2, 1907 – March 2, 1996) was an American lawyer, FBI agent, business executive, and writer. McDade was known as the last living retired FBI agent and lawman from the Dillinger Squad.
Biography
McDade was born in Brooklyn, New York City on July 2, 1907. He attended the City College of New York, where he studied accounting. He then studied law at the recently opened St. John's University School of Law, where he earned his LL.B. degree (cum laude) in 1931 and an LL.M. degree in 1932.
After working briefly as a law clerk and legal editor, McDade applied for a position in the Bureau of Investigation (soon renamed the Federal Bureau of Investigation). He worked as an FBI special agent for four years, from 1934 to 1938, specializing in cases involving bank robbery and kidnapping. He was involved in several high-profile cases, including the shoot-outs that killed George "Baby Face" Nelson in 1934 and Kate "Ma" Barker and Fred Barker in 1935. He later moved to a supervisory position before leaving the FBI in 1938.
McDade then spent some time in private law practice before joining the United States Army in 1942. He spent two years in the South Pacific theater during World War II, earning a Bronze Star and attaining the rank of lieutenant colonel. In 1946, McDade became an accounting manager for the General Foods Corporation in New York. He was promoted to Assistant Controller in 1950 and to Controller in 1953. He retired in 1972. He died in Southbury, Connecticut on March 2, 1996, at the age of 88.
The Annals of Murder
In 1961, McDade published The Annals of Murder, a true crime encyclopedia in which he summarized hundreds of early publications about homicides in the United States before 1900. The work was "of towering importance" in its field, and a New Yorker writer later called it "the indispensable guide to Early American murder." Book dealers in the true-crime area would sometimes seek to emphasize a publication's rarity by describing it as "not in McDade." A dealer once made such a comment to the author himself, who pointedly responded, "I'm McDade."
McDade also published more than 100 articles in a wide variety of publications, most of which also dealt with crimes and criminals.
Other interests
A devotee of the Sherlock Holmes stories by Arthur Conan Doyle, McDade became a member of The Baker Street Irregulars in 1957. He was a regular attendee of the group's annual dinner, and toasted Pola Stout (the wife of BSI member Rex Stout) as The Woman in 1966. He also contributed several articles to The Baker Street Journal.
FBI Diary
After McDade's death, it was revealed that he kept a daily diary during his four years with the FBI. In 2013, McDade's family donated the diary to the National Law Enforcement Museum in Washington, D.C. A complete transcript of the diary has been published online.
References
1907 births
1996 deaths
20th-century American writers
City College of New York alumni
St. John's University School of Law alumni
New York (state) lawyers
American accountants
Federal Bureau of Investigation
20th-century American lawyers
|
```css
/* Use Raleway font */
@import url(path_to_url
body { font-family: 'Raleway';}
h1, h2, h3 {
font-family: 'Raleway';
font-weight: 400;
}
/* Font and color for code highlighting */
.remark-code, .remark-inline-code { font-family: 'Inconsolata', monospace; }
.remark-code-line-highlighted { background-color: #ffff88; }
```
|
Veshmeh Sara (, also Romanized as Veshmeh Sarā) is a village in Howmeh Rural District of the Central District of Masal County, Gilan province, Iran.
At the 2006 National Census, its population was 1,213 in 308 households. The following census in 2011 counted 1,386 people in 408 households. The latest census in 2016 showed a population of 1,186 people in 395 households. It was the largest village in its rural district.
References
Masal County
Populated places in Gilan Province
Populated places in Masal County
|
```objective-c
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
/*
* The following is auto-generated. Do not manually edit. See scripts/loops.js.
*/
#ifndef STDLIB_NDARRAY_BASE_NULLARY_C_AS_B_H
#define STDLIB_NDARRAY_BASE_NULLARY_C_AS_B_H
#include "stdlib/ndarray/ctor.h"
#include <stdint.h>
/*
* If C++, prevent name mangling so that the compiler emits a binary file having undecorated names, thus mirroring the behavior of a C compiler.
*/
#ifdef __cplusplus
extern "C" {
#endif
/**
* Applies a nullary callback and assigns results to elements in an output ndarray.
*/
int8_t stdlib_ndarray_c_as_b( struct ndarray *arrays[], void *fcn );
/**
* Applies a nullary callback and assigns results to elements in a zero-dimensional output ndarray.
*/
int8_t stdlib_ndarray_c_as_b_0d( struct ndarray *arrays[], void *fcn );
/**
* Applies a nullary callback and assigns results to elements in a one-dimensional output ndarray.
*/
int8_t stdlib_ndarray_c_as_b_1d( struct ndarray *arrays[], void *fcn );
/**
* Applies a nullary callback and assigns results to elements in a two-dimensional output ndarray.
*/
int8_t stdlib_ndarray_c_as_b_2d( struct ndarray *arrays[], void *fcn );
/**
* Applies a nullary callback and assigns results to elements in a two-dimensional output ndarray.
*/
int8_t stdlib_ndarray_c_as_b_2d_blocked( struct ndarray *arrays[], void *fcn );
/**
* Applies a nullary callback and assigns results to elements in a three-dimensional output ndarray.
*/
int8_t stdlib_ndarray_c_as_b_3d( struct ndarray *arrays[], void *fcn );
/**
* Applies a nullary callback and assigns results to elements in a three-dimensional output ndarray.
*/
int8_t stdlib_ndarray_c_as_b_3d_blocked( struct ndarray *arrays[], void *fcn );
/**
* Applies a nullary callback and assigns results to elements in a four-dimensional output ndarray.
*/
int8_t stdlib_ndarray_c_as_b_4d( struct ndarray *arrays[], void *fcn );
/**
* Applies a nullary callback and assigns results to elements in a four-dimensional output ndarray.
*/
int8_t stdlib_ndarray_c_as_b_4d_blocked( struct ndarray *arrays[], void *fcn );
/**
* Applies a nullary callback and assigns results to elements in a five-dimensional output ndarray.
*/
int8_t stdlib_ndarray_c_as_b_5d( struct ndarray *arrays[], void *fcn );
/**
* Applies a nullary callback and assigns results to elements in a five-dimensional output ndarray.
*/
int8_t stdlib_ndarray_c_as_b_5d_blocked( struct ndarray *arrays[], void *fcn );
/**
* Applies a nullary callback and assigns results to elements in a six-dimensional output ndarray.
*/
int8_t stdlib_ndarray_c_as_b_6d( struct ndarray *arrays[], void *fcn );
/**
* Applies a nullary callback and assigns results to elements in a six-dimensional output ndarray.
*/
int8_t stdlib_ndarray_c_as_b_6d_blocked( struct ndarray *arrays[], void *fcn );
/**
* Applies a nullary callback and assigns results to elements in a seven-dimensional output ndarray.
*/
int8_t stdlib_ndarray_c_as_b_7d( struct ndarray *arrays[], void *fcn );
/**
* Applies a nullary callback and assigns results to elements in a seven-dimensional output ndarray.
*/
int8_t stdlib_ndarray_c_as_b_7d_blocked( struct ndarray *arrays[], void *fcn );
/**
* Applies a nullary callback and assigns results to elements in an eight-dimensional output ndarray.
*/
int8_t stdlib_ndarray_c_as_b_8d( struct ndarray *arrays[], void *fcn );
/**
* Applies a nullary callback and assigns results to elements in an eight-dimensional output ndarray.
*/
int8_t stdlib_ndarray_c_as_b_8d_blocked( struct ndarray *arrays[], void *fcn );
/**
* Applies a nullary callback and assigns results to elements in a nine-dimensional output ndarray.
*/
int8_t stdlib_ndarray_c_as_b_9d( struct ndarray *arrays[], void *fcn );
/**
* Applies a nullary callback and assigns results to elements in a nine-dimensional output ndarray.
*/
int8_t stdlib_ndarray_c_as_b_9d_blocked( struct ndarray *arrays[], void *fcn );
/**
* Applies a nullary callback and assigns results to elements in a ten-dimensional output ndarray.
*/
int8_t stdlib_ndarray_c_as_b_10d( struct ndarray *arrays[], void *fcn );
/**
* Applies a nullary callback and assigns results to elements in a ten-dimensional output ndarray.
*/
int8_t stdlib_ndarray_c_as_b_10d_blocked( struct ndarray *arrays[], void *fcn );
/**
* Applies a nullary callback and assigns results to elements in an n-dimensional output ndarray.
*/
int8_t stdlib_ndarray_c_as_b_nd( struct ndarray *arrays[], void *fcn );
#ifdef __cplusplus
}
#endif
#endif // !STDLIB_NDARRAY_BASE_NULLARY_C_AS_B_H
```
|
```xml
<dict>
<key>LayoutID</key>
<integer>36</integer>
<key>PathMapRef</key>
<array>
<dict>
<key>CodecID</key>
<array>
<integer>283902517</integer>
</array>
<key>Headphone</key>
<dict/>
<key>Inputs</key>
<array>
<string>Mic</string>
<string>LineIn</string>
</array>
<key>IntSpeaker</key>
<dict>
<key>MuteGPIO</key>
<integer>0</integer>
<key>SignalProcessing</key>
<dict>
<key>SoftwareDSP</key>
<dict>
<key>DspFunction0</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>0</integer>
<key>DspFuncName</key>
<string>DspNoiseReduction</string>
<key>DspFuncProcessingIndex</key>
<integer>0</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>0</integer>
<key>4</key>
<integer>-1063256063</integer>
<key>5</key>
<data>O7qJwvAsd8IxFYLCNC+Iwgh8h8JYT3zCTGxtwjCQbMLsb3/C58KIwmIAjcKqEZTCM22Xwr5/k8L6Q5DCUXiPwhlqksKOQ5TCQS2XwkCYnMLSmqPCbK+your_sha256_hashqwvxyqcLWr6XCdkajwulQpMJs1afCbmCqwqbpqcIaSKrCSrmpwjv+p8KjIqjCVkOowh9WqMLun6nCudimwvISp8K686rC+your_sha256_hash8GswgJLr8Ku2a/your_sha256_hashCQGK1woYFtcIw7LHCOMuxwiKZs8K8YrXC6nO4ws5cu8KCa73CJjG+wqekvMK9RLnC4/a2wuKBt8Jyyour_sha512_hash/Rwhmf0cImvtPClErXwmrF18JUfdvCNi7fwty43cL+WdvCuqrawiIL3cKCR+HCYPDnwqQ67MLYserCshHowl7L6MK2guzCsvrvwu4o8cJyfv7C</data>
</dict>
<key>PatchbayInfo</key>
<dict/>
</dict>
<key>DspFunction1</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>1</integer>
<key>DspFuncName</key>
<string>DspEqualization32</string>
<key>DspFuncProcessingIndex</key>
<integer>1</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>9</key>
<integer>0</integer>
<key>Filter</key>
<array>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>0</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>1</integer>
<key>6</key>
<integer>1120623594</integer>
<key>7</key>
<integer>1060439283</integer>
<key>8</key>
<integer>-1069504319</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>3</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1134130816</integer>
<key>7</key>
<integer>1068239080</integer>
<key>8</key>
<integer>-1073964333</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>4</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1143149396</integer>
<key>7</key>
<integer>1069838081</integer>
<key>8</key>
<integer>-1072785033</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>5</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1161109679</integer>
<key>7</key>
<integer>1093706804</integer>
<key>8</key>
<integer>-1069580896</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>7</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1138536183</integer>
<key>7</key>
<integer>1094714319</integer>
<key>8</key>
<integer>-1069046873</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>9</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1134823262</integer>
<key>7</key>
<integer>1088568216</integer>
<key>8</key>
<integer>-1073319056</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>10</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1140763936</integer>
<key>7</key>
<integer>1095878445</integer>
<key>8</key>
<integer>-1066910782</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>11</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1150711009</integer>
<key>7</key>
<integer>1082220668</integer>
<key>8</key>
<integer>-1072251010</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>22</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1169045837</integer>
<key>7</key>
<integer>1080998247</integer>
<key>8</key>
<integer>-1076100424</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>23</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>6</integer>
<key>6</key>
<integer>1174718752</integer>
<key>7</key>
<integer>1074226939</integer>
<key>8</key>
<integer>-1065842737</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>24</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1174256827</integer>
<key>7</key>
<integer>1091118565</integer>
<key>8</key>
<integer>-1065842737</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>0</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>1</integer>
<key>6</key>
<integer>1120623594</integer>
<key>7</key>
<integer>1060439283</integer>
<key>8</key>
<integer>-1069504319</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>3</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1134130816</integer>
<key>7</key>
<integer>1068239080</integer>
<key>8</key>
<integer>-1073964333</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>4</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1143149396</integer>
<key>7</key>
<integer>1069838081</integer>
<key>8</key>
<integer>-1072785033</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>5</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1161109679</integer>
<key>7</key>
<integer>1093706804</integer>
<key>8</key>
<integer>-1069580896</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>7</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1138536183</integer>
<key>7</key>
<integer>1094714319</integer>
<key>8</key>
<integer>-1069046873</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>9</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1134823262</integer>
<key>7</key>
<integer>1088568216</integer>
<key>8</key>
<integer>-1073319056</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>10</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1140763936</integer>
<key>7</key>
<integer>1095878445</integer>
<key>8</key>
<integer>-1066910782</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>11</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1150711009</integer>
<key>7</key>
<integer>1082220668</integer>
<key>8</key>
<integer>-1072251010</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>22</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1169045837</integer>
<key>7</key>
<integer>1080998247</integer>
<key>8</key>
<integer>-1076100424</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>23</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>6</integer>
<key>6</key>
<integer>1174718752</integer>
<key>7</key>
<integer>1074226939</integer>
<key>8</key>
<integer>-1065842737</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>24</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1174256827</integer>
<key>7</key>
<integer>1091118565</integer>
<key>8</key>
<integer>-1065842737</integer>
</dict>
</array>
</dict>
<key>PatchbayInfo</key>
<dict>
<key>InputPort0</key>
<dict>
<key>PortInstance</key>
<integer>0</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>0</integer>
<key>SourcePortIndex</key>
<integer>0</integer>
</dict>
<key>InputPort1</key>
<dict>
<key>PortInstance</key>
<integer>1</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>0</integer>
<key>SourcePortIndex</key>
<integer>1</integer>
</dict>
</dict>
</dict>
<key>DspFunction2</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>2</integer>
<key>DspFuncName</key>
<string>DspGainStage</string>
<key>DspFuncProcessingIndex</key>
<integer>2</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>2</key>
<integer>1065353216</integer>
<key>3</key>
<integer>1065353216</integer>
</dict>
<key>PatchbayInfo</key>
<dict>
<key>InputPort0</key>
<dict>
<key>PortInstance</key>
<integer>0</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>1</integer>
<key>SourcePortIndex</key>
<integer>0</integer>
</dict>
<key>InputPort1</key>
<dict>
<key>PortInstance</key>
<integer>1</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>1</integer>
<key>SourcePortIndex</key>
<integer>1</integer>
</dict>
</dict>
</dict>
<key>DspFunction3</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>3</integer>
<key>DspFuncName</key>
<string>DspClientGainAdjustStage</string>
<key>DspFuncProcessingIndex</key>
<integer>3</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>1</integer>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>1082130432</integer>
<key>4</key>
<integer>1103626240</integer>
<key>5</key>
<integer>1</integer>
<key>6</key>
<integer>1082130432</integer>
<key>7</key>
<integer>3</integer>
<key>8</key>
<integer>0</integer>
</dict>
<key>PatchbayInfo</key>
<dict>
<key>InputPort0</key>
<dict>
<key>PortInstance</key>
<integer>0</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>2</integer>
<key>SourcePortIndex</key>
<integer>0</integer>
</dict>
<key>InputPort1</key>
<dict>
<key>PortInstance</key>
<integer>1</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>2</integer>
<key>SourcePortIndex</key>
<integer>1</integer>
</dict>
</dict>
</dict>
</dict>
</dict>
</dict>
<key>LineIn</key>
<dict>
<key>MuteGPIO</key>
<integer>1342242841</integer>
<key>SignalProcessing</key>
<dict>
<key>SoftwareDSP</key>
<dict>
<key>DspFunction0</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>0</integer>
<key>DspFuncName</key>
<string>DspNoiseReduction</string>
<key>DspFuncProcessingIndex</key>
<integer>0</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>0</integer>
<key>4</key>
<integer>-1063256063</integer>
<key>5</key>
<data>O7qJwvAsd8IxFYLCNC+Iwgh8h8JYT3zCTGxtwjCQbMLsb3/C58KIwmIAjcKqEZTCM22Xwr5/k8L6Q5DCUXiPwhlqksKOQ5TCQS2XwkCYnMLSmqPCbK+your_sha256_hashqwvxyqcLWr6XCdkajwulQpMJs1afCbmCqwqbpqcIaSKrCSrmpwjv+p8KjIqjCVkOowh9WqMLun6nCudimwvISp8K686rC+your_sha256_hash8GswgJLr8Ku2a/your_sha256_hashCQGK1woYFtcIw7LHCOMuxwiKZs8K8YrXC6nO4ws5cu8KCa73CJjG+wqekvMK9RLnC4/a2wuKBt8Jyyour_sha512_hash/Rwhmf0cImvtPClErXwmrF18JUfdvCNi7fwty43cL+WdvCuqrawiIL3cKCR+HCYPDnwqQ67MLYserCshHowl7L6MK2guzCsvrvwu4o8cJyfv7C</data>
</dict>
<key>PatchbayInfo</key>
<dict/>
</dict>
<key>DspFunction1</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>1</integer>
<key>DspFuncName</key>
<string>DspEqualization32</string>
<key>DspFuncProcessingIndex</key>
<integer>1</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>9</key>
<integer>0</integer>
<key>Filter</key>
<array>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>0</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>1</integer>
<key>6</key>
<integer>1120623594</integer>
<key>7</key>
<integer>1060439283</integer>
<key>8</key>
<integer>-1069504319</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>3</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1134130816</integer>
<key>7</key>
<integer>1068239080</integer>
<key>8</key>
<integer>-1073964333</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>4</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1143149396</integer>
<key>7</key>
<integer>1069838081</integer>
<key>8</key>
<integer>-1072785033</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>5</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1161109679</integer>
<key>7</key>
<integer>1093706804</integer>
<key>8</key>
<integer>-1069580896</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>7</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1138536183</integer>
<key>7</key>
<integer>1094714319</integer>
<key>8</key>
<integer>-1069046873</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>9</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1134823262</integer>
<key>7</key>
<integer>1088568216</integer>
<key>8</key>
<integer>-1073319056</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>10</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1140763936</integer>
<key>7</key>
<integer>1095878445</integer>
<key>8</key>
<integer>-1066910782</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>11</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1150711009</integer>
<key>7</key>
<integer>1082220668</integer>
<key>8</key>
<integer>-1072251010</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>22</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1169045837</integer>
<key>7</key>
<integer>1080998247</integer>
<key>8</key>
<integer>-1076100424</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>23</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>6</integer>
<key>6</key>
<integer>1174718752</integer>
<key>7</key>
<integer>1074226939</integer>
<key>8</key>
<integer>-1065842737</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>24</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1174256827</integer>
<key>7</key>
<integer>1091118565</integer>
<key>8</key>
<integer>-1065842737</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>0</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>1</integer>
<key>6</key>
<integer>1120623594</integer>
<key>7</key>
<integer>1060439283</integer>
<key>8</key>
<integer>-1069504319</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>3</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1134130816</integer>
<key>7</key>
<integer>1068239080</integer>
<key>8</key>
<integer>-1073964333</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>4</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1143149396</integer>
<key>7</key>
<integer>1069838081</integer>
<key>8</key>
<integer>-1072785033</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>5</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1161109679</integer>
<key>7</key>
<integer>1093706804</integer>
<key>8</key>
<integer>-1069580896</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>7</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1138536183</integer>
<key>7</key>
<integer>1094714319</integer>
<key>8</key>
<integer>-1069046873</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>9</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1134823262</integer>
<key>7</key>
<integer>1088568216</integer>
<key>8</key>
<integer>-1073319056</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>10</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1140763936</integer>
<key>7</key>
<integer>1095878445</integer>
<key>8</key>
<integer>-1066910782</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>11</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1150711009</integer>
<key>7</key>
<integer>1082220668</integer>
<key>8</key>
<integer>-1072251010</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>22</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1169045837</integer>
<key>7</key>
<integer>1080998247</integer>
<key>8</key>
<integer>-1076100424</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>23</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>6</integer>
<key>6</key>
<integer>1174718752</integer>
<key>7</key>
<integer>1074226939</integer>
<key>8</key>
<integer>-1065842737</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>24</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1174256827</integer>
<key>7</key>
<integer>1091118565</integer>
<key>8</key>
<integer>-1065842737</integer>
</dict>
</array>
</dict>
<key>PatchbayInfo</key>
<dict>
<key>InputPort0</key>
<dict>
<key>PortInstance</key>
<integer>0</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>0</integer>
<key>SourcePortIndex</key>
<integer>0</integer>
</dict>
<key>InputPort1</key>
<dict>
<key>PortInstance</key>
<integer>1</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>0</integer>
<key>SourcePortIndex</key>
<integer>1</integer>
</dict>
</dict>
</dict>
<key>DspFunction2</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>2</integer>
<key>DspFuncName</key>
<string>DspGainStage</string>
<key>DspFuncProcessingIndex</key>
<integer>2</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>2</key>
<integer>1065353216</integer>
<key>3</key>
<integer>1065353216</integer>
</dict>
<key>PatchbayInfo</key>
<dict>
<key>InputPort0</key>
<dict>
<key>PortInstance</key>
<integer>0</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>1</integer>
<key>SourcePortIndex</key>
<integer>0</integer>
</dict>
<key>InputPort1</key>
<dict>
<key>PortInstance</key>
<integer>1</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>1</integer>
<key>SourcePortIndex</key>
<integer>1</integer>
</dict>
</dict>
</dict>
<key>DspFunction3</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>3</integer>
<key>DspFuncName</key>
<string>DspClientGainAdjustStage</string>
<key>DspFuncProcessingIndex</key>
<integer>3</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>1</integer>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>1082130432</integer>
<key>4</key>
<integer>1103626240</integer>
<key>5</key>
<integer>1</integer>
<key>6</key>
<integer>1082130432</integer>
<key>7</key>
<integer>3</integer>
<key>8</key>
<integer>0</integer>
</dict>
<key>PatchbayInfo</key>
<dict>
<key>InputPort0</key>
<dict>
<key>PortInstance</key>
<integer>0</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>2</integer>
<key>SourcePortIndex</key>
<integer>0</integer>
</dict>
<key>InputPort1</key>
<dict>
<key>PortInstance</key>
<integer>1</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>2</integer>
<key>SourcePortIndex</key>
<integer>1</integer>
</dict>
</dict>
</dict>
</dict>
</dict>
</dict>
<key>LineOut</key>
<dict/>
<key>Mic</key>
<dict>
<key>MuteGPIO</key>
<integer>1342242842</integer>
<key>SignalProcessing</key>
<dict>
<key>SoftwareDSP</key>
<dict>
<key>DspFunction0</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>0</integer>
<key>DspFuncName</key>
<string>DspNoiseReduction</string>
<key>DspFuncProcessingIndex</key>
<integer>0</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>0</integer>
<key>4</key>
<integer>-1063256063</integer>
<key>5</key>
<data>O7qJwvAsd8IxFYLCNC+Iwgh8h8JYT3zCTGxtwjCQbMLsb3/C58KIwmIAjcKqEZTCM22Xwr5/k8L6Q5DCUXiPwhlqksKOQ5TCQS2XwkCYnMLSmqPCbK+your_sha256_hashqwvxyqcLWr6XCdkajwulQpMJs1afCbmCqwqbpqcIaSKrCSrmpwjv+p8KjIqjCVkOowh9WqMLun6nCudimwvISp8K686rC+your_sha256_hash8GswgJLr8Ku2a/your_sha256_hashCQGK1woYFtcIw7LHCOMuxwiKZs8K8YrXC6nO4ws5cu8KCa73CJjG+wqekvMK9RLnC4/a2wuKBt8Jyyour_sha512_hash/Rwhmf0cImvtPClErXwmrF18JUfdvCNi7fwty43cL+WdvCuqrawiIL3cKCR+HCYPDnwqQ67MLYserCshHowl7L6MK2guzCsvrvwu4o8cJyfv7C</data>
</dict>
<key>PatchbayInfo</key>
<dict/>
</dict>
<key>DspFunction1</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>1</integer>
<key>DspFuncName</key>
<string>DspEqualization32</string>
<key>DspFuncProcessingIndex</key>
<integer>1</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>9</key>
<integer>0</integer>
<key>Filter</key>
<array>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>0</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>1</integer>
<key>6</key>
<integer>1120623594</integer>
<key>7</key>
<integer>1060439283</integer>
<key>8</key>
<integer>-1069504319</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>3</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1134130816</integer>
<key>7</key>
<integer>1068239080</integer>
<key>8</key>
<integer>-1073964333</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>4</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1143149396</integer>
<key>7</key>
<integer>1069838081</integer>
<key>8</key>
<integer>-1072785033</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>5</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1161109679</integer>
<key>7</key>
<integer>1093706804</integer>
<key>8</key>
<integer>-1069580896</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>7</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1138536183</integer>
<key>7</key>
<integer>1094714319</integer>
<key>8</key>
<integer>-1069046873</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>9</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1134823262</integer>
<key>7</key>
<integer>1088568216</integer>
<key>8</key>
<integer>-1073319056</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>10</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1140763936</integer>
<key>7</key>
<integer>1095878445</integer>
<key>8</key>
<integer>-1066910782</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>11</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1150711009</integer>
<key>7</key>
<integer>1082220668</integer>
<key>8</key>
<integer>-1072251010</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>22</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1169045837</integer>
<key>7</key>
<integer>1080998247</integer>
<key>8</key>
<integer>-1076100424</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>23</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>6</integer>
<key>6</key>
<integer>1174718752</integer>
<key>7</key>
<integer>1074226939</integer>
<key>8</key>
<integer>-1065842737</integer>
</dict>
<dict>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>24</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1174256827</integer>
<key>7</key>
<integer>1091118565</integer>
<key>8</key>
<integer>-1065842737</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>0</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>1</integer>
<key>6</key>
<integer>1120623594</integer>
<key>7</key>
<integer>1060439283</integer>
<key>8</key>
<integer>-1069504319</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>3</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1134130816</integer>
<key>7</key>
<integer>1068239080</integer>
<key>8</key>
<integer>-1073964333</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>4</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1143149396</integer>
<key>7</key>
<integer>1069838081</integer>
<key>8</key>
<integer>-1072785033</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>5</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1161109679</integer>
<key>7</key>
<integer>1093706804</integer>
<key>8</key>
<integer>-1069580896</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>7</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1138536183</integer>
<key>7</key>
<integer>1094714319</integer>
<key>8</key>
<integer>-1069046873</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>9</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1134823262</integer>
<key>7</key>
<integer>1088568216</integer>
<key>8</key>
<integer>-1073319056</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>10</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1140763936</integer>
<key>7</key>
<integer>1095878445</integer>
<key>8</key>
<integer>-1066910782</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>11</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1150711009</integer>
<key>7</key>
<integer>1082220668</integer>
<key>8</key>
<integer>-1072251010</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>22</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1169045837</integer>
<key>7</key>
<integer>1080998247</integer>
<key>8</key>
<integer>-1076100424</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>23</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>6</integer>
<key>6</key>
<integer>1174718752</integer>
<key>7</key>
<integer>1074226939</integer>
<key>8</key>
<integer>-1065842737</integer>
</dict>
<dict>
<key>2</key>
<integer>1</integer>
<key>3</key>
<integer>24</integer>
<key>4</key>
<integer>0</integer>
<key>5</key>
<integer>4</integer>
<key>6</key>
<integer>1174256827</integer>
<key>7</key>
<integer>1091118565</integer>
<key>8</key>
<integer>-1065842737</integer>
</dict>
</array>
</dict>
<key>PatchbayInfo</key>
<dict>
<key>InputPort0</key>
<dict>
<key>PortInstance</key>
<integer>0</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>0</integer>
<key>SourcePortIndex</key>
<integer>0</integer>
</dict>
<key>InputPort1</key>
<dict>
<key>PortInstance</key>
<integer>1</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>0</integer>
<key>SourcePortIndex</key>
<integer>1</integer>
</dict>
</dict>
</dict>
<key>DspFunction2</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>2</integer>
<key>DspFuncName</key>
<string>DspGainStage</string>
<key>DspFuncProcessingIndex</key>
<integer>2</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>0</integer>
<key>2</key>
<integer>1065353216</integer>
<key>3</key>
<integer>1065353216</integer>
</dict>
<key>PatchbayInfo</key>
<dict>
<key>InputPort0</key>
<dict>
<key>PortInstance</key>
<integer>0</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>1</integer>
<key>SourcePortIndex</key>
<integer>0</integer>
</dict>
<key>InputPort1</key>
<dict>
<key>PortInstance</key>
<integer>1</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>1</integer>
<key>SourcePortIndex</key>
<integer>1</integer>
</dict>
</dict>
</dict>
<key>DspFunction3</key>
<dict>
<key>FunctionInfo</key>
<dict>
<key>DspFuncInstance</key>
<integer>3</integer>
<key>DspFuncName</key>
<string>DspClientGainAdjustStage</string>
<key>DspFuncProcessingIndex</key>
<integer>3</integer>
</dict>
<key>ParameterInfo</key>
<dict>
<key>1</key>
<integer>1</integer>
<key>2</key>
<integer>0</integer>
<key>3</key>
<integer>1082130432</integer>
<key>4</key>
<integer>1103626240</integer>
<key>5</key>
<integer>1</integer>
<key>6</key>
<integer>1082130432</integer>
<key>7</key>
<integer>3</integer>
<key>8</key>
<integer>0</integer>
</dict>
<key>PatchbayInfo</key>
<dict>
<key>InputPort0</key>
<dict>
<key>PortInstance</key>
<integer>0</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>2</integer>
<key>SourcePortIndex</key>
<integer>0</integer>
</dict>
<key>InputPort1</key>
<dict>
<key>PortInstance</key>
<integer>1</integer>
<key>PortWidth</key>
<integer>1</integer>
<key>SourceFuncInstance</key>
<integer>2</integer>
<key>SourcePortIndex</key>
<integer>1</integer>
</dict>
</dict>
</dict>
</dict>
</dict>
</dict>
<key>Outputs</key>
<array>
<string>IntSpeaker</string>
<string>Headphone</string>
<string>LineOut</string>
</array>
<key>PathMapID</key>
<integer>36</integer>
</dict>
</array>
</dict>
```
|
Pat Collins is an American film critic and three-time Emmy winner for WWOR-TV. Collins was an entertainment editor and film critic for Good Morning America and the CBS Morning News and from 1972–1977, hosted the Pat Collins Show on WCBS-TV, for which she won two local Emmy Awards.
Personal life
Collins is married to William Sarnoff. She had previously been married to Joe Raposo from January 1976 until his death in 1989. They had two children together, as well as two children from his previous marriage. In 1983, she authored a book, How to Be a Really Nice Person. She announced her retirement from WWOR in November 2012.
References
Living people
21st-century American women
American film critics
American non-fiction writers
American women non-fiction writers
American women television journalists
American women film critics
Emmy Award winners
Place of birth missing (living people)
Year of birth missing (living people)
|
Cylapinae is a subfamily of plant bug. Bugs in this group tend to forage actively on fungus covered rotten logs in humid tropical forests.
Overview of genera
Adcylapocoris
Afrobothriomiris
Afrofulvius
Afrovannius
Amapacylapus
Amberofulvius
Ambocylapus
Aragocylapus
Austrovannius
Bakeriola
Bironiella
Bothriomiris
Brachyfulvius
Carvalhoma
Ceratofulvius
Comefulvius
Corcovadocola
Cylapinus
Cylapocerus
Cylapocorella
Cylapocoris
Cylapocorisca
Cylapocoroides
Cylapofulvius
Cylapoides
Cylapomorpha
Cylapus
Dashymenia
Dashymeniella
Duckecylapus
Epigonomiris
Euchilofulvius
Fulvidius
Fulviella
Fulvioaustrus
Fulvius
Germarofulvius
Gulacylapus
Hemiophthalmocoris
Howefulvius
Incafulvius
Jordanofulvius
Kanakamiris
Leprocapsus
Lygaeoscytus
Microcylapus
Microfulvius
Mimofulvius
Mycetocylapus
Oligocoris
Orasus
Paracylapus
Pararhinomiris
Peltidocylapus
Peritropella
Peritropis
Peritropisca
Peritropoides
Phyllocylapus
Phyllofulvidius
Phyllofulvius
Popoviana
Proamblia
Punctifulvius
Rewafulvius
Rhinocylapidius
Rhinocylapoides
Rhinocylapus
Rhinofulvius
Rhinomiriella
Rhinomiridius
Rhinomiris
Rhinophrus
Rhyparochromomiris
Schizopteromiris
Schmitzofulvius
Stysiofulvius
Sulawesifulvius
Teratofulvidius
Teratofulvioides
Teratofulvius
Trynocoris
Tucuruisca
Umboiella
Valdasoides
Valdasus
Vanniopsis
Vannius
Vanniusoides
Xenocylapidius
Xenocylapus
Yamatofulvius
?Mangalcoris
†Ambercylapus
†Archeofulvius
†Balticofulvius
References
External links
Hemiptera subfamilies
|
Gamboa may refer to:
People
Gamboa (name), a list of people with the surname
Places
Gamboa Airport, Castro, Chile
Gamboa, Panama, a town
Gamboa, Praia, a neighborhood in Praia, Cape Verde
Gamboa, Rio de Janeiro, a neighborhood
Gamboa (crater), a crater on Mars
See also
Ullíbarri-Gamboa, a hamlet in the Basque Country, Spain
|
```smalltalk
using System;
using System.Collections.Generic;
using System.Linq;
using KellermanSoftware.CompareNetObjects;
using KellermanSoftware.CompareNetObjectsTests.Attributes;
using KellermanSoftware.CompareNetObjectsTests.TestClasses;
using NUnit.Framework;
namespace KellermanSoftware.CompareNetObjectsTests
{
[TestFixture]
public class ConfigTests
{
#region Class Variables
private CompareLogic _compare;
#endregion
#region Setup/Teardown
/// <summary>
/// Code that is run before each test
/// </summary>
[SetUp]
public void Initialize()
{
_compare = new CompareLogic();
}
/// <summary>
/// Code that is run after each test
/// </summary>
[TearDown]
public void Cleanup()
{
_compare = null;
}
#endregion
#region Callback Tests
[Test]
public void CallbackNotCalledTest()
{
Person p1 = new Person();
p1.DateCreated = DateTime.Now;
p1.Name = "Greg";
Person p2 = new Person();
p2.Name = "Greg";
p2.DateCreated = p1.DateCreated;
var called = false;
_compare.Config.DifferenceCallback = d =>
{
called = true;
};
_compare.Compare(p1, p2);
Assert.IsFalse(called);
}
[Test]
public void CallbackCalledTest()
{
Person p1 = new Person();
p1.DateCreated = DateTime.Now;
p1.Name = "Greg";
Person p2 = new Person();
p2.Name = "Greg";
p2.DateCreated = p1.DateCreated.AddSeconds(1);
var called = false;
_compare.Config.DifferenceCallback = d =>
{
called = true;
};
_compare.Compare(p1, p2);
Assert.IsTrue(called);
}
#endregion
#region Ignore Object Types Tests
[Test]
public void IgnoreObjectTypesPositive()
{
RecipeDetail detail1 = new RecipeDetail(true, "Toffee");
detail1.Ingredient = "Crunchy Chocolate";
IndianRecipeDetail detail2 = new IndianRecipeDetail(true, "Toffee");
detail2.Ingredient = "Crunchy Chocolate";
_compare.Config.IgnoreObjectTypes = true;
var result = _compare.Compare(detail1, detail2);
Assert.IsTrue(result.AreEqual, result.DifferencesString);
_compare.Config.IgnoreObjectTypes = false;
}
[Test]
public void IgnoreObjectTypesNegative()
{
RecipeDetail detail1 = new RecipeDetail(true, "Toffee");
detail1.Ingredient = "Crunchy Chocolate";
IndianRecipeDetail detail2 = new IndianRecipeDetail(true, "Toffee");
detail2.Ingredient = "Curry sauce";
_compare.Config.IgnoreObjectTypes = true;
var result = _compare.Compare(detail1, detail2);
Console.WriteLine(result.DifferencesString);
Assert.IsFalse(result.AreEqual, result.DifferencesString);
_compare.Config.IgnoreObjectTypes = false;
}
#endregion
#region IgnoreByAttributeTest
[Test]
public void IgnorePropertyAttribute()
{
Movie movie1 = new Movie();
movie1.Name = "Mission Impossible 13, Ethan Gets Unlucky";
movie1.PaymentForTomCruise = 20000000;
Movie movie2 = new Movie();
movie2.Name = "Mission Impossible 13, Ethan Gets Unlucky";
movie2.PaymentForTomCruise = 20000001;
//The difference for PaymentForTomCruise will be ignored becuase it is marked with the ExcludeFromEquality
_compare.Config.AttributesToIgnore.Add(typeof(ExcludeFromEquality));
Assert.IsTrue(_compare.Compare(movie1, movie2).AreEqual);
_compare.Config.AttributesToIgnore.Clear();
}
[Test]
public void IgnorePropertyAttributeDifferent()
{
Movie movie1 = new Movie();
movie1.Name = "Mission Impossible 13, Ethan Gets Unlucky";
movie1.PaymentForTomCruise = 20000000;
Movie movie2 = new Movie();
movie2.Name = "Mission Impossible 14, Ethan Gets Unlucky";
movie2.PaymentForTomCruise = 20000001;
//The difference for PaymentForTomCruise will be ignored becuase it is marked with the ExcludeFromEquality
_compare.Config.AttributesToIgnore.Add(typeof(ExcludeFromEquality));
Assert.IsFalse(_compare.Compare(movie1, movie2).AreEqual);
_compare.Config.AttributesToIgnore.Clear();
}
#endregion
#region IgnoreByLackOfAttributeTest
[Test]
public void IgnoreByLackOfAttribute()
{
Movie movie1 = new Movie();
movie1.Name = "Mission Impossible 13, Ethan Gets Unlucky";
movie1.PaymentForTomCruise = 20000000;
Movie movie2 = new Movie();
movie2.Name = "Mission Impossible 13, Ethan Gets Unlucky";
movie2.PaymentForTomCruise = 20000001;
//The difference for PaymentForTomCruise will be ignored because only Name property is marked with CompareAttribute
_compare.Config.RequiredAttributesToCompare.Add(typeof(CompareAttribute));
Assert.IsTrue(_compare.Compare(movie1, movie2).AreEqual, $"Compare should result in equal because {nameof(Movie.PaymentForTomCruise)} doesn't have {nameof(CompareAttribute)}");
_compare.Config.RequiredAttributesToCompare.Clear();
}
[Test]
public void IgnoreByLackOfAttributeDifferent()
{
Movie movie1 = new Movie();
movie1.Name = "Mission Impossible 13, Ethan Gets Unlucky";
movie1.PaymentForTomCruise = 20000000;
Movie movie2 = new Movie();
movie2.Name = "Mission Impossible 14, Ethan Gets Unlucky";
movie2.PaymentForTomCruise = 20000001;
//The difference for PaymentForTomCruise will be ignored, but not for Name property, because it has CompareAttribute
_compare.Config.RequiredAttributesToCompare.Add(typeof(CompareAttribute));
_compare.Config.MaxDifferences = 2;
var result = _compare.Compare(movie1, movie2);
Assert.IsFalse(result.AreEqual, $"Compare shouldn't result in equal because {nameof(Movie.Name)} has different values");
Assert.IsTrue(result.Differences.Count == 1, $"Only one difference should exist because {nameof(Movie.PaymentForTomCruise)} doesn't have {nameof(CompareAttribute)}");
_compare.Config.RequiredAttributesToCompare.Clear();
}
#endregion
#region Ignore Read Only Tests
[Test]
public void IgnoreReadOnlyPositive()
{
RecipeDetail detail1 = new RecipeDetail(true, "Toffee");
detail1.Ingredient = "Crunchy Chocolate";
RecipeDetail detail2 = new RecipeDetail(false, "Toffee");
detail2.Ingredient = "Crunchy Chocolate";
_compare.Config.CompareReadOnly = false;
Assert.IsTrue(_compare.Compare(detail1, detail2).AreEqual);
_compare.Config.CompareReadOnly = true;
}
[Test]
public void IgnoreReadOnlyNegative()
{
RecipeDetail detail1 = new RecipeDetail(true, "Toffee");
detail1.Ingredient = "Crunchy Chocolate";
RecipeDetail detail2 = new RecipeDetail(false, "Toffee");
detail2.Ingredient = "Crunchy Chocolate";
Assert.IsFalse(_compare.Compare(detail1, detail2).AreEqual);
}
#endregion
#region IgnoreConcreteTypesTests
[Test]
public void IgnoreConcreteTypesPositive()
{
PersonGroup group1 = new PersonGroup()
{
Members = new Person[2]
{
new Person() { Name = "Tommy" },
new Person() { Name = "Johnny" }
},
Manager = new GroupManager() { Name = "Alice", Title = "Boss"}
};
PersonGroup group2 = new PersonGroup()
{
Members = new List<Person>
{
new Person() { Name = "Tommy" },
new Person() { Name = "Johnny" }
},
Manager = new Person() { Name = "Alice" }
};
_compare.Config.IgnoreConcreteTypes = true;
Assert.IsTrue(_compare.Compare(group2, group1).AreEqual);
Assert.IsTrue(_compare.Compare(group1, group2).AreEqual);
}
[Test]
public void IgnoreConcreteTypesNegative()
{
PersonGroup group1 = new PersonGroup()
{
Members = new Person[2]
{
new Person() { Name = "Tommy" },
new Person() { Name = "Johnny" }
},
Manager = new GroupManager() { Name = "Alice", Title = "Boss" }
};
PersonGroup group2 = new PersonGroup()
{
Members = new List<Person>
{
new Person() { Name = "Tommy" },
new Person() { Name = "Bruce" }
},
Manager = new Person() { Name = "Bob" }
};
_compare.Config.IgnoreConcreteTypes = true;
var result = _compare.Compare(group1, group2);
Assert.IsFalse(result.AreEqual, result.DifferencesString);
}
[Test]
public void IgnoreConcreteTypesDuck()
{
var person1 = new Person { Name = "Tommy" };
var person2 = new GroupManager { Name = "Tommy", Title = "Boss"};
var person3 = new GroupManagerNotInherited() { Name = "Tommy", Title = "Boss" };
Assert.IsFalse(_compare.Compare(person1, person2).AreEqual);
_compare.Config.IgnoreConcreteTypes = true;
Assert.IsTrue(_compare.Compare(person1, person2).AreEqual);
Assert.IsFalse(_compare.Compare(person1, person3).AreEqual);
Assert.IsFalse(_compare.Compare(person2, person3).AreEqual);
}
#endregion
#region Class Type Include Tests
[Test]
public void ClassTypeIncludePositive()
{
_compare.Config.ClassTypesToInclude.Add(typeof(Person));
Person p1 = new Person();
p1.Name = "Greg";
p1.DateCreated = DateTime.Now;
Person p2 = new Person();
p2.Name = "Leyla";
p2.DateCreated = DateTime.Now.AddDays(-1);
var result = _compare.Compare(p1, p2);
Assert.IsFalse(result.AreEqual, result.DifferencesString);
}
[Test]
public void ClassTypeIncludeNegative()
{
_compare.Config.ClassTypesToInclude.Add(typeof(Entity));
Person p1 = new Person();
p1.Name = "Greg";
p1.DateCreated = DateTime.Now;
Person p2 = new Person();
p2.Name = "Leyla";
p2.DateCreated = DateTime.Now.AddDays(-1);
var result = _compare.Compare(p1, p2);
Assert.IsTrue(result.AreEqual, result.DifferencesString);
}
#endregion
#region Class Type Ignore Tests
[Test]
public void ClassTypeIgnorePositive()
{
_compare.Config.ClassTypesToIgnore.Add(typeof(Person));
Person p1 = new Person();
p1.Name = "Greg";
p1.DateCreated = DateTime.Now;
Person p2 = new Person();
p2.Name = "Leyla";
p2.DateCreated = DateTime.Now.AddDays(-1);
var result = _compare.Compare(p1, p2);
Assert.IsTrue(result.AreEqual, result.DifferencesString);
}
[Test]
public void ClassTypeIgnoreNegative()
{
_compare.Config.ClassTypesToIgnore.Add(typeof(Entity));
Person p1 = new Person();
p1.Name = "Greg";
p1.DateCreated = DateTime.Now;
Person p2 = new Person();
p2.Name = "Leyla";
p2.DateCreated = DateTime.Now.AddDays(-1);
var result = _compare.Compare(p1, p2);
Assert.IsFalse(result.AreEqual, result.DifferencesString);
}
#endregion
#region Case Insensitive Tests
[Test]
public void CaseSensitiveTest()
{
//Arrange
_compare.Config.CaseSensitive = true;
//Act
var result = _compare.Compare("The quick brown fox jumps over the lazy dog.", "THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG.");
//Assert
Assert.IsFalse(result.AreEqual, result.DifferencesString);
}
[Test]
public void CaseInSensitiveTest()
{
//Arrange
_compare.Config.CaseSensitive = false;
//Act
var result = _compare.Compare("The quick brown fox jumps over the lazy dog.", "THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG.");
//Assert
Assert.IsTrue(result.AreEqual, result.DifferencesString);
}
#endregion
#region Verify Config Tests
[Test]
public void InvalidConfigShouldBeIgnored()
{
// Arrange.
var compareLogic = new CompareLogic();
var originalConfig = compareLogic.Config;
Assert.IsNotNull(originalConfig);
var invalidConfig = new ComparisonConfig
{
CollectionMatchingSpec = new Dictionary<Type, IEnumerable<string>>
{
{typeof(List<string>), Enumerable.Empty<string>()}
}
};
// Act.
Assert.Throws<ArgumentException>(() => compareLogic.Config = invalidConfig);
// Assert.
Assert.AreNotSame(compareLogic.Config, invalidConfig);
Assert.AreSame(compareLogic.Config, originalConfig);
}
#endregion
}
}
```
|
```xml
import { useEffect, useRef } from "react";
import { gsap } from "gsap";
export default function Content() {
let line1 = useRef(null);
useEffect(() => {
gsap.from([line1.current], 0.6, {
delay: 0.9,
ease: "power3.out",
y: 24,
stagger: {
amount: 0.15,
},
});
}, [line1]);
return (
<p ref={line1} className="line">
A Simple example using{" "}
<a
href="path_to_url"
style={{ fontWeight: "bold", textDecoration: "none" }}
>
GSAP
</a>{" "}
&{" "}
<a
href="path_to_url"
style={{ fontWeight: "bold", textDecoration: "none" }}
>
react-transition-group
</a>
</p>
);
}
```
|
```php
<div class='form-group {{$header_group_class}} {{ ($errors->first($name))?"has-error":"" }}' id='form-group-{{$name}}' style="{{@$form['style']}}">
<label class='control-label col-sm-2'>{{$form['label']}}
@if($required)
<span class='text-danger' title='{!! cbLang('this_field_is_required') !!}'>*</span>
@endif
</label>
<div class="{{$col_width?:'col-sm-10'}}">
<div id="{{$name}}"></div>
<textarea name="{{$name}}" style="display:none"></textarea>
<div class="text-danger">{!! $errors->first($name)?"<i class='fa fa-info-circle'></i> ".$errors->first($name):"" !!}</div>
<p class='help-block'>{{ @$form['help'] }}</p>
</div>
</div>
<script type="text/javascript">
$(document).ready(function () {
console.log(document.getElementById('{{$name}}'));
// Set an option globally
JSONEditor.defaults.options.theme = 'bootstrap2';
JSONEditor.plugins.select2.enable = false;
JSONEditor.plugins.selectize.enable = true;//to avoid select2
// Set an option during instantiation
var editor = new JSONEditor(document.getElementById('{{$name}}'), {
theme: 'bootstrap2',
startval: <?=json_encode(json_decode($value, false))?>,
schema: <?=json_encode(json_decode($form["schema"], false))?>
});
$('[name="{{$name}}"]').parents('form').on('submit', function () {
$('[name="{{$name}}"]').val(JSON.stringify(editor.getValue()));
return true;
})
});
</script>
```
|
```objective-c
/******************************************************************************
*
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
******************************************************************************/
#pragma once
#include "apidefs.h"
#include "stringise.h"
#ifdef RENDERDOC_EXPORTS
struct ResourceId;
namespace ResourceIDGen
{
// the only function allowed access to ResourceId internals, for allocating a new ID
ResourceId GetNewUniqueID();
};
#endif
// We give every resource a globally unique ID so that we can differentiate
// between two textures allocated in the same memory (after the first is freed)
//
// it's a struct around a uint64_t to aid in template selection
DOCUMENT(R"(This is an opaque identifier that uniquely locates a resource.
.. note::
These IDs do not overlap ever - textures, buffers, shaders and samplers will all have unique IDs
and do not reuse the namespace. Likewise the IDs assigned for resources during capture are not
re-used on replay - the corresponding resources created on replay to stand-in for capture-time
resources are given unique IDs and a mapping is stored to between the capture-time resource and
the replay-time one.
)");
struct ResourceId
{
ResourceId() : id() {}
ResourceId(const ResourceId &) = default;
ResourceId &operator=(const ResourceId &) = default;
#if !defined(SWIG)
ResourceId(ResourceId &&) = default;
ResourceId &operator=(ResourceId &&) = default;
#endif
DOCUMENT(R"(A helper function that explicitly creates an empty/invalid/null :class:`ResourceId`.
:return: an empty/invalid/null :class:`ResourceId`.
:rtype: ResourceId
)");
inline static ResourceId Null() { return ResourceId(); }
DOCUMENT("Compares two ``ResourceId`` objects for equality.");
bool operator==(const ResourceId u) const { return id == u.id; }
DOCUMENT("Compares two ``ResourceId`` objects for inequality.");
bool operator!=(const ResourceId u) const { return id != u.id; }
DOCUMENT("Compares two ``ResourceId`` objects for less-than.");
bool operator<(const ResourceId u) const { return id < u.id; }
#if defined(RENDERDOC_QT_COMPAT)
operator QVariant() const { return QVariant::fromValue(*this); }
#endif
private:
uint64_t id;
#ifdef RENDERDOC_EXPORTS
friend ResourceId ResourceIDGen::GetNewUniqueID();
friend struct std::hash<ResourceId>;
#endif
};
// declare metatype/reflection for ResourceId here as the struct itself is declared before including
// all relevant headers above
#if defined(RENDERDOC_QT_COMPAT)
Q_DECLARE_METATYPE(ResourceId);
#endif
DECLARE_REFLECTION_STRUCT(ResourceId);
// add a std::hash overload so ResourceId can be used in hashmaps
#ifdef RENDERDOC_EXPORTS
namespace std
{
template <>
struct hash<ResourceId>
{
std::size_t operator()(const ResourceId &id) const { return std::hash<uint64_t>()(id.id); }
};
}
#endif
```
|
Ambatofisaka II is a rural municipality located in the Atsinanana region of eastern Madagascar. It belongs to the Marolambo District.
The majority of its inhabitants are Betsimisaraka.
Eleven Fokontany (villages) belong to this municipality: Ambatofisaka II, Vofilambo, Ampasimazava, Anosiato, Ankiboka, Sahanambo, Anakalotre, Ambolomadinika, Antanjomanga, Ambalafarihy, Anosy, Sandranamby and Ambinanimangabe.
References
Populated places in Atsinanana
|
```c++
#include "source/common/network/connection_impl.h"
#include "source/common/tls/client_ssl_socket.h"
#include "source/common/tls/server_context_config_impl.h"
#include "source/common/tls/server_ssl_socket.h"
#include "source/extensions/filters/network/common/factory_base.h"
#include "test/integration/fake_upstream.h"
#include "test/integration/integration.h"
#include "test/integration/utility.h"
#include "test/mocks/network/mocks.h"
#include "test/test_common/network_utility.h"
#include "test/test_common/registry.h"
#include "contrib/envoy/extensions/filters/network/postgres_proxy/v3alpha/postgres_proxy.pb.h"
#include "contrib/envoy/extensions/filters/network/postgres_proxy/v3alpha/postgres_proxy.pb.validate.h"
#include "contrib/postgres_proxy/filters/network/test/postgres_integration_test.pb.h"
#include "contrib/postgres_proxy/filters/network/test/postgres_integration_test.pb.validate.h"
#include "contrib/postgres_proxy/filters/network/test/postgres_test_utils.h"
#include "gmock/gmock.h"
#include "gtest/gtest.h"
namespace Envoy {
namespace Extensions {
namespace NetworkFilters {
namespace PostgresProxy {
class PostgresBaseIntegrationTest : public testing::TestWithParam<Network::Address::IpVersion>,
public BaseIntegrationTest {
public:
// Tuple to store upstream and downstream startTLS configuration.
// The first string contains string to enable/disable SSL.
// The second string contains transport socket configuration.
using SSLConfig = std::tuple<const absl::string_view, const absl::string_view>;
std::string postgresConfig(SSLConfig downstream_ssl_config, SSLConfig upstream_ssl_config,
std::string additional_filters) {
std::string main_config = fmt::format(
fmt::runtime(TestEnvironment::readFileToStringForTest(TestEnvironment::runfilesPath(
"contrib/postgres_proxy/filters/network/test/postgres_test_config.yaml-template"))),
Platform::null_device_path, Network::Test::getLoopbackAddressString(GetParam()),
Network::Test::getLoopbackAddressString(GetParam()),
std::get<1>(upstream_ssl_config), // upstream SSL transport socket
Network::Test::getAnyAddressString(GetParam()),
std::get<0>(downstream_ssl_config), // downstream SSL termination
std::get<0>(upstream_ssl_config), // upstream_SSL option
additional_filters, // additional filters to insert after postgres
std::get<1>(downstream_ssl_config)); // downstream SSL transport socket
return main_config;
}
PostgresBaseIntegrationTest(SSLConfig downstream_ssl_config, SSLConfig upstream_ssl_config,
std::string additional_filters = "")
: BaseIntegrationTest(GetParam(), postgresConfig(downstream_ssl_config, upstream_ssl_config,
additional_filters)) {
skip_tag_extraction_rule_check_ = true;
};
void SetUp() override { BaseIntegrationTest::initialize(); }
static constexpr absl::string_view empty_config_string_{""};
static constexpr SSLConfig NoUpstreamSSL{empty_config_string_, empty_config_string_};
static constexpr SSLConfig NoDownstreamSSL{empty_config_string_, empty_config_string_};
FakeRawConnectionPtr fake_upstream_connection_;
};
// Base class for tests with `terminate_ssl` disabled and without
// `starttls` transport socket.
class BasicPostgresIntegrationTest : public PostgresBaseIntegrationTest {
public:
BasicPostgresIntegrationTest() : PostgresBaseIntegrationTest(NoDownstreamSSL, NoUpstreamSSL) {}
};
// Test that the filter is properly chained and reacts to successful login
// message.
TEST_P(BasicPostgresIntegrationTest, Login) {
std::string str;
std::string recv;
IntegrationTcpClientPtr tcp_client = makeTcpConnection(lookupPort("listener_0"));
FakeRawConnectionPtr fake_upstream_connection;
ASSERT_TRUE(fake_upstreams_[0]->waitForRawConnection(fake_upstream_connection));
// Send the startup message.
Buffer::OwnedImpl data;
std::string rcvd;
char buf[32];
memset(buf, 0, sizeof(buf));
// Add length.
data.writeBEInt<uint32_t>(12);
// Add 8 bytes of some data.
data.add(buf, 8);
ASSERT_TRUE(tcp_client->write(data.toString()));
ASSERT_TRUE(fake_upstream_connection->waitForData(data.toString().length(), &rcvd));
data.drain(data.length());
// TCP session is up. Just send the AuthenticationOK downstream.
data.add("R");
// Add length.
data.writeBEInt<uint32_t>(8);
uint32_t code = 0;
data.add(&code, sizeof(code));
rcvd.clear();
ASSERT_TRUE(fake_upstream_connection->write(data.toString()));
rcvd.append(data.toString());
tcp_client->waitForData(rcvd, true);
tcp_client->close();
ASSERT_TRUE(fake_upstream_connection->waitForDisconnect());
// Make sure that the successful login bumped up the number of sessions.
test_server_->waitForCounterEq("postgres.postgres_stats.sessions", 1);
}
INSTANTIATE_TEST_SUITE_P(IpVersions, BasicPostgresIntegrationTest,
testing::ValuesIn(TestEnvironment::getIpVersionsForTest()));
// Base class for tests with `terminate_ssl` enabled and `starttls` transport socket added.
class DownstreamSSLPostgresIntegrationTest : public PostgresBaseIntegrationTest {
public:
DownstreamSSLPostgresIntegrationTest()
: PostgresBaseIntegrationTest(
std::make_tuple(
"terminate_ssl: true",
fmt::format(
R"EOF(transport_socket:
name: "starttls"
typed_config:
"@type": type.googleapis.com/envoy.extensions.transport_sockets.starttls.v3.StartTlsConfig
cleartext_socket_config:
tls_socket_config:
common_tls_context:
tls_certificates:
certificate_chain:
filename: {}
private_key:
filename: {}
)EOF",
TestEnvironment::runfilesPath("test/config/integration/certs/servercert.pem"),
TestEnvironment::runfilesPath("test/config/integration/certs/serverkey.pem"))),
NoUpstreamSSL) {}
};
// Test verifies that Postgres filter replies with correct code upon
// receiving request to terminate SSL.
TEST_P(DownstreamSSLPostgresIntegrationTest, TerminateSSL) {
Buffer::OwnedImpl data;
IntegrationTcpClientPtr tcp_client = makeTcpConnection(lookupPort("listener_0"));
FakeRawConnectionPtr fake_upstream_connection;
ASSERT_TRUE(fake_upstreams_[0]->waitForRawConnection(fake_upstream_connection));
// Send the startup message requesting SSL.
// Message is 8 bytes long. The first 4 bytes contain length (8)
// The next 8 bytes contain message code (RequestSSL=80877103)
data.writeBEInt<uint32_t>(8);
data.writeBEInt<uint32_t>(80877103);
// Message will be processed by Postgres filter which
// is configured to accept SSL termination and confirm it
// by returning single byte 'S'.
ASSERT_TRUE(tcp_client->write(data.toString()));
data.drain(data.length());
tcp_client->waitForData("S", true);
tcp_client->close();
ASSERT_TRUE(fake_upstream_connection->waitForDisconnect());
// Make sure that the successful login bumped up the number of sessions.
test_server_->waitForCounterEq("postgres.postgres_stats.sessions_terminated_ssl", 1);
}
INSTANTIATE_TEST_SUITE_P(IpVersions, DownstreamSSLPostgresIntegrationTest,
testing::ValuesIn(TestEnvironment::getIpVersionsForTest()));
class DownstreamSSLWrongConfigPostgresIntegrationTest : public PostgresBaseIntegrationTest {
public:
DownstreamSSLWrongConfigPostgresIntegrationTest()
// Enable SSL termination but do not configure downstream transport socket.
: PostgresBaseIntegrationTest(std::make_tuple("terminate_ssl: true", ""), NoUpstreamSSL) {}
};
// Test verifies that Postgres filter closes connection when it is configured to
// terminate SSL, but underlying transport socket does not allow for such operation.
TEST_P(DownstreamSSLWrongConfigPostgresIntegrationTest, TerminateSSLNoStartTlsTransportSocket) {
Buffer::OwnedImpl data;
IntegrationTcpClientPtr tcp_client = makeTcpConnection(lookupPort("listener_0"));
FakeRawConnectionPtr fake_upstream_connection;
ASSERT_TRUE(fake_upstreams_[0]->waitForRawConnection(fake_upstream_connection));
// Send the startup message requesting SSL.
// Message is 8 bytes long. The first 4 bytes contain length (8)
// The next 8 bytes contain message code (RequestSSL=80877103)
data.writeBEInt<uint32_t>(8);
data.writeBEInt<uint32_t>(80877103);
// Message will be processed by Postgres filter which
// is configured to accept SSL termination and confirm it
// by returning single byte 'S'.
// The write can see disconnect upon completion so we do
// not verify the result.
ASSERT_TRUE(tcp_client->write(data.toString(), false, false));
data.drain(data.length());
tcp_client->waitForData("S", true);
tcp_client->waitForDisconnect();
ASSERT_TRUE(fake_upstream_connection->waitForDisconnect());
test_server_->waitForCounterEq("postgres.postgres_stats.sessions_terminated_ssl", 0);
}
INSTANTIATE_TEST_SUITE_P(IpVersions, DownstreamSSLWrongConfigPostgresIntegrationTest,
testing::ValuesIn(TestEnvironment::getIpVersionsForTest()));
// Upstream SSL integration tests.
// Tests do not use the real postgres server and concentrate only on initial exchange.
// The initial packet
// sent by the downstream client, SSL request sent to fake upstream and SSL response sent back by
// fake client are valid postgres payloads, because they must be parsed by postgres filter.
class UpstreamSSLBaseIntegrationTest : public PostgresBaseIntegrationTest {
public:
UpstreamSSLBaseIntegrationTest(SSLConfig upstream_ssl_config,
SSLConfig downstream_ssl_config = NoDownstreamSSL)
// Disable downstream SSL and attach synchronization filter.
: PostgresBaseIntegrationTest(downstream_ssl_config, upstream_ssl_config, R"EOF(
- name: sync
typed_config:
"@type": type.googleapis.com/test.integration.postgres.SyncWriteFilterConfig
)EOF") {}
// Helper synchronization filter which is injected between postgres filter and tcp proxy.
// Its goal is to eliminate race conditions and synchronize operations between fake upstream and
// postgres filter.
struct SyncWriteFilter : public Network::WriteFilter {
SyncWriteFilter(absl::Notification& proceed_sync, absl::Notification& recv_sync)
: proceed_sync_(proceed_sync), recv_sync_(recv_sync) {}
Network::FilterStatus onWrite(Buffer::Instance& data, bool) override {
if (data.length() > 0) {
// Notify fake upstream that payload has been received.
recv_sync_.Notify();
// Wait for signal to continue. This is to give fake upstream
// some time to create and attach TLS transport socket.
proceed_sync_.WaitForNotification();
}
return Network::FilterStatus::Continue;
}
void initializeWriteFilterCallbacks(Network::WriteFilterCallbacks& callbacks) override {
read_callbacks_ = &callbacks;
}
Network::WriteFilterCallbacks* read_callbacks_{};
// Synchronization object used to stop Envoy processing to allow fake upstream to
// create and attach TLS transport socket.
absl::Notification& proceed_sync_;
// Synchronization object used to notify fake upstream that a message sent
// by fake upstream was received by Envoy.
absl::Notification& recv_sync_;
};
// Config factory for sync helper filter.
class SyncWriteFilterConfigFactory : public Extensions::NetworkFilters::Common::FactoryBase<
test::integration::postgres::SyncWriteFilterConfig> {
public:
explicit SyncWriteFilterConfigFactory(const std::string& name,
Network::ConnectionCallbacks& /* upstream_callbacks*/)
: FactoryBase(name) {}
Network::FilterFactoryCb
createFilterFactoryFromProtoTyped(const test::integration::postgres::SyncWriteFilterConfig&,
Server::Configuration::FactoryContext&) override {
return [&](Network::FilterManager& filter_manager) -> void {
filter_manager.addWriteFilter(std::make_shared<SyncWriteFilter>(proceed_sync_, recv_sync_));
};
}
std::string name() const override { return name_; }
// See SyncWriteFilter for purpose and description of the following sync objects.
absl::Notification proceed_sync_, recv_sync_;
private:
const std::string name_;
};
// Method prepares TLS context to be injected to fake upstream.
// Method creates and attaches TLS transport socket to fake upstream.
void enableTLSOnFakeUpstream() {
// Setup factory and context for tls transport socket.
// The tls transport socket will be inserted into fake_upstream when
// Envoy's upstream starttls transport socket is converted to secure mode.
std::unique_ptr<Ssl::ContextManager> tls_context_manager =
std::make_unique<Extensions::TransportSockets::Tls::ContextManagerImpl>(
server_factory_context_);
envoy::extensions::transport_sockets::tls::v3::DownstreamTlsContext downstream_tls_context;
std::string yaml_plain = R"EOF(
common_tls_context:
validation_context:
trusted_ca:
filename: "{{ test_rundir }}/test/config/integration/certs/upstreamcacert.pem"
tls_certificates:
certificate_chain:
filename: "{{ test_rundir }}/test/config/integration/certs/upstreamcert.pem"
private_key:
filename: "{{ test_rundir }}/test/config/integration/certs/upstreamkey.pem"
)EOF";
TestUtility::loadFromYaml(TestEnvironment::substitute(yaml_plain), downstream_tls_context);
NiceMock<Server::Configuration::MockTransportSocketFactoryContext> mock_factory_ctx;
ON_CALL(mock_factory_ctx.server_context_, api()).WillByDefault(testing::ReturnRef(*api_));
auto cfg = *Extensions::TransportSockets::Tls::ServerContextConfigImpl::create(
downstream_tls_context, mock_factory_ctx, false);
static auto* client_stats_store = new Stats::TestIsolatedStoreImpl();
Network::DownstreamTransportSocketFactoryPtr tls_context =
Network::DownstreamTransportSocketFactoryPtr{
*Extensions::TransportSockets::Tls::ServerSslSocketFactory::create(
std::move(cfg), *tls_context_manager, *(client_stats_store->rootScope()), {})};
Network::TransportSocketPtr ts = tls_context->createDownstreamTransportSocket();
// Synchronization object used to suspend execution
// until dispatcher completes transport socket conversion.
absl::Notification notification;
// Execute transport socket conversion to TLS on the same thread where received data
// is dispatched. Otherwise conversion may collide with data processing.
fake_upstreams_[0]->dispatcher()->post([&]() {
auto connection =
dynamic_cast<Envoy::Network::ConnectionImpl*>(&fake_upstream_connection_->connection());
connection->transportSocket() = std::move(ts);
connection->transportSocket()->setTransportSocketCallbacks(*connection);
notification.Notify();
});
// Wait until the transport socket conversion completes.
notification.WaitForNotification();
}
NiceMock<Network::MockConnectionCallbacks> upstream_callbacks_;
SyncWriteFilterConfigFactory config_factory_{"sync", upstream_callbacks_};
Registry::InjectFactory<Server::Configuration::NamedNetworkFilterConfigFactory>
registered_config_factory_{config_factory_};
};
// Base class for tests with disabled upstream SSL. It should behave exactly
// as without any upstream configuration specified and pass
// messages in clear-text.
class UpstreamSSLDisabledPostgresIntegrationTest : public UpstreamSSLBaseIntegrationTest {
public:
// Disable downstream SSL and upstream SSL.
UpstreamSSLDisabledPostgresIntegrationTest()
: UpstreamSSLBaseIntegrationTest(std::make_tuple("upstream_ssl: DISABLE", "")) {}
};
// Verify that postgres filter does not send any additional messages when
// upstream SSL is disabled. Fake upstream should receive only the initial
// postgres message.
TEST_P(UpstreamSSLDisabledPostgresIntegrationTest, BasicConnectivityTest) {
IntegrationTcpClientPtr tcp_client = makeTcpConnection(lookupPort("listener_0"));
ASSERT_TRUE(fake_upstreams_[0]->waitForRawConnection(fake_upstream_connection_));
// Send the startup message.
Buffer::OwnedImpl data;
std::string rcvd;
createInitialPostgresRequest(data);
ASSERT_TRUE(tcp_client->write(data.toString()));
// Make sure that upstream receives startup message in clear-text (no SSL negotiation takes
// place).
ASSERT_TRUE(fake_upstream_connection_->waitForData(data.toString().length(), &rcvd));
data.drain(data.length());
tcp_client->close();
ASSERT_TRUE(fake_upstream_connection_->waitForDisconnect());
test_server_->waitForCounterEq("postgres.postgres_stats.sessions_upstream_ssl_success", 0);
test_server_->waitForCounterEq("postgres.postgres_stats.sessions_upstream_ssl_failed", 0);
}
INSTANTIATE_TEST_SUITE_P(IpVersions, UpstreamSSLDisabledPostgresIntegrationTest,
testing::ValuesIn(TestEnvironment::getIpVersionsForTest()));
// Base class for parameterized tests with REQUIRE option for upstream SSL.
class UpstreamSSLRequirePostgresIntegrationTest : public UpstreamSSLBaseIntegrationTest {
public:
UpstreamSSLRequirePostgresIntegrationTest()
: UpstreamSSLBaseIntegrationTest(std::make_tuple("upstream_ssl: REQUIRE",
R"EOF(transport_socket:
name: "starttls"
typed_config:
"@type": type.googleapis.com/envoy.extensions.transport_sockets.starttls.v3.UpstreamStartTlsConfig
tls_socket_config:
common_tls_context: {}
)EOF")) {}
};
// Test verifies that postgres filter starts upstream SSL negotiation with
// fake upstream upon receiving initial postgres packet. When server agrees
// to use SSL, TLS transport socket is attached to fake upstream and
// fake upstream receives initial postgres packet over encrypted connection.
TEST_P(UpstreamSSLRequirePostgresIntegrationTest, ServerAgreesForSSLTest) {
IntegrationTcpClientPtr tcp_client = makeTcpConnection(lookupPort("listener_0"));
ASSERT_TRUE(fake_upstreams_[0]->waitForRawConnection(fake_upstream_connection_));
// Send the startup message.
Buffer::OwnedImpl data;
Buffer::OwnedImpl upstream_data;
std::string rcvd;
createInitialPostgresRequest(data);
ASSERT_TRUE(tcp_client->write(data.toString()));
// Postgres filter should buffer the original message and negotiate SSL upstream.
// The first 4 bytes should be length on the message (8 bytes).
// The next 4 bytes should be SSL code.
ASSERT_TRUE(fake_upstream_connection_->waitForData(8, &rcvd));
upstream_data.add(rcvd);
ASSERT_EQ(8, upstream_data.peekBEInt<uint32_t>(0));
ASSERT_EQ(80877103, upstream_data.peekBEInt<uint32_t>(4));
upstream_data.drain(upstream_data.length());
fake_upstream_connection_->clearData();
// Reply to Envoy with 'S' and attach TLS socket to upstream.
upstream_data.add("S");
ASSERT_TRUE(fake_upstream_connection_->write(upstream_data.toString()));
config_factory_.recv_sync_.WaitForNotification();
enableTLSOnFakeUpstream();
config_factory_.proceed_sync_.Notify();
ASSERT_TRUE(fake_upstream_connection_->waitForData(data.length(), &rcvd));
// Make sure that upstream received initial postgres request, which
// triggered upstream SSL negotiation and TLS handshake.
ASSERT_EQ(data.toString(), rcvd);
data.drain(data.length());
tcp_client->close();
ASSERT_TRUE(fake_upstream_connection_->waitForDisconnect());
test_server_->waitForCounterEq("postgres.postgres_stats.sessions_upstream_ssl_success", 1);
test_server_->waitForCounterEq("postgres.postgres_stats.sessions_upstream_ssl_failed", 0);
}
// Test verifies that postgres filter will not continue when upstream SSL
// is required and fake upstream does not agree for SSL.
TEST_P(UpstreamSSLRequirePostgresIntegrationTest, ServerDeniesSSLTest) {
IntegrationTcpClientPtr tcp_client = makeTcpConnection(lookupPort("listener_0"));
ASSERT_TRUE(fake_upstreams_[0]->waitForRawConnection(fake_upstream_connection_));
// Send the startup message.
Buffer::OwnedImpl data;
Buffer::OwnedImpl upstream_data;
std::string rcvd;
createInitialPostgresRequest(data);
ASSERT_TRUE(tcp_client->write(data.toString()));
// Postgres filter should buffer the original message and negotiate SSL upstream.
// The first 4 bytes should be length on the message (8 bytes).
// The next 4 bytes should be SSL code.
ASSERT_TRUE(fake_upstream_connection_->waitForData(8, &rcvd));
upstream_data.add(rcvd);
ASSERT_EQ(8, upstream_data.peekBEInt<uint32_t>(0));
ASSERT_EQ(80877103, upstream_data.peekBEInt<uint32_t>(4));
upstream_data.drain(upstream_data.length());
// Reply to Envoy with 'N' (SSL not allowed).
upstream_data.add("N");
ASSERT_TRUE(fake_upstream_connection_->write(upstream_data.toString()));
config_factory_.proceed_sync_.Notify();
data.drain(data.length());
// Connection to client should be closed.
tcp_client->waitForDisconnect();
ASSERT_TRUE(fake_upstream_connection_->waitForDisconnect());
test_server_->waitForCounterEq("postgres.postgres_stats.sessions_upstream_ssl_success", 0);
test_server_->waitForCounterEq("postgres.postgres_stats.sessions_upstream_ssl_failed", 1);
}
INSTANTIATE_TEST_SUITE_P(IpVersions, UpstreamSSLRequirePostgresIntegrationTest,
testing::ValuesIn(TestEnvironment::getIpVersionsForTest()));
// Base class for parameterized tests when upstream and downstream SSL is enabled.
class UpstreamAndDownstreamSSLIntegrationTest : public UpstreamSSLBaseIntegrationTest {
public:
UpstreamAndDownstreamSSLIntegrationTest()
: UpstreamSSLBaseIntegrationTest(
// Configure upstream SSL
std::make_tuple("upstream_ssl: REQUIRE",
R"EOF(transport_socket:
name: "starttls"
typed_config:
"@type": type.googleapis.com/envoy.extensions.transport_sockets.starttls.v3.UpstreamStartTlsConfig
tls_socket_config:
common_tls_context: {}
)EOF"),
// configure downstream SSL
std::make_tuple(
"terminate_ssl: true",
fmt::format(
R"EOF(transport_socket:
name: "starttls"
typed_config:
"@type": type.googleapis.com/envoy.extensions.transport_sockets.starttls.v3.StartTlsConfig
cleartext_socket_config:
tls_socket_config:
common_tls_context:
tls_certificates:
certificate_chain:
filename: {}
private_key:
filename: {}
)EOF",
TestEnvironment::runfilesPath("test/config/integration/certs/servercert.pem"),
TestEnvironment::runfilesPath(
"test/config/integration/certs/serverkey.pem")))) {}
// Method changes IntegrationTcpClient's transport socket to TLS.
// Sending any traffic to newly attached TLS transport socket will trigger
// TLS handshake negotiation.
void enableTLSonTCPClient(const IntegrationTcpClientPtr& tcp_client) {
// Setup factory and context for tls transport socket.
// The tls transport socket will be inserted into fake_upstream when
// Envoy's upstream starttls transport socket is converted to secure mode.
std::unique_ptr<Ssl::ContextManager> tls_context_manager =
std::make_unique<Extensions::TransportSockets::Tls::ContextManagerImpl>(
server_factory_context_);
envoy::extensions::transport_sockets::tls::v3::UpstreamTlsContext upstream_tls_context;
NiceMock<Server::Configuration::MockTransportSocketFactoryContext> mock_factory_ctx;
ON_CALL(mock_factory_ctx.server_context_, api()).WillByDefault(testing::ReturnRef(*api_));
auto cfg = *Extensions::TransportSockets::Tls::ClientContextConfigImpl::create(
upstream_tls_context, mock_factory_ctx);
static auto* client_stats_store = new Stats::TestIsolatedStoreImpl();
Network::UpstreamTransportSocketFactoryPtr tls_context =
Network::UpstreamTransportSocketFactoryPtr{
*Extensions::TransportSockets::Tls::ClientSslSocketFactory::create(
std::move(cfg), *tls_context_manager, *(client_stats_store->rootScope()))};
Network::TransportSocketOptionsConstSharedPtr options;
auto connection = dynamic_cast<Envoy::Network::ConnectionImpl*>(tcp_client->connection());
Network::TransportSocketPtr ts = tls_context->createTransportSocket(
options, connection->streamInfo().upstreamInfo()->upstreamHost());
connection->transportSocket() = std::move(ts);
connection->transportSocket()->setTransportSocketCallbacks(*connection);
}
};
// Integration test when both downstream and upstream SSL is enabled.
// In this scenario test client establishes SSL connection to Envoy. Envoy de-crypts the traffic.
// The traffic is encrypted again when sent to upstream server.
// The test follows the following scenario:
//
// Test client Envoy Upstream
// ----- Can I use SSL? ------------>
// <------- Yes---------------------
// <------- TLS handshake ---------->
// ------ Initial postgres msg ----->
// ------ Can I use SSL? --->
// <------- Yes--------------
// <------- TLS handshake--->
// --Initial postgres msg--->
// ------ close connection --------->
// ------ close connection--->
//
TEST_P(UpstreamAndDownstreamSSLIntegrationTest, ServerAgreesForSSL) {
Buffer::OwnedImpl data;
IntegrationTcpClientPtr tcp_client = makeTcpConnection(lookupPort("listener_0"));
ASSERT_TRUE(fake_upstreams_[0]->waitForRawConnection(fake_upstream_connection_));
// Send the startup message requesting SSL.
// Message is 8 bytes long. The first 4 bytes contain length (8)
// The next 8 bytes contain message code (RequestSSL=80877103)
data.writeBEInt<uint32_t>(8);
data.writeBEInt<uint32_t>(80877103);
// Message will be processed by Postgres filter which
// is configured to accept SSL termination and confirm it
// by returning single byte 'S'.
ASSERT_TRUE(tcp_client->write(data.toString()));
data.drain(data.length());
tcp_client->waitForData("S", true);
// Attach TLS to tcp_client.
enableTLSonTCPClient(tcp_client);
// Write initial postgres message. This should trigger SSL negotiation between test TCP client and
// Envoy downstream transport socket. Postgres filter should ask the fake upstream server if it
// will accept encrypted connection.
Buffer::OwnedImpl upstream_data;
std::string rcvd;
createInitialPostgresRequest(data);
ASSERT_TRUE(tcp_client->write(data.toString()));
// Postgres filter should buffer the original message and negotiate SSL upstream.
// The first 4 bytes should be length on the message (8 bytes).
// The next 4 bytes should be SSL code.
ASSERT_TRUE(fake_upstream_connection_->waitForData(8, &rcvd));
upstream_data.add(rcvd);
ASSERT_EQ(8, upstream_data.peekBEInt<uint32_t>(0));
ASSERT_EQ(80877103, upstream_data.peekBEInt<uint32_t>(4));
upstream_data.drain(upstream_data.length());
// Reply to Envoy with 'S' and attach TLS socket to upstream.
upstream_data.add("S");
ASSERT_TRUE(fake_upstream_connection_->write(upstream_data.toString()));
fake_upstream_connection_->clearData();
config_factory_.recv_sync_.WaitForNotification();
enableTLSOnFakeUpstream();
config_factory_.proceed_sync_.Notify();
ASSERT_TRUE(fake_upstream_connection_->waitForData(data.length(), &rcvd));
// Make sure that upstream received initial postgres request, which
// triggered upstream SSL negotiation and TLS handshake.
ASSERT_EQ(data.toString(), rcvd);
data.drain(data.length());
tcp_client->close();
ASSERT_TRUE(fake_upstream_connection_->waitForDisconnect());
test_server_->waitForCounterEq("postgres.postgres_stats.sessions_terminated_ssl", 1);
test_server_->waitForCounterEq("postgres.postgres_stats.sessions_upstream_ssl_success", 1);
test_server_->waitForCounterEq("postgres.postgres_stats.sessions_upstream_ssl_failed", 0);
}
// Integration test when both downstream and upstream SSL is enabled.
// In this scenario test client establishes SSL connection to Envoy. Envoy de-crypts the traffic.
// The traffic is encrypted again when sent to upstream server, but the server
// rejects request for SSL.
// The test follows the following scenario:
//
// Test client Envoy Upstream
// ----- Can I use SSL? ------------>
// <------- Yes---------------------
// <------- TLS handshake ---------->
// ------ Initial postgres msg ----->
// ------ Can I use SSL? --->
// <------- No---------------
// <----- close connection ----------
// ------ close connection--->
TEST_P(UpstreamAndDownstreamSSLIntegrationTest, ServerRejectsSSL) {
Buffer::OwnedImpl data;
IntegrationTcpClientPtr tcp_client = makeTcpConnection(lookupPort("listener_0"));
ASSERT_TRUE(fake_upstreams_[0]->waitForRawConnection(fake_upstream_connection_));
// Send the startup message requesting SSL.
// Message is 8 bytes long. The first 4 bytes contain length (8)
// The next 8 bytes contain message code (RequestSSL=80877103)
data.writeBEInt<uint32_t>(8);
data.writeBEInt<uint32_t>(80877103);
// Message will be processed by Postgres filter which
// is configured to accept SSL termination and confirm it
// by returning single byte 'S'.
ASSERT_TRUE(tcp_client->write(data.toString()));
data.drain(data.length());
tcp_client->waitForData("S", true);
// Attach TLS to tcp_client.
enableTLSonTCPClient(tcp_client);
// Write initial postgres message. This should trigger SSL negotiation between test TCP client and
// Envoy downstream transport socket. Postgres filter should ask the fake upstream server if it
// will accept encrypted connection.
Buffer::OwnedImpl upstream_data;
std::string rcvd;
createInitialPostgresRequest(data);
ASSERT_TRUE(tcp_client->write(data.toString()));
// Postgres filter should buffer the original message and negotiate SSL upstream.
// The first 4 bytes should be length on the message (8 bytes).
// The next 4 bytes should be SSL code.
ASSERT_TRUE(fake_upstream_connection_->waitForData(8, &rcvd));
upstream_data.add(rcvd);
ASSERT_EQ(8, upstream_data.peekBEInt<uint32_t>(0));
ASSERT_EQ(80877103, upstream_data.peekBEInt<uint32_t>(4));
upstream_data.drain(upstream_data.length());
// Reply to Envoy with 'E' (SSL not allowed).
upstream_data.add("E");
ASSERT_TRUE(fake_upstream_connection_->write(upstream_data.toString()));
config_factory_.proceed_sync_.Notify();
data.drain(data.length());
// Envoy should close the connection to test client.
tcp_client->waitForDisconnect();
ASSERT_TRUE(fake_upstream_connection_->waitForDisconnect());
test_server_->waitForCounterEq("postgres.postgres_stats.sessions_terminated_ssl", 1);
test_server_->waitForCounterEq("postgres.postgres_stats.sessions_upstream_ssl_success", 0);
test_server_->waitForCounterEq("postgres.postgres_stats.sessions_upstream_ssl_failed", 1);
}
INSTANTIATE_TEST_SUITE_P(IpVersions, UpstreamAndDownstreamSSLIntegrationTest,
testing::ValuesIn(TestEnvironment::getIpVersionsForTest()));
} // namespace PostgresProxy
} // namespace NetworkFilters
} // namespace Extensions
} // namespace Envoy
```
|
The French Federation of Mountaineering and Climbing (, FFME), located in Paris, is the French federation of mountain and climbing sports, especially of non-motorized alpine sports like mountaineering, canyoning, climbing, mountain touring and hiking, snowshoe hiking and ski mountaineering. The FFME is member of the French National Olympic and Sports Committee.
The foundation of the FFME in 1987 was the result of the fusion of the French Federation of Mountaineering (, FFM), founded in 1942 by the high commissariat of sports () in addition to the existing Club Alpin Français (CAF), and the climbing association French Federation of Climbing (, FFE), which was founded in 1985. A further fusion of the FFME and the CAF in the beginning 2000s failed.
In 2002, the FFME supported the first ISMC UIAA World Championship of Ski Mountaineering in France.
References
External links
Official Website
Organizations based in Paris
Climbing organizations
Mountaineering and Climbing
Tourism in France
Sport in Paris
1987 in France
Competition climbing organizations
|
The 1981 Maui Pro Tennis Classic, also known as the Hawaii Open, was a men's tennis tournament played an outdoor hard courts in Maui, Hawaii, in the United States that was part of the 1981 Volvo Grand Prix circuit. It was the eighth edition of the tournament and was held from September 29 through October 4, 1981. Unseeded Hank Pfister won the singles title.
Finals
Singles
Hank Pfister defeated Tim Mayotte 6–4, 6–4
It was Pfister's first singles title of his career.
Doubles
Matt Mitchell / Tony Graham defeated John Alexander / James Delaney 6–3, 3–6, 7–6
References
Maui Pro Tennis Classic
Maui Pro Tennis Classic
Maui Pro Tennis Classic
Maui Pro Tennis Classic
Maui Pro Tennis Classic
Hawaii Open
|
```javascript
import Icon from '../components/Icon.vue'
Icon.register({
font: {
width: 448,
height: 512,
paths: [
{
d: 'M432 416c8.8 0 16 7.2 16 16v32c0 8.8-7.2 16-16 16h-128c-8.8 0-16-7.2-16-16v-32c0-8.8 7.2-16 16-16h19.6l-23.3-64h-152.6l-23.3 64h19.6c8.8 0 16 7.2 16 16v32c0 8.8-7.2 16-16 16h-128c-8.8 0-16-7.2-16-16v-32c0-8.8 7.2-16 16-16h23.4l130.7-362.3c4.3-12.6 16.2-21.7 30.3-21.7h0 47.2l0 0c14.1 0 26 9.1 30.3 21.7l130.7 362.3h23.4zM176.8 272h94.3l-47.2-129.5z'
}
]
}
})
```
|
```java
/*
* FindBugs - Find Bugs in Java programs
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
*
* You should have received a copy of the GNU Lesser General Public
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
package edu.umd.cs.findbugs.gui2;
import javax.swing.Box;
import javax.swing.BoxLayout;
import javax.swing.JButton;
import javax.swing.JPanel;
/**
* @author pugh
*/
public class GuiUtil {
public static void addOkAndCancelButtons(JPanel panel, JButton ok, JButton cancel) {
panel.setLayout(new BoxLayout(panel, BoxLayout.X_AXIS));
if (MainFrame.MAC_OS_X) {
panel.add(Box.createHorizontalGlue());
panel.add(cancel);
panel.add(Box.createHorizontalStrut(5));
panel.add(ok);
panel.add(Box.createHorizontalStrut(20));
} else {
panel.add(Box.createHorizontalGlue());
panel.add(ok);
panel.add(Box.createHorizontalStrut(5));
panel.add(cancel);
panel.add(Box.createHorizontalStrut(5));
}
}
}
```
|
```javascript
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
// Flags: --opt --allow-natives-syntax
(() => {
function f(u) {
for (var j = 0; j < 20; ++j) {
print("" + u.codePointAt());
}
}
f("test");
f("foo");
%OptimizeFunctionOnNextCall(f);
f("");
})();
```
|
Axel Louissaint (born 3 January 1996) is a Swiss professional basketball for Lugano Tigers of Swiss Basketball League, the top tier of basketball in Switzerland.
Professional career
Lugano Tigers (2015–2017)
Louissaint signed with the Lugano Tigers in 2015 at the age of 18. He made his first professional appearance on 14 February 2015, scoring seven points and grabbing four rebounds. Over his first two years Louissaint appeared in 58 games starting 24.
On 25 April 2017 Louissaint declared for the 2017 NBA draft, being one of 45 international players to do so.
Riviera Lakers (2017-2018)
Louissaint signed with the Vevey Riviera Basket of Championnat LNA. On week 21, he was selected for the Top 5 of the week.
Leyma Coruña (2018–2019)
On 23 July 2018 Louissaint signed with Leyma Coruña of LEB Oro.
Return to Lugano (2020–present)
After spending the 2019-20 season with several Spanish clubs, Louissaint returned to Lugano Tigers on 12 August 2020.
National team career
He has competed for Switzerland through multiple youth national teams, and participated at the 2015 FIBA Europe Under-20 Championship Division B. He was the top scorer of his team and averaged 13.1 points, 7.7 rebounds, 1.4 steals per game.
Career statistics
LNA stats
|-
| style="text-align:left;"| 2015–16
| style="text-align:left;"| Lugano Tigers
| 26 || 6 || 19.7 || .324 || .260 || .458 || 2.3 || .7 || .4 || .2 || 5.7 || 7.1
|-
| style="text-align:left;"| 2016–17
| style="text-align:left;"| Lugano Tigers
| 32 || 18 || 24.3 || .311 || .255 || .633 || 3.7 || 1.0 || .6 || .1 || 5.9 || 7.7
|- class="sortbottom"
| align="center" colspan="2"| Career
| 58 || 24 || 21.8 || .319 || .257 || .356 || 3.0 || .8 || .5 || .1 || 5.8 || 7.3
References
1996 births
Living people
Básquet Coruña players
Swiss expatriate basketball people in Spain
Lugano Tigers players
People from Yverdon-les-Bains
Shooting guards
Small forwards
Swiss expatriate basketball people
Swiss expatriate sportspeople in Spain
Swiss men's basketball players
Vevey Riviera Basket players
Sportspeople from the canton of Vaud
|
```javascript
import React, { Component } from 'react';
import PropTypes from 'prop-types';
class Error404 extends Component {
componentWillMount() {
const { staticContext } = this.props;
if (staticContext) {
staticContext.missed = true;
}
}
render() {
return <div>Sorry, that page was not found.</div>;
}
}
Error404.propTypes = {
// eslint-disable-next-line react/forbid-prop-types
staticContext: PropTypes.object,
};
Error404.defaultProps = {
staticContext: {},
};
export default Error404;
```
|
```java
package com.lcodecore.twinklingrefreshlayout;
import android.os.Bundle;
import android.os.Handler;
import android.support.v7.app.AppCompatActivity;
import android.support.v7.widget.RecyclerView;
import android.support.v7.widget.StaggeredGridLayoutManager;
import android.view.View;
import android.view.WindowManager;
import com.lcodecore.tkrefreshlayout.RefreshListenerAdapter;
import com.lcodecore.tkrefreshlayout.TwinklingRefreshLayout;
import com.lcodecore.tkrefreshlayout.header.bezierlayout.BezierLayout;
import com.lcodecore.twinklingrefreshlayout.adapter.PhotoAdapter;
import com.lcodecore.twinklingrefreshlayout.beans.Photo;
import java.util.ArrayList;
import java.util.List;
/**
* Created by lcodecore on 2017/3/4.
*/
public class NestedLayoutActivity extends AppCompatActivity {
private PhotoAdapter photoAdapter;
@Override
protected void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
setContentView(R.layout.activity_nested_layout);
setupRecyclerView((RecyclerView) findViewById(R.id.recyclerview));
findViewById(R.id.bt_back).setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View v) {
finish();
}
});
getWindow().setFlags(WindowManager.LayoutParams.FLAG_FULLSCREEN, WindowManager.LayoutParams.FLAG_FULLSCREEN);
}
private void setupRecyclerView(RecyclerView rv) {
rv.setLayoutManager(new StaggeredGridLayoutManager(2, StaggeredGridLayoutManager.VERTICAL));
photoAdapter = new PhotoAdapter();
rv.setAdapter(photoAdapter);
final TwinklingRefreshLayout refreshLayout = (TwinklingRefreshLayout) findViewById(R.id.refresh);
// ProgressLayout headerView = new ProgressLayout(this);
BezierLayout headerView = new BezierLayout(this);
refreshLayout.setHeaderView(headerView);
refreshLayout.setMaxHeadHeight(140);
// refreshLayout.setFloatRefresh(true);
// refreshLayout.setPureScrollModeOn(true);
refreshLayout.setOverScrollBottomShow(false);
refreshLayout.setTargetView(rv);
// refreshLayout.setAutoLoadMore(true);
// addHeader();
refreshCard();
refreshLayout.setOnRefreshListener(new RefreshListenerAdapter() {
@Override
public void onRefresh(final TwinklingRefreshLayout refreshLayout) {
new Handler().postDelayed(new Runnable() {
@Override
public void run() {
refreshCard();
refreshLayout.finishRefreshing();
}
}, 2000);
}
@Override
public void onLoadMore(final TwinklingRefreshLayout refreshLayout) {
new Handler().postDelayed(new Runnable() {
@Override
public void run() {
loadMoreCard();
refreshLayout.finishLoadmore();
}
}, 2000);
}
});
// refreshLayout.startRefresh();
}
void refreshCard() {
List<Photo> photos = new ArrayList<>();
// foods.add(new Food("Preparing Salmon Steak Close Up","BY VIKTOR HANACEK",R.drawable.food1,R.drawable.avatar0));
// foods.add(new Food("Fresh & Healthy Fitness Broccoli Pie with Basil","BY VIKTOR HANACEK",R.drawable.food2,R.drawable.avatar1));
// foods.add(new Food("Enjoying a Tasty Burger","BY VIKTOR HANACEK",R.drawable.food3,R.drawable.avatar2));
// foods.add(new Food("Fresh Strawberries and Blackberries in Little Bowl","BY VIKTOR HANACEK",R.drawable.food4,R.drawable.avatar3));
// foods.add(new Food("Baked Healthy Fitness Broccoli Pie with Basil","BY VIKTOR HANACEK",R.drawable.food5,R.drawable.avatar4));
photos.add(new Photo("chest nut", R.drawable.photo1));
photos.add(new Photo("fish", R.drawable.photo2));
photos.add(new Photo("cat", R.drawable.photo10));
photos.add(new Photo("guitar", R.drawable.photo3));
photos.add(new Photo("common-hazel", R.drawable.photo4));
photos.add(new Photo("cherry", R.drawable.photo5));
photos.add(new Photo("flower details", R.drawable.photo6));
photos.add(new Photo("tree", R.drawable.photo7));
photos.add(new Photo("blue berries", R.drawable.photo8));
photos.add(new Photo("snow man", R.drawable.photo9));
photoAdapter.setDataList(photos);
}
void loadMoreCard() {
List<Photo> photos = new ArrayList<>();
photos.add(new Photo("chest nut", R.drawable.photo1));
photos.add(new Photo("fish", R.drawable.photo2));
photos.add(new Photo("cat", R.drawable.photo10));
photos.add(new Photo("guitar", R.drawable.photo3));
photos.add(new Photo("common-hazel", R.drawable.photo4));
photos.add(new Photo("cherry", R.drawable.photo5));
photos.add(new Photo("flower details", R.drawable.photo6));
photos.add(new Photo("tree", R.drawable.photo7));
photos.add(new Photo("blue berries", R.drawable.photo8));
photos.add(new Photo("snow man", R.drawable.photo9));
//chest nut cat and fish guitar common-hazel cherry flower details tree
//blue berries snow man
// foods.add(new Food(R.drawable.food3));
// foods.add(new Food(R.drawable.food2));
// foods.add(new Food(R.drawable.food1));
photoAdapter.addItems(photos);
}
}
```
|
```batchfile
echo off
cd .\..\..\winget-pkgs
rem # Add the remote, call it "upstream":
git remote add upstream path_to_url
rem # Fetch all the branches of that remote into remote-tracking branches
git fetch upstream
rem # Make sure that you're on your master branch:
git checkout master
rem git branch -D oleg-shilo_cs-script_4.8.15.0
rem git branch
rem # Rewrite your master branch so that any commits of yours that
rem # aren't already in upstream/master are replayed on top of that
rem # other branch:
git rebase upstream/master
cd ..\cs-script\src
.\out\Windows\cscs.exe -c:0 -ng:csc .\out\ci\update_winget_scripts
```
|
The 1996 Singer Champions Trophy was held in Sharjah, UAE, between November 7-15, 1996. Three national teams took part: New Zealand, Pakistan, and Sri Lanka.
The 1996 Champions Trophy started with a double round-robin tournament where each team played the other twice. The two leading teams qualified for the final. Pakistan won the tournament and US$30,000. Runners-up New Zealand won US$15,000.
The beneficiaries of the tournament were Talat Ali, Sadiq Mohammad and Ijaz Ahmed (all Pakistan) who each received US$35,000.
Matches
Group stage
Final
New Zealand qualified for the final because they had taken more points than Sri Lanka in their head-to-head games.
See also
Sharjah Cup
References
Cricket Archive: Singer Champions Trophy 1996/97
ESPNCricinfo: Singer Champions Trophy, 1996/97
International cricket competitions from 1994–95 to 1997
Singer Champions Trophy, 1996
1996 in Emirati sport
International cricket competitions in the United Arab Emirates
|
Sunshine and Rain is the eleventh studio album by American country singer Connie Smith. It was released in October 1968 via RCA Victor and included 12 tracks. Sunshine and Rain featured an assortment of both new material and covers of songs by other country artists. The album reached the top 40 of the American country albums chart and received a favorable review from Billboard magazine following its release.
Background
Connie Smith was at the peak of her career in the mid 1960s with a series of uninterrupted top ten country singles. This was launched with her 1964 debut single, "Once a Day", which topped the country songs chart for eight weeks and brought a string of top ten singles in the years that followed. The RCA label issued ten studio albums of Smith's material between 1965 and 1968. String instrumentation was brought onto her tenth studio album to give it a more country pop sound. This sound would continue with her eleventh album, Sunshine and Rain.
Recording and content
The recording sessions for Sunshine and Rain took place between May 1967 and July 1968 at the RCA Victor Studio in Nashville, Tennessee. The sessions were produced by Bob Ferguson, Smith's longtime producer at RCA Victor. A total of 12 tracks comprised the collection. Several new recordings were part of the album, including two cuts penned by Dallas Frazier: "How Much Lonelier Can Lonely Be" and "Sundown of My Mind". Other new recordings included the Harlan Howard-penned "To Chicago with Love", which featured a spoken recitation by Smith. She also cut Howard's original tune, "The Deepening Snow", which she found at the Tree Publishers songwriting company. The song has since been one of Smith's most requested songs in her catalog.
The album also featured covers of songs first recorded by other artists. "Nat'chilly Ain't No Good" was composed by Jerry Reed but was first released as a single by his wife, Priscilla Mitchell. Although Smith felt it to be "different from most of what I do", she ultimately told Bob Ferguson that it "would be fun" to record. The album also features a female covers of Glen Campbell's "Gentle on My Mind" and Waylon Jennings's "Only Daddy That'll Walk the Line". Smith recounted only recording the latter song because of a guitar solo performed by Wayne Moss, whom she got to play on her own record. "I did it in a different key than Waylon so that was work for Wayne, but he did it!" Smith also cut Jan Howard's (wife of Harlan Howard) "What Makes a Man Wander".
Release and reception
Sunshine and Rain was originally released in October 1968 on the RCA Victor label. It was the eleventh studio album released in Smith's career and the tenth with RCA Victor. The disc was originally distributed as a vinyl LP, with six songs on either side of the record. Decades later, the album was re-released through Sony Music Entertainment to digital and streaming sites. Following its initial release, Billboard magazine gave the album a positive response in their November 1968 issue. Reviewers praised the "heartbreak" material included on the project and highlighted the tracks "The Hurt Goes On", "How Much Lonelier Can Lonely Be", and "The Deepening Snow". Sunshine and Rain spent ten weeks on the American Billboard Top Country Albums chart, peaking at number 32 in January 1969. It was Smith's lowest peaking album up to that point in her career and her second to miss the top 20.
Track listings
Vinyl version
Digital version
Personnel
All credits are adapted from the liner notes of Sunshine and Rain and the biography booklet by Barry Mazor titled Just for What I Am.
Musical personnel
Byron Bach – cello
Brenton Banks – violin
Howard Carpenter – viola
Jerry Carrigan – drums
Dorothy Dillard – background vocals
Bobby L. Dyson – electric bass
Ray Edenton – guitar
Johnny Gimble – fiddle
Solie Fott – violin
Buddy Harman – drums
Russ Hicks – steel guitar
Priscilla Hubbard – background vocals
Lillian Hunt – violin
Charles Justice – fiddle
Martin Katahn – violin
John Kline – viola
Shelly Kurland – violin
Charlie McCoy – electric bass, harmonica
Piere Menard – violin
Weldon Myrick – steel guitar
Louis Nunley – background vocals
Dean Porter – guitar
Hargus "Pig" Robbins – piano
Connie Smith – lead vocals
Roby Story – violin
Gary Vanosdale – viola
Bill Walker – vibes
Lamar Watkins – guitar
Harvey Wolfe – cello
William Wright – background vocals
Technical personnel
Jesse Burt – Liner Notes
Bob Ferguson – Producer
Jim Malloy – Engineer
Bill Vandevort – Engineer
Chart performance
Release history
References
Footnotes
Books
1968 albums
Albums produced by Bob Ferguson (music)
Connie Smith albums
RCA Victor albums
|
```python
#!/usr/bin/env python
#############################################################################
##
## All rights reserved.
##
## This file is part of the examples of PyQt.
##
## $QT_BEGIN_LICENSE:BSD$
## You may use this file under the terms of the BSD license as follows:
##
## "Redistribution and use in source and binary forms, with or without
## modification, are permitted provided that the following conditions are
## met:
## * Redistributions of source code must retain the above copyright
## notice, this list of conditions and the following disclaimer.
## * Redistributions in binary form must reproduce the above copyright
## notice, this list of conditions and the following disclaimer in
## the documentation and/or other materials provided with the
## distribution.
## * Neither the name of Nokia Corporation and its Subsidiary(-ies) nor
## the names of its contributors may be used to endorse or promote
## products derived from this software without specific prior written
## permission.
##
## THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
## "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
## LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
## A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
## OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
## SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
## LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
## DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
## THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
## (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
## OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE."
## $QT_END_LICENSE$
##
#############################################################################
from PyQt5.QtCore import QRect, QSize, Qt
from PyQt5.QtWidgets import (QApplication, QFrame, QLabel, QLayout,
QTextBrowser, QWidget, QWidgetItem)
class ItemWrapper(object):
def __init__(self, i, p):
self.item = i
self.position = p
class BorderLayout(QLayout):
West, North, South, East, Center = range(5)
MinimumSize, SizeHint = range(2)
def __init__(self, parent=None, margin=None, spacing=-1):
super(BorderLayout, self).__init__(parent)
if margin is not None:
self.setContentsMargins(margin, margin, margin, margin)
self.setSpacing(spacing)
self.list = []
def __del__(self):
l = self.takeAt(0)
while l is not None:
l = self.takeAt(0)
def addItem(self, item):
self.add(item, self.West)
def addWidget(self, widget, position):
self.add(QWidgetItem(widget), position)
def expandingDirections(self):
return Qt.Horizontal | Qt.Vertical
def hasHeightForWidth(self):
return False
def count(self):
return len(self.list)
def itemAt(self, index):
if index < len(self.list):
return self.list[index].item
return None
def minimumSize(self):
return self.calculateSize(self.MinimumSize)
def setGeometry(self, rect):
center = None
eastWidth = 0
westWidth = 0
northHeight = 0
southHeight = 0
centerHeight = 0
super(BorderLayout, self).setGeometry(rect)
for wrapper in self.list:
item = wrapper.item
position = wrapper.position
if position == self.North:
item.setGeometry(QRect(rect.x(), northHeight,
rect.width(), item.sizeHint().height()))
northHeight += item.geometry().height() + self.spacing()
elif position == self.South:
item.setGeometry(QRect(item.geometry().x(),
item.geometry().y(), rect.width(),
item.sizeHint().height()))
southHeight += item.geometry().height() + self.spacing()
item.setGeometry(QRect(rect.x(),
rect.y() + rect.height() - southHeight + self.spacing(),
item.geometry().width(), item.geometry().height()))
elif position == self.Center:
center = wrapper
centerHeight = rect.height() - northHeight - southHeight
for wrapper in self.list:
item = wrapper.item
position = wrapper.position
if position == self.West:
item.setGeometry(QRect(rect.x() + westWidth,
northHeight, item.sizeHint().width(), centerHeight))
westWidth += item.geometry().width() + self.spacing()
elif position == self.East:
item.setGeometry(QRect(item.geometry().x(),
item.geometry().y(), item.sizeHint().width(),
centerHeight))
eastWidth += item.geometry().width() + self.spacing()
item.setGeometry(QRect(rect.x() + rect.width() - eastWidth + self.spacing(),
northHeight, item.geometry().width(),
item.geometry().height()))
if center:
center.item.setGeometry(QRect(westWidth, northHeight,
rect.width() - eastWidth - westWidth, centerHeight))
def sizeHint(self):
return self.calculateSize(self.SizeHint)
def takeAt(self, index):
if index >= 0 and index < len(self.list):
layoutStruct = self.list.pop(index)
return layoutStruct.item
return None
def add(self, item, position):
self.list.append(ItemWrapper(item, position))
def calculateSize(self, sizeType):
totalSize = QSize()
for wrapper in self.list:
position = wrapper.position
itemSize = QSize()
if sizeType == self.MinimumSize:
itemSize = wrapper.item.minimumSize()
else: # sizeType == self.SizeHint
itemSize = wrapper.item.sizeHint()
if position in (self.North, self.South, self.Center):
totalSize.setHeight(totalSize.height() + itemSize.height())
if position in (self.West, self.East, self.Center):
totalSize.setWidth(totalSize.width() + itemSize.width())
return totalSize
class Window(QWidget):
def __init__(self):
super(Window, self).__init__()
centralWidget = QTextBrowser()
centralWidget.setPlainText("Central widget")
layout = BorderLayout()
layout.addWidget(centralWidget, BorderLayout.Center)
# Because BorderLayout doesn't call its super-class addWidget() it
# doesn't take ownership of the widgets until setLayout() is called.
# Therefore we keep a local reference to each label to prevent it being
# garbage collected too soon.
label_n = self.createLabel("North")
layout.addWidget(label_n, BorderLayout.North)
label_w = self.createLabel("West")
layout.addWidget(label_w, BorderLayout.West)
label_e1 = self.createLabel("East 1")
layout.addWidget(label_e1, BorderLayout.East)
label_e2 = self.createLabel("East 2")
layout.addWidget(label_e2, BorderLayout.East)
label_s = self.createLabel("South")
layout.addWidget(label_s, BorderLayout.South)
self.setLayout(layout)
self.setWindowTitle("Border Layout")
def createLabel(self, text):
label = QLabel(text)
label.setFrameStyle(QFrame.Box | QFrame.Raised)
return label
if __name__ == '__main__':
import sys
app = QApplication(sys.argv)
window = Window()
window.show()
sys.exit(app.exec_())
```
|
```xml
train_net: "models/pascal_voc/ZF/faster_rcnn_alt_opt/stage1_fast_rcnn_train.pt"
base_lr: 0.001
lr_policy: "step"
gamma: 0.1
stepsize: 30000
display: 20
average_loss: 100
momentum: 0.9
weight_decay: 0.0005
# We disable standard caffe solver snapshotting and implement our own snapshot
# function
snapshot: 0
# We still use the snapshot prefix, though
snapshot_prefix: "zf_fast_rcnn"
```
|
Rupert of Palatinate-Simmern (16 October 1461 – 19 April 1507) was a German nobleman and clergyman of the house of Palatinate-Simmern. From 1492 until his death he was the forty-fifth bishop of Regensburg as Rupert II.
Life
He was the son of Frederick I, Count Palatine of Simmern and Margaret of Guelders. He and his brothers Stephen and Frederick matriculated in the juristic faculty of the 'Universitas Studii Coloniensis' (the old university of Cologne).
He suffered from a severe illness known as the Franzosenkrankheit or the French Disease, a term covering both syphilis and yaws - it prevented him from exercising his office and eventually proved fatal. His bishopric was devastated by the War of the Succession of Landshut and its territories were altered by the creation of the dukedom of Palatinate-Neuburg. One of those to whom he delegated his authority was the inquisitor Heinrich Kramer, to compensate for the lower clergy's lack of energy in prosecuting witches and wizards in Abensberg.
Bibliography
Michael Buchberger (ed.): 1200 Jahre Bistum Regensburg. Regensburg 1939, S.44f.
Josef Staber: Kirchengeschichte des Bistums Regensburg. Regensburg 1966, S. 94f.
References
1461 births
1507 deaths
Roman Catholic bishops of Regensburg
15th-century Roman Catholic bishops in Bavaria
16th-century Roman Catholic bishops in Bavaria
Sons of monarchs
|
```javascript
import Icon from '../components/Icon.vue'
Icon.register({
skiing: {
width: 512,
height: 512,
paths: [
{
d: 'M432 96c-26.5 0-48-21.5-48-48s21.5-48 48-48 48 21.5 48 48-21.5 48-48 48zM505 452.1c9.3 9.3 9.3 24.5 0 33.8-17 17-39.8 26-63 26-12.6 0-25.2-2.6-37.1-8.1l-391.9-202.5c-11.8-6-16.4-20.5-10.3-32.3 6.1-11.8 20.6-16.3 32.3-10.3l197.9 102.3 45.9-68.8-75.1-75.2c-14.3-14.4-20.6-34.5-17.7-54.4l107 53.1 40.4 40.5c16.2 16.1 18.7 41.6 6 60.6l-49.2 73.8 135.8 70.2c14.6 6.7 33 3.4 45.1-8.7 9.3-9.4 24.5-9.4 33.9 0zM120 91.6l-26.2-23c-2.2-1.9-2.4-5.2-0.5-7.4 1.3-1.5 3.2-2.1 5-1.7l34.4 7h0.2l11.1-21.7c13.7 7 21.2 21.1 20.9 35.6l62.5 31 81.2-32.5c43.6-17.4 76.4 15 84.5 39.2l17.1 51.2 52.1 26.1c15.8 7.9 22.2 27.1 14.3 42.9-7.9 15.8-27 22.2-42.9 14.3l-58.1-29c-11.4-5.7-20-15.6-24-27.7l-6.4-19.1-32.4 13-114.5-56.8c0.1-0.1 0.1-0.2 0.2-0.3l-47.2-23.4c-11.6 9.7-28.4 12.1-42.8 4.8z'
}
]
}
})
```
|
Chetone meta is a moth of the family Erebidae. It was described by Herbert Druce in 1895. It is found in Colombia.
References
Chetone
Moths described in 1895
|
```smalltalk
using System.Threading.Tasks;
using Microsoft.AspNetCore.Http;
using Microsoft.AspNetCore.Mvc.Routing;
using Microsoft.AspNetCore.Routing;
using Volo.Abp.DependencyInjection;
using Volo.Abp.Features;
using Volo.CmsKit.Features;
using Volo.CmsKit.Public.Pages;
namespace Volo.CmsKit.Public.Web.Pages;
public class CmsKitPageRouteValueTransformer : DynamicRouteValueTransformer, ITransientDependency
{
protected IFeatureChecker FeatureChecker { get; }
protected IPagePublicAppService PagePublicAppService { get; }
public CmsKitPageRouteValueTransformer(IFeatureChecker featureChecker, IPagePublicAppService pagePublicAppService)
{
FeatureChecker = featureChecker;
PagePublicAppService = pagePublicAppService;
}
public override async ValueTask<RouteValueDictionary> TransformAsync(HttpContext httpContext, RouteValueDictionary values)
{
if (values.TryGetValue("slug", out var slugParameter) && slugParameter is not null)
{
if (!await FeatureChecker.IsEnabledAsync(CmsKitFeatures.PageEnable))
{
return values;
}
var slug = slugParameter.ToString().TrimStart('/');
var exist = await PagePublicAppService.DoesSlugExistAsync(slug);
if (exist)
{
values["page"] = "/Public/CmsKit/Pages/Index";
}
}
return values;
}
}
```
|
```javascript
/**
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
const {
beforeUserCreated,
beforeUserSignedIn,
HttpsError,
} = require("firebase-functions/v2/identity");
const {admin} = require("firebase-admin");
admin.initializeApp();
const db = admin.firestore();
// [START v2ValidateNewUser]
// [START v2beforeCreateFunctionTrigger]
// Block account creation with any non-acme email address.
exports.validatenewuser = beforeUserCreated((event) => {
// [END v2beforeCreateFunctionTrigger]
// [START v2readUserData]
// User data passed in from the CloudEvent.
const user = event.data;
// [END v2readUserData]
// [START v2domainHttpsError]
// Only users of a specific domain can sign up.
if (!user?.email?.includes("@acme.com")) {
// Throw an HttpsError so that Firebase Auth rejects the account creation.
throw new HttpsError("invalid-argument", "Unauthorized email");
}
// [END v2domainHttpsError]
});
// [END v2ValidateNewUser]
// [START v2CheckForBan]
// [START v2beforeSignInFunctionTrigger]
// Block account sign in with any banned account.
exports.checkforban = beforeUserSignedIn(async (event) => {
// [END v2beforeSignInFunctionTrigger]
// [START v2readEmailData]
// Email passed from the CloudEvent.
const email = event.data.email || "";
// [END v2readEmailData]
// [START v2documentGet]
// Obtain a document in Firestore of the banned email address.
const doc = await db.collection("banned").doc(email).get();
// [END v2documentGet]
// [START v2bannedHttpsError]
// Checking that the document exists for the email address.
if (doc.exists) {
// Throw an HttpsError so that Firebase Auth rejects the account sign in.
throw new HttpsError("invalid-argument", "Unauthorized email");
}
// [END v2bannedHttpsError]
});
// [START v2CheckForBan]
```
|
```yaml
# or more contributor license agreements. See the NOTICE file
# distributed with this work for additional information
# regarding copyright ownership. The ASF licenses this file
#
# path_to_url
#
# Unless required by applicable law or agreed to in writing,
# "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
# specific language governing permissions and limitations
#
# This container provide an OpenVPN service.
# It could let user or developer easily access CIAB network.
#
# To start up CiaB with OpenVPN optional container:
#
# alias mydc="docker compose "` \
# `"-f $PWD/docker-compose.yml "` \
# `"-f $PWD/docker-compose.expose-ports.yml "` \
# `"-f $PWD/optional/docker-compose.vpn.yml "` \
# `"-f $PWD/optional/docker-compose.vpn.expose-ports.yml "
#
# mydc rm -fv
# mydc up
#
# All certificates, keys, and client configuration are stored
# at infrastruture/cdn-in-a-box/optional/vpn/vpnca
# You just simply change ``REALHOSTIP`` and ``REALPORT`` of
# ``client.ovpn`` to fit your environment, and then you can
# connect to this OpenVPN server by it.
---
services:
vpn:
build:
context: .
dockerfile: optional/vpn/Dockerfile
hostname: vpn
domainname: infra.ciab.test
privileged: true
depends_on:
- dns
env_file:
- variables.env
volumes:
- ./optional/vpn/vpnca:/vpnca
- shared:/shared
volumes:
schemas:
external: false
shared:
external: false
```
|
```javascript
0xA_1
```
|
NewBoy FZCO () is a family-owned company based in Dubai, UAE, and the exclusive owner of the famous doll brand Fulla. Fulla is thought to be the best-selling toy in the girls doll category throughout the Arab world. Fulla is the cultural adaptation of family values as reflected within the cultural norms throughout the region.
Founded in 1999, NewBoy engages in the marketing and distribution of toys, food, stationery, nursery and toiletries products and has an extensive distribution network in the MENA region with strong focus on KSA as a major hub. The company also markets selected toy brands and ranges internationally including: Europe, United States, Korea, India and Indonesia.
Business Divisions
Licensing
NewBoy's involvement in licensing activities goes back to the earliest days of the company, when NewBoy advertised its own label products on TV. The ads featured endearing little characters that proved to be very popular with children across the region. Accordingly, NewBoy realized the enormous benefits of having such popular character endorsement.
Since then, licensing has become one of the most strategic business models for NewBoy, where magnifying the benefits drawn from a successful character is key. NewBoy acquires, sells, and markets licenses for some of the hottest characters throughout a number of categories including food, textile, cosmetics, jewelry, etc.
International business division
The division was first established in late 2003 by acquiring worldwide rights for TV, merchandizing and toys for Let's & Go property (Japanese property from ShoPro). The property is based on an animated children's TV program which features the adventures of two boys who have a passion for mini 4-wheel-drive car racing. This was a huge success for NewBoy. The property was already launched in Italy, Spain, Portugal, Greece, Mexico, Puerto Rico, Argentina and Panama. New launching plans are currently underway in France, Brazil, Germany and South Africa.
The division is currently working on a new toy concept and has recently entered into a new agreement with d-rights Inc., an integrated production company based in Japan handling entertainment contents in animation and live-action films around the world. Under the new agreement, NewBoy and d-rights were to co-produce a new TV animation in 52 episodes, 30 minutes each. The new animation would be targeted at boys 4–12 years old and based on the new toy concept.
Private Label
The Private Label division was established strategically to create and develop NewBoy's own brands across a wide range of product categories. NewBoy is focused in developing brands and products that adhere to the quality and safety standards.
NewBoy brands currently include:
Fulla – fashion doll and associated TV show Fulla Princess, remade from Secret Jouju by Korean toy company Young Toys
Fun to Learn – electronic learning aids
Baby Habibi – baby dolls and accessories
True Play – nursery and toddler toys
Current status
Currently NewBoy is closed while operating under different names one of them is Wahat Al-Atfal.
References
External links
NewBoy
Companies based in Dubai
Toy companies of the United Arab Emirates
Companies established in 1999
1999 establishments in the United Arab Emirates
Food and drink companies of the United Arab Emirates
Family-owned companies
|
Benjamin Rubin (September 27, 1917 in New York, New York – March 8, 2010) was an American microbiologist, known as the inventor of the bifurcated vaccination needle, which played an important role in the eradication of smallpox. Rubin invented this device by taking the eyelet of a sewing machine needle and grinding it down.
In 1992, Rubin was inducted into the National Inventors Hall of Fame.
References
1917 births
2010 deaths
American microbiologists
Jewish American scientists
Vaccinologists
21st-century American Jews
|
Qazanabad (, also Romanized as Qāzānābād) is a village in Oshnavieh-ye Shomali Rural District, in the Central District of Oshnavieh County, West Azerbaijan Province, Iran. At the 2006 census, its population was 147, in 22 families.
References
Populated places in Oshnavieh County
|
```c
/*****************************************************************************
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of Intel Corporation nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
THE POSSIBILITY OF SUCH DAMAGE.
*****************************************************************************
* Contents: Native middle-level C interface to LAPACK function cunmhr
* Author: Intel Corporation
*****************************************************************************/
#include "lapacke_utils.h"
lapack_int API_SUFFIX(LAPACKE_cunmhr_work)( int matrix_layout, char side, char trans,
lapack_int m, lapack_int n, lapack_int ilo,
lapack_int ihi, const lapack_complex_float* a,
lapack_int lda, const lapack_complex_float* tau,
lapack_complex_float* c, lapack_int ldc,
lapack_complex_float* work, lapack_int lwork )
{
lapack_int info = 0;
if( matrix_layout == LAPACK_COL_MAJOR ) {
/* Call LAPACK function and adjust info */
LAPACK_cunmhr( &side, &trans, &m, &n, &ilo, &ihi, a, &lda, tau, c, &ldc,
work, &lwork, &info );
if( info < 0 ) {
info = info - 1;
}
} else if( matrix_layout == LAPACK_ROW_MAJOR ) {
lapack_int r = API_SUFFIX(LAPACKE_lsame)( side, 'l' ) ? m : n;
lapack_int lda_t = MAX(1,r);
lapack_int ldc_t = MAX(1,m);
lapack_complex_float* a_t = NULL;
lapack_complex_float* c_t = NULL;
/* Check leading dimension(s) */
if( lda < r ) {
info = -9;
API_SUFFIX(LAPACKE_xerbla)( "LAPACKE_cunmhr_work", info );
return info;
}
if( ldc < n ) {
info = -12;
API_SUFFIX(LAPACKE_xerbla)( "LAPACKE_cunmhr_work", info );
return info;
}
/* Query optimal working array(s) size if requested */
if( lwork == -1 ) {
LAPACK_cunmhr( &side, &trans, &m, &n, &ilo, &ihi, a, &lda_t, tau, c,
&ldc_t, work, &lwork, &info );
return (info < 0) ? (info - 1) : info;
}
/* Allocate memory for temporary array(s) */
a_t = (lapack_complex_float*)
LAPACKE_malloc( sizeof(lapack_complex_float) * lda_t * MAX(1,r) );
if( a_t == NULL ) {
info = LAPACK_TRANSPOSE_MEMORY_ERROR;
goto exit_level_0;
}
c_t = (lapack_complex_float*)
LAPACKE_malloc( sizeof(lapack_complex_float) * ldc_t * MAX(1,n) );
if( c_t == NULL ) {
info = LAPACK_TRANSPOSE_MEMORY_ERROR;
goto exit_level_1;
}
/* Transpose input matrices */
API_SUFFIX(LAPACKE_cge_trans)( matrix_layout, r, r, a, lda, a_t, lda_t );
API_SUFFIX(LAPACKE_cge_trans)( matrix_layout, m, n, c, ldc, c_t, ldc_t );
/* Call LAPACK function and adjust info */
LAPACK_cunmhr( &side, &trans, &m, &n, &ilo, &ihi, a_t, &lda_t, tau, c_t,
&ldc_t, work, &lwork, &info );
if( info < 0 ) {
info = info - 1;
}
/* Transpose output matrices */
API_SUFFIX(LAPACKE_cge_trans)( LAPACK_COL_MAJOR, m, n, c_t, ldc_t, c, ldc );
/* Release memory and exit */
LAPACKE_free( c_t );
exit_level_1:
LAPACKE_free( a_t );
exit_level_0:
if( info == LAPACK_TRANSPOSE_MEMORY_ERROR ) {
API_SUFFIX(LAPACKE_xerbla)( "LAPACKE_cunmhr_work", info );
}
} else {
info = -1;
API_SUFFIX(LAPACKE_xerbla)( "LAPACKE_cunmhr_work", info );
}
return info;
}
```
|
```c++
// your_sha256_hash------------
// - Open3D: www.open3d.org -
// your_sha256_hash------------
// your_sha256_hash------------
#include "WidgetProxy.h"
#include "open3d/visualization/gui/Color.h"
#include "open3d/visualization/gui/Events.h"
namespace open3d {
namespace visualization {
namespace gui {
struct WidgetProxy::Impl {
std::shared_ptr<Widget> widget_;
bool need_layout_ = false;
};
WidgetProxy::WidgetProxy() : impl_(new WidgetProxy::Impl()) {}
WidgetProxy::~WidgetProxy() {}
std::shared_ptr<Widget> WidgetProxy::GetActiveWidget() const {
return impl_->widget_;
}
void WidgetProxy::SetWidget(std::shared_ptr<Widget> widget) {
impl_->widget_ = widget;
impl_->need_layout_ = true;
}
std::shared_ptr<Widget> WidgetProxy::GetWidget() { return GetActiveWidget(); }
void WidgetProxy::AddChild(std::shared_ptr<Widget> child) {
auto widget = GetActiveWidget();
if (widget) {
widget->AddChild(child);
}
}
const std::vector<std::shared_ptr<Widget>> WidgetProxy::GetChildren() const {
auto widget = GetActiveWidget();
if (widget) {
return widget->GetChildren();
}
return Widget::GetChildren();
}
const Rect& WidgetProxy::GetFrame() const {
auto widget = GetActiveWidget();
if (widget) {
return widget->GetFrame();
}
return Widget::GetFrame();
}
void WidgetProxy::SetFrame(const Rect& f) {
auto widget = GetActiveWidget();
if (widget) {
widget->SetFrame(f);
}
Widget::SetFrame(f);
}
const Color& WidgetProxy::GetBackgroundColor() const {
auto widget = GetActiveWidget();
if (widget) {
return widget->GetBackgroundColor();
}
return Widget::GetBackgroundColor();
}
bool WidgetProxy::IsDefaultBackgroundColor() const {
auto widget = GetActiveWidget();
if (widget) {
return widget->IsDefaultBackgroundColor();
}
return Widget::IsDefaultBackgroundColor();
}
void WidgetProxy::SetBackgroundColor(const Color& color) {
auto widget = GetActiveWidget();
if (widget) {
widget->SetBackgroundColor(color);
}
Widget::SetBackgroundColor(color);
}
bool WidgetProxy::IsVisible() const {
auto widget = GetActiveWidget();
if (widget) {
return Widget::IsVisible() && widget->IsVisible();
}
return false;
}
void WidgetProxy::SetVisible(bool vis) {
auto widget = GetActiveWidget();
if (widget) {
widget->SetVisible(vis);
}
}
bool WidgetProxy::IsEnabled() const {
auto widget = GetActiveWidget();
if (widget) {
return Widget::IsEnabled() && widget->IsEnabled();
}
return false;
}
void WidgetProxy::SetEnabled(bool enabled) {
auto widget = GetActiveWidget();
if (widget) {
widget->SetEnabled(enabled);
}
}
void WidgetProxy::SetTooltip(const char* text) {
auto widget = GetActiveWidget();
if (widget) {
widget->SetTooltip(text);
}
Widget::SetTooltip(text);
}
const char* WidgetProxy::GetTooltip() const {
auto widget = GetActiveWidget();
if (widget) {
return widget->GetTooltip();
}
return Widget::GetTooltip();
}
Size WidgetProxy::CalcPreferredSize(const LayoutContext& context,
const Constraints& constraints) const {
auto widget = GetActiveWidget();
if (widget) {
return widget->CalcPreferredSize(context, constraints);
}
return Widget::CalcPreferredSize(context, constraints);
}
Size WidgetProxy::CalcMinimumSize(const LayoutContext& context) const {
auto widget = GetActiveWidget();
if (widget) {
return widget->CalcMinimumSize(context);
}
return Widget::CalcMinimumSize(context);
}
void WidgetProxy::Layout(const LayoutContext& context) {
auto widget = GetActiveWidget();
if (widget) {
widget->Layout(context);
}
}
Widget::DrawResult WidgetProxy::Draw(const DrawContext& context) {
if (!IsVisible()) {
return DrawResult::NONE;
}
DrawResult result = DrawResult::NONE;
auto widget = GetActiveWidget();
if (widget) {
result = widget->Draw(context);
}
if (impl_->need_layout_) {
impl_->need_layout_ = false;
result = DrawResult::RELAYOUT;
}
return result;
}
Widget::EventResult WidgetProxy::Mouse(const MouseEvent& e) {
if (!IsVisible()) {
return EventResult::IGNORED;
}
auto widget = GetActiveWidget();
if (widget) {
return widget->Mouse(e);
}
return EventResult::DISCARD;
}
Widget::EventResult WidgetProxy::Key(const KeyEvent& e) {
if (!IsVisible()) {
return EventResult::IGNORED;
}
auto widget = GetActiveWidget();
if (widget) {
return widget->Key(e);
}
return EventResult::DISCARD;
}
Widget::DrawResult WidgetProxy::Tick(const TickEvent& e) {
auto result = DrawResult::NONE;
auto widget = GetActiveWidget();
if (widget) {
result = widget->Tick(e);
}
return result;
}
} // namespace gui
} // namespace visualization
} // namespace open3d
```
|
36 Andromedae is a visual binary star system in the northern constellation of Andromeda. The designation is from the star catalogue of English astronomer John Flamsteed, first published in 1712. It is faintly visible to the naked eye with an apparent visual magnitude of 5.45. An annual parallax shift of 26.33 mas yields a distance estimate of about 124 light years. The system is moving closer to the Sun with a radial velocity of −0.8 km/s.
The binary nature of this system was discovered in 1832 by the German-Russian astronomer Wilhelm von Struve. It is a wide binary with an orbital period of 167.5 years and an eccentricity of 0.3. As of 2016, the pair had an angular separation of 0.90 arc seconds along a position angle of 330°.
The primary, component A, is a magnitude 6.12 F-type star with a stellar classification of G8 IV, while the secondary, component B, has a magnitude of 6.54 and is a K-type star of class K3 IV. Their brightness compared to their temperatures indicate they are evolving subgiant stars. However, at least one of the components is subject to flare activity, which may suggest they are instead pre-main sequence stars.
References
External links
Image 36 Andromedae
G-type subgiants
K-type subgiants
Binary stars
Andromeda (constellation)
Durchmusterung objects
Andromedae, 36
005286
004288
0258
|
```prolog
# !!!!!!! DO NOT EDIT THIS FILE !!!!!!!
# This file is machine-generated by lib/unicore/mktables from the Unicode
# database, Version 15.0.0. Any changes made here will be lost!
# !!!!!!! INTERNAL PERL USE ONLY !!!!!!!
# This file is for internal use by core Perl only. The format and even the
# name or existence of this file are subject to change without notice. Don't
# use it directly. Use Unicode::UCD to access the Unicode character data
# base.
return <<'END';
V16
8577
8578
65830
65831
65862
65863
65870
65871
65906
65907
68063
68064
126096
126097
126240
126241
END
```
|
Jan Holpert (born 4 May 1968) is a German former handball player. He competed at the 1992 Summer Olympics, the 1996 Summer Olympics and the 2000 Summer Olympics.
References
External links
1968 births
Living people
German male handball players
Olympic handball players for Germany
Handball players at the 1992 Summer Olympics
Handball players at the 1996 Summer Olympics
Handball players at the 2000 Summer Olympics
Sportspeople from Flensburg
20th-century German people
|
AFL Tasmania is the Australian Football League (AFL) subsidiary in Tasmania and its governing body for Australian rules football in Tasmania. The organisation is responsible for AFL-linked Australian rules football development in the state.
The Tasmanian Football Association was formed on 12 June 1879 as the colony's first governing body for the sport. However, in February 1999 it was liquidated due to crushing debts. Football Tasmania, structured as a commission independent of clubs, was established in 1999. The body changed its name to AFL Tasmania in 2002 reflecting its control as a subsidiary of the AFL.
The former Victorian Football League club, the Tasmanian Devils Football Club, was also managed by AFL Tasmania.
References
External links
Official Football Tasmania website
Australian rules football governing bodies
Australian rules football in Tasmania
Sports governing bodies in Tasmania
|
The Fellow grade of membership is the highest level of membership, and cannot be applied for directly by the member – instead the candidate must be nominated by others. This grade of membership is conferred by the IEEE Board of Directors in recognition of a high level of demonstrated extraordinary accomplishment.
See also
List of IEEE Fellows
References
Electron Devices Society
|
Matthias of Trakai or of Vilnius (; ; ca. 1370 – 9 May 1453 in Vilnius) was a Lithuanian Roman Catholic clergyman, the first Bishop of Samogitia from its establishment in 1417 until 1422 and the fifth Bishop of Vilnius from 4 May 1422 until 9 May 1453 and an ex officio member of the Council of Lords.
Biography
Matthias graduated from Charles University in Prague with the Master's degree in liberal arts in 1408, and studied in the University of Siena afterwards. Serving as the dean of Trakai, the Grand Duchy of Lithuania, he participated in the Christianization of Samogitia and was a supporter of Vytautas' political aspirations and an active participant in his coronation matters. Matthias was nominated to the newly established post of Samogitian bishop by Vytautas the Great and was consecrated on 24 October 1417 in Trakai.
Matthias was a Samogitian and Lithuanian speaker. According to Jan Długosz, he was a Vilnian of Livonian German origin, while Vytautas has mentioned him being a Lithuanian. The bishop has conducted the marriage of the King of Poland and Grand Duke of Lithuania Jogaila to his last wife Sophia of Halshany in the city of Navahrudak in 1422; he became the bishop of the Diocese of Vilnius later that year. Matthias sent representatives to the Council of Basel and set up the Inquisition to combat the Hussites, founded many churches and strenuously defended the rights and privileges of the Lithuanians. Matthias took care that new Catholic priests would be fluent in the Lithuanian language. He performed Last Rites for the dying Vytautas on 27 October 1430.
References
Bishops of Vilnius
15th-century Roman Catholic bishops in Lithuania
1453 deaths
Charles University alumni
University of Siena alumni
Year of birth uncertain
|
```toml
version = 1
[[analyzers]]
name = "shell"
enabled = true
[[analyzers]]
name = "go"
enabled = true
[analyzers.meta]
import_root = "github.com/luraproject/lura"
```
|
```swift
//
// ViewController.swift
// Sample
//
// Created by Roy Marmelstein on 10/04/2016.
//
import UIKit
import Interpolate
class ViewController: UIViewController, UIScrollViewDelegate {
@IBOutlet weak var scrollView: UIScrollView!
@IBOutlet weak var pageControl: UIPageControl!
let groundView = UIView()
let logoView = UIImageView()
let bojackView = UIImageView()
let bojackShadowView = UIImageView()
let initialBackgroundColor = UIColor(red: 84.0/255.0, green: 187.0/255.0, blue: 253.0/255.0, alpha: 1.0)
// Interpolations
var backgroundColorChange: Interpolate?
var groundPosition: Interpolate?
var bojackPosition: Interpolate?
var bojackShadowPosition: Interpolate?
var logoAlpha: Interpolate?
override func viewDidLoad() {
super.viewDidLoad()
self.view.backgroundColor = initialBackgroundColor
scrollView.contentSize = CGSize(width: self.view.bounds.size.width*2, height: self.view.bounds.size.height)
// Logo view
let logoImage = UIImage(named: "BojackLogo")!
logoView.image = logoImage
scrollView.addSubview(logoView)
logoView.frame.size = logoImage.size
logoView.center = CGPoint(x: self.view.bounds.size.width/2, y: 100)
// Bojack view
let bojackImage = UIImage(named: "Bojack")!
bojackView.image = bojackImage
scrollView.addSubview(bojackView)
bojackView.frame.size = bojackImage.size
bojackView.frame.origin = CGPoint(x: (self.view.bounds.size.width - bojackView.frame.size.width)/2, y: self.view.bounds.size.height - bojackView.frame.size.height)
// Bojack shadow view
let bojackShadowImage = UIImage(named: "BojackShadow")!
bojackShadowView.image = bojackShadowImage
self.view.addSubview(bojackShadowView)
bojackShadowView.frame.size = bojackShadowImage.size
bojackShadowView.frame.origin = CGPoint(x: -bojackShadowView.frame.size.width, y: self.view.bounds.size.height - 150 - bojackShadowView.frame.size.height)
// Ground view
groundView.backgroundColor = UIColor.black
self.view.addSubview(groundView)
groundView.frame.origin = CGPoint(x: 0, y: self.view.bounds.size.height)
groundView.frame.size = CGSize(width: self.view.bounds.size.width, height: 300)
self.view.bringSubviewToFront(pageControl)
self.setupInterpolations()
}
func setupInterpolations() {
let colors: [UIColor] = [initialBackgroundColor, UIColor(red: 255.0/255.0, green: 80.0/255.0, blue: 43.0/255.0, alpha: 1.0), UIColor.green]
backgroundColorChange = Interpolate(values: colors, apply: { [weak self] (color) in
self?.view.backgroundColor = color
})
logoAlpha = Interpolate(from: 1.0, to: 0.0, apply: { [weak self] (alpha) in
self?.logoView.alpha = alpha
})
bojackPosition = Interpolate(from: (self.view.bounds.size.width - bojackView.frame.size.width)/2, to: -bojackView.frame.size.width, apply: { [weak self] (originX) in
self?.bojackView.frame.origin.x = originX
})
bojackShadowPosition = Interpolate(from: -bojackShadowView.frame.size.width, to: (self.view.bounds.size.width - bojackShadowView.frame.size.width)/2, function: SpringInterpolation(damping: 30.0, velocity: 0.0, mass: 1.0, stiffness: 100.0), apply: { [weak self] (originX) in
self?.bojackShadowView.frame.origin.x = originX
})
groundPosition = Interpolate(from: CGPoint(x: 0, y: self.view.bounds.size.height), to: CGPoint(x: 0, y: self.view.bounds.size.height - 150), function: BasicInterpolation.easeOut, apply: { [weak self] (origin) in
self?.groundView.frame.origin = origin
})
}
//MARK: UIScrollViewDelegate
func scrollViewDidScroll(_ scrollView: UIScrollView) {
let scrollProgress = scrollView.contentOffset.x / (scrollView.contentSize.width - scrollView.frame.size.width)
let currentPage = scrollView.contentOffset.x / scrollView.frame.size.width
pageControl.currentPage = lround(Double(currentPage))
let groundProgress = scrollView.contentOffset.x / (scrollView.contentSize.width - 1.5*scrollView.frame.size.width)
backgroundColorChange?.progress = scrollProgress
logoAlpha?.progress = scrollProgress
groundPosition?.progress = groundProgress
bojackPosition?.progress = groundProgress
bojackShadowPosition?.progress = max(groundProgress - 1, 0)
}
}
```
|
```php
<?php
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
*/
namespace Google\Service\Bigquery;
class SparkOptions extends \Google\Collection
{
protected $collection_key = 'pyFileUris';
/**
* @var string[]
*/
public $archiveUris;
/**
* @var string
*/
public $connection;
/**
* @var string
*/
public $containerImage;
/**
* @var string[]
*/
public $fileUris;
/**
* @var string[]
*/
public $jarUris;
/**
* @var string
*/
public $mainClass;
/**
* @var string
*/
public $mainFileUri;
/**
* @var string[]
*/
public $properties;
/**
* @var string[]
*/
public $pyFileUris;
/**
* @var string
*/
public $runtimeVersion;
/**
* @param string[]
*/
public function setArchiveUris($archiveUris)
{
$this->archiveUris = $archiveUris;
}
/**
* @return string[]
*/
public function getArchiveUris()
{
return $this->archiveUris;
}
/**
* @param string
*/
public function setConnection($connection)
{
$this->connection = $connection;
}
/**
* @return string
*/
public function getConnection()
{
return $this->connection;
}
/**
* @param string
*/
public function setContainerImage($containerImage)
{
$this->containerImage = $containerImage;
}
/**
* @return string
*/
public function getContainerImage()
{
return $this->containerImage;
}
/**
* @param string[]
*/
public function setFileUris($fileUris)
{
$this->fileUris = $fileUris;
}
/**
* @return string[]
*/
public function getFileUris()
{
return $this->fileUris;
}
/**
* @param string[]
*/
public function setJarUris($jarUris)
{
$this->jarUris = $jarUris;
}
/**
* @return string[]
*/
public function getJarUris()
{
return $this->jarUris;
}
/**
* @param string
*/
public function setMainClass($mainClass)
{
$this->mainClass = $mainClass;
}
/**
* @return string
*/
public function getMainClass()
{
return $this->mainClass;
}
/**
* @param string
*/
public function setMainFileUri($mainFileUri)
{
$this->mainFileUri = $mainFileUri;
}
/**
* @return string
*/
public function getMainFileUri()
{
return $this->mainFileUri;
}
/**
* @param string[]
*/
public function setProperties($properties)
{
$this->properties = $properties;
}
/**
* @return string[]
*/
public function getProperties()
{
return $this->properties;
}
/**
* @param string[]
*/
public function setPyFileUris($pyFileUris)
{
$this->pyFileUris = $pyFileUris;
}
/**
* @return string[]
*/
public function getPyFileUris()
{
return $this->pyFileUris;
}
/**
* @param string
*/
public function setRuntimeVersion($runtimeVersion)
{
$this->runtimeVersion = $runtimeVersion;
}
/**
* @return string
*/
public function getRuntimeVersion()
{
return $this->runtimeVersion;
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(SparkOptions::class, 'Google_Service_Bigquery_SparkOptions');
```
|
```turing
#!./perl
# test that "use vars;" doesn't load Carp
BEGIN {
chdir 't' if -d 't';
@INC = '../lib';
$ENV{PERL5LIB} = '../lib';
}
$| = 1;
print "1..1\n";
use vars;
# Carp not loaded yet;
print defined $Carp::VERSION ? "not ok 1\n" : "ok 1\n";
```
|
```go
/*
path_to_url
Unless required by applicable law or agreed to in writing, software
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package plugin
import (
"runtime"
"testing"
"time"
cpmtypes "k8s.io/node-problem-detector/pkg/custompluginmonitor/types"
)
func TestNewPluginRun(t *testing.T) {
ruleTimeout := 1 * time.Second
timeoutExitStatus := cpmtypes.Unknown
ext := "sh"
if runtime.GOOS == "windows" {
ext = "cmd"
timeoutExitStatus = cpmtypes.NonOK
}
utMetas := map[string]struct {
Rule cpmtypes.CustomRule
ExitStatus cpmtypes.Status
Output string
}{
"ok": {
Rule: cpmtypes.CustomRule{
Path: "./test-data/ok." + ext,
Timeout: &ruleTimeout,
},
ExitStatus: cpmtypes.OK,
Output: "OK",
},
"non-ok": {
Rule: cpmtypes.CustomRule{
Path: "./test-data/non-ok." + ext,
Timeout: &ruleTimeout,
},
ExitStatus: cpmtypes.NonOK,
Output: "NonOK",
},
"unknown": {
Rule: cpmtypes.CustomRule{
Path: "./test-data/unknown." + ext,
Timeout: &ruleTimeout,
},
ExitStatus: cpmtypes.Unknown,
Output: "UNKNOWN",
},
"non executable": {
Rule: cpmtypes.CustomRule{
// Intentionally run .sh for Windows, this is meant to be not executable.
Path: "./test-data/non-executable.sh",
Timeout: &ruleTimeout,
},
ExitStatus: cpmtypes.Unknown,
Output: "Error in starting plugin. Please check the error log",
},
"longer than 80 stdout with ok exit status": {
Rule: cpmtypes.CustomRule{
Path: "./test-data/longer-than-80-stdout-with-ok-exit-status." + ext,
Timeout: &ruleTimeout,
},
ExitStatus: cpmtypes.OK,
Output: your_sha256_hash4567890123456789",
},
"non defined exit status": {
Rule: cpmtypes.CustomRule{
Path: "./test-data/non-defined-exit-status." + ext,
Timeout: &ruleTimeout,
},
ExitStatus: cpmtypes.Unknown,
Output: "NON-DEFINED-EXIT-STATUS",
},
"sleep 3 second with ok exit status": {
Rule: cpmtypes.CustomRule{
Path: "./test-data/sleep-3-second-with-ok-exit-status." + ext,
Timeout: &ruleTimeout,
},
ExitStatus: timeoutExitStatus,
Output: `Timeout when running plugin "./test-data/sleep-3-second-with-ok-exit-status.` + ext + `": state - signal: killed. output - ""`,
},
}
for k, v := range utMetas {
desp := k
utMeta := v
t.Run(desp, func(t *testing.T) {
conf := cpmtypes.CustomPluginConfig{}
(&conf).ApplyConfiguration()
p := Plugin{config: conf}
gotExitStatus, gotOutput := p.run(utMeta.Rule)
// cut at position max_output_length if expected output is longer than max_output_length bytes
if len(utMeta.Output) > *p.config.PluginGlobalConfig.MaxOutputLength {
utMeta.Output = utMeta.Output[:*p.config.PluginGlobalConfig.MaxOutputLength]
}
if gotExitStatus != utMeta.ExitStatus || gotOutput != utMeta.Output {
t.Errorf("Error in run plugin and get exit status and output for %q. "+
"Got exit status: %v, Expected exit status: %v. "+
"Got output: %q, Expected output: %q",
utMeta.Rule.Path, gotExitStatus, utMeta.ExitStatus, gotOutput, utMeta.Output)
}
})
}
}
```
|
The iAPX 432 (Intel Advanced Performance Architecture) is a discontinued computer architecture introduced in 1981. It was Intel's first 32-bit processor design. The main processor of the architecture, the general data processor, is implemented as a set of two separate integrated circuits, due to technical limitations at the time. Although some early 8086, 80186 and 80286-based systems and manuals also used the iAPX prefix for marketing reasons, the iAPX 432 and the 8086 processor lines are completely separate designs with completely different instruction sets.
The project started in 1975 as the 8800 (after the 8008 and the 8080) and was intended to be Intel's major design for the 1980s. Unlike the 8086, which was designed the following year as a successor to the 8080, the iAPX 432 was a radical departure from Intel's previous designs meant for a different market niche, and completely unrelated to the 8080 or x86 product lines.
The iAPX 432 project is considered a commercial failure for Intel, and was discontinued in 1986.
Description
The iAPX 432 was referred to as a "micromainframe", designed to be programmed entirely in high-level languages. The instruction set architecture was also entirely new and a significant departure from Intel's previous 8008 and 8080 processors as the iAPX 432 programming model is a stack machine with no visible general-purpose registers. It supports object-oriented programming, garbage collection and multitasking as well as more conventional memory management directly in hardware and microcode. Direct support for various data structures is also intended to allow modern operating systems to be implemented using far less program code than for ordinary processors. Intel iMAX 432 is a discontinued operating system for the 432, written entirely in Ada, and Ada was also the intended primary language for application programming. In some aspects, it may be seen as a high-level language computer architecture.
These properties and features resulted in a hardware and microcode design that was more complex than most processors of the era, especially microprocessors. However, internal and external buses are (mostly) not wider than 16-bit, and, just like in other 32-bit microprocessors of the era (such as the 68000 or the 32016), 32-bit arithmetical instructions are implemented by a 16-bit ALU, via random logic and microcode or other kinds of sequential logic. The iAPX 432 enlarged address space over the 8080 was also limited by the fact that linear addressing of data could still only use 16-bit offsets, somewhat akin to Intel's first 8086-based designs, including the contemporary 80286 (the new 32-bit segment offsets of the 80386 architecture was described publicly in detail in 1984).
Using the semiconductor technology of its day, Intel's engineers weren't able to translate the design into a very efficient first implementation. Along with the lack of optimization in a premature Ada compiler, this contributed to rather slow but expensive computer systems, performing typical benchmarks at roughly 1/4 the speed of the new 80286 chip at the same clock frequency (in early 1982). This initial performance gap to the rather low-profile and low-priced 8086 line was probably the main reason why Intel's plan to replace the latter (later known as x86) with the iAPX 432 failed. Although engineers saw ways to improve a next generation design, the iAPX 432 capability architecture had now started to be regarded more as an implementation overhead rather than as the simplifying support it was intended to be.
Originally designed for clock frequencies of up to 10 MHz, actual devices sold were specified for maximum clock speeds of 4 MHz, 5 MHz, 7 MHz and 8 MHz with a peak performance of 2 million instructions per second at 8 MHz.
History
Development
Intel's 432 project started in 1976, a year after the 8-bit Intel 8080 was completed and a year before their 16-bit 8086 project began. The 432 project was initially named the 8800, as their next step beyond the existing Intel 8008 and 8080 microprocessors. This became a very big step. The instruction sets of these 8-bit processors were not very well fitted for typical Algol-like compiled languages. However, the major problem was their small native addressing ranges, just 16 KB for 8008 and 64 KB for 8080, far too small for many complex software systems without using some kind of bank switching, memory segmentation, or similar mechanism (which was built into the 8086, a few years later on). Intel now aimed to build a sophisticated complete system in a few LSI chips, that was functionally equal to or better than the best 32-bit minicomputers and mainframes requiring entire cabinets of older chips. This system would support multiprocessors, modular expansion, fault tolerance, advanced operating systems, advanced programming languages, very large applications, ultra reliability, and ultra security. Its architecture would address the needs of Intel's customers for a decade.
The iAPX 432 development team was managed by Bill Lattin, with Justin Rattner as the lead engineer (although one source states that Fred Pollack was the lead engineer). (Rattner would later become CTO of Intel.) Initially the team worked from Santa Clara, but in March 1977 Lattin and his team of 17 engineers moved to Intel's new site in Portland. Pollack later specialized in superscalarity and became the lead architect of the i686 chip Intel Pentium Pro.
It soon became clear that it would take several years and many engineers to design all this. And it would similarly take several years of further progress in Moore's Law, before improved chip manufacturing could fit all this into a few dense chips. Meanwhile, Intel urgently needed a simpler interim product to meet the immediate competition from Motorola, Zilog, and National Semiconductor. So Intel began a rushed project to design the 8086 as a low-risk incremental evolution from the 8080, using a separate design team. The mass-market 8086 shipped in 1978.
The 8086 was designed to be backward-compatible with the 8080 in the sense that 8080 assembly language could be mapped on to the 8086 architecture using a special assembler. Existing 8080 assembly source code (albeit no executable code) was thereby made upward compatible with the new 8086 to a degree. In contrast, the 432 had no software compatibility or migration requirements. The architects had total freedom to do a novel design from scratch, using whatever techniques they guessed would be best for large-scale systems and software. They applied fashionable computer science concepts from universities, particularly capability machines, object-oriented programming, high-level CISC machines, Ada, and densely encoded instructions. This ambitious mix of novel features made the chip larger and more complex. The chip's complexity limited the clock speed and lengthened the design schedule.
The core of the design — the main processor — was termed the General Data Processor (GDP) and built as two integrated circuits: one (the 43201) to fetch and decode instructions, the other (the 43202) to execute them. Most systems would also include the 43203 Interface Processor (IP) which operated as a channel controller for I/O, and an Attached Processor (AP), a conventional Intel 8086 which provided "processing power in the I/O subsystem".
These were some of the largest designs of the era. The two-chip GDP had a combined count of approximately 97,000 transistors while the single chip IP had approximately 49,000. By comparison, the Motorola 68000 (introduced in 1979) had approximately 40,000 transistors.
In 1983, Intel released two additional integrated circuits for the iAPX 432 Interconnect Architecture: the 43204 Bus Interface Unit (BIU) and 43205 Memory Control Unit (MCU). These chips allowed for nearly glueless multiprocessor systems with up to 63 nodes.
The project's failures
Some of the innovative features of the iAPX 432 were detrimental to good performance. In many cases, the iAPX 432 had a significantly slower instruction throughput than conventional microprocessors of the era, such as the National Semiconductor 32016, Motorola 68010 and Intel 80286. One problem was that the two-chip implementation of the GDP limited it to the speed of the motherboard's electrical wiring. A larger issue was the capability architecture needed large associative caches to run efficiently, but the chips had no room left for that. The instruction set also used bit-aligned variable-length instructions instead of the usual semi-fixed byte or word-aligned formats used in the majority of computer designs. Instruction decoding was therefore more complex than in other designs. Although this did not hamper performance in itself, it used additional transistors (mainly for a large barrel shifter) in a design that was already lacking space and transistors for caches, wider buses and other performance oriented features. In addition, the BIU was designed to support fault-tolerant systems, and in doing so up to 40% of the bus time was held up in wait states.
Another major problem was its immature and untuned Ada compiler. It used high-cost object-oriented instructions in every case, instead of the faster scalar instructions where it would have made sense to do so. For instance the iAPX 432 included a very expensive inter-module procedure call instruction, which the compiler used for all calls, despite the existence of much faster branch and link instructions. Another very slow call was enter_environment, which set up the memory protection. The compiler ran this for every single variable in the system, even when variables were used inside an existing environment and did not have to be checked. To make matters worse, data passed to and from procedures was always passed by value-return rather than by reference. When running the Dhrystone benchmark, parameter passing took ten times longer than all other computations combined.
According to the New York Times, "the i432 ran 5 to 10 times more slowly than its competitor, the Motorola 68000".
Impact and similar designs
The iAPX 432 was one of the first systems to implement the new IEEE-754 Standard for Floating-Point Arithmetic.
An outcome of the failure of the 432 was that microprocessor designers concluded that object support in the chip leads to a complex design that will invariably run slowly, and the 432 was often cited as a counter-example by proponents of RISC designs. However, some hold that the OO support was not the primary problem with the 432, and that the implementation shortcomings (especially in the compiler) mentioned above would have made any CPU design slow. Since the iAPX 432 there has been only one other attempt at a similar design, the Rekursiv processor, although the INMOS Transputer's process support was similar — and very fast.
Intel had spent considerable time, money, and mindshare on the 432, had a skilled team devoted to it, and was unwilling to abandon it entirely after its failure in the marketplace. A new architect—Glenford Myers—was brought in to produce an entirely new architecture and implementation for the core processor, which would be built in a joint Intel/Siemens project (later BiiN), resulting in the i960-series processors. The i960 RISC subset became popular for a time in the embedded processor market, but the high-end 960MC and the tagged-memory 960MX were marketed only for military applications.
According to the New York Times, Intel's collaboration with HP on the Merced processor (later known as Itanium) was the company's comeback attempt for the very high-end market.
Architecture
The iAPX 432 instructions have variable length, between 6 and 321 bits. Unusually, they are not byte-aligned, that is, they may contain odd numbers of bits and directly follow each other without regard to byte boundaries.
Object-oriented memory and capabilities
The iAPX 432 has hardware and microcode support for object-oriented programming and capability-based addressing. The system uses segmented memory, with up to 224 segments of up to 64 KB each, providing a total virtual address space of 240 bytes. The physical address space is 224 bytes (16 MB).
Programs are not able to reference data or instructions by address; instead they must specify a segment and an offset within the segment. Segments are referenced by access descriptors (ADs), which provide an index into the system object table and a set of rights (capabilities) governing accesses to that segment. Segments may be "access segments", which can only contain Access Descriptors, or "data segments" which cannot contain ADs. The hardware and microcode rigidly enforce the distinction between data and access segments, and will not allow software to treat data as access descriptors, or vice versa.
System-defined objects consist of either a single access segment, or an access segment and a data segment. System-defined segments contain data or access descriptors for system-defined data at designated offsets, though the operating system or user software may extend these with additional data. Each system object has a type field which is checked by microcode, such that a Port Object cannot be used where a Carrier Object is needed. User programs can define new object types which will get the full benefit of the hardware type checking, through the use of type control objects (TCOs).
In Release 1 of the iAPX 432 architecture, a system-defined object typically consisted of an access segment, and optionally (depending on the object type) a data segment specified by an access descriptor at a fixed offset within the access segment.
By Release 3 of the architecture, in order to improve performance, access segments and data segments were combined into single segments of up to 128 kB, split into an access part and a data part of 0–64 KB each. This reduced the number of object table lookups dramatically, and doubled the maximum virtual address space.
The iAPX432 recognizes fourteen types of predefined system objects:
instruction object contains executable instructions
domain object represents a program module and contains references to subroutines and data
context object represents the context of a process in execution
type-definition object represents a software-defined object type
type-control object represents type-specific privilege
object table identifies the system's collection of active object descriptors
storage resource object represents a free storage pool
physical storage object identifies free storage blocks in memory
storage claim object limits storage that may be allocated by all associated storage resource objects
process object identifies a running process
port object represents a port and message queue for interprocess communication
carrier Carriers carry messages to and from ports
processor contains state information for one processor in the system
processor communication object is used for interprocessor communication
Garbage collection
Software running on the 432 does not need to explicitly deallocate objects that are no longer needed. Instead, the microcode implements part of the marking portion of Edsger Dijkstra's on-the-fly parallel garbage collection algorithm (a mark-and-sweep style collector). The entries in the system object table contain the bits used to mark each object as being white, black, or grey as needed by the collector. The iMAX 432 operating system includes the software portion of the garbage collector.
Instruction format
Executable instructions are contained within a system "instruction object". Due to instructions being bit-aligned, a 16-bit bit displacement into the instruction object allows the object to contain up to 65,536 bits (8,192 bytes) of instructions.
Instructions consist of an operator, consisting of a class and an opcode, and zero to three operand references. "The fields are organized to present information to the processor in the sequence required for decoding". More frequently used operators are encoded using fewer bits. The instruction begins with the 4 or 6 bit class field which indicates the number of operands, called the order of the instruction, and the length of each operand. This is optionally followed by a 0 to 4 bit format field which describes the operands (if there are no operands the format is not present). Then come zero to three operands, as described by the format. The instruction is terminated by the 0 to 5 bit opcode, if any (some classes contain only one instruction and therefore have no opcode). "The Format field permits the GDP to appear to the programmer as a zero-, one-, two-, or three-address architecture." The format field indicates that an operand is a data reference, or the top or next-to-top element of the operand stack.
See also
iAPX, for the iAPX name
Notes
References
External links
IAPX 432 manuals at Bitsavers.org
Computer History Museum
Intel iAPX432 Micromainframe contains a list of all the Intel documentation associated with the iAPX 432, a list of hardware part numbers and a list of more than 30 papers.
Capability systems
High-level language computer architecture
Intel microprocessors
|
```objective-c
#pragma once
#include <stdint.h>
#include <vector>
class SharedResource
{
uint64_t _modify_id;
uint32_t _modify_counter;
int _fd;
SharedResource(const SharedResource&) = delete;
void GenerateModifyId() noexcept;
bool Lock(int op, int timeout) noexcept;
public:
static bool sEnum(const char *group, std::vector<uint64_t> &ids) noexcept;
static bool sCleanup(const char *group, uint64_t id) noexcept;
SharedResource(const char *group, uint64_t id) noexcept;
~SharedResource();
bool LockRead(int timeout = -1) noexcept;
bool LockWrite(int timeout = -1) noexcept;
void UnlockRead() noexcept;
void UnlockWrite() noexcept;
bool IsModified() noexcept;
struct LockerState
{
inline bool Locked() const
{
return _locked;
}
protected:
SharedResource &_s;
bool _locked;
LockerState(SharedResource &s, bool locked) : _s(s), _locked(locked) {}
};
struct Writer : LockerState
{
Writer(SharedResource &s, int timeout = -1) : LockerState(s, s.LockWrite(timeout)) { }
~Writer()
{
EnsureUnlocked();
}
void EnsureUnlocked()
{
if (_locked) {
_s.UnlockWrite();
_locked = false;
}
}
};
struct Reader : LockerState
{
Reader(SharedResource &s, int timeout = -1) : LockerState(s, s.LockRead(timeout)) { }
~Reader()
{
EnsureUnlocked();
}
void EnsureUnlocked()
{
if (_locked) {
_s.UnlockRead();
_locked = false;
}
}
};
};
```
|
```yaml
periodics:
- name: periodic-cluster-api-provider-aws-e2e-release-2-2
cluster: eks-prow-build-cluster
decorate: true
decoration_config:
timeout: 5h
interval: 12h
labels:
preset-dind-enabled: "true"
preset-kind-volume-mounts: "true"
preset-service-account: "true"
preset-aws-ssh: "true"
preset-aws-credential: "true"
extra_refs:
- org: kubernetes-sigs
repo: cluster-api-provider-aws
base_ref: release-2.2
path_alias: "sigs.k8s.io/cluster-api-provider-aws"
spec:
containers:
- image: gcr.io/k8s-staging-test-infra/kubekins-e2e:v20231113-7213ea5323-1.25
command:
- "runner.sh"
- "./scripts/ci-e2e.sh"
env:
- name: BOSKOS_HOST
value: "boskos.test-pods.svc.cluster.local"
- name: AWS_REGION
value: "us-west-2"
# Parallelize tests
- name: GINKGO_ARGS
value: "-nodes 20 -skip='\\[ClusterClass\\]'"
securityContext:
privileged: true
resources:
requests:
cpu: 2
memory: "9Gi"
limits:
cpu: 2
memory: "9Gi"
annotations:
testgrid-dashboards: sig-cluster-lifecycle-cluster-api-provider-aws
testgrid-tab-name: periodic-e2e-release-2-2
testgrid-alert-email: sig-cluster-lifecycle-cluster-api-aws-alerts@kubernetes.io
testgrid-num-failures-to-alert: "2"
- name: periodic-cluster-api-provider-aws-eks-e2e-release-2-2
cluster: eks-prow-build-cluster
decorate: true
decoration_config:
timeout: 5h
interval: 12h
labels:
preset-dind-enabled: "true"
preset-kind-volume-mounts: "true"
preset-service-account: "true"
preset-aws-ssh: "true"
preset-aws-credential: "true"
extra_refs:
- org: kubernetes-sigs
repo: cluster-api-provider-aws
base_ref: release-2.2
path_alias: "sigs.k8s.io/cluster-api-provider-aws"
spec:
containers:
- image: gcr.io/k8s-staging-test-infra/kubekins-e2e:v20231113-7213ea5323-1.25
command:
- "runner.sh"
- "./scripts/ci-e2e-eks.sh"
env:
- name: BOSKOS_HOST
value: "boskos.test-pods.svc.cluster.local"
- name: AWS_REGION
value: "us-west-2"
securityContext:
privileged: true
resources:
requests:
cpu: 2
memory: "9Gi"
limits:
cpu: 2
memory: "9Gi"
annotations:
testgrid-dashboards: sig-cluster-lifecycle-cluster-api-provider-aws
testgrid-tab-name: periodic-eks-e2e-release-2-2
testgrid-alert-email: sig-cluster-lifecycle-cluster-api-aws-alerts@kubernetes.io
testgrid-num-failures-to-alert: "2"
- name: periodic-cluster-api-provider-aws-e2e-conformance-release-2-2
cluster: eks-prow-build-cluster
decorate: true
decoration_config:
timeout: 5h
interval: 12h
labels:
preset-dind-enabled: "true"
preset-kind-volume-mounts: "true"
preset-service-account: "true"
preset-aws-ssh: "true"
preset-aws-credential: "true"
extra_refs:
- org: kubernetes-sigs
repo: cluster-api-provider-aws
base_ref: release-2.2
path_alias: "sigs.k8s.io/cluster-api-provider-aws"
spec:
containers:
- image: gcr.io/k8s-staging-test-infra/kubekins-e2e:v20231113-7213ea5323-1.25
command:
- "runner.sh"
- "./scripts/ci-conformance.sh"
env:
- name: BOSKOS_HOST
value: "boskos.test-pods.svc.cluster.local"
- name: AWS_REGION
value: "us-west-2"
# Parallelize tests
- name: GINKGO_ARGS
value: "-nodes 20"
- name: GINKGO_FOCUS
value: "Cluster API E2E tests"
securityContext:
privileged: true
resources:
requests:
cpu: 2
memory: "9Gi"
limits:
cpu: 2
memory: "9Gi"
annotations:
testgrid-dashboards: sig-cluster-lifecycle-cluster-api-provider-aws
testgrid-tab-name: periodic-conformance-release-2-2
testgrid-alert-email: sig-cluster-lifecycle-cluster-api-aws-alerts@kubernetes.io
testgrid-num-failures-to-alert: "2"
- name: your_sha256_hashtifacts-release-2-2
cluster: eks-prow-build-cluster
max_concurrency: 1
labels:
preset-dind-enabled: "true"
preset-kind-volume-mounts: "true"
preset-service-account: "true"
preset-aws-ssh: "true"
preset-aws-credential: "true"
decorate: true
decoration_config:
timeout: 5h
interval: 12h
extra_refs:
- org: kubernetes-sigs
repo: cluster-api-provider-aws
base_ref: release-2.2
path_alias: "sigs.k8s.io/cluster-api-provider-aws"
- org: kubernetes-sigs
repo: image-builder
base_ref: main
path_alias: "sigs.k8s.io/image-builder"
- org: kubernetes
repo: kubernetes
base_ref: master
path_alias: k8s.io/kubernetes
spec:
containers:
- image: gcr.io/k8s-staging-test-infra/kubekins-e2e:v20231113-7213ea5323-1.25
env:
- name: BOSKOS_HOST
value: "boskos.test-pods.svc.cluster.local"
- name: AWS_REGION
value: "us-west-2"
- name: E2E_ARGS
value: "-kubetest.use-ci-artifacts"
# Parallelize tests
- name: GINKGO_ARGS
value: "-nodes 20"
command:
- "runner.sh"
- "./scripts/ci-conformance.sh"
# we need privileged mode in order to do docker in docker
securityContext:
privileged: true
resources:
requests:
# these are both a bit below peak usage during build
# this is mostly for building kubernetes
memory: "9Gi"
cpu: 2
limits:
cpu: 2
memory: "9Gi"
annotations:
testgrid-dashboards: sig-cluster-lifecycle-cluster-api-provider-aws
testgrid-tab-name: periodic-conformance-release-2-2-k8s-main
testgrid-num-columns-recent: '20'
testgrid-alert-email: sig-cluster-lifecycle-cluster-api-aws-alerts@kubernetes.io
```
|
Arne Olav Weiglin Hendriksen (1 January 1911 – 5 November 1996) was a Norwegian-Swedish ceramic artist and opera singer (tenor).
Biography
Hendriksen was born in Berlin, Germany.
He was trained as a ceramic artist, but had a talent for singing. After studying with Karl Aagard Østvig (1889–1968), he made his debut at Christiania (now Oslo) in 1938. Engaged at the National Theatre in 1940, he worked at Den Nationale Scene in Bergen from 1942 to 1946, before settling in Sweden, where he sang some forty roles at the Stockholm Opera from 1947 to 1964. These included his debut Nemorino and Mozart roles, leading onto Italian Bel canto and Herod in Salome. He appeared at times at the Norwegian National Opera and Ballet and enjoyed success as the main character in The Tales of Hoffmann in 1954, as well as in other productions. He also appeared at the Volksoper in Vienna and he toured the United States. He recorded Don José and Iopas and appeared in the Ingmar Bergman 1975 film The Magic Flute.
Personal life
He was the son of artist Ulrik Hendriksen (1891–1960) and was married to Anne Margrethe, who was Ole Bull's granddaughter. Their son was the opera producer Knut Hendriksen (1944–2020). Hendriksen died at Täby in Stockholm.
References
This stub incorporates material from Norwegian Wikipedia, with additional material from Kutsch KJ, Riemens L. Arne Hendriksen. In: Unvergängliche Stimmen: Sängerlexikon. Francke Verlag, Bern and Munish, 1982.
1911 births
1996 deaths
20th-century Norwegian male opera singers
Norwegian ceramists
20th-century Swedish male opera singers
20th-century ceramists
German emigrants to Norway
Norwegian emigrants to Sweden
|
Benjamin Joseph Sheppard (23 June 1890 – 9 September 1931) was an Australian sportsman who played first-class cricket for Victoria and Australian rules football with Melbourne and Richmond in the Victorian Football League (VFL).
Sheppard started out as a footballer at Xavier College before being recruited by Melbourne. He played four senior games with Melbourne in the 1911 VFL season and one for Richmond in 1912.
In 1914 he appeared in two first-class cricket matches for Victoria during a tour of Tasmania. A wicket-keeper, his highest score was 30, which he made at Launceston.
See also
List of Victoria first-class cricketers
References
External links
Cricinfo: Benjamin Sheppard
1890 births
1931 deaths
People from Fitzroy, Victoria
Melbourne Football Club players
Richmond Football Club players
Australian cricketers
Victoria cricketers
People educated at Xavier College
Cricketers from Melbourne
Australian rules footballers from Melbourne
Wicket-keepers
|
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
// MODULES //
var bench = require( '@stdlib/bench' );
var ArrayBuffer = require( '@stdlib/array/buffer' );
var Float32Array = require( '@stdlib/array/float32' );
var ITERATOR_SYMBOL = require( '@stdlib/symbol/iterator' );
var pkg = require( './../package.json' ).name;
var namedtypedtuple = require( './../lib' );
// VARIABLES //
var opts = {
'skip': ( ITERATOR_SYMBOL === null )
};
// MAIN //
bench( pkg+'::instantiation,new', function benchmark( b ) {
var Point;
var p;
var i;
Point = namedtypedtuple( [ 'x', 'y' ] );
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
p = new Point();
if ( p.length !== 2 ) {
b.fail( 'should have length 2' );
}
}
b.toc();
if ( typeof p.subtuple !== 'function' ) {
b.fail( 'should return a tuple' );
}
b.pass( 'benchmark finished' );
b.end();
});
bench( pkg+'::instantiation,no_new', function benchmark( b ) {
var point;
var p;
var i;
point = namedtypedtuple( [ 'x', 'y' ] );
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
p = point();
if ( p.length !== 2 ) {
b.fail( 'should have length 2' );
}
}
b.toc();
if ( typeof p.subtuple !== 'function' ) {
b.fail( 'should return a tuple' );
}
b.pass( 'benchmark finished' );
b.end();
});
bench( pkg+'::instantiation,typed_array', function benchmark( b ) {
var Point;
var buf;
var p;
var i;
Point = namedtypedtuple( [ 'x', 'y' ] );
buf = new Float32Array( 2 );
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
p = new Point( buf );
if ( p.length !== 2 ) {
b.fail( 'should have length 2' );
}
}
b.toc();
if ( typeof p.subtuple !== 'function' ) {
b.fail( 'should return a tuple' );
}
b.pass( 'benchmark finished' );
b.end();
});
bench( pkg+'::instantiation,typed_array,dtype', function benchmark( b ) {
var Point;
var buf;
var p;
var i;
Point = namedtypedtuple( [ 'x', 'y' ] );
buf = new Float32Array( 2 );
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
p = new Point( buf, 'int32' );
if ( p.length !== 2 ) {
b.fail( 'should have length 2' );
}
}
b.toc();
if ( typeof p.subtuple !== 'function' ) {
b.fail( 'should return a tuple' );
}
b.pass( 'benchmark finished' );
b.end();
});
bench( pkg+'::instantiation,array', function benchmark( b ) {
var Point;
var buf;
var p;
var i;
Point = namedtypedtuple( [ 'x', 'y' ] );
buf = [ 1.0, -1.0 ];
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
p = new Point( buf );
if ( p.length !== 2 ) {
b.fail( 'should have length 2' );
}
}
b.toc();
if ( typeof p.subtuple !== 'function' ) {
b.fail( 'should return a tuple' );
}
b.pass( 'benchmark finished' );
b.end();
});
bench( pkg+'::instantiation,array,dtype', function benchmark( b ) {
var Point;
var buf;
var p;
var i;
Point = namedtypedtuple( [ 'x', 'y' ] );
buf = [ 1.0, -1.0 ];
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
p = new Point( buf, 'int32' );
if ( p.length !== 2 ) {
b.fail( 'should have length 2' );
}
}
b.toc();
if ( typeof p.subtuple !== 'function' ) {
b.fail( 'should return a tuple' );
}
b.pass( 'benchmark finished' );
b.end();
});
bench( pkg+'::instantiation,iterable', opts, function benchmark( b ) {
var Point;
var p;
var i;
Point = namedtypedtuple( [ 'x', 'y' ] );
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
p = new Point( createIterable() );
if ( p.length !== 2 ) {
b.fail( 'should have length 2' );
}
}
b.toc();
if ( typeof p.subtuple !== 'function' ) {
b.fail( 'should return a tuple' );
}
b.pass( 'benchmark finished' );
b.end();
function createIterable() {
var out;
var i;
out = {};
out[ ITERATOR_SYMBOL ] = iterator;
i = 0;
return out;
function iterator() {
return {
'next': next
};
}
function next() {
i += 1;
if ( i <= 2) {
return {
'value': 1.0
};
}
return {
'done': true
};
}
}
});
bench( pkg+'::instantiation,iterable,dtype', opts, function benchmark( b ) {
var Point;
var p;
var i;
Point = namedtypedtuple( [ 'x', 'y' ] );
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
p = new Point( createIterable(), 'int32' );
if ( p.length !== 2 ) {
b.fail( 'should have length 2' );
}
}
b.toc();
if ( typeof p.subtuple !== 'function' ) {
b.fail( 'should return a tuple' );
}
b.pass( 'benchmark finished' );
b.end();
function createIterable() {
var out;
var i;
out = {};
out[ ITERATOR_SYMBOL ] = iterator;
i = 0;
return out;
function iterator() {
return {
'next': next
};
}
function next() {
i += 1;
if ( i <= 2) {
return {
'value': 1.0
};
}
return {
'done': true
};
}
}
});
bench( pkg+'::instantiation,arraybuffer', function benchmark( b ) {
var Point;
var buf;
var p;
var i;
Point = namedtypedtuple( [ 'x', 'y' ] );
buf = new ArrayBuffer( 16 );
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
p = new Point( buf );
if ( p.length !== 2 ) {
b.fail( 'should have length 2' );
}
}
b.toc();
if ( typeof p.subtuple !== 'function' ) {
b.fail( 'should return a tuple' );
}
b.pass( 'benchmark finished' );
b.end();
});
bench( pkg+'::instantiation,arraybuffer,dtype', function benchmark( b ) {
var Point;
var buf;
var p;
var i;
Point = namedtypedtuple( [ 'x', 'y' ] );
buf = new ArrayBuffer( 16 );
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
p = new Point( buf, 'float32' );
if ( p.length !== 2 ) {
b.fail( 'should have length 2' );
}
}
b.toc();
if ( typeof p.subtuple !== 'function' ) {
b.fail( 'should return a tuple' );
}
b.pass( 'benchmark finished' );
b.end();
});
bench( pkg+'::instantiation,arraybuffer,byte_offset', function benchmark( b ) {
var Point;
var buf;
var p;
var i;
Point = namedtypedtuple( [ 'x', 'y' ] );
buf = new ArrayBuffer( 24 );
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
p = new Point( buf, 8 );
if ( p.length !== 2 ) {
b.fail( 'should have length 2' );
}
}
b.toc();
if ( typeof p.subtuple !== 'function' ) {
b.fail( 'should return a tuple' );
}
b.pass( 'benchmark finished' );
b.end();
});
bench( pkg+'::instantiation,arraybuffer,byte_offset,dtype', function benchmark( b ) {
var Point;
var buf;
var p;
var i;
Point = namedtypedtuple( [ 'x', 'y' ] );
buf = new ArrayBuffer( 24 );
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
p = new Point( buf, 8, 'float32' );
if ( p.length !== 2 ) {
b.fail( 'should have length 2' );
}
}
b.toc();
if ( typeof p.subtuple !== 'function' ) {
b.fail( 'should return a tuple' );
}
b.pass( 'benchmark finished' );
b.end();
});
```
|
In graph theory, a branch of mathematics, a split graph is a graph in which the vertices can be partitioned into a clique and an independent set. Split graphs were first studied by , and independently introduced by .
A split graph may have more than one partition into a clique and an independent set; for instance, the path is a split graph, the vertices of which can be partitioned in three different ways:
the clique and the independent set
the clique and the independent set
the clique and the independent set
Split graphs can be characterized in terms of their forbidden induced subgraphs: a graph is split if and only if no induced subgraph is a cycle on four or five vertices, or a pair of disjoint edges (the complement of a 4-cycle).
Relation to other graph families
From the definition, split graphs are clearly closed under complementation. Another characterization of split graphs involves complementation: they are chordal graphs the complements of which are also chordal. Just as chordal graphs are the intersection graphs of subtrees of trees, split graphs are the intersection graphs of distinct substars of star graphs. Almost all chordal graphs are split graphs; that is, in the limit as n goes to infinity, the fraction of n-vertex chordal graphs that are split approaches one.
Because chordal graphs are perfect, so are the split graphs. The double split graphs, a family of graphs derived from split graphs by doubling every vertex (so the clique comes to induce an antimatching and the independent set comes to induce a matching), figure prominently as one of five basic classes of perfect graphs from which all others can be formed in the proof by of the Strong Perfect Graph Theorem.
If a graph is both a split graph and an interval graph, then its complement is both a split graph and a comparability graph, and vice versa. The split comparability graphs, and therefore also the split interval graphs, can be characterized in terms of a set of three forbidden induced subgraphs. The split cographs are exactly the threshold graphs. The split permutation graphs are exactly the interval graphs that have interval graph complements;
these are the permutation graphs of skew-merged permutations. Split graphs have cochromatic number 2.
Algorithmic problems
Let be a split graph, partitioned into a clique and an independent set . Then every maximal clique in a split graph is either itself, or the neighborhood of a vertex in . Thus, it is easy to identify the maximum clique, and complementarily the maximum independent set in a split graph. In any split graph, one of the following three possibilities must be true:
There exists a vertex in such that is complete. In this case, is a maximum clique and is a maximum independent set.
There exists a vertex in such that is independent. In this case, is a maximum independent set and is a maximum clique.
is a maximal clique and is a maximal independent set. In this case, has a unique partition into a clique and an independent set, is the maximum clique, and is the maximum independent set.
Some other optimization problems that are NP-complete on more general graph families, including graph coloring, are similarly straightforward on split graphs. Finding a Hamiltonian cycle remains NP-complete even for split graphs which are strongly chordal graphs. It is also well known that the Minimum Dominating Set problem remains NP-complete for split graphs.
Degree sequences
One remarkable property of split graphs is that they can be recognized solely from their degree sequences. Let the degree sequence of a graph be , and let be the largest value of such that . Then is a split graph if and only if
If this is the case, then the vertices with the largest degrees form a maximum clique in , and the remaining vertices constitute an independent set.
The splittance of an arbitrary graph measures the extent to which this inequality fails to be true. If a graph is not a split graph, then the smallest sequence of edge insertions and removals that make it into a split graph can be obtained by adding all missing edges between the vertices with the largest degrees, and removing all edges between pairs of the remaining vertices; the splittance counts the number of operations in this sequence.
Counting split graphs
showed that n-vertex split graphs with n are in one-to-one correspondence with certain Sperner families. Using this fact, he determined a formula for the number of nonisomorphic split graphs on n vertices. For small values of n, starting from n = 1, these numbers are
1, 2, 4, 9, 21, 56, 164, 557, 2223, 10766, 64956, 501696, ... .
This enumerative result was also proved earlier by .
Notes
References
.
.
.
.
.
.
.
.
.
.
.
.
.
.
. Translated as "Yet another method of enumerating unmarked combinatorial objects" (1990), Mathematical notes of the Academy of Sciences of the USSR 48 (6): 1239–1245, .
.
.
Further reading
A chapter on split graphs appears in the book by Martin Charles Golumbic, "Algorithmic Graph Theory and Perfect Graphs".
Graph families
Intersection classes of graphs
Perfect graphs
|
"" is the fourth single by Shiori Takei. It was released on the 6th of July, 2005 under the Giza Studio label. The single reached #99 rank first week. It charted for 2 weeks and sold over 2,208 copies.
Track listing
References
2005 singles
2005 songs
Being Inc. singles
Giza Studio singles
Songs written by Aika Ohno
|
Gymnoscyphus ascitus is a small species of clingfish found in the Caribbean Sea (documented off of Cuba (Jardines del Rey archipelago), Cozumel and St. Vincent) at depths of . This species is the only known member of the genus Gymnoscyphus.
References
Gobiesocidae
Fish of the Lesser Antilles
Fauna of Cozumel
Fish of Cuba
Fauna of Saint Vincent and the Grenadines
Monotypic ray-finned fish genera
Fish described in 1970
|
Mark Clifford is a British musician and producer known primarily for his involvement with his band Seefeel. He has been involved in a number of solo and collaborative projects which have resulted in a wide range of material released on many different labels including Warp Records, Rephlex Records, Bella Union, Editions Mego and his own Polyfusia label.
Seefeel
Seefeel was formed in 1992: Clifford advertising in local classifieds for members. In its earliest incarnation Sarah Peacock, Justin Fletcher and Mark Van Hoen represented guitar/vocals, drums and bass respectively, with Daren Seymour supplanting Van Hoen as the bassist early on. Too Pure signed Seefeel and published their first EPs and LP in 1993. Seefeel decamped to Warp Records in 1994 where they remain signed to this day, having released two LPs and three EPs with them thus far. 1996 also saw the release of a mini album, (CH-VOX) on Rephlex Records. Around 1999 Seefeel went on an indefinite hiatus only to reconvene in 2008 with a new Bassist and drummer, Shigeru Ishihara and Iida Kazuhisa.
Solo projects
Aside from his work with Seefeel, Clifford has released two mini albums, 1995's Looking for Snags & 1996's Clean, Pit and Lid, under the name Disjecta for Warp Records. The name of the project was taken from the literature of Samuel Beckett. A 4 track Disjecta EP, True Love by Normal, was also released in 2003 on Clifford's own Polyfusia label. 1996 also saw the release of a 4 track vinyl-only EP titled Souff Souff on Warp under the guise of Woodenspoon. Clifford has produced and remixed a number of different artists including Autechre (as Seefeel), Nav Katze (as Seefeel & Disjecta), Mira Calix, Bowery Electric and School of Seven Bells (as Seefeel).
Work With Cocteau Twins
Clifford, being an admirer of Scottish band Cocteau Twins, sent a copy of Seefeel's debut EP, More Like Space, to them in 1994 as a gesture not expecting it to incite anything in particular. To his surprise the band loved it and contacted him requesting he collaborate with them on a new EP of remixes. The result of this collaborative project was 1995's Otherness consisting of four remixed tracks. Clifford would also tour with the band in 1996, performing live remixes on stage as well as DJing.
Other collaborative projects
Following the initial dissolution of Seefeel Clifford formed a collaborative project called Sneakster with vocalist Sophie Hinkley. They released two EPs and an LP in 1999 on Robin Guthrie's label Bella Union. Periodically between 1999 and 2004 Clifford met with friend and collaborator Mira Calix to record material. A retrospective of this material titled Lost Foundling was released in 2010 on Andrea Parker (DJ)'s label Aperture. Clifford has released a collaborative album with Simon Kealoha (Calika) and a split EP with Zavoloka, both on his Polyfusia label. Mark Clifford also works with musician Scott Douglas Gordon (Loops Haunt) under the project title Oto Hiax. Their first, self-titled album, was released by Editions Mego in 2017
References
British rock guitarists
British male guitarists
Living people
Warp (record label) artists
British electronic musicians
Year of birth missing (living people)
The Sessions Band members
|
Agave gypsophila (common names - gypsum century plant, blue wave agave) is a species of plant in the Asparagaceae family and is endemic to the Mexican state of Guerrero. The specific epithet, gypsophila, means gypsum loving.
Agave gypsophila was described by Howard Scott Gentry in 1982. In 2013, J. Antonio Vazquez-Garcıa, et al. proposed a narrower circumscription of Agave gypsophila based on both ecological and morphological characteristics. The Agave gypsophila sens. lat. (in the broad sense) of Howard Scott Gentry was divided into five species: Agave abisaii, A. andreae, A. gypsophila sens. strict. (in the strict sense), A. kristenii and A. pablocarrillioi. All five species are narrow range endemics in south west Mexico.
Conservation
Agave gypsophila is listed as Critically Endangered by the IUCN. In the very restricted extent of occurrence, Agave gypsophila is locally abundant but threatened by a reduction in habitat quality and habitat destruction for agriculture and infrastructure. Agave gypsophila does not occur in any protected areas.
In horticulture
The plants cultivated around the world as Agave gypsophila are considered to be mostly Agave pablocarrilloi. The photographs on this page are most probably images of Agave pablocarrilloi.
Gallery
References
gypsophila
Flora of Guerrero
|
Kojom gorom is the fourteenth studio album by Serbian singer Dragana Mirković. It was released in 1997.
Track listing
Kojom gorom
Poslednje veče
Biće mi kako kad
Ko je da je
Bolna sam ti
O na, na, na
Neću pokajanje
Niko nikog ne voli
Svetinja
Dolina kestenova
Samo da te vidim
Hajde pogledaj me
References
1997 albums
Dragana Mirković albums
|
```c++
/*******************************************************************************
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*******************************************************************************/
#include "cpu/x64/jit_generator.hpp"
#include "cpu/x64/gemm/s8x8s32/common_u8.hpp"
namespace dnnl {
namespace impl {
namespace cpu {
namespace x64 {
jit_avx_kernel_b0_r_gemm_s8u8s32_kern::jit_avx_kernel_b0_r_gemm_s8u8s32_kern()
: jit_generator(jit_name()) {}
void jit_avx_kernel_b0_r_gemm_s8u8s32_kern::generate() {
#ifndef _WIN32
#define M rdi
#define N rsi
#define K rdx
#define A r8
#define B r9
#define C r10
#define LDC r11
#define AA rcx
#define I r12
#define J r13
#define H rax
#define AO r14
#define BO r15
#define CO1 rbx
#define CO2 rbp
#else
#define M rcx
#define N rdx
#define K r8
#define A rsi
#define B r9
#define C r10
#define LDC r11
#define AA rdi
#define I r12
#define J r13
#define H rax
#define AO r14
#define BO r15
#define CO1 rbx
#define CO2 rbp
#endif
#ifdef _WIN32
#define ARG_A (args_offset - 16) + rsp
#define ARG_B (args_offset - 8) + rsp
#endif
#define ARG_C ((args_offset + 0) + rsp)
#define ARG_LDC ((args_offset + 8) + rsp)
#define ARG_COFFSET_R ((args_offset + 24) + rsp)
#define COFFSET_RX (16 + rsp)
#define COFFSET_RY (24 + rsp)
inLocalLabel();
{
std::vector<Xbyak::Label> labels(91);
auto stack_alloc_size = 32;
auto args_offset = stack_alloc_size + get_size_of_abi_save_regs() + 8;
#ifdef _WIN32
args_offset += 48;
#endif
preamble();
sub(rsp, stack_alloc_size);
#ifdef _WIN32
mov(A, ptr[ARG_A]);
mov(B, ptr[ARG_B]);
#endif
mov(C, qword[ARG_C]);
mov(LDC, qword[ARG_LDC]);
sub(A, -128);
sub(B, -128);
mov(M, qword[M]);
mov(N, qword[N]);
mov(K, qword[K]);
lea(LDC, ptr[LDC * 4 + 0x0]);
mov(H, qword[ARG_COFFSET_R]);
mov(qword[COFFSET_RX], H);
vxorps(xmm8, xmm8, xmm8);
vxorps(xmm9, xmm9, xmm9);
vxorps(xmm10, xmm10, xmm10);
vxorps(xmm11, xmm11, xmm11);
vxorps(xmm12, xmm12, xmm12);
vxorps(xmm13, xmm13, xmm13);
vxorps(xmm14, xmm14, xmm14);
vxorps(xmm15, xmm15, xmm15);
mov(H, 0x10001);
movq(xmm7, H);
vpshufd(xmm7, xmm7, 0x0);
mov(J, M);
cmp(J, 0x10);
jl(labels[74], T_NEAR);
align(4);
L(labels[72]);
mov(CO1, C);
add(C, 0x40);
mov(BO, B);
mov(AA, K);
shl(AA, 0x20);
lea(AA, ptr[A + AA * 1 + 0x200]);
mov(H, qword[COFFSET_RX]);
mov(qword[COFFSET_RY], H);
mov(I, N);
cmp(I, 0x2);
jl(labels[64], T_NEAR);
align(4);
L(labels[82]);
mov(AO, A);
vmovdqu(xmm0, xword[AO - 0x80]);
vmovdqu(xmm1, xword[AO - 0x70]);
vmovdqu(xmm2, xword[AO - 0x60]);
vmovdqu(xmm3, xword[AO - 0x50]);
vmovdqu(xmm5, xword[BO - 0x80]);
mov(H, K);
sar(H, 0x3);
jle(labels[60], T_NEAR);
sub(H, 0x8);
jle(labels[58], T_NEAR);
align(4);
L(labels[3]);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
prefetcht0(byte[AO + 0x180]);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
vpmaddubsw(xmm6, xmm4, xmm2);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm12, xmm12, xmm6);
vpmaddubsw(xmm6, xmm4, xmm3);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm14, xmm14, xmm6);
prefetcht0(byte[BO]);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm11, xmm11, xmm6);
vpmaddubsw(xmm6, xmm4, xmm2);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm13, xmm13, xmm6);
vpmaddubsw(xmm6, xmm4, xmm3);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm15, xmm15, xmm6);
vmovdqu(xmm0, xword[AO - 0x40]);
vmovdqu(xmm1, xword[AO - 0x30]);
vmovdqu(xmm2, xword[AO - 0x20]);
vmovdqu(xmm3, xword[AO - 0x10]);
prefetcht0(byte[AO + 0x1c0]);
vpshufd(xmm4, xmm5, 0xaa);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
vpmaddubsw(xmm6, xmm4, xmm2);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm12, xmm12, xmm6);
vpmaddubsw(xmm6, xmm4, xmm3);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm14, xmm14, xmm6);
vpshufd(xmm4, xmm5, 0xff);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm11, xmm11, xmm6);
vpmaddubsw(xmm6, xmm4, xmm2);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm13, xmm13, xmm6);
vpmaddubsw(xmm6, xmm4, xmm3);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm15, xmm15, xmm6);
vmovdqu(xmm5, xword[BO - 0x70]);
prefetcht1(byte[AA - 0x80]);
vmovdqu(xmm0, xword[AO]);
vmovdqu(xmm1, xword[AO + 0x10]);
vmovdqu(xmm2, xword[AO + 0x20]);
vmovdqu(xmm3, xword[AO + 0x30]);
add(AA, 0x4);
add(AO, 0x80);
add(BO, 0x10);
sub(H, 0x1);
jg(labels[3], T_NEAR);
align(4);
L(labels[58]);
prefetcht0(byte[CO1 + 0x3c]);
prefetcht0(byte[CO1 + LDC * 1 + 0x3c]);
add(H, 0x8);
jle(labels[60], T_NEAR);
align(4);
L(labels[59]);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
prefetcht0(byte[AO + 0x180]);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
vpmaddubsw(xmm6, xmm4, xmm2);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm12, xmm12, xmm6);
vpmaddubsw(xmm6, xmm4, xmm3);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm14, xmm14, xmm6);
prefetcht0(byte[BO]);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm11, xmm11, xmm6);
vpmaddubsw(xmm6, xmm4, xmm2);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm13, xmm13, xmm6);
vpmaddubsw(xmm6, xmm4, xmm3);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm15, xmm15, xmm6);
vmovdqu(xmm0, xword[AO - 0x40]);
vmovdqu(xmm1, xword[AO - 0x30]);
vmovdqu(xmm2, xword[AO - 0x20]);
vmovdqu(xmm3, xword[AO - 0x10]);
prefetcht0(byte[AO + 0x1c0]);
vpshufd(xmm4, xmm5, 0xaa);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
vpmaddubsw(xmm6, xmm4, xmm2);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm12, xmm12, xmm6);
vpmaddubsw(xmm6, xmm4, xmm3);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm14, xmm14, xmm6);
vpshufd(xmm4, xmm5, 0xff);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm11, xmm11, xmm6);
vpmaddubsw(xmm6, xmm4, xmm2);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm13, xmm13, xmm6);
vpmaddubsw(xmm6, xmm4, xmm3);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm15, xmm15, xmm6);
vmovdqu(xmm5, xword[BO - 0x70]);
prefetcht1(byte[AA - 0x80]);
vmovdqu(xmm0, xword[AO]);
vmovdqu(xmm1, xword[AO + 0x10]);
vmovdqu(xmm2, xword[AO + 0x20]);
vmovdqu(xmm3, xword[AO + 0x30]);
add(AA, 0x4);
add(AO, 0x80);
add(BO, 0x10);
sub(H, 0x1);
jg(labels[59], T_NEAR);
align(4);
L(labels[60]);
mov(H, K);
test(H, 0x4);
je(labels[61], T_NEAR);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
vpmaddubsw(xmm6, xmm4, xmm2);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm12, xmm12, xmm6);
vpmaddubsw(xmm6, xmm4, xmm3);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm14, xmm14, xmm6);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm11, xmm11, xmm6);
vpmaddubsw(xmm6, xmm4, xmm2);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm13, xmm13, xmm6);
vpmaddubsw(xmm6, xmm4, xmm3);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm15, xmm15, xmm6);
add(AO, 0x40);
add(BO, 0x8);
align(4);
L(labels[61]);
mov(H, K);
test(H, 0x2);
je(labels[62], T_NEAR);
vxorps(xmm6, xmm6, xmm6);
vmovdqu(xmm1, xword[AO - 0x80]);
vpunpcklwd(xmm0, xmm1, xmm6);
vpunpckhwd(xmm1, xmm1, xmm6);
vmovdqu(xmm3, xword[AO - 0x70]);
vpunpcklwd(xmm2, xmm3, xmm6);
vpunpckhwd(xmm3, xmm3, xmm6);
vbroadcastss(xmm5, dword[BO - 0x80]);
vpunpcklwd(xmm5, xmm5, xmm5);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
vpmaddubsw(xmm6, xmm4, xmm2);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm12, xmm12, xmm6);
vpmaddubsw(xmm6, xmm4, xmm3);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm14, xmm14, xmm6);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm11, xmm11, xmm6);
vpmaddubsw(xmm6, xmm4, xmm2);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm13, xmm13, xmm6);
vpmaddubsw(xmm6, xmm4, xmm3);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm15, xmm15, xmm6);
add(AO, 0x20);
add(BO, 0x4);
align(4);
L(labels[62]);
mov(H, K);
test(H, 0x1);
je(labels[63], T_NEAR);
vxorps(xmm6, xmm6, xmm6);
vbroadcastss(xmm0, dword[AO - 0x80]);
vpunpcklbw(xmm0, xmm0, xmm6);
vpunpcklwd(xmm0, xmm0, xmm6);
vbroadcastss(xmm1, dword[AO - 0x7c]);
vpunpcklbw(xmm1, xmm1, xmm6);
vpunpcklwd(xmm1, xmm1, xmm6);
vbroadcastss(xmm2, dword[AO - 0x78]);
vpunpcklbw(xmm2, xmm2, xmm6);
vpunpcklwd(xmm2, xmm2, xmm6);
vbroadcastss(xmm3, dword[AO - 0x74]);
vpunpcklbw(xmm3, xmm3, xmm6);
vpunpcklwd(xmm3, xmm3, xmm6);
vbroadcastss(xmm5, dword[BO - 0x80]);
vpunpcklbw(xmm5, xmm5, xmm5);
vpunpcklwd(xmm5, xmm5, xmm5);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
vpmaddubsw(xmm6, xmm4, xmm2);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm12, xmm12, xmm6);
vpmaddubsw(xmm6, xmm4, xmm3);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm14, xmm14, xmm6);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm11, xmm11, xmm6);
vpmaddubsw(xmm6, xmm4, xmm2);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm13, xmm13, xmm6);
vpmaddubsw(xmm6, xmm4, xmm3);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm15, xmm15, xmm6);
add(AO, 0x10);
add(BO, 0x2);
align(4);
L(labels[63]);
mov(H, qword[COFFSET_RY]);
vbroadcastss(xmm0, dword[H]);
vpaddd(xmm8, xmm8, xmm0);
vpaddd(xmm10, xmm10, xmm0);
vpaddd(xmm12, xmm12, xmm0);
vpaddd(xmm14, xmm14, xmm0);
vbroadcastss(xmm0, dword[H + 0x4]);
vpaddd(xmm9, xmm9, xmm0);
vpaddd(xmm11, xmm11, xmm0);
vpaddd(xmm13, xmm13, xmm0);
vpaddd(xmm15, xmm15, xmm0);
add(qword[COFFSET_RY], 0x8);
vmovdqu(xword[CO1], xmm8);
vxorps(xmm8, xmm8, xmm8);
vmovdqu(xword[CO1 + 0x10], xmm10);
vxorps(xmm10, xmm10, xmm10);
vmovdqu(xword[CO1 + 0x20], xmm12);
vxorps(xmm12, xmm12, xmm12);
vmovdqu(xword[CO1 + 0x30], xmm14);
vxorps(xmm14, xmm14, xmm14);
vmovdqu(xword[CO1 + LDC * 1], xmm9);
vxorps(xmm9, xmm9, xmm9);
vmovdqu(xword[CO1 + LDC * 1 + 0x10], xmm11);
vxorps(xmm11, xmm11, xmm11);
vmovdqu(xword[CO1 + LDC * 1 + 0x20], xmm13);
vxorps(xmm13, xmm13, xmm13);
vmovdqu(xword[CO1 + LDC * 1 + 0x30], xmm15);
vxorps(xmm15, xmm15, xmm15);
lea(CO1, ptr[CO1 + LDC * 2]);
sub(I, 0x2);
cmp(I, 0x2);
jge(labels[82], T_NEAR);
align(4);
L(labels[64]);
test(I, 0x1);
jle(labels[73], T_NEAR);
mov(AO, A);
vmovdqu(xmm0, xword[AO - 0x80]);
vmovdqu(xmm1, xword[AO - 0x70]);
vmovdqu(xmm2, xword[AO - 0x60]);
vmovdqu(xmm3, xword[AO - 0x50]);
vmovdqu(xmm5, xword[BO - 0x80]);
mov(H, K);
sar(H, 0x3);
jle(labels[68], T_NEAR);
sub(H, 0x8);
jle(labels[66], T_NEAR);
align(4);
L(labels[65]);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
prefetcht0(byte[AO + 0x180]);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
vpmaddubsw(xmm6, xmm4, xmm2);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm12, xmm12, xmm6);
vpmaddubsw(xmm6, xmm4, xmm3);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm14, xmm14, xmm6);
prefetcht0(byte[BO]);
vmovdqu(xmm0, xword[AO - 0x40]);
vmovdqu(xmm1, xword[AO - 0x30]);
vmovdqu(xmm2, xword[AO - 0x20]);
vmovdqu(xmm3, xword[AO - 0x10]);
prefetcht0(byte[AO + 0x1c0]);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
vpmaddubsw(xmm6, xmm4, xmm2);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm12, xmm12, xmm6);
vpmaddubsw(xmm6, xmm4, xmm3);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm14, xmm14, xmm6);
vmovdqu(xmm5, xword[BO - 0x78]);
prefetcht1(byte[AA - 0x80]);
vmovdqu(xmm0, xword[AO]);
vmovdqu(xmm1, xword[AO + 0x10]);
vmovdqu(xmm2, xword[AO + 0x20]);
vmovdqu(xmm3, xword[AO + 0x30]);
add(AA, 0x4);
add(AO, 0x80);
add(BO, 0x8);
sub(H, 0x1);
jg(labels[65], T_NEAR);
align(4);
L(labels[66]);
prefetcht0(byte[CO1 + 0x3c]);
add(H, 0x8);
jle(labels[68], T_NEAR);
align(4);
L(labels[67]);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
prefetcht0(byte[AO + 0x180]);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
vpmaddubsw(xmm6, xmm4, xmm2);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm12, xmm12, xmm6);
vpmaddubsw(xmm6, xmm4, xmm3);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm14, xmm14, xmm6);
prefetcht0(byte[BO]);
vmovdqu(xmm0, xword[AO - 0x40]);
vmovdqu(xmm1, xword[AO - 0x30]);
vmovdqu(xmm2, xword[AO - 0x20]);
vmovdqu(xmm3, xword[AO - 0x10]);
prefetcht0(byte[AO + 0x1c0]);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
vpmaddubsw(xmm6, xmm4, xmm2);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm12, xmm12, xmm6);
vpmaddubsw(xmm6, xmm4, xmm3);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm14, xmm14, xmm6);
vmovdqu(xmm5, xword[BO - 0x78]);
prefetcht1(byte[AA - 0x80]);
vmovdqu(xmm0, xword[AO]);
vmovdqu(xmm1, xword[AO + 0x10]);
vmovdqu(xmm2, xword[AO + 0x20]);
vmovdqu(xmm3, xword[AO + 0x30]);
add(AA, 0x4);
add(AO, 0x80);
add(BO, 0x8);
sub(H, 0x1);
jg(labels[67], T_NEAR);
align(4);
L(labels[68]);
mov(H, K);
test(H, 0x4);
je(labels[69], T_NEAR);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
vpmaddubsw(xmm6, xmm4, xmm2);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm12, xmm12, xmm6);
vpmaddubsw(xmm6, xmm4, xmm3);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm14, xmm14, xmm6);
add(AO, 0x40);
add(BO, 0x4);
align(4);
L(labels[69]);
mov(H, K);
test(H, 0x2);
je(labels[70], T_NEAR);
vxorps(xmm6, xmm6, xmm6);
vmovdqu(xmm1, xword[AO - 0x80]);
vpunpcklwd(xmm0, xmm1, xmm6);
vpunpckhwd(xmm1, xmm1, xmm6);
vmovdqu(xmm3, xword[AO - 0x70]);
vpunpcklwd(xmm2, xmm3, xmm6);
vpunpckhwd(xmm3, xmm3, xmm6);
vbroadcastss(xmm5, dword[BO - 0x80]);
vpunpcklwd(xmm5, xmm5, xmm5);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
vpmaddubsw(xmm6, xmm4, xmm2);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm12, xmm12, xmm6);
vpmaddubsw(xmm6, xmm4, xmm3);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm14, xmm14, xmm6);
add(AO, 0x20);
add(BO, 0x2);
align(4);
L(labels[70]);
mov(H, K);
test(H, 0x1);
je(labels[71], T_NEAR);
vxorps(xmm6, xmm6, xmm6);
vbroadcastss(xmm0, dword[AO - 0x80]);
vpunpcklbw(xmm0, xmm0, xmm6);
vpunpcklwd(xmm0, xmm0, xmm6);
vbroadcastss(xmm1, dword[AO - 0x7c]);
vpunpcklbw(xmm1, xmm1, xmm6);
vpunpcklwd(xmm1, xmm1, xmm6);
vbroadcastss(xmm2, dword[AO - 0x78]);
vpunpcklbw(xmm2, xmm2, xmm6);
vpunpcklwd(xmm2, xmm2, xmm6);
vbroadcastss(xmm3, dword[AO - 0x74]);
vpunpcklbw(xmm3, xmm3, xmm6);
vpunpcklwd(xmm3, xmm3, xmm6);
vbroadcastss(xmm5, dword[BO - 0x80]);
vpunpcklbw(xmm5, xmm5, xmm5);
vpunpcklwd(xmm5, xmm5, xmm5);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
vpmaddubsw(xmm6, xmm4, xmm2);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm12, xmm12, xmm6);
vpmaddubsw(xmm6, xmm4, xmm3);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm14, xmm14, xmm6);
add(AO, 0x10);
add(BO, 0x1);
align(4);
L(labels[71]);
mov(H, qword[COFFSET_RY]);
vbroadcastss(xmm0, dword[H]);
vpaddd(xmm8, xmm8, xmm0);
vpaddd(xmm10, xmm10, xmm0);
vpaddd(xmm12, xmm12, xmm0);
vpaddd(xmm14, xmm14, xmm0);
add(qword[COFFSET_RY], 0x4);
vmovdqu(xword[CO1], xmm8);
vxorps(xmm8, xmm8, xmm8);
vmovdqu(xword[CO1 + 0x10], xmm10);
vxorps(xmm10, xmm10, xmm10);
vmovdqu(xword[CO1 + 0x20], xmm12);
vxorps(xmm12, xmm12, xmm12);
vmovdqu(xword[CO1 + 0x30], xmm14);
vxorps(xmm14, xmm14, xmm14);
lea(CO1, ptr[CO1 + LDC * 1]);
align(4);
L(labels[73]);
mov(A, AO);
sub(J, 0x10);
cmp(J, 0x10);
jge(labels[72], T_NEAR);
align(4);
L(labels[74]);
test(J, 0x8);
jle(labels[2], T_NEAR);
mov(CO1, C);
add(C, 0x20);
mov(BO, B);
mov(AA, K);
shl(AA, 0x10);
lea(AA, ptr[A + AA * 1 + 0x200]);
mov(H, qword[COFFSET_RX]);
mov(qword[COFFSET_RY], H);
mov(I, N);
cmp(I, 0x2);
jl(labels[84], T_NEAR);
align(4);
L(labels[75]);
mov(AO, A);
vmovdqu(xmm0, xword[AO - 0x80]);
vmovdqu(xmm1, xword[AO - 0x70]);
vmovdqu(xmm5, xword[BO - 0x80]);
mov(H, K);
sar(H, 0x3);
jle(labels[79], T_NEAR);
sub(H, 0x8);
jle(labels[77], T_NEAR);
align(4);
L(labels[76]);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
prefetcht0(byte[AO + 0x180]);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
prefetcht0(byte[BO]);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm11, xmm11, xmm6);
vmovdqu(xmm0, xword[AO - 0x60]);
vmovdqu(xmm1, xword[AO - 0x50]);
prefetcht0(byte[AO + 0x1c0]);
vpshufd(xmm4, xmm5, 0xaa);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
vpshufd(xmm4, xmm5, 0xff);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm11, xmm11, xmm6);
vmovdqu(xmm5, xword[BO - 0x70]);
prefetcht1(byte[AA - 0x80]);
vmovdqu(xmm0, xword[AO - 0x40]);
vmovdqu(xmm1, xword[AO - 0x30]);
add(AA, 0x4);
add(AO, 0x40);
add(BO, 0x10);
sub(H, 0x1);
jg(labels[76], T_NEAR);
align(4);
L(labels[77]);
prefetcht0(byte[CO1 + 0x3c]);
prefetcht0(byte[CO1 + LDC * 1 + 0x3c]);
add(H, 0x8);
jle(labels[79], T_NEAR);
align(4);
L(labels[78]);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
prefetcht0(byte[AO + 0x180]);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
prefetcht0(byte[BO]);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm11, xmm11, xmm6);
vmovdqu(xmm0, xword[AO - 0x60]);
vmovdqu(xmm1, xword[AO - 0x50]);
prefetcht0(byte[AO + 0x1c0]);
vpshufd(xmm4, xmm5, 0xaa);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
vpshufd(xmm4, xmm5, 0xff);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm11, xmm11, xmm6);
vmovdqu(xmm5, xword[BO - 0x70]);
prefetcht1(byte[AA - 0x80]);
vmovdqu(xmm0, xword[AO - 0x40]);
vmovdqu(xmm1, xword[AO - 0x30]);
add(AA, 0x4);
add(AO, 0x40);
add(BO, 0x10);
sub(H, 0x1);
jg(labels[78], T_NEAR);
align(4);
L(labels[79]);
mov(H, K);
test(H, 0x4);
je(labels[80], T_NEAR);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm11, xmm11, xmm6);
add(AO, 0x20);
add(BO, 0x8);
align(4);
L(labels[80]);
mov(H, K);
test(H, 0x2);
je(labels[81], T_NEAR);
vxorps(xmm6, xmm6, xmm6);
vmovdqu(xmm1, xword[AO - 0x80]);
vpunpcklwd(xmm0, xmm1, xmm6);
vpunpckhwd(xmm1, xmm1, xmm6);
vbroadcastss(xmm5, dword[BO - 0x80]);
vpunpcklwd(xmm5, xmm5, xmm5);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm11, xmm11, xmm6);
add(AO, 0x10);
add(BO, 0x4);
align(4);
L(labels[81]);
mov(H, K);
test(H, 0x1);
je(labels[83], T_NEAR);
vxorps(xmm6, xmm6, xmm6);
vbroadcastss(xmm0, dword[AO - 0x80]);
vpunpcklbw(xmm0, xmm0, xmm6);
vpunpcklwd(xmm0, xmm0, xmm6);
vbroadcastss(xmm1, dword[AO - 0x7c]);
vpunpcklbw(xmm1, xmm1, xmm6);
vpunpcklwd(xmm1, xmm1, xmm6);
vbroadcastss(xmm5, dword[BO - 0x80]);
vpunpcklbw(xmm5, xmm5, xmm5);
vpunpcklwd(xmm5, xmm5, xmm5);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm11, xmm11, xmm6);
add(AO, 0x8);
add(BO, 0x2);
align(4);
L(labels[83]);
mov(H, qword[COFFSET_RY]);
vbroadcastss(xmm0, dword[H]);
vpaddd(xmm8, xmm8, xmm0);
vpaddd(xmm10, xmm10, xmm0);
vbroadcastss(xmm0, dword[H + 0x4]);
vpaddd(xmm9, xmm9, xmm0);
vpaddd(xmm11, xmm11, xmm0);
add(qword[COFFSET_RY], 0x8);
vmovdqu(xword[CO1], xmm8);
vxorps(xmm8, xmm8, xmm8);
vmovdqu(xword[CO1 + 0x10], xmm10);
vxorps(xmm10, xmm10, xmm10);
vmovdqu(xword[CO1 + LDC * 1], xmm9);
vxorps(xmm9, xmm9, xmm9);
vmovdqu(xword[CO1 + LDC * 1 + 0x10], xmm11);
vxorps(xmm11, xmm11, xmm11);
lea(CO1, ptr[CO1 + LDC * 2]);
sub(I, 0x2);
cmp(I, 0x2);
jge(labels[75], T_NEAR);
align(4);
L(labels[84]);
test(I, 0x1);
jle(labels[1], T_NEAR);
mov(AO, A);
vmovdqu(xmm0, xword[AO - 0x80]);
vmovdqu(xmm1, xword[AO - 0x70]);
vmovdqu(xmm5, xword[BO - 0x80]);
mov(H, K);
sar(H, 0x3);
jle(labels[88], T_NEAR);
sub(H, 0x8);
jle(labels[86], T_NEAR);
align(4);
L(labels[85]);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
prefetcht0(byte[AO + 0x180]);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
prefetcht0(byte[BO]);
vmovdqu(xmm0, xword[AO - 0x60]);
vmovdqu(xmm1, xword[AO - 0x50]);
prefetcht0(byte[AO + 0x1c0]);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
vmovdqu(xmm5, xword[BO - 0x78]);
prefetcht1(byte[AA - 0x80]);
vmovdqu(xmm0, xword[AO - 0x40]);
vmovdqu(xmm1, xword[AO - 0x30]);
add(AA, 0x4);
add(AO, 0x40);
add(BO, 0x8);
sub(H, 0x1);
jg(labels[85], T_NEAR);
align(4);
L(labels[86]);
prefetcht0(byte[CO1 + 0x3c]);
add(H, 0x8);
jle(labels[88], T_NEAR);
align(4);
L(labels[87]);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
prefetcht0(byte[AO + 0x180]);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
prefetcht0(byte[BO]);
vmovdqu(xmm0, xword[AO - 0x60]);
vmovdqu(xmm1, xword[AO - 0x50]);
prefetcht0(byte[AO + 0x1c0]);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
vmovdqu(xmm5, xword[BO - 0x78]);
prefetcht1(byte[AA - 0x80]);
vmovdqu(xmm0, xword[AO - 0x40]);
vmovdqu(xmm1, xword[AO - 0x30]);
add(AA, 0x4);
add(AO, 0x40);
add(BO, 0x8);
sub(H, 0x1);
jg(labels[87], T_NEAR);
align(4);
L(labels[88]);
mov(H, K);
test(H, 0x4);
je(labels[89], T_NEAR);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
add(AO, 0x20);
add(BO, 0x4);
align(4);
L(labels[89]);
mov(H, K);
test(H, 0x2);
je(labels[90], T_NEAR);
vxorps(xmm6, xmm6, xmm6);
vmovdqu(xmm1, xword[AO - 0x80]);
vpunpcklwd(xmm0, xmm1, xmm6);
vpunpckhwd(xmm1, xmm1, xmm6);
vbroadcastss(xmm5, dword[BO - 0x80]);
vpunpcklwd(xmm5, xmm5, xmm5);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
add(AO, 0x10);
add(BO, 0x2);
align(4);
L(labels[90]);
mov(H, K);
test(H, 0x1);
je(labels[0], T_NEAR);
vxorps(xmm6, xmm6, xmm6);
vbroadcastss(xmm0, dword[AO - 0x80]);
vpunpcklbw(xmm0, xmm0, xmm6);
vpunpcklwd(xmm0, xmm0, xmm6);
vbroadcastss(xmm1, dword[AO - 0x7c]);
vpunpcklbw(xmm1, xmm1, xmm6);
vpunpcklwd(xmm1, xmm1, xmm6);
vbroadcastss(xmm5, dword[BO - 0x80]);
vpunpcklbw(xmm5, xmm5, xmm5);
vpunpcklwd(xmm5, xmm5, xmm5);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpmaddubsw(xmm6, xmm4, xmm1);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm10, xmm10, xmm6);
add(AO, 0x8);
add(BO, 0x1);
align(4);
L(labels[0]);
mov(H, qword[COFFSET_RY]);
vbroadcastss(xmm0, dword[H]);
vpaddd(xmm8, xmm8, xmm0);
vpaddd(xmm10, xmm10, xmm0);
add(qword[COFFSET_RY], 0x4);
vmovdqu(xword[CO1], xmm8);
vxorps(xmm8, xmm8, xmm8);
vmovdqu(xword[CO1 + 0x10], xmm10);
vxorps(xmm10, xmm10, xmm10);
lea(CO1, ptr[CO1 + LDC * 1]);
align(4);
L(labels[1]);
mov(A, AO);
align(4);
L(labels[2]);
test(J, 0x4);
jle(labels[21], T_NEAR);
mov(CO1, C);
add(C, 0x10);
mov(BO, B);
mov(AA, K);
shl(AA, 0x8);
lea(AA, ptr[A + AA * 1 + 0x200]);
mov(H, qword[COFFSET_RX]);
mov(qword[COFFSET_RY], H);
mov(I, N);
cmp(I, 0x2);
jl(labels[12], T_NEAR);
align(4);
L(labels[4]);
mov(AO, A);
vmovdqu(xmm0, xword[AO - 0x80]);
vmovdqu(xmm5, xword[BO - 0x80]);
mov(H, K);
sar(H, 0x3);
jle(labels[8], T_NEAR);
sub(H, 0x8);
jle(labels[6], T_NEAR);
align(4);
L(labels[5]);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
prefetcht0(byte[AO + 0x180]);
prefetcht0(byte[BO]);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vmovdqu(xmm0, xword[AO - 0x70]);
prefetcht0(byte[AO + 0x1c0]);
vpshufd(xmm4, xmm5, 0xaa);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpshufd(xmm4, xmm5, 0xff);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vmovdqu(xmm5, xword[BO - 0x70]);
prefetcht1(byte[AA - 0x80]);
vmovdqu(xmm0, xword[AO - 0x60]);
add(AA, 0x4);
add(AO, 0x20);
add(BO, 0x10);
sub(H, 0x1);
jg(labels[5], T_NEAR);
align(4);
L(labels[6]);
prefetcht0(byte[CO1 + 0x3c]);
prefetcht0(byte[CO1 + LDC * 1 + 0x3c]);
add(H, 0x8);
jle(labels[8], T_NEAR);
align(4);
L(labels[7]);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
prefetcht0(byte[AO + 0x180]);
prefetcht0(byte[BO]);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vmovdqu(xmm0, xword[AO - 0x70]);
prefetcht0(byte[AO + 0x1c0]);
vpshufd(xmm4, xmm5, 0xaa);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpshufd(xmm4, xmm5, 0xff);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vmovdqu(xmm5, xword[BO - 0x70]);
prefetcht1(byte[AA - 0x80]);
vmovdqu(xmm0, xword[AO - 0x60]);
add(AA, 0x4);
add(AO, 0x20);
add(BO, 0x10);
sub(H, 0x1);
jg(labels[7], T_NEAR);
align(4);
L(labels[8]);
mov(H, K);
test(H, 0x4);
je(labels[9], T_NEAR);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
add(AO, 0x10);
add(BO, 0x8);
align(4);
L(labels[9]);
mov(H, K);
test(H, 0x2);
je(labels[10], T_NEAR);
vxorps(xmm6, xmm6, xmm6);
vmovdqu(xmm1, xword[AO - 0x80]);
vpunpcklwd(xmm0, xmm1, xmm6);
vbroadcastss(xmm5, dword[BO - 0x80]);
vpunpcklwd(xmm5, xmm5, xmm5);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
add(AO, 0x8);
add(BO, 0x4);
align(4);
L(labels[10]);
mov(H, K);
test(H, 0x1);
je(labels[11], T_NEAR);
vxorps(xmm6, xmm6, xmm6);
vbroadcastss(xmm0, dword[AO - 0x80]);
vpunpcklbw(xmm0, xmm0, xmm6);
vpunpcklwd(xmm0, xmm0, xmm6);
vbroadcastss(xmm5, dword[BO - 0x80]);
vpunpcklbw(xmm5, xmm5, xmm5);
vpunpcklwd(xmm5, xmm5, xmm5);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
add(AO, 0x4);
add(BO, 0x2);
align(4);
L(labels[11]);
mov(H, qword[COFFSET_RY]);
vbroadcastss(xmm0, dword[H]);
vpaddd(xmm8, xmm8, xmm0);
vbroadcastss(xmm0, dword[H + 0x4]);
vpaddd(xmm9, xmm9, xmm0);
add(qword[COFFSET_RY], 0x8);
vmovdqu(xword[CO1], xmm8);
vxorps(xmm8, xmm8, xmm8);
vmovdqu(xword[CO1 + LDC * 1], xmm9);
vxorps(xmm9, xmm9, xmm9);
lea(CO1, ptr[CO1 + LDC * 2]);
sub(I, 0x2);
cmp(I, 0x2);
jge(labels[4], T_NEAR);
align(4);
L(labels[12]);
test(I, 0x1);
jle(labels[20], T_NEAR);
mov(AO, A);
vmovdqu(xmm0, xword[AO - 0x80]);
vmovdqu(xmm5, xword[BO - 0x80]);
mov(H, K);
sar(H, 0x3);
jle(labels[16], T_NEAR);
sub(H, 0x8);
jle(labels[14], T_NEAR);
align(4);
L(labels[13]);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
prefetcht0(byte[AO + 0x180]);
prefetcht0(byte[BO]);
vmovdqu(xmm0, xword[AO - 0x70]);
prefetcht0(byte[AO + 0x1c0]);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vmovdqu(xmm5, xword[BO - 0x78]);
prefetcht1(byte[AA - 0x80]);
vmovdqu(xmm0, xword[AO - 0x60]);
add(AA, 0x4);
add(AO, 0x20);
add(BO, 0x8);
sub(H, 0x1);
jg(labels[13], T_NEAR);
align(4);
L(labels[14]);
prefetcht0(byte[CO1 + 0x3c]);
add(H, 0x8);
jle(labels[16], T_NEAR);
align(4);
L(labels[15]);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
prefetcht0(byte[AO + 0x180]);
prefetcht0(byte[BO]);
vmovdqu(xmm0, xword[AO - 0x70]);
prefetcht0(byte[AO + 0x1c0]);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vmovdqu(xmm5, xword[BO - 0x78]);
prefetcht1(byte[AA - 0x80]);
vmovdqu(xmm0, xword[AO - 0x60]);
add(AA, 0x4);
add(AO, 0x20);
add(BO, 0x8);
sub(H, 0x1);
jg(labels[15], T_NEAR);
align(4);
L(labels[16]);
mov(H, K);
test(H, 0x4);
je(labels[17], T_NEAR);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
add(AO, 0x10);
add(BO, 0x4);
align(4);
L(labels[17]);
mov(H, K);
test(H, 0x2);
je(labels[18], T_NEAR);
vxorps(xmm6, xmm6, xmm6);
vmovdqu(xmm1, xword[AO - 0x80]);
vpunpcklwd(xmm0, xmm1, xmm6);
vbroadcastss(xmm5, dword[BO - 0x80]);
vpunpcklwd(xmm5, xmm5, xmm5);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
add(AO, 0x8);
add(BO, 0x2);
align(4);
L(labels[18]);
mov(H, K);
test(H, 0x1);
je(labels[19], T_NEAR);
vxorps(xmm6, xmm6, xmm6);
vbroadcastss(xmm0, dword[AO - 0x80]);
vpunpcklbw(xmm0, xmm0, xmm6);
vpunpcklwd(xmm0, xmm0, xmm6);
vbroadcastss(xmm5, dword[BO - 0x80]);
vpunpcklbw(xmm5, xmm5, xmm5);
vpunpcklwd(xmm5, xmm5, xmm5);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
add(AO, 0x4);
add(BO, 0x1);
align(4);
L(labels[19]);
mov(H, qword[COFFSET_RY]);
vbroadcastss(xmm0, dword[H]);
vpaddd(xmm8, xmm8, xmm0);
add(qword[COFFSET_RY], 0x4);
vmovdqu(xword[CO1], xmm8);
vxorps(xmm8, xmm8, xmm8);
lea(CO1, ptr[CO1 + LDC * 1]);
align(4);
L(labels[20]);
mov(A, AO);
align(4);
L(labels[21]);
test(J, 0x2);
jle(labels[39], T_NEAR);
mov(CO1, C);
add(C, 0x8);
mov(BO, B);
mov(AA, K);
shl(AA, 0x4);
lea(AA, ptr[A + AA * 1 + 0x200]);
mov(H, qword[COFFSET_RX]);
mov(qword[COFFSET_RY], H);
mov(I, N);
cmp(I, 0x2);
jl(labels[30], T_NEAR);
align(4);
L(labels[22]);
mov(AO, A);
vmovdqu(xmm0, xword[AO - 0x80]);
vmovdqu(xmm5, xword[BO - 0x80]);
mov(H, K);
sar(H, 0x3);
jle(labels[26], T_NEAR);
sub(H, 0x8);
jle(labels[24], T_NEAR);
align(4);
L(labels[23]);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
prefetcht0(byte[AO + 0x180]);
prefetcht0(byte[BO]);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vmovdqu(xmm0, xword[AO - 0x78]);
prefetcht0(byte[AO + 0x1c0]);
vpshufd(xmm4, xmm5, 0xaa);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpshufd(xmm4, xmm5, 0xff);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vmovdqu(xmm5, xword[BO - 0x70]);
prefetcht1(byte[AA - 0x80]);
vmovdqu(xmm0, xword[AO - 0x70]);
add(AA, 0x4);
add(AO, 0x10);
add(BO, 0x10);
sub(H, 0x1);
jg(labels[23], T_NEAR);
align(4);
L(labels[24]);
prefetcht0(byte[CO1 + 0x3c]);
prefetcht0(byte[CO1 + LDC * 1 + 0x3c]);
add(H, 0x8);
jle(labels[26], T_NEAR);
align(4);
L(labels[25]);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
prefetcht0(byte[AO + 0x180]);
prefetcht0(byte[BO]);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vmovdqu(xmm0, xword[AO - 0x78]);
prefetcht0(byte[AO + 0x1c0]);
vpshufd(xmm4, xmm5, 0xaa);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpshufd(xmm4, xmm5, 0xff);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vmovdqu(xmm5, xword[BO - 0x70]);
prefetcht1(byte[AA - 0x80]);
vmovdqu(xmm0, xword[AO - 0x70]);
add(AA, 0x4);
add(AO, 0x10);
add(BO, 0x10);
sub(H, 0x1);
jg(labels[25], T_NEAR);
align(4);
L(labels[26]);
mov(H, K);
test(H, 0x4);
je(labels[27], T_NEAR);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
add(AO, 0x8);
add(BO, 0x8);
align(4);
L(labels[27]);
mov(H, K);
test(H, 0x2);
je(labels[28], T_NEAR);
vxorps(xmm6, xmm6, xmm6);
vmovdqu(xmm1, xword[AO - 0x80]);
vpunpcklwd(xmm0, xmm1, xmm6);
vbroadcastss(xmm5, dword[BO - 0x80]);
vpunpcklwd(xmm5, xmm5, xmm5);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
add(AO, 0x4);
add(BO, 0x4);
align(4);
L(labels[28]);
mov(H, K);
test(H, 0x1);
je(labels[29], T_NEAR);
vxorps(xmm6, xmm6, xmm6);
vbroadcastss(xmm0, dword[AO - 0x80]);
vpunpcklbw(xmm0, xmm0, xmm6);
vpunpcklwd(xmm0, xmm0, xmm6);
vbroadcastss(xmm5, dword[BO - 0x80]);
vpunpcklbw(xmm5, xmm5, xmm5);
vpunpcklwd(xmm5, xmm5, xmm5);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
add(AO, 0x2);
add(BO, 0x2);
align(4);
L(labels[29]);
mov(H, qword[COFFSET_RY]);
vbroadcastss(xmm0, dword[H]);
vpaddd(xmm8, xmm8, xmm0);
vbroadcastss(xmm0, dword[H + 0x4]);
vpaddd(xmm9, xmm9, xmm0);
add(qword[COFFSET_RY], 0x8);
vmovlps(qword[CO1], xmm8);
vxorps(xmm8, xmm8, xmm8);
vmovlps(qword[CO1 + LDC * 1], xmm9);
vxorps(xmm9, xmm9, xmm9);
lea(CO1, ptr[CO1 + LDC * 2]);
sub(I, 0x2);
cmp(I, 0x2);
jge(labels[22], T_NEAR);
align(4);
L(labels[30]);
test(I, 0x1);
jle(labels[38], T_NEAR);
mov(AO, A);
vmovdqu(xmm0, xword[AO - 0x80]);
vmovdqu(xmm5, xword[BO - 0x80]);
mov(H, K);
sar(H, 0x3);
jle(labels[34], T_NEAR);
sub(H, 0x8);
jle(labels[32], T_NEAR);
align(4);
L(labels[31]);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
prefetcht0(byte[AO + 0x180]);
prefetcht0(byte[BO]);
vmovdqu(xmm0, xword[AO - 0x78]);
prefetcht0(byte[AO + 0x1c0]);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vmovdqu(xmm5, xword[BO - 0x78]);
prefetcht1(byte[AA - 0x80]);
vmovdqu(xmm0, xword[AO - 0x70]);
add(AA, 0x4);
add(AO, 0x10);
add(BO, 0x8);
sub(H, 0x1);
jg(labels[31], T_NEAR);
align(4);
L(labels[32]);
prefetcht0(byte[CO1 + 0x3c]);
add(H, 0x8);
jle(labels[34], T_NEAR);
align(4);
L(labels[33]);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
prefetcht0(byte[AO + 0x180]);
prefetcht0(byte[BO]);
vmovdqu(xmm0, xword[AO - 0x78]);
prefetcht0(byte[AO + 0x1c0]);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vmovdqu(xmm5, xword[BO - 0x78]);
prefetcht1(byte[AA - 0x80]);
vmovdqu(xmm0, xword[AO - 0x70]);
add(AA, 0x4);
add(AO, 0x10);
add(BO, 0x8);
sub(H, 0x1);
jg(labels[33], T_NEAR);
align(4);
L(labels[34]);
mov(H, K);
test(H, 0x4);
je(labels[35], T_NEAR);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
add(AO, 0x8);
add(BO, 0x4);
align(4);
L(labels[35]);
mov(H, K);
test(H, 0x2);
je(labels[36], T_NEAR);
vxorps(xmm6, xmm6, xmm6);
vmovdqu(xmm1, xword[AO - 0x80]);
vpunpcklwd(xmm0, xmm1, xmm6);
vbroadcastss(xmm5, dword[BO - 0x80]);
vpunpcklwd(xmm5, xmm5, xmm5);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
add(AO, 0x4);
add(BO, 0x2);
align(4);
L(labels[36]);
mov(H, K);
test(H, 0x1);
je(labels[37], T_NEAR);
vxorps(xmm6, xmm6, xmm6);
vbroadcastss(xmm0, dword[AO - 0x80]);
vpunpcklbw(xmm0, xmm0, xmm6);
vpunpcklwd(xmm0, xmm0, xmm6);
vbroadcastss(xmm5, dword[BO - 0x80]);
vpunpcklbw(xmm5, xmm5, xmm5);
vpunpcklwd(xmm5, xmm5, xmm5);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
add(AO, 0x2);
add(BO, 0x1);
align(4);
L(labels[37]);
mov(H, qword[COFFSET_RY]);
vbroadcastss(xmm0, dword[H]);
vpaddd(xmm8, xmm8, xmm0);
add(qword[COFFSET_RY], 0x4);
vmovlps(qword[CO1], xmm8);
vxorps(xmm8, xmm8, xmm8);
lea(CO1, ptr[CO1 + LDC * 1]);
align(4);
L(labels[38]);
mov(A, AO);
align(4);
L(labels[39]);
test(J, 0x1);
jle(labels[57], T_NEAR);
mov(CO1, C);
add(C, 0x4);
mov(BO, B);
mov(AA, K);
shl(AA, 0x2);
lea(AA, ptr[A + AA * 1 + 0x200]);
mov(H, qword[COFFSET_RX]);
mov(qword[COFFSET_RY], H);
mov(I, N);
cmp(I, 0x2);
jl(labels[48], T_NEAR);
align(4);
L(labels[40]);
mov(AO, A);
vmovdqu(xmm0, xword[AO - 0x80]);
vmovdqu(xmm5, xword[BO - 0x80]);
mov(H, K);
sar(H, 0x3);
jle(labels[44], T_NEAR);
sub(H, 0x8);
jle(labels[42], T_NEAR);
align(4);
L(labels[41]);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
prefetcht0(byte[AO + 0x180]);
prefetcht0(byte[BO]);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vmovdqu(xmm0, xword[AO - 0x7c]);
prefetcht0(byte[AO + 0x1c0]);
vpshufd(xmm4, xmm5, 0xaa);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpshufd(xmm4, xmm5, 0xff);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vmovdqu(xmm5, xword[BO - 0x70]);
prefetcht1(byte[AA - 0x80]);
vmovdqu(xmm0, xword[AO - 0x78]);
add(AA, 0x4);
add(AO, 0x8);
add(BO, 0x10);
sub(H, 0x1);
jg(labels[41], T_NEAR);
align(4);
L(labels[42]);
prefetcht0(byte[CO1 + 0x3c]);
prefetcht0(byte[CO1 + LDC * 1 + 0x3c]);
add(H, 0x8);
jle(labels[44], T_NEAR);
align(4);
L(labels[43]);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
prefetcht0(byte[AO + 0x180]);
prefetcht0(byte[BO]);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vmovdqu(xmm0, xword[AO - 0x7c]);
prefetcht0(byte[AO + 0x1c0]);
vpshufd(xmm4, xmm5, 0xaa);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpshufd(xmm4, xmm5, 0xff);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
vmovdqu(xmm5, xword[BO - 0x70]);
prefetcht1(byte[AA - 0x80]);
vmovdqu(xmm0, xword[AO - 0x78]);
add(AA, 0x4);
add(AO, 0x8);
add(BO, 0x10);
sub(H, 0x1);
jg(labels[43], T_NEAR);
align(4);
L(labels[44]);
mov(H, K);
test(H, 0x4);
je(labels[45], T_NEAR);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
add(AO, 0x4);
add(BO, 0x8);
align(4);
L(labels[45]);
mov(H, K);
test(H, 0x2);
je(labels[46], T_NEAR);
vxorps(xmm6, xmm6, xmm6);
vmovdqu(xmm1, xword[AO - 0x80]);
vpunpcklwd(xmm0, xmm1, xmm6);
vbroadcastss(xmm5, dword[BO - 0x80]);
vpunpcklwd(xmm5, xmm5, xmm5);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
add(AO, 0x2);
add(BO, 0x4);
align(4);
L(labels[46]);
mov(H, K);
test(H, 0x1);
je(labels[47], T_NEAR);
vxorps(xmm6, xmm6, xmm6);
vbroadcastss(xmm0, dword[AO - 0x80]);
vpunpcklbw(xmm0, xmm0, xmm6);
vpunpcklwd(xmm0, xmm0, xmm6);
vbroadcastss(xmm5, dword[BO - 0x80]);
vpunpcklbw(xmm5, xmm5, xmm5);
vpunpcklwd(xmm5, xmm5, xmm5);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm9, xmm9, xmm6);
add(AO, 0x1);
add(BO, 0x2);
align(4);
L(labels[47]);
mov(H, qword[COFFSET_RY]);
vbroadcastss(xmm0, dword[H]);
vpaddd(xmm8, xmm8, xmm0);
vbroadcastss(xmm0, dword[H + 0x4]);
vpaddd(xmm9, xmm9, xmm0);
add(qword[COFFSET_RY], 0x8);
vmovss(dword[CO1], xmm8);
vxorps(xmm8, xmm8, xmm8);
vmovss(dword[CO1 + LDC * 1], xmm9);
vxorps(xmm9, xmm9, xmm9);
lea(CO1, ptr[CO1 + LDC * 2]);
sub(I, 0x2);
cmp(I, 0x2);
jge(labels[40], T_NEAR);
align(4);
L(labels[48]);
test(I, 0x1);
jle(labels[56], T_NEAR);
mov(AO, A);
vmovdqu(xmm0, xword[AO - 0x80]);
vmovdqu(xmm5, xword[BO - 0x80]);
mov(H, K);
sar(H, 0x3);
jle(labels[52], T_NEAR);
sub(H, 0x8);
jle(labels[50], T_NEAR);
align(4);
L(labels[49]);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
prefetcht0(byte[AO + 0x180]);
prefetcht0(byte[BO]);
vmovdqu(xmm0, xword[AO - 0x7c]);
prefetcht0(byte[AO + 0x1c0]);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vmovdqu(xmm5, xword[BO - 0x78]);
prefetcht1(byte[AA - 0x80]);
vmovdqu(xmm0, xword[AO - 0x78]);
add(AA, 0x4);
add(AO, 0x8);
add(BO, 0x8);
sub(H, 0x1);
jg(labels[49], T_NEAR);
align(4);
L(labels[50]);
prefetcht0(byte[CO1 + 0x3c]);
add(H, 0x8);
jle(labels[52], T_NEAR);
align(4);
L(labels[51]);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
prefetcht0(byte[AO + 0x180]);
prefetcht0(byte[BO]);
vmovdqu(xmm0, xword[AO - 0x7c]);
prefetcht0(byte[AO + 0x1c0]);
vpshufd(xmm4, xmm5, 0x55);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
vmovdqu(xmm5, xword[BO - 0x78]);
prefetcht1(byte[AA - 0x80]);
vmovdqu(xmm0, xword[AO - 0x78]);
add(AA, 0x4);
add(AO, 0x8);
add(BO, 0x8);
sub(H, 0x1);
jg(labels[51], T_NEAR);
align(4);
L(labels[52]);
mov(H, K);
test(H, 0x4);
je(labels[53], T_NEAR);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
add(AO, 0x4);
add(BO, 0x4);
align(4);
L(labels[53]);
mov(H, K);
test(H, 0x2);
je(labels[54], T_NEAR);
vxorps(xmm6, xmm6, xmm6);
vmovdqu(xmm1, xword[AO - 0x80]);
vpunpcklwd(xmm0, xmm1, xmm6);
vbroadcastss(xmm5, dword[BO - 0x80]);
vpunpcklwd(xmm5, xmm5, xmm5);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
add(AO, 0x2);
add(BO, 0x2);
align(4);
L(labels[54]);
mov(H, K);
test(H, 0x1);
je(labels[55], T_NEAR);
vxorps(xmm6, xmm6, xmm6);
vbroadcastss(xmm0, dword[AO - 0x80]);
vpunpcklbw(xmm0, xmm0, xmm6);
vpunpcklwd(xmm0, xmm0, xmm6);
vbroadcastss(xmm5, dword[BO - 0x80]);
vpunpcklbw(xmm5, xmm5, xmm5);
vpunpcklwd(xmm5, xmm5, xmm5);
vpshufd(xmm4, xmm5, 0x0);
vpmaddubsw(xmm6, xmm4, xmm0);
vpmaddwd(xmm6, xmm7, xmm6);
vpaddd(xmm8, xmm8, xmm6);
add(AO, 0x1);
add(BO, 0x1);
align(4);
L(labels[55]);
mov(H, qword[COFFSET_RY]);
vbroadcastss(xmm0, dword[H]);
vpaddd(xmm8, xmm8, xmm0);
add(qword[COFFSET_RY], 0x4);
vmovss(dword[CO1], xmm8);
vxorps(xmm8, xmm8, xmm8);
lea(CO1, ptr[CO1 + LDC * 1]);
align(4);
L(labels[56]);
mov(A, AO);
align(4);
L(labels[57]);
add(rsp, stack_alloc_size);
postamble();
}
outLocalLabel();
#undef M
#undef N
#undef K
#undef A
#undef B
#undef C
#undef LDC
#undef AA
#undef I
#undef J
#undef H
#undef AO
#undef BO
#undef CO1
#undef CO2
#ifdef _WIN32
#undef ARG_A
#undef ARG_B
#endif
#undef ARG_C
#undef ARG_LDC
#undef ARG_COFFSET_R
#undef COFFSET_RX
#undef COFFSET_RY
}
} // namespace x64
} // namespace cpu
} // namespace impl
} // namespace dnnl
```
|
Beverley Mary Evelyn Cains (born 25 February 1938) is a former Australian politician.
Cains was elected to the Australian Capital Territory House of Assembly for the electorate of Fraser in 1979 as a member of the Family Team; she was the party's sole representative until 1982, when she was joined by Betty Hocking. The House of Assembly ceased to exist in 1986 in preparation for self-government.
After unsuccessfully contesting the federal seat of Canberra in the 1987 Australian federal election, Cains headed the Family Team's ticket for the new Australian Capital Territory Legislative Assembly in the 1989 ACT election, but was defeated.
Her final attempt at winning public office was in the 1992 ACT election. On that occasion she was second on the list for the Better Management Team. First on the list was Harold Hird (who had been an Independent member of the Legislative Assembly 1975-1979 and House of Assembly 1979–1986, and would subsequently be a Liberal member of the Legislative Assembly 1995–2001) and third was Alan Fitzgerald (who had been a member of the predecessor body the Australian Capital Territory Advisory Council 1967–1974, initially as a joke candidate and then as a member of the Australia Party).
References
1938 births
Australian Family Movement politicians
Members of the Australian Capital Territory House of Assembly
Living people
|
```python
import graphene
from pyquery import PyQuery as pq
def _query_selector(pq, selector):
if not selector:
return pq
return pq.find(selector)
class Node(graphene.Interface):
'''A Node represents a DOM Node'''
content = graphene.String(description='The html representation of the subnodes for the selected DOM',
selector=graphene.String())
html = graphene.String(description='The html representation of the selected DOM',
selector=graphene.String())
text = graphene.String(description='The text for the selected DOM',
selector=graphene.String())
tag = graphene.String(description='The tag for the selected DOM',
selector=graphene.String())
attr = graphene.String(description='The DOM attr of the Node',
selector=graphene.String(),
name=graphene.String(required=True))
_is = graphene.Boolean(description='Returns True if the DOM matches the selector',
name='is', selector=graphene.String(required=True))
query = graphene.List(lambda: Element,
description='Find elements using selector traversing down from self',
selector=graphene.String(required=True))
children = graphene.List(lambda: Element,
description='The list of children elements from self',
selector=graphene.String())
parents = graphene.List(lambda: Element,
description='The list of parent elements from self',
selector=graphene.String())
parent = graphene.Field(lambda: Element,
description='The parent element from self')
siblings = graphene.List(lambda: Element,
description='The siblings elements from self',
selector=graphene.String())
next = graphene.Field(lambda: Element,
description='The immediately following sibling from self',
selector=graphene.String())
next_all = graphene.List(lambda: Element,
description='The list of following siblings from self',
selector=graphene.String())
prev = graphene.Field(lambda: Element,
description='The immediately preceding sibling from self',
selector=graphene.String())
prev_all = graphene.List(lambda: Element,
description='The list of preceding siblings from self',
selector=graphene.String())
def resolve_content(self, info, selector):
return _query_selector(self, selector).eq(0).html()
def resolve_html(self, info, selector):
return _query_selector(self, selector).outerHtml()
def resolve_text(self, info, selector):
return _query_selector(self, selector).eq(0).remove('script').text()
def resolve_tag(self, info, selector):
el = _query_selector(self, selector).eq(0)
if el:
return el[0].tag
def resolve__is(self, info, selector=None):
return self.is_(selector)
def resolve_attr(self, info, name, selector=None):
return _query_selector(self, selector).attr(name)
def resolve_query(self, info, selector=None):
return _query_selector(self, selector).items()
def resolve_children(self, info, selector=None):
return self.children(selector).items()
def resolve_parents(self, info, selector=None):
return self.parents(selector).items()
def resolve_parent(self, info):
parent = self.parents().eq(-1)
if parent:
return parent
def resolve_siblings(self, info, selector=None):
return self.siblings(selector).items()
def resolve_next(self, info, selector=None):
_next = self.nextAll(selector)
if _next:
return _next.eq(0)
def resolve_next_all(self, info, selector=None):
return self.nextAll(selector).items()
def resolve_prev(self, info, selector=None):
prev = self.prevAll(selector)
if prev:
return prev.eq(0)
def resolve_prev_all(self, info, selector=None):
return self.prevAll(selector).items()
def get_page(page):
return pq(page, headers={'user-agent': 'gdom'})
class Document(graphene.ObjectType):
'''
The Document Type represent any web page loaded and
serves as an entry point into the page content
'''
class Meta:
interfaces = (Node, )
title = graphene.String(description='The title of the document')
@classmethod
def is_type_of(cls, root, info):
return isinstance(root, pq) or super(Document, cls).is_type_of(root, info)
def resolve_title(self, info):
return self.find('title').eq(0).text()
class Element(graphene.ObjectType):
'''
A Element Type represents an object in a Document
'''
class Meta:
interfaces = (Node, )
visit = graphene.Field(Document,
description='Visit will visit the href of the link and return the corresponding document')
@classmethod
def is_type_of(cls, root, info):
return isinstance(root, pq) or super(Element, cls).is_type_of(root, info)
def resolve_visit(self, info):
# If is a link we follow through href attr
# return the resulting Document
if self.is_('a'):
href = self.attr('href')
return get_page(href)
class Query(graphene.ObjectType):
page = graphene.Field(Document,
description='Visit the specified page',
url=graphene.String(
description='The url of the page'),
_source=graphene.String(
name='source', description='The source of the page')
)
def resolve_page(self, info, url=None, source=None):
assert url or source, 'At least you have to provide url or source of the page'
return get_page(url or source)
schema = graphene.Schema(query=Query, types=[Element])
```
|
```php
<?php
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
*/
namespace Google\Service\SecurityCommandCenter;
class MuteInfo extends \Google\Collection
{
protected $collection_key = 'dynamicMuteRecords';
protected $dynamicMuteRecordsType = DynamicMuteRecord::class;
protected $dynamicMuteRecordsDataType = 'array';
protected $staticMuteType = StaticMute::class;
protected $staticMuteDataType = '';
/**
* @param DynamicMuteRecord[]
*/
public function setDynamicMuteRecords($dynamicMuteRecords)
{
$this->dynamicMuteRecords = $dynamicMuteRecords;
}
/**
* @return DynamicMuteRecord[]
*/
public function getDynamicMuteRecords()
{
return $this->dynamicMuteRecords;
}
/**
* @param StaticMute
*/
public function setStaticMute(StaticMute $staticMute)
{
$this->staticMute = $staticMute;
}
/**
* @return StaticMute
*/
public function getStaticMute()
{
return $this->staticMute;
}
}
// Adding a class alias for backwards compatibility with the previous class name.
class_alias(MuteInfo::class, 'Google_Service_SecurityCommandCenter_MuteInfo');
```
|
The 2020 German Indoor Athletics Championships () was the 67th edition of the national championship in indoor track and field for Germany. It was held on 22–23 February at the Arena Leipzig in Leipzig. A total of 24 events, 12 for men and 12 for women, were contested. It was to serve as preparation for the 2020 World Athletics Indoor Championships, which was postponed due to the COVID-19 outbreak in China before the German championships.
Several national championship events were staged elsewhere: combined events were held on 1–2 February in Leverkusen, relays were held on 16 February in Neubrandenburg, while racewalking events were hosted in Erfurt on 28 February.
Results
Men
Women
References
Results
Medalists
Results
Combined Events Results
German Indoor Athletics Championships
German Indoor Athletics Championships
German Indoor Athletics Championships
German Indoor Athletics Championships
Sports competitions in Leipzig
|
Vila Matilde may refer to:
Vila Matilde (São Paulo Metro)
Vila Matilde (district of São Paulo)
|
```go
// Unless explicitly stated otherwise all files in this repository are licensed
// This product includes software developed at Datadog (path_to_url
package observability
import (
"fmt"
"net/http"
"net/http/httptest"
"net/url"
"strconv"
"testing"
"time"
"github.com/benbjohnson/clock"
"github.com/stretchr/testify/assert"
"github.com/stretchr/testify/require"
"github.com/DataDog/datadog-agent/comp/core/telemetry"
"github.com/DataDog/datadog-agent/comp/core/telemetry/telemetryimpl"
"github.com/DataDog/datadog-agent/pkg/util/fxutil"
)
func TestTelemetryMiddleware(t *testing.T) {
testCases := []struct {
method string
path string
code int
duration time.Duration
}{
{
method: http.MethodGet,
path: "/test/1",
code: http.StatusOK,
duration: 0,
},
{
method: http.MethodPost,
path: "/test/2",
code: http.StatusInternalServerError,
duration: time.Millisecond,
},
{
method: http.MethodHead,
path: "/test/3",
code: http.StatusNotFound,
duration: time.Second,
},
}
serverName := "test"
for _, tc := range testCases {
testName := fmt.Sprintf("%s %s %d %s", tc.method, tc.path, tc.code, tc.duration)
t.Run(testName, func(t *testing.T) {
clock := clock.NewMock()
telemetry := fxutil.Test[telemetry.Mock](t, telemetryimpl.MockModule())
tm := newTelemetryMiddlewareFactory(telemetry, clock)
telemetryHandler := tm.Middleware(serverName)
var tcHandler http.HandlerFunc = func(w http.ResponseWriter, _ *http.Request) {
clock.Add(tc.duration)
w.WriteHeader(tc.code)
}
server := httptest.NewServer(telemetryHandler(tcHandler))
defer server.Close()
url := url.URL{
Scheme: "http",
Host: server.Listener.Addr().String(),
Path: tc.path,
}
req, err := http.NewRequest(tc.method, url.String(), nil)
require.NoError(t, err)
resp, err := server.Client().Do(req)
require.NoError(t, err)
resp.Body.Close()
observabilityMetric, err := telemetry.GetHistogramMetric(MetricSubsystem, MetricName)
require.NoError(t, err)
require.Len(t, observabilityMetric, 1)
metric := observabilityMetric[0]
assert.EqualValues(t, tc.duration.Seconds(), metric.Value())
labels := metric.Tags()
expected := map[string]string{
"servername": serverName,
"status_code": strconv.Itoa(tc.code),
"method": tc.method,
"path": tc.path,
}
assert.Equal(t, expected, labels)
})
}
}
func TestTelemetryMiddlewareDuration(t *testing.T) {
telemetry := fxutil.Test[telemetry.Mock](t, telemetryimpl.MockModule())
telemetryHandler := NewTelemetryMiddlewareFactory(telemetry).Middleware("test")
var tcHandler http.HandlerFunc = func(w http.ResponseWriter, _ *http.Request) {
w.WriteHeader(http.StatusOK)
}
server := httptest.NewServer(telemetryHandler(tcHandler))
defer server.Close()
start := time.Now()
resp, err := server.Client().Get(server.URL)
require.NoError(t, err)
resp.Body.Close()
duration := time.Since(start).Milliseconds()
require.LessOrEqual(t, duration, 100*time.Millisecond)
}
func TestTelemetryMiddlewareTwice(t *testing.T) {
telemetry := fxutil.Test[telemetry.Mock](t, telemetryimpl.MockModule())
tm := NewTelemetryMiddlewareFactory(telemetry)
// test that we can create multiple middleware instances
// Prometheus metrics can be registered only once, this test enforces that the metric
// is not created in the Middleware itself
_ = tm.Middleware("test1")
_ = tm.Middleware("test2")
}
```
|
```html
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<title>libdill</title>
<link rel="stylesheet" type="text/css" href="main.css">
</head>
<body>
<h1>libdill: Structured Concurrency for C</h1>
<ul id='toplist'>
<li><a href="index.html">Home</a></li>
<li><a href="download.html">Download</a></li>
<li><a href="documentation.html">Documentation</a></li>
<li><a href="tutorial.html">Tutorials</a></li>
<li><a href="faq.html">FAQ</a></li>
</ul>
<h1 id="name">NAME</h1>
<p>msleep - waits until deadline expires</p>
<h1 id="synopsis">SYNOPSIS</h1>
<div class="sourceCode"><pre class="sourceCode c"><code class="sourceCode c"><span class="pp">#include </span><span class="im"><libdill.h></span>
<span class="dt">int</span> msleep(
<span class="dt">int64_t</span> deadline);</code></pre></div>
<h1 id="description">DESCRIPTION</h1>
<p>This function blocks until the deadline expires or an error occurs. In the former case it returns zero.</p>
<p><strong>deadline</strong>: A point in time when the operation should time out, in milliseconds. Use the <strong>now</strong> function to get your current point in time. 0 means immediate timeout, i.e., perform the operation if possible or return without blocking if not. -1 means no deadline, i.e., the call will block forever if the operation cannot be performed.</p>
<h1 id="return-value">RETURN VALUE</h1>
<p>In case of success the function returns 0. In case of error it returns -1 and sets <strong>errno</strong> to one of the values below.</p>
<h1 id="errors">ERRORS</h1>
<ul>
<li><strong>ECANCELED</strong>: Current coroutine was canceled.</li>
</ul>
<h1 id="example">EXAMPLE</h1>
<div class="sourceCode"><pre class="sourceCode c"><code class="sourceCode c"><span class="dt">int</span> rc = msleep(now() + <span class="dv">1000</span>);
<span class="cf">if</span>(rc != <span class="dv">0</span>) {
perror(<span class="st">"Cannot sleep"</span>);
exit(<span class="dv">1</span>);
}
printf(<span class="st">"Slept succefully for 1 second.</span><span class="sc">\n</span><span class="st">"</span>);</code></pre></div>
<h1 id="see-also">SEE ALSO</h1>
<p><strong>now</strong>(3) <strong>now</strong>(3)</p>
</body>
```
|
Smicropus is a genus of moths in the family Geometridae.
References
Cyllopodini
|
Linde Hydraulics is a manufacturer of heavy duty drive systems consisting of hydraulics, power transmissions, and electronics. The company's product offerings include hydraulic pumps and motors, directional control valves, power transmissions as well as peripheral electronics and software.
Its products are used in agricultural, construction, forestry, landscaping, marine, material handling, mining, municipal, and stationary segments, as well as mobile lifting platforms.
History
Linde Hydraulics from 1904 to 2020.
Segments
Agricultural
Construction
Forestry
Industrial
Material Handling
Mining
Municipal
Offshore
Oil & Gas
Products
Pumps
Closed Circuit
Open Circuit
Motors
Variable Displacement
Swash Plate
Bent Axis
Self-Regulating
Fixed Displacement
CVT
Classic Hydrostat
Hydrostatic Variator for Internal Transmission Mount
Hydrostatic Variator for External Transmission Mount
Power Transmissions
Swing Drives
Track Drives
Wheel Drives
Valves
Directional Control Valves
Valve blocks
Valve modules
Electronics
Electronic control units (ECU)
Pilot control devices
Sensors & Actuators
Software
Services
Repair of hydraulic pumps and motors
Remanufacturing of hydraulic units
Sale of spare parts
Locations
Linde Hydraulics has 4 production plants in Germany (2x Aschaffenburg, Kahl and Ballenstedt) and a 5th factory in Weifang, China. The company has subsidiaries in Europe, United States, South America and China as well as a global network of sales and service partners.
References
External links
Engineering companies of Germany
Manufacturing companies of Germany
Companies based in Bavaria
Manufacturing companies established in 1904
German brands
|
```go
// This file is part of the go-ethereum library.
//
// The go-ethereum library is free software: you can redistribute it and/or modify
// (at your option) any later version.
//
// The go-ethereum library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
//
// along with the go-ethereum library. If not, see <path_to_url
// Package graphql provides a GraphQL interface to Ethereum node data.
package graphql
import (
"context"
"errors"
"fmt"
"strconv"
"github.com/ethereum/go-ethereum"
"github.com/ethereum/go-ethereum/common"
"github.com/ethereum/go-ethereum/common/hexutil"
"github.com/ethereum/go-ethereum/core/rawdb"
"github.com/ethereum/go-ethereum/core/types"
"github.com/ethereum/go-ethereum/core/vm"
"github.com/ethereum/go-ethereum/eth/filters"
"github.com/ethereum/go-ethereum/internal/ethapi"
"github.com/ethereum/go-ethereum/private"
"github.com/ethereum/go-ethereum/rpc"
)
var (
errBlockInvariant = errors.New("block objects must be instantiated with at least one of num or hash")
)
type Long int64
// ImplementsGraphQLType returns true if Long implements the provided GraphQL type.
func (b Long) ImplementsGraphQLType(name string) bool { return name == "Long" }
// UnmarshalGraphQL unmarshals the provided GraphQL query data.
func (b *Long) UnmarshalGraphQL(input interface{}) error {
var err error
switch input := input.(type) {
case string:
// uncomment to support hex values
//if strings.HasPrefix(input, "0x") {
// // apply leniency and support hex representations of longs.
// value, err := hexutil.DecodeUint64(input)
// *b = Long(value)
// return err
//} else {
value, err := strconv.ParseInt(input, 10, 64)
*b = Long(value)
return err
//}
case int32:
*b = Long(input)
case int64:
*b = Long(input)
default:
err = fmt.Errorf("unexpected type %T for Long", input)
}
return err
}
// Account represents an Ethereum account at a particular block.
type Account struct {
backend ethapi.Backend
address common.Address
blockNrOrHash rpc.BlockNumberOrHash
}
// getState fetches the StateDB object for an account.
func (a *Account) getState(ctx context.Context) (vm.MinimalApiState, error) {
stat, _, err := a.backend.StateAndHeaderByNumberOrHash(ctx, a.blockNrOrHash)
return stat, err
}
func (a *Account) Address(ctx context.Context) (common.Address, error) {
return a.address, nil
}
func (a *Account) Balance(ctx context.Context) (hexutil.Big, error) {
state, err := a.getState(ctx)
if err != nil {
return hexutil.Big{}, err
}
return hexutil.Big(*state.GetBalance(a.address)), nil
}
func (a *Account) TransactionCount(ctx context.Context) (hexutil.Uint64, error) {
state, err := a.getState(ctx)
if err != nil {
return 0, err
}
return hexutil.Uint64(state.GetNonce(a.address)), nil
}
func (a *Account) Code(ctx context.Context) (hexutil.Bytes, error) {
state, err := a.getState(ctx)
if err != nil {
return hexutil.Bytes{}, err
}
return state.GetCode(a.address), nil
}
func (a *Account) Storage(ctx context.Context, args struct{ Slot common.Hash }) (common.Hash, error) {
state, err := a.getState(ctx)
if err != nil {
return common.Hash{}, err
}
return state.GetState(a.address, args.Slot), nil
}
// Log represents an individual log message. All arguments are mandatory.
type Log struct {
backend ethapi.Backend
transaction *Transaction
log *types.Log
}
func (l *Log) Transaction(ctx context.Context) *Transaction {
return l.transaction
}
func (l *Log) Account(ctx context.Context, args BlockNumberArgs) *Account {
return &Account{
backend: l.backend,
address: l.log.Address,
blockNrOrHash: args.NumberOrLatest(),
}
}
func (l *Log) Index(ctx context.Context) int32 {
return int32(l.log.Index)
}
func (l *Log) Topics(ctx context.Context) []common.Hash {
return l.log.Topics
}
func (l *Log) Data(ctx context.Context) hexutil.Bytes {
return l.log.Data
}
// AccessTuple represents EIP-2930
type AccessTuple struct {
address common.Address
storageKeys *[]common.Hash
}
func (at *AccessTuple) Address(ctx context.Context) common.Address {
return at.address
}
func (at *AccessTuple) StorageKeys(ctx context.Context) *[]common.Hash {
return at.storageKeys
}
// Transaction represents an Ethereum transaction.
// backend and hash are mandatory; all others will be fetched when required.
type Transaction struct {
backend ethapi.Backend
hash common.Hash
tx *types.Transaction
block *Block
index uint64
receiptGetter receiptGetter
}
// resolve returns the internal transaction object, fetching it if needed.
func (t *Transaction) resolve(ctx context.Context) (*types.Transaction, error) {
if t.tx == nil {
tx, blockHash, _, index := rawdb.ReadTransaction(t.backend.ChainDb(), t.hash)
if tx != nil {
t.tx = tx
blockNrOrHash := rpc.BlockNumberOrHashWithHash(blockHash, false)
t.block = &Block{
backend: t.backend,
numberOrHash: &blockNrOrHash,
}
t.index = index
} else {
t.tx = t.backend.GetPoolTransaction(t.hash)
}
}
return t.tx, nil
}
func (t *Transaction) Hash(ctx context.Context) common.Hash {
return t.hash
}
func (t *Transaction) InputData(ctx context.Context) (hexutil.Bytes, error) {
tx, err := t.resolve(ctx)
if err != nil || tx == nil {
return hexutil.Bytes{}, err
}
return tx.Data(), nil
}
func (t *Transaction) Gas(ctx context.Context) (hexutil.Uint64, error) {
tx, err := t.resolve(ctx)
if err != nil || tx == nil {
return 0, err
}
return hexutil.Uint64(tx.Gas()), nil
}
func (t *Transaction) GasPrice(ctx context.Context) (hexutil.Big, error) {
tx, err := t.resolve(ctx)
if err != nil || tx == nil {
return hexutil.Big{}, err
}
return hexutil.Big(*tx.GasPrice()), nil
}
func (t *Transaction) Value(ctx context.Context) (hexutil.Big, error) {
tx, err := t.resolve(ctx)
if err != nil || tx == nil {
return hexutil.Big{}, err
}
return hexutil.Big(*tx.Value()), nil
}
func (t *Transaction) Nonce(ctx context.Context) (hexutil.Uint64, error) {
tx, err := t.resolve(ctx)
if err != nil || tx == nil {
return 0, err
}
return hexutil.Uint64(tx.Nonce()), nil
}
func (t *Transaction) To(ctx context.Context, args BlockNumberArgs) (*Account, error) {
tx, err := t.resolve(ctx)
if err != nil || tx == nil {
return nil, err
}
to := tx.To()
if to == nil {
return nil, nil
}
return &Account{
backend: t.backend,
address: *to,
blockNrOrHash: args.NumberOrLatest(),
}, nil
}
func (t *Transaction) From(ctx context.Context, args BlockNumberArgs) (*Account, error) {
tx, err := t.resolve(ctx)
if err != nil || tx == nil {
return nil, err
}
signer := types.LatestSigner(t.backend.ChainConfig())
from, _ := types.Sender(signer, tx)
return &Account{
backend: t.backend,
address: from,
blockNrOrHash: args.NumberOrLatest(),
}, nil
}
func (t *Transaction) Block(ctx context.Context) (*Block, error) {
if _, err := t.resolve(ctx); err != nil {
return nil, err
}
return t.block, nil
}
func (t *Transaction) Index(ctx context.Context) (*int32, error) {
if _, err := t.resolve(ctx); err != nil {
return nil, err
}
if t.block == nil {
return nil, nil
}
index := int32(t.index)
return &index, nil
}
// (Quorum) receiptGetter allows Transaction to have different behaviours for getting transaction receipts
// (e.g. getting standard receipts or privacy precompile receipts from the db)
type receiptGetter interface {
get(ctx context.Context) (*types.Receipt, error)
}
// (Quorum) transactionReceiptGetter implements receiptGetter and provides the standard behaviour for getting transaction
// receipts from the db
type transactionReceiptGetter struct {
tx *Transaction
}
func (g *transactionReceiptGetter) get(ctx context.Context) (*types.Receipt, error) {
if _, err := g.tx.resolve(ctx); err != nil {
return nil, err
}
if g.tx.block == nil {
return nil, nil
}
receipts, err := g.tx.block.resolveReceipts(ctx)
if err != nil {
return nil, err
}
return receipts[g.tx.index], nil
}
// (Quorum) privateTransactionReceiptGetter implements receiptGetter and gets privacy precompile transaction receipts
// from the the db
type privateTransactionReceiptGetter struct {
pmt *Transaction
}
func (g *privateTransactionReceiptGetter) get(ctx context.Context) (*types.Receipt, error) {
if _, err := g.pmt.resolve(ctx); err != nil {
return nil, err
}
if g.pmt.block == nil {
return nil, nil
}
receipts, err := g.pmt.block.resolveReceipts(ctx)
if err != nil {
return nil, err
}
receipt := receipts[g.pmt.index]
psm, err := g.pmt.backend.PSMR().ResolveForUserContext(ctx)
if err != nil {
return nil, err
}
privateReceipt := receipt.PSReceipts[psm.ID]
if privateReceipt == nil {
return nil, errors.New("could not find receipt for private transaction")
}
return privateReceipt, nil
}
// getReceipt returns the receipt associated with this transaction, if any.
func (t *Transaction) getReceipt(ctx context.Context) (*types.Receipt, error) {
// default to standard receipt getter if one is not set
if t.receiptGetter == nil {
t.receiptGetter = &transactionReceiptGetter{tx: t}
}
return t.receiptGetter.get(ctx)
}
func (t *Transaction) Status(ctx context.Context) (*Long, error) {
receipt, err := t.getReceipt(ctx)
if err != nil || receipt == nil {
return nil, err
}
ret := Long(receipt.Status)
return &ret, nil
}
func (t *Transaction) GasUsed(ctx context.Context) (*Long, error) {
receipt, err := t.getReceipt(ctx)
if err != nil || receipt == nil {
return nil, err
}
ret := Long(receipt.GasUsed)
return &ret, nil
}
func (t *Transaction) CumulativeGasUsed(ctx context.Context) (*Long, error) {
receipt, err := t.getReceipt(ctx)
if err != nil || receipt == nil {
return nil, err
}
ret := Long(receipt.CumulativeGasUsed)
return &ret, nil
}
func (t *Transaction) CreatedContract(ctx context.Context, args BlockNumberArgs) (*Account, error) {
receipt, err := t.getReceipt(ctx)
if err != nil || receipt == nil || receipt.ContractAddress == (common.Address{}) {
return nil, err
}
return &Account{
backend: t.backend,
address: receipt.ContractAddress,
blockNrOrHash: args.NumberOrLatest(),
}, nil
}
func (t *Transaction) Logs(ctx context.Context) (*[]*Log, error) {
receipt, err := t.getReceipt(ctx)
if err != nil || receipt == nil {
return nil, err
}
ret := make([]*Log, 0, len(receipt.Logs))
for _, log := range receipt.Logs {
ret = append(ret, &Log{
backend: t.backend,
transaction: t,
log: log,
})
}
return &ret, nil
}
func (t *Transaction) Type(ctx context.Context) (*int32, error) {
tx, err := t.resolve(ctx)
if err != nil {
return nil, err
}
txType := int32(tx.Type())
return &txType, nil
}
func (t *Transaction) AccessList(ctx context.Context) (*[]*AccessTuple, error) {
tx, err := t.resolve(ctx)
if err != nil || tx == nil {
return nil, err
}
accessList := tx.AccessList()
ret := make([]*AccessTuple, 0, len(accessList))
for _, al := range accessList {
ret = append(ret, &AccessTuple{
address: al.Address,
storageKeys: &al.StorageKeys, // nolint:exportloopref
})
}
return &ret, nil
}
func (t *Transaction) R(ctx context.Context) (hexutil.Big, error) {
tx, err := t.resolve(ctx)
if err != nil || tx == nil {
return hexutil.Big{}, err
}
_, r, _ := tx.RawSignatureValues()
return hexutil.Big(*r), nil
}
func (t *Transaction) S(ctx context.Context) (hexutil.Big, error) {
tx, err := t.resolve(ctx)
if err != nil || tx == nil {
return hexutil.Big{}, err
}
_, _, s := tx.RawSignatureValues()
return hexutil.Big(*s), nil
}
func (t *Transaction) V(ctx context.Context) (hexutil.Big, error) {
tx, err := t.resolve(ctx)
if err != nil || tx == nil {
return hexutil.Big{}, err
}
v, _, _ := tx.RawSignatureValues()
return hexutil.Big(*v), nil
}
type BlockType int
// Block represents an Ethereum block.
// backend, and numberOrHash are mandatory. All other fields are lazily fetched
// when required.
type Block struct {
backend ethapi.Backend
numberOrHash *rpc.BlockNumberOrHash
hash common.Hash
header *types.Header
block *types.Block
receipts []*types.Receipt
}
// resolve returns the internal Block object representing this block, fetching
// it if necessary.
func (b *Block) resolve(ctx context.Context) (*types.Block, error) {
if b.block != nil {
return b.block, nil
}
if b.numberOrHash == nil {
latest := rpc.BlockNumberOrHashWithNumber(rpc.LatestBlockNumber)
b.numberOrHash = &latest
}
var err error
b.block, err = b.backend.BlockByNumberOrHash(ctx, *b.numberOrHash)
if b.block != nil && b.header == nil {
b.header = b.block.Header()
if hash, ok := b.numberOrHash.Hash(); ok {
b.hash = hash
}
}
return b.block, err
}
// resolveHeader returns the internal Header object for this block, fetching it
// if necessary. Call this function instead of `resolve` unless you need the
// additional data (transactions and uncles).
func (b *Block) resolveHeader(ctx context.Context) (*types.Header, error) {
if b.numberOrHash == nil && b.hash == (common.Hash{}) {
return nil, errBlockInvariant
}
var err error
if b.header == nil {
if b.hash != (common.Hash{}) {
b.header, err = b.backend.HeaderByHash(ctx, b.hash)
} else {
b.header, err = b.backend.HeaderByNumberOrHash(ctx, *b.numberOrHash)
}
}
return b.header, err
}
// resolveReceipts returns the list of receipts for this block, fetching them
// if necessary.
func (b *Block) resolveReceipts(ctx context.Context) ([]*types.Receipt, error) {
if b.receipts == nil {
hash := b.hash
if hash == (common.Hash{}) {
header, err := b.resolveHeader(ctx)
if err != nil {
return nil, err
}
hash = header.Hash()
}
receipts, err := b.backend.GetReceipts(ctx, hash)
if err != nil {
return nil, err
}
b.receipts = receipts
}
return b.receipts, nil
}
func (b *Block) Number(ctx context.Context) (Long, error) {
header, err := b.resolveHeader(ctx)
if err != nil {
return 0, err
}
return Long(header.Number.Uint64()), nil
}
func (b *Block) Hash(ctx context.Context) (common.Hash, error) {
if b.hash == (common.Hash{}) {
header, err := b.resolveHeader(ctx)
if err != nil {
return common.Hash{}, err
}
b.hash = header.Hash()
}
return b.hash, nil
}
func (b *Block) GasLimit(ctx context.Context) (Long, error) {
header, err := b.resolveHeader(ctx)
if err != nil {
return 0, err
}
return Long(header.GasLimit), nil
}
func (b *Block) GasUsed(ctx context.Context) (Long, error) {
header, err := b.resolveHeader(ctx)
if err != nil {
return 0, err
}
return Long(header.GasUsed), nil
}
func (b *Block) Parent(ctx context.Context) (*Block, error) {
// If the block header hasn't been fetched, and we'll need it, fetch it.
if b.numberOrHash == nil && b.header == nil {
if _, err := b.resolveHeader(ctx); err != nil {
return nil, err
}
}
if b.header != nil && b.header.Number.Uint64() > 0 {
num := rpc.BlockNumberOrHashWithNumber(rpc.BlockNumber(b.header.Number.Uint64() - 1))
return &Block{
backend: b.backend,
numberOrHash: &num,
hash: b.header.ParentHash,
}, nil
}
return nil, nil
}
func (b *Block) Difficulty(ctx context.Context) (hexutil.Big, error) {
header, err := b.resolveHeader(ctx)
if err != nil {
return hexutil.Big{}, err
}
return hexutil.Big(*header.Difficulty), nil
}
func (b *Block) Timestamp(ctx context.Context) (hexutil.Uint64, error) {
header, err := b.resolveHeader(ctx)
if err != nil {
return 0, err
}
return hexutil.Uint64(header.Time), nil
}
func (b *Block) Nonce(ctx context.Context) (hexutil.Bytes, error) {
header, err := b.resolveHeader(ctx)
if err != nil {
return hexutil.Bytes{}, err
}
return header.Nonce[:], nil
}
func (b *Block) MixHash(ctx context.Context) (common.Hash, error) {
header, err := b.resolveHeader(ctx)
if err != nil {
return common.Hash{}, err
}
return header.MixDigest, nil
}
func (b *Block) TransactionsRoot(ctx context.Context) (common.Hash, error) {
header, err := b.resolveHeader(ctx)
if err != nil {
return common.Hash{}, err
}
return header.TxHash, nil
}
func (b *Block) StateRoot(ctx context.Context) (common.Hash, error) {
header, err := b.resolveHeader(ctx)
if err != nil {
return common.Hash{}, err
}
return header.Root, nil
}
func (b *Block) ReceiptsRoot(ctx context.Context) (common.Hash, error) {
header, err := b.resolveHeader(ctx)
if err != nil {
return common.Hash{}, err
}
return header.ReceiptHash, nil
}
func (b *Block) OmmerHash(ctx context.Context) (common.Hash, error) {
header, err := b.resolveHeader(ctx)
if err != nil {
return common.Hash{}, err
}
return header.UncleHash, nil
}
func (b *Block) OmmerCount(ctx context.Context) (*int32, error) {
block, err := b.resolve(ctx)
if err != nil || block == nil {
return nil, err
}
count := int32(len(block.Uncles()))
return &count, err
}
func (b *Block) Ommers(ctx context.Context) (*[]*Block, error) {
block, err := b.resolve(ctx)
if err != nil || block == nil {
return nil, err
}
ret := make([]*Block, 0, len(block.Uncles()))
for _, uncle := range block.Uncles() {
blockNumberOrHash := rpc.BlockNumberOrHashWithHash(uncle.Hash(), false)
ret = append(ret, &Block{
backend: b.backend,
numberOrHash: &blockNumberOrHash,
header: uncle,
})
}
return &ret, nil
}
func (b *Block) ExtraData(ctx context.Context) (hexutil.Bytes, error) {
header, err := b.resolveHeader(ctx)
if err != nil {
return hexutil.Bytes{}, err
}
return header.Extra, nil
}
func (b *Block) LogsBloom(ctx context.Context) (hexutil.Bytes, error) {
header, err := b.resolveHeader(ctx)
if err != nil {
return hexutil.Bytes{}, err
}
return header.Bloom.Bytes(), nil
}
func (b *Block) TotalDifficulty(ctx context.Context) (hexutil.Big, error) {
h := b.hash
if h == (common.Hash{}) {
header, err := b.resolveHeader(ctx)
if err != nil {
return hexutil.Big{}, err
}
h = header.Hash()
}
return hexutil.Big(*b.backend.GetTd(ctx, h)), nil
}
// BlockNumberArgs encapsulates arguments to accessors that specify a block number.
type BlockNumberArgs struct {
// TODO: Ideally we could use input unions to allow the query to specify the
// block parameter by hash, block number, or tag but input unions aren't part of the
// standard GraphQL schema SDL yet, see: path_to_url
Block *hexutil.Uint64
}
// NumberOr returns the provided block number argument, or the "current" block number or hash if none
// was provided.
func (a BlockNumberArgs) NumberOr(current rpc.BlockNumberOrHash) rpc.BlockNumberOrHash {
if a.Block != nil {
blockNr := rpc.BlockNumber(*a.Block)
return rpc.BlockNumberOrHashWithNumber(blockNr)
}
return current
}
// NumberOrLatest returns the provided block number argument, or the "latest" block number if none
// was provided.
func (a BlockNumberArgs) NumberOrLatest() rpc.BlockNumberOrHash {
return a.NumberOr(rpc.BlockNumberOrHashWithNumber(rpc.LatestBlockNumber))
}
func (b *Block) Miner(ctx context.Context, args BlockNumberArgs) (*Account, error) {
header, err := b.resolveHeader(ctx)
if err != nil {
return nil, err
}
return &Account{
backend: b.backend,
address: header.Coinbase,
blockNrOrHash: args.NumberOrLatest(),
}, nil
}
func (b *Block) TransactionCount(ctx context.Context) (*int32, error) {
block, err := b.resolve(ctx)
if err != nil || block == nil {
return nil, err
}
count := int32(len(block.Transactions()))
return &count, err
}
func (b *Block) Transactions(ctx context.Context) (*[]*Transaction, error) {
block, err := b.resolve(ctx)
if err != nil || block == nil {
return nil, err
}
ret := make([]*Transaction, 0, len(block.Transactions()))
for i, tx := range block.Transactions() {
ret = append(ret, &Transaction{
backend: b.backend,
hash: tx.Hash(),
tx: tx,
block: b,
index: uint64(i),
})
}
return &ret, nil
}
func (b *Block) TransactionAt(ctx context.Context, args struct{ Index int32 }) (*Transaction, error) {
block, err := b.resolve(ctx)
if err != nil || block == nil {
return nil, err
}
txs := block.Transactions()
if args.Index < 0 || int(args.Index) >= len(txs) {
return nil, nil
}
tx := txs[args.Index]
return &Transaction{
backend: b.backend,
hash: tx.Hash(),
tx: tx,
block: b,
index: uint64(args.Index),
}, nil
}
func (b *Block) OmmerAt(ctx context.Context, args struct{ Index int32 }) (*Block, error) {
block, err := b.resolve(ctx)
if err != nil || block == nil {
return nil, err
}
uncles := block.Uncles()
if args.Index < 0 || int(args.Index) >= len(uncles) {
return nil, nil
}
uncle := uncles[args.Index]
blockNumberOrHash := rpc.BlockNumberOrHashWithHash(uncle.Hash(), false)
return &Block{
backend: b.backend,
numberOrHash: &blockNumberOrHash,
header: uncle,
}, nil
}
// BlockFilterCriteria encapsulates criteria passed to a `logs` accessor inside
// a block.
type BlockFilterCriteria struct {
Addresses *[]common.Address // restricts matches to events created by specific contracts
// The Topic list restricts matches to particular event topics. Each event has a list
// of topics. Topics matches a prefix of that list. An empty element slice matches any
// topic. Non-empty elements represent an alternative that matches any of the
// contained topics.
//
// Examples:
// {} or nil matches any topic list
// {{A}} matches topic A in first position
// {{}, {B}} matches any topic in first position, B in second position
// {{A}, {B}} matches topic A in first position, B in second position
// {{A, B}}, {C, D}} matches topic (A OR B) in first position, (C OR D) in second position
Topics *[][]common.Hash
}
// runFilter accepts a filter and executes it, returning all its results as
// `Log` objects.
func runFilter(ctx context.Context, be ethapi.Backend, filter *filters.Filter) ([]*Log, error) {
logs, err := filter.Logs(ctx)
if err != nil || logs == nil {
return nil, err
}
ret := make([]*Log, 0, len(logs))
for _, log := range logs {
ret = append(ret, &Log{
backend: be,
transaction: &Transaction{backend: be, hash: log.TxHash},
log: log,
})
}
return ret, nil
}
func (b *Block) Logs(ctx context.Context, args struct{ Filter BlockFilterCriteria }) ([]*Log, error) {
var addresses []common.Address
if args.Filter.Addresses != nil {
addresses = *args.Filter.Addresses
}
var topics [][]common.Hash
if args.Filter.Topics != nil {
topics = *args.Filter.Topics
}
hash := b.hash
if hash == (common.Hash{}) {
header, err := b.resolveHeader(ctx)
if err != nil {
return nil, err
}
hash = header.Hash()
}
// Construct the range filter
psm, err := b.backend.PSMR().ResolveForUserContext(ctx)
if err != nil {
return nil, err
}
filter := filters.NewBlockFilter(b.backend, hash, addresses, topics, psm.ID)
// Run the filter and return all the logs
return runFilter(ctx, b.backend, filter)
}
func (b *Block) Account(ctx context.Context, args struct {
Address common.Address
}) (*Account, error) {
if b.numberOrHash == nil {
_, err := b.resolveHeader(ctx)
if err != nil {
return nil, err
}
}
return &Account{
backend: b.backend,
address: args.Address,
blockNrOrHash: *b.numberOrHash,
}, nil
}
// CallData encapsulates arguments to `call` or `estimateGas`.
// All arguments are optional.
type CallData struct {
From *common.Address // The Ethereum address the call is from.
To *common.Address // The Ethereum address the call is to.
Gas *hexutil.Uint64 // The amount of gas provided for the call.
GasPrice *hexutil.Big // The price of each unit of gas, in wei.
Value *hexutil.Big // The value sent along with the call.
Data *hexutil.Bytes // Any data sent with the call.
}
// CallResult encapsulates the result of an invocation of the `call` accessor.
type CallResult struct {
data hexutil.Bytes // The return data from the call
gasUsed Long // The amount of gas used
status Long // The return status of the call - 0 for failure or 1 for success.
}
func (c *CallResult) Data() hexutil.Bytes {
return c.data
}
func (c *CallResult) GasUsed() Long {
return c.gasUsed
}
func (c *CallResult) Status() Long {
return c.status
}
func (b *Block) Call(ctx context.Context, args struct {
Data ethapi.CallArgs
}) (*CallResult, error) {
if b.numberOrHash == nil {
_, err := b.resolve(ctx)
if err != nil {
return nil, err
}
}
// Quorum - replaced the default 5s time out with the value passed in vm.calltimeout
result, err := ethapi.DoCall(ctx, b.backend, args.Data, *b.numberOrHash, nil, vm.Config{}, b.backend.CallTimeOut(), b.backend.RPCGasCap())
if err != nil {
return nil, err
}
status := Long(1)
if result.Failed() {
status = 0
}
return &CallResult{
data: result.ReturnData,
gasUsed: Long(result.UsedGas),
status: status,
}, nil
}
func (b *Block) EstimateGas(ctx context.Context, args struct {
Data ethapi.CallArgs
}) (Long, error) {
if b.numberOrHash == nil {
_, err := b.resolveHeader(ctx)
if err != nil {
return 0, err
}
}
gas, err := ethapi.DoEstimateGas(ctx, b.backend, args.Data, *b.numberOrHash, b.backend.RPCGasCap())
return Long(gas), err
}
type Pending struct {
backend ethapi.Backend
}
func (p *Pending) TransactionCount(ctx context.Context) (int32, error) {
txs, err := p.backend.GetPoolTransactions()
return int32(len(txs)), err
}
func (p *Pending) Transactions(ctx context.Context) (*[]*Transaction, error) {
txs, err := p.backend.GetPoolTransactions()
if err != nil {
return nil, err
}
ret := make([]*Transaction, 0, len(txs))
for i, tx := range txs {
ret = append(ret, &Transaction{
backend: p.backend,
hash: tx.Hash(),
tx: tx,
index: uint64(i),
})
}
return &ret, nil
}
func (p *Pending) Account(ctx context.Context, args struct {
Address common.Address
}) *Account {
pendingBlockNr := rpc.BlockNumberOrHashWithNumber(rpc.PendingBlockNumber)
return &Account{
backend: p.backend,
address: args.Address,
blockNrOrHash: pendingBlockNr,
}
}
func (p *Pending) Call(ctx context.Context, args struct {
Data ethapi.CallArgs
}) (*CallResult, error) {
pendingBlockNr := rpc.BlockNumberOrHashWithNumber(rpc.PendingBlockNumber)
// Quorum - replaced the default 5s time out with the value passed in vm.calltimeout
result, err := ethapi.DoCall(ctx, p.backend, args.Data, pendingBlockNr, nil, vm.Config{}, p.backend.CallTimeOut(), p.backend.RPCGasCap())
if err != nil {
return nil, err
}
status := Long(1)
if result.Failed() {
status = 0
}
return &CallResult{
data: result.ReturnData,
gasUsed: Long(result.UsedGas),
status: status,
}, nil
}
func (p *Pending) EstimateGas(ctx context.Context, args struct {
Data ethapi.CallArgs
}) (Long, error) {
pendingBlockNr := rpc.BlockNumberOrHashWithNumber(rpc.PendingBlockNumber)
gas, err := ethapi.DoEstimateGas(ctx, p.backend, args.Data, pendingBlockNr, p.backend.RPCGasCap())
return Long(gas), err
}
// Resolver is the top-level object in the GraphQL hierarchy.
type Resolver struct {
backend ethapi.Backend
}
func (r *Resolver) Block(ctx context.Context, args struct {
Number *Long
Hash *common.Hash
}) (*Block, error) {
var block *Block
if args.Number != nil {
if *args.Number < 0 {
return nil, nil
}
number := rpc.BlockNumber(*args.Number)
numberOrHash := rpc.BlockNumberOrHashWithNumber(number)
block = &Block{
backend: r.backend,
numberOrHash: &numberOrHash,
}
} else if args.Hash != nil {
numberOrHash := rpc.BlockNumberOrHashWithHash(*args.Hash, false)
block = &Block{
backend: r.backend,
numberOrHash: &numberOrHash,
}
} else {
numberOrHash := rpc.BlockNumberOrHashWithNumber(rpc.LatestBlockNumber)
block = &Block{
backend: r.backend,
numberOrHash: &numberOrHash,
}
}
// Resolve the header, return nil if it doesn't exist.
// Note we don't resolve block directly here since it will require an
// additional network request for light client.
h, err := block.resolveHeader(ctx)
if err != nil {
return nil, err
} else if h == nil {
return nil, nil
}
return block, nil
}
func (r *Resolver) Blocks(ctx context.Context, args struct {
From *Long
To *Long
}) ([]*Block, error) {
from := rpc.BlockNumber(*args.From)
var to rpc.BlockNumber
if args.To != nil {
to = rpc.BlockNumber(*args.To)
} else {
to = rpc.BlockNumber(r.backend.CurrentBlock().Number().Int64())
}
if to < from {
return []*Block{}, nil
}
ret := make([]*Block, 0, to-from+1)
for i := from; i <= to; i++ {
numberOrHash := rpc.BlockNumberOrHashWithNumber(i)
ret = append(ret, &Block{
backend: r.backend,
numberOrHash: &numberOrHash,
})
}
return ret, nil
}
func (r *Resolver) Pending(ctx context.Context) *Pending {
return &Pending{r.backend}
}
func (r *Resolver) Transaction(ctx context.Context, args struct{ Hash common.Hash }) (*Transaction, error) {
tx := &Transaction{
backend: r.backend,
hash: args.Hash,
}
// Resolve the transaction; if it doesn't exist, return nil.
t, err := tx.resolve(ctx)
if err != nil {
return nil, err
} else if t == nil {
return nil, nil
}
return tx, nil
}
func (r *Resolver) SendRawTransaction(ctx context.Context, args struct{ Data hexutil.Bytes }) (common.Hash, error) {
tx := new(types.Transaction)
if err := tx.UnmarshalBinary(args.Data); err != nil {
return common.Hash{}, err
}
hash, err := ethapi.SubmitTransaction(ctx, r.backend, tx, "", true)
return hash, err
}
// FilterCriteria encapsulates the arguments to `logs` on the root resolver object.
type FilterCriteria struct {
FromBlock *hexutil.Uint64 // beginning of the queried range, nil means genesis block
ToBlock *hexutil.Uint64 // end of the range, nil means latest block
Addresses *[]common.Address // restricts matches to events created by specific contracts
// The Topic list restricts matches to particular event topics. Each event has a list
// of topics. Topics matches a prefix of that list. An empty element slice matches any
// topic. Non-empty elements represent an alternative that matches any of the
// contained topics.
//
// Examples:
// {} or nil matches any topic list
// {{A}} matches topic A in first position
// {{}, {B}} matches any topic in first position, B in second position
// {{A}, {B}} matches topic A in first position, B in second position
// {{A, B}}, {C, D}} matches topic (A OR B) in first position, (C OR D) in second position
Topics *[][]common.Hash
}
func (r *Resolver) Logs(ctx context.Context, args struct{ Filter FilterCriteria }) ([]*Log, error) {
// Convert the RPC block numbers into internal representations
begin := rpc.LatestBlockNumber.Int64()
if args.Filter.FromBlock != nil {
begin = int64(*args.Filter.FromBlock)
}
end := rpc.LatestBlockNumber.Int64()
if args.Filter.ToBlock != nil {
end = int64(*args.Filter.ToBlock)
}
var addresses []common.Address
if args.Filter.Addresses != nil {
addresses = *args.Filter.Addresses
}
var topics [][]common.Hash
if args.Filter.Topics != nil {
topics = *args.Filter.Topics
}
// Construct the range filter
psm, err := r.backend.PSMR().ResolveForUserContext(ctx)
if err != nil {
return nil, err
}
filter := filters.NewRangeFilter(filters.Backend(r.backend), begin, end, addresses, topics, psm.ID)
return runFilter(ctx, r.backend, filter)
}
func (r *Resolver) GasPrice(ctx context.Context) (hexutil.Big, error) {
price, err := r.backend.SuggestPrice(ctx)
return hexutil.Big(*price), err
}
func (r *Resolver) ChainID(ctx context.Context) (hexutil.Big, error) {
return hexutil.Big(*r.backend.ChainConfig().ChainID), nil
}
// SyncState represents the synchronisation status returned from the `syncing` accessor.
type SyncState struct {
progress ethereum.SyncProgress
}
func (s *SyncState) StartingBlock() hexutil.Uint64 {
return hexutil.Uint64(s.progress.StartingBlock)
}
func (s *SyncState) CurrentBlock() hexutil.Uint64 {
return hexutil.Uint64(s.progress.CurrentBlock)
}
func (s *SyncState) HighestBlock() hexutil.Uint64 {
return hexutil.Uint64(s.progress.HighestBlock)
}
func (s *SyncState) PulledStates() *hexutil.Uint64 {
ret := hexutil.Uint64(s.progress.PulledStates)
return &ret
}
func (s *SyncState) KnownStates() *hexutil.Uint64 {
ret := hexutil.Uint64(s.progress.KnownStates)
return &ret
}
// Syncing returns false in case the node is currently not syncing with the network. It can be up to date or has not
// yet received the latest block headers from its pears. In case it is synchronizing:
// - startingBlock: block number this node started to synchronise from
// - currentBlock: block number this node is currently importing
// - highestBlock: block number of the highest block header this node has received from peers
// - pulledStates: number of state entries processed until now
// - knownStates: number of known state entries that still need to be pulled
func (r *Resolver) Syncing() (*SyncState, error) {
progress := r.backend.Downloader().Progress()
// Return not syncing if the synchronisation already completed
if progress.CurrentBlock >= progress.HighestBlock {
return nil, nil
}
// Otherwise gather the block sync stats
return &SyncState{progress}, nil
}
// Quorum
// PrivateTransaction returns the internal private transaction for privacy marker transactions
func (t *Transaction) PrivateTransaction(ctx context.Context) (*Transaction, error) {
tx, err := t.resolve(ctx)
if err != nil || tx == nil {
return nil, err
}
if !tx.IsPrivacyMarker() {
// tx will not have a private tx so return early - no error to keep in line with other graphql behaviour (see PrivateInputData)
return nil, nil
}
pvtTx, _, _, err := private.FetchPrivateTransaction(tx.Data())
if err != nil {
return nil, err
}
if pvtTx == nil {
return nil, nil
}
return &Transaction{
backend: t.backend,
hash: t.hash,
tx: pvtTx,
block: t.block,
index: t.index,
receiptGetter: &privateTransactionReceiptGetter{pmt: t},
}, nil
}
func (t *Transaction) IsPrivate(ctx context.Context) (*bool, error) {
ret := false
tx, err := t.resolve(ctx)
if err != nil || tx == nil {
return &ret, err
}
ret = tx.IsPrivate()
return &ret, nil
}
func (t *Transaction) PrivateInputData(ctx context.Context) (*hexutil.Bytes, error) {
tx, err := t.resolve(ctx)
if err != nil || tx == nil {
return &hexutil.Bytes{}, err
}
if tx.IsPrivate() {
psm, err := t.backend.PSMR().ResolveForUserContext(ctx)
if err != nil {
return &hexutil.Bytes{}, err
}
_, managedParties, privateInputData, _, err := private.P.Receive(common.BytesToEncryptedPayloadHash(tx.Data()))
if err != nil || tx == nil {
return &hexutil.Bytes{}, err
}
if t.backend.PSMR().NotIncludeAny(psm, managedParties...) {
return &hexutil.Bytes{}, nil
}
ret := hexutil.Bytes(privateInputData)
return &ret, nil
}
return &hexutil.Bytes{}, nil
}
```
|
```php
<?php
/*
*
* File ini bagian dari:
*
* OpenSID
*
* Sistem informasi desa sumber terbuka untuk memajukan desa
*
* Aplikasi dan source code ini dirilis berdasarkan lisensi GPL V3
*
* Hak Cipta 2009 - 2015 Combine Resource Institution (path_to_url
* Hak Cipta 2016 - 2024 Perkumpulan Desa Digital Terbuka (path_to_url
*
* Dengan ini diberikan izin, secara gratis, kepada siapa pun yang mendapatkan salinan
* dari perangkat lunak ini dan file dokumentasi terkait ("Aplikasi Ini"), untuk diperlakukan
* tanpa batasan, termasuk hak untuk menggunakan, menyalin, mengubah dan/atau mendistribusikan,
* asal tunduk pada syarat berikut:
*
* Pemberitahuan hak cipta di atas dan pemberitahuan izin ini harus disertakan dalam
* setiap salinan atau bagian penting Aplikasi Ini. Barang siapa yang menghapus atau menghilangkan
* pemberitahuan ini melanggar ketentuan lisensi Aplikasi Ini.
*
* PERANGKAT LUNAK INI DISEDIAKAN "SEBAGAIMANA ADANYA", TANPA JAMINAN APA PUN, BAIK TERSURAT MAUPUN
* TERSIRAT. PENULIS ATAU PEMEGANG HAK CIPTA SAMA SEKALI TIDAK BERTANGGUNG JAWAB ATAS KLAIM, KERUSAKAN ATAU
* KEWAJIBAN APAPUN ATAS PENGGUNAAN ATAU LAINNYA TERKAIT APLIKASI INI.
*
* @package OpenSID
* @author Tim Pengembang OpenDesa
* @copyright Hak Cipta 2009 - 2015 Combine Resource Institution (path_to_url
* @copyright Hak Cipta 2016 - 2024 Perkumpulan Desa Digital Terbuka (path_to_url
* @license path_to_url GPL V3
* @link path_to_url
*
*/
interface Password_reset_interface
{
/**
* Create a new token.
*
* @param mixed $user
*
* @return string
*/
public function create($user);
/**
* Create a new token for the user.
*
* @return string
*/
public function createNewToken();
/**
* Determine if a token record exists and is valid.
*
* @param mixed $user
* @param string $token
*
* @return bool
*/
public function exists($user, $token);
/**
* Determine if the given user recently created a password reset token.
*
* @param mixed $user
*
* @return bool
*/
public function recentlyCreatedToken($user);
/**
* Destroy a token record.
*
* @param mixed $user
*
* @return void
*/
public function destroy($user);
/**
* Delete expired tokens.
*
* @return void
*/
public function destroyExpired();
}
```
|
Molesworth is a surname, and may refer to:
Caroline Molesworth (1794-1872), British botanist and meteorologist
Carlton Molesworth (1876-1961), baseball player
George Molesworth (1890–1968), English army officer
Guilford Lindsey Molesworth (1828-1925), English civil engineer
Hender Molesworth, 1st Baronet (1638–1639), Governor of Jamaica
James Thomas Molesworth (1795–1871), English military officer and lexicographer, nephew of 6th Viscount Molesworth
Keith Molesworth (1905-1966), American football player
Mary Louisa Molesworth (1839–1921), English children’s writer
Maud Margaret 'Mall' Molesworth (1894–1985) (née Mutch), Australian tennis player
Nigel Molesworth, schoolboy protagonist of the Molesworth series of books written by Geoffrey Willans, with cartoons by Ronald Searle
Percy B. Molesworth (1867–1908), British military officer and amateur astronomer
Richard Molesworth, 3rd Viscount Molesworth, PC (1680–1758), British military officer
Robert Molesworth (disambiguation), several people
Thomas C. Molesworth (1890-1977), American furniture designer
Voltaire Molesworth (1890–1934), Australian politician
William Molesworth (disambiguation), several people
See also
Molesworth (disambiguation)
Viscount Molesworth, Irish title
Molesworth-St Aubyn baronets, British title
Molesworth of Tetcott, an English family, of Tetcott, Devon
|
An infection rate (or incident rate) is the probability or risk of an infection in a population. It is used to measure the frequency of occurrence of new instances of infection within a population during a specific time period.
The number of infections equals the cases identified in the study or observed. An example would be HIV infection during a specific time period in the defined population. The population at risk are the cases appearing in the population during the same time period. An example would be all the people in a city during a specific time period. The constant, or K is assigned a value of 100 to represent a percentage. An example would be to find the percentage of people in a city who are infected with HIV: 6,000 cases in March divided by the population of a city (one million) multiplied by the constant (K) would give an infection rate of 0.6%.
Calculating the infection rate is used to analyze trends for the purpose of infection and disease control. An online infection rate calculator has been developed by the Centers for Disease Control and Prevention that allows the determination of the Streptococcal A infection rate in a population.
Clinical applications
Health care facilities routinely track their infection rates according to the guidelines issued by the Joint Commission. The healthcare-associated infection (HAI) rates measure infection of patients in a particular hospital. This allows rates to compared with other hospitals. These infections can often be prevented when healthcare facilities follow guidelines for safe care. To get payment from Medicare, hospitals are required to report data about some infections to the Centers for Disease Control and Prevention's (CDC's) National Healthcare Safety Network (NHSN). Hospitals currently submit information on central line-associated bloodstream infections (CLABSIs), catheter-associated urinary tract infections (CAUTIs), surgical site infections (SSIs), MRSA Bacteremia, and C. difficile laboratory-identified events. The public reporting of these data is an effort by the Department of Health and Human Services.
For meaningful comparisons of infection rates, populations must be very similar between the two or more assessments. However, a problem with mean rates is that they cannot reflect differences in risk between populations,
References
External links
The Society for Healthcare Epidemiology of America epidemiologists or physicians in infection control.
Association for Professionals in Infection Control and Epidemiology infection prevention and control professionals.
The Certification Board of Infection Control and Epidemiology, Inc.
Epidemiology
Medical hygiene
Infectious diseases
|
George William (), also known as George IV William (; 29 September 1660 – 21 November 1675) was the last Silesian duke of Legnica (Liegnitz) and Brzeg (Brieg) from 1672 until his death. He was the last male member of the Silesian Piast dynasty descending from Władysław II the Exile (1105–1159), as well as the last legitimate male member of the entire House of Piast.
Family
George William was the eldest but only surviving son of Duke Christian of Legnica-Brzeg (1618–1672) by his wife Louise (1631–1680), a daughter of the Ascanian prince John Casimir of Anhalt-Dessau. He had three siblings:
Karolina of Legnica-Brieg (1652–1707), last Silesian Piast duchess, married to Frederick, Duke of Schleswig-Holstein-Sonderburg-Wiesenburg (1651–1724) in 1672;
Louise (1657–1660);
Christian Louis (1664).
As the only surviving son, George William was the sole heir to his father's possessions. Duke Christian of Legnica-Brzeg had spent many years in exile in Poland and in the Duchy of Prussia during the Thirty Years' War, after George William's grandfather Duke John Christian of Brieg had fallen out of favour with the Habsburg emperor Ferdinand II.
Duke Christian became sole ruler over the Silesian duchies of Legnica and Brzeg in 1664. After the abdication of King John II Casimir Vasa of Poland in 1668, he even put forward his candidacy for the Polish throne; to win the affection and support of the old nobility, he initially wanted to give his newborn son an old Piast name (like Mieszko or Bolesław); however, the Calvinist clergy of his duchy opposed this, maintaining that the idea could bring the return to paganism over Poland. The duke, however, saw to it that his son spoke Polish and wore Polish clothes.
Life
The deaths in 1663 and 1664 of his paternal uncles Duke George III of Brzeg and Duke Louis IV of Legnica without surviving issue left him as the only heir of his father in the still vast Duchy of Legnica-Brzeg. As a result, since his early years, George William received a careful education. During his upbringing, he was put in the hands of the Anhalt-Bernburg count-marshal August Friedrich Bohne, and the personal doctor Henry Martini. During this first period of his education, he acquired an excellent knowledge of German, French and Latin, also understood Italian, Spanish and Polish; he was also educated in theology, philosophy, and rhetoric.
After his father's death in 1672, the then twelve-year-old George William succeeded him as Duke of Legnica and Brzeg; during his minority, the regency was exercised by his mother, Dowager Duchess Louise who held the towns of Wołów and Oława as her dower (wittum). Fearing claims raised by the Habsburg Emperor Leopold I in his capacity as ruler over the Crown of Bohemia, Duke Christian had devised by will that his son was formally under the tutelage of his maternal uncle Prince John George II of Anhalt-Dessau and the mighty Hohenzollern elector Frederick William of Brandenburg. The day before his father's death, Louise sent her son to study at the Viadrina University in Brandenburgian Frankfurt/Oder, considered as an act of mistrust by the Imperial court. On the other hand, the regency of the dowager duchess faced the opposition of the Protestant estates of Legnica-Brzeg, thanks to her increasingly open support for the Catholic faith; a major scandal occurred when the young duke's sister Karolina secretly married Frederick, a member of the aristocrat Catholic family of Schleswig-Holstein-Sonderburg-Wiesenburg.
The Brandenburg elector reached an understanding with the Habsburg emperor, and in 1673 George William returned to Brzeg, where he received the homage by the estates. On 14 March 1675, the young duke could take formal possession of the government of his lands after he went to the Imperial court in Vienna, making his solemn homage to Emperor Leopold I, who confirmed his coming of age and the succession to his father's lands. Immediately after the beginning of George William's rule, Duchess Louise was forced to give up her area of Wołów.
The announcements of the start of a good and prosperous government by George William were stopped with the sudden death of the duke on 21 November 1675. The cause of his death was an intense fever, developed shortly after his return from a hunt, the first sign of smallpox. The duke was buried in the church of St. John in Legnica, alongside his father, where his grieved mother had a mausoleum built.
Legacy
Upon his death, the Duchy of Legnica-Brzeg reverted to Emperor Leopold as ruler over the Bohemian crown lands, which since 1526 were integral part of the Austrian Habsburg monarchy. Leopold took up the government by a Landeshauptmann deputy, despite the claims of George William's morganatic uncle Count August of Legnica, and had several Counter-Reformation measures implemented. Duchess Louise retained her lands of Oława until her death in 1680, when they were also incorporated into the Bohemian lands.
The independent Masovian Piasts had died out in 1526, while the Teschen (Cieszyn) line had become extinct in 1653. George William was therefore the last ruling member of all the Piast dynasty, which finally became extinct with the death of his only surviving sibling, Karolina, in 1707. The term "Piast dynasty" was first used by the Polish historian Adam Naruszewicz in his books History of Poland, which he started in 1779. On George William's burial crypt a text was carved referring to him as the last of the Piast dukes of Silesia, who are since the 17th century referred to as "Silesian Piasts".
Ancestry
Patrilineal descent, descent from father to son, is the principle behind membership in royal houses, as it can be traced back through the generations.
George William, Duke of Liegnitz was the last legitimate male of the Piast dynasty. Descent before Mieszko I is partly fictional. This is the descent of the primary male heir.
Chościsko
Piast the Wheelwright
Siemowit
Lestko, b. 870–880
Siemomysł, d. 950–960
Mieszko I of Poland, 920/45-992
Bolesław I Chrobry, 967–1025
Mieszko II Lambert, 990–1034
Casimir I the Restorer, 1016–1058
Władysław I Herman, 1044–1102
Bolesław III Wrymouth, 1086–1138
Władysław II the Exile, 1105–1159
Bolesław I the Tall, 1127–1201
Henry I the Bearded, 1165/70–1238
Henry II the Pious, 1196–1241
Bolesław II the Bald, 1220/5-1278
Henry V the Fat, 1248–1296
Bolesław III the Generous, 1291–1352
Ludwik I the Fair, 1321–1398
Henry VII of Brzeg, 1343/45-1399
Henryk IX of Lubin, 1369–1420
Ludwik III of Oława, 1405–1441
John I of Lüben, 1425–1453
Frederick I of Legnica, 1446–1488
Frederick II of Legnica, 1480–1547
George II of Brieg, 1523–1586
Joachim Frederick of Brieg, 1550–1602
John Christian of Brieg, 1591–1639
Christian, Duke of Brieg, 1618–1672
George William, Duke of Liegnitz, 1660–1675
References
External links
Genealogical database by Herbert Stoyan
1660 births
1675 deaths
People from Oława
17th-century Polish people
Dukes of Legnica
|
London, Midland and Scottish Railway (LMS) Stanier Class 5 4-6-0 No. 5110 (British Railways No. 45110) is a preserved British steam locomotive. It has carried the name RAF Biggin Hill in preservation, though it never carried this in service. Number 5110 was built in 1935 by the Vulcan Foundry. It was built with a low-degree superheat domeless boiler and still carries a domeless boiler.
Fifteen Guinea Special
The locomotive was one of three members of the class to haul the Fifteen Guinea Special, British Rail's last steam-hauled passenger train, on 11 August 1968. It took the first leg from Liverpool Lime Street to Manchester Victoria at the beginning of the tour before running from Manchester Victoria to Liverpool Lime Street with the returning train at the end of the day's tour. This locomotive was used in place of sister engine 45305, which had been selected for this duty, but had been failed with a collapsed firebox brick arch the night before the run, and had been withdrawn prematurely as a result.
Use in preservation
After hauling the Fifteen Guinea Special, 45110 was purchased straight from service for preservation by David Porter of the "Flairavia Flying Club" at Biggin Hill Airport. It moved temporarily to the former Ashford shed where it was named RAF Biggin Hall, and then to the Severn Valley Railway (SVR) in 1970; it was subsequently bought by the SVR in 1974, and has since been based at the line's locomotive depots at Bridgnorth and Bewdley.
Between 1994 and 1998, when the engine itself was undergoing a major overhaul at Bridgnorth, 45110's tender was used behind LMS Stanier Mogul 42968 (then in LMS livery as 2968), whilst its own Fowler tender had a twisted frame problem ironed out.
Following a return to service on 11 August 1998, the engine was main line registered, and did haul several main line steam specials on the national rail network, but after failing twice on a railtour to Stranraer in May 2000, the engine was confined to heritage rail operation only. It was hoped to have run 45110 on the 2008 recreation of the Fifteen Guinea Special, but this was not possible as the engine was due to come out of ticket on 11 August, the same day as the Fifteen Guinea Special re-run, and so a competition was offered by Steam Railway magazine to drive the engine on 11 August. Despite this, the engine was given an extension to its 10-year boiler ticket up to the end of August, at the end of which, the loco was withdrawn after 10 years of service.
In 2009–10, 45110 was placed on static display at Barrow Hill Engine Shed to take advantage of the available under cover storage. It was planned that the locomotive would remain at Barrow Hill for up to two years on loan from the Severn Valley Railway, which would see its return to the SVR in 2011–12, but in 2010 the engine's tender was recalled back to the SVR to be used once again behind 42968, after the 2-6-0's own tender developed wheelflats. 45110's tender remained in use behind 42968 until early 2012, when 42968 regained its own tender for the last year of its own 10 year boiler ticket, which expired in January 2013.
45110 returned to Bridgnorth on 30 September 2013, entering The Engine House at Highley on 6 October 2013 in place of 4930 Hagley Hall, which had just been moved to Bridgnorth for the start of a major overhaul. 45110 briefly left the Engine House in order to appear as a static exhibit at Kidderminster in August 2018 in an event marking 50 years since the end of BR steam, returning to the Engine House in September 2018. In March 2019 the locomotive was moved into store at Kidderminster.
In August 2023 it was announced that the locomotive had been sold, and had left the SVR.
References
External links
Railuk database
Preserved locomotive database
45110
Preserved London, Midland and Scottish Railway steam locomotives
Individual locomotives of Great Britain
Railway locomotives introduced in 1935
Standard gauge steam locomotives of Great Britain
4-6-0 locomotives
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.