text
stringlengths 1
22.8M
|
|---|
The Salzburg Festival () is a prominent festival of music and drama established in 1920. It is held each summer, for five weeks starting in late July, in Salzburg, Austria, the birthplace of Wolfgang Amadeus Mozart. Mozart's operas are a focus of the festival; one highlight is the annual performance of Hofmannsthal's play Jedermann (Everyman).
Since 1967, an annual Salzburg Easter Festival has also been held, organized by a separate organization.
History
Music festivals were held in Salzburg at irregular intervals since 1877 by the International Mozarteum Foundation but were discontinued in 1910. A festival was planned for 1914, but it was cancelled at the outbreak of World War I. In 1917, Friedrich Gehmacher and Heinrich Damisch formed an organization known as the Salzburger Festspielhaus-Gemeinde to establish an annual festival of drama and music, emphasizing especially the works of Mozart. At the close of the war in 1918, the festival's revival was championed by five men now regarded as its founders: the poet and dramatist Hugo von Hofmannsthal, the composer Richard Strauss, the scenic designer Alfred Roller, the conductor Franz Schalk, and the director Max Reinhardt, then intendant of the Deutsches Theater in Berlin, who had produced the first performance of Hofmannsthal's play Jedermann at the Berlin Zirkus Schumann arena in 1911.
According to Hofmannsthal's political writings, the Salzburg Festival, as a counterpart to the Prussian-North German uncompromising worldview, should emphasize the centuries-old Habsburg principles of "live and let live" with regard to ethnic groups, peoples, minorities, religions, cultures and languages. The Salzburg Festival was officially inaugurated on 22 August 1920 with Reinhardt's performance of Hofmannsthal's Jedermann on the steps of Salzburg Cathedral, starring Alexander Moissi. The practice has become a tradition, and the play is now always performed at Cathedral Square; since 1921 it has been accompanied by several performances of chamber music and orchestral works. The first operatic production came in 1922, with Mozart's Don Giovanni conducted by Richard Strauss. The singers were mainly drawn from the Wiener Staatsoper, including Richard Tauber in the part of Don Ottavio.
The first festival hall was erected in 1925 at the former Archbishops' horse stables on the northern foot of the Mönchsberg mountain, on the basis of plans by Clemens Holzmeister; it opened with Gozzi's Turandot dramatized by Karl Vollmöller. At that time the festival had already developed a large-scale program including live broadcasts by the Austrian RAVAG radio network. The following year the adjacent former episcopal Felsenreitschule riding academy, carved into the Mönchsberg rock face, was converted into a theater, inaugurated with a performance of The Servant of Two Masters by Carlo Goldoni. In the 21st century, the original festival hall, suitable only for concerts, was reconstructed as a third venue for fully staged opera and concert performances and reopened in 2006 as the Haus für Mozart (House for Mozart).
During the years from 1934 to 1937, famed conductors such as Arturo Toscanini and Bruno Walter conducted many performances. In 1936, the festival featured a performance by the Trapp Family Singers, whose story was later depicted in the musical The Sound of Music (featuring a scene of the Trapp Family singing at the Felsenreitschule, but inaccurately set in 1938). In 1937, Boyd Neel and his orchestra premiered Benjamin Britten's Variations on a Theme of Frank Bridge at the festival.
The festival's popularity suffered a major blow as a consequence of the Anschluss, the annexation of Austria by Nazi Germany in 1938. Toscanini resigned in protest, artists of Jewish descent like Reinhardt and Georg Solti had to emigrate, and Jedermann, last performed by Attila Hörbiger, had to be dropped. Nevertheless, the festival remained in operation until in 1944 it was cancelled by the order of Reich Minister Joseph Goebbels in reaction to the 20 July plot. At the end of World War II, the Salzburg Festival reopened in summer 1945 immediately after the Allied victory in Europe.
Post World War II festivals
The post-war festival slowly regained its prominence as a summer opera festival, especially for works by Mozart, with conductor Herbert von Karajan becoming artistic director in 1956. In 1960 the Great Festival Hall (Großes Festspielhaus) opera house opened its doors. As this summer festival gained fame and stature as a venue for opera, drama, and classical concert presentation, its musical repertoire concentrated on Mozart and Strauss, but other works, such as Verdi's Falstaff and Beethoven's Fidelio, were also performed.
Upon Karajan's death in 1989, the festival was drastically modernized and expanded by director Gerard Mortier, who was succeeded by Peter Ruzicka in 2001.
In the 21st century
In 2006, the festival was led by intendant Jürgen Flimm and concert director Markus Hinterhäuser. That year, Salzburg celebrated the 250th anniversary of Mozart's birth by staging all 22 of his operatic works, including two unfinished operas. All 22 were filmed and released on DVD in November 2006. The 2006 festival also saw the opening of the Haus für Mozart.
In 2010, the opera Dionysos by Wolfgang Rihm who compiled for his own libretto texts from Nietzsche's Dionysian-Dithyrambs premiered. Alexander Pereira succeeded Flimm as intendant, who departed in 2011 to become director of the Berlin State Opera. Pereira's objective for the festival was to present only new productions. When he resigned at the end of the 2014 festival season to take over as the General Director of La Scala, , who had served as Drama Director of the Salzburg Festival since 2012, took over as Interim General Manager. The 2015 festival marked the first one for which Bechtolf was responsible for the artistic programming. Budget cuts led to a retreat from Pereira's "new productions only" objective. The 2015 opera program presented only three new productions—Le nozze di Figaro, directed by Bechtolf; Fidelio, directed by Claus Guth; and Wolfgang Rihm's rarely performed Die Eroberung von Mexico (The Conquest of Mexico), directed by Peter Konwitschny. The remaining four opera productions—Norma, Il trovatore, Iphigénie en Tauride, and Der Rosenkavalier—were revivals. In 2018, Lydia Steier was the first woman to stage Die Zauberflöte.
Economy
The Salzburg Festival reports in 2017 ticket sales revenue of about €27 million, and directly and indirectly creates value to the sum of €183 million in Salzburg per year. The festival thereby secures employment in Salzburg (including year-round employees and full-time equivalent adjusted seasonal workers of the festival) of 2800 full-time jobs (Austria 3400). Through their effect in other sectors, directly and indirectly they provide the public sector with approximately €77 million of taxes and duties.
Salzburg Whitsun Festival
The Salzburg Whitsun Festival (Salzburger Pfingstfestspiele) was established at the behest of Herbert von Karajan in 1973 as a brief concert series with the name Pfingstkonzerte. Today its schedule remains, at four days, brief, but is characterized by multiple events each day; and it is managed under the umbrella of the main (summer) Salzburg Festival. (Pfingst is Whitsun in the U.K. and Pentecost in the U.S.; the British term is used by the festival's management.)
The first Whitsun Concerts centered on three symphonies by Bruckner, all conducted by Karajan and played at the Großes Festspielhaus over three days by the Berlin Philharmonic. Years later, opera became part of the activities, and "Concerts" became officially "Festival". In the 1990s there began an emphasis on works from the Baroque repertoire. In 2005, for example, the Salzburg Whitsun Festival presented Handel's Acis and Galatea and his oratorio Solomon.
In 2007, Riccardo Muti became the artistic director of the festival under a five-year contract during which he presented fully staged performances of operatic rarities from the 18th and 19th century Neapolitan School of opera in the Haus für Mozart. He has been succeeded by mezzo-soprano Cecilia Bartoli, also for a period of five years.
Among a series of concerts and, for the first time in the history of the festival, dance performances (by the Kirov Ballet), Bartoli is to star in a full-staged opera each year, which will then be repeated at the Summer Festival in July and August. In 2012, she sang Cleopatra in Handel's Giulio Cesare, in 2013 the title role in Vincenzo Bellini's Norma, and in 2014 Rossini's La Cenerentola. In 2015 she performed the title role in Iphigénie en Tauride by Christoph Willibald Gluck, and in 2016 she sang Maria in Leonard Bernstein's West Side Story.
See also
List of opera festivals
References
External links
Salzburg Festival 2010
aeiou encyclopaedia article
Salzburg Festival on medici.tv
Classical music festivals in Austria
Opera festivals
Summer festivals
1920 establishments in Austria
Annual events in Austria
Music festivals established in 1920
Theatre festivals in Austria
Summer events in Austria
|
```assembly
page ,132
title memcpy - Copy source memory bytes to destination
;***
;memcpy.asm - contains memcpy and memmove routines
;
;
;Purpose:
; memcpy() copies a source memory buffer to a destination buffer.
; Overlapping buffers are not treated specially, so propogation may occur.
; memmove() copies a source memory buffer to a destination buffer.
; Overlapping buffers are treated specially, to avoid propogation.
;
;*******************************************************************************
include ksamd64.inc
subttl "memcpy"
;***
;memcpy - Copy source buffer to destination buffer
;
;Purpose:
; memcpy() copies a source memory buffer to a destination memory buffer.
; This routine does NOT recognize overlapping buffers, and thus can lead
; to propogation.
; For cases where propogation must be avoided, memmove() must be used.
;
; Algorithm:
;
; void * memcpy(void * dst, void * src, size_t count)
; {
; void * ret = dst;
;
; /*
; * copy from lower addresses to higher addresses
; */
; while (count--)
; *dst++ = *src++;
;
; return(ret);
; }
;
;memmove - Copy source buffer to destination buffer
;
;Purpose:
; memmove() copies a source memory buffer to a destination memory buffer.
; This routine recognize overlapping buffers to avoid propogation.
; For cases where propogation is not a problem, memcpy() can be used.
;
; Algorithm:
;
; void * memmove(void * dst, void * src, size_t count)
; {
; void * ret = dst;
;
; if (dst <= src || dst >= (src + count)) {
; /*
; * Non-Overlapping Buffers
; * copy from lower addresses to higher addresses
; */
; while (count--)
; *dst++ = *src++;
; }
; else {
; /*
; * Overlapping Buffers
; * copy from higher addresses to lower addresses
; */
; dst += count - 1;
; src += count - 1;
;
; while (count--)
; *dst-- = *src--;
; }
;
; return(ret);
; }
;
;
;Entry:
; void *dst = pointer to destination buffer
; const void *src = pointer to source buffer
; size_t count = number of bytes to copy
;
;Exit:
; Returns a pointer to the destination buffer in AX/DX:AX
;
;Uses:
; CX, DX
;
;Exceptions:
;*******************************************************************************
extrn __favor:byte
extrn __ImageBase:byte
extrn __memcpy_nt_iters:qword ; defined in cpu_disp.c
__FAVOR_ENFSTRG equ 1
; Code for copying block using enhanced fast strings.
; This code needs to be in a separate routine because
; it uses non-volatile registers which must be saved
; and restored for exception handling.
NESTED_ENTRY memcpy_repmovs, _TEXT
push_reg rdi
push_reg rsi
.endprolog
mov rax, r11 ; return original destination pointer
mov rdi, rcx ; move destination pointer to rdi
mov rcx, r8 ; move length to rcx
mov rsi, r10 ; move source pointer to rsi
rep movsb ; copy source to destination buffer
.beginepilog
pop rsi
pop rdi
ret ; return
NESTED_END memcpy_repmovs, _TEXT
; Main memmove/memcpy routine
public memmove
LEAF_ENTRY_ARG3 memcpy, _TEXT, dst:ptr byte, src:ptr byte, count:dword
OPTION PROLOGUE:NONE, EPILOGUE:NONE
memmove = memcpy
mov r11, rcx ; save destination address
mov r10, rdx ; save source address
cmp r8, 16 ; if 16 bytes or less
jbe MoveBytes16 ; go move them quick
cmp r8, 32 ; check for length <= 32 (we know its > 16)
jbe Move17to32 ; go handle lengths 17-32 as a special case
sub rdx, rcx ; compute offset to source buffer
jae CopyUp ; if above or equal, go move up
lea rax, [r8+r10] ; else check that src+count < dst
cmp rcx, rax ; (src + count) < dst
jb CopyDown ; no, buffers overlap go move downward
CopyUp:
cmp r8, 128
jbe XmmCopySmall
test __favor, 1 SHL __FAVOR_ENFSTRG ; check for ENFSTRG (enhanced fast strings)
jz XmmCopyUp ; If Enhanced Fast String not available, use XMM
jmp memcpy_repmovs
; Handle lengths 17-32 as a special case using XMM registers.
; This allows the regular code to assume that there will always be enough
; bytes for the "deferred" block of 16. Also any case that can be handled
; with just two stores is handled with just two stores, the regular code
; will always do 3 stores for unaligned moves that have a remainder.
; No assumptions are made here about buffer alignment or overlap.
; We load the entire string to be moved in 2 xmm registers before storing
; anything, so this works for any arrangement of overlapping buffers.
;
; dst is in rcx (can modify) and r11 (must preserve for return value)
; src is in r10 (should preserve for consistency)
; rdx is the offset from the dst to the source, so rcx + rdx is the src
; r8 is the length, and is known to be 17 <= r8 <= 32
;
; When length < 32 the first 16 bytes includes some of the last 16 bytes
; and we will store (length - 32) bytes twice. (E.g. in the worst case
; of len 17 we are storing the middle 15 bytes of the buffer twice).
; This is still much faster than doing logic and branching with 1, 2, 4
; and 8 byte conditional copies.
;
align 16
Move17to32:
movups xmm0, [rdx] ; load first 16 bytes of src
movups xmm1, (-16)[rdx + r8] ; load last 16 bytes of src
movups [rcx], xmm0 ; store first 16 bytes of dst
movups (-16)[rcx + r8], xmm1 ; store last 16 bytes of dst
mov rax, rcx ; set destination address
ret
;
; Move residual bytes.
;
align 16
MoveBytes16:
mov rax, rcx ; mov destination address to rax
lea r9, OFFSET __ImageBase
IFDEF _VCRUNTIME_BUILD_QSPECTRE
and r8, 1Fh ; bound r8 to 0-31 in speculation scenarios (17-31 is padding)
ENDIF
mov ecx, [(IMAGEREL MoveSmall) + r9 +r8*4]
add rcx, r9
jmp rcx
_TEXT ends
_RDATA segment read para 'DATA'
MoveSmall dd IMAGEREL MoveSmall0
dd IMAGEREL MoveSmall1
dd IMAGEREL MoveSmall2
dd IMAGEREL MoveSmall3
dd IMAGEREL MoveSmall4
dd IMAGEREL MoveSmall5
dd IMAGEREL MoveSmall6
dd IMAGEREL MoveSmall7
dd IMAGEREL MoveSmall8
dd IMAGEREL MoveSmall9
dd IMAGEREL MoveSmall10
dd IMAGEREL MoveSmall11
dd IMAGEREL MoveSmall12
dd IMAGEREL MoveSmall13
dd IMAGEREL MoveSmall14
dd IMAGEREL MoveSmall15
dd IMAGEREL MoveSmall16
IFDEF _VCRUNTIME_BUILD_QSPECTRE
dd 15 dup (IMAGEREL MoveSmall0) ; 17 -> 31 padding
ENDIF
_RDATA ends
_TEXT segment para 'CODE'
align 16
MoveSmall0::
ret
MoveSmall2::
movzx ecx, word ptr [rdx] ; get two bytes from source
mov [rax], cx ; write two bytes to destination
ret
MoveSmall8::
mov rcx, qword ptr [rdx] ; get eight bytes from source
mov [rax], rcx ; write eight bytes to destination
ret
MoveSmall3::
movzx ecx, word ptr [rdx] ; get two bytes from source
movzx r8d, byte ptr 2[rdx] ; get last byte from source
mov [rax], cx ; write two bytes to destination
mov 2[rax], r8b ; write last byte to destination
ret
MoveSmall1::
movzx ecx, byte ptr [rdx] ; get byte from source
mov [rax], cl ; write byte to destination
ret
MoveSmall16::
movdqu xmm0, xmmword ptr [rdx] ; get sixteen bytes from source
movdqu xmmword ptr [rax], xmm0 ; write sixteen bytes to destination
ret
align 16
MoveSmall11::
mov r8, qword ptr [rdx] ; get eight bytes from source
movzx ecx, word ptr 8[rdx] ; get two bytes from source
movzx r9d, byte ptr 10[rdx] ; get last byte from source
mov [rax], r8 ; write eight bytes to destination
mov 8[rax], cx ; write two bytes to destination
mov 10[rax], r9b ; write last byte to destination
ret
MoveSmall4::
mov ecx, dword ptr [rdx] ; get four bytes from source
mov [rax], ecx ; write four bytes to destination
ret
align 16
MoveSmall5::
mov ecx, dword ptr [rdx] ; get four bytes from source
movzx r8d, byte ptr 4[rdx] ; get last byte from source
mov [rax], ecx ; write four bytes to destination
mov 4[rax], r8b ; write last byte to destination
ret
align 16
MoveSmall6::
mov ecx, dword ptr [rdx] ; get four bytes from source
movzx r8d, word ptr 4[rdx] ; get two bytes from source
mov [rax], ecx ; write four bytes to destination
mov 4[rax], r8w ; write two bytes to destination
ret
align 16
MoveSmall7::
mov ecx, dword ptr [rdx] ; get four bytes from source
movzx r8d, word ptr 4[rdx] ; get two bytes from source
movzx r9d, byte ptr 6[rdx] ; get last byte from source
mov [rax], ecx ; write four bytes to destination
mov 4[rax], r8w ; write two bytes to destination
mov 6[rax], r9b ; write last byte to destination
ret
MoveSmall13::
mov r8, qword ptr [rdx] ; get eight bytes from source
mov ecx, dword ptr 8[rdx] ; get four bytes from source
movzx r9d, byte ptr 12[rdx] ; get last bytes from source
mov [rax], r8 ; write eight bytes to destination
mov 8[rax], ecx ; write four bytes to destination
mov 12[rax], r9b ; write last byte to destination
ret
align 16
MoveSmall9::
mov r8, qword ptr [rdx] ; get eight bytes from source
movzx ecx, byte ptr 8[rdx] ; get last byte from source
mov [rax], r8 ; write eight bytes to destination
mov 8[rax], cl ; write last byte to destination
ret
align 16
MoveSmall10::
mov r8, qword ptr [rdx] ; get eight bytes from source
movzx ecx, word ptr 8[rdx] ; get two bytes from source
mov [rax], r8 ; write eight bytes to destination
mov 8[rax], cx ; write two bytes to destination
ret
align 16
MoveSmall12::
mov r8, qword ptr [rdx] ; get eight bytes from source
mov ecx, dword ptr 8[rdx] ; get four bytes from source
mov [rax], r8 ; write eight bytes to destination
mov 8[rax], ecx ; write four bytes to destination
ret
align 16
MoveSmall14::
mov r8, qword ptr [rdx] ; get eight bytes from source
mov ecx, dword ptr 8[rdx] ; get four bytes from source
movzx r9d, word ptr 12[rdx] ; get two bytes from source
mov [rax], r8 ; write eight bytes to destination
mov 8[rax], ecx ; write four bytes to destination
mov 12[rax], r9w ; write two bytes to destination
ret
align 16
MoveSmall15::
mov r8, qword ptr [rdx] ; get eight bytes from source
mov ecx, dword ptr 8[rdx] ; get four bytes from source
movzx r9d, word ptr 12[rdx] ; get two bytes from source
movzx r10d, byte ptr 14[rdx] ; get last byte from source
mov [rax], r8 ; write eight bytes to destination
mov 8[rax], ecx ; write four bytes to destination
mov 12[rax], r9w ; write two bytes to destination
mov 14[rax], r10b ; write last byte to destination
ret
;
; Memcpy up using SSE instructions.
;
; Preconditions:
; destination in rcx (destructable) and r11 (must preserve for return value)
; source in r10
; length in r8, must be greater than 16
; offset from dest to src in rdx
; source addr > dest addr or else buffers don't overlap
;
; Aligned stores are much faster on AMD hardware, so start by moving however many
; bytes must be moved so updated dst is 16-byte aligned. We need to copy
; (16 - (dest mod 16)) bytes, but it's faster to just do an unaligned copy of 16
; bytes and then start the aligned loop as usual at ((dest - (dest mod 16)) + 16).
; This results in (dest mod 16) bytes being copied twice. This is a lot faster
; than a bunch of code to copy maybe 1 then maybe 2 then maybe 4 then maybe 8
; bytes to achieve dst alignement.
;
; We know the src address is greater than the dst, but not by how much. In the
; case where the difference is less than 16 we must be careful about the bytes
; that will be stored twice. We must do both loads before either store, or the
; second load of those bytes will get the wrong values. We handle this by
; loading the last 16 bytes that can be stored at an aligned address, but
; deferring the store of those bytes to the remainder code, so it can load the
; remainder before storing the deferred bytes. Since either or both of the two
; loops can be skipped, the preconditions needed by the remainder code must
; also apply to the loops. These conditions are:
; - r8 is the count remaining, not including the deferred bytes
; - [rcx + rdx] and [rcx] as usual point to the src and dst where the number
; number of bytes given by r8 should be copied from and to.
; - xmm0 holds the 16 deferred bytes that need to be stored at (-16)[rcx]
;
align 16
XmmCopyUp:
movups xmm0, [rcx + rdx] ; load deferred bytes
add r8, rcx ; r8 points 1 byte past end
add rcx, 16 ; update to next block.
test r11b, 15 ; test if destination aligned
jz XmmCopyLargeTest ; go try 128-byte blocks
;
; Move alignment bytes.
;
XmmCopyAlign:
movaps xmm1, xmm0 ; save initial bytes in xmm1
and rcx, -16 ; rcx is 16 bytes past first 16-byte align point
movups xmm0, [rcx + rdx] ; load aligned deferred-store bytes
add rcx, 16 ; update to next block
movups [r11], xmm1 ; now safe to store 16 unaligned at start
;
; See if we can move any 128-byte blocks.
;
XmmCopyLargeTest:
sub r8, rcx ; r8 restored to count remaining
mov r9, r8 ; copy count of bytes remaining
shr r9, 7 ; compute number of 128-byte blocks
jz XmmCopySmallTest ; if z jump around to 2nd loop
movaps (-16)[rcx], xmm0 ; going into 1st loop, ok to store deferred bytes
cmp r9, __memcpy_nt_iters ; threshold defined by cpu_disp.c
jna short XmmCopyLargeInner ; jump into 1st loop
jmp XmmCopyLargeInnerNT ; long enough so non-temporal worth it, jump into nt loop
;
; Move 128-byte blocks
;
align 16
;
; When possible, non-mov instructions are put between a load and store
; so their execution can overlap the store.
; The jnz is likewise moved earlier to come before the last store pair.
; Pairs of loads/stores are used to overlap cache latencies.
; movups and movaps are equally fast on aligned storage, we use movaps
; to document movs that we *know* are going to be aligned, movups otherwise.
; xmm0 must be preloaded before jumping into this loop, and the last
; store must be deferred (and the bytes to store left in xmm0) for the
; following loop and/or the remainder code.
;
XmmCopyLargeOuter:
movaps (-32)[rcx], xmm0 ; store 7th chunk from prior iteration
movaps (-16)[rcx], xmm1 ; store 8th chunk from prior iteration
XmmCopyLargeInner: ; enter loop here with xmm0 preloaded.
movups xmm0, [rcx + rdx] ; load first 16 byte chunk
movups xmm1, 16[rcx + rdx] ; load 2nd 16 byte chunk
add rcx, 128 ; advance destination address
movaps (-128)[rcx], xmm0 ; store first 16 byte chunk
movaps (-112)[rcx], xmm1 ; store 2nd 16 byte chunk
movups xmm0, (-96)[rcx + rdx] ; load 3rd chunk
movups xmm1, (-80)[rcx + rdx] ; load 4th chunk
dec r9 ; dec block counter (set cc for jnz)
movaps (-96)[rcx], xmm0 ; store 3rd chunk
movaps (-80)[rcx], xmm1 ; store 4th chunk
movups xmm0, (-64)[rcx + rdx] ; load 5th chunk
movups xmm1, (-48)[rcx + rdx] ; load 6th chunk
movaps (-64)[rcx], xmm0 ; store 5th chunk
movaps (-48)[rcx], xmm1 ; store 6th chunk
movups xmm0, (-32)[rcx + rdx] ; load 7th chunk
movups xmm1, (-16)[rcx + rdx] ; load 8th chunk
jnz XmmCopyLargeOuter ; loop if more blocks
XmmCopyFinish: ; non-temporal codepath rejoins here
movaps (-32)[rcx], xmm0 ; store 7th chunk from final iteration
and r8, 127 ; compute remaining byte count
movaps xmm0, xmm1 ; 8th chunk becomes deferred bytes
jmp XmmCopySmallTest
XmmCopySmall:
movups xmm0, [rcx + rdx] ; load deferred bytes
add rcx, 16
sub r8, 16
;
; See if we have any 16-byte blocks left to move
;
XmmCopySmallTest:
mov r9, r8 ; copy count of bytes remaining
shr r9, 4 ; compute number of 16-byte blocks
jz short XmmCopyTrail ; on z, no 16-byte blocks, skip 2nd loop
align 16
XmmCopySmallLoop:
movups (-16)[rcx], xmm0 ; the first time through this is the
; store of the deferred bytes from above
movups xmm0, [rcx + rdx] ; load a block
add rcx, 16 ; advance dest addr (store is deferred)
dec r9
jnz XmmCopySmallLoop
XmmCopyTrail:
and r8, 15 ; compute remaining byte count
jz short XmmCopyReturn ; if z, no remainder bytes to move
;
; Handle remainder bytes.
;
; As at the start, we are going to do an unaligned copy of 16 bytes which will double-write
; some bytes. We must not touch rcx or xmm0 because they have what we need to store the
; deferred block. We use rax to point to the first byte after the end of the buffer and
; back up from there. Note rax is pointing to an address we must not read or write!
;
lea rax, [rcx+r8] ; make rax point one past the end
movups xmm1, (-16)[rax + rdx] ; load last 16 bytes of source buffer
movups (-16)[rax], xmm1 ; write last 16 bytes, including 16-r8 bytes
; from the last aligned block which we are about to
; overstore with identical values
XmmCopyReturn:
movups (-16)[rcx], xmm0 ; store the last deferred aligned block
mov rax, r11 ; we must return the original destination address
ret ;
;
; Move 128-byte blocks non-temporal
;
align 16
;
; non-temporal is exactly the same as the regular xmm loop above, except the movaps
; stores are movntps and we use prefetchnta. We are prefetching in two places, each
; prefetch gets 64 bytes about half an iteration ahead of time (about 10 instructions
; lead time). When we come to the end of the memcpy, we'll be prefetching bytes
; beyond the buffer we need to copy from, which may not be valid bytes. This is
; not illegal; if the memory address is invalid it does not trap, the hardware treats
; illegal prefetches as nops.
;
XmmCopyLargeOuterNT:
movntps (-32)[rcx], xmm0 ; store 7th chunk from prior iteration
movntps (-16)[rcx], xmm1 ; store 8th chunk from prior iteration
XmmCopyLargeInnerNT: ; enter loop here with xmm0 preloaded.
prefetchnta [rcx + rdx + 512] ; prefetch several cache lines ahead
movups xmm0, [rcx + rdx] ; load first 16 byte chunk
movups xmm1, 16[rcx + rdx] ; load 2nd 16 byte chunk
add rcx, 128 ; advance destination address
movntps (-128)[rcx], xmm0 ; store first 16 byte chunk
movntps (-112)[rcx], xmm1 ; store 2nd 16 byte chunk
movups xmm0, (-96)[rcx + rdx] ; load 3rd chunk
movups xmm1, (-80)[rcx + rdx] ; load 4th chunk
dec r9 ; dec block counter (set cc for jnz)
movntps (-96)[rcx], xmm0 ; store 3rd chunk
movntps (-80)[rcx], xmm1 ; store 4th chunk
movups xmm0, (-64)[rcx + rdx] ; load 5th chunk
movups xmm1, (-48)[rcx + rdx] ; load 6th chunk
prefetchnta [rcx + rdx + 576] ; prefetch several cache lines ahead
movntps (-64)[rcx], xmm0 ; store 5th chunk
movntps (-48)[rcx], xmm1 ; store 6th chunk
movups xmm0, (-32)[rcx + rdx] ; load 7th chunk
movups xmm1, (-16)[rcx + rdx] ; load 8th chunk
jnz XmmCopyLargeOuterNT ; loop if more blocks
sfence
jmp XmmCopyFinish ; rejoin regular memcpy codepath
;
; The source address is less than the destination address.
;
align 16
;
; Move bytes down using SSE registers. The source address is less than
; the destination address and the buffers overlap. We will do everything back-to-front.
;
; Preconditions:
; destination is r11 (must preserve for return value) and rcx
; source in r10 (must preserve for remainder move)
; length in r8, must have been verified to be greater than 16
; offset from dest to src in rdx
; source addr < dest addr and the buffers overlap
;
CopyDown:
add rcx, r8 ; make rcx point one past the end of the dst buffer
movups xmm0, -16[rcx + rdx] ; load deferred bytes
sub rcx, 16 ; reduce dst addr
sub r8, 16 ; r8 -= 16 in case aligned
;
; Aligned stores using movaps or movups are faster on AMD hardware than unaligned
; stores using movups. To achieve 16-byte dest alignment, we do an unaligned move
; of the last 16 bytes of the buffers, then reduce rcx only by the amount necessary
; to achieve alignment. This results in some bytes getting copied twice, unless we're
; already aligned.
;
; We know the src address is less than the dst, but not by exactly how much. In the
; case where the difference is less than 16 we must be careful about the bytes
; that will be stored twice. We must do both loads before either store, or the
; second load of those bytes will get the wrong values. We handle this by
; deferring the store of 16 aligned bytes to the remainder code, so it can load the
; remainder before storing the deferred bytes. Since either or both of the two
; loops can be skipped, the preconditions needed by the remainder code must
; also apply to the loops. These conditions are:
; - r8 is the count remaining, not including the deferred bytes
; - [rcx] points one past the end of the remainder bytes
; - rdx is the offset from the dst to the source
; - xmm0 holds the 16 deferred bytes that need to be stored at [rcx]
;
test cl, 15 ; test if dest aligned
jz XmmMovLargeTest ; go try 128-byte blocks
;
; Move alignment bytes.
;
XmmMovAlign:
mov rax, rcx ; save unaligned store address
and rcx, -16 ; rcx is deferred store address
movups xmm1, xmm0 ; copy unaligned last bytes to xmm1
movups xmm0, [rcx + rdx] ; load deferred-store bytes
movups [rax], xmm1 ; now safe to do unaligned store
mov r8, rcx ; easier to recalc r8 using rcx-r11 ...
sub r8, r11 ; ... than calc how much to subtract from r8
;
; See if we can move any 128-byte blocks.
;
XmmMovLargeTest:
mov r9, r8 ; copy count of bytes remaining
shr r9, 7 ; compute number of 128-byte blocks
jz short XmmMovSmallTest ; if z jump around to 2nd loop
movaps [rcx], xmm0 ; going into 1st loop, ok to store deferred bytes
jmp short XmmMovLargeInner ; jump into 1st loop
;
; Move 128-byte blocks
;
align 16
XmmMovLargeOuter:
movaps (128-112)[rcx], xmm0 ; store 7th chunk from prior iteration
movaps (128-128)[rcx], xmm1 ; store 8th chunk from prior iteration
XmmMovLargeInner:
movups xmm0, (-16)[rcx + rdx] ; load first 16 byte chunk
movups xmm1, (-32)[rcx + rdx] ; load 2nd 16 byte chunk
sub rcx, 128 ; reduce destination address
movaps (128-16)[rcx], xmm0 ; store first 16 byte chunk
movaps (128-32)[rcx], xmm1 ; store 2nd 16 byte chunk
movups xmm0, (128-48)[rcx + rdx] ; load 3rd chunk
movups xmm1, (128-64)[rcx + rdx] ; load 4th chunk
dec r9 ; dec block counter (set cc for jnz)
movaps (128-48)[rcx], xmm0 ; store 3rd chunk
movaps (128-64)[rcx], xmm1 ; store 4th chunk
movups xmm0, (128-80)[rcx + rdx] ; load 5th chunk
movups xmm1, (128-96)[rcx + rdx] ; load 6th chunk
movaps (128-80)[rcx], xmm0 ; store 5th chunk
movaps (128-96)[rcx], xmm1 ; store 6th chunk
movups xmm0, (128-112)[rcx + rdx] ; load 7th chunk
movups xmm1, (128-128)[rcx + rdx] ; load 8th chunk
jnz short XmmMovLargeOuter ; loop if more blocks
movaps (128-112)[rcx], xmm0 ; store 7th chunk from final iteration
and r8, 127 ; compute remaining byte count
movaps xmm0, xmm1 ; 8th chunk becomes deferred bytes
;
; See if we have any 16-byte blocks left to move
;
XmmMovSmallTest:
mov r9, r8 ; copy count of bytes remaining
shr r9, 4 ; compute number of 16-byte blocks
jz short XmmMovTrailing ; if z, no 16-byte blocks
align 16
XmmMovSmallLoop:
movups [rcx], xmm0 ; the first time through this is the
; store of the deferred bytes from above
sub rcx, 16 ; reduce dest addr
movups xmm0, [rcx + rdx] ; load a block
dec r9
jnz XmmMovSmallLoop
XmmMovTrailing:
and r8, 15 ; compute remaining byte count
jz short XmmMovReturn ; if z, no residual bytes to move
;
; Handle remainder bytes.
;
; As at the start, we are going to do an unaligned copy of 16 bytes which will double-write
; some bytes. We must not touch rcx or xmm0 because they have what we need to store the
; deferred block. But unlike for mcpyxmm code above, we have r10 and r11 we can just use
; to copy the lowest 16 bytes.
;
movups xmm1, [r10] ; load lowest 16 bytes, which includes remainder
movups [r11], xmm1 ; store lowest 16 bytes, which includes remainder
XmmMovReturn:
movups [rcx], xmm0 ; store deferred bytes
mov rax, r11 ; we must return destination address
ret
LEAF_END memcpy, _TEXT
end
```
|
```java
package tlc2.output;
import java.util.List;
import java.util.Optional;
import tlc2.model.MCError;
import tlc2.model.MCState;
import tlc2.tool.TLCStateInfo;
/**
* Saves all messages containing info about error traces that pass through {@link tlc.output.MP}.
* Ideally this will eventually go away and all of TLC's model checking implementations will
* bubble their error traces up through their top-level .run() methods, but until that
* refactoring takes place this is how we get the error trace: by hooking into the static
* console output handler class and intercepting TLC output.
*
* There are a number of places that error traces are generated within TLC:
* - Basic local BFS model checking in {@link tlc2.tool.ModelChecker#doNextCheckInvariants}
* > note: appears to be dead, the concurrent BFS implementation is always used instead
* - Concurrent local BFS model checking in {@link tlc2.tool.Worker#doNextCheckInvariants}
* - DFID local model checking in {@link tlc2.tool.DFIDModelChecker#doNext}
* - Simulator local model checking in {@link tlc2.tool.Simulator#simulate}
* - Liveness checking in {@link tlc2.tool.liveness.LiveCheck#check0}
* - Distributed model checking in {@link tlc2.tool.distributed.TLCServerThread#run}
* All of these pass through {@link tlc2.output.StatePrinter} then {@link tlc.output.MP}.
*
* The purpose of this class is to record error trace output from all of those sources while
* ignoring output that is not an error trace (some of which superficially resembles error
* traces, for example printing out an invalid/incomplete state transition).
*/
public class ErrorTraceMessagePrinterRecorder implements IMessagePrinterRecorder {
/**
* The error trace, if one exists.
*/
private Optional<MCError> errorTrace = Optional.empty();
/**
* Whether the trace has terminated or more states are expected;
*/
private boolean traceFinished = false;
/**
* Gets the error trace, if it exists.
* @return The error trace.
*/
public Optional<MCError> getMCErrorTrace() {
return this.errorTrace;
}
@Override
public void record(int code, Object... objects) {
if (!traceFinished) {
switch (code) {
case EC.TLC_STATE_PRINT2:
if (objects.length >= 2
&& objects[0] instanceof TLCStateInfo
&& objects[1] instanceof Integer) {
TLCStateInfo stateInfo = (TLCStateInfo)objects[0];
Integer stateOrdinal = (Integer)objects[1];
stateInfo.stateNumber = stateOrdinal;
// Idempotent transition from no trace to safety trace
this.errorTrace = Optional.of(this.errorTrace.orElse(new MCError()));
// Add state to trace
MCState state = new MCState(stateInfo);
this.errorTrace.ifPresent(trace -> trace.addState(state));
}
break;
case EC.TLC_STATE_PRINT3:
// Mark trace as ending in stuttering
this.traceFinished = true;
this.errorTrace.ifPresent(trace -> {
List<MCState> states = trace.getStates();
if (states.size() > 0) {
MCState finalState = states.get(states.size() - 1);
MCState stutteringState = new MCState(finalState, true, false);
trace.addState(stutteringState);
}
});
break;
case EC.TLC_BACK_TO_STATE:
// Lasso reporting output varies based on -tool setting
Optional<Integer> stateOrdinal = Optional.empty();
if (objects.length >= 2
&& objects[0] instanceof TLCStateInfo
&& objects[1] instanceof Integer) {
stateOrdinal = Optional.of((Integer)objects[1]);
} else if (objects.length >= 2
&& objects[0] instanceof String
&& objects[1] instanceof String) {
try {
stateOrdinal = Optional.of(Integer.parseInt((String)objects[0]));
} catch (NumberFormatException e) { }
}
stateOrdinal.ifPresent(ord -> {
this.traceFinished = true;
this.errorTrace.ifPresent(trace -> {
List<MCState> states = trace.getStates();
if (0 < ord && ord <= states.size()) {
MCState finalState = states.get(ord - 1);
MCState lassoState = new MCState(finalState, false, true);
trace.addState(lassoState);
}
});
});
break;
}
}
}
}
```
|
Seacrest is a surname. Notable people with the surname include:
Bernadette Seacrest (born 1965), American vocalist
Ryan Seacrest (born 1974), American radio personality, television host, and producer
See also
Seacrest, Florida
Secrest
Drillship Seacrest
|
```turing
$ cat > dune-project << EOF
> (lang dune 3.8)
> EOF
$ cat > dune << EOF
> (test
> (name t)
> (build_if true))
> EOF
$ touch t.ml
$ dune build
File "dune", line 3, characters 1-16:
3 | (build_if true))
^^^^^^^^^^^^^^^
Error: 'build_if' is only available since version 3.9 of the dune language.
Please update your dune-project file to have (lang dune 3.9).
[1]
$ cat > dune-project << EOF
> (lang dune 3.9)
> EOF
$ dune build
```
|
Robert Venditti is an American comic book writer, known for his work on the Top Shelf Productions title The Surrogates, which was adapted to a major motion picture starring Bruce Willis directed by Jonathan Mostow for Disney., and for the Valiant Comics title X-O Manowar. He is also known for his work on DC Comics titles such as The Flash, Green Lantern, Justice League, and Hawkman. He has also adapted the Percy Jackson & The Olympians and The Heroes of Olympus book series by Rick Riordan into graphic novels.
Early life
Robert Venditti was born in Memorial Hospital and raised in Hollywood, and Pembroke Pines, Florida. Though he says he always wanted to be a prose writer, he rarely read comics as a child, but would peruse the comics at the barber shop.
He later moved to Gainesville to attend the University of Florida where he received a B.A. in Political Science and English. After college he worked as a clerk at a law firm in southern Florida with aspirations to practice law, but found that work not to his liking. After subsequently worked pumping gas on a fuel truck, he moved to the Port St. John/Titusville area in Brevard County to which his parents had moved, where he attended the University of Central Florida, working at a Borders Books store in Winter Park, while earning his M.A. in Creative Writing. In about 2000, while working at Borders, a coworker recommended comics books as reading material to him. Though the skeptical Venditti initially thought of comics as solely for children, his reading of Kurt Busiek's Astro City impressed him enough to decide to change his career aspirations from prose to comics.
Career
In 2002 Venditti attended a convention and met Chris Staros from Top Shelf Productions, and was added to Staros' email list. That April, Staros subsequently sent out a mass email announcing that Top Shelf's distributor was going bankrupt, and asking recipients of the email to place orders to aid the distributor. Venditti contacted Staros to offer help, and ending up doing warehouse work for him. Venditti began working on The Surrogates in July 2002, and after finishing the script that December, he gave it to Staros, who decided to publish it through Top Shelf, despite the fact that it was not typical of the material they usually published. The first issue of the five-issue miniseries was published in July 2005, and the fifth in March 2006. The prequel Surrogates: Flesh & Bone, was released in September 2009, the same month as the release of the feature film adaptation of the first miniseries, starring Bruce Willis.
In May 2012 Venditti began writing the X-O Manowar series for Valiant Entertainment. Venditti began his first work for DC Comics when he took over from Paul Cornell on Demon Knights beginning with issue #16, and took over Green Lantern and Green Lantern Corps in June 2013.
Personal life
As of 2008, Venditti lives in Atlanta, Georgia.
Bibliography
Top Shelf Productions
The Surrogates #1-5 (limited series, July 2005-April 2006)
The Surrogates (tpb, 208 pages, 2006, ) collects:
"Chapter One: Field Test" (with Brett Weldele, in #1, 2005)
"Chapter Two: Life Unfiltered" (with Brett Weldele, in #2, 2005)
"Chapter Three: Revelations" (with Brett Weldele, in #3, 2005)
"Chapter Four: Biologics" (with Brett Weldele, in #4, 2006)
"Chapter Five: Pulse" (with Brett Weldele, in #5, 2006)
The Surrogates: Flesh and Bone (graphic novel, with Brett Weldele, tpb, 144 pages, July 2009, )
The Homeland Directive (graphic novel with Mike Huddleston, June 2011, tpb, 144 pages, )
The Surrogates: Case Files #1-2 (with Brett Weldele, July–September 2012)
Valiant Entertainment
4001 A.D.: X-O Manowar #1 (2016)
Armor Hunters #1-4 (2014)
Armor Hunters: Aftermath #1 (2014)
Book of Death #1-4 (2015)
Book of Death: The Fall of X-O Manowar #1 (2015)
Eternal Warrior: Awakening #1 (2017)
Wrath of the Eternal Warrior #1-14 (2015-2016)
X-O Manowar vol. 3 #0-50, Annual 2016 (2012-2016)
X-O Manowar: Commander Trill #0 (2015)
X-O Manowar: Valiant 25th Anniversary Special #1 (2015)
DC Comics
Damage vol. 2 #1-16, Annual #1 (2018-2019)
Demon Knights #16-23 (2013)
The Flash vol. 4 #30-49, Annual #3 (2014-2016)
The Flash: Futures End #1 (2014)
Freedom Fighters vol. 3 #1-12 (2019-2020)
Future State: Green Lantern #2 (2021)
Generations: Forged #1 (2021)
Generations: Shattered #1 (2021)
Green Lantern vol. 5 #21-52, 23.1, Annual #2-4 (2013-2016)
Green Lantern 80th Anniversary 100-Page Super Spectacular #1 (2020)
Green Lantern: Futures End #1 (2014)
Green Lantern Corps vol. 3 #21-27, Annual #2 (2013-2014)
Hal Jordan and the Green Lantern Corps #1-50 (2016-2018)
Hal Jordan and the Green Lantern Corps: Rebirth #1 (2016)
Hawkman vol. 5 #1-29 (2018-2020)
Justice League vol. 3 #32 (2018)
Justice League vol. 4 #40-47, Annual #2 (2020)
New Gods: Godhead #1 (2014)
Secret Origins vol. 3 #3, 7 (2014)
Supergirl vol. 7 Annual #2 (2020)
Other publishers
Marvel Comics Presents vol. 2 #6, "4F" (with Jeremy Haun, February 2008, Marvel Comics)
Iron Man: Iron Protocols, one-shot, "The Ark" (with Mark Nelson, October 2009) collected in Iron Man: Tales Of The Golden Avenger (tpb, 128 pages, 2010, , Marvel Comics)
Percy Jackson & the Olympians, Disney-Hyperion:
"Percy Jackson & the Olympians: The Lightning Thief" (graphic novel, with Attila Futaki, October 2010, tpb, 128 pages, )
"Percy Jackson & the Olympians: The Sea of Monsters" (graphic novel, with Attila Futaki, July 2013, tpb, 128 pages, )
"Percy Jackson & the Olympians: The Titan's Curse" (graphic novel, with Attila Futaki, October 2013, tpb, 128 pages, )
Blue Bloods (graphic novel with Alina Urusov, January 2013, hc, 112 pages, , HarperCollins)
The Heroes of Olympus, Disney-Hyperion:
"The Lost Hero: The Graphic Novel" (graphic novel, with Nate Powell, October 2014, hc, 192 pages, )
"The Son of Neptune: The Graphic Novel" (graphic novel, with Antoine Dodé, February 2017, hc, 192 pages, )
Miles Taylor and the Golden Cape: Attack of the Alien Horde (book, illustrated by Dusty Higgins, June 2015, hc, 304 pages, , Simon & Schuster)
Miles Taylor and the Golden Cape: Rise of the Robot Army (book, illustrated by Dusty Higgins, June 2016, hc, 304 pages, , Simon & Schuster)
References
External links
Audio interview with Robert Venditti
"Robert Venditti" Top Shelf Productions
University of Florida alumni
University of Central Florida alumni
Living people
People from Pembroke Pines, Florida
American comics writers
American writers of Italian descent
Year of birth missing (living people)
|
Acanthocasuarina tasmanica is a species of jumping plant louse, first found on plants of the genus Allocasuarina in Australia. The species is characterised by exhibiting an elongate habitus; short Rs and short cubital forewing cells; ventral genal processes beneath the apical margin of its vertex; short antennae; and nymphs that are elongate and very sclerotised (scale-like). It possesses rhinaria on its fourth, sixth, eighth and ninth antennal segments; the species' hind tibia has one outer and two inner spurs, while the female's proctiger carries an apical hook posteriorly.
References
Triozidae
Insects described in 2011
Hemiptera of Australia
|
```javascript
// Validation errors messages for Parsley
// Load this after Parsley
Parsley.addMessages('lt', {
dateiso: "is raas turi bti teisingo formato data (YYYY-MM-DD).",
minwords: "is raas turi turti ne maiau kaip %s odi.",
maxwords: "is raas turi turti ne daugiau kaip %s odi.",
words: "is raas turi turti nuo %s iki %s odi.",
gt: "i vert turi bti didesn.",
gte: "i vert turi bti didesn arba lygi.",
lt: "i vert turi bti maesn.",
lte: "i vert turi bti maesn arba lygi.",
notequalto: "i vert turi bti skirtinga."
});
```
|
Juho Rantala (born 13 December 1974 in Helsinki) is a football manager and former defender/midfielder. He is an assistant manager with the Finland national under-19 football team.
References
Living people
1974 births
Finnish men's footballers
Finnish football managers
FC Honka managers
Men's association football defenders
Men's association football midfielders
|
```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 isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major' );
var sfill = require( '@stdlib/blas/ext/base/sfill' ).ndarray;
var sscal = require( '@stdlib/blas/base/sscal' ).ndarray;
var f32 = require( '@stdlib/number/float64/base/to-float32' );
// MAIN //
/**
* Performs one of the matrix-vector operations `y = *A*x + *y` or `y = *A^T*x + *y`, where `` and `` are scalars, `x` and `y` are vectors, and `A` is an `M` by `N` matrix.
*
* @private
* @param {string} trans - specifies whether `A` should be transposed, conjugate-transposed, or not transposed
* @param {NonNegativeInteger} M - number of rows in the matrix `A`
* @param {NonNegativeInteger} N - number of columns in the matrix `A`
* @param {number} alpha - scalar constant
* @param {Float32Array} A - input matrix
* @param {integer} strideA1 - stride of the first dimension of `A`
* @param {integer} strideA2 - stride of the second dimension of `A`
* @param {NonNegativeInteger} offsetA - starting index for `A`
* @param {Float32Array} x - first input vector
* @param {integer} strideX - `x` stride length
* @param {NonNegativeInteger} offsetX - starting index for `x`
* @param {number} beta - scalar constant
* @param {Float32Array} y - second input vector
* @param {integer} strideY - `y` stride length
* @param {NonNegativeInteger} offsetY - starting index for `y`
* @returns {Float32Array} `y`
*
* @example
* var Float32Array = require( '@stdlib/array/float32' );
*
* var A = new Float32Array( [ 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 ] );
* var x = new Float32Array( [ 1.0, 1.0, 1.0 ] );
* var y = new Float32Array( [ 1.0, 1.0 ] );
*
* sgemv( 'no-transpose', 2, 3, 1.0, A, 3, 1, 0, x, 1, 0, 1.0, y, 1, 0 );
* // y => <Float32Array>[ 7.0, 16.0 ]
*/
function sgemv( trans, M, N, alpha, A, strideA1, strideA2, offsetA, x, strideX, offsetX, beta, y, strideY, offsetY ) { // eslint-disable-line max-params, max-len
var isrm;
var xlen;
var ylen;
var tmp;
var ix1;
var iy1;
var sa0;
var sa1;
var i1;
var i0;
var oa;
// Note on variable naming convention: sa#, ix#, i# where # corresponds to the loop number, with `0` being the innermost loop...
isrm = isRowMajor( [ strideA1, strideA2 ] );
if ( isrm ) {
// For row-major matrices, the last dimension has the fastest changing index...
sa0 = strideA2; // stride for innermost loop
sa1 = strideA1; // stride for outermost loop
} else { // isColMajor
// For column-major matrices, the first dimension has the fastest changing index...
sa0 = strideA1; // stride for innermost loop
sa1 = strideA2; // stride for outermost loop
}
if ( trans === 'no-transpose' ) {
xlen = N;
ylen = M;
} else {
xlen = M;
ylen = N;
}
// y = beta*y
if ( beta !== 1.0 ) {
if ( beta === 0.0 ) {
sfill( ylen, 0.0, y, strideY, offsetY );
} else {
sscal( ylen, beta, y, strideY, offsetY );
}
}
if ( alpha === 0.0 ) {
return y;
}
// Form: y = *A*x + y
if (
( !isrm && trans === 'no-transpose' ) ||
( isrm && trans !== 'no-transpose' )
) {
ix1 = offsetX;
for ( i1 = 0; i1 < xlen; i1++ ) {
tmp = f32( alpha * x[ ix1 ] );
oa = offsetA + (sa1*i1);
iy1 = offsetY;
for ( i0 = 0; i0 < ylen; i0++ ) {
y[ iy1 ] += f32( A[ oa+(sa0*i0) ] * tmp );
iy1 += strideY;
}
ix1 += strideX;
}
return y;
}
// Form: y = *A^T*x + y
// ( !isrm && trans !== 'no-transpose' ) || ( isrm && trans === 'no-transpose' )
iy1 = offsetY;
for ( i1 = 0; i1 < ylen; i1++ ) {
tmp = 0.0;
ix1 = offsetX;
oa = offsetA + (sa1*i1);
for ( i0 = 0; i0 < xlen; i0++ ) {
tmp += f32( A[ oa+(sa0*i0) ] * x[ ix1 ] );
ix1 += strideX;
}
y[ iy1 ] += f32( alpha * tmp );
iy1 += strideY;
}
return y;
}
// EXPORTS //
module.exports = sgemv;
```
|
```objective-c
/* size_max.h -- declare SIZE_MAX through system headers
Written by Simon Josefsson.
This program is free software; you can redistribute it and/or modify
the Free Software Foundation; either version 3, or (at your option)
any later version.
This program 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 this program; if not, see <path_to_url */
#ifndef GNULIB_SIZE_MAX_H
#define GNULIB_SIZE_MAX_H
/* Get SIZE_MAX declaration on systems like Solaris 7/8/9. */
# include <limits.h>
/* Get SIZE_MAX declaration on systems like glibc 2. */
# if HAVE_STDINT_H
# include <stdint.h>
# endif
/* On systems where these include files don't define it, SIZE_MAX is defined
in config.h. */
#endif /* GNULIB_SIZE_MAX_H */
```
|
Cedar Shores is an unincorporated community in Cedar Creek Township, Allen County, in the U.S. state of Indiana.
Geography
Cedar Shores is located at . This is about 1/4 mile north of Cedar Creek, which it was probably named for.
References
Unincorporated communities in Allen County, Indiana
Unincorporated communities in Indiana
Fort Wayne, IN Metropolitan Statistical Area
|
The ruby tetra (Axelrodia riesei) is a species of freshwater fish in the family Characidae.
It is found in the Río Meta, Colombia, South America. In nature, it has a natural red colour, but this is somewhat lessened in captivity. Ruby tetras grow up to long.
Named in honor of tropical-fish exporter William Riese, who collected the type specimen.
References
External links
Axelrodia riesei - Ruby tetra - FishBase
Ruby Tetra Care Axelrodia riesei
Pristellini
Taxa named by Jacques Géry
Fish described in 1966
|
```html
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "path_to_url">
<html xmlns="path_to_url">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8"/>
<meta http-equiv="x-ua-compatible" content="ie=7"/>
<title> cmseasySQL | WooYun-2014-53198 | WooYun.org </title>
<meta name="author" content="80sec"/>
<meta name="copyright" content="path_to_url"/>
<meta name="keywords" content="cmseasy,,SQL,wooyun,,web,,,,,"/>
<meta name="description" content="|WooYun,,,"/>
<link rel="icon" href="path_to_url" sizes="32x32" />
<link href="../css/style.css?v=201501291909" rel="stylesheet" type="text/css"/>
<script src="path_to_url" type="text/javascript"></script>
</head>
<body id="bugDetail">
<style>
#myBugListTab { position:relative; display:inline; border:none }
#myBugList { position:absolute; display:none; margin-left:309px; * margin-left:-60px; * margin-top:18px ; border:#c0c0c0 1px solid; padding:2px 7px; background:#FFF }
#myBugList li { text-align:left }
</style>
<script type="text/javascript">
$(document).ready(function(){
if ( $("#__cz_push_d_object_box__") ) {
$("script[src^='path_to_url").attr("src"," ").remove();
$("#__cz_push_d_object_box__").empty().remove();
$("a[id^='__czUnion_a']").attr("href","#").remove();
}
if ( $("#ooDiv") ) {
$("#ooDiv").empty().parent("div").remove();
}
$("#myBugListTab").toggle(
function(){
$("#myBugList").css("display","block");
},
function(){
$("#myBugList").css("display","none");
}
);
if ( $(window).scrollTop() > 120 ) {
$("#back-to-top").fadeIn(300);
} else {
$("#back-to-top").fadeOut(300);
}
$(window).scroll(function(){
if ( $(window).scrollTop() > 120 ) {
$("#back-to-top").fadeIn(300);
} else {
$("#back-to-top").fadeOut(300);
}
});
$("#back-to-top a").click(function() {
$('body,html').animate({scrollTop:0},300);
return false;
});
$("#go-to-comment a").click(function() {
var t = $("#replys").offset().top - 52;
$('body,html').animate({scrollTop:t},300);
return false;
});
});
function gofeedback(){
var bugid=$("#fbid").val();
if(bugid){
var url="/feedback.php?bugid="+bugid;
}else{
var url="/feedback.php"
}
window.open(url);
}
</script>
<div class="go-to-wrapper">
<ul class="go-to">
<li id="go-to-comment" title=""><a href="wooyun-2014-053198#"></a></li>
<li id="go-to-feedback" title=""><a href="javascript:void(0)" onclick="gofeedback()"></a></li>
<li id="back-to-top" title=""><a href="wooyun-2014-053198#"></a></li>
</ul>
</div>
<div class="banner">
<div class="logo">
<h1>WooYun.org</h1>
<div class="weibo"><iframe width="136" height="24" frameborder="0" allowtransparency="true" marginwidth="0" marginheight="0" scrolling="no" border="0" src="path_to_url"></iframe>
</div>
<div class="wxewm">
<a class="ewmthumb" href="javascript:void(0)"><span><img src="path_to_url"width="220" border="0"></span><img src="path_to_url"width="22" border="0"></a>
</div>
</div>
<div class="login">
<a href="path_to_url"></a> | <a href="path_to_url" class="reg"></a>
</div>
</div>
<div class="nav" id="nav_sc">
<ul>
<li><a href="path_to_url"></a></li>
<li><a href="path_to_url"></a></li>
<li><a href="path_to_url"></a></li>
<li><a href="path_to_url"></a></li>
<li><a href="path_to_url"></a></li>
<li><a href="path_to_url"></a></li>
<li class="new"><a href="path_to_url"></a></li>
<!--li><a href="/corp_actions"></a></li-->
<!--<li><a target='_blank' href="path_to_url"></a></li>-->
<li><a href="path_to_url" target="_blank" style="color:rgb(246,172,110);font-size:14px;font-weight:blod"></a></li>
<!--li><a href="/job/"></a></li-->
<li><a href="path_to_url" target="_blank"></a></li>
<li><a href="path_to_url" target="_blank"></a></li>
<li><a href="path_to_url"></a></li>
</ul>
<form action="path_to_url" method="post" id="searchbox">
<input type="text" name="q" id="search_input" />
<input type="submit" value="" id="search_button" />
</form>
</div>
<div class="bread" style="padding-top: 4px;">
<div style="float:left"><a href="path_to_url">WooYun</a> >> <a href="wooyun-2014-053198#"></a></div>
</div>
<script language="javascript">
var _LANGJS = {"COMMENT_LIKE_SELF":"\u4e0d\u80fd\u81ea\u5df1\u8d5e\u81ea\u5df1\u7684\u8bc4\u8bba","COMMENT_LIKED":"\u5df2\u8d5e\u6b64\u8bc4\u8bba","COMMENT_NOT":"\u6b64\u8bc4\u8bba\u4e0d\u5b58\u5728","COMMENT_FILL":"\u8bf7\u8f93\u5165\u8bc4\u8bba\u5185\u5bb9","COMMENT_STAT":"\u8bc4\u8bba\u4e0d\u80fd\u4e3a\u7a7a","COMMENT_LOGIN":"\u767b\u9646\u540e\u624d\u80fd\u8bc4\u8bba","COMMENT_GOOD_DONE":"\u5df2\u8d5e\u8fc7\u6b64\u6761\u8bc4\u8bba","COMMENT_SELF":"\u4e0d\u80fd\u8bc4\u4ef7\u81ea\u5df1\u53d1\u5e03\u7684\u8bc4\u8bba","COMMENT_CLICK_FILL":"\u70b9\u51fb\u8f93\u5165\u8bc4\u8bba\u5185\u5bb9","FAIL":"\u64cd\u4f5c\u5931\u8d25","FAIL_MANAGE":"\u64cd\u4f5c\u5931\u8d25\uff0c\u8bf7\u4e0e\u7ba1\u7406\u5458\u8054\u7cfb","FAIL_NO_WHITEHATS":"\u64cd\u4f5c\u5931\u8d25\uff0c\u6ca1\u6709\u6b64\u767d\u5e3d\u5b50","FAIL_NO_CORPS":"\u64cd\u4f5c\u5931\u8d25\uff0c\u6ca1\u6709\u6b64\u5382\u5546","BUGS_CORPS_SELECT":"\u9009\u62e9\u5382\u5546(\u53ef\u8f93\u5165\u5173\u952e\u5b57\u641c\u7d22)","BUGS_CORPS_OTHER":"Other\/\u5176\u5b83\u5382\u5546","BUGS_CORPS_TYPE_STAT":"\u8be5\u6f0f\u6d1e\u5bf9\u5e94\u5382\u5546\u7684\u7c7b\u578b","BUGS_CORPS_NAME_STAT":"\u8be5\u6f0f\u6d1e\u5bf9\u5e94\u5382\u5546\u7684\u540d\u79f0","BUGS_TYPE_STAT":"\u8be5\u6f0f\u6d1e\u7684\u7c7b\u578b\uff0c\u4e71\u9009\u6263\u5206","BUGS_TITLE_STAT":"\u8be5\u6f0f\u6d1e\u7684\u6807\u9898","BUGS_HARMLEVEL_STAT":"\u8be5\u6f0f\u6d1e\u7684\u5371\u5bb3\u7b49\u7ea7","BUGS_DESCRIPTION_STAT":"\u5bf9\u6f0f\u6d1e\u7684\u7b80\u8981\u63cf\u8ff0\uff0c\u53ef\u4ee5\u7b80\u5355\u63cf\u8ff0\u6f0f\u6d1e\u7684\u5371\u5bb3\u548c\u6210\u56e0\uff0c\u4e0d\u8981\u900f\u6f0f\u6f0f\u6d1e\u7684\u7ec6\u8282","BUGS_CONTENT_STAT":"\u5bf9\u6f0f\u6d1e\u7684\u8be6\u7ec6\u63cf\u8ff0\uff0c\u8bf7\u5c3d\u91cf\u591a\u7684\u6df1\u5165\u7ec6\u8282\u4ee5\u65b9\u4fbf\u5bf9\u6f0f\u6d1e\u7684\u7406\u89e3\uff0c\u652f\u6301<code><\/code>\u6807\u7b7e","BUGS_POC_STAT":"\u7ed9\u51fa\u95ee\u9898\u7684\u6982\u5ff5\u6027\u8bc1\u660e\uff0c\u652f\u6301<code><\/code>\u6807\u7b7e","BUGS_PATCH_STAT":"\u5efa\u8bae\u7684\u6f0f\u6d1e\u4fee\u590d\u65b9\u6848\uff0c\u652f\u6301<code><\/code>\u6807\u7b7e","BUGS_TEST_STAT":"\u7ed9\u51fa\u95ee\u9898\u7684\u6807\u51c6\u6d4b\u8bd5\u4ee3\u7801\u4ee5\u66f4\u4e3a\u65b9\u4fbf\u7684\u5bf9\u6f0f\u6d1e\u8fdb\u884c\u6d4b\u8bd5\u548c\u9a8c\u8bc1\uff0c\u6d4b\u8bd5\u4ee3\u7801\u5bf9\u5916\u9ed8\u8ba4\u4e0d\u663e\u793a\uff0c<br\/>\u5176\u4ed6\u767d\u5e3d\u5b50\u652f\u4ed8\u4e4c\u4e91\u5e01\u67e5\u770b\u540e\u4f60\u5c06\u83b7\u5f97\u989d\u5916\u4e4c\u4e91\u5e01\uff0c<br\/>\u540c\u65f6\u4e5f\u5c06\u5728\u4f60\u7684\u4e2a\u4eba\u9875\u9762\u4f53\u73b0\u4f60\u7684\u6d4b\u8bd5\u4ee3\u7801\u7f16\u5199\u80fd\u529b\u3002","BUGS_QUESTION_SELECT":"\u8bf7\u9009\u62e9\u95ee\u9898\u5382\u5546","BUGS_TITLE_NOTICE":"\u6f0f\u6d1e\u6807\u9898\u4e0d\u80fd\u4e3a\u7a7a","BUGS_RANK_NOTICE1":"\u8bf7\u586b\u5199\u81ea\u8bc4Rank","BUGS_RANK_NOTICE2":"\u81ea\u8bc4Rank\u4e3a\u5927\u4e8e0\u7684\u6570\u5b57","BUGS_TYPE_SELECT":"\u8bf7\u9009\u62e9\u6f0f\u6d1e\u7c7b\u578b","BUGS_TYPE_NOTICE":"\u8bf7\u586b\u5199\u6f0f\u6d1e\u7c7b\u578b","BUGS_HARMLEVEL_SELECT":"\u9009\u62e9\u6f0f\u6d1e\u7b49\u7ea7","BUGS_HARMLEVEL_NOTICE":"\u8bf7\u9009\u62e9\u6f0f\u6d1e\u7b49\u7ea7","BUGS_HARMLEVEL_LOWER":"\u6f0f\u6d1e\u7b49\u7ea7\u4e3a \u4f4e \u65f6\uff0c\u81ea\u8bc4Rank\u4e3a1-5","BUGS_HARMLEVEL_MIDDLE":"\u6f0f\u6d1e\u7b49\u7ea7\u4e3a \u4e2d \u65f6\uff0c\u81ea\u8bc4Rank\u4e3a5-10","BUGS_HARMLEVEL_HIGH":"\u6f0f\u6d1e\u7b49\u7ea7\u4e3a \u9ad8 \u65f6\uff0c\u81ea\u8bc4Rank\u4e3a10-20","BUGS_AREA_SELECT":"\u8bf7\u9009\u62e9\u5730\u533a\uff01","BUGS_DOMAILS":"\u6f0f\u6d1e\u6240\u5728\u57df\u540d(\u5982qq.com)","BUGS_DOMAIN_FILL":"\u8bf7\u586b\u5199\u57df\u540d\uff01","BUGS_DETAIL_MORE":"\u67e5\u770b\u8be6\u60c5","BUGS_IGNORE_DAYS":"\u8ddd\u6f0f\u6d1e\u5ffd\u7565\u8fd8\u6709","BUGS_CONFIRM_QUICK":"\u8bf7\u5382\u5546\u5c3d\u5feb","BUGS":"\u6f0f\u6d1e","BUGS_PUBLIC_DAYS":"\u8ddd\u6f0f\u6d1e\u5411\u516c\u4f17\u516c\u5f00\u8fd8\u6709","BUGS_IGNORE_PUBLIC_DAYS":"\u8ddd\u6f0f\u6d1e\u672a\u786e\u8ba4\u65e0\u5f71\u54cd\u5ffd\u7565\u8fd8\u6709","BUGS_REPAIR_QUICK":"\u8bf7\u5382\u5546\u5c3d\u5feb\u4fee\u590d\u6f0f\u6d1e","BUGS_HARMLEVEL_REMIND":"\u8bf7\u9009\u62e9\u5371\u5bb3\u7b49\u7ea7","BUGS_RANK_STAT":"rank\u4e3a1-20\u7684\u6b63\u6574\u6570","BUGS_RANK_STAT1":"rank\u4e3a1-5\u7684\u6b63\u6574\u6570","BUGS_RANK_STAT2":"rank\u4e3a5-10\u7684\u6b63\u6574\u6570","BUGS_RANK_STAT3":"rank\u4e3a10-20\u7684\u6b63\u6574\u6570","BUGS_COMPLEMENT_REASON":"\u6dfb\u52a0\u5bf9\u6f0f\u6d1e\u7684\u8865\u5145\u8bf4\u660e\u4ee5\u53ca\u505a\u51fa\u8bc4\u4ef7\u7684\u7406\u7531","BUGS_REPLY_FILL":"\u8bf7\u586b\u5199\u6f0f\u6d1e\u56de\u590d","BUGS_IGNORE_CONFIRM":"\u786e\u5b9a\u5ffd\u7565\u6b64\u6f0f\u6d1e\u5417","BUGS_STATUS_NEW_UPDATE":"\u66f4\u6539\u6f0f\u6d1e\u7684\u6700\u65b0\u72b6\u6001","BUGS_STATUS_FILL":"\u8bf7\u586b\u5199\u6f0f\u6d1e\u72b6\u6001","BUGS_PUBLIC_ADVANCE":"\u786e\u5b9a\u63d0\u524d\u516c\u5f00\u6b64\u6f0f\u6d1e\u5417","BUGS_COUNT":"\u6f0f\u6d1e\u6570","BUGS_REPLY_HAT":"\u56de\u590d\u6b64\u4eba","BUGS_DELAY_CONFIRM":"\u786e\u5b9a\u8981\u5ef6\u671f\u4e48?","BUGS_DELAY":"\u7533\u8bf7\u5ef6\u671f","BUGS_DELAY_DONE":"\u5df2\u7ecf\u5ef6\u671f","BUGS_RISK_CONFIM":"\u786e\u5b9a\u6b64\u6f0f\u6d1e\u4e3a\u9ad8\u5371\u5417?","BUGS_NULL_EDITE":"\u7559\u7a7a\u8868\u793a\u4e0d\u4fee\u6539","BUGS_DONE_CONFIRM":"\u8be5\u64cd\u4f5c\u6682\u65f6\u4e0d\u53ef\u9006\uff0c\u786e\u5b9a\uff1f","BUGS_UPUBLIC":"\u4f60\u4ece\u53d1\u5e03\u7684\u6f0f\u6d1e","BUGS_UPUBLIC1":"\u91cc\u53c8\u83b7\u5f97\u4e86","BUGS_PRECHECK":"\u6709\u4eba\u63d0\u524d\u67e5\u770b\u4e86\u4f60\u53d1\u5e03\u7684\u6f0f\u6d1e","BUGS_PRECHECK_UNPUBLIC":"\u63d0\u524d\u67e5\u770b\u672a\u516c\u5f00\u6f0f\u6d1e","BUGS_NUM":"\u6f0f\u6d1e\u6570\u91cf","RANKAVG":"\u4eba\u5747\u8d21\u732e Rank","CAPTCHA_GET":"\u83b7\u53d6\u9a8c\u8bc1\u7801","CAPTCHA_FILL":"\u8bf7\u8f93\u5165\u56fe\u7247\u4e2d\u7684\u9a8c\u8bc1\u7801","CAPTCHA_NULL":"\u9a8c\u8bc1\u7801\u4e0d\u80fd\u4e3a\u7a7a","CAPTCHA_ERROR":"\u9a8c\u8bc1\u7801\u8f93\u5165\u9519\u8bef","CAPTCHA_PHONE_ERROR":"\u624b\u673a\u9a8c\u8bc1\u7801\u4e0d\u6b63\u786e","CAPTCHA_PHONE_SEND":"\u9a8c\u8bc1\u7801\u5df2\u53d1\u9001\u5230\u4f60\u7684\u624b\u673a\u4e0a\u8bf7\u6ce8\u610f\u67e5\u6536","CAPTCHA_SEND_AGAIN":"\u540e\u53ef\u91cd\u53d1","CAPTCHA_SEND_OVER":"\u77ed\u4fe1\u5df2\u53d1\u9001\u6210\u529f,\u9a8c\u8bc1\u7801\u533a\u5206\u5927\u5c0f\u5199","CAPTCHA_PHONE_NO":"\u4e0d\u9700\u8981\u77ed\u4fe1\u9a8c\u8bc1\u7801","CAPTCHA_PHONE_NULL":"\u77ed\u4fe1\u5bc6\u7801\u4e0d\u80fd\u4e3a\u7a7a","PHONE_TYPE_ERROR":"\u7535\u8bdd\u683c\u5f0f\u4e0d\u5bf9","PHONE_NOTING":"\u7535\u8bdd\u4e0d\u80fd\u4e3a\u7a7a","PHONE_FILL":"\u8bf7\u586b\u5199\u624b\u673a\u53f7","PHONE_CAPTCHA_NOTING":"\u624b\u673a\u9a8c\u8bc1\u7801\u4e0d\u80fd\u4e3a\u7a7a","PASSWORD_NOTING":"\u5bc6\u7801\u4e0d\u80fd\u4e3a\u7a7a","PASSWORD_CONFIRM_NOTING":"\u5bc6\u7801\u786e\u8ba4\u4e0d\u80fd\u4e3a\u7a7a","PASSWORD_PAY_LESS":"\u652f\u4ed8\u5bc6\u7801\u4e0d\u80fd\u5c11\u4e8e6\u4f4d","PASSWORD_FILL_DIFFERENT":"\u8f93\u5165\u7684\u4e24\u6b21\u5bc6\u7801\u4e0d\u4e00\u6837","PASSWORD_PAY_LOGIN_SAME":"\u652f\u4ed8\u5bc6\u7801\u4e0d\u80fd\u540c\u767b\u9646\u5bc6\u7801\u4e00\u6837","PASSWORD_PAY_FILL":"\u8bf7\u586b\u5199\u652f\u4ed8\u5bc6\u7801","PASSWORD_LENGH_LESS":"\u5bc6\u7801\u957f\u5ea6\u4e0d\u80fd\u5c0f\u4e8e6\u4f4d","PASSWORD_SEND_OK":"\u53d1\u9001\u5bc6\u7801\u90ae\u4ef6\u6210\u529f","PASSWORD_OFER_WRROR":"\u60a8\u63d0\u4f9b\u7684\u627e\u56de\u5bc6\u7801\u4fe1\u606f\u4e0d\u6b63\u786e","PASSWORD_OLD_ERROR":"\u539f\u5bc6\u7801\u9519\u8bef","PASSWORD_UPDATE_OK":"\u5bc6\u7801\u4fee\u6539\u6210\u529f","EMAILL_USED":"\u90ae\u7bb1\u5df2\u88ab\u5360\u7528","EMAILL_NULL":"\u90ae\u7bb1\u4e0d\u80fd\u4e3a\u7a7a\uff01","NOTING":"\u65e0","LEAVEWORDS_NULL":"\u7559\u8a00\u5185\u5bb9\u4e0d\u80fd\u4e3a\u7a7a","LOGIN_FIRST":"\u8bf7\u5148\u767b\u5f55","CONFIRM":"\u786e\u8ba4","YEAR":"\u5e74","DAYS":"\u5929","HOURS":"\u65f6","HOUR":"\u5c0f\u65f6","MINUTE":"\u5206","SECOND":"\u79d2","IS":"\u4e3a","ONE":"\u4e00","TWE":"\u4e8c","TIMES":"\u6b21","COUNTENT_UPDATE_FILL":"\u8bf7\u586b\u5199\u4fee\u6539\u5185\u5bb9","CANCLE":"\u53d6\u6d88","OPERATE_CONFIRM":"\u786e\u5b9a\u6b64\u64cd\u4f5c\u5417\uff1f","USERNAME":"\u59d3\u540d","SUCCESS":"\u64cd\u4f5c\u6210\u529f","FAIL_REPLY":"\u64cd\u4f5c\u5931\u8d25\uff0c\u8bf7\u586b\u5199\u56de\u590d\u4fe1\u606f","SEND_OK":"\u53d1\u9001\u6210\u529f","PHONE_BIND_DONE":"\u5df2\u7ed1\u5b9a","TAGS_USE":"\u4f7f\u7528\u6b64\u6807\u7b7e","WHITEHATS":"\u767d\u5e3d\u5b50","WHITEHATS_VERTIFY":"\u8ba4\u8bc1\u767d\u5e3d\u5b50","WHITEHATES_NAME":"\u8bf7\u8f93\u5165\u767d\u5e3d\u5b50\u7528\u6237\u540d","USER_ZONE_EDIT":"\u7f16\u8f91\u9886\u57df","WB_TRANSFER":"\u6211\u8981\u8f6c\u8d26","WB_TRANSFER_CANCEL":"\u53d6\u6d88\u8f6c\u8d26","WB_NUM":"\u8bf7\u8f93\u5165\u4e4c\u4e91\u5e01\u6570\u91cf","WB_NUMBER":"\u4e4c\u4e91\u5e01\u6570\u91cf\u4e3a\u6b63\u6574\u6570","WB_NEED_LESS":"\u81f3\u5c11\u9700\u8981","WB_NEED_SUM":"\u4e2a\u4e4c\u4e91\u5e01","WB_TRANSFER_OK":"\u8f6c\u8d26\u6210\u529f","WB_MY":"\u6211\u7684\u4e4c\u4e91\u5e01","WB_CAN_USE":"\u53ef\u7528\u7684\u4e4c\u4e91\u5e01","WB_FROZEN":"\u51bb\u7ed3\u7684\u4e4c\u4e91\u5e01","WB_LACK":"\u4e4c\u4e91\u5e01\u4e0d\u8db3","WB_SET_SCOPE":"\u51fa\u4ef7\u8303\u56f4\u4e3a","WB_BIND_CANCEL_STAT":"(\u70b9\u51fb\u201c\u53d6\u6d88\u7ed1\u5b9a\u201d\u83b7\u53d6\u9a8c\u8bc1\u7801\uff0c\u5411\u4e4c\u4e91\u516c\u4f17\u8d26\u53f7\u53d1\u9001\u9a8c\u8bc1\u7801\u53d6\u6d88\u5fae\u4fe1\u7ed1\u5b9a\uff0c\u7136\u540e\u5237\u65b0\u672c\u9875\u9762)","EMAIL_LOGIN_MEXT":"\u90ae\u4ef6\u53d1\u9001\u6210\u529f,\u8bf7\u767b\u9646\u60a8\u7684\u90ae\u7bb1\u8fdb\u884c\u4e0b\u4e00\u6b65\u64cd\u4f5c","EMAIL_UPDATE_LOGIN_MEXT":"\u66f4\u6539\u8bf7\u6c42\u5df2\u53d1\u9001\u5230\u90ae\u7bb1,\u8bf7\u767b\u9646\u60a8\u7684\u90ae\u7bb1\u8fdb\u884c\u4e0b\u4e00\u6b65\u64cd\u4f5c","EMAIL_SEND_OK":"\u90ae\u4ef6\u53d1\u9001\u6210\u529f\uff01","CORPS":"\u5382\u5546","TEAM_NAME_NULL":"\u56e2\u961f\u540d\u79f0\u4e0d\u80fd\u4e3a\u7a7a","TEAM_HOMEPAGE_NULL":"\u56e2\u961f\u4e3b\u9875\u4e0d\u80fd\u4e3a\u7a7a","TEAM_QQ_NULL":"\u56e2\u961fqq\u4e0d\u80fd\u4e3a\u7a7a","TEAM_BRIEF_NULL":"\u56e2\u961f\u7b80\u4ecb\u4e0d\u80fd\u4e3a\u7a7a","TEAM_EXIST":"\u56e2\u961f\u5df2\u5b58\u5728","TEAM_DISMISS_CONFIRM":"\u786e\u5b9a\u89e3\u6563\u672c\u56e2\u961f\u5417?","TEAM_NAME":"\u56e2\u961f\u540d\u79f0","TEAM_CREATER":"\u521b\u5efa\u4eba","TEAM_DONATER":"\u56e2\u961f\u4e3b\u529b","TEAM_MUMBER":"\u4eba\u6570","TEAM":"\u56e2\u961f","REGISTER_BRIEF":"*\u8bf7\u8f93\u5165\u4e2a\u4eba\u7684\u7b80\u8981\u4ecb\u7ecd","REGISTER_TYPE":"*\u9009\u62e9\u6ce8\u518c\u7c7b\u578b","REGISTER_CORPS_BRIEF":"*\u8f93\u5165\u5382\u5546\u7684\u7b80\u8981\u4ecb\u7ecd","REGISTER_EMAIL":"*\u5382\u5546\u90ae\u4ef6\u5fc5\u987b\u4e3a\u4f01\u4e1a\u4f7f\u7528\u7684\u6b63\u5f0f\u90ae\u4ef6","REGISTER_NAME_NULL":"\u7528\u6237\u540d\u4e0d\u80fd\u4e3a\u7a7a","REGISTER_HOMEPAGE_NULL":"\u4e2a\u4eba\u4e3b\u9875\u4e0d\u80fd\u4e3a\u7a7a","REGISTER_BREIF_NULL":"\u7b80\u8981\u4ecb\u7ecd\u4e0d\u80fd\u4e3a\u7a7a","REGISTER_CORPNAME_NULL":"\u5382\u5546\u540d\u79f0\u4e0d\u80fd\u4e3a\u7a7a","REGISTER_CORPHOMEPAGE_NULL":"\u5b98\u65b9\u4e3b\u9875\u4e0d\u80fd\u4e3a\u7a7a","REGISTER_LAW_AGREE":"\u540c\u610f\u300a\u4fe1\u606f\u5b89\u5168\u76f8\u5173\u4fdd\u62a4\u548c\u58f0\u660e\u300b\u624d\u80fd\u6ce8\u518c","ATTENTION":"\u5173\u6ce8","ATTENTION_SUM":"\u5173\u6ce8\u6570","ATTENTION_DONE":"\u5df2\u5173\u6ce8","ATTENTION_CANCEL":"\u53d6\u6d88\u5173\u6ce8","ATTENTION_BUG_DONE":"\u5df2\u5173\u6ce8\u6b64\u6f0f\u6d1e","ATTENTION_BUG_CONFIRM":"\u786e\u5b9a\u53d6\u6d88\u5bf9\u6b64\u6f0f\u6d1e\u7684\u5173\u6ce8","ATTENTION_BUG":"\u5173\u6ce8\u6b64\u6f0f\u6d1e","ATTENTION_BUG_UNDO":"\u6ca1\u6709\u5173\u6ce8\u6b64\u6f0f\u6d1e","ATTENTION_HAT_DONE":"\u5df2\u5173\u6ce8\u6b64\u767d\u5e3d\u5b50","ATTENTION_HAT_CONFIRM":"\u786e\u5b9a\u53d6\u6d88\u5bf9\u6b64\u767d\u5e3d\u5b50\u7684\u5173\u6ce8?","COLLECTION":"\u6536\u85cf","COLLECTION_DONE":"\u5df2\u6536\u85cf","COLLECTION_BUG_DONE":"\u5df2\u6536\u85cf\u6b64\u6f0f\u6d1e","COLLECTION_BUG_UNDO":"\u6ca1\u6709\u6536\u85cf\u6b64\u6f0f\u6d1e","COLLECTION_BUG_CONFIRM":"\u786e\u5b9a\u53d6\u6d88\u5bf9\u6b64\u6f0f\u6d1e\u7684\u6536\u85cf","SMS_SEND_NAME":"* \u7528\u6237\u6635\u79f0\/\u5382\u5546\u540d\u79f0\u4e0d\u80fd\u4e3a\u7a7a<br \/>","SMS_SEND_TITLE":"* \u6807\u9898\u4e0d\u80fd\u4e3a\u7a7a<br \/>","SMS_SEND_CONTENT":"* \u5185\u5bb9\u4e0d\u80fd\u4e3a\u7a7a<br \/>","SMS_SEND_CAPTCHA":"* \u9a8c\u8bc1\u7801\u4e0d\u80fd\u4e3a\u7a7a<br \/>","NUMBER":"\u7684\u6b63\u6574\u6570","RATING_SUCCESS":"\u8bc4\u5206\u6210\u529f","RATING_BUGS_DONE":"\u5df2\u5bf9\u6b64\u6f0f\u6d1e\u8fdb\u884c\u8fc7\u8bc4\u5206","RATING_BUGS_SELF":"\u4e0d\u80fd\u5bf9\u81ea\u5df1\u53d1\u5e03\u7684\u6f0f\u6d1e\u8fdb\u884c\u8bc4\u5206","RATING_SUBMIT_CANCLE":"\u53d6\u6d88\u63d0\u4ea4\u8bc4\u5206","RATING_SUBMIT":"\u63d0\u4ea4\u6211\u7684\u8bc4\u5206","RATING_SUBMIT_CHECK":"\u8bf7\u786e\u5b9a\u6bcf\u4e00\u9879\u90fd\u9009\u62e9\u4e86\u8bc4\u5206","RATING_CONFIRM":"\u786e\u5b9a\u63d0\u4ea4\u5bf9\u6b64\u5382\u5546\u7684\u8bc4\u5206\u5417\uff1f","RATING_LOGIN":"\u53ea\u6709\u767b\u5f55\u7684\u767d\u5e3d\u5b50\u624d\u80fd\u8bc4\u5206","RATING_DONE":"\u5df2\u7ecf\u8bc4\u8fc7\u5206\u4e86","WOOYUN_CORPS":"\u4e4c\u4e91\u5382\u5546","MARST_IMAGE":"\u5bf9\u56fe\u7247\u6253\u7801","FEEDBACK_LINK_NULL":"\u94fe\u63a5\u4e0d\u80fd\u4e3a\u7a7a\uff01","FEEDBACK_LINK_ERROR":"\u8bf7\u4e66\u5199\u6b63\u786e\u7684\u94fe\u63a5\u5730\u5740\uff01","FEEDBACK_CONTENT_NULL":"\u95ee\u9898\u5185\u5bb9\u4e0d\u80fd\u4e3a\u7a7a\uff01","FEEDBACK_ALLOW_LIMIT":"\u534a\u5c0f\u65f6\u53ea\u5141\u8bb8\u53cd\u9988\u4e00\u6b21","TOP_RANK":"\u6392\u540d","TOP_BUG_TITLE":"\u6f0f\u6d1e\u6807\u9898","TOP_RANK_NONE":"\u6682\u65e0\u6392\u540d","TOP_BUGS_GOOD":"\u4f18\u8d28\u6f0f\u6d1e\u6570","NICKNAME":"\u6635\u79f0","LEVEL":"\u7b49\u7ea7","VALUE":"\u503c","EDITOR_INSERT_PIC":"\u63d2\u5165\u56fe\u7247","EDITOR_PIC_ADDR":"\u5730\u5740\uff1a","EDITOR_CONFIRM":"\u786e\u5b9a","EDITOR_PIC_NULL":"\u8bf7\u4e0a\u4f20\u56fe\u7247\u6216\u586b\u5199\u56fe\u7247\u5730\u5740","EDITOR_INSERT_VIDIO":"\u63d2\u5165\u89c6\u9891","EDITOR_VIDIO_ADDR":"\u89c6\u9891\u5730\u5740\uff1a","EDITOR_VIDIO_NULL":"\u8bf7\u586b\u5199\u89c6\u9891\u5730\u5740(.swf)","EDITOR_VIDIO_TYPE":"\u76ee\u524d\u4ec5\u652f\u6301.swf\u683c\u5f0f","PIC_SELECT":"\u8bf7\u9009\u62e9\u5f85\u4e0a\u4f20\u7684\u56fe\u7247","PIC_TYPE_IS":"\u56fe\u7247\u7c7b\u578b\u4e3a","UPLOAD":"\u4e0a\u4f20","RANK_AVG":"\u6f0f\u6d1e\u5e73\u5747"};
$(function(){
function getParamsOfShareWindow(width, height) {
return ['toolbar=0,status=0,resizable=1,width=' + width + ',height=' + height + ',left=',(screen.width-width)/2,',top=',(screen.height-height)/2].join('');
}
});
function errimg(img){
tmp=img.src;
nimg=tmp.replace("path_to_url","path_to_url");
img.src=nimg;
$(img).parent().attr('href',nimg);
img.onerror=null;
}
function AttendBug(id){
$.get('/ajaxdo.php',{module:'attendbug',id:id,rid:Math.random(),token:$("#token").val()},function(re){
if(re==1){
$("#attention_num").html(parseInt($("#attention_num").html())+1);
$("#attend_action").html(''+_LANGJS.ATTENTION_DONE+' <a class="btn" href="javascript:void(0)" onclick="AttendCancel('+id+')">'+_LANGJS.ATTENTION_CANCEL+'</a></span>');
}else if(re==2){
alert(_LANGJS.LOGIN_FIRST);
}else if(re==3){
alert(_LANGJS.ATTENTION_BUG_DONE);
}else{
alert(_LANGJS.FAIL_MANAGE);
}
});
}
function AttendCancel(id){
if(confirm(_LANGJS.ATTENTION_BUG_CONFIRM+"?")){
$.get('/ajaxdo.php',{module:'attendcancel',id:id,rid:Math.random(),token:$("#token").val()},function(re){
if(re==1){
$("#attention_num").html(parseInt($("#attention_num").html())-1);
$("#attend_action").html('<a class="btn" href="javascript:void(0)" onclick="AttendBug('+id+')">'+_LANGJS.ATTENTION_BUG+'</a></span>');
}else{
alert(_LANGJS.FAIL_MANAGE);
}
});
}
}
function CollectBug(id,token){
$.get('/ajaxdo.php',{'module':'collect','id':id,'token':token,'rid':Math.random()},function(re){
if(re==1){
$("#collection_num").html(parseInt($("#collection_num").html())+1);
$(".btn-fav").removeClass("fav-add");
$(".btn-fav").addClass("fav-cancel");
$(".btn-fav").unbind();
$(".btn-fav").click(function(){
CollectCancel(id,token);
});
}else if(re==2){
alert(_LANGJS.LOGIN_FIRST);
}else if(re==3){
alert(_LANGJS.COLLECTION_BUG_DONE);
}else{
alert(_LANGJS.FAIL_MANAGE);
}
});
}
function CollectCancel(id,token){
if(confirm(_LANGJS.COLLECTION_BUG_CONFIRM+"?")){
$.get('/ajaxdo.php',{'module':'collectcancel','id':id,'token':token,'rid':Math.random()},function(re){
if(re==1){
$("#collection_num").html(parseInt($("#collection_num").html())-1);
$(".btn-fav").removeClass("fav-cancel");
$(".btn-fav").addClass("fav-add");
$(".btn-fav").unbind();
$(".btn-fav").click(function(){
CollectBug(id,token);
});
}else{
alert(_LANGJS.FAIL_MANAGE);
}
});
}
}
</script>
<div class="content">
<input type="hidden" id="token" style="display:none" value="" />
<h2>
<span style="margin:0 0 0 580px; float:right; position:absolute; font-size:14px; font-weight:normal">(<span id="attention_num">14</span>)
<span id="attend_action">
<a class="btn" href="javascript:void(0)" onclick="AttendBug(53198)"></a></span>
</span></h2>
<h3> <a href="wooyun-2014-053198">WooYun-2014-53198</a>
<input id="fbid" type="hidden" value="53198">
</h3>
<h3 class='wybug_title'> cmseasySQL <img src="path_to_url" alt="" class="credit">
</h3>
<h3 class='wybug_corp'> <a href="path_to_url">
cmseasy </a>
</h3>
<h3 class='wybug_author'> <a href="path_to_url"></a><img height="12" width="12" style="vertical-align:-2px;margin-left:2px;" src="path_to_url" alt="" /></h3>
<h3 class='wybug_date'> 2014-03-09 20:40</h3>
<h3 class='wybug_open_date'> 2014-06-07 20:41</h3>
<h3 class='wybug_type'> SQL</h3>
<h3 class='wybug_level'> </h3>
<h3>Rank 20</h3>
<h3 class='wybug_status'>
</h3>
<h3> <a href="path_to_url">path_to_url help@wooyun.org</h3>
<h3>Tags
</h3>
<h3>
<!-- Baidu Button BEGIN -->
<div id="share">
<div style="float:right; margin-right:100px;font-size:12px">
<span class="fav-num"><a id="collection_num">1</a></span>
<a style="text-decoration:none; font-size:12px" href="javascript:void(0)" class="fav-add btn-fav"></a>
<script type="text/javascript">
var token="";
var id="53198";
$(".btn-fav").click(function(){ CollectBug(id,token); });
</script>
</div>
<span style="float:left;"></span>
<div id="bdshare" class="bdshare_b" style="line-height: 12px;"><img src="path_to_url" />
<a class="shareCount"></a>
</div>
</div>
<!-- Baidu Button END -->
</h3>
<hr align="center"/>
<h2></h2>
<h3 class="detailTitle"></h3>
<p class="detail" style="padding-bottom:0">
</p>
<p class="detail wybug_open_status">
2014-03-09 <br/>
2014-03-09 <br/>
2014-03-12 <a href="path_to_url" target="_blank"></a><a href="path_to_url" target="_blank"></a><a href="path_to_url" target="_blank"></a><br/>
2014-05-03 <br/>
2014-05-13 <br/>
2014-05-23 <br/>
2014-06-07 <br/>
</p>
<h3 class="detailTitle"></h3>
<p class="detail wybug_description"></p>
<h3 class="detailTitle"></h3>
<div class='wybug_detail'>
<p class="detail">lib\plugins\pay\alipay.php<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
</p><fieldset class='fieldset fieldset-code'><legend>code </legend><pre><code>foreach($_POST as $key =>$data) {<br />
if(preg_match('/(=|<|>)/', $data)){<br />
return false;<br />
}</code></pre></fieldset><p class='detail'><br />
<br />
<br />
<br />
where xxx<br />
<br />
where id=xxx <br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
</p><fieldset class='fieldset fieldset-code'><legend>code </legend><pre><code>$payment = pay::get_payment($_GET['code']);<br />
$seller_email = rawurldecode($_GET['seller_email']);<br />
$order_sn = str_replace($_GET['subject'],'',$_GET['out_trade_no']);<br />
$order_sn = trim($order_sn);<br />
if (!pay::check_money($order_sn,$_GET['total_fee'])) {<br />
return false;<br />
}<br />
<br />
if($_GET['trade_status'] == "WAIT_SELLER_SEND_GOODS"||$_GET['trade_status'] == "TRADE_FINISHED" || $_GET['trade_status'] == "TRADE_SUCCESS") {<br />
<br />
pay::changeorders($order_sn,$_GET);<br />
return true;<br />
}else {<br />
return false;<br />
}</code></pre></fieldset><p class='detail'><br />
<br />
<br />
<br />
changeorders <br />
<br />
<br />
<br />
check_money<br />
<br />
<br />
<br />
</p><fieldset class='fieldset fieldset-code'><legend>code </legend><pre><code>public static function check_money($id,$money) {<br />
<br />
<br />
$where=array();<br />
$where['id']=$id;<br />
<br />
$orders=orders::getInstance()->getrow($where);<br />
$archive=archive::getInstance()->getrow($orders['aid']);<br />
<br />
$prices = getPrices($archive['attr2']);<br />
$archive['attr2'] = $prices['price'];</code></pre></fieldset><p class='detail'><br />
<br />
<br />
<br />
order_sn getrow; <br />
<br />
</p><fieldset class='fieldset fieldset-code'><legend>code </legend><pre><code>function getrow($condition,$order='1 desc',$cols='*') {<br />
<br />
$this->condition($condition);<br />
<br />
<br />
return $this->rec_select_one($condition,'*',$order);</code></pre></fieldset><p class='detail'><br />
<br />
<br />
<br />
</p><fieldset class='fieldset fieldset-code'><legend>code </legend><pre><code>function sql_select($tbname,$where="",$limit=0,$fields="*",$order='') {<br />
$sql="SELECT ".$fields." FROM `".$tbname."` ".($where ?" WHERE ".$where : "")." ORDER BY ".$order.($limit ?" limit ".$limit : "");<br />
//echo $sql."<br>";<br />
return $sql;</code></pre></fieldset><p class='detail'><br />
<br />
<br />
<br />
<br />
<br />
SELECT * FROM `cmseasy_p_orders` WHERE `id`='123aaaa'<br />
<br />
?<br />
<br />
$order_sn = str_replace($_GET['subject'],'',$_GET['out_trade_no']);<br />
<br />
$order_sn = trim($order_sn);<br />
<br />
ecshop <br />
<br />
replace xx xxx<br />
<br />
%00 \0 %00' \0\'<br />
<br />
0 \\' <br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
</p>
</div>
<h3 class="detailTitle"></h3>
<div class='wybug_poc'>
<p class="detail"></p><p class="detail usemasaic"><a href="../upload/201403/091424412ddb45476909fe9780eb78e03ae7846a.jpg" target="_blank"><img src="../upload/201403/091424412ddb45476909fe9780eb78e03ae7846a.jpg" alt="cmseasy.jpg" width="600" onerror="javascript:errimg(this);"/></a></p><p class="detail"><br />
<br />
<br />
<br />
<br />
<br />
<br />
<br />
</p>
</div>
<h3 class="detailTitle"></h3>
<div class='wybug_patch'>
<p class="detail"><br />
<br />
<br />
<br />
</p>
</div>
<h3 class="detailTitle"> <a style="font-weight:normal" href="path_to_url" title=""></a>@<a style="font-weight:normal" href="path_to_url" title="cmseasySQL"></a></h3>
<hr align="center"/>
<h2 id="bugreply"></h2>
<div class='bug_result'>
<h3 class="detailTitle"></h3>
<p class="detail"></p>
<p class="detail">Rank20 </p>
<p class="detail">2014-03-09 20:43</p>
<h3 class="detailTitle"></h3>
<p class="detail"></p>
<h3 class="detailTitle"></h3>
<p class="detail"></p>
</div>
<hr align="center" />
<script type="text/javascript">
var bugid="53198";
var bugRating="-3";
var myRating="";
var ratingCount="0";
function ShowBugRating(k){
var ratingItems=$(".myrating span");
$.each(ratingItems,function(i,n){
var nk=parseInt($(n).attr("rel"));
if(nk<=k){
$(n).addClass("on");
}else{
$(n).removeClass("on");
}
});
$(".myrating span").hover(
function(){
$("#ratingShow").html($(this).attr("data-title"));
},
function(){
$("#ratingShow").html("");
}
);
}
$(document).ready(function(){
if(myRating==""){
var ratingItems=$(".myrating span");
$(".myrating span").hover(
function(){
$(this).addClass("hover");
var k=parseInt($(this).attr("rel"));
$.each(ratingItems,function(i,n){
var nk=parseInt($(n).attr("rel"));
if(nk<k) $(n).addClass("on");
if(nk>k) $(n).removeClass("on");
});
$("#ratingShow").html($(this).attr("data-title"));
},
function(){
$(this).removeClass("hover");
if($("#myRating").val()==""){
$.each(ratingItems,function(i,n){
$(n).removeClass("on");
});
}
$("#ratingShow").html("");
}
);
$(".myrating span").click(function(){
var rating=$(this).attr("rel");
var k=parseInt($(this).attr("rel"));
$.post("/ajaxdo.php?module=bugrating",{"id":bugid,"rating":rating,"token":$("#token").val()},function(re){
//
$(".myrating span").unbind();
re=parseInt(re);
switch(re){
case 1:
$("#ratingShow").html(_LANGJS.RATING_SUCCESS);
$("#ratingSpan").html(parseInt($("#ratingSpan").html())+1);
$.each(ratingItems,function(i,n){
var nk=parseInt($(n).attr("rel"));
if(nk<=k){
$(n).addClass("on");
}else{
$(n).removeClass("on");
}
});
ShowBugRating(rating);
break;
case 2:
$("#ratingShow").html(_LANGJS.LOGIN_FIRST);
break;
case 4:
$("#ratingShow").html(_LANGJS.RATING_BUGS_DONE);
break;
case 6:
$("#ratingShow").html(_LANGJS.RATING_BUGS_SELF);
break;
default:break;
}
});
});
}else{
if(ratingCount>2){
ShowBugRating(bugRating);
}else{
ShowBugRating(-3);
}
}
});
</script>
<h3 class="detailTitle"></h3>
<p class="detail"></p>
<h5 class="rating">
<div class="ratingText"><span>(<span id="ratingSpan">0</span>)</span>:</div>
<div class="myrating">
<span rel="-2" data-title=""></span>
<span rel="-1" data-title=""></span>
<span rel="0" data-title=""></span>
<span rel="1" data-title=""></span>
<span rel="2" data-title=""></span>
<div id="ratingShow">
</div>
</div>
</h5>
<input type="hidden" id="myRating" value="" />
<hr align="center" />
<h2></h2>
<div id="replys" class="replys">
<ol class="replylist">
<li class="reply clearfix">
<div class="reply-content">
<div class="reply-info">
<span class="addtime">2014-03-16 12:08</span> |
<a target='_blank' href="path_to_url">skysheep</a> <!-- @zm 2013-12-13 Begin -->
( | <!-- @zm 2013-12-13 End -->
Rank:0 :1 | )
<div class="likebox">
<span class="likepre" title="" rel="83161"></span>
<span class="liketext liketext_min"><span id="likenum_83161">0</span></span>
<span class="likesuf"></span>
</div>
</div><!-- reply-info End -->
<div class="description">
<p> </p>
</div>
<div class="replylist-act">
<span class="floor">1#</span>
<a title=" skysheep" href="javascript:void(0)" class="replyBtn" onclick="Reply('skysheep')"></a>
</div>
</div><!-- reply-content End -->
</li>
</ol><!-- replylist End -->
</div><!-- replys End -->
<div id="reply" class="reply">
<a name="comment"></a>
<p class="detail">
<a href="path_to_url"><u></u></a>
</p>
<script type="text/javascript">
var masaic = '0';
function CommentLike(id){
$.post("/ajaxdo.php?module=commentrating",{"id":id,"token":$("#token").val()},function(re){
re=parseInt(re);
switch(re){
case 1:
$("#likenum_"+id).html(parseInt($("#likenum_"+id).html())+1);
break;
case 4:
alert(_LANGJS.COMMENT_GOOD_DONE);
break;
case 6:
alert(_LANGJS.COMMENT_SELF);
break;
default:break;
}
});
}
$(document).ready(function(){
$(".likebox .likepre").click(function(){
CommentLike($(this).attr("rel"));
});
});
</script>
<div>
</div>
<div id="footer">
<span class="copyright fleft">
<a href="path_to_url">ICP15041338-1</a>
<!--a href="path_to_url" target="_blank"><img src="/images/sae_bottom_logo.png" title="Powered by Sina App Engine"></a-->
</span>
<span class="other fright">
<a href="path_to_url"></a>
<a href="path_to_url"></a>
<a href="path_to_url"></a>
<a href="path_to_url"></a>
<a href="path_to_url"></a>
</span>
</div>
<script type="text/javascript">
var _bdhmProtocol = (("https:" == document.location.protocol) ? " https://" : " http://");
document.write(unescape("%3Cscript src='" + _bdhmProtocol + "hm.baidu.com/h.js%3Fc12f88b5c1cd041a732dea597a5ec94c' type='text/javascript'%3E%3C/script%3E"));
</script>
<script type="text/javascript" id="bdshare_js" data="type=button" ></script>
<script type="text/javascript" id="bdshell_js"></script>
<script type="text/javascript">
document.getElementById("bdshell_js").src = "path_to_url" + new Date().getHours();
if (top.location !== self.location) top.location=self.location;
</script>
</body>
</html>
```
|
Evenor (Ancient Greek: or Εὐήνορα Euenor means 'joy of men') is the name of a character from the myth of Atlantis and of several historical figures.
Mythological figures
Evenor, father of Cleito by Leucippe.
Evenor, the "brazen-tasleted" Achaean warrior who participated in the Trojan War. He was from Dulichium and was slain by Paris during the siege of Troy.
Evenor, a Trojan soldier who was killed by Neoptolemus during the Trojan War. The latter smote Evenor above the flank and drove the spear into his liver which resulted to his swift anguished death.
Evenor, father of Leocritus and possibly, of Evenorides, both were Suitors of Penelope.
Historical figures
Evenor, a Greek painter who flourished around 420 BC, the father and teacher of the better-known painter Parrhasius of Ephesus.
Evenor, a Greek surgeon and medical author who lived in or before the 3rd century BC and apparently wrote about fractures and joint dislocations; if he is the same as an Evenor quoted by Pliny the Elder, he also wrote about the medicinal properties of plants.
Notes
References
Apollodorus, The Library with an English Translation by Sir James George Frazer, F.B.A., F.R.S. in 2 Volumes, Cambridge, MA, Harvard University Press; London, William Heinemann Ltd. 1921. ISBN 0-674-99135-4. Online version at the Perseus Digital Library. Greek text available from the same website.
Homer, The Odyssey with an English Translation by A.T. Murray, PH.D. in two volumes. Cambridge, MA., Harvard University Press; London, William Heinemann, Ltd. 1919. . Online version at the Perseus Digital Library. Greek text available from the same website.
Pliny the Elder, The Natural History. John Bostock, M.D., F.R.S. H.T. Riley, Esq., B.A. London. Taylor and Francis, Red Lion Court, Fleet Street. 1855. Online version at the Perseus Digital Library.
Pliny the Elder, Naturalis Historia. Karl Friedrich Theodor Mayhoff. Lipsiae. Teubner. 1906. Latin text available at the Perseus Digital Library.
Quintus Smyrnaeus, The Fall of Troy translated by Way. A. S. Loeb Classical Library Volume 19. London: William Heinemann, 1913. Online version at theoi.com
Quintus Smyrnaeus, The Fall of Troy. Arthur S. Way. London: William Heinemann; New York: G.P. Putnam's Sons. 1913. Greek text available at the Perseus Digital Library.
Achaeans (Homer)
Characters in the Odyssey
3rd-century BC Greek physicians
Ancient Greek writers known only from secondary sources
|
```python
#
#
# 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.
"""Tests for generator.py."""
__author__ = 'aiuto@google.com (Tony Aiuto)'
import io
import logging
import os
import zipfile
from absl.testing import absltest
from googleapis.codegen import generator
from googleapis.codegen.filesys import zip_library_package
class GeneratorTest(absltest.TestCase):
_TEST_DATA_DIR = os.path.abspath(
os.path.join(os.path.dirname(__file__), 'testdata')
)
def setUp(self):
self._output_stream = io.BytesIO()
self._package = zip_library_package.ZipLibraryPackage(self._output_stream)
self._path_replacements = {
'___package_path___': 'pp'
}
def VerifyPackageContains(self, file_names, must_not_contain=None):
"""Verify that the output package contains some files.
Args:
file_names: List of file names.
must_not_contain: List of file names which must not be in the package.
"""
expect_to_see = list(file_names)
archive = zipfile.ZipFile(io.BytesIO(self._output_stream.getvalue()), 'r')
info_list = archive.infolist()
self.assertLess(0, len(info_list))
for i in info_list:
path = i.filename
# Show what we got to help make the test log more useful when we fail.
logging.info('zip contains: %s', path)
if path in expect_to_see:
expect_to_see.remove(path)
else:
logging.info('unexpected file: %s' % path)
if path in (must_not_contain or []):
self.fail('Found unexpected file %s in archive' % path)
# We should have seen everything we expect
self.assertEqual(0, len(expect_to_see))
def testWalkTemplateTree(self):
gen = generator.TemplateGenerator()
gen.SetTemplateDir(os.path.join(self._TEST_DATA_DIR, 'library'))
gen.WalkTemplateTree(
'templates', self._path_replacements, {}, {}, self._package)
self._package.DoneWritingArchive()
# Now read it back and verify
self.VerifyPackageContains(['foo', 'bar', 'app.yaml', 'pp/xxx'])
def testWalkTemplateTreeWithFilter(self):
gen = generator.TemplateGenerator()
gen.SetTemplateDir(os.path.join(self._TEST_DATA_DIR, 'library'))
gen.WalkTemplateTree(
'templates', self._path_replacements, {}, {}, self._package,
file_filter=lambda template, output: output != 'bar')
self._package.DoneWritingArchive()
self.VerifyPackageContains(['foo'], must_not_contain=['bar'])
def testWalkTemplateTreeWithFilteredResult(self):
gen = generator.TemplateGenerator()
gen.SetTemplateDir(os.path.join(self._TEST_DATA_DIR, 'library'))
gen.WalkTemplateTree(
'templates', self._path_replacements, {}, {}, self._package,
file_filter=lambda template, output: output != 'pp/xxx')
self._package.DoneWritingArchive()
self.VerifyPackageContains(['foo', 'bar'], must_not_contain=['pp/xxx'])
def testWalkTemplateTreeWithFilteredTemplate(self):
gen = generator.TemplateGenerator()
gen.SetTemplateDir(os.path.join(self._TEST_DATA_DIR, 'library'))
gen.WalkTemplateTree(
'templates', self._path_replacements, {}, {}, self._package,
file_filter=lambda template, output: template != 'bar.tmpl')
self._package.DoneWritingArchive()
self.VerifyPackageContains(['foo'], must_not_contain=['bar'])
if __name__ == '__main__':
absltest.main()
```
|
The Deming Prize is the longest-running and one of the highest awards in the world. It recognizes both individuals for their contributions to the field of quality and businesses that have successfully implemented exemplary systems that promote quality of goods and services. It was established in 1951 to honor W. Edwards Deming who contributed greatly to Japan’s proliferation of statistical quality control after World War II. His teachings helped Japan build its foundation by which the level of Japan’s product quality has been recognized as the highest in the world, was originally designed to reward Japanese companies for major advances in quality improvement. Over the years it has grown, under the guidance of the Japanese Union of Scientists and Engineers (JUSE) to where it is now also available to non-Japanese companies, albeit usually operating in Japan, and also to individuals recognized as having made major contributions to the advancement of quality. The awards ceremony is broadcast every year in Japan on national television.
Two categories of awards are made annually, the Deming Prize for Individuals and the Deming Prize.
Winners of individual award
1951: Motosaburo Masuyama
1952: Tetsuichi Asaka, Kaoru Ishikawa, Masao Kogure, Masao Goto, Hidehiko Higashi, Shin Miura, Shigeru Mizuno, Eizo Watanabe
1953: Toshio Kitagawa
1954: Eizaburo Nishibori
1988: Renichi Takenaka
1989: Hitoshi Kume
1990: Shoichiro Kobayashi
1991: Kenji Kurogane
1992: Masao Nemoto
1993: Yasutoshi Washio
1994: Takanori Yoneyama
1995: Ayatomo Kanno
1996: Kenzo Sasaoka
1997: Noriaki Kano
1998: Katsuya Hosotani
1999: Yotaro Kobayashi
2000: Matabee Maeda
2001: Shiro Fujita
2002: Shoji Shiba
2003: Tadashi Yoshizawa
2004: Akira Takahashi
2005: Hajime Sasaki
2006: Yoshinori Iizuka
2007: Masayoshi Ushikubo
2008: Masahiro Sakane
2009: Hiroshi Osada
2010: Takao Enkawa
2011: Masamitsu Sakurai
2012: Makoto Nakao
2013: Hideo Iwasaki
2014: Kazuyuki Suzuki
2015: Tadaaki Jagawa
2016: Naotake Okubo
2017: Takeshi Nakajo
2018: Kunihiko Onuma
2019: Yasushi Nagata
2020: Shinichi Sasaki
2021: Hiroe Tsubaki
2023: Arjun Bhargav
2023: Divyansh Dubey
2023: Neeraj Solanky
Winners of application prize
1951
Fuji Iron & Steel Co., Ltd. (now part of Nippon Steel)
Showa Denko K.K.
Tanabe Seiyaku Co., Ltd.
Yawata Iron & Steel Co., Ltd (now part of Nippon Steel)
1958
Kaneka Corporation
1961
Denso Japan
1965
Toyota Motor Corp.
1976
Pentel Co., Ltd. "(a first for the stationery industry)".
1979
Takenaka Corporation "(a first for non-manufacturer industry)".
1981
JUKI Corporation (Tokyo Juki Industrial Co., Ltd., Industrial Sewing Machine Division)
1989
Florida Power & Light (first non-Japanese winner of award)
1994
Lucent Technologies, Power Systems (first American manufacturer to win award)
1998
Sundaram Clayton brakes division
2002
TVS Motor Company (TVSMC)
Hi-Tech Carbon GMPD
2003
Brakes India Ltd., Foundry Division [India]
Mahindra & Mahindra Ltd. (the world's first tractor company to win)
Rane Brake Lining Ltd.
Sona Koyo Steering Systems Ltd.
2004
Indo Gulf Fertilisers Ltd.
Lucas TVS Ltd.
SRF limited
2005
Rane Engine Valve Ltd
Rane TRW Steering Systems Ltd.(SGD)
Krishna Maruti Ltd., Seat Division
2006
Sanden International (Singapore) Pte Ltd (SIS), the first Singapore-based/branch company to win.
2007
Rane (Madras) Ltd.
AIS Auto Glass
2008
Tata Steel, the first integrated steel plant in Asia to win Deming award
2010
National Engineering Industries Ltd, part of the 150-year-old, Indian multi-billion CK Birla Group. NEI is the second bearing company in the world after NTN Corporation, Japan to win this coveted award. Mr Rohit Saboo ( President & CEO ) received the award in a glittering ceremony in Osaka, Japan.
2011
Sanden Vikas (India) Limited, (India)
2012
SRF Limited, Chemicals Business (India); Mr. Roop Salotra, President and CEO
Mahindra & Mahindra Limited, Farm Equipment Sector, Swaraj Division (India); Mr. Bishwambhar Mishra, Chief Executive
2013
RSB Transmissions(I) Limited, Auto Division (Jamshedpur(Unit 1), Pune & Pant Nagar Plant) (India)
2014
GC America (USA)
Yaskawa
Mahindra Powerol
2016
Ashok Leyland, Pantnagar plant - World's first commercial vehicle to get the Deming Prize (Outside Japan)
2017
Ashok Leyland Limited, Hosur Unit II, India
CEAT Limited, India [first tire company in the world (Outside Japan) to get Deming award]
2018
PT Komatsu Indonesia [First Company in Indonesia, to get the Deming Prize; Mr. Pratjojo Dewo, President Director]
Sundram Fasteners Limited, India [SFL got the Deming Prize for all its 17 plants located across India; Arathi Krishna, Managing Director, is the first woman to receive this award]
Jsw Steel Ltd, India [President, Mr. Rajashekhar Pattanasetty]
Indus Towers, India [CEO: Bimal Dayal]
2019
ELGi Equipments Ltd, Coimbatore, was the first industrial air compressor manufacturer outside of Japan to win this award.
Deming Distinguished Service Award for Dissemination Oversea
2009: Gregory H. Watson
2012: Janak Mehta
2014: Kan Trakulhoon
2019: Venu Srinivasan
See also
European Quality Award
List of national quality awards
Malcolm Baldrige National Quality Award
Total Quality Management
References
External links
The W. Edwards Deming Institute
Union of Japanese Scientists and Engineers (JUSE)
Toyota.com on winning the Deming Prize in 1965
List of winners of the Deming Application Prize on JUSE web site
Deming Medal (given to individuals by ASQ)
1950 establishments in Japan
Awards established in 1950
Japanese awards
Economics awards
Quality awards
|
Violet Kickers F.C. is a club team in Jamaica, that competes in the Western Confed. At level 2 in the National leagues. They won the Jamaica National Premier League Title on two occasions in 1993/1994 and 1995/1996, but fell from grace and now no longer compete at that level of football.
They only returned to competitive football in the 2004/2005 season after they had changed names to Mount Salem in the 2000/2001 National A League season. As a result of the name change, the Jamaica Football Federation (JFF) had ruled that no team would be allowed to use the name for a three-year period.
Achievements
Jamaica National Premier League: 2
1994, 1996
Team Management
Head coach: Vinton Williams
Asst coach: Wayne Johnson
References
Football clubs in Jamaica
|
CHAdeMO is a fast-charging system for battery electric vehicles, developed in 2010 by the CHAdeMO Association, formed by the Tokyo Electric Power Company and five major Japanese automakers. The name is an abbreviation of "CHArge de MOve" (which the organization translates as "charge for moving") and is derived from the Japanese phrase "" (), translating to English as "How about a cup of tea?", referring to the time it would take to charge a car.
It competes with the Combined Charging System (CCS), which since 2014 has been required on electric vehicles sold in the European Union, Tesla's North American Charging Standard (NACS) used by its Supercharger network outside of Europe, and China's GB/T charging standard.
, CHAdeMO remains popular in Japan, but is being equipped on very few new cars sold in North America or Europe.
First-generation CHAdeMO connectors deliver up to 62.5 kW by 500 V, 125 A direct current through a proprietary electrical connector, adding about of range in a half an hour. It has been included in several international vehicle charging standards.
The second-generation specification allows for up to 400 kW by 1 kV, 400 A direct current. The CHAdeMO Association is currently co-developing with China Electricity Council (CEC) the third-generation standard with the working name of “ChaoJi” that aims to deliver 900 kW.
History
CHAdeMO originated out of a charging system design from the Tokyo Electric Power Company (TEPCO). TEPCO had been participating on numerous EV infrastructure trial projects between 2006 and 2009 in collaboration with Nissan, Mitsubishi, Fuji Heavy Industries (now Subaru), and other manufacturers. These trials resulted in TEPCO developing patented technology and a specification, which would form the basis for the CHAdeMO.
The first commercial CHAdeMO charging infrastructure was commissioned in 2009 alongside the launch of the Mitsubishi i-MiEV.
In March 2010, TEPCO formed the CHAdeMO Association with Toyota along with earlier partners Nissan, Mitsubishi, and Subaru. They were later joined by Hitachi, Honda and Panasonic. CHAdeMO would be the first organization to propose a standardized DC fast charge system to be shared across diverse EVs, regardless of their brands and models.
CHAdeMO became a published international standard in 2014 when the International Electrotechnical Commission (IEC) adopted IEC 61851-23 for the charging system, IEC 61851-24 for communication, and IEC 62196-3 configuration AA for the connector. Later that year, the European Committee for Electrotechnical Standardization (EN) added CHAdeMO as a published standard, followed by the Institute of Electrical and Electronics Engineers (IEEE) in 2016.
A major blow to the international adoption of CHAdeMO came in 2013 when European Commission designated the Combined Charging System (CCS) Combo 2 as the mandated plug for DC high-power charging in Europe. While the European Parliament had contemplated removing all CHAdeMO infrastructure by January 2019, the final mandate only required that all publicly accessible chargers in the EU be equipped with CCS Combo 2, allowing stations to offer multiple connector types.
While CHAdeMO was the first fast-charging standard to see widespread deployment and remains widely equipped on vehicles sold in Japan, it has been losing market share in other countries. Honda was the first of the CHAdeMO Association members to stop equipping the connector on vehicles sold outside of Japan starting with the Clarity Electric in 2016. Nissan also abandoned CHAdeMO on its Ariya SUV introduced in 2021. Toyota and Subaru have also equipped their jointly developed bZ4X/Solterra with the CCS connector outside of Japan. , the Mitsubishi Outlander PHEV and Nissan Leaf are the only plug-in vehicles equipped with CHAdeMO for sale in North America.
As demand increased for EV charging services for Tesla vehicles after 2019, and prior to opening of the competing North American Charging Standard (NACS) in late 2022, several electric vehicle charging network operators had added some Tesla charging connector adapters to legacy CHAdeMO-standard charging stations. These included, ONroute rest stop network in Ontario, Canada—where a Tesla adaptor was permanently attached to a CHAdeMO cord on some 60 charge stations— and REVEL opened a charging station in Brooklyn for a while after they were denied a license to operate a Tesla ride-hailing fleet in New York City. Also, EVgo, added a few optional Tesla adaptors to CHAdeMO cords as early as 2019.
Connector design
DC fast charge
Most electric vehicles (EV) have an on-board charger that uses a full bridge rectifier to transform alternating current (AC) from the electrical grid to direct current (DC) suitable for recharging the EV's battery pack. Most EVs are designed with limited AC input power, typically based on the available power of consumer outlets: for example, 240 V, 30 A in the United States and Japan; 240 V, 40 A in Canada; and 230 V, 15 A or 3φ, 400 V, 32 A in Europe and Australia. AC chargers with higher limits have been specified, for example SAE J1772-2009 has an option for 240 V, 80 A and VDE-AR-E 2623-2-2 has a 3φ, 400 V, 63 A. But these charger types have been rarely deployed.
Cost and thermal issues limit how much power the rectifier can handle, so beyond approximately 240 V AC and 75 A it is better for an external charging station to deliver DC directly to the battery. For faster charging, dedicated DC chargers can be built in permanent locations and provided with high-current connections to the grid. Such high voltage and high-current charging is called a DC fast charge (DCFC) or DC quick charging (DCQC).
Connector protocols and history
While the charging system design for CHAdeMO came out of TEPCOs trials starting in 2006, the connector itself had been designed in 1993, and was specified by the 1993 Japan Electric Vehicle Standard (JEVS) G105-1993 from the JARI.
In addition to carrying power, the connector also makes a data connection using the CAN bus protocol. This performs functions such as a safety interlock to avoid energizing the connector before it is safe (similar to SAE J1772), transmitting battery parameters to the charging station including when to stop charging (top battery percentage, usually 80%), target voltage, total battery capacity, and how the station should vary its output current while charging.
The first protocol issued was CHAdeMO 0.9, which offered maximum charging power of 62.5 kW (125 A × 500 V DC). Version 1.0 followed in 2012, enhancing vehicle protection, compatibility, and reliability. Version 1.1 (2015) allowed the current to dynamically change during charging; Version 1.2 (2017) increased maximum power to 200 kW (400 A × 500 V DC).
CHAdeMO published its protocol for 400 kW (400 A × 1 kV) 'ultra-fast' charging in May 2018 as CHAdeMO 2.0. CHAdeMO 2.0 allowed the standard to better compete with the CCS 'ultra-fast' stations being built around the world as part of new networks such as IONITY charging consortium.
Vehicle-to-grid (V2G)
In 2014, CHAdeMO published its protocol for vehicle-to-grid (V2G) integration, which also includes applications for vehicle to load (V2L) or vehicle to home-off grid (V2H), collectively denoted V2X. The technology enables EV owners to use the car as an energy storage device, potentially lowering costs by optimising energy usage for the current time of use pricing and providing electricity to the grid. Since 2012, multiple V2X demo projects using the CHAdeMO protocol have been demonstrated worldwide. Some of the recent projects include UCSD INVENT in the United States, as well as Sciurus and e4Future in the United Kingdom that are supported by Innovate UK.
CHAdeMO 3.0: ChaoJi
In August 2018, CHAdeMO Association announced they were co-developing the next-generation ultra-high-power protocol, named CHAdeMO 3.0, with China Electricity Council (CEC), which would harmonise the CHAdeMO standard with the CEC GB/T charging standard 20234.3-2015. This project includes a new connector with the code name ChaoJi (), and plans to increase charging rate to 900 kW (600 A x 1.5 kV), all the while ensuring backward compatibility with the current CHAdeMO and GB/T 20234.3 (IEC 62916-3 configuration BB) DC chargers, according to the Association. It was revealed that ChaoJi can also be made backward compatible with CCS and such study is under consideration as of summer 2019. The ChaoJi connector could also take the place of the DC connector of CCS Combo 2.
By adopting liquid cooling within the cable and moving the locking mechanism from the connector to the vehicle, the ChaoJi connector is significantly lighter and more compact than the prior CHAdeMO design. IEC 68151-1 prohibits the use of adapters for high power charging; an amendment was submitted by the ChaoJi alliance to allow the use of adapters. A prototype adapter was built by Fujikura, but it was inflexible and heavy at nearly because the cable did not use internal cooling.
Deployment
Charging stations
CHAdeMO-type fast charging stations were initially installed in great numbers by TEPCO in Japan, which required the creation of an additional power distribution network to supply these stations.
Since then, CHAdeMO charger installation has expanded its geographical reach and in January 2022, the CHAdeMO Association stated that there were 44,900 CHAdeMO chargers installed in 96 countries. These included 7,700 charging stations in Japan, 22,500 in Europe, 8,000 in North America, and 1,000 elsewhere. For the historic evolution of CHAdeMO installation, see above under History.
As of January 2022, a total of 260 certified CHAdeMO charger models have been produced by 50 companies.
In vehicles
Models supporting CHAdeMO charging include:
Bollinger B1
BMW i3 (Japan only)
Citroën C-ZERO
Citroën Berlingo Electric/E-Berlingo Multispace (until 2020)
ENERGICA MY2021
GLM Tommykaira ZZ EV
Honda Clarity PHEV (Japan only)
Honda Fit EV
Hyundai Ioniq Electric (2016)
Jaguar i-Pace (Japan only)
Kia Soul EV (for American and European market until 2019)
LEVC TX
Lexus UX 300e (for Europe)
Mazda Demio EV
Mitsubishi Fuso eCanter
Mitsubishi i MiEV
Mitsubishi MiEV truck
Mitsubishi Minicab MiEV
Mitsubishi Outlander PHEV
Mitsubishi Eclipse Cross PHEV
Nissan LEAF
Nissan e-NV200
Peugeot e-2008
Peugeot iOn
Peugeot Partner EV
Peugeot Partner Tepee
Subaru Stella EV
Tesla Model 3, S, X and Y (North American, Korean, and Japanese models via adapter,)
Tesla Model S, and X (Models with European charge port via adapter, prior to models with integrated CCS 2 capability)
Toyota eQ
Toyota Prius PHV (Japan only)
XPeng G3 (Europe 2020)
Zero Motorcycles (via optional inlet)
Vectrix VX-1 Maxi Scooter (via optional inlet)
Gallery
See also
CCS Combo
SAE J1772 (Type 1)
ChaoJi
GB/T charging standard
References
External links
International Electrotechnical Commission
DC power connectors
Plug-in hybrid vehicle industry
Charging stations
Automotive standards
2010 establishments in Japan
|
Sechs Gedichte und Requiem, Op. 90, (English: Six Poems and Requiem) also called the Lenau-Lieder, is a song cycle by Robert Schumann. It was composed in 1850, shortly before the Schumanns moved to Düsseldorf.
The cycle consists of seven songs. The first six are settings of poems by Nikolaus Lenau. The final song, "Requiem", is a setting of a translation by Lebrecht Blücher Dreves of an anonymous mediaeval poem in Latin.
Composition
In 1829 Schumann had met the cycle's main librettist, Nikolaus Lenau, in Vienna. But it was in the summer of 1850 that he undertook to set his poems in a cycle. This came at the end of his period in Dresden, where the Schumanns' lives had lately been upturned by the violence of 1849.
For Schumann, 1850 followed an extremely productive year which saw the composition of piano music such as the Waldszenen; works for solo voice such as the Spanisches Liederspiel and the declamation Schön Hedwig; two concertante works, the Konzertstück for Four Horns and Orchestra and the Introduction and Allegro appassionato for Piano and Orchestra; chamber works such as the Five Pieces in Folk Style and the Adagio and Allegro for Horn and Piano; and many choral and part-song works, such as the Requiem for Mignon, the Nachtlied for chorus and orchestra and the song cycle Minnespiel.
The beginning of 1850 saw sketches for Schumann's Neujahrslied, Op. 144, and several successful productions of the popular Paradise and the Peri. In February, Clara Schumann and her husband travelled from Dresden to Leipzig, to prepare for the premiere of Robert's opera Genoveva. However, Genovevas staging was delayed in favour of a production of Meyerbeer's Le prophète, whose premiere at Paris the previous year had been met very warmly. Nevertheless, the Schumanns stayed a month in Leipzig, where performances of Schumann's works were received well, returning at last to Dresden via concerts in the north-west and a visit to relatives of Clara's in Berlin.
It was at this time that Schumann accepted the post of musical director in Düsseldorf. Upon his return home, Schumann became extremely productive in vocal music, working on his Scenes from Goethe's Faust and completing many songs. In the summer, the Schumanns returned to Leipzig for the actual premiere of Genoveva. The opera was received poorly, and received only three performances.
Disappointed, Schumann returned to Dresden in July. That month he worked on several vocal works, including the Sechs Gedichte, which was supposed to be tribute to Lenau. At the time of the completion of the cycle on 5 August, Schumann believed Lenau dead. Lenau was syphilitic, as some have conjectured was Schumann, and like Schumann again he struggled his entire life long with mental illness and died in an asylum. In fact Schumann was mistaken, and Lenau would not eventually die until 22 August, by coincidence the day of the Sechs Gedichtes premiere.
To six of Lenau's poems Schumann appended the "Requiem": a text which he described as an "old Catholic poem". It is not a requiem at all, but an anonymous lament supposed by tradition to be Héloïse's upon the death of Abélard.
Songs
The songs are:
"Lied eines Schmiedes" (Song of a Blacksmith)
"Meine Rose" (My Rose)
"Kommen und Scheiden" (Arriving and Departing)
"Die Sennin" (The Alpine Shepherdess)
"Einsamkeit" (Solitude)
"Der schwere Abend" (The Oppressive Evening)
"Requiem"
The songs' texts concern lost love. John Daverio writes that in the course of the cycle "the poet's grief steadily intensifies", so that the poems "unfold a kind of Künstlerleben or 'Artist's life' that makes the cycle into a pendant to Dichterliebe".
Reception
This cycle was one of few works not by a French composer which Francis Poulenc and Pierre Bernac performed in a series of concerts given during World War II.
References
External links
"Sechs Gedichte und Requiem", German and English texts
Song cycles by Robert Schumann
Musical settings of poems by Nicolaus Lenau
1850 compositions
|
Jalal Dabagh () (born 1939) is a Kurdish politician and writer/journalist.
Life
Jalal Dabagh was born on May 12, 1939, in Silêmanî city in south Kurdistan. He is one of nine children, five sons and four daughters.
Education and Profession
He received his compulsory- and senior high school education in Silêmanî, where he also went on study at a teachers' training college.
In 1959 Dabagh started working as a teacher at a compulsory school in Silêmanî. Thereafter, in 1962, he went to Romania for three years studying social science at Bucharest Institute of Social Science.
He advanced his social science studies in Moscow (USSR) between 1974 and 1976.
Between 1970-77 he was one of the board members of the Kurdish Writers Union, for which he was the administrative secretary 1970-74.
As one of the Kurdish representatives he attended the 5th conference of Afro-Asian Writers’ Union 4–9 September 1973 in Alma-Ata, Kazakhstan (then one of the republics of USSR).
Dabagh is fluent in Kurdish and Arabic, he speaks or understands conversational Swedish, English, Romanian and Persian.
In addition, Jalal Dabagh worked as a journalist for over 25 years.
Current affairs
Jalal Dabagh was the party leader for the Left Party in the Kurdistan region of Iraq (south Kurdistan)
Was a candidate for the Iraqi parliament in 2010.
Dabagh was a member of The Association for Pêşmerge Dêrînekan of Kurdistan, which is an association for the veteran Kurdish fighters. The purpose of the association is to preserve the rights of former fighters and also function as a forum for discussing the present and the future of Kurdistan.
He is also working on a biography about himself.
Commitment
Dabagh was deputy editor of the weekly magazine Bîrî Nwê (New Idea), 1972–1978. Bîrî Nwê was published in Baghdad, both in Kurdish and Arabic, a magazine dealing with culture, politics and society. It had a major role in spreading progressive literature and culture.
Between 1986 and 1991 Dabagh was chief editor for the Kurdish edition of Problems of Peace and Socialism—in Kurdish, named Regay Aşti û Sosyalîzm.
Moreover, he was the editor of Govarî Bîrî Nwê, a monthly magazine.
Work
Jalal Dabagh has written and translated numerous books.
Translated
The Communist Manifesto
Dabagh made the first Kurdish translation of The Communist Manifesto, one of the world's most influential political manuscripts.
Published in: 1996 and 2001
Raparini Kurdan 1925
Dabagh translated Manvel Arsenovic Gasratjan's Kurdy Turcsii v novejsee vremja (Kurdish: Raparini Kurdan 1925) to Kurdish. Raparini Kurdan 1925 is about the 1925 Sheikh Said rebellion, led by Sheikh Said.
Published in: 2006
Karma
He has also translated Diagnostics of Karma to Kurdish. written by Sergey N. Lazarev. Which educates about alternative therapies with karma in focus.
Published in: 2006
Wa Bahar Hat
A novel written by Haci Jindey, freely translated to "Now comes the Spring" was translated to Kurdish by Dabagh.
Pîawêkî Nabîn
Pîawêkî Nabîn (A Blind Man) is a manuscript originally written by Khalil Gibran
Tawawy Nusînakanî Fahd
Tawawy Nusînakanî Fahd is the collected works of Yusuf Salman Yusuf, also known merely as Fahd. It was translated to Kurdish by Jalal Dabagh.
Published in: 2001.
Other notable translations are Freedom Road, about the lives of former slaves during Reconstruction, and Marxism Philosophy and the first Kurdish translation of "The Internationale".
Written
Hacî Qadirî Koyî
Hacî Kaderî Koyey, freely translated in English to Hajji Kader from Koye.
Published in: 2009.
Goranî Serkawtin
Freely translated to Songs of Victory is a collection of poems.
Published in: 1998.
28 Estêre le Asmanî Nemrîda
Freely translated to 28 Stars in the Sky of the Immortal.
Published in: 1985.
La Dafterî Geshtekî Regay Jîanewe
Freely translated to Diary from Road of Life.
Published in: 1978.
Jîan û Tekoşanî Dîmitrov
Freely translated to Life and Struggle of Dimitrov is about the Bulgarian Communist leader Georgi Dimitrov.
Published in: 1973.
References
External links
Official Facebook Page
1939 births
Iraqi Kurdish people
Kurdish journalists
Living people
Kurdistan Toilers' Party politicians
Iraqi Kurdistani politicians
|
Iris Louise McPhetridge Thaden (born Louise McPhetridge; November 12, 1905 – November 9, 1979) was an American aviation pioneer, holder of numerous aviation records, and the first woman to win the Bendix trophy, alongside Blanche Noyes. She was inducted into the Arkansas Aviation Historical Society's Hall of Fame in 1980.
Birth and education
Louise McPhetridge was born in Bentonville, Arkansas, and attended Bentonville public schools. McPhetridge attended the University of Arkansas in Fayetteville, Arkansas, from 1921 to 1926 and studied as a journalism, physical education, and pre-medical major.
Aviation
In 1926, McPhetridge was working for the J.H.J. Turner Coal Co. where one of her main customers was the Travel Air Corporation in Wichita, Kansas, owned by Walter Beech. Beech liked McPhetridge and offered her a job as a sales representative in San Francisco, California, which she accepted. Her salary included free pilot's lessons, and she earned her pilot's certificate in 1928. She was the first female pilot to be licensed by the state of Ohio.
Marriage
McPhetridge met Herbert von Thaden, who was a United States Army Signal Corps pilot and engineer who worked on developing the first American all-metal aircraft, the Thaden T-2. McPhetridge and von Thaden were married in San Francisco on June 19, 1928. By 1929, Louise Thaden had become only the fourth woman to hold a transport pilot rating.
Records
Thaden rapidly became a major figure in the aviation world and set many world performance records and won many major flying events. In 1929, she became the first pilot to hold the women's altitude, endurance and speed records in light planes simultaneously. Thaden set the women's altitude record in December 1928 with a mark of 20,260 feet. In March 1929, she set the women's endurance record with a flight of 22 hours, 3 minutes, 12 seconds.
Following the fatal crash of Florence Klingensmith at the 1933 International Air Races, women were not allowed to enter the national air racing competition in 1934 due to sexism.
Women's Air Derby
Thaden was a friend and rival of pioneer aviators Amelia Earhart, Pancho Barnes, Opal Kunz, and Blanche Noyes. Thaden defeated her colleagues in the first Women's Air Derby, also known as the Powder Puff Derby, in 1929. The Air Derby was a transcontinental race from Santa Monica, California to Cleveland, Ohio, which was the site of the National Air Races that year. It took place from August 13–20, 1929. Twenty women were entered in the race. Marvel Crosson was killed. Earhart damaged her aircraft at Yuma, Arizona, Barnes became lost and flew into Mexico and damaged her plane attempting to get back on course, and Noyes suffered an in-flight fire over Texas.
Middle career
In 1930, Thaden went to work as the public relations director of Pittsburgh Aviation Industries (which had recently purchased her husband's Thaden Metal Aircraft Company) and became the director of the Women's Division of the Penn School of Aeronautics. That same year, Thaden and Earhart participated in the founding of an international organization for women pilots called the Ninety-Nines. Thaden turned down the presidency of the organization but served as the treasurer and vice-president. The Ninety-Nine organization still exists. In 1935, Phoebe Omlie, another pioneer female aviator, asked Thaden to become a field representative for the National Air Marking Program.
1936 Bendix Trophy Race
In 1936, Thaden won the Bendix Trophy Race in the first year women were allowed access to compete against men. She set a new world record of 14 hours, 55 minutes from New York City to Los Angeles, California. In her astonishing victory, she flew a Beech C17R Staggerwing biplane and defeated twin-engine planes specifically designed for racing. Laura Ingalls, another aviator, came in second by 45 minutes flying a Lockheed Orion. First prize was $4,500, and she also won the $2,500 prize for a woman finishing. Time magazine wrote on September 14, 1936:
To Pilots Thaden & Noyes the $7,000 prize money was far less gratifying than the pleasure of beating the men. Among the first ten U.S. women to earn transport licenses, they have for years been front-line fighters in aviation's "battle of the sexes." A fuzzy-haired blonde of 30, Mrs. Thaden has been flying since 1927, has held the women's speed, altitude and endurance records, is the mother of a 6-year-old son. She and Flyer Noyes both work regularly as air-marking pilots for the Department of Commerce. Short, brunette Mrs. Noyes is better known as the only pilot ever to fly John D. Rockefeller Sr. In the National Air Races, men contestants have always patronized women, in 1934 ousted them altogether. Smilingly observed Pilots Thaden and Noyes last week when they found they had won one of the two most important events of the Races: "Well, that's a surprise! We expected to be the cow's tail."
For her achievements Thaden won aviation's highest honor given to women, the Harmon Trophy.
Aviation career
Thaden teamed up with Frances Marsalis and set another endurance record by flying a Curtiss Thrush high-wing monoplane over Long Island, New York for 196 hours. The pair made seventy-eight air-to-air refueling maneuvers. Food and water were lowered to the two by means of a rope from another aircraft. The event gained national attention and the pair made a series of live radio broadcasts from the aircraft.
In 1937, she became the National Secretary of the National Aeronautics Association. Just prior to her retirement, she returned to Beech Aircraft Corporation as a factory representative and demonstration pilot.
Retirement
Thaden retired from competition in 1938. She worked for a time with the Bureau of Air Commerce to promote the creation of airfields. She also wrote her memoirs, High, Wide and Frightened soon after her retirement. In addition to her memoirs, she wrote numerous newspaper and magazine articles dealing with aviation issues. Thaden said women were "innately better pilots than men." The final chapter of her autobiography, "Noble Experiment," omitted from the 1973 and 2004 reissues of the book, is a short story giving a dystopian vision of the use of women in combat. It gains particular pertinence in its implicit criticism of the strategic bombing theories of Giulio Douhet and William ("Billy") Mitchell.
The Arkansas Aviation Historical Society selected Thaden in 1980 as one of five initial inductees in the Arkansas Aviation Hall of Fame.
Death
Thaden died of a heart attack at High Point, North Carolina on November 9, 1979.
Legacy
In 1951, the airport in Bentonville, Arkansas was renamed Louise Thaden Field in her honor.
In 1974, the Library Building at the National Staggerwing Museum in Tullahoma, Tennessee was named for Thaden.
In 1991, astronaut Eileen Collins carried Thaden's flying helmet into space on the Space Shuttle to honor her achievements and the early women pioneers of flight.
In 1999, Thaden was inducted into the International Air & Space Hall of Fame at the San Diego Air & Space Museum and the National Aviation Hall of Fame
In 2004, the University of Arkansas Press re-published Thaden's autobiography, High, Wide, and Frightened.
In 2017, Thaden School, an Independent School, was founded in Bentonville, Arkansas in honor of Louise Thaden.
In 2021, an opera memorializing her run in the 1936 Bendix Trophy Race titled Staggerwing was premiered at the Kansas Aviation Museum. Composed by Lisa DeSpain with librettist Rachel J. Peters, Staggerwing was the winner of the 2020 zepick modern opera commission.
References
External links
"The Major Trophy Races of the Golden Age of Air Racing" by David H. Onkst, US Centennial of Flight Commission, retrieved January 6, 2006
"The Bendix Trophy", Air Racing History, retrieved January 6, 2006
Louise McPhetridge Thaden Collection, 1925-1949, National Air and Space Museum Archives
1905 births
1979 deaths
Aviators from Arkansas
Harmon Trophy winners
People from Bentonville, Arkansas
Bentonville High School alumni
Flight endurance record holders
American aviation record holders
American women aviation record holders
20th-century American women
20th-century American people
|
Founded in 1996 by a group of local poetry enthusiasts, the Ledbury Poetry Festival is now the biggest poetry festival in the UK.
History
The first Ledbury Poetry Festival was held in 1997 in Ledbury, Herefordshire. It was opened by jazz singer, critic and writer George Melly. The following year it was opened by Mark Fisher, the Labour arts minister. Since then, over a thousand national and international poets have taken part in the festival. Patrons include the Poet Laureate, Carol Ann Duffy, and Peter Florence, founder of the Hay Festival. Trustees include Ursula Owen, publisher, editor and campaigner for free expression, and Neil Astley, editor of Bloodaxe Books. The original trustees of the festival were Peter Arscott, John Burns, Alan Lloyd, Martyn Moxley, Richard Surman and Margaret Rigby.
Ledbury holds its main programme over two weeks in the summer, and its work continues throughout the year, with projects that involve local primary schools and John Masefield High School, as well as hundreds of local people through its community projects. The Festival also works alongside small literary publishers.
In 2009, The Guardian described the Ledbury Poetry Festival as "the largest of its kind in the UK and also the most energised, giving a real sense of poetry as an important living, contemporary literary form."
In 2017 the Ledbury Poetry Festival celebrated its 21st anniversary by launching the biannual Ledbury Forte Poetry Prize for Second Collections, the only prize of this kind in the UK. This prize aims to support and encourage poets at the ‘mid-career’ stage with a prize of £5,000 for the winning second collection.
Support
The Ledbury Poetry Festival receives financial support from Arts Council England, Versopolis Poetry, the Pennington-Mellor-Munthe Charity Trust, Garfield Weston Foundation and The Elmley Foundation.
Poets
British poets who have performed at the festival include Simon Armitage, Al Alvarez, Patience Agbabi, Wendy Cope, John Burnside, Helen Dunmore, Douglas Dunn, James Fenton, Ruth Padel, George Szirtes and Benjamin Zephaniah. International poets include Billy Collins, Mark Doty (USA), Yang Lian (China), Gozo Yoshimasu (Japan), Ko Un (Korea), Kristina Ehin (Estonia), Ali Cobby Eckerman (Australia), Basem Al-Nabriss (Palestine), Fadhil Al-Azzawi (Iraq) and Arundhathi Subramaniam (India).
Ledbury Poetry Festival Poetry Competition (2018)
Source:
Judge: Nia Davies
Adult Winners
“All the Bleak Chippies” - R.T.A. Parker (United States of America)
“Through the Hologram” - Pam Thompson (United Kingdom)
“Deeds” - Robbie Burton (United Kingdom)
Young Persons Winners
“essay on grief / a holiday” - Annie Fan (United States of America)
“Collins ” - Georgie Woodhead (United Kingdom)
“The night you attacked me” - Lauren Edwards (United Kingdom)
Children Winners
“Tinned Life” - Aurora B Blue (United States of America)
“Six ways to look at a word” - Maxwell Heavens (United Kingdom)
“Forgiveness for Forgiveness” - Kankai Walendra (India)
Ledbury Poetry Festival Poetry Competition (2019)
Source:
Judge: Daljit Nagra
Adult Winners
“Duplex” - Elisabeth Murawski (United States of America)
“Bloodlines” - Sarah Wimbush (United Kingdom)
“Anatomy Theatre” - Denise Bundred (United Kingdom)
Young Persons Winners
“Planet Earth II: Cities” - Cia Mangat (United Kingdom)
“The People’s Republic of China” - Lydia Wei (United States of America/China)
“The Sound of Waiting” - Rose Brennan (United Kingdom)
Children Winners
“The Cat that nobody Wanted” - Aurora B Blue (United States of America)
“Imagine a world without any laws” - Maxwell Heavens (United Kingdom)
“Big Eats Small” - Han Fang (United Kingdom)
Ledbury Poetry Festival Poetry Competition (2020)
Source:
Judge: Liz Berry
Winners: TBD
References
External links
Ledbury Poetry Festival
Poetry festivals in the United Kingdom
Festivals in Herefordshire
Festivals established in 1997
Ledbury
Literary festivals in England
|
```html
---
title: Bulma Customization Concepts
layout: docs
theme: customize
doc-tab: customize
doc-subtab: concepts
breadcrumb:
- home
- documentation
- customize
- customize-concepts
---
{% capture markdown %}
Bulma is a **highly customizable CSS framework**. From colors to typography, spacing and sizes, forms and layouts, all parts of Bulma can be customized by the user.
Bulma's styles and variables are defined at several levels:
* Global Sass variables
* Component Sass variables
* Global CSS variables
* Component CSS variables
* Helper classes
All Bulma components are styled using **Sass variables** and **CSS Variables** (which are also called CSS custom properties). Read more about them:
* [on the Sass website](path_to_url
* [on the MDN Reference](path_to_url
{% endcapture %}
{% include markdown.html content=markdown %}
{% include docs/elements/anchor.html name="Global Sass Variables" %}
{% capture markdown %}
Bulma uses Sass variables globally defined in 2 files located in the `utilities` folder:
* `initial-variables.scss` where you define variables by literal value
* **colors** like `$blue: hsl(229, 53%, 53%)`
* **font sizes** like `$size-1: 3rem`
* **dimensions** like `$block-spacing: 1.5rem`
* **breakpoints** like `$tablet: 769px`
* **other values** like `$easing: ease-out` or `$radius-large: 0.75rem`
* `derived-variables.scss` where variables are calculated from the values set in the previous file
* **primary colors**:
* `$primary`
* `$link`
* `$success`
* `$info`
* `$warning`
* `$dark`
* **utility colors**:
* `$background`
* `$border`
* `$code` and `$pre`
* `$shadow-color`
* **typography**:
* `$family-primary`
* `$family-secondary`
* `$family-code`
* `$size-small`
* `$size-normal`
* `$size-medium`
* `$size-large`
* color maps:
* `$colors`
* `$shades`
* `$sizes`
{% endcapture %}
{% include markdown.html content=markdown %}
{% include docs/elements/anchor.html name="Component Sass variables" %}
{% capture markdown %}
All Bulma components define its own Sass variables. For example, `components/breadcrumb.scss` define the following:
{% endcapture %}
{% include markdown.html content=markdown %}
{%
include docs/components/variables.html
tab="components"
subtab="breadcrumb"
hide_css_vars=true
%}
{% include docs/elements/anchor.html name="Global CSS Variables" %}
{% capture markdown %}
Bulma uses global CSS variables defined at the `:root` level. They are all prefixed with `bulma-`:
{% endcapture %}
{% include markdown.html content=markdown %}
{% highlight css %}
:root {
/* Colors and Lightness values */
--bulma-scheme-h: 221;
--bulma-scheme-s: 14%;
--bulma-light-l: 90%;
--bulma-light-invert-l: 20%;
--bulma-dark-l: 20%;
--bulma-dark-invert-l: 90%;
--bulma-soft-l: 90%;
--bulma-bold-l: 20%;
--bulma-soft-invert-l: 20%;
--bulma-bold-invert-l: 90%;
/* etc. */
/* Color Palettes */
--bulma-primary: hsla(var(--bulma-primary-h), var(--bulma-primary-s), var(--bulma-primary-l), 1);
--bulma-primary-base: hsla(var(--bulma-primary-h), var(--bulma-primary-s), var(--bulma-primary-l), 1);
--bulma-primary-rgb: 0, 209, 178;
--bulma-primary-h: 171deg;
--bulma-primary-s: 100%;
--bulma-primary-l: 41%;
--bulma-primary-00-l: 1%;
--bulma-primary-05-l: 6%;
--bulma-primary-10-l: 11%;
--bulma-primary-15-l: 16%;
--bulma-primary-20-l: 21%;
/* etc. */
/* Typography */
--bulma-family-primary: Inter, SF Pro, Segoe UI, Roboto, Oxygen, Ubuntu, Helvetica Neue, Helvetica, Arial, sans-serif;
--bulma-family-secondary: Inter, SF Pro, Segoe UI, Roboto, Oxygen, Ubuntu, Helvetica Neue, Helvetica, Arial, sans-serif;
--bulma-family-code: Inconsolata, Hack, SF Mono, Roboto Mono, Source Code Pro, Ubuntu Mono, monospace;
--bulma-size-small: 0.75rem;
--bulma-size-normal: 1rem;
--bulma-size-medium: 1.25rem;
--bulma-size-large: 1.5rem;
/* etc. */
}
{% endhighlight %}
{% capture markdown %}
You can **overwrite** them simply by setting a new value at the same scope (or even a more specific one):
{% endcapture %}
{% include markdown.html content=markdown %}
{% highlight css %}
:root {
/* Set new values */
--bulma-scheme-h: 35;
--bulma-scheme-s: 20%;
}
{% endhighlight %}
{% include docs/elements/anchor.html name="Components CSS Variables" %}
{% capture markdown %}
Bulma is also styled at the **component** level. For example, here is how the `.title` element is styled:
{% endcapture %}
{% include markdown.html content=markdown %}
{% highlight css %}
.title {
--bulma-title-color: var(--bulma-text-strong);
--bulma-title-family: false;
--bulma-title-size: var(--bulma-size-3);
--bulma-title-weight: var(--bulma-weight-extrabold);
--bulma-title-line-height: 1.125;
--bulma-title-strong-color: inherit;
--bulma-title-strong-weight: inherit;
--bulma-title-sub-size: 0.75em;
--bulma-title-sup-size: 0.75em;
}
.title {
color: var(--bulma-title-color);
font-size: var(--bulma-title-size);
font-weight: var(--bulma-title-weight);
line-height: var(--bulma-title-line-height);
}
{% endhighlight %}
{% capture markdown %}
You can overwrite this simply by setting new values under the same scope:
{% endcapture %}
{% include markdown.html content=markdown %}
{% highlight css %}
.title {
--bulma-title-color: #fff;
--bulma-title-line-height: 1.6;
}
{% endhighlight %}
```
|
```c
/* $OpenBSD: main.c,v 1.1.1.1 2005/09/28 15:42:32 kurt Exp $ */
/*
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <dlfcn.h>
#include <stdio.h>
int
main()
{
int ret = 0;
void *libaa;
libaa = dlopen("libaa.so", RTLD_LAZY|RTLD_GLOBAL);
if (libaa == NULL) {
printf("dlopen(\"libaa.so\", RTLD_LAZY|RTLD_GLOBAL) FAILED\n");
return (1);
}
libaa = dlopen("libaa.so", RTLD_LAZY|RTLD_GLOBAL);
dlclose(libaa);
/* RTLD_DEFAULT should see aaSymbol */
if (dlsym(RTLD_DEFAULT, "aaSymbol") == NULL) {
printf("dlsym(RTLD_DEFAULT, \"aaSymbol\") == NULL\n");
ret = 1;
}
dlclose(libaa);
return (ret);
}
```
|
Olenecamptus octopustulatus is a species of beetle in the family Cerambycidae. It was described by Victor Motschulsky in 1860, originally under the genus Ibidiomorphum. It is known from Mongolia.
References
Dorcaschematini
Beetles described in 1860
|
Bonapartesaurus (meaning "Bonaparte's lizard", named after José Bonaparte) is an extinct genus of herbivorous ornithopod dinosaur belonging to Hadrosauridae, which lived in the area of modern Argentina during the Campanian and Maastrichtian stages of the Late Cretaceous.
Discovery and naming
The remains were excavated by the Argentine paleontologist Jaime Powell and collaborators in 1984 and described by him in 1987, where he identified the dinosaur remains as a possible "indeterminate lambeosaurine", comparing it mainly with the genera Hypacrosaurus and Barsboldia due to great size of the neural spines.
In 2010, Rubén D. Juárez Valieri and his team erected a new genus and hadrosaurid species called Willinakaqe salitralensis from different materials found in 2 different locations (Salitral Moreno and Islas Malvinas) of the Allen Formation, which are mostly housed in the collection of the Carlos Ameghino Provincial Museum, where the specimen was examined by Powell, and was made the paratype of this new genus, in addition to the holotype of Lapampasaurus as material attributed to W. salitralensis from the second locality and housed in the Provincial Museum of Natural History, in the province of La Pampa.
Later, the Spanish paleontologist Penélope Cruz-Caballero and the Argentine Rodolfo Coria reviewed the material attributed to the genus Willinakaqe in 2016, where they concluded that fossils may represent more than one taxon of hadrosaurid and that the characteristics used in the diagnosis would not be valid. Also, the specimen is not preserved in good condition in addition to being incomplete, and therefore non-diagnostic, degrading it to the status of an indeterminate saurolophine and making Willinakaqe salitrensis a nomen vanum.
In a 2017 study, Cruzado-Caballero and Powell (who died before the paper was published) reassigned the paratype of W. salitralensis to its own genus and species, Bonapartesaurus rionegrensis, converting the former into a chimera of different hadrosaurids, and hence, an invalid name.
Description
The holotype specimen MPCA-Pv SM2/1-71, consists of a partial skeleton including 4 dorsal vertebrae, a complete sacrum, 8 anterior caudal vertebrae, 9 medial caudal vertebrae, 2 blocks with 5 medial caudal vertebrae each, 18 haemal arches, 3 dorsal ribs, a distal fragment of the right scapula, a distal fragment of the left humerus, a left ulna, a right ilium, a nearly complete left pubis, distal fragments of both ischia, both femurs, tibias, and fibulae, a left astragalus, a right calcaneus, an almost complete articulated left foot and two blocks with tendons. All the material present was extracted from the Salitral Moreno site of the Río Negro province in southern Argentina, from the lower member of the Allen Formation, which dates to the Late Cretaceous (Campanian to Maastrichtian).
Bonapartesaurus is characterized by the following combination of unique characters: the proportion between the height of the neural, sacral and centrum spines is greater than 3.5; the neural spines of the anterior part of the caudal vertebrae are extremely long (between three and a half and four times the height of the centrum) and evenly the distal expansion; a pre-acetabular process slightly flexed ventrally, with the angle greater than 150°; the proportion between the maximum dorsoventral depth of the posterior end of the dorsoventral preacetabular process and the distance from the pubic peduncle to the dorsal margin of the iliac bone is inferior to 0,50; The ratio between height and anteroposterior dorsoventral length of the iliac lamina is 0.8 or higher; an asymmetric lateral profile of the supraacetabular process; the posterior portion of the mediolateral postacetabular process markedly thicker as a result of the dorsomedial torsion of the postacetabular process; an expanded cnemial crest limited anteriorly to the proximal end of the tibia; and the articular surface of the astragalus for the internal malleolus of the tibia is moderately expanded medially, articulating with only a part of the ventral surface of the tibial internal malleolus.
Paleopathologies
Cruzado-Caballero and colleagues in 2021, using a CT scanner, identified three palaeopathologies present on the bones of the holotype Bonabartesaurus. These were located on two caudal vertebrae and the left metatarsal II bone. The two caudal vertebrae had suffered fractures of the spinous processes. In the first one, the injury was caused by impaction; in addition, there was also a post-traumatic infection. The cause of the pathology on the next caudal vertebra is unknown. There was a tumour in the metatarsal bone which was probably a malignant bone tumour called osteosarcoma. These pathologies probably caused pain and hampered the animal's normal functioning, but were not the cause of its death.
Phylogeny
The first phylogenetic analysis of Bonapartesaurus followed Paul Sereno's definition for Hadrosauridae from 1998, in addition to using the traditional classification of Hadrosaurinae (prior to the consensus of Prieto-Marquez in 2010), which includes all non-crested hadrosaurids along with the fragmentary genus Hadrosaurus within the same subfamily. It is also placed within the Saurolophini tribe, being more derived than Prosaurolophus, but more basal than Saurolophus spp., in contrast to the tentative classification of Willinakaqe within the Kritosaurini tribe. The following cladogram is based on the phylogenetic analysis of Cruzado-Caballero & Powell in 2017, with the relationships with Lambeosaurinae and Hadrosauroidea not shown:
In the 2023 description of the South American hadrosauroid Gonkoken, Alarcón-Muñoz et al. recovered Bonapartesaurus as a member of the Austrokritosauria, a clade of entirely South American saurolophines closely related to kritosaurins. The results of their phylogenetic analyses of Saurolophinae are displayed in the cladogram below:
See also
Timeline of hadrosaur research
2017 in archosaur paleontology
References
Saurolophines
Campanian life
Maastrichtian life
Late Cretaceous dinosaurs of South America
Cretaceous Argentina
Fossils of Argentina
Allen Formation
Fossil taxa described in 2017
Ornithischian genera
|
```c++
/*
*
* 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 Google Inc. 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.
*/
#include "config.h"
#include "core/page/PagePopupController.h"
#include "core/page/PagePopup.h"
#include "core/page/PagePopupClient.h"
#include "platform/text/PlatformLocale.h"
#include "public/platform/Platform.h"
namespace blink {
PagePopupController::PagePopupController(PagePopup& popup, PagePopupClient* client)
: m_popup(popup)
, m_popupClient(client)
{
ASSERT(client);
}
PassRefPtrWillBeRawPtr<PagePopupController> PagePopupController::create(PagePopup& popup, PagePopupClient* client)
{
return adoptRefWillBeNoop(new PagePopupController(popup, client));
}
void PagePopupController::setValueAndClosePopup(int numValue, const String& stringValue)
{
if (m_popupClient)
m_popupClient->setValueAndClosePopup(numValue, stringValue);
}
void PagePopupController::setValue(const String& value)
{
if (m_popupClient)
m_popupClient->setValue(value);
}
void PagePopupController::closePopup()
{
if (m_popupClient)
m_popupClient->closePopup();
}
void PagePopupController::selectFontsFromOwnerDocument(Document* targetDocument)
{
if (!targetDocument || !m_popupClient)
return;
m_popupClient->selectFontsFromOwnerDocument(*targetDocument);
}
String PagePopupController::localizeNumberString(const String& numberString)
{
if (m_popupClient)
return m_popupClient->locale().convertToLocalizedNumber(numberString);
return numberString;
}
String PagePopupController::formatMonth(int year, int zeroBaseMonth)
{
if (!m_popupClient)
return emptyString();
DateComponents date;
date.setMonthsSinceEpoch((year - 1970) * 12.0 + zeroBaseMonth);
return m_popupClient->locale().formatDateTime(date, Locale::FormatTypeMedium);
}
String PagePopupController::formatShortMonth(int year, int zeroBaseMonth)
{
if (!m_popupClient)
return emptyString();
DateComponents date;
date.setMonthsSinceEpoch((year - 1970) * 12.0 + zeroBaseMonth);
return m_popupClient->locale().formatDateTime(date, Locale::FormatTypeShort);
}
String PagePopupController::formatWeek(int year, int weekNumber, const String& localizedDateString)
{
if (!m_popupClient)
return emptyString();
DateComponents week;
bool setWeekResult = week.setWeek(year, weekNumber);
ASSERT_UNUSED(setWeekResult, setWeekResult);
String localizedWeek = m_popupClient->locale().formatDateTime(week);
return m_popupClient->locale().queryString(WebLocalizedString::AXCalendarWeekDescription, localizedWeek, localizedDateString);
}
void PagePopupController::clearPagePopupClient()
{
m_popupClient = nullptr;
}
void PagePopupController::histogramEnumeration(const String& name, int sample, int boundaryValue)
{
Platform::current()->histogramEnumeration(name.utf8().data(), sample, boundaryValue);
}
void PagePopupController::setWindowRect(int x, int y, int width, int height)
{
m_popup.setWindowRect(IntRect(x, y, width, height));
}
} // namespace blink
```
|
```javascript
The built-in Node debugger
Streams in **Node**
How to debug Node.js
Handle `JSON.parse` error in Node.js
Middleware/pipeline design pattern
```
|
Louis-Marc Germishuys (born 23 March 1967) is a South African cricketer. He played in 26 first-class and 21 List A matches for Boland in 1993/94 and 1995/96.
See also
List of Boland representative cricketers
References
External links
1967 births
Living people
South African cricketers
Boland cricketers
Cricketers from Cape Town
|
Castilleja bella is a species in the Castilleja genus known by the common name Arteaga Indian paintbrush (Spanish: Pincel de Indio de Arteaga). It is native to northeastern Mexico, primarily the states of Nuevo León and Coahuila, where it grows in montane habitats.
Description
Castilleja bella is a perennial, herbaceous, and hemiparasitic angiosperm that grows in montane habitats above altitudes of 2,500 meters above sea level. It has erect stems that are typically under 10cm in height, and its inflorescences consists of bracts in shades of bright red.
Image gallery
References
External links
Kew Plants of the World Online profile for Castilleja bella
Castilleja bella Standl. photo gallery by Mark Egger
bella
Flora of Mexico
Taxa named by Paul Carpenter Standley
|
```c++
//===- subzero/src/IceInstrumentation.cpp - ICE instrumentation framework -===//
//
// The Subzero Code Generator
//
// This file is distributed under the University of Illinois Open Source
//
//===your_sha256_hash------===//
///
/// \file
/// \brief Implements the Ice::Instrumentation class.
///
/// Subclasses can override particular instrumentation methods to specify how
/// the the target program should be instrumented.
///
//===your_sha256_hash------===//
#include "IceInstrumentation.h"
#include "IceCfg.h"
#include "IceInst.h"
#include "IceTargetLowering.h"
namespace Ice {
// Iterate through the instructions in the given CFG and instrument each one.
// Also instrument the beginning of the function.
void Instrumentation::instrumentFunc(Cfg *Func) {
assert(Func);
assert(!Func->getNodes().empty());
if (!isInstrumentable(Func))
return;
bool DidInstrumentEntry = false;
LoweringContext Context;
Context.init(Func->getNodes().front());
for (CfgNode *Node : Func->getNodes()) {
Context.init(Node);
while (!Context.atEnd()) {
if (!DidInstrumentEntry) {
instrumentFuncStart(Context);
DidInstrumentEntry = true;
}
instrumentInst(Context);
// go to next undeleted instruction
Context.advanceCur();
Context.advanceNext();
}
}
std::string FuncName = Func->getFunctionName().toStringOrEmpty();
if (FuncName == "_start")
instrumentStart(Func);
finishFunc(Func);
}
void Instrumentation::instrumentInst(LoweringContext &Context) {
assert(!Context.atEnd());
Inst *Instr = iteratorToInst(Context.getCur());
switch (Instr->getKind()) {
case Inst::Alloca:
instrumentAlloca(Context, llvm::cast<InstAlloca>(Instr));
break;
case Inst::Arithmetic:
instrumentArithmetic(Context, llvm::cast<InstArithmetic>(Instr));
break;
case Inst::Br:
instrumentBr(Context, llvm::cast<InstBr>(Instr));
break;
case Inst::Call:
instrumentCall(Context, llvm::cast<InstCall>(Instr));
break;
case Inst::Cast:
instrumentCast(Context, llvm::cast<InstCast>(Instr));
break;
case Inst::ExtractElement:
instrumentExtractElement(Context, llvm::cast<InstExtractElement>(Instr));
break;
case Inst::Fcmp:
instrumentFcmp(Context, llvm::cast<InstFcmp>(Instr));
break;
case Inst::Icmp:
instrumentIcmp(Context, llvm::cast<InstIcmp>(Instr));
break;
case Inst::InsertElement:
instrumentInsertElement(Context, llvm::cast<InstInsertElement>(Instr));
break;
case Inst::Intrinsic:
instrumentIntrinsic(Context, llvm::cast<InstIntrinsic>(Instr));
break;
case Inst::Load:
instrumentLoad(Context, llvm::cast<InstLoad>(Instr));
break;
case Inst::Phi:
instrumentPhi(Context, llvm::cast<InstPhi>(Instr));
break;
case Inst::Ret:
instrumentRet(Context, llvm::cast<InstRet>(Instr));
break;
case Inst::Select:
instrumentSelect(Context, llvm::cast<InstSelect>(Instr));
break;
case Inst::Store:
instrumentStore(Context, llvm::cast<InstStore>(Instr));
break;
case Inst::Switch:
instrumentSwitch(Context, llvm::cast<InstSwitch>(Instr));
break;
case Inst::Unreachable:
instrumentUnreachable(Context, llvm::cast<InstUnreachable>(Instr));
break;
default:
// Only instrument high-level ICE instructions
assert(false && "Instrumentation encountered an unexpected instruction");
break;
}
}
void Instrumentation::setHasSeenGlobals() {
{
std::unique_lock<std::mutex> _(GlobalsSeenMutex);
HasSeenGlobals = true;
}
GlobalsSeenCV.notify_all();
}
LockedPtr<VariableDeclarationList> Instrumentation::getGlobals() {
std::unique_lock<std::mutex> GlobalsLock(GlobalsSeenMutex);
GlobalsSeenCV.wait(GlobalsLock, [this] { return HasSeenGlobals; });
return Ctx->getGlobals();
}
} // end of namespace Ice
```
|
```xml
import teamPermanentDeleter from "@server/commands/teamPermanentDeleter";
import { Team } from "@server/models";
import BaseTask, { TaskPriority } from "./BaseTask";
type Props = {
/** The team ID to permanantly destroy */
teamId: string;
};
export default class CleanupDeletedTeamTask extends BaseTask<Props> {
public async perform({ teamId }: Props) {
const team = await Team.findByPk(teamId, {
paranoid: false,
rejectOnEmpty: true,
});
await teamPermanentDeleter(team);
}
public get options() {
return {
attempts: 1,
priority: TaskPriority.Background,
};
}
}
```
|
Anna Slunga-Tallberg (born 5 February 1962) is a Finnish sailor. She competed in the women's 470 event at the 1992 Summer Olympics.
References
External links
1962 births
Living people
Finnish female sailors (sport)
Olympic sailors for Finland
Sailors at the 1992 Summer Olympics – 470
Sportspeople from Helsinki
|
Phyllaristomyia is a genus of parasitic flies in the family Tachinidae. There is one described species in Phyllaristomyia, P. fiebrigi.
References
Further reading
Tachinidae
Monotypic Brachycera genera
Articles created by Qbugbot
|
OJSC Novosibirskenergo (TGK-11; ) was an electric power generation, transfer and distribution company located in Novosibirsk Oblast.
Overview
As of 2007, the company has 6 electric power stations, with a total installed electric capacity of 2,977 MW. Most of them run on coal, gas or oil. The largest station is TPP-5, which had its first unit launched in 1985; it has a capacity of 1,200 MW. The company also runs the Novosibirsk Hydroelectric Station with an installed capacity of 455 MW. Its first unit was launched in 1957.
Revenue in 2007 was RUB 21,875.00 million, while operating profit was RUB 2,819.00 million.
The company was created in 1993 as part of the privatization of Russia's energy system. It has 14,067 employees. Its headquarters are located in the city Novosibirsk in Novosibirsk Oblast. The company is controlled by Mikhail Abyzov.
The company stopped generating energy in 2011, with its power plants ending up with Sibeko. Novosibirskenergo was liquidated in December 2015.
References
External links
Official website (archived)
Companies based in Novosibirsk
Defunct electric power companies of Russia
Companies formerly listed on the Moscow Exchange
|
```public key
ecdsa-sha2-nistp384 your_sha256_hashkF2q+8m58EvtZq4mDGgcVEzafPRuNIn1018m9KuqNpOQ6d+435n+MRYThe4MUdijSIDuopX2i14Z35oKZ9x2LsV+RxQczjmbnoWZdvgcvdOo6jiJdY7XJw== Key.OPENSSH.ECDSA384.Encrypted
```
|
Rambahadur Limbu, (; 8 July 1939 – 22 April 2023) was a Nepalese Gurkha and recipient of the Victoria Cross, the highest award for gallantry in the face of the enemy that can be awarded to British and Commonwealth forces. Rambahadur Limbu belonged to the Begha Clan of Limbu people of Nepal. Limbu was born in Chyangthapu village, Tehrathum, in East Nepal, and later lived in Damak.
Military career
Victoria Cross
In November 1965, Limbu was 26 years old, and was a lance corporal in the 2nd Battalion, 10th Princess Mary's Own Gurkha Rifles, British Army during the Indonesian Confrontation. On 21 November in Sarawak, Borneo, Limbu was in an advance party of 16 Gurkhas when they encountered about 30 Indonesians holding a position on the top of a jungle-covered hill. Limbu went forward with two men, but when they were only ten yards from the enemy machine-gun position, the sentry opened fire on them, whereupon Limbu rushed forward and killed him with a grenade. The remaining enemy combatants then opened fire on the small party, wounding the two men with Limbu. Limbu then made three journeys into the open under heavy fire, two to drag his comrades to safety and one to retrieve their Bren gun, with which he charged down and killed many of the enemy.
Extracts from citation
The medal was presented by the Queen in a ceremony at Buckingham Palace in 1966. Limbu's five-year-old son attended with his father.
His original Victoria Cross was stolen, along with all his other possessions, while he was asleep during a train journey in India to his native Nepal in 1967. It has never been found, and he was issued with a replacement.
Later career
Limbu reached the rank of captain, as a Queen's Gurkha Officer (QGO), and was appointed Member of the Royal Victorian Order (MVO) in 1984 for his service as Queen's Gurkha Orderly Officer. He then retired from active service in 1985.
Death
Limbu died from heart and kidney failure in Lalitpur on 22 April 2023, aged 83.
In the media
Limbu was interviewed for the 2006 television docudrama Victoria Cross Heroes which also included archive footage and dramatisations of his actions.
Medal entitlement
Captain Rambahadur Limbu was entitled to the following medals;
See also
List of Brigade of Gurkhas recipients of the Victoria Cross
References
External links
The Jungle War – Borneo, Brunei and Sarawak (including background to VC action)
1939 births
2023 deaths
Nepalese recipients of the Victoria Cross
Royal Gurkha Rifles officers
Royal Gurkha Rifles soldiers
Honorary Members of the Royal Victorian Order
British Army recipients of the Victoria Cross
Limbu people
People from Panchthar District
British Army personnel of the Indonesia–Malaysia confrontation
British Army personnel of the Malayan Emergency
|
```java
*
* 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 org.flowable.engine.test.el.function;
import static org.assertj.core.api.Assertions.assertThat;
import java.util.Arrays;
import org.apache.commons.codec.binary.Base64;
import org.flowable.engine.impl.test.PluggableFlowableTestCase;
import org.flowable.engine.runtime.ProcessInstance;
import org.flowable.engine.test.Deployment;
import org.junit.jupiter.api.Test;
/**
* Note that the function expressions also are tested in the cmmn module (VariableFunctionDelegatesTest),
* as such this test will not test the detailed behavior, but simply that it works in BPMN context.
*
* @author Joram Barrez
*/
public class VariableExpressionFunctionsTest extends PluggableFlowableTestCase{
@Test
@Deployment
public void testGetVariable() {
ProcessInstance processInstance = runtimeService.startProcessInstanceByKey("testExpressionFunction");
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", "go to A")
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("A");
}
@Test
@Deployment
public void testGetVariableOrDefault() {
ProcessInstance processInstance = runtimeService.startProcessInstanceByKey("testExpressionFunction");
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("A"); // Default is 123
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", 1)
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", 999)
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("A");
}
@Test
@Deployment
public void testGetVariableContains() {
ProcessInstance processInstance = runtimeService.startProcessInstanceByKey("testExpressionFunction");
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", Arrays.asList(2, 3, 4))
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", Arrays.asList(1, 2, 3, 4))
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("A");
}
@Test
@Deployment
public void testGetVariableContainsAny() {
ProcessInstance processInstance = runtimeService.startProcessInstanceByKey("testExpressionFunction");
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", Arrays.asList(3, 4))
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", Arrays.asList(2, 3, 4))
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("A");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", Arrays.asList(1, 2, 3, 4))
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("A");
}
@Test
@Deployment
public void testGetVariableEquals() {
ProcessInstance processInstance = runtimeService.startProcessInstanceByKey("testExpressionFunction");
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", 12)
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", 123)
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("A");
}
@Test
@Deployment
public void testGetVariableNotEquals() {
ProcessInstance processInstance = runtimeService.startProcessInstanceByKey("testExpressionFunction");
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", "hello")
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", "test")
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("A");
}
@Test
@Deployment
public void testGetVariableExists() {
ProcessInstance processInstance = runtimeService.startProcessInstanceByKey("testExpressionFunction");
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", "hello")
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("A");
}
@Test
@Deployment
public void testGetVariableIsEmpty() {
ProcessInstance processInstance = runtimeService.startProcessInstanceByKey("testExpressionFunction");
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("A");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", "")
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("A");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", "abc")
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
}
@Test
@Deployment
public void testGetVariableIsNotEmpty() {
ProcessInstance processInstance = runtimeService.startProcessInstanceByKey("testExpressionFunction");
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", "")
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", "abc")
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("A");
}
@Test
@Deployment
public void testGetVariableLowerThan() {
ProcessInstance processInstance = runtimeService.startProcessInstanceByKey("testExpressionFunction");
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", 1)
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("A");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", 10)
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", 11)
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
}
@Test
@Deployment
public void testGetVariableLowerThanOrEqual() {
ProcessInstance processInstance = runtimeService.startProcessInstanceByKey("testExpressionFunction");
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", 1)
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("A");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", 10)
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("A");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", 11)
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
}
@Test
@Deployment
public void testGetVariableGreaterThan() {
ProcessInstance processInstance = runtimeService.startProcessInstanceByKey("testExpressionFunction");
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", 1)
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", 10)
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", 11)
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("A");
}
@Test
@Deployment
public void testGetVariableGreaterThanOrEqual() {
ProcessInstance processInstance = runtimeService.startProcessInstanceByKey("testExpressionFunction");
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", 1)
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", 10)
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("A");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", 11)
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("A");
}
@Test
@Deployment
public void testVariableBase64() {
ProcessInstance processInstance = runtimeService.startProcessInstanceByKey("testExpressionFunction");
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", "test")
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", "hello")
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("A");
}
@Test
@Deployment
public void testVariableBase64Binary() {
ProcessInstance processInstance = runtimeService.startProcessInstanceByKey("testExpressionFunction");
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", Base64.decodeBase64("SGFsbG8sIGhhbGxvIC0gVGVzdCBXUk9ORyE="))
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("B");
processInstance = runtimeService.createProcessInstanceBuilder()
.processDefinitionKey("testExpressionFunction")
.variable("myVar", Base64.decodeBase64("SGFsbG8sIGhhbGxvIC0gVGVzdA=="))
.start();
assertThat(taskService.createTaskQuery().processInstanceId(processInstance.getId()).singleResult().getName()).isEqualTo("A");
}
}
```
|
```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.
*/
// Code generated by client-gen. DO NOT EDIT.
package fake
import (
"context"
json "encoding/json"
"fmt"
v1beta2 "k8s.io/api/apps/v1beta2"
v1 "k8s.io/apimachinery/pkg/apis/meta/v1"
labels "k8s.io/apimachinery/pkg/labels"
types "k8s.io/apimachinery/pkg/types"
watch "k8s.io/apimachinery/pkg/watch"
appsv1beta2 "k8s.io/client-go/applyconfigurations/apps/v1beta2"
testing "k8s.io/client-go/testing"
)
// FakeReplicaSets implements ReplicaSetInterface
type FakeReplicaSets struct {
Fake *FakeAppsV1beta2
ns string
}
var replicasetsResource = v1beta2.SchemeGroupVersion.WithResource("replicasets")
var replicasetsKind = v1beta2.SchemeGroupVersion.WithKind("ReplicaSet")
// Get takes name of the replicaSet, and returns the corresponding replicaSet object, and an error if there is any.
func (c *FakeReplicaSets) Get(ctx context.Context, name string, options v1.GetOptions) (result *v1beta2.ReplicaSet, err error) {
obj, err := c.Fake.
Invokes(testing.NewGetAction(replicasetsResource, c.ns, name), &v1beta2.ReplicaSet{})
if obj == nil {
return nil, err
}
return obj.(*v1beta2.ReplicaSet), err
}
// List takes label and field selectors, and returns the list of ReplicaSets that match those selectors.
func (c *FakeReplicaSets) List(ctx context.Context, opts v1.ListOptions) (result *v1beta2.ReplicaSetList, err error) {
obj, err := c.Fake.
Invokes(testing.NewListAction(replicasetsResource, replicasetsKind, c.ns, opts), &v1beta2.ReplicaSetList{})
if obj == nil {
return nil, err
}
label, _, _ := testing.ExtractFromListOptions(opts)
if label == nil {
label = labels.Everything()
}
list := &v1beta2.ReplicaSetList{ListMeta: obj.(*v1beta2.ReplicaSetList).ListMeta}
for _, item := range obj.(*v1beta2.ReplicaSetList).Items {
if label.Matches(labels.Set(item.Labels)) {
list.Items = append(list.Items, item)
}
}
return list, err
}
// Watch returns a watch.Interface that watches the requested replicaSets.
func (c *FakeReplicaSets) Watch(ctx context.Context, opts v1.ListOptions) (watch.Interface, error) {
return c.Fake.
InvokesWatch(testing.NewWatchAction(replicasetsResource, c.ns, opts))
}
// Create takes the representation of a replicaSet and creates it. Returns the server's representation of the replicaSet, and an error, if there is any.
func (c *FakeReplicaSets) Create(ctx context.Context, replicaSet *v1beta2.ReplicaSet, opts v1.CreateOptions) (result *v1beta2.ReplicaSet, err error) {
obj, err := c.Fake.
Invokes(testing.NewCreateAction(replicasetsResource, c.ns, replicaSet), &v1beta2.ReplicaSet{})
if obj == nil {
return nil, err
}
return obj.(*v1beta2.ReplicaSet), err
}
// Update takes the representation of a replicaSet and updates it. Returns the server's representation of the replicaSet, and an error, if there is any.
func (c *FakeReplicaSets) Update(ctx context.Context, replicaSet *v1beta2.ReplicaSet, opts v1.UpdateOptions) (result *v1beta2.ReplicaSet, err error) {
obj, err := c.Fake.
Invokes(testing.NewUpdateAction(replicasetsResource, c.ns, replicaSet), &v1beta2.ReplicaSet{})
if obj == nil {
return nil, err
}
return obj.(*v1beta2.ReplicaSet), err
}
// UpdateStatus was generated because the type contains a Status member.
// Add a +genclient:noStatus comment above the type to avoid generating UpdateStatus().
func (c *FakeReplicaSets) UpdateStatus(ctx context.Context, replicaSet *v1beta2.ReplicaSet, opts v1.UpdateOptions) (*v1beta2.ReplicaSet, error) {
obj, err := c.Fake.
Invokes(testing.NewUpdateSubresourceAction(replicasetsResource, "status", c.ns, replicaSet), &v1beta2.ReplicaSet{})
if obj == nil {
return nil, err
}
return obj.(*v1beta2.ReplicaSet), err
}
// Delete takes name of the replicaSet and deletes it. Returns an error if one occurs.
func (c *FakeReplicaSets) Delete(ctx context.Context, name string, opts v1.DeleteOptions) error {
_, err := c.Fake.
Invokes(testing.NewDeleteActionWithOptions(replicasetsResource, c.ns, name, opts), &v1beta2.ReplicaSet{})
return err
}
// DeleteCollection deletes a collection of objects.
func (c *FakeReplicaSets) DeleteCollection(ctx context.Context, opts v1.DeleteOptions, listOpts v1.ListOptions) error {
action := testing.NewDeleteCollectionAction(replicasetsResource, c.ns, listOpts)
_, err := c.Fake.Invokes(action, &v1beta2.ReplicaSetList{})
return err
}
// Patch applies the patch and returns the patched replicaSet.
func (c *FakeReplicaSets) Patch(ctx context.Context, name string, pt types.PatchType, data []byte, opts v1.PatchOptions, subresources ...string) (result *v1beta2.ReplicaSet, err error) {
obj, err := c.Fake.
Invokes(testing.NewPatchSubresourceAction(replicasetsResource, c.ns, name, pt, data, subresources...), &v1beta2.ReplicaSet{})
if obj == nil {
return nil, err
}
return obj.(*v1beta2.ReplicaSet), err
}
// Apply takes the given apply declarative configuration, applies it and returns the applied replicaSet.
func (c *FakeReplicaSets) Apply(ctx context.Context, replicaSet *appsv1beta2.ReplicaSetApplyConfiguration, opts v1.ApplyOptions) (result *v1beta2.ReplicaSet, err error) {
if replicaSet == nil {
return nil, fmt.Errorf("replicaSet provided to Apply must not be nil")
}
data, err := json.Marshal(replicaSet)
if err != nil {
return nil, err
}
name := replicaSet.Name
if name == nil {
return nil, fmt.Errorf("replicaSet.Name must be provided to Apply")
}
obj, err := c.Fake.
Invokes(testing.NewPatchSubresourceAction(replicasetsResource, c.ns, *name, types.ApplyPatchType, data), &v1beta2.ReplicaSet{})
if obj == nil {
return nil, err
}
return obj.(*v1beta2.ReplicaSet), err
}
// ApplyStatus was generated because the type contains a Status member.
// Add a +genclient:noStatus comment above the type to avoid generating ApplyStatus().
func (c *FakeReplicaSets) ApplyStatus(ctx context.Context, replicaSet *appsv1beta2.ReplicaSetApplyConfiguration, opts v1.ApplyOptions) (result *v1beta2.ReplicaSet, err error) {
if replicaSet == nil {
return nil, fmt.Errorf("replicaSet provided to Apply must not be nil")
}
data, err := json.Marshal(replicaSet)
if err != nil {
return nil, err
}
name := replicaSet.Name
if name == nil {
return nil, fmt.Errorf("replicaSet.Name must be provided to Apply")
}
obj, err := c.Fake.
Invokes(testing.NewPatchSubresourceAction(replicasetsResource, c.ns, *name, types.ApplyPatchType, data, "status"), &v1beta2.ReplicaSet{})
if obj == nil {
return nil, err
}
return obj.(*v1beta2.ReplicaSet), err
}
```
|
```smalltalk
/*******************************************************************************
*
* Author:
* Create Date: 2014-02-19 9:21:41
*
* Description: Git.Framework
* path_to_url
* Revision History:
* Date Author Description
* 2014-02-19 9:21:41
*********************************************************************************/
using Aspose.Cells;
using System;
using System.Collections.Generic;
using System.Data;
using System.Linq;
using System.Text;
namespace Git.Storage.Common.Excel
{
/// <summary>
/// Excel
/// </summary>
public class AsposeExcel
{
private string outFileName = "";
private string fullFilename = "";
private Workbook book = null;
private Worksheet sheet = null;
private Action<Cell> action = (Cell cellItem) =>
{
cellItem.Style.Borders[BorderType.BottomBorder].LineStyle = CellBorderType.Thin;
cellItem.Style.Borders[BorderType.BottomBorder].Color = System.Drawing.Color.Black;
cellItem.Style.Borders[BorderType.TopBorder].LineStyle = CellBorderType.Thin;
cellItem.Style.Borders[BorderType.TopBorder].Color = System.Drawing.Color.Black;
cellItem.Style.Borders[BorderType.LeftBorder].LineStyle = CellBorderType.Thin;
cellItem.Style.Borders[BorderType.LeftBorder].Color = System.Drawing.Color.Black;
cellItem.Style.Borders[BorderType.RightBorder].LineStyle = CellBorderType.Thin;
cellItem.Style.Borders[BorderType.RightBorder].Color = System.Drawing.Color.Black;
};
/// <summary>
/// //
/// </summary>
/// <param name="outfilename"></param>
/// <param name="tempfilename"></param>
public AsposeExcel(string outfilename, string tempfilename)
{
outFileName = outfilename;
book = new Workbook();
// book.Open(tempfilename);
sheet = book.Worksheets[0];
}
/// <summary>
/// //
/// </summary>
/// <param name="fullfilename"></param>
public AsposeExcel(string fullfilename)
{
fullFilename = fullfilename;
}
private void AddTitle(string title, int columnCount)
{
sheet.Cells.Merge(0, 0, 2, columnCount);
Cell cell1 = sheet.Cells[0, 0];
cell1.PutValue(title);
cell1.Style.HorizontalAlignment = TextAlignmentType.Center;
//cell1.Style.Font.Color = System.Drawing.Color.Blue;
cell1.Style.Font.Size = 20;
cell1.Style.Font.IsBold = true;
}
private void AddHeader(DataTable dt)
{
for (int col = 0; col < dt.Columns.Count; col++)
{
action(sheet.Cells[2, col]);
sheet.Cells[2, col].PutValue(dt.Columns[col].ColumnName);
sheet.Cells[2, col].Style.Font.IsBold = true;
// sheet.Cells[2, col].Style.Font.Size = 13;
}
}
private void AddBody(DataTable dt)
{
for (int r = 0; r < dt.Rows.Count; r++)
{
for (int c = 0; c < dt.Columns.Count; c++)
{
action(sheet.Cells[r + 3, c]);
sheet.Cells[r + 3, c].PutValue(dt.Rows[r][c].ToString());
}
}
}
/// <summary>
/// //------------
/// </summary>
/// <param name="dt"></param>
/// <returns></returns>
public Boolean DatatableToExcel(DataTable dt, string sheetName, string title)
{
Boolean yn = false;
try
{
sheet.Name = sheetName;
AddTitle(title, dt.Columns.Count);
AddHeader(dt);
AddBody(dt);
sheet.AutoFitColumns();
book.Save(outFileName);
yn = true;
return yn;
}
catch (Exception e)
{
return yn;
}
}
/// <summary>
///
/// </summary>
/// <returns></returns>
public DataTable ExcelToDatatalbe(string sheetName)
{
Workbook book = new Workbook();
book.Open(fullFilename);
Worksheet sheet = book.Worksheets[sheetName];
Cells cells = sheet.Cells;
DataTable dt_Import = cells.ExportDataTableAsString(0, 0, cells.MaxDataRow + 1, cells.MaxDataColumn + 1, true);
return dt_Import;
}
}
}
```
|
P. alpinum may refer to:
Papaver alpinum, the Alpine poppy, a plant species found in the Alps
Parthenium alpinum, the Alpine feverfew and Wyoming feverfew, a flowering plant species native to Wyoming, Colorado, and New Mexico in the United States
Phleum alpinum, the Alpine timothy or Mountain timothy, a grass species with a circumboreal distribution
|
Saimir Kastrati (born 7 March 1987 in Laç) is an Albanian football player who most recently plays for Besëlidhja Lezhë in the Albanian First Division.
References
External links
1987 births
Living people
People from Laç
Sportspeople from Lezhë County
Men's association football defenders
Albanian men's footballers
KF Laçi players
KF Adriatiku Mamurras players
KF Besëlidhja Lezhë players
Kategoria Superiore players
Kategoria e Parë players
|
The history of the Australia Fed Cup team dates back to the first ever Federation Cup in 1963
1963–1971: Early dominance
Australia was one of sixteen nations that competed in the first Fed Cup competition in 1963, at Queen's Club in London. The first team consisted of doubles and singles Grand Slam winner and World No. 1 Margaret Smith, Australian Open singles finalist and doubles winner Jan O'Neill, and multi-Grand Slam winner Lesley Turner. It was also captained by Nell Hall Hopman, who was also a major tennis player and one of the key campaigners for the tournament's introduction. As a result of their eminent team, the Australians were able to defeat the Belgians, Hungarians and South Africans all without losing a rubber to reach the final against the United States. In the final, Smith defeated multi-Grand Slam winner Darlene Hard in straight sets, 6–0, 6–3, to win the first rubber. However, Turner was unable to beat doubles Grand Slam champion Billie Jean Moffitt, and Smith and Turner were defeated in doubles by Moffitt and Hard, meaning the Americans won their first tournament.
However, the Australians were able to enact their revenge by defeating the Americans and winning the next two titles at Philadelphia in 1964 and Melbourne in 1965. However, Smith retired before the 1966 tournament to marry Barry Court and start a family. This meant that the team, without the services of their most prolific player, was unable to reach the final of the next two tournaments: losing to West Germany in 1966 and Great Britain in 1967. However, Court returned to tennis and the Fed Cup team in 1968 where she, with the sole assistance of top 10 player and doubles Grand Slam winner Kerry Melville, was able to win the Cup while only dropping one rubber to South Africa. Their form continued to 1969; with the addition of Wimbledon finalist and multiple doubles Grand Slam winner Judy Tegart, they were able to reach the final against the United States. Though they lost 1–2, Tegart teamed up with doubles Grand Slam champion Karen Krantzcke to win the 1970 tournament, while Court teamed up with Lesley Hunt and then up-and-coming player Evonne Goolagong to win the 1971 Federation Cup on Australian soil without losing a rubber. This meant that Australia had surpassed the United States to hold the record at that time for most Fed Cup titles, with five.
1972–1980: Eight consecutive finals
The 1971 Federation Cup, which took place in December 1970, transpired to be Court's last. Thus Goolagong, who had by 1972 reached the top 10 and won two Grand Slams in singles and one in doubles, took over to become Australia's most prolific player. While in 1972, when the team consisted of Goolagong, French Open finalist Helen Gourlay, and Hunt, they only managed a semifinal finish, they won the title in 1973 with Goolagong, Patricia Coleman and Janet Young, and in 1974 with Goolagong, Dianne Fromholtz and Young while only losing one tie in total.
In 1975, Australia once again reached the final with the team of Goolagong, Fromholtz and Gourlay. However, they were defeated by Czechoslovakia, 0–3, with Renáta Tomanová and Martina Navratilova overcoming them in only 36 games. Melville returned to the team in 1976 under her married name of Reid and she, alongside Goolagong (who reached the World No. 1 ranking for two weeks) and Fromholtz sent Australia to the final for the fourth consecutive time. They were still unable to claim their eighth title, nevertheless; on this occasion they were defeated by their old rivals from the United States, World No. 5 and successful doubles player Rosemary Casals and Moffitt, then known as Billie Jean King, who had become one of the most efficacious players of all time. After this tournament Goolagong left the Fed Cup team for a while, leaving it in the hands of Fromholtz, Reid and Top 10 player Wendy Turnbull. This team made four more consecutive final appearances for the Australian team, but in every one of them they were defeated by the Americans, mainly due to the presence of Casals and King alongside World No. 1 players Chris Evert and Tracy Austin. In 1979 the Americans surpassed the Australian record of most Fed Cup titles with eight, a record which stands to the present day.
1981–1991: Gradual decline
In 1981, Australia's streak of consecutive finals was broken when they were defeated in the semifinals by the British team of Sue Barker and Virginia Wade. The Australians once again failed to reach the final in 1982, when they were defeated by West Germany in the semifinals, and in 1983 when they were defeated in the quarterfinals by Switzerland; marking the first time in Fed Cup history when the Australians failed to reach the last four.
In 1984, however, the Australian team once again reached a final with a new team composed of Turnbull, sisters and junior champions Anne and Elizabeth Minter, and mixed doubles champion Elizabeth Sayers. They defeated their rivals from West Germany and United States in the quarterfinals and semifinals respectively, but were once again unable to defeat the Czechoslovakian team, this time composed of Helena Suková and Hana Mandlíková, in the final. Nevertheless, this success did not last, as the team was beaten in the semifinals the following year (by United States) and from then on for three consecutive years only be able to make quarterfinal appearances (being defeated by Czechoslovakia in 1986, Bulgaria in 1987 and West Germany in 1988).
In the Year-End rankings of 1987, Australia for the first time had no players within the singles Top 20, and in 1988 had only one player, Anne Minter, within the Top 30. These results transpired into their Fed Cup performance, where despite a semifinal showing in 1989, they had their earliest finishes in 1990 and 1991, when the team was defeated in the second round. On both occasions the highest ranked player in the side was below the Top 35.
1992–1994: Momentary return to success
Despite the decline, the Australian team had a brief spurt of renewed success in 1992 and 1993, mainly due to Top 50 singles and accomplished doubles player Nicole Provis. In 1992, the team was able to defeat Bulgaria in the first round despite the appearance of Top 20 singles players Katerina Maleeva and Magdalena Maleeva, and Austria in the second round in spite of another Top 20 singles player in Judith Wiesner also being present. This set up a quarterfinal tie against the Czechoslovakians, who were accompanied by Top 20 singles player Helena Suková and Jana Novotná, one of the most consistent singles players and greatest doubles players of all time. While Rachel McQuillan lost to Suková in three sets, Provis was able to cause two upsets by defeating Novotná in singles, and doubles alongside Rennae Stubbs both in straight sets. This led to the Australians proceeding to their first semifinal since 1985. However, they were defeated in the next round by celebrated all-round players Conchita Martínez and Arantxa Sánchez Vicario, as well as future doubles World No. 1 Virginia Ruano Pascual from Spain.
1993 saw an ever greater level of success for Australia, despite a daunting first round draw against the defending champions from Germany. Anke Huber easily defeated Elizabeth Smylie in straight sets to bring a 1–0 lead to the Germans, but after that Provis, then ranked No. 28 in singles, caused a massive upset by defeating World No. 1 and thirteen-time Grand Slam champion Steffi Graf in three sets. Prior to the rubber, Graf had met Provis four times, each time defeating her in straight sets, and had never lost a Fed Cup tie. While Graf had been struggling with an aching shoulder at the time, the match is still remembered as one of the greatest in Australian Fed Cup history, and Provis' career-best win. Following the win, Smylie and Stubbs ended up beating Huber and Barbara Rittner in doubles to ultimately defeat the Germans and create the first ever first-round loss for a defending champion in Fed Cup history.
The Australians then accumulated two more easy wins by defeating Denmark in the second round and Finland in the quarterfinals without losing a rubber. This led to a second consecutive semifinal appearance, and a tie against Argentina. The Argentinians and Australians split the singles, with Provis rallying to a three set victory over Florencia Labat, while Smylie and Stubbs won the doubles and lead their team to a 2–1 victory. This caused the Australians to unexpectedly reach their first final since 1984, and set up a tie once against the Spaniards. They were, however, comprehensively defeated once again by Martínez and Sánchez Vicario, respectively ranked No. 6 and No. 3 in singles, 0–3.
The Australians nevertheless failed to repeat their achievements in 1994. Provis left tennis that year to marry basketballer Mark Bradtke, meaning that she was replaced by Top 50 singles player Kristine Radford. Radford did not perform well at the tournament, losing all of her matches. Consequently, Australia only scraped a first round victory over Latvia thanks to wins from McQuillan in singles and Smylie and Stubbs in doubles, and were beaten in the second round by Austria. Australia thus had to contend with their third Round-of-16 defeat in five years.
1995–1999: World Group II
In 1995, after the format of the Fed Cup was changed to try and mirror the success that the Davis Cup had with theirs, and to provide the nations with more opportunities to play on their home soil, Australia competed in World Group II. Provis rejoined the team with McQuillan and Stubbs as the newly married Nicole Bradtke. They were drawn against Slovakia and scheduled to play in Perth. Despite McQuillan losing both of her singles matches to Karina Habšudová and Radka Zrubáková, Bradtke was able to defeat both in singles and in doubles alongside Stubbs, meaning Australia progressed to the first World Group play-offs.
The Australians were drawn against Argentina in San Miguel for their Play-off to decide which team would enter the World Group. The same team that defeated the Slovaks were sent to Argentina for the tie, but they were defeated, 0–5, by Gabriela Sabatini, Florencia Labat and Inés Gorrochategui. The Australians thus fell back to World Group II for 1996.
1996 saw the Australians lose their World Group II tie to the Netherlands after McQuillan and Stubbs lost all their singles rubbers. They avoided relegation to Zonal Competition, however, by defeating the Canadians, 3–2, in the first ever comeback from 0–2 in Fed Cup history.
1997 saw the retirement of Bradtke after a shoulder injury, which meant that Australia hit a low in women's tennis after regularly lacking more than one team in the Top 100. However, despite never making the World Group, they also avoided regulation to zonal competition in 1997 and 1998. Annabel Ellwood and Kerry-Anne Guse joined the team alongside McQuillan and Kristine Kunce (née Radford), and while they had a victory over South Africa which included an upset of Top 15 player Amanda Coetzer on behalf Top 120 player McQuillan, they could not defeat Spain in the World Group play-offs, despite playing on home soil, and thus did not achieve an opportunity to win the Fed Cup in the World Group. The team suffered more ill fortune in their next tie when Guse and McQuillan could not defeat the Russians in singles at Perth, despite the opponents not having their top players World No. 16 Anna Kournikova and World No. 37 Elena Likhovtseva and thus were relegated to their second World Group II play-offs.
Their tie, drawn against Argentina and held at Canberra, featured a return of McQuillan and Guse but also a debut of Nicole Pratt and junior star Jelena Dokic. The new team performed brilliantly, as Dokic and Pratt won all their singles matches and Guse and McQuillan handily won their doubles match. This allowed Australia to play in World Group II for the fifth consecutive year, the only country to do so.
In 1999, Australia lost their tie against Austria 2–3, despite being up 2–0 at one point. This meant they were relegated once again to the World Group II play-offs. Due to the revamped competition format that would take place in the next year, the team that placed first in the World Group II play-offs would advance to the 2000 World Group while all the others would be assigned Zonal Competition status. Australia won all three of their first matches, and therefore progressed through to the final play-off against the Netherlands. The Australian No. 2, Pratt, narrowly won the first rubber against Miriam Oremans, 6–4, 3–6, 10–8, while the Australian No. 1, Dokic, who defeated World No. 1 Hingis a few weeks earlier, defeated Kristie Boogert in straight sets. This meant that Australia progressed to their first World Group since 1994.
2000–2004: World Group failures
Australia was placed in Group C for the 2000 World Group, alongside Russia, France and Belgium. They played Belgium in their first tie, and lost 1–2. Despite all the matches being close three-setters and involving many match points savings, Australia's only win came from Dokic, who defeated fellow teenager Kim Clijsters in a two and a half hour match. This rhythm continued for the next two ties, where Australia failed to win a single rubber, but Dokic continued to win her next two singles matches. Australia thus placed last in the pool.
Due to their lack of success in 2000, the Australian team had to go through qualifying in 2001. Dokic, after an incredibly controversial relationship with Australia, decided to quit her citizenship and play instead for her ancestral homeland and birth country of Yugoslavia despite being the country's highest ranked player. This meant that, although efforts were made to keep her, she opted out of playing for future Fed Cup ties with the country, meaning Australian women's tennis was still without any sight of breaking its two-decade drought of any players within the top ten.
The new team was drawn against fellow 2000 World Group participants from Austria to play in Adelaide. The team took a quick 2–0 lead on the first day, and on the second day comprehensively gained the win after World No. 65 Nicole Pratt defeated Sylvia Plischke in straight sets, 20-year-old recognised rising star and World No. 128 Alicia Molik beat Marion Maruska also in straight sets, and McQuillan and Evie Dominikovic finished off the tie to beat Maruska and Patricia Wartusch in doubles to complete a 5–0 clean sweep. The Australians thus progressed to the second round of qualifying, where they were drawn against the Swiss to be played once again on Australian soil, in Sydney. Once again, the Australians were led by Pratt and Molik, while the Swiss were without their top player and thirteen-time Grand Slam champion Martina Hingis. The Australians once again took a quick 2–0 lead, and then went on to win 4–1 with their only loss coming to Molik from World No. 497 Myriam Casanova. The team thus progressed to the World Group, where they were originally placed in a group with second-seeds Belgium, fourth-seeds Spain and Russia. However, due a withdrawal by the defending champions from the United States caused by terrorist threats following the September 11 attacks, the group ended up consisting of Spain, Russia and America's replacement Germany. The team, despite once again being led by Molik and Pratt, was ultimately unsuccessful and failed to win a single rubber.
Australia's performance in 2001 did allow them to compete in the 2002 World Group, where they suffered a very unfortunate draw against the previous year's champions from Belgium; a match anticipated to be a clear Belgian victory due to the fact that their team consisted of singles World No. 3 Kim Clijsters and singles World No. 8 Justine Henin. The tie started as predicted, with Henin and Clijsters leading Belgium to an early 2–0 lead with easy wins over Pratt and Molik. However, Clijsters pulled out of further ties due to a shoulder injury, which led to hope for Australia after Pratt defeated her replacement Els Callens in straight sets. However, Henin soon closed off the tie, 3–1, for Belgium after easily defeating Molik in straight sets.
In the World Group play-offs, Australia was drawn against the Dutch. However, due to Pratt not taking part in the tie due to injury, the top ranked player in the team was World No. 71 Molik, and No. 177 Christina Wheeler had her Fed Cup debut as her replacement. Molik nevertheless ended up almost single-handedly winning the tie for her team, with the Australian media referring to her as "all-conquering" and a "heroine" after she won both her singles matches and the decisive doubles match alongside Rennae Stubbs. The team thus advanced back into the World Group once again.
In 2003, Australia suffered very similar fortunes. The team was once again drawn against a finalist from the previous in the first round of the World Group, in the form of Spain. Molik defeated Virginia Ruano Pascual after Spain's top player Conchita Martínez was forced out with a shoulder injury. but with two subsequent straight sets losses to Pratt from Magüi Serna and a recovered Martínez plus another straight loss from Serna to Molik once again led Australia to a first round defeat and assignment to the World Group play-offs. They narrowly avoided relegation by defeating Colombia, 3–2, after Molik and Stubbs defeated Catalina Castaño and Fabiola Zuluaga in the decisive doubles match.
2004 saw Australia drawn against Russia on Russian soil in the first round. This was considered another daunting task for Australia considering the Russians had six top twenty singles players while Australia had none, and only three top hundred singles players (Molik, Pratt and Samantha Stosur). Fears initially spelled true for the team, as Russia acquired a quick 2–0 lead after No. 5 Anastasia Myskina defeated Stosur in straight sets and No. 14 Svetlana Kuznetsova beat Molik in three. However, Molik managed a surprise upset in the third rubber, defeating Myskina, 6–3, 6–3. Nevertheless, Russia won the next two rubbers to send Australia to their third consecutive World Group Play-off.
They were drawn against Thailand in their Play-off, in a tie described by The Age as "crucial" and "critical". Nevertheless, Molik and Stubbs were not selected by Fed Cup team captain Evonne Goolagong, opting instead for Christina Wheeler and three-time WTA doubles titlist and Fed Cup debutante Lisa McShea, a move which The Sydney Morning Herald stated would "plumet the team to new lows". Molik stated she voluntarily withdrew, despite being Australia's highest ranked singles player, to concentrate on the upcoming Athens Olympics, while Stubbs' omission, in spite of winning a second Wimbledon doubles title the week before the tie, was said to be put down to "a clash of personalities". This situation proved costly for the team, as they lost the first three rubbers of the tie and thus were relegated down to zonal competition for the first time since the competition began, due to losses from Nicole Pratt and Samantha Stosur, and a final loss from Thailand No. 1 Tamarine Tanasugarn to Pratt. This was met with a negative attention in the Australian media, with Michael Cowley from The Sydney Morning Herald calling the team "losers", and The Age reporter Dan Oakes described Australian women's tennis as being "much-maligned". Highly regarded tennis player Todd Woodbridge also publicly criticised Australian tennis in light of this and other disappointing results, saying that Australian tennis "needs to start again" when searching for new talent.
2005–2008: Zonal competition
Despite the Fed Cup's lack of success, Molik's performance in singles became even more successful, with her, in January, becoming the first Australian since Anne Minter in 1988 to make the Australian Open quarterfinals, and first Australian woman to break the singles top ten in two decades. However, Molik made herself unavailable for the upcoming zonal competition leaving singles ranked 46 Samantha Stosur to lead a squad with Nicole Pratt, Evie Dominikovic, Stosur's doubles partner Bryanne Stewart. Pratt withdrew from the team after a reported pay issue, and as such Sophie Ferguson came in as a nineteen-year-old Fed Cup debutante. The Australian team was drawn in Pool B in the Asia/Oceania zone, with New Zealand, South Korea and Chinese Taipei.
The Australians played the New Zealanders first in their pool, and comprehensively beat them, 3–0, with Dominikovic defeating Leanne Baker, Stosur defeating Marina Erakovic, and Dominikovic and Stewart defeating Baker and Paula Marama despite the 35 °C heat. They then defeating Chinese Taipei, with Ferguson making her debut by handily beating Chao Hsiao-han before Stosur won her singles match and the doubles match alongside Stewart, and her performance receiving praise from the Fed Cup captain John Alexander. Australia then won against South Korea, 2–1, with wins coming from Dominikovic and Stosur in singles over Lee Ye-ra and Kim Jin-hee, to secure a place in the play-offs where the winner would advance to the World Group II play-offs. Despite China boasting Top 50 and Top 70 singles players Li Na and Zheng Jie, as well as Athens Olympics gold medalists Li Ting and Sun Tiantian, Alexander was confident for a win, saying that the team has "an excellent chance in all three matches." Despite this, the Chinese easily defeated the Australians, 2–0, with Sun and Zheng defeating Dominikovic and Stosur in singles. This meant that Australia would play in zonal competition for a second consecutive year.
In late 2005, former Yugoslavian World No. 4 Jelena Dokic made a sudden pledge to reapply for Australian citizenship and said that she would make herself available for the Fed Cup team. However, despite receiving a giant wildcard to play in the 2006 Australian Open as an Australian, she was ineligible for participation in the 2006 Fed Cup as she did not meet the ITF's requirements. With Molik having succumbed to an inner ear infection and a ranking that dropped out of the Top 200, this meant that the team for the upcoming Asia/Oceania Zone in South Korea would once again be led by Stosur, ranked No. 57, joined with Pratt, Stubbs and debutante Casey Dellacqua. The team was placed in Pool A alongside the hosts South Korea and Uzbekistan.
Australia easily defeated the Uzbekistanis, with Pratt and Stosur respectively beating Iroda Tulyaganova and Akgul Amanmuradova in straight sets, and then ended up winning their pool by defeating South Korea, 3–0, with Pratt and Stosur once again winning in singles and Stubbs and Stosur teaming up to complete the whitewash in doubles.
Australia then reached the Group I final for the second consecutive year and was drawn against the team that won Pool B, India. Dellacqua lost the first match to Shikha Uberoi in straight sets, but Stosur, despite being ranked seventeen spots lower than Sania Mirza, defeated her and even the tie. Stosur and Stubbs then teamed up again to win the final doubles rubber and secure Australia a spot in the World Group II play-offs.
Australia was drawn against the Swiss for their play-off, with the first ties taking place in Chavannes-de-Bogis, on 15 July. Stosur easily defeated 16-year-old Nicole Riner despite being down 0–40 in the first game, and Pratt backed that up with a surprise win over Swiss No. 1 Timea Bacsinszky. Stosur then completed Australia's win by defeating Bacsinszky, before Alicia Molik played in her first Fed Cup match since 2004 to beat Stefanie Vögele. Molik then teamed up with Stubbs to finish a clean sweep for promotion to World Group II.
Australia was drawn against Austria for their tie, in a tie where Australia yielded doubles No. 1 and singles No. 27 Stosur alongside resurgent top sixty players Pratt and Molik. Captain David Taylor thus stated he "liked the chances" of winning, despite Austria having a home court advantage and boasting recent WTA tour winners in Sybille Bammer and Tamira Paszek. Australia started extremely poorly, with Stosur being crushed in less than an hour by 16-year-old Paszek, and Molik also being defeated by Bammer despite serving for the first set at 5–3. Stosur and Molik then lost their next two singles matches to lose the overall tie and be relegated to the World Group II play-offs.
The team was drawn against Ukraine for their play-off, a tie which they would also host and be seeded for, making it the first time Australia would play a tie at home since 2003, a fact which Taylor believed would boost the chances of the team and Stosur in particular, who would be playing in her home state of Queensland. Pratt, Molik and Stubbs also compiled the team along with 15-year-old Isabella Holland as the hitting partner.
However, Stosur ended up pulling out of the tie, citing a virus that would turn out to be Lyme disease, meaning that near-top-hundred player Casey Dellacqua would join the team, and Pratt would replace Stosur as the highest singles player. Nevertheless, Molik, alongside Italian Mara Santangelo, ended up winning the French Open in doubles, and defeated the Ukrainian Bondarenko sisters Alona and Kateryna on her way to the Wimbledon semifinals. Despite the Bondarenko sisters both being top fifty players and Alona being ranked within the top twenty-five, Molik also had a positive win/loss record against both of them in singles, creating a situation where both teams expected victory and avoidance of the drop to zonal competition.
Molik and Alona Bondarenko opened the tie, with Pratt and Kateryna Bondarenko to follow, and despite the confidence of the Australians they lost their first two rubbers comprehensively; Pratt only able to win one game against Kateryna. The team then ultimately lost the tie, sending them back to the Asia/Oceania Zone for 2008, with Pratt losing to Alona in the third rubber, and Molik and Stubbs falling in doubles despite a lone singles win from Dellacqua.
Despite the recent Fed Cup failures, however, there were many good signs for Australian tennis. Sally Peers and Isabella Holland won the Junior Fed Cup for Australia, defeating Poland in the final, in what was the country's first victory since 1993. In addition, two European tennis players, Jarmila Gajdošová of Slovakia and Anastasia Rodionova of Russia, both successfully applied for Australian citizenship and thereby respectively became the country's fifth (No. 142) and fourth-highest (No. 79) ranked women's tennis players. Nevertheless, the same Fed Cup team used for the tie against Switzerland was picked for the upcoming zonal competition, with Molik, Pratt, Stubbs, and Dellacqua, who was continuing to replace a still-ill Stosur and had been granted a wildcard for the January hardcourt season, being selected.
However, the players chosen for the team failed to play well in early 2008, with both Molik and Pratt falling in the first round of Sydney, and Pratt losing to Nadia Petrova in the first round of the Australian Open. Following these poor results, Pratt announced her immediate retirement from tennis. Dellacqua, on the other hand, defeated former World No. 7 Patty Schnyder and former No. 1 Amélie Mauresmo en route to the fourth round of the Australian Open, a feat which would cause her to surpass Samantha Stosur as the Australian No. 1 and place her in good form.
Junior Jessica Moore replaced Pratt in the team after increasing her ranking by four-hundred places to within the top 300 following a successful Australian Open campaign. They were placed in Pool A alongside India, New Zealand, and Indonesia. They played the New Zealanders in the first tie, with Dellacqua winning the first rubber after Sacha Jones retired due to cramp, Marina Erakovic winning the second after Molik retired suffering from a calf strain, and Dellacqua and Stubbs defeated Leanne Baker and Erakovic in doubles, 7–5, 6–2.
The Australians were then stunned by Indonesia, the lowest-ranked team in the pool, after Moore, replacing the injured Molik, fell to Ayu-Fani Damayanti and Dellacqua was defeated by Sandy Gumulya despite being ranked two hundred places above her. Despite defeating the Indians, 3–0, and Moore gathering a win over Isha Lakhani, the team was unable to qualify for the final. In the end, they finished fourth overall in Group I, marking their lowest ever finish in the competition's history.
2009–2012: Return to the World Group
A few months after the poor Fed Cup results, Alicia Molik retired from tennis. However, good news soon came to the Australian team when it was announced that Perth would host the Asia/Oceania Zone competition. In addition, Year-End 2008 Australian No. 1 and World No. 52 Samantha Stosur rejoined the WTA Tour after her battle with Lyme Disease, alongside World No. 179 Jelena Dokic, who was competing for a wildcard into the upcoming Australian Open; a wildcard she ended up winning. This led to both women to be included in the new Fed Cup squad, alongside Rennae Stubbs and Casey Dellacqua. In Dokic's case, it was her first tie for Australia since 2000.
The good news for the Australian team continued through the Australian Open, where Stosur was able to reach the third round, and Dokic made a surprise comeback run to the quarterfinals, only losing to third seed Dinara Safina in a very close match. This led to the team having great confidence coming into the Fed Cup competition. They were placed in Pool B alongside Chinese Taipei, South Korea, and Thailand.
The team began well, with Dokic claiming the first win against the Koreans against their No. 2 Lee Jin-a, 6–0, 6–3, before Stosur defeated Lee Ye-ra and Dellacqua and Stubbs won against Chang Kyung-mi and Lee Jin-a in doubles. They then beat the Thai with Dokic easily defeating Suchanun Viratprasert and Stosur coming back from 4–6, 2–5 to defeat the zone's highest-ranked competitor World No. 41 Tamarine Tanasugarn, 4–6, 7–5, 6–0, and eventually sealed their win of the pool after Dellacqua and Stosur had easy singles wins over Taiwanese Hwang I-hsuan and Chan Chin-wei. This allowed Australia to advance to the zone group final against New Zealand, which they won after Dokic and Stosur respectively defeated Dianne Hollands and Marina Erakovic in singles and Dellacqua and Stubbs beat Shona Lee and Kairangi Vano in doubles. Australia thus advanced to the World Group II play-offs, where they were drawn against the Swiss once again.
The tie was chosen to be played at Mildura on grass, with fundraising efforts directed to the recent Black Saturday bushfires. Although the Swiss No. 1 and World Top 20 singles player Patty Schnyder was expected to lead the Swiss team, both she and the Swiss No. 2 (and World No. 88) Timea Bacsinszky, citing respective displeasure with the grass surface and tournament schedule. This led to Australian confidence for the upcoming tie, as Stefanie Vögele (No. 120) and Amra Sadiković (No. 507) were left as the highest-ranked opponents for the Australians, who would be led themselves once again by Stosur and Dokic. While Stosur was positive about her form and stated she was expecting future entry to the singles World Top 10, Dokic admitted that she had been suffering from fatigue in the recent months since the Australian Open.
The Australians nevertheless dominated the first two rubbers, with Stosur and Dokic both winning their singles matches against Sadiković and Vögele in straight sets despite the bad weather. The tie was then secured for Australia after Stosur beat Vögele in the third rubber, despite Jessica Moore falling to 15-year-old Mateja Kraljevic and the final doubles match being abandoned. Australia thus proceeded to World Group II once again.
In July 2009, former Fed Cup player Nicole Pratt was chosen as the national women's tennis coach, after a French Open that was deemed a success for the future of Australian women's tennis. Jarmila Groth (née Gajdošová), former top sixty singles player, also joined the Fed Cup team after finally being made eligible for competition; her acceptance was regarded as a great addition. Casey Dellacqua, who had been suffering from injuries, and Alicia Molik also rejoined the WTA tour for Australia in preparation for the upcoming Australian Open.
However, following a poor Australian Open where she lost in the first round, Dokic declined to appear in the upcoming tie against Spain. This meant that the team was composed of Molik, Dellacqua, Stubbs, and Stosur, who reached the fourth round of the Australian Open and advanced to become the singles World No. 11. Stosur led the team into the first rubber, against Spain's No. 1 and World No. 28 María José Martínez Sánchez. Dellacqua would then play World No. 32 Anabel Medina Garrigues in the second rubber.
Stosur, despite losing the first set and being down three break points in the second, defeated Martínez Sánchez before Dellacqua fell to Medina Garrigues despite being up a break. Stosur then defeated Medina Garrigues in straight sets, before Molik, replacing Dellacqua, lost comprehensively to Carla Suárez Navarro. This meant the tie went to a doubles decider, which was won by the Australians after Stubbs and Stosur defeated Martínez Sánchez and Nuria Llagostera Vives, 6–4, 6–2. This allowed the Australians to progress to the World Group play-offs, the first time they were competing at that level since 2004.
Australia was drawn against Ukraine for tie, which was being held in Kharkiv. Stosur, Molik, Stubbs and Anastasia Rodionova, who became an Australian citizen in December 2009, were picked for the team. Stosur broke into the singles World Top 10 after a successful Indian Wells, and then won her second WTA title and first title on clay, beating Vera Zvonareva in less than an hour at Charleston. Ukraine was led by their top player and World No. 25 Alona Bondarenko, which meant that Stosur was the clear highest player of the tie, and Rodionova was due to play her in the opening rubber.
Rodionova, despite a shaky start, upset Bondarenko, 0–6, 6–3, 7–5, to set Australia to a quick 1–0 lead. Stosur then easily defeated Mariya Koryttseva in straight sets, and the following day also defeated Lyudmyla Kichenok in two sets to secure Australia's World Group spot. Subsequent wins from Molik over Koryttseva and Stubbs and Rodionova in doubles over Kichenok and her twin sister Nadiya caused Australia to progress with a 5–0 clean-sweep. This allowed Australia to compete with the top eight teams for the first time since 2001. This success resulted in positive reactions from the Australian press to the state of Australian women's tennis, much of it being directed at Stosur herself. This appreciation continued after Groth and Stosur became the first Australian women since 1989 to simultaneously reach the fourth round of the French Open. Stosur then went on to become the first Australian woman in thirty years to reach a Grand Slam final, reaching the French Open final after defeating Serena Williams and Jelena Janković. Although she lost to Francesca Schiavone, her campaign was still regarded positively and her ranking increased to No. 6 two weeks later. Stosur then reached the singles Top 5 later in the year, and her success was ranked by The Courier-Mail as one tennis' finest moments of 2010.
Australia faced a tough draw for the 2011 World Group, facing two-time defending champion Italy, held in Hobart. Stosur, Rodionova (No. 64), Molik (No. 130), and Stubbs (doubles No. 10) were returned to a seven-woman Fed Cup squad, alongside Dokic (No. 137), Ferguson (No. 122) and first-timer Groth (No. 42). Stosur ended up being picked as a single for the actual team, alongside Groth, who won a tournament in Hobart just prior to Fed Cup, with Rodionova and Stubbs chosen for doubles. The Italian team comprised Schiavone, Australian Open doubles champion and top twenty singles player Flavia Pennetta, Sara Errani and Roberta Vinci. Groth was set to open the tie against Schiavone, with Stosur playing second against Pennetta and standing by to play doubles if the tie is locked at 2–2.
Groth scored an early upset win over No. 4 Schiavone, 6–7(4–7), 6–3, 6–3, in match that involved five match points and a thirteen-minute rain delay. However, Stosur lost to Pennetta in a close two and a half hour, 6–7(5–7), 7–6(7–5), 6–3, match. Groth then fell to Pennetta in straight sets, bringing Pennetta's Fed Cup winning streak to ten, before Schiavone used four match points to defeat Stosur again and win the tie for Italy. Stubbs and Rodionova then lost to Errani and Vinci in the doubles dead rubber, in what was to be Stubbs' final match before she announced her retirement from professional tennis. This led to captain David Taylor requesting for other top Australians players, such as Dokic, Molik, Dellacqua and young Olivia Rogowska to press for selection.
Stosur began the European claycourt season as defender of over two thousand ranking points, which led to her withdrawing from the upcoming World Group play-offs held in Melbourne against Ukraine. Dokic also withdrew from the tie following her win of the Malaysian Open, meaning that the team included Groth, Rodionova, Ferguson and 19-year-old debutante Sally Peers. Groth was due to open the tie against the Ukrainian team's No. 2 Olga Savchuk, while Rodionova was selected for the second rubber against Lesia Tsurenko. Groth defeated Savchuk, who stated she succumbed to nerves, in less than fifty minutes, but Rodionova was handily upset by Tsurenko in straight sets despite being sixty ranking places ahead of her. Groth then pulled off another easy singles win over Tsurenko, but Rodionova fell to Savchuk, 6–7(3–7), 6–7(12–14), despite holding five second set points during the tiebreaker, and Savchuk and Tsurenko closed off the tie for Ukraine in doubles against Groth and Rodionova despite leading at multiple times during all three sets and a game away from winning at one point on Rodionova's serve. This caused Australia to fall back to World Group II once again. Soon after the Fed Cup tie, Groth split from her then-husband Sam Groth and changed her name back to Jarmila Gajdošová, a decision that she stated would not affect her commitment to Fed Cup. Stosur, however, made no guarantees that she make herself available for future Fed Cup ties due to the lack of ranking points gained for doing so.
In the Grand Slams following the Fed Cup losses, Stosur disappointed in her performances by losing in the third round of the French Open and failing to a win a match at Wimbledon. Gajdošová, nevertheless, performed well in Paris, and was the only Australian woman to reach past the second round in London. In September, however, Stosur defied expectations and won her first major title at the US Open during a controversial final against Serena Williams. This led to Stosur gaining worldwide recognition for her performance as the first Australian female Grand Slam winner since 1980 Wimbledon and acknowledgement from Prime Minister Julia Gillard, with some referring to it as a great day for her career and Australian tennis in general. Success continued in Australian tennis as Belinda Woolcock and Wimbledon champion Ashleigh Barty won the Junior Fed Cup over Canada.
For the World Group II tie, Australia was once again was drawn against Switzerland, with the matches to be held in Granges-Paccot on indoor clay. Stosur, Gajdošová, Dokic and Dellacqua were announced for the team, while the Swiss announced No. 124 Vögele and No. 244 Bacsinszky for singles with No. 219 Sadiković made ready to play doubles. Stosur began the tie by defeating Bacsinszky, who was making a comeback from a ten-month injury lay-off, in straight sets, before Gajdošová was overcome by Vögele, 0–6, 7–6(10–8), 6–8, after eight match points. Australia then took a 2–1 lead in the tie after Stosur defeated Vögele in 66 minutes, and Gajdošová secured the team's win after she beat the inexperienced Sadiković, winning the close final set, 8–6. Dokic and Dellacqua then finished off the tie by winning the doubles rubber over 14-year-old Belinda Bencic and Sadiković in straight sets to gather a 4–1 win to the World Group play-offs. Despite the win, Stosur's coach David Taylor refused to make the top five player commit to the upcoming tie in April to alleviate her stress, a decision that was met with scrutiny by some in the Australian media. Nevertheless, Stosur was nominated for a Fed Cup Heart Award thanks her performance against the Swiss.
The Australians were then drawn against Germany for their play-off tie; considered a challenge for the team due to the fact that there were four Germans in the top forty: Andrea Petkovic (No. 10), Sabine Lisicki (No. 14), Julia Görges (No. 21) and Angelique Kerber (No. 22). Stosur was chosen to lead the tie, with Gajdošová and Dellacqua also playing alongside Rogowska, who was accepted ahead of Dokic as a reward for her sudden rankings improvement. Rodionova expressed disappointment at her omission from the team, nevertheless, as she was the country's highest ranked doubles player and third-highest ranked singles player at the time. The Germans selected an in-form Kerber and Görges to lead their team, with Petkovic also playing despite recovering from a back injury, and Anna-Lena Grönefeld entering as a doubles specialist. Stosur and Kerber, who played each other during Stosur's win at Flushing Meadows, were set to open the tie, with Gajdošová and No. 16 Görges assigned for the second rubber.
In spite of being termed the underdogs of the tie, the Australian team defied expectations and gained an early lead, as Stosur easily defeated Kerber and Gajdošová took an upset straight sets win over Görges. This led to German captain Barbara Rittner choosing Petkovic, who later confessed she was not expecting to play, for Stosur's second single match, but this decision was not successful as Stosur defeated her, 6–4, 6–1, to claim the tie and Australia's place in the 2013 World Group in just 74 minutes. After the victory was asserted, Rogowska was sent in to play Kerber, but she was defeated in straight sets, and Dellacqua and Gajdošová fell to Görges (who was stepping in for Grönefeld after the doubles specialist injured her fifth toe) and Petkovic in doubles.
2013–present
Australia was drawn against seven-time winners, 2011 and 2012 champions, and No. 1 team Czech Republic for their first-round tie in the 2013 World Group. Before the tie commenced, however, David Taylor stood down as captain to concentrate on coaching Samantha Stosur. He was replaced former World No. 8 and Fed Cup player Alicia Molik, who stated that she and the team remained undaunted despite being the clear underdogs against the Czechs.
Jarmila Gajdošová, after a tumultuous previous number of months, made a return to the tennis in the tournaments preceding the Australian Open. During the Brisbane International, she managed a defeat over No. 16 Roberta Vinci, which was considered a massive high for her career. She then won the mixed doubles tournament at the Australian Open alongside Matthew Ebden, while Casey Dellacqua and Ashleigh Barty made a surprise and successful run to the final of women's doubles, marking the first time an Australian pair made the Australian Open final since December 1977. This victories led to Gajdošová, Dellacqua and Barty being nominated for the tie alongside top ten player Stosur. The Czech team included former Wimbledon champion and World No. 8 Petra Kvitová, No. 18 Lucie Šafářová, and US Open finalists and Olympic silver medalists Andrea Hlaváčková and Lucie Hradecká. Gajdošová was set to open the tie against Kvitová while Stosur would play Šafářová in the second rubber.
Gajdošová fell to Kvitová in two sets, however, and Stosur was defeated by Šafářová, 6–7(6–8), 6–7(4–7), despite leading 4–1 in the first set. Stosur was then beaten by Kvitová in three sets, despite holding a match point whilst leading 6–2, 5–4, and Dellacqua and Barty lost to Hlaváčková and Hradecká in doubles (after the Gajdošová–Šafářová match was cancelled due to the ITF's revision of the dead rubber policy) for a 0–4 loss. This forced Australia to play in their fourth World Group Play-off in four years. But despite the loss, Stosur was complimentary of her performance and Molik praised Barty, stating that she had shown "maturity beyond her years". Molik thus expressed confidence that they would be remaining in the Fed Cup's elite eight.
The team drew Switzerland for their play-off, marking the fourth time they would play the Swiss in eight years. Australia were originally selected to host the tie, but Tennis Australia elected to switch the host of the tie to Switzerland so the players can get a chance to play on European clay on the months prior to the French Open. In return for this agreement, Australia would host the Swiss the next two times the teams met in Fed Cup. Australia nominated an unchanged team for the tie, despite Stosur damaging her calf muscle just before the Miami event in March, with Storm Sanders being chosen as "orange girl" after her good results in the ITF Circuit. Although doubt was expressed about Stosur's ability to lead the team in view of her injury, she still declared herself fit to play singles for the event. Gajdošová, despite nearly falling out of the Top 200, was also selected by Molik to play singles, citing an impressive attitude and form whilst on playing on the practice courts. She was due to play second against the Swiss No. 1 and World No. 52 Romina Oprandi, while Stosur would open the tie against World No. 56 Stefanie Vögele in the pair's third Fed Cup meeting in four years.
Frequent rain, however, led to tie being delayed until two days after it was scheduled, and matches being played simultaneously. Stosur defeated Vögele in straight sets while Gajdošová lost to Oprandi, 2–6, 3–6, setting to the time to an early level, before Stosur beat Oprandi and Barty, who was called in to replace Gajdošová, made a surprise win over Vögele despite having lost to her in an ITF tournament the year before and being over a hundred and forty ranking places below her. This led to Australia's first consecutive World Group appearance since 2004 and Molik stating that Barty, who turned seventeen two days after the tie, could be key to future Australian Fed Cup success.
See also
Australia Fed Cup team
References
Australia national tennis team
Fed Cup
|
```python
import moderngl
import pytest
import numpy as np
@pytest.fixture(scope='module')
def prog(ctx_static):
return ctx_static.program(
vertex_shader='''
#version 330
in vec2 in_vert;
void main() {
gl_Position = vec4(in_vert, 0.0, 1.0);
}
''',
fragment_shader='''
#version 330
out vec4 fragColor;
uniform vec4 color;
void main() {
fragColor = color;
}
''',
)
@pytest.fixture(scope='module')
def vao(ctx_static, prog):
quad = [
-1.0, 1.0,
-1.0, -1.0,
1.0, 1.0,
1.0, -1.0,
]
vbo = ctx_static.buffer(np.array(quad, dtype='f4'))
return ctx_static.simple_vertex_array(prog, vbo, 'in_vert')
def create_fbo(ctx, size, components=3):
fbo = ctx.framebuffer(
color_attachments=[ctx.texture(size, components)],
)
fbo.clear()
return fbo
def test_default_value(ctx):
"""Ensure default value of the scissor matches the framebuffer size"""
size = (16, 32)
fbo = create_fbo(ctx, size)
assert fbo.scissor == (0, 0, *size)
def test_reset_scissor(ctx):
"""We should be able to reset scissor with `None`"""
size = (16, 32)
fbo = create_fbo(ctx, size)
new_val = 2, 2, 14, 30
fbo.scissor = new_val
assert fbo.scissor == new_val
fbo.scissor = None
assert fbo.scissor == (0, 0, *size)
def test_render(ctx, prog, vao):
"""Render different color to the four corners of the fbo using scissor"""
size = (4, 4)
fbo = create_fbo(ctx, size)
fbo.use()
# upper left (red)
fbo.scissor = 0, 2, 2, 2
prog['color'].value = 1.0, 0.0, 0.0, 0.0
vao.render(mode=moderngl.TRIANGLE_STRIP)
# upper right (green)
fbo.scissor = 2, 2, 2, 2
prog['color'].value = 0.0, 1.0, 0.0, 0.0
vao.render(mode=moderngl.TRIANGLE_STRIP)
# lower left (green)
fbo.scissor = 0, 0, 2, 2
prog['color'].value = 0.0, 0.0, 1.0, 0.0
vao.render(mode=moderngl.TRIANGLE_STRIP)
# lower right (green)
fbo.scissor = 2, 0, 2, 2
prog['color'].value = 1.0, 1.0, 1.0, 1.0
vao.render(mode=moderngl.TRIANGLE_STRIP)
data = fbo.read()
# Note that the data is flipped horizontally
expected = (
b'\x00\x00\xff'b'\x00\x00\xff'b'\xff\xff\xff'b'\xff\xff\xff'
b'\x00\x00\xff'b'\x00\x00\xff'b'\xff\xff\xff'b'\xff\xff\xff'
b'\xff\x00\x00'b'\xff\x00\x00'b'\x00\xff\x00'b'\x00\xff\x00'
b'\xff\x00\x00'b'\xff\x00\x00'b'\x00\xff\x00'b'\x00\xff\x00'
)
assert data == expected
def test_clear(ctx):
"""Ensure fbo clearing works with scissoring"""
size = (4, 4)
fbo = create_fbo(ctx, size)
fbo.use()
# upper left (red)
fbo.scissor = 0, 2, 2, 2
fbo.clear(1.0, 0.0, 0.0, 0.0)
# upper right (green)
fbo.scissor = 2, 2, 2, 2
fbo.clear(0.0, 1.0, 0.0, 0.0)
# lower left (green)
fbo.scissor = 0, 0, 2, 2
fbo.clear(0.0, 0.0, 1.0, 0.0)
# lower right (green)
fbo.scissor = 2, 0, 2, 2
fbo.clear(1.0, 1.0, 1.0, 1.0)
data = fbo.read()
# Note that the data is flipped horizontally
expected = (
b'\x00\x00\xff'b'\x00\x00\xff'b'\xff\xff\xff'b'\xff\xff\xff'
b'\x00\x00\xff'b'\x00\x00\xff'b'\xff\xff\xff'b'\xff\xff\xff'
b'\xff\x00\x00'b'\xff\x00\x00'b'\x00\xff\x00'b'\x00\xff\x00'
b'\xff\x00\x00'b'\xff\x00\x00'b'\x00\xff\x00'b'\x00\xff\x00'
)
assert data == expected
def test_scissor_leak(ctx):
"""Make sure we don't leak scissor values to other framebuffers"""
size = 2, 2
fbo1 = create_fbo(ctx, size, components=4)
fbo2 = create_fbo(ctx, size, components=4)
fbo1.scissor = 0, 0, 1, 1
fbo2.scissor = 1, 1, 1, 1
fbo1.clear(color=(1.0, 0.0, 0.0, 0.0))
fbo2.clear(color=(0.0, 1.0, 0.0, 0.0))
assert fbo1.read() == b'\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00'
assert fbo2.read() == b'\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xff\x00'
def test_clear_with_viewport(ctx):
"""Clearing with viewport take presence over scissor"""
size = 2, 1
fbo = create_fbo(ctx, size)
fbo.scissor = 1, 0, 1, 1
fbo.clear(color=(1.0, 1.0, 1.0, 1.0), viewport=(0, 0, 1, 1))
assert fbo.read() == b'\xff\xff\xff\x00\x00\x00'
```
|
```java
/*
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
*
* 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 org.hongxi.whatsmars.job.entity;
import java.io.Serializable;
public final class Foo implements Serializable {
private static final long serialVersionUID = 2706842871078949451L;
private final long id;
private final String location;
private Status status;
public Foo(final long id, final String location, final Status status) {
this.id = id;
this.location = location;
this.status = status;
}
public long getId() {
return id;
}
public String getLocation() {
return location;
}
public Status getStatus() {
return status;
}
public void setStatus(final Status status) {
this.status = status;
}
@Override
public String toString() {
return String.format("id: %s, location: %s, status: %s", id, location, status);
}
public enum Status {
TODO,
COMPLETED
}
}
```
|
```go
// Code generated by "stringer -output func_string.go -type=BuiltinFunc"; DO NOT EDIT.
package asm
import "strconv"
func _() {
// An "invalid array index" compiler error signifies that the constant values have changed.
// Re-run the stringer command to generate them again.
var x [1]struct{}
_ = x[FnUnspec-0]
_ = x[FnMapLookupElem-1]
_ = x[FnMapUpdateElem-2]
_ = x[FnMapDeleteElem-3]
_ = x[FnProbeRead-4]
_ = x[FnKtimeGetNs-5]
_ = x[FnTracePrintk-6]
_ = x[FnGetPrandomU32-7]
_ = x[FnGetSmpProcessorId-8]
_ = x[FnSkbStoreBytes-9]
_ = x[FnL3CsumReplace-10]
_ = x[FnL4CsumReplace-11]
_ = x[FnTailCall-12]
_ = x[FnCloneRedirect-13]
_ = x[FnGetCurrentPidTgid-14]
_ = x[FnGetCurrentUidGid-15]
_ = x[FnGetCurrentComm-16]
_ = x[FnGetCgroupClassid-17]
_ = x[FnSkbVlanPush-18]
_ = x[FnSkbVlanPop-19]
_ = x[FnSkbGetTunnelKey-20]
_ = x[FnSkbSetTunnelKey-21]
_ = x[FnPerfEventRead-22]
_ = x[FnRedirect-23]
_ = x[FnGetRouteRealm-24]
_ = x[FnPerfEventOutput-25]
_ = x[FnSkbLoadBytes-26]
_ = x[FnGetStackid-27]
_ = x[FnCsumDiff-28]
_ = x[FnSkbGetTunnelOpt-29]
_ = x[FnSkbSetTunnelOpt-30]
_ = x[FnSkbChangeProto-31]
_ = x[FnSkbChangeType-32]
_ = x[FnSkbUnderCgroup-33]
_ = x[FnGetHashRecalc-34]
_ = x[FnGetCurrentTask-35]
_ = x[FnProbeWriteUser-36]
_ = x[FnCurrentTaskUnderCgroup-37]
_ = x[FnSkbChangeTail-38]
_ = x[FnSkbPullData-39]
_ = x[FnCsumUpdate-40]
_ = x[FnSetHashInvalid-41]
_ = x[FnGetNumaNodeId-42]
_ = x[FnSkbChangeHead-43]
_ = x[FnXdpAdjustHead-44]
_ = x[FnProbeReadStr-45]
_ = x[FnGetSocketCookie-46]
_ = x[FnGetSocketUid-47]
_ = x[FnSetHash-48]
_ = x[FnSetsockopt-49]
_ = x[FnSkbAdjustRoom-50]
_ = x[FnRedirectMap-51]
_ = x[FnSkRedirectMap-52]
_ = x[FnSockMapUpdate-53]
_ = x[FnXdpAdjustMeta-54]
_ = x[FnPerfEventReadValue-55]
_ = x[FnPerfProgReadValue-56]
_ = x[FnGetsockopt-57]
_ = x[FnOverrideReturn-58]
_ = x[FnSockOpsCbFlagsSet-59]
_ = x[FnMsgRedirectMap-60]
_ = x[FnMsgApplyBytes-61]
_ = x[FnMsgCorkBytes-62]
_ = x[FnMsgPullData-63]
_ = x[FnBind-64]
_ = x[FnXdpAdjustTail-65]
_ = x[FnSkbGetXfrmState-66]
_ = x[FnGetStack-67]
_ = x[FnSkbLoadBytesRelative-68]
_ = x[FnFibLookup-69]
_ = x[FnSockHashUpdate-70]
_ = x[FnMsgRedirectHash-71]
_ = x[FnSkRedirectHash-72]
_ = x[FnLwtPushEncap-73]
_ = x[FnLwtSeg6StoreBytes-74]
_ = x[FnLwtSeg6AdjustSrh-75]
_ = x[FnLwtSeg6Action-76]
_ = x[FnRcRepeat-77]
_ = x[FnRcKeydown-78]
_ = x[FnSkbCgroupId-79]
_ = x[FnGetCurrentCgroupId-80]
_ = x[FnGetLocalStorage-81]
_ = x[FnSkSelectReuseport-82]
_ = x[FnSkbAncestorCgroupId-83]
_ = x[FnSkLookupTcp-84]
_ = x[FnSkLookupUdp-85]
_ = x[FnSkRelease-86]
_ = x[FnMapPushElem-87]
_ = x[FnMapPopElem-88]
_ = x[FnMapPeekElem-89]
_ = x[FnMsgPushData-90]
_ = x[FnMsgPopData-91]
_ = x[FnRcPointerRel-92]
_ = x[FnSpinLock-93]
_ = x[FnSpinUnlock-94]
_ = x[FnSkFullsock-95]
_ = x[FnTcpSock-96]
_ = x[FnSkbEcnSetCe-97]
_ = x[FnGetListenerSock-98]
_ = x[FnSkcLookupTcp-99]
_ = x[FnTcpCheckSyncookie-100]
_ = x[FnSysctlGetName-101]
_ = x[FnSysctlGetCurrentValue-102]
_ = x[FnSysctlGetNewValue-103]
_ = x[FnSysctlSetNewValue-104]
_ = x[FnStrtol-105]
_ = x[FnStrtoul-106]
_ = x[FnSkStorageGet-107]
_ = x[FnSkStorageDelete-108]
_ = x[FnSendSignal-109]
_ = x[FnTcpGenSyncookie-110]
_ = x[FnSkbOutput-111]
_ = x[FnProbeReadUser-112]
_ = x[FnProbeReadKernel-113]
_ = x[FnProbeReadUserStr-114]
_ = x[FnProbeReadKernelStr-115]
_ = x[FnTcpSendAck-116]
_ = x[FnSendSignalThread-117]
_ = x[FnJiffies64-118]
_ = x[FnReadBranchRecords-119]
_ = x[FnGetNsCurrentPidTgid-120]
_ = x[FnXdpOutput-121]
_ = x[FnGetNetnsCookie-122]
_ = x[FnGetCurrentAncestorCgroupId-123]
_ = x[FnSkAssign-124]
_ = x[FnKtimeGetBootNs-125]
_ = x[FnSeqPrintf-126]
_ = x[FnSeqWrite-127]
_ = x[FnSkCgroupId-128]
_ = x[FnSkAncestorCgroupId-129]
_ = x[FnRingbufOutput-130]
_ = x[FnRingbufReserve-131]
_ = x[FnRingbufSubmit-132]
_ = x[FnRingbufDiscard-133]
_ = x[FnRingbufQuery-134]
_ = x[FnCsumLevel-135]
_ = x[FnSkcToTcp6Sock-136]
_ = x[FnSkcToTcpSock-137]
_ = x[FnSkcToTcpTimewaitSock-138]
_ = x[FnSkcToTcpRequestSock-139]
_ = x[FnSkcToUdp6Sock-140]
_ = x[FnGetTaskStack-141]
_ = x[FnLoadHdrOpt-142]
_ = x[FnStoreHdrOpt-143]
_ = x[FnReserveHdrOpt-144]
_ = x[FnInodeStorageGet-145]
_ = x[FnInodeStorageDelete-146]
_ = x[FnDPath-147]
_ = x[FnCopyFromUser-148]
_ = x[FnSnprintfBtf-149]
_ = x[FnSeqPrintfBtf-150]
_ = x[FnSkbCgroupClassid-151]
_ = x[FnRedirectNeigh-152]
_ = x[FnPerCpuPtr-153]
_ = x[FnThisCpuPtr-154]
_ = x[FnRedirectPeer-155]
_ = x[FnTaskStorageGet-156]
_ = x[FnTaskStorageDelete-157]
_ = x[FnGetCurrentTaskBtf-158]
_ = x[FnBprmOptsSet-159]
_ = x[FnKtimeGetCoarseNs-160]
_ = x[FnImaInodeHash-161]
_ = x[FnSockFromFile-162]
_ = x[FnCheckMtu-163]
_ = x[FnForEachMapElem-164]
_ = x[FnSnprintf-165]
_ = x[FnSysBpf-166]
_ = x[FnBtfFindByNameKind-167]
_ = x[FnSysClose-168]
_ = x[FnTimerInit-169]
_ = x[FnTimerSetCallback-170]
_ = x[FnTimerStart-171]
_ = x[FnTimerCancel-172]
_ = x[FnGetFuncIp-173]
_ = x[FnGetAttachCookie-174]
_ = x[FnTaskPtRegs-175]
_ = x[FnGetBranchSnapshot-176]
_ = x[FnTraceVprintk-177]
_ = x[FnSkcToUnixSock-178]
_ = x[FnKallsymsLookupName-179]
_ = x[FnFindVma-180]
_ = x[FnLoop-181]
_ = x[FnStrncmp-182]
_ = x[FnGetFuncArg-183]
_ = x[FnGetFuncRet-184]
_ = x[FnGetFuncArgCnt-185]
_ = x[FnGetRetval-186]
_ = x[FnSetRetval-187]
_ = x[FnXdpGetBuffLen-188]
_ = x[FnXdpLoadBytes-189]
_ = x[FnXdpStoreBytes-190]
_ = x[FnCopyFromUserTask-191]
_ = x[FnSkbSetTstamp-192]
_ = x[FnImaFileHash-193]
_ = x[FnKptrXchg-194]
_ = x[FnMapLookupPercpuElem-195]
_ = x[FnSkcToMptcpSock-196]
_ = x[FnDynptrFromMem-197]
_ = x[FnRingbufReserveDynptr-198]
_ = x[FnRingbufSubmitDynptr-199]
_ = x[FnRingbufDiscardDynptr-200]
_ = x[FnDynptrRead-201]
_ = x[FnDynptrWrite-202]
_ = x[FnDynptrData-203]
_ = x[FnTcpRawGenSyncookieIpv4-204]
_ = x[FnTcpRawGenSyncookieIpv6-205]
_ = x[FnTcpRawCheckSyncookieIpv4-206]
_ = x[FnTcpRawCheckSyncookieIpv6-207]
_ = x[FnKtimeGetTaiNs-208]
_ = x[FnUserRingbufDrain-209]
_ = x[FnCgrpStorageGet-210]
_ = x[FnCgrpStorageDelete-211]
_ = x[maxBuiltinFunc-212]
}
const _BuiltinFunc_name = your_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashyour_sha256_hashStorageGetFnCgrpStorageDeletemaxBuiltinFunc"
var _BuiltinFunc_index = [...]uint16{0, 8, 23, 38, 53, 64, 76, 89, 104, 123, 138, 153, 168, 178, 193, 212, 230, 246, 264, 277, 289, 306, 323, 338, 348, 363, 380, 394, 406, 416, 433, 450, 466, 481, 497, 512, 528, 544, 568, 583, 596, 608, 624, 639, 654, 669, 683, 700, 714, 723, 735, 750, 763, 778, 793, 808, 828, 847, 859, 875, 894, 910, 925, 939, 952, 958, 973, 990, 1000, 1022, 1033, 1049, 1066, 1082, 1096, 1115, 1133, 1148, 1158, 1169, 1182, 1202, 1219, 1238, 1259, 1272, 1285, 1296, 1309, 1321, 1334, 1347, 1359, 1373, 1383, 1395, 1407, 1416, 1429, 1446, 1460, 1479, 1494, 1517, 1536, 1555, 1563, 1572, 1586, 1603, 1615, 1632, 1643, 1658, 1675, 1693, 1713, 1725, 1743, 1754, 1773, 1794, 1805, 1821, 1849, 1859, 1875, 1886, 1896, 1908, 1928, 1943, 1959, 1974, 1990, 2004, 2015, 2030, 2044, 2066, 2087, 2102, 2116, 2128, 2141, 2156, 2173, 2193, 2200, 2214, 2227, 2241, 2259, 2274, 2285, 2297, 2311, 2327, 2346, 2365, 2378, 2396, 2410, 2424, 2434, 2450, 2460, 2468, 2487, 2497, 2508, 2526, 2538, 2551, 2562, 2579, 2591, 2610, 2624, 2639, 2659, 2668, 2674, 2683, 2695, 2707, 2722, 2733, 2744, 2759, 2773, 2788, 2806, 2820, 2833, 2843, 2864, 2880, 2895, 2917, 2938, 2960, 2972, 2985, 2997, 3021, 3045, 3071, 3097, 3112, 3130, 3146, 3165, 3179}
func (i BuiltinFunc) String() string {
if i < 0 || i >= BuiltinFunc(len(_BuiltinFunc_index)-1) {
return "BuiltinFunc(" + strconv.FormatInt(int64(i), 10) + ")"
}
return _BuiltinFunc_name[_BuiltinFunc_index[i]:_BuiltinFunc_index[i+1]]
}
```
|
```scss
.CollapsibleSection {
border-top: 1px solid var(--cds-border-subtle);
&.collapsed {
> :not(.sectionTitle) {
display: none;
}
}
.sectionTitle {
padding: 0.625rem 0;
text-transform: uppercase;
width: 100%;
background: transparent;
border: none;
text-align: left;
cursor: pointer;
.sectionToggle {
float: right;
transition: transform 0.1s;
&:not(.open) {
transform: rotate(-90deg);
}
}
}
}
```
|
```javascript
/* @flow */
declare var BAZ: {stuff?: (x: number) => void} | void;
```
|
Doglands (2011) is a children's fantasy novel written by Tim Willocks. It was published by the Random House imprint Random House Books for Young Readers. It is written in the first-person point of view of the main character, a lurcher named Furgul.
The story begins with Furgul being born in a racing greyhound breeder's home, believed to be full greyhound because he is so young. As he grows, however, it becomes more clear that he's not full greyhound, and his mother has him run away with his sisters. He promises to go back and save his mother, Keeva, but along the way he discovers much more to life, such as being a pet, being a fugitive, being in the animal shelter, being in love, and revolting.
Doglands won the 2012 Montreuil Book Festival Prize for European Young Adult Fiction.
Development and publication
Conception
Willocks says that for all his novels, he finds his inspiration in the "art that has the greatest effect" on him. Willocks also says that he wrote Doglands in forty-two days, saying that he was "completely devoured..." and he has "not followed the plan, but his instinct". Willocks also promises that Furgul will return to the heart of the Doglines.
Publication history
The hardcover, library binding and ebook editions were published on 27 September 2011 by Random House Children's Books. They were followed by the first paperback edition on 1 January 2012, published by Andersen Press, and a French edition published by Syros later in the year. A Random House paperback edition is due to be published on 25 September 2012.
Plot summary
Part One: Bravedog
Keeva, a blue greyhound, gives birth to four pups. There are three girls and one boy; she names the girls Eena, Nessa, and Brid, and names the boy Furgul. They are raised to believe that they are pure greyhounds, but as they get older, Keeva tells Furgul that he must run, because he is really a lurcher, and because of how fast he is growing, Dedbone is going to find out and kill him. Keeva also tells him that he must find his father, Argal. Furgul promises to come back and save Keeva.
When it is the first day in racing season, Keeva is supposed to be placed in a cardboard box to go off to the racetrack. She plans to run away before her leash can be put on, giving the dogs time to jump into another, empty cardboard box and go to the racetrack, where they can escape. However, the Gambler finds them and furthermore notices that they are not greyhounds. Dedbone goes and gets his shotgun, and while he does, Furgul manages to help Brid escape. The other three are still in the box, and Dedbone shoots multiple times until Furgul manages to tip the box enough to fall out of the truck.
Eena dies immediately of her shotgun wounds, but Furgul was only hit in the leg and Nessa still manages to survive. Nessa and Furgul go to a cavern, and Furgul hunts for them. They plan to survive in the mountain, but a day later Nessa dies of her wounds, leaving Furgul alone. He feels her spirit leave and imagines that now she will help all spirits find their way in the mountains. He then leaves the mountain to follow the river, where he meets Gerry, who takes him home. After a bit of nagging from his wife Harriet, Gerry manages to convince her to keep Furgul, who meets up with Kinnear, a bulldog.
Part Two: The Dog Who Runs in Darkness
Furgul learns from Kinnear all of the rules of the household, which he disapproves of. He plans to escape. One day, Gerry and Harriet take Furgul to the dog park. There he meets Samantha, a pitch-black German Shepherd that shares his interests. They play-fight, but the owners don't understand and think that they are attacking each other, so they pull the dogs away from each other. Before they are taken away, Furgul learns that Samantha's real name is Dervla.
After the incident at the park, Gerry and Harriet don't want anything like that to happen again, so they decide that it's time for Furgul to get neutered. When Kinnear tells him what neutering really is, Furgul knows that he cannot let that happen and plans even more intently to escape. When they finally take him to the veterinarian's office, he bolts as soon as they take off his collar and doesn't look back.
Out on the streets he meets Pace, a Labrador Retriever and seeing-eye dog with an overwhelming sense of sarcasm. Pace tells him to go through the mall, but watch out for the guards. While there, he also meets eight miniature female dogs who fall madly in love with him and chase him through the mall. The chaos confuses the guards, though, and gives him the opportunity to escape.
As soon as he exits the mall, he gets captured by "The Traps", or the dogcatchers. While in the truck on the way to the animal shelter, he meets Zinni the papillon, Tess the beagle, and Skyver the mutt. The truck stops once again to get another dog, who turns out to be his father Argal. There, he learns that unlike the others, Argal isn't going to be given his five days in the shelter. He has been labelled a dangerous dog and is going to be killed as soon as they get to the shelter.
While at the shelter, Furgul meets with Brennus, a Saint Bernard who taught Argal what he knows. Before Argal is killed, they give him some time with Furgul and with Brennus. While there, Furgul is told about how the mysterious Doglands are inside of you, and that his spirit will always be with them, and you just have to feel it. Then he is taken away, and Furgul becomes the new shelter leader, being Argal's son. So angered by the death of his father, Furgul decides to have a revolt. All the cage doors are opened and the dogs break free, refusing to go anywhere until their demands are met.
During the revolt, Furgul meets with Jodi, a dog whisperer, who offers that all the dogs in the revolt come live at Appletree Dog Sanctuary instead of going back. What makes Furgul agree is that she says he will be killed when they go back because he will be labelled a dangerous dog like his father. They all live at Appletree for a while until Furgul hears a whimpering pup. When he goes to help the pup, he gets captured by two thieves, Tattoo and Spotty, and finds out that the pup was only hurt for the sake of the trap and didn't know any better. He gets labelled "dogmeat" and is fed to Gremlin, Lunk, Freak, and Chopper. Dervla comes out of the shadows and kills them. Seeing the dogs dead, Tattoo and Spotty put him with Dervla, where she tells him their job is to distract guard dogs while the two humans go burglarising. At the first house, Furgul meets with two giant schnauzers named Cogg and Baz and convinces them to attack Tattoo and Spotty with the bribe of bacon. After the attack, Cogg and Baz join Furgul and the others.
Dervla, Cogg, and Baz come to live at Appletree, and peace is retained for a short amount of time. Then Furgul expresses his desire to save his mother Keeva, and Jodi says that she will look up the racing greyhounds on the betting page of the papers. Dedbone is not listed because that was just the dog's name for him, so Jodi asks racing names until something rings a bell. Furgul remembers his mother telling him her racing name, but he just can't remember. Eventually he remembers that it's "Sapphire Breeze", and he and all the dogs go to the racetrack.
Part Three: The Dog Bunch
While on the racetrack, Keeva is in the lead and has only a few steps to go before she would win, but then the spirit of Argal washes over the racetrack and she begins to dance with glee at feeling it. Soon all of the other dogs begin to dance and none of them finish the race. Afterward, Dedbone prepares to kill Keeva for her "little act" on the track.
A plan is formulated to save Keeva, but when Furgul sees all the other greyhounds shut in Dedbone's Hole, he figures that he must save them all. Then he finds out that Tic and Tac, the bullmastiffs in Dedbone's Hole, have pups. Zinni has experience walking on wires, so she agitates the greyhounds enough with her presence for Dedbone to open the gates to see what the matter is. Then, the greyhounds charge and the battle begins.
Cogg and Baz, now aware of their newfound abilities in killing, kill all five of Tic and Tac's pups, and then Tic and Tac are killed themselves by other dogs. Furgul sees Dedbone driving away with Keeva in the back of the truck and races after her. Brennus sacrifices himself to save Keeva, getting shot attacking Dedbone and then lying injured until the truck runs him over, finally killing him. Right before he dies, Brennus tells Furgul to run "The Doglines", the places where the ancestors of the dogs walked. Then Skyver lunges at Dedbone, knocking him back enough for him to tip over the side of the chasm and die there.
Characters
Major characters
Furgul, known briefly as Rupert, is the main character of the story. He is thought to be pure greyhound, but is really a lurcher. Because of this, he must escape before the breeder finds out. He promises to save his mother, Keeva, from the breeder, and succeeds in his goal. He is also somewhat crafty, and can get dogs on his side.
Dervla, also known as Samantha, is a black German shepherd and Furgul's main love interest. They first meet at the park when they are both house dogs. She is captured by Spotty and Tattoo and beaten into being a guard dog.
Argal is Furgul's father, as well as the "king" of the Doglands. Brennus taught him everything that he knows, and he has escaped the Traps countless times. However, he gives up his life in the end and gets put down by lethal injection, which kickstarts the whole revolt.
Skyver is a mutt that Furgul meets in the traps, as well as Zinni and Tess. He is obsessed with being a friend of a famous dog; first Argal, and then Furgul. In the revolt, he is at first the only one who wants to leave, but then he goes back, ashamed, and starts chanting. Skyver finally proves himself in the final attack.
Brennus is a St. Bernard and old, close friend of Argal. When Furgul first sees him, he doesn't think much of Brennus's prowess because of all his scars, but finds out more about the dog and comes to respect him more. In the end, Brennus sacrifices himself to save the rest of the dogs and gets run over.
Minor characters
Keeva is Furgul's mother, who he goes back to save after escaping himself. She is a greyhound and top racer, and is almost killed by Dedbone after she begins dancing in the track when she feels Argal's spirit in her.
Nessa, Eena, and Brid are Furgul's three sisters. Brid successfully escapes Dedbone, Eena is killed by a shotgun, and Nessa dies of her wounds in a mountain.
Tic and Tac are two bullmastiffs who guard Dedbone's Hole. While Furgul is away, they have a litter of pups that Cogg and Baz kill in the final showdown, and the two are eventually killed themselves.
Kinnear, also known as Crennig, is a pet dog and a bulldog who is quite content with living at a person's house. He is the one who first tells Furgul that he's going to get neutered.
Milly, Molly, Mandy, etc. are eight female dogs: a Pomeranian, a cockapoo, a Miniature Schnauzer, a Jack Russell Terrier, a Cavalier King Charles Spaniel, a Yorkshire Terrier, a dachshund, and a Chow Chow. They fall in love with Furgul and cause a commotion in the mall when they see him again.
Pace is a seeing-eye dog and a Labrador retriever who is a bit sarcastic. When Furgul escapes from Gerry and Harriet, Pace helps him get out and away.
Zinni is a papillon who got caught when a thief stole her diamond collar. Her talent with walking on wires made her an essential part of the final showdown.
Tess is a beagle who got separated from her owners and then caught by the dogcatchers. Later, during the revolt, she meets up with them again and says her goodbyes to the other dogs. She is deeply dismayed when Argal is killed.
Cogg and Baz, also known as Pumpkin and Pumpkin, are two Giant Schnauzers and guard dogs that are never good fighters because they are always arguing with each other, but Furgul manages to get them to help him with the promise of bacon.
Gremlin, Lunk, Freak, and Chopper are four dogs that Spotty and Tattoo keep in the carnival. Furgul is thrown in with them, but Dervla saves him and kills all four.
Humans
Dedbone is the leader of a slave camp of racing greyhounds, Keeva included. When he finds out that Furgul, Eena, Nessa, and Brid are lurchers, he goes after them with a shotgun, killing Eena and Nessa and injuring Furgul. When Keeva starts dancing, filled with the spirit of Argal, he goes to kill her for ruining the race. He is killed at the final showdown by Furgul.
The Gambler is Dedbone's sidekick, and the one who figures out that Furgul, Eena, Nessa, and Brid are lurchers and not greyhounds.
Gerry and Harriet are the owners of Kinnear and, briefly, Furgul. Gerry finds Furgul injured and takes him home, where he learns all the rules, but escapes before he can be neutered.
Jodi is a dog whisperer and owns Appletree Dog Sanctuary, where the dogs stay briefly after the revolt.
Spotty and Tattoo are two criminals who steal dogs. Most dogs they feed to Gremlin, Lunk, Freak, and Chopper, but some dogs, like Furgul, are used as bait to distract guard dogs while they burgle a house.
Reception
Editorial reviews
Kirkus Reviews reviewed Doglands and praised it highly. The reviewer enjoyed the distinct personalities of the dogs. He also thought that the mystic lore of the Doglands was a good thing, adding a secondary layer of fantasy. He thought that the humans were only lightly sketched in, but believed that it was fitting considering the point of view. All in all, Doglands was considered "riveting."
VOYA also reviewed the book. The reviewer disliked the fact that, "with the exception of too-good-to-be-true Jodi", it seemed that the human characters were "one-dimensional sterotypes, mostly evil". The reviewer also found the scenes of violence to be a bit graphic. She praised Willocks for the creation of the Doglines, saying it is the "element that lifts the story above being just another dog story".
Awards
See also
Tim Willocks
The Call of the Wild
References
2011 British novels
Children's fantasy novels
Children's novels about dogs
2011 fantasy novels
British children's novels
2011 children's books
British children's books
Random House books
|
```c++
// Boost config.hpp configuration header file ------------------------------//
// boostinspect:ndprecated_macros -- tell the inspect tool to ignore this file
// accompanying file LICENSE_1_0.txt or copy at
// path_to_url
// See path_to_url for most recent version.
// Boost config.hpp policy and rationale documentation has been moved to
// path_to_url
//
// This file is intended to be stable, and relatively unchanging.
// It should contain boilerplate code only - no compiler specific
// code unless it is unavoidable - no changes unless unavoidable.
#ifndef BOOST_CONFIG_SUFFIX_HPP
#define BOOST_CONFIG_SUFFIX_HPP
#if defined(__GNUC__) && (__GNUC__ >= 4)
//
// Some GCC-4.x versions issue warnings even when __extension__ is used,
// so use this as a workaround:
//
#pragma GCC system_header
#endif
//
// ensure that visibility macros are always defined, thus simplifying use
//
#ifndef BOOST_SYMBOL_EXPORT
# define BOOST_SYMBOL_EXPORT
#endif
#ifndef BOOST_SYMBOL_IMPORT
# define BOOST_SYMBOL_IMPORT
#endif
#ifndef BOOST_SYMBOL_VISIBLE
# define BOOST_SYMBOL_VISIBLE
#endif
//
// look for long long by looking for the appropriate macros in <limits.h>.
// Note that we use limits.h rather than climits for maximal portability,
// remember that since these just declare a bunch of macros, there should be
// no namespace issues from this.
//
#if !defined(BOOST_HAS_LONG_LONG) && !defined(BOOST_NO_LONG_LONG) \
&& !defined(BOOST_MSVC) && !defined(BOOST_BORLANDC)
# include <limits.h>
# if (defined(ULLONG_MAX) || defined(ULONG_LONG_MAX) || defined(ULONGLONG_MAX))
# define BOOST_HAS_LONG_LONG
# else
# define BOOST_NO_LONG_LONG
# endif
#endif
// GCC 3.x will clean up all of those nasty macro definitions that
// BOOST_NO_CTYPE_FUNCTIONS is intended to help work around, so undefine
// it under GCC 3.x.
#if defined(__GNUC__) && (__GNUC__ >= 3) && defined(BOOST_NO_CTYPE_FUNCTIONS)
# undef BOOST_NO_CTYPE_FUNCTIONS
#endif
//
// Assume any extensions are in namespace std:: unless stated otherwise:
//
# ifndef BOOST_STD_EXTENSION_NAMESPACE
# define BOOST_STD_EXTENSION_NAMESPACE std
# endif
//
// If cv-qualified specializations are not allowed, then neither are cv-void ones:
//
# if defined(BOOST_NO_CV_SPECIALIZATIONS) \
&& !defined(BOOST_NO_CV_VOID_SPECIALIZATIONS)
# define BOOST_NO_CV_VOID_SPECIALIZATIONS
# endif
//
// If there is no numeric_limits template, then it can't have any compile time
// constants either!
//
# if defined(BOOST_NO_LIMITS) \
&& !defined(BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS)
# define BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS
# define BOOST_NO_MS_INT64_NUMERIC_LIMITS
# define BOOST_NO_LONG_LONG_NUMERIC_LIMITS
# endif
//
// if there is no long long then there is no specialisation
// for numeric_limits<long long> either:
//
#if !defined(BOOST_HAS_LONG_LONG) && !defined(BOOST_NO_LONG_LONG_NUMERIC_LIMITS)
# define BOOST_NO_LONG_LONG_NUMERIC_LIMITS
#endif
//
// if there is no __int64 then there is no specialisation
// for numeric_limits<__int64> either:
//
#if !defined(BOOST_HAS_MS_INT64) && !defined(BOOST_NO_MS_INT64_NUMERIC_LIMITS)
# define BOOST_NO_MS_INT64_NUMERIC_LIMITS
#endif
//
// if member templates are supported then so is the
// VC6 subset of member templates:
//
# if !defined(BOOST_NO_MEMBER_TEMPLATES) \
&& !defined(BOOST_MSVC6_MEMBER_TEMPLATES)
# define BOOST_MSVC6_MEMBER_TEMPLATES
# endif
//
// Without partial specialization, can't test for partial specialisation bugs:
//
# if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \
&& !defined(BOOST_BCB_PARTIAL_SPECIALIZATION_BUG)
# define BOOST_BCB_PARTIAL_SPECIALIZATION_BUG
# endif
//
// Without partial specialization, we can't have array-type partial specialisations:
//
# if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \
&& !defined(BOOST_NO_ARRAY_TYPE_SPECIALIZATIONS)
# define BOOST_NO_ARRAY_TYPE_SPECIALIZATIONS
# endif
//
// Without partial specialization, std::iterator_traits can't work:
//
# if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \
&& !defined(BOOST_NO_STD_ITERATOR_TRAITS)
# define BOOST_NO_STD_ITERATOR_TRAITS
# endif
//
// Without partial specialization, partial
// specialization with default args won't work either:
//
# if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \
&& !defined(BOOST_NO_PARTIAL_SPECIALIZATION_IMPLICIT_DEFAULT_ARGS)
# define BOOST_NO_PARTIAL_SPECIALIZATION_IMPLICIT_DEFAULT_ARGS
# endif
//
// Without member template support, we can't have template constructors
// in the standard library either:
//
# if defined(BOOST_NO_MEMBER_TEMPLATES) \
&& !defined(BOOST_MSVC6_MEMBER_TEMPLATES) \
&& !defined(BOOST_NO_TEMPLATED_ITERATOR_CONSTRUCTORS)
# define BOOST_NO_TEMPLATED_ITERATOR_CONSTRUCTORS
# endif
//
// Without member template support, we can't have a conforming
// std::allocator template either:
//
# if defined(BOOST_NO_MEMBER_TEMPLATES) \
&& !defined(BOOST_MSVC6_MEMBER_TEMPLATES) \
&& !defined(BOOST_NO_STD_ALLOCATOR)
# define BOOST_NO_STD_ALLOCATOR
# endif
//
// without ADL support then using declarations will break ADL as well:
//
#if defined(BOOST_NO_ARGUMENT_DEPENDENT_LOOKUP) && !defined(BOOST_FUNCTION_SCOPE_USING_DECLARATION_BREAKS_ADL)
# define BOOST_FUNCTION_SCOPE_USING_DECLARATION_BREAKS_ADL
#endif
//
// Without typeid support we have no dynamic RTTI either:
//
#if defined(BOOST_NO_TYPEID) && !defined(BOOST_NO_RTTI)
# define BOOST_NO_RTTI
#endif
//
// If we have a standard allocator, then we have a partial one as well:
//
#if !defined(BOOST_NO_STD_ALLOCATOR)
# define BOOST_HAS_PARTIAL_STD_ALLOCATOR
#endif
//
// We can't have a working std::use_facet if there is no std::locale:
//
# if defined(BOOST_NO_STD_LOCALE) && !defined(BOOST_NO_STD_USE_FACET)
# define BOOST_NO_STD_USE_FACET
# endif
//
// We can't have a std::messages facet if there is no std::locale:
//
# if defined(BOOST_NO_STD_LOCALE) && !defined(BOOST_NO_STD_MESSAGES)
# define BOOST_NO_STD_MESSAGES
# endif
//
// We can't have a working std::wstreambuf if there is no std::locale:
//
# if defined(BOOST_NO_STD_LOCALE) && !defined(BOOST_NO_STD_WSTREAMBUF)
# define BOOST_NO_STD_WSTREAMBUF
# endif
//
// We can't have a <cwctype> if there is no <cwchar>:
//
# if defined(BOOST_NO_CWCHAR) && !defined(BOOST_NO_CWCTYPE)
# define BOOST_NO_CWCTYPE
# endif
//
// We can't have a swprintf if there is no <cwchar>:
//
# if defined(BOOST_NO_CWCHAR) && !defined(BOOST_NO_SWPRINTF)
# define BOOST_NO_SWPRINTF
# endif
//
// If Win32 support is turned off, then we must turn off
// threading support also, unless there is some other
// thread API enabled:
//
#if defined(BOOST_DISABLE_WIN32) && defined(_WIN32) \
&& !defined(BOOST_DISABLE_THREADS) && !defined(BOOST_HAS_PTHREADS)
# define BOOST_DISABLE_THREADS
#endif
//
// Turn on threading support if the compiler thinks that it's in
// multithreaded mode. We put this here because there are only a
// limited number of macros that identify this (if there's any missing
// from here then add to the appropriate compiler section):
//
#if (defined(__MT__) || defined(_MT) || defined(_REENTRANT) \
|| defined(_PTHREADS) || defined(__APPLE__) || defined(__DragonFly__)) \
&& !defined(BOOST_HAS_THREADS)
# define BOOST_HAS_THREADS
#endif
//
// Turn threading support off if BOOST_DISABLE_THREADS is defined:
//
#if defined(BOOST_DISABLE_THREADS) && defined(BOOST_HAS_THREADS)
# undef BOOST_HAS_THREADS
#endif
//
// Turn threading support off if we don't recognise the threading API:
//
#if defined(BOOST_HAS_THREADS) && !defined(BOOST_HAS_PTHREADS)\
&& !defined(BOOST_HAS_WINTHREADS) && !defined(BOOST_HAS_BETHREADS)\
&& !defined(BOOST_HAS_MPTASKS)
# undef BOOST_HAS_THREADS
#endif
//
// Turn threading detail macros off if we don't (want to) use threading
//
#ifndef BOOST_HAS_THREADS
# undef BOOST_HAS_PTHREADS
# undef BOOST_HAS_PTHREAD_MUTEXATTR_SETTYPE
# undef BOOST_HAS_PTHREAD_YIELD
# undef BOOST_HAS_PTHREAD_DELAY_NP
# undef BOOST_HAS_WINTHREADS
# undef BOOST_HAS_BETHREADS
# undef BOOST_HAS_MPTASKS
#endif
//
// If the compiler claims to be C99 conformant, then it had better
// have a <stdint.h>:
//
# if defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901)
# define BOOST_HAS_STDINT_H
# ifndef BOOST_HAS_LOG1P
# define BOOST_HAS_LOG1P
# endif
# ifndef BOOST_HAS_EXPM1
# define BOOST_HAS_EXPM1
# endif
# endif
//
// Define BOOST_NO_SLIST and BOOST_NO_HASH if required.
// Note that this is for backwards compatibility only.
//
# if !defined(BOOST_HAS_SLIST) && !defined(BOOST_NO_SLIST)
# define BOOST_NO_SLIST
# endif
# if !defined(BOOST_HAS_HASH) && !defined(BOOST_NO_HASH)
# define BOOST_NO_HASH
# endif
//
// Set BOOST_SLIST_HEADER if not set already:
//
#if defined(BOOST_HAS_SLIST) && !defined(BOOST_SLIST_HEADER)
# define BOOST_SLIST_HEADER <slist>
#endif
//
// Set BOOST_HASH_SET_HEADER if not set already:
//
#if defined(BOOST_HAS_HASH) && !defined(BOOST_HASH_SET_HEADER)
# define BOOST_HASH_SET_HEADER <hash_set>
#endif
//
// Set BOOST_HASH_MAP_HEADER if not set already:
//
#if defined(BOOST_HAS_HASH) && !defined(BOOST_HASH_MAP_HEADER)
# define BOOST_HASH_MAP_HEADER <hash_map>
#endif
// BOOST_HAS_ABI_HEADERS
// This macro gets set if we have headers that fix the ABI,
// and prevent ODR violations when linking to external libraries:
#if defined(BOOST_ABI_PREFIX) && defined(BOOST_ABI_SUFFIX) && !defined(BOOST_HAS_ABI_HEADERS)
# define BOOST_HAS_ABI_HEADERS
#endif
#if defined(BOOST_HAS_ABI_HEADERS) && defined(BOOST_DISABLE_ABI_HEADERS)
# undef BOOST_HAS_ABI_HEADERS
#endif
// BOOST_NO_STDC_NAMESPACE workaround --------------------------------------//
// Because std::size_t usage is so common, even in boost headers which do not
// otherwise use the C library, the <cstddef> workaround is included here so
// that ugly workaround code need not appear in many other boost headers.
// NOTE WELL: This is a workaround for non-conforming compilers; <cstddef>
// must still be #included in the usual places so that <cstddef> inclusion
// works as expected with standard conforming compilers. The resulting
// double inclusion of <cstddef> is harmless.
# if defined(BOOST_NO_STDC_NAMESPACE) && defined(__cplusplus)
# include <cstddef>
namespace std { using ::ptrdiff_t; using ::size_t; }
# endif
// Workaround for the unfortunate min/max macros defined by some platform headers
#define BOOST_PREVENT_MACRO_SUBSTITUTION
#ifndef BOOST_USING_STD_MIN
# define BOOST_USING_STD_MIN() using std::min
#endif
#ifndef BOOST_USING_STD_MAX
# define BOOST_USING_STD_MAX() using std::max
#endif
// BOOST_NO_STD_MIN_MAX workaround -----------------------------------------//
# if defined(BOOST_NO_STD_MIN_MAX) && defined(__cplusplus)
namespace std {
template <class _Tp>
inline const _Tp& min BOOST_PREVENT_MACRO_SUBSTITUTION (const _Tp& __a, const _Tp& __b) {
return __b < __a ? __b : __a;
}
template <class _Tp>
inline const _Tp& max BOOST_PREVENT_MACRO_SUBSTITUTION (const _Tp& __a, const _Tp& __b) {
return __a < __b ? __b : __a;
}
}
# endif
// BOOST_STATIC_CONSTANT workaround --------------------------------------- //
// On compilers which don't allow in-class initialization of static integral
// constant members, we must use enums as a workaround if we want the constants
// to be available at compile-time. This macro gives us a convenient way to
// declare such constants.
# ifdef BOOST_NO_INCLASS_MEMBER_INITIALIZATION
# define BOOST_STATIC_CONSTANT(type, assignment) enum { assignment }
# else
# define BOOST_STATIC_CONSTANT(type, assignment) static const type assignment
# endif
// BOOST_USE_FACET / HAS_FACET workaround ----------------------------------//
// When the standard library does not have a conforming std::use_facet there
// are various workarounds available, but they differ from library to library.
// The same problem occurs with has_facet.
// These macros provide a consistent way to access a locale's facets.
// Usage:
// replace
// std::use_facet<Type>(loc);
// with
// BOOST_USE_FACET(Type, loc);
// Note do not add a std:: prefix to the front of BOOST_USE_FACET!
// Use for BOOST_HAS_FACET is analogous.
#if defined(BOOST_NO_STD_USE_FACET)
# ifdef BOOST_HAS_TWO_ARG_USE_FACET
# define BOOST_USE_FACET(Type, loc) std::use_facet(loc, static_cast<Type*>(0))
# define BOOST_HAS_FACET(Type, loc) std::has_facet(loc, static_cast<Type*>(0))
# elif defined(BOOST_HAS_MACRO_USE_FACET)
# define BOOST_USE_FACET(Type, loc) std::_USE(loc, Type)
# define BOOST_HAS_FACET(Type, loc) std::_HAS(loc, Type)
# elif defined(BOOST_HAS_STLP_USE_FACET)
# define BOOST_USE_FACET(Type, loc) (*std::_Use_facet<Type >(loc))
# define BOOST_HAS_FACET(Type, loc) std::has_facet< Type >(loc)
# endif
#else
# define BOOST_USE_FACET(Type, loc) std::use_facet< Type >(loc)
# define BOOST_HAS_FACET(Type, loc) std::has_facet< Type >(loc)
#endif
// BOOST_NESTED_TEMPLATE workaround ------------------------------------------//
// Member templates are supported by some compilers even though they can't use
// the A::template member<U> syntax, as a workaround replace:
//
// typedef typename A::template rebind<U> binder;
//
// with:
//
// typedef typename A::BOOST_NESTED_TEMPLATE rebind<U> binder;
#ifndef BOOST_NO_MEMBER_TEMPLATE_KEYWORD
# define BOOST_NESTED_TEMPLATE template
#else
# define BOOST_NESTED_TEMPLATE
#endif
// BOOST_UNREACHABLE_RETURN(x) workaround -------------------------------------//
// Normally evaluates to nothing, unless BOOST_NO_UNREACHABLE_RETURN_DETECTION
// is defined, in which case it evaluates to return x; Use when you have a return
// statement that can never be reached.
#ifndef BOOST_UNREACHABLE_RETURN
# ifdef BOOST_NO_UNREACHABLE_RETURN_DETECTION
# define BOOST_UNREACHABLE_RETURN(x) return x;
# else
# define BOOST_UNREACHABLE_RETURN(x)
# endif
#endif
// BOOST_DEDUCED_TYPENAME workaround ------------------------------------------//
//
// Some compilers don't support the use of `typename' for dependent
// types in deduced contexts, e.g.
//
// template <class T> void f(T, typename T::type);
// ^^^^^^^^
// Replace these declarations with:
//
// template <class T> void f(T, BOOST_DEDUCED_TYPENAME T::type);
#ifndef BOOST_NO_DEDUCED_TYPENAME
# define BOOST_DEDUCED_TYPENAME typename
#else
# define BOOST_DEDUCED_TYPENAME
#endif
#ifndef BOOST_NO_TYPENAME_WITH_CTOR
# define BOOST_CTOR_TYPENAME typename
#else
# define BOOST_CTOR_TYPENAME
#endif
//
// If we're on a CUDA device (note DEVICE not HOST, irrespective of compiler) then disable __int128 and __float128 support if present:
//
#if defined(__CUDA_ARCH__) && defined(BOOST_HAS_FLOAT128)
# undef BOOST_HAS_FLOAT128
#endif
#if defined(__CUDA_ARCH__) && defined(BOOST_HAS_INT128)
# undef BOOST_HAS_INT128
#endif
// long long workaround ------------------------------------------//
// On gcc (and maybe other compilers?) long long is alway supported
// but it's use may generate either warnings (with -ansi), or errors
// (with -pedantic -ansi) unless it's use is prefixed by __extension__
//
#if defined(BOOST_HAS_LONG_LONG) && defined(__cplusplus)
namespace boost{
# ifdef __GNUC__
__extension__ typedef long long long_long_type;
__extension__ typedef unsigned long long ulong_long_type;
# else
typedef long long long_long_type;
typedef unsigned long long ulong_long_type;
# endif
}
#endif
// same again for __int128:
#if defined(BOOST_HAS_INT128) && defined(__cplusplus)
namespace boost{
# ifdef __GNUC__
__extension__ typedef __int128 int128_type;
__extension__ typedef unsigned __int128 uint128_type;
# else
typedef __int128 int128_type;
typedef unsigned __int128 uint128_type;
# endif
}
#endif
// same again for __float128:
#if defined(BOOST_HAS_FLOAT128) && defined(__cplusplus)
namespace boost {
# ifdef __GNUC__
__extension__ typedef __float128 float128_type;
# else
typedef __float128 float128_type;
# endif
}
#endif
// BOOST_[APPEND_]EXPLICIT_TEMPLATE_[NON_]TYPE macros --------------------------//
// These macros are obsolete. Port away and remove.
# define BOOST_EXPLICIT_TEMPLATE_TYPE(t)
# define BOOST_EXPLICIT_TEMPLATE_TYPE_SPEC(t)
# define BOOST_EXPLICIT_TEMPLATE_NON_TYPE(t, v)
# define BOOST_EXPLICIT_TEMPLATE_NON_TYPE_SPEC(t, v)
# define BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(t)
# define BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE_SPEC(t)
# define BOOST_APPEND_EXPLICIT_TEMPLATE_NON_TYPE(t, v)
# define BOOST_APPEND_EXPLICIT_TEMPLATE_NON_TYPE_SPEC(t, v)
// When BOOST_NO_STD_TYPEINFO is defined, we can just import
// the global definition into std namespace,
// see path_to_url
#if defined(BOOST_NO_STD_TYPEINFO) && defined(__cplusplus) && defined(BOOST_MSVC)
#include <typeinfo>
namespace std{ using ::type_info; }
// Since we do now have typeinfo, undef the macro:
#undef BOOST_NO_STD_TYPEINFO
#endif
// your_sha256_hash-----------//
// Helper macro BOOST_STRINGIZE:
// Helper macro BOOST_JOIN:
#include <boost/config/helper_macros.hpp>
//
// Set some default values for compiler/library/platform names.
// These are for debugging config setup only:
//
# ifndef BOOST_COMPILER
# define BOOST_COMPILER "Unknown ISO C++ Compiler"
# endif
# ifndef BOOST_STDLIB
# define BOOST_STDLIB "Unknown ISO standard library"
# endif
# ifndef BOOST_PLATFORM
# if defined(unix) || defined(__unix) || defined(_XOPEN_SOURCE) \
|| defined(_POSIX_SOURCE)
# define BOOST_PLATFORM "Generic Unix"
# else
# define BOOST_PLATFORM "Unknown"
# endif
# endif
//
// Set some default values GPU support
//
# ifndef BOOST_GPU_ENABLED
# define BOOST_GPU_ENABLED
# endif
// BOOST_RESTRICT ---------------------------------------------//
// Macro to use in place of 'restrict' keyword variants
#if !defined(BOOST_RESTRICT)
# if defined(_MSC_VER)
# define BOOST_RESTRICT __restrict
# if !defined(BOOST_NO_RESTRICT_REFERENCES) && (_MSC_FULL_VER < 190023026)
# define BOOST_NO_RESTRICT_REFERENCES
# endif
# elif defined(__GNUC__) && __GNUC__ > 3
// Clang also defines __GNUC__ (as 4)
# define BOOST_RESTRICT __restrict__
# else
# define BOOST_RESTRICT
# if !defined(BOOST_NO_RESTRICT_REFERENCES)
# define BOOST_NO_RESTRICT_REFERENCES
# endif
# endif
#endif
// BOOST_MAY_ALIAS -----------------------------------------------//
// The macro expands to an attribute to mark a type that is allowed to alias other types.
// The macro is defined in the compiler-specific headers.
#if !defined(BOOST_MAY_ALIAS)
# define BOOST_NO_MAY_ALIAS
# define BOOST_MAY_ALIAS
#endif
// BOOST_FORCEINLINE ---------------------------------------------//
// Macro to use in place of 'inline' to force a function to be inline
#if !defined(BOOST_FORCEINLINE)
# if defined(_MSC_VER)
# define BOOST_FORCEINLINE __forceinline
# elif defined(__GNUC__) && __GNUC__ > 3
// Clang also defines __GNUC__ (as 4)
# define BOOST_FORCEINLINE inline __attribute__ ((__always_inline__))
# else
# define BOOST_FORCEINLINE inline
# endif
#endif
// BOOST_NOINLINE ---------------------------------------------//
// Macro to use in place of 'inline' to prevent a function to be inlined
#if !defined(BOOST_NOINLINE)
# if defined(_MSC_VER)
# define BOOST_NOINLINE __declspec(noinline)
# elif defined(__GNUC__) && __GNUC__ > 3
// Clang also defines __GNUC__ (as 4)
# if defined(__CUDACC__)
// nvcc doesn't always parse __noinline__,
// see: path_to_url
# define BOOST_NOINLINE __attribute__ ((noinline))
# elif defined(HIP_VERSION)
// See path_to_url
# define BOOST_NOINLINE __attribute__ ((noinline))
# else
# define BOOST_NOINLINE __attribute__ ((__noinline__))
# endif
# else
# define BOOST_NOINLINE
# endif
#endif
// BOOST_NORETURN ---------------------------------------------//
// Macro to use before a function declaration/definition to designate
// the function as not returning normally (i.e. with a return statement
// or by leaving the function scope, if the function return type is void).
#if !defined(BOOST_NORETURN)
# if defined(_MSC_VER)
# define BOOST_NORETURN __declspec(noreturn)
# elif defined(__GNUC__) || defined(__CODEGEARC__) && defined(__clang__)
# define BOOST_NORETURN __attribute__ ((__noreturn__))
# elif defined(__has_attribute) && defined(__SUNPRO_CC) && (__SUNPRO_CC > 0x5130)
# if __has_attribute(noreturn)
# define BOOST_NORETURN [[noreturn]]
# endif
# elif defined(__has_cpp_attribute)
# if __has_cpp_attribute(noreturn)
# define BOOST_NORETURN [[noreturn]]
# endif
# endif
#endif
#if !defined(BOOST_NORETURN)
# define BOOST_NO_NORETURN
# define BOOST_NORETURN
#endif
// Branch prediction hints
// These macros are intended to wrap conditional expressions that yield true or false
//
// if (BOOST_LIKELY(var == 10))
// {
// // the most probable code here
// }
//
#if !defined(BOOST_LIKELY)
# define BOOST_LIKELY(x) x
#endif
#if !defined(BOOST_UNLIKELY)
# define BOOST_UNLIKELY(x) x
#endif
#if !defined(BOOST_NO_CXX11_OVERRIDE)
# define BOOST_OVERRIDE override
#else
# define BOOST_OVERRIDE
#endif
// Type and data alignment specification
//
#if !defined(BOOST_ALIGNMENT)
# if !defined(BOOST_NO_CXX11_ALIGNAS)
# define BOOST_ALIGNMENT(x) alignas(x)
# elif defined(_MSC_VER)
# define BOOST_ALIGNMENT(x) __declspec(align(x))
# elif defined(__GNUC__)
# define BOOST_ALIGNMENT(x) __attribute__ ((__aligned__(x)))
# else
# define BOOST_NO_ALIGNMENT
# define BOOST_ALIGNMENT(x)
# endif
#endif
// Lack of non-public defaulted functions is implied by the lack of any defaulted functions
#if !defined(BOOST_NO_CXX11_NON_PUBLIC_DEFAULTED_FUNCTIONS) && defined(BOOST_NO_CXX11_DEFAULTED_FUNCTIONS)
# define BOOST_NO_CXX11_NON_PUBLIC_DEFAULTED_FUNCTIONS
#endif
// Lack of defaulted moves is implied by the lack of either rvalue references or any defaulted functions
#if !defined(BOOST_NO_CXX11_DEFAULTED_MOVES) && (defined(BOOST_NO_CXX11_DEFAULTED_FUNCTIONS) || defined(BOOST_NO_CXX11_RVALUE_REFERENCES))
# define BOOST_NO_CXX11_DEFAULTED_MOVES
#endif
// Defaulted and deleted function declaration helpers
// These macros are intended to be inside a class definition.
// BOOST_DEFAULTED_FUNCTION accepts the function declaration and its
// body, which will be used if the compiler doesn't support defaulted functions.
// BOOST_DELETED_FUNCTION only accepts the function declaration. It
// will expand to a private function declaration, if the compiler doesn't support
// deleted functions. Because of this it is recommended to use BOOST_DELETED_FUNCTION
// in the end of the class definition.
//
// class my_class
// {
// public:
// // Default-constructible
// BOOST_DEFAULTED_FUNCTION(my_class(), {})
// // Copying prohibited
// BOOST_DELETED_FUNCTION(my_class(my_class const&))
// BOOST_DELETED_FUNCTION(my_class& operator= (my_class const&))
// };
//
#if !(defined(BOOST_NO_CXX11_DEFAULTED_FUNCTIONS) || defined(BOOST_NO_CXX11_NON_PUBLIC_DEFAULTED_FUNCTIONS))
# define BOOST_DEFAULTED_FUNCTION(fun, body) fun = default;
#else
# define BOOST_DEFAULTED_FUNCTION(fun, body) fun body
#endif
#if !defined(BOOST_NO_CXX11_DELETED_FUNCTIONS)
# define BOOST_DELETED_FUNCTION(fun) fun = delete;
#else
# define BOOST_DELETED_FUNCTION(fun) private: fun;
#endif
//
// Set BOOST_NO_DECLTYPE_N3276 when BOOST_NO_DECLTYPE is defined
//
#if defined(BOOST_NO_CXX11_DECLTYPE) && !defined(BOOST_NO_CXX11_DECLTYPE_N3276)
#define BOOST_NO_CXX11_DECLTYPE_N3276 BOOST_NO_CXX11_DECLTYPE
#endif
// -------------------- Deprecated macros for 1.50 ---------------------------
// These will go away in a future release
// Use BOOST_NO_CXX11_HDR_UNORDERED_SET or BOOST_NO_CXX11_HDR_UNORDERED_MAP
// instead of BOOST_NO_STD_UNORDERED
#if defined(BOOST_NO_CXX11_HDR_UNORDERED_MAP) || defined (BOOST_NO_CXX11_HDR_UNORDERED_SET)
# ifndef BOOST_NO_CXX11_STD_UNORDERED
# define BOOST_NO_CXX11_STD_UNORDERED
# endif
#endif
// Use BOOST_NO_CXX11_HDR_INITIALIZER_LIST instead of BOOST_NO_INITIALIZER_LISTS
#if defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) && !defined(BOOST_NO_INITIALIZER_LISTS)
# define BOOST_NO_INITIALIZER_LISTS
#endif
// Use BOOST_NO_CXX11_HDR_ARRAY instead of BOOST_NO_0X_HDR_ARRAY
#if defined(BOOST_NO_CXX11_HDR_ARRAY) && !defined(BOOST_NO_0X_HDR_ARRAY)
# define BOOST_NO_0X_HDR_ARRAY
#endif
// Use BOOST_NO_CXX11_HDR_CHRONO instead of BOOST_NO_0X_HDR_CHRONO
#if defined(BOOST_NO_CXX11_HDR_CHRONO) && !defined(BOOST_NO_0X_HDR_CHRONO)
# define BOOST_NO_0X_HDR_CHRONO
#endif
// Use BOOST_NO_CXX11_HDR_CODECVT instead of BOOST_NO_0X_HDR_CODECVT
#if defined(BOOST_NO_CXX11_HDR_CODECVT) && !defined(BOOST_NO_0X_HDR_CODECVT)
# define BOOST_NO_0X_HDR_CODECVT
#endif
// Use BOOST_NO_CXX11_HDR_CONDITION_VARIABLE instead of BOOST_NO_0X_HDR_CONDITION_VARIABLE
#if defined(BOOST_NO_CXX11_HDR_CONDITION_VARIABLE) && !defined(BOOST_NO_0X_HDR_CONDITION_VARIABLE)
# define BOOST_NO_0X_HDR_CONDITION_VARIABLE
#endif
// Use BOOST_NO_CXX11_HDR_FORWARD_LIST instead of BOOST_NO_0X_HDR_FORWARD_LIST
#if defined(BOOST_NO_CXX11_HDR_FORWARD_LIST) && !defined(BOOST_NO_0X_HDR_FORWARD_LIST)
# define BOOST_NO_0X_HDR_FORWARD_LIST
#endif
// Use BOOST_NO_CXX11_HDR_FUTURE instead of BOOST_NO_0X_HDR_FUTURE
#if defined(BOOST_NO_CXX11_HDR_FUTURE) && !defined(BOOST_NO_0X_HDR_FUTURE)
# define BOOST_NO_0X_HDR_FUTURE
#endif
// Use BOOST_NO_CXX11_HDR_INITIALIZER_LIST
// instead of BOOST_NO_0X_HDR_INITIALIZER_LIST or BOOST_NO_INITIALIZER_LISTS
#ifdef BOOST_NO_CXX11_HDR_INITIALIZER_LIST
# ifndef BOOST_NO_0X_HDR_INITIALIZER_LIST
# define BOOST_NO_0X_HDR_INITIALIZER_LIST
# endif
# ifndef BOOST_NO_INITIALIZER_LISTS
# define BOOST_NO_INITIALIZER_LISTS
# endif
#endif
// Use BOOST_NO_CXX11_HDR_MUTEX instead of BOOST_NO_0X_HDR_MUTEX
#if defined(BOOST_NO_CXX11_HDR_MUTEX) && !defined(BOOST_NO_0X_HDR_MUTEX)
# define BOOST_NO_0X_HDR_MUTEX
#endif
// Use BOOST_NO_CXX11_HDR_RANDOM instead of BOOST_NO_0X_HDR_RANDOM
#if defined(BOOST_NO_CXX11_HDR_RANDOM) && !defined(BOOST_NO_0X_HDR_RANDOM)
# define BOOST_NO_0X_HDR_RANDOM
#endif
// Use BOOST_NO_CXX11_HDR_RATIO instead of BOOST_NO_0X_HDR_RATIO
#if defined(BOOST_NO_CXX11_HDR_RATIO) && !defined(BOOST_NO_0X_HDR_RATIO)
# define BOOST_NO_0X_HDR_RATIO
#endif
// Use BOOST_NO_CXX11_HDR_REGEX instead of BOOST_NO_0X_HDR_REGEX
#if defined(BOOST_NO_CXX11_HDR_REGEX) && !defined(BOOST_NO_0X_HDR_REGEX)
# define BOOST_NO_0X_HDR_REGEX
#endif
// Use BOOST_NO_CXX11_HDR_SYSTEM_ERROR instead of BOOST_NO_0X_HDR_SYSTEM_ERROR
#if defined(BOOST_NO_CXX11_HDR_SYSTEM_ERROR) && !defined(BOOST_NO_0X_HDR_SYSTEM_ERROR)
# define BOOST_NO_0X_HDR_SYSTEM_ERROR
#endif
// Use BOOST_NO_CXX11_HDR_THREAD instead of BOOST_NO_0X_HDR_THREAD
#if defined(BOOST_NO_CXX11_HDR_THREAD) && !defined(BOOST_NO_0X_HDR_THREAD)
# define BOOST_NO_0X_HDR_THREAD
#endif
// Use BOOST_NO_CXX11_HDR_TUPLE instead of BOOST_NO_0X_HDR_TUPLE
#if defined(BOOST_NO_CXX11_HDR_TUPLE) && !defined(BOOST_NO_0X_HDR_TUPLE)
# define BOOST_NO_0X_HDR_TUPLE
#endif
// Use BOOST_NO_CXX11_HDR_TYPE_TRAITS instead of BOOST_NO_0X_HDR_TYPE_TRAITS
#if defined(BOOST_NO_CXX11_HDR_TYPE_TRAITS) && !defined(BOOST_NO_0X_HDR_TYPE_TRAITS)
# define BOOST_NO_0X_HDR_TYPE_TRAITS
#endif
// Use BOOST_NO_CXX11_HDR_TYPEINDEX instead of BOOST_NO_0X_HDR_TYPEINDEX
#if defined(BOOST_NO_CXX11_HDR_TYPEINDEX) && !defined(BOOST_NO_0X_HDR_TYPEINDEX)
# define BOOST_NO_0X_HDR_TYPEINDEX
#endif
// Use BOOST_NO_CXX11_HDR_UNORDERED_MAP instead of BOOST_NO_0X_HDR_UNORDERED_MAP
#if defined(BOOST_NO_CXX11_HDR_UNORDERED_MAP) && !defined(BOOST_NO_0X_HDR_UNORDERED_MAP)
# define BOOST_NO_0X_HDR_UNORDERED_MAP
#endif
// Use BOOST_NO_CXX11_HDR_UNORDERED_SET instead of BOOST_NO_0X_HDR_UNORDERED_SET
#if defined(BOOST_NO_CXX11_HDR_UNORDERED_SET) && !defined(BOOST_NO_0X_HDR_UNORDERED_SET)
# define BOOST_NO_0X_HDR_UNORDERED_SET
#endif
// ------------------ End of deprecated macros for 1.50 ---------------------------
// -------------------- Deprecated macros for 1.51 ---------------------------
// These will go away in a future release
// Use BOOST_NO_CXX11_AUTO_DECLARATIONS instead of BOOST_NO_AUTO_DECLARATIONS
#if defined(BOOST_NO_CXX11_AUTO_DECLARATIONS) && !defined(BOOST_NO_AUTO_DECLARATIONS)
# define BOOST_NO_AUTO_DECLARATIONS
#endif
// Use BOOST_NO_CXX11_AUTO_MULTIDECLARATIONS instead of BOOST_NO_AUTO_MULTIDECLARATIONS
#if defined(BOOST_NO_CXX11_AUTO_MULTIDECLARATIONS) && !defined(BOOST_NO_AUTO_MULTIDECLARATIONS)
# define BOOST_NO_AUTO_MULTIDECLARATIONS
#endif
// Use BOOST_NO_CXX11_CHAR16_T instead of BOOST_NO_CHAR16_T
#if defined(BOOST_NO_CXX11_CHAR16_T) && !defined(BOOST_NO_CHAR16_T)
# define BOOST_NO_CHAR16_T
#endif
// Use BOOST_NO_CXX11_CHAR32_T instead of BOOST_NO_CHAR32_T
#if defined(BOOST_NO_CXX11_CHAR32_T) && !defined(BOOST_NO_CHAR32_T)
# define BOOST_NO_CHAR32_T
#endif
// Use BOOST_NO_CXX11_TEMPLATE_ALIASES instead of BOOST_NO_TEMPLATE_ALIASES
#if defined(BOOST_NO_CXX11_TEMPLATE_ALIASES) && !defined(BOOST_NO_TEMPLATE_ALIASES)
# define BOOST_NO_TEMPLATE_ALIASES
#endif
// Use BOOST_NO_CXX11_CONSTEXPR instead of BOOST_NO_CONSTEXPR
#if defined(BOOST_NO_CXX11_CONSTEXPR) && !defined(BOOST_NO_CONSTEXPR)
# define BOOST_NO_CONSTEXPR
#endif
// Use BOOST_NO_CXX11_DECLTYPE_N3276 instead of BOOST_NO_DECLTYPE_N3276
#if defined(BOOST_NO_CXX11_DECLTYPE_N3276) && !defined(BOOST_NO_DECLTYPE_N3276)
# define BOOST_NO_DECLTYPE_N3276
#endif
// Use BOOST_NO_CXX11_DECLTYPE instead of BOOST_NO_DECLTYPE
#if defined(BOOST_NO_CXX11_DECLTYPE) && !defined(BOOST_NO_DECLTYPE)
# define BOOST_NO_DECLTYPE
#endif
// Use BOOST_NO_CXX11_DEFAULTED_FUNCTIONS instead of BOOST_NO_DEFAULTED_FUNCTIONS
#if defined(BOOST_NO_CXX11_DEFAULTED_FUNCTIONS) && !defined(BOOST_NO_DEFAULTED_FUNCTIONS)
# define BOOST_NO_DEFAULTED_FUNCTIONS
#endif
// Use BOOST_NO_CXX11_DELETED_FUNCTIONS instead of BOOST_NO_DELETED_FUNCTIONS
#if defined(BOOST_NO_CXX11_DELETED_FUNCTIONS) && !defined(BOOST_NO_DELETED_FUNCTIONS)
# define BOOST_NO_DELETED_FUNCTIONS
#endif
// Use BOOST_NO_CXX11_EXPLICIT_CONVERSION_OPERATORS instead of BOOST_NO_EXPLICIT_CONVERSION_OPERATORS
#if defined(BOOST_NO_CXX11_EXPLICIT_CONVERSION_OPERATORS) && !defined(BOOST_NO_EXPLICIT_CONVERSION_OPERATORS)
# define BOOST_NO_EXPLICIT_CONVERSION_OPERATORS
#endif
// Use BOOST_NO_CXX11_EXTERN_TEMPLATE instead of BOOST_NO_EXTERN_TEMPLATE
#if defined(BOOST_NO_CXX11_EXTERN_TEMPLATE) && !defined(BOOST_NO_EXTERN_TEMPLATE)
# define BOOST_NO_EXTERN_TEMPLATE
#endif
// Use BOOST_NO_CXX11_FUNCTION_TEMPLATE_DEFAULT_ARGS instead of BOOST_NO_FUNCTION_TEMPLATE_DEFAULT_ARGS
#if defined(BOOST_NO_CXX11_FUNCTION_TEMPLATE_DEFAULT_ARGS) && !defined(BOOST_NO_FUNCTION_TEMPLATE_DEFAULT_ARGS)
# define BOOST_NO_FUNCTION_TEMPLATE_DEFAULT_ARGS
#endif
// Use BOOST_NO_CXX11_LAMBDAS instead of BOOST_NO_LAMBDAS
#if defined(BOOST_NO_CXX11_LAMBDAS) && !defined(BOOST_NO_LAMBDAS)
# define BOOST_NO_LAMBDAS
#endif
// Use BOOST_NO_CXX11_LOCAL_CLASS_TEMPLATE_PARAMETERS instead of BOOST_NO_LOCAL_CLASS_TEMPLATE_PARAMETERS
#if defined(BOOST_NO_CXX11_LOCAL_CLASS_TEMPLATE_PARAMETERS) && !defined(BOOST_NO_LOCAL_CLASS_TEMPLATE_PARAMETERS)
# define BOOST_NO_LOCAL_CLASS_TEMPLATE_PARAMETERS
#endif
// Use BOOST_NO_CXX11_NOEXCEPT instead of BOOST_NO_NOEXCEPT
#if defined(BOOST_NO_CXX11_NOEXCEPT) && !defined(BOOST_NO_NOEXCEPT)
# define BOOST_NO_NOEXCEPT
#endif
// Use BOOST_NO_CXX11_NULLPTR instead of BOOST_NO_NULLPTR
#if defined(BOOST_NO_CXX11_NULLPTR) && !defined(BOOST_NO_NULLPTR)
# define BOOST_NO_NULLPTR
#endif
// Use BOOST_NO_CXX11_RAW_LITERALS instead of BOOST_NO_RAW_LITERALS
#if defined(BOOST_NO_CXX11_RAW_LITERALS) && !defined(BOOST_NO_RAW_LITERALS)
# define BOOST_NO_RAW_LITERALS
#endif
// Use BOOST_NO_CXX11_RVALUE_REFERENCES instead of BOOST_NO_RVALUE_REFERENCES
#if defined(BOOST_NO_CXX11_RVALUE_REFERENCES) && !defined(BOOST_NO_RVALUE_REFERENCES)
# define BOOST_NO_RVALUE_REFERENCES
#endif
// Use BOOST_NO_CXX11_SCOPED_ENUMS instead of BOOST_NO_SCOPED_ENUMS
#if defined(BOOST_NO_CXX11_SCOPED_ENUMS) && !defined(BOOST_NO_SCOPED_ENUMS)
# define BOOST_NO_SCOPED_ENUMS
#endif
// Use BOOST_NO_CXX11_STATIC_ASSERT instead of BOOST_NO_STATIC_ASSERT
#if defined(BOOST_NO_CXX11_STATIC_ASSERT) && !defined(BOOST_NO_STATIC_ASSERT)
# define BOOST_NO_STATIC_ASSERT
#endif
// Use BOOST_NO_CXX11_STD_UNORDERED instead of BOOST_NO_STD_UNORDERED
#if defined(BOOST_NO_CXX11_STD_UNORDERED) && !defined(BOOST_NO_STD_UNORDERED)
# define BOOST_NO_STD_UNORDERED
#endif
// Use BOOST_NO_CXX11_UNICODE_LITERALS instead of BOOST_NO_UNICODE_LITERALS
#if defined(BOOST_NO_CXX11_UNICODE_LITERALS) && !defined(BOOST_NO_UNICODE_LITERALS)
# define BOOST_NO_UNICODE_LITERALS
#endif
// Use BOOST_NO_CXX11_UNIFIED_INITIALIZATION_SYNTAX instead of BOOST_NO_UNIFIED_INITIALIZATION_SYNTAX
#if defined(BOOST_NO_CXX11_UNIFIED_INITIALIZATION_SYNTAX) && !defined(BOOST_NO_UNIFIED_INITIALIZATION_SYNTAX)
# define BOOST_NO_UNIFIED_INITIALIZATION_SYNTAX
#endif
// Use BOOST_NO_CXX11_VARIADIC_TEMPLATES instead of BOOST_NO_VARIADIC_TEMPLATES
#if defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) && !defined(BOOST_NO_VARIADIC_TEMPLATES)
# define BOOST_NO_VARIADIC_TEMPLATES
#endif
// Use BOOST_NO_CXX11_VARIADIC_MACROS instead of BOOST_NO_VARIADIC_MACROS
#if defined(BOOST_NO_CXX11_VARIADIC_MACROS) && !defined(BOOST_NO_VARIADIC_MACROS)
# define BOOST_NO_VARIADIC_MACROS
#endif
// Use BOOST_NO_CXX11_NUMERIC_LIMITS instead of BOOST_NO_NUMERIC_LIMITS_LOWEST
#if defined(BOOST_NO_CXX11_NUMERIC_LIMITS) && !defined(BOOST_NO_NUMERIC_LIMITS_LOWEST)
# define BOOST_NO_NUMERIC_LIMITS_LOWEST
#endif
// ------------------ End of deprecated macros for 1.51 ---------------------------
//
// Helper macro for marking types and methods final
//
#if !defined(BOOST_NO_CXX11_FINAL)
# define BOOST_FINAL final
#else
# define BOOST_FINAL
#endif
//
// Helper macros BOOST_NOEXCEPT, BOOST_NOEXCEPT_IF, BOOST_NOEXCEPT_EXPR
// These aid the transition to C++11 while still supporting C++03 compilers
//
#ifdef BOOST_NO_CXX11_NOEXCEPT
# define BOOST_NOEXCEPT
# define BOOST_NOEXCEPT_OR_NOTHROW throw()
# define BOOST_NOEXCEPT_IF(Predicate)
# define BOOST_NOEXCEPT_EXPR(Expression) false
#else
# define BOOST_NOEXCEPT noexcept
# define BOOST_NOEXCEPT_OR_NOTHROW noexcept
# define BOOST_NOEXCEPT_IF(Predicate) noexcept((Predicate))
# define BOOST_NOEXCEPT_EXPR(Expression) noexcept((Expression))
#endif
//
// Helper macro BOOST_FALLTHROUGH
// Fallback definition of BOOST_FALLTHROUGH macro used to mark intended
// fall-through between case labels in a switch statement. We use a definition
// that requires a semicolon after it to avoid at least one type of misuse even
// on unsupported compilers.
//
#ifndef BOOST_FALLTHROUGH
# define BOOST_FALLTHROUGH ((void)0)
#endif
//
// constexpr workarounds
//
#if defined(BOOST_NO_CXX11_CONSTEXPR)
#define BOOST_CONSTEXPR
#define BOOST_CONSTEXPR_OR_CONST const
#else
#define BOOST_CONSTEXPR constexpr
#define BOOST_CONSTEXPR_OR_CONST constexpr
#endif
#if defined(BOOST_NO_CXX14_CONSTEXPR)
#define BOOST_CXX14_CONSTEXPR
#else
#define BOOST_CXX14_CONSTEXPR constexpr
#endif
//
// C++17 inline variables
//
#if !defined(BOOST_NO_CXX17_INLINE_VARIABLES)
#define BOOST_INLINE_VARIABLE inline
#else
#define BOOST_INLINE_VARIABLE
#endif
//
// C++17 if constexpr
//
#if !defined(BOOST_NO_CXX17_IF_CONSTEXPR)
# define BOOST_IF_CONSTEXPR if constexpr
#else
# define BOOST_IF_CONSTEXPR if
#endif
#define BOOST_INLINE_CONSTEXPR BOOST_INLINE_VARIABLE BOOST_CONSTEXPR_OR_CONST
//
// Unused variable/typedef workarounds:
//
#ifndef BOOST_ATTRIBUTE_UNUSED
# define BOOST_ATTRIBUTE_UNUSED
#endif
//
// [[nodiscard]]:
//
#if defined(__has_attribute) && defined(__SUNPRO_CC) && (__SUNPRO_CC > 0x5130)
#if __has_attribute(nodiscard)
# define BOOST_ATTRIBUTE_NODISCARD [[nodiscard]]
#endif
#if __has_attribute(no_unique_address)
# define BOOST_ATTRIBUTE_NO_UNIQUE_ADDRESS [[no_unique_address]]
#endif
#elif defined(__has_cpp_attribute)
// clang-6 accepts [[nodiscard]] with -std=c++14, but warns about it -pedantic
#if __has_cpp_attribute(nodiscard) && !(defined(__clang__) && (__cplusplus < 201703L)) && !(defined(__GNUC__) && (__cplusplus < 201100))
# define BOOST_ATTRIBUTE_NODISCARD [[nodiscard]]
#endif
#if __has_cpp_attribute(no_unique_address) && !(defined(__GNUC__) && (__cplusplus < 201100))
# define BOOST_ATTRIBUTE_NO_UNIQUE_ADDRESS [[no_unique_address]]
#endif
#endif
#ifndef BOOST_ATTRIBUTE_NODISCARD
# define BOOST_ATTRIBUTE_NODISCARD
#endif
#ifndef BOOST_ATTRIBUTE_NO_UNIQUE_ADDRESS
# define BOOST_ATTRIBUTE_NO_UNIQUE_ADDRESS
#endif
#define BOOST_STATIC_CONSTEXPR static BOOST_CONSTEXPR_OR_CONST
//
// Set BOOST_HAS_STATIC_ASSERT when BOOST_NO_CXX11_STATIC_ASSERT is not defined
//
#if !defined(BOOST_NO_CXX11_STATIC_ASSERT) && !defined(BOOST_HAS_STATIC_ASSERT)
# define BOOST_HAS_STATIC_ASSERT
#endif
//
// Set BOOST_HAS_RVALUE_REFS when BOOST_NO_CXX11_RVALUE_REFERENCES is not defined
//
#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES) && !defined(BOOST_HAS_RVALUE_REFS)
#define BOOST_HAS_RVALUE_REFS
#endif
//
// Set BOOST_HAS_VARIADIC_TMPL when BOOST_NO_CXX11_VARIADIC_TEMPLATES is not defined
//
#if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) && !defined(BOOST_HAS_VARIADIC_TMPL)
#define BOOST_HAS_VARIADIC_TMPL
#endif
//
// Set BOOST_NO_CXX11_FIXED_LENGTH_VARIADIC_TEMPLATE_EXPANSION_PACKS when
// BOOST_NO_CXX11_VARIADIC_TEMPLATES is set:
//
#if defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) && !defined(BOOST_NO_CXX11_FIXED_LENGTH_VARIADIC_TEMPLATE_EXPANSION_PACKS)
# define BOOST_NO_CXX11_FIXED_LENGTH_VARIADIC_TEMPLATE_EXPANSION_PACKS
#endif
// This is a catch all case for obsolete compilers / std libs:
#if !defined(_YVALS) && !defined(_CPPLIB_VER) // msvc std lib already configured
#if (!defined(__has_include) || (__cplusplus < 201700))
# define BOOST_NO_CXX17_HDR_OPTIONAL
# define BOOST_NO_CXX17_HDR_STRING_VIEW
# define BOOST_NO_CXX17_HDR_VARIANT
# define BOOST_NO_CXX17_HDR_ANY
# define BOOST_NO_CXX17_HDR_MEMORY_RESOURCE
# define BOOST_NO_CXX17_HDR_CHARCONV
# define BOOST_NO_CXX17_HDR_EXECUTION
# define BOOST_NO_CXX17_HDR_FILESYSTEM
#else
#if !__has_include(<optional>)
# define BOOST_NO_CXX17_HDR_OPTIONAL
#endif
#if !__has_include(<string_view>)
# define BOOST_NO_CXX17_HDR_STRING_VIEW
#endif
#if !__has_include(<variant>)
# define BOOST_NO_CXX17_HDR_VARIANT
#endif
#if !__has_include(<any>)
# define BOOST_NO_CXX17_HDR_ANY
#endif
#if !__has_include(<memory_resource>)
# define BOOST_NO_CXX17_HDR_MEMORY_RESOURCE
#endif
#if !__has_include(<charconv>)
# define BOOST_NO_CXX17_HDR_CHARCONV
#endif
#if !__has_include(<execution>)
# define BOOST_NO_CXX17_HDR_EXECUTION
#endif
#if !__has_include(<filesystem>)
# define BOOST_NO_CXX17_HDR_FILESYSTEM
#endif
#endif
#endif
#if !defined(_YVALS) && !defined(_CPPLIB_VER) // msvc std lib already configured
#if (!defined(__has_include) || (__cplusplus < 201704))
# define BOOST_NO_CXX20_HDR_BARRIER
# define BOOST_NO_CXX20_HDR_FORMAT
# define BOOST_NO_CXX20_HDR_SOURCE_LOCATION
# define BOOST_NO_CXX20_HDR_BIT
# define BOOST_NO_CXX20_HDR_LATCH
# define BOOST_NO_CXX20_HDR_SPAN
# define BOOST_NO_CXX20_HDR_COMPARE
# define BOOST_NO_CXX20_HDR_NUMBERS
# define BOOST_NO_CXX20_HDR_STOP_TOKEN
# define BOOST_NO_CXX20_HDR_CONCEPTS
# define BOOST_NO_CXX20_HDR_RANGES
# define BOOST_NO_CXX20_HDR_SYNCSTREAM
# define BOOST_NO_CXX20_HDR_COROUTINE
# define BOOST_NO_CXX20_HDR_SEMAPHORE
#else
#if !__has_include(<barrier>)
# define BOOST_NO_CXX20_HDR_BARRIER
#endif
#if !__has_include(<format>)
# define BOOST_NO_CXX20_HDR_FORMAT
#endif
#if !__has_include(<source_Location>)
# define BOOST_NO_CXX20_HDR_SOURCE_LOCATION
#endif
#if !__has_include(<bit>)
# define BOOST_NO_CXX20_HDR_BIT
#endif
#if !__has_include(<latch>)
# define BOOST_NO_CXX20_HDR_LATCH
#endif
#if !__has_include(<span>)
# define BOOST_NO_CXX20_HDR_SPAN
#endif
#if !__has_include(<compare>)
# define BOOST_NO_CXX20_HDR_COMPARE
#endif
#if !__has_include(<numbers>)
# define BOOST_NO_CXX20_HDR_NUMBERS
#endif
#if !__has_include(<stop_token>)
# define BOOST_NO_CXX20_HDR_STOP_TOKEN
#endif
#if !__has_include(<concepts>)
# define BOOST_NO_CXX20_HDR_CONCEPTS
#endif
#if !__has_include(<ranges>)
# define BOOST_NO_CXX20_HDR_RANGES
#endif
#if !__has_include(<syncstream>)
# define BOOST_NO_CXX20_HDR_SYNCSTREAM
#endif
#if !__has_include(<coroutine>)
# define BOOST_NO_CXX20_HDR_COROUTINE
#endif
#if !__has_include(<semaphore>)
# define BOOST_NO_CXX20_HDR_SEMAPHORE
#endif
#endif
#endif
//
// Define composite agregate macros:
//
#include <boost/config/detail/cxx_composite.hpp>
//
// Define the std level that the compiler claims to support:
//
#ifndef BOOST_CXX_VERSION
# define BOOST_CXX_VERSION __cplusplus
#endif
//
// Define composite agregate macros:
//
#include <boost/config/detail/cxx_composite.hpp>
//
// Define the std level that the compiler claims to support:
//
#ifndef BOOST_CXX_VERSION
# define BOOST_CXX_VERSION __cplusplus
#endif
//
// Finish off with checks for macros that are depricated / no longer supported,
// if any of these are set then it's very likely that much of Boost will no
// longer work. So stop with a #error for now, but give the user a chance
// to continue at their own risk if they really want to:
//
#if defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) && !defined(BOOST_CONFIG_ALLOW_DEPRECATED)
# error "You are using a compiler which lacks features which are now a minimum requirement in order to use Boost, define BOOST_CONFIG_ALLOW_DEPRECATED if you want to continue at your own risk!!!"
#endif
#endif
```
|
Luis Edmundo Durán Riquelme (born 2 June 1979) is a Chilean former professional footballer who played as a defender.
Club career
Born in Valdivia, Chile, he began his career playing for Deportes Linares in the Primera B de Chile in 1998. He stayed in the Chilean football until 2006, when he moved to Indonesia and joined Mitra Kukar in the Divisi Satu. In 2009 he joined Persita Tangerang in the Divisi Utama, staying at the club until 2016.
Following his retirement, he developed a coaching career in Persita Tangerang at youth level.
Managerial statistics
References
External links
Luis Durán at MemoriaWanderers
http://luisduranr.blogspot.com/
Living people
1979 births
People from Valdivia
Men's association football defenders
Chilean men's footballers
Chilean expatriate men's footballers
Chile men's youth international footballers
Deportes Linares footballers
Unión La Calera footballers
Deportes Ovalle footballers
Deportes Copiapó footballers
Santiago Wanderers footballers
PS Mitra Kukar players
Persis Solo players
Persita Tangerang players
Primera B de Chile players
Chilean Primera División players
Indonesian Premier Division players
Liga 1 (Indonesia) players
Chilean expatriate sportspeople in Indonesia
Expatriate men's footballers in Indonesia
Persita Tangerang managers
Chilean football managers
Chilean expatriate football managers
Expatriate football managers in Indonesia
Liga 1 (Indonesia) managers
|
Sar Chah (, also Romanized as Sar Chāh) is a village in Poshtkuh Rural District, in the Central District of Ardal County, Chaharmahal and Bakhtiari Province, Iran. At the 2006 census, its population was 1,857, in 375 families. The village is populated by Lurs.
References
Populated places in Ardal County
Luri settlements in Chaharmahal and Bakhtiari Province
|
```c
/* Compute the CDF of the Tukey-Lambda distribution
* using a braketing search with special checks
*
* The PPF of the Tukey-lambda distribution is
* G(p) = p**lam + (1-p)**lam / lam
*
* Author: Travis Oliphant
*/
#include "owl_maths.h"
#define SMALLVAL 1e-4
#define EPS 1.0e-14
#define MAXCOUNT 60
double tukeylambdacdf(double x, double lmbda)
{
double pmin, pmid, pmax, plow, phigh, xeval;
int count;
if (owl_isnan(x) || owl_isnan(lmbda)) {
return OWL_NAN;
}
xeval = 1.0 / lmbda;
if (lmbda > 0.0) {
if (x < (-xeval))
return 0.0;
if (x > xeval)
return 1.0;
}
if ((-SMALLVAL < lmbda) && (lmbda < SMALLVAL)) {
if (x >= 0)
return 1.0 / (1.0 + exp(-x));
else
return exp(x) / (1.0 + exp(x));
}
pmin = 0.0;
pmid = 0.5;
pmax = 1.0;
plow = pmin;
phigh = pmax;
count = 0;
while ((count < MAXCOUNT) && (fabs(pmid - plow) > EPS)) {
xeval = (pow(pmid, lmbda) - pow(1.0 - pmid, lmbda)) / lmbda;
if (xeval == x)
return pmid;
if (xeval > x) {
phigh = pmid;
pmid = (pmid + plow) / 2.0;
}
else {
plow = pmid;
pmid = (pmid + phigh) / 2.0;
}
count++;
}
return pmid;
}
```
|
```objective-c
#pragma once
#include "i_saver.h"
#include "document_features_store.h"
namespace search { class BufferWriter; }
namespace search::predicate {
/*
* Class used to save a DocumentFeaturesStore instance, streaming the
* serialized data via a BufferWriter.
*/
class DocumentFeaturesStoreSaver : public ISaver {
using RefsVector = DocumentFeaturesStore::RefsVector;
using FeaturesStore = DocumentFeaturesStore::FeaturesStore;
using RangesStore = DocumentFeaturesStore::RangesStore;
using WordStore = DocumentFeaturesStore::WordStore;
const RefsVector _refs;
const FeaturesStore& _features;
const RangesStore& _ranges;
const WordStore& _word_store;
const uint32_t _arity;
public:
DocumentFeaturesStoreSaver(const DocumentFeaturesStore& store);
~DocumentFeaturesStoreSaver() override;
void save(BufferWriter& writer) const override;
};
}
```
|
Shoal Water is a 1940 novel by the English author Dornford Yates (Cecil William Mercer). It was first serialised in Blue Book between July and October 1940, as When The Devil Drives, with illustrations by Austin Briggs.
Plot
Jeremy Solon (narrator) falls in with Katherine Scrope and learns she has been blackmailed into doing duty as a carrier for jewel thieves. She is kidnapped, and Solon and his companions – now including Jonathan Mansel – set out to rescue her.
Background
The dust jacket of the first edition bears on the back the words "The making of this book enabled me to forget the gathering clouds: it is my great hope that the reading of it will enable others to forget the storm."
Critical reception
Mercer's biographer AJ Smithers, writing in 1982, noted that this novel and the preceding one, Gale Warning, are written to a pattern, though one that is cunningly woven. He considered both books to be swiftly moving, just plausible, and to still bear re-reading after all these years. The second half of the book bears considerable resemblance to A. E. W. Mason's 1935 novel They Wouldn't Be Chessmen.
References
Bibliography
1940 British novels
British thriller novels
Ward, Lock & Co. books
Novels by Dornford Yates
|
```javascript
define(["Tone/core/Tone", "Tone/core/Param", "Tone/core/Type"], function (Tone) {
"use strict";
/**
* @class A thin wrapper around the Native Web Audio GainNode.
* The GainNode is a basic building block of the Web Audio
* API and is useful for routing audio and adjusting gains.
* @extends {Tone}
* @param {Number=} gain The initial gain of the GainNode
* @param {Tone.Type=} units The units of the gain parameter.
*/
Tone.Gain = function(){
var options = this.optionsObject(arguments, ["gain", "units"], Tone.Gain.defaults);
/**
* The GainNode
* @type {GainNode}
* @private
*/
this.input = this.output = this._gainNode = this.context.createGain();
/**
* The gain parameter of the gain node.
* @type {AudioParam}
* @signal
*/
this.gain = new Tone.Param({
"param" : this._gainNode.gain,
"units" : options.units,
"value" : options.gain,
"convert" : options.convert
});
this._readOnly("gain");
};
Tone.extend(Tone.Gain);
/**
* The defaults
* @const
* @type {Object}
*/
Tone.Gain.defaults = {
"gain" : 1,
"convert" : true,
};
/**
* Clean up.
* @return {Tone.Gain} this
*/
Tone.Gain.prototype.dispose = function(){
Tone.Param.prototype.dispose.call(this);
this._gainNode.disconnect();
this._gainNode = null;
this._writable("gain");
this.gain.dispose();
this.gain = null;
};
return Tone.Gain;
});
```
|
Zombie Holocaust () is a 1980 Italian horror film directed by Marino Girolami. The film is about a team of scientists who follow a trail of corpses in New York to a remote Indonesian island where they meet a mad doctor (Donald O'Brien) who performs experiments on both the living and dead in his laboratory. The team face both zombies and cannibals in an attempt to stop the doctor. The film was re-edited and released theatrically in the United States in 1982 under the title Doctor Butcher M.D.
Plot
In New York City, a hospital worker is found to have been devouring bodies in the morgue. Morgue assistant and anthropology expert Lori discovers he was from the Maluku Islands where she grew up. Dr. Peter Chandler investigates, and he and Lori discover that similar corpse mutilations have occurred in other city hospitals, where immigrants from this region are working.
Peter leads an expedition to the islands to investigate, where he liaises with Doctor Obrero. Included are his assistant George, George's eager journalist girlfriend Susan, Lori, local boatsman Molotto assigned by Obrero, and three guides. The crew is hunted by cannibals and zombies, the latter created by the sinister Doctor Obrero, who is experimenting with corpses.
Lori is accepted as queen of the cannibals and sends them off against the mad scientist and his zombie army.
Cast
Ian McCulloch as Dr. Peter Chandler
Alexandra Delli Colli as Lori Ridgeway
Sherry Buchanan as Susan Kelly
Peter O'Neal as George Harper
Donald O'Brien as Dr. Obrero/Dr. Butcher (US version)
Dakar as Molotto
Walter Patriarca as Dr. Dreylock
Release
The film was released in Italy in 1980 and grossed a total of 300 million Italian lira. It was released in the United States in 1982 in a heavily edited form under the title Doctor Butcher M.D., which incorporated footage from an unreleased film shot by director Roy Frumkes. In addition to the title Zombie Holocaust, the film has since been released under various other English titles, including Island of the Last Zombies, Queen of the Cannibals and Zombie 3.
Home media
The film was first released on DVD on May 21, 2002 by Shriek Show and was available both separately and in a triple feature package. The Zombie Pack Vol. 2 contains Zombie Holocaust, Burial Ground: The Nights of Terror and Flesheater. Shriek Show released the film on Blu-ray for the first time in the U.S. on June 28, 2011, with 88 Films giving the film its UK Blu-ray debut in 2015.
In 2016, Severin Films issued a deluxe edition two-disc Blu-ray that included both Zombie Holocaust and Doctor Butcher M.D., as well as a multitude of bonus features. The first 5,000 copies of this edition also included a replica of the "barf bag" given out at some original screenings of Doctor Butcher M.D.
Reception
In The Zombie Movie Encyclopedia, academic Peter Dendle stated that "Some of the gore effects are quite good, but other than that the movie is a stock accumulation of familiar motifs." Bloody Disgusting rated it 5/5 stars and recommended it to fans of Italian gore films. Author Glenn Kay of Zombie Movies: The Ultimate Guide referred to it as "a bad movie; for Italian zombie gore fans only." Danny Shipka, author of Perverse Titillation: The Exploitation Cinema of Italy, Spain and France, 1960–1980, noted that Zombie Holocaust showed how quickly the zombie subgenre "degenerated into stupidity" and that the film "fuses the cannibal genre and the zombie film into an incoherent mess".
See also
List of zombie movies
Footnotes
References
External links
Zombie Holocaust at Variety Distribution
1980 films
1980 horror films
1980 multilingual films
1980s English-language films
1980s Italian-language films
1980s Italian films
Cannibal-boom films
English-language Italian films
Italian multilingual films
Italian splatter films
Italian zombie films
Films directed by Marino Girolami
Films set in Indonesia
Films set in New York City
Films scored by Nico Fidenco
|
Anikó Meksz (born 18 June 1965, in Szekszárd) is a former Hungarian handball goalkeeper who competed in the 1996 Summer Olympics and won the bronze medal with the Hungarian team.
Achievements
Club
With Dunaferr NK
Magyar Kupa:
Finalist: 1994
EHF Cup Winners' Cup:
Winner: 1995
International
Olympic Games:
Bronze Medalist: 1996
World Championship:
Silver Medalist: 1995
7th: 1993
9th: 1999
European Championship:
4th: 1994
10th: 1996
References
External links
1965 births
Living people
Sportspeople from Szekszárd
Hungarian female handball players
Olympic handball players for Hungary
Handball players at the 1996 Summer Olympics
Olympic bronze medalists for Hungary
Olympic medalists in handball
Medalists at the 1996 Summer Olympics
|
Steven Llewellyn Watkin (born 15 September 1964) is a former Welsh cricketer who played for Glamorgan County Cricket Club and the England cricket team. A reliable seam bowler who never suffered serious injury despite several lesser niggles, he played three Test matches in 1991 and 1993, and four One Day Internationals in 1993 and 1994. He was one of the Wisden Cricketers of the Year in 1994, the only one of that year's five who was not Australian.
Life and career
Watkin made his first-class debut against Worcestershire in 1986, taking the wickets of Graeme Hick and Phil Neale, and also played two Sunday League games, but had to wait until 1988 for a second chance. That year he established himself as an important member of the Glamorgan first team, taking 8 for 59 (which was to remain his career best) against Warwickshire, and claiming 46 first-class scalps in all that season. His best year in terms of wickets was 1989, when he captured 94, and in his career he took a total of 902 wickets.
He made his England Test debut unexpectedly in 1991, when Chris Lewis pulled out on the morning of the first test against the West Indies. Watkin's bowling was ideal for Headingley's notorious seamer friendly conditions. Watkin took five wickets, including those of Carl Hooper, Viv Richards and Gus Logie in a match-turning spell in the second innings, in England's ultimate victory in the match, which was their first home victory in a Test against the West Indies for 22 years. But Watkin fared less well two weeks later at Lord's, where his only significant contribution was to hang around for nearly an hour with the bat while Robin Smith played the best innings of his career at the other end.
Watkin had a good season in 1993, the year after which he was recognised as one of the Wisden Cricketers of the Year, taking more first-class wickets than any other bowler (92 at 22.80), as Glamorgan finished third in the County Championship. He returned to the Test team for the Sixth Test in 1993, when he took six wickets, including the first three of Australia's second innings, in England's only victory of the series. This was also a landmark victory for England as they had not won any of their previous 18 Tests against Australia. He was selected for the subsequent tour of the West Indies, but did not play in any of the Tests: he perhaps would have held his place for the First Test, but suffered back trouble which put him out of the side, Alan Igglesden playing in his place. He did play in four of the five ODIs on that tour, bowling particularly creditably in the 2nd in Kingston, Jamaica, with four wickets on his comeback after missing the 1st Test: but a loss of form in the later ODIs and a subsequent recurrence of his back problem cut his tour short, the only time injury got the better of him in his career. He was not considered for international selection again, although some considered him unlucky in this regard.
Watkin made an important contribution in 1997 when Glamorgan won their first County Championship for 28 years, taking 61 wickets at 22.83 and forming an effective combination with the county's overseas player, Waqar Younis.
In 1998, Watkin was given a benefit by Glamorgan, which raised £133,000. Normally a poor batsman, he managed to average a startling 35.66 that year, despite a top score of just 25, thanks to 13 not outs in his sixteen innings. By contrast, his career average was 10.83. In 2000, he scored 51 against Gloucestershire, the only half-century of his career.
After retirement in 2001, Watkin became Director of the Welsh Cricket Academy.
References
External links
1964 births
Living people
England One Day International cricketers
England Test cricketers
Glamorgan cricketers
Wisden Cricketers of the Year
Welsh cricketers
Wales National County cricketers
Marylebone Cricket Club cricketers
Welsh cricket coaches
Sportspeople from Maesteg
|
```html
<!DOCTYPE html>
<html lang="en-US">
<head>
<meta charset="utf-8" />
<title>Arrays: Task 3</title>
<link rel="stylesheet" href="../styles.css" />
<style>
* {
box-sizing: border-box;
}
p {
color: purple;
margin: 0.5em 0;
}
</style>
</head>
<body>
<section class="preview">
</section>
<textarea class="playable playable-js" style="height: 220px;">
let myArray = [ "Ryu", "Ken", "Chun-Li", "Cammy", "Guile", "Sakura", "Sagat", "Juri" ];
// Add your code here
// Don't edit the code below here!
section.innerHTML = ' ';
let para1 = document.createElement('p');
para1.textContent = myString;
section.appendChild(para1);
</textarea>
<div class="playable-buttons">
<input id="reset" type="button" value="Reset" />
</div>
</body>
<script class="editable"></script>
<script src="../playable.js"></script>
</html>
```
|
```c
/* iowin32.c -- IO base function header for compress/uncompress .zip
Version 1.1, February 14h, 2010
part of the MiniZip project - ( path_to_url )
Modifications for Zip64 support
For more info read MiniZip_info.txt
*/
#include <stdlib.h>
#include "zlib.h"
#include "ioapi.h"
#include "iowin32.h"
#ifndef INVALID_HANDLE_VALUE
#define INVALID_HANDLE_VALUE (0xFFFFFFFF)
#endif
#ifndef INVALID_SET_FILE_POINTER
#define INVALID_SET_FILE_POINTER ((DWORD)-1)
#endif
#ifdef _WIN32_WINNT
#undef _WIN32_WINNT
#define _WIN32_WINNT 0x601
#endif
#if !defined(IOWIN32_USING_WINRT_API)
#if defined(WINAPI_FAMILY) && (WINAPI_FAMILY == WINAPI_FAMILY_APP)
// Windows Store or Universal Windows Platform
#define IOWIN32_USING_WINRT_API 1
#endif
#endif
voidpf ZCALLBACK win32_open_file_func OF((voidpf opaque, const char* filename, int mode));
uLong ZCALLBACK win32_read_file_func OF((voidpf opaque, voidpf stream, void* buf, uLong size));
uLong ZCALLBACK win32_write_file_func OF((voidpf opaque, voidpf stream, const void* buf, uLong size));
ZPOS64_T ZCALLBACK win32_tell64_file_func OF((voidpf opaque, voidpf stream));
long ZCALLBACK win32_seek64_file_func OF((voidpf opaque, voidpf stream, ZPOS64_T offset, int origin));
int ZCALLBACK win32_close_file_func OF((voidpf opaque, voidpf stream));
int ZCALLBACK win32_error_file_func OF((voidpf opaque, voidpf stream));
typedef struct
{
HANDLE hf;
int error;
} WIN32FILE_IOWIN;
static void win32_translate_open_mode(int mode,
DWORD* lpdwDesiredAccess,
DWORD* lpdwCreationDisposition,
DWORD* lpdwShareMode,
DWORD* lpdwFlagsAndAttributes)
{
*lpdwDesiredAccess = *lpdwShareMode = *lpdwFlagsAndAttributes = *lpdwCreationDisposition = 0;
if ((mode & ZLIB_FILEFUNC_MODE_READWRITEFILTER)==ZLIB_FILEFUNC_MODE_READ)
{
*lpdwDesiredAccess = GENERIC_READ;
*lpdwCreationDisposition = OPEN_EXISTING;
*lpdwShareMode = FILE_SHARE_READ;
}
else if (mode & ZLIB_FILEFUNC_MODE_EXISTING)
{
*lpdwDesiredAccess = GENERIC_WRITE | GENERIC_READ;
*lpdwCreationDisposition = OPEN_EXISTING;
}
else if (mode & ZLIB_FILEFUNC_MODE_CREATE)
{
*lpdwDesiredAccess = GENERIC_WRITE | GENERIC_READ;
*lpdwCreationDisposition = CREATE_ALWAYS;
}
}
static voidpf win32_build_iowin(HANDLE hFile)
{
voidpf ret=NULL;
if ((hFile != NULL) && (hFile != INVALID_HANDLE_VALUE))
{
WIN32FILE_IOWIN w32fiow;
w32fiow.hf = hFile;
w32fiow.error = 0;
ret = malloc(sizeof(WIN32FILE_IOWIN));
if (ret==NULL)
CloseHandle(hFile);
else
*((WIN32FILE_IOWIN*)ret) = w32fiow;
}
return ret;
}
voidpf ZCALLBACK win32_open64_file_func (voidpf opaque,const void* filename,int mode)
{
const char* mode_fopen = NULL;
DWORD dwDesiredAccess,dwCreationDisposition,dwShareMode,dwFlagsAndAttributes ;
HANDLE hFile = NULL;
win32_translate_open_mode(mode,&dwDesiredAccess,&dwCreationDisposition,&dwShareMode,&dwFlagsAndAttributes);
#ifdef IOWIN32_USING_WINRT_API
#ifdef UNICODE
if ((filename!=NULL) && (dwDesiredAccess != 0))
hFile = CreateFile2((LPCTSTR)filename, dwDesiredAccess, dwShareMode, dwCreationDisposition, NULL);
#else
if ((filename!=NULL) && (dwDesiredAccess != 0))
{
WCHAR filenameW[FILENAME_MAX + 0x200 + 1];
MultiByteToWideChar(CP_ACP,0,(const char*)filename,-1,filenameW,FILENAME_MAX + 0x200);
hFile = CreateFile2(filenameW, dwDesiredAccess, dwShareMode, dwCreationDisposition, NULL);
}
#endif
#else
if ((filename!=NULL) && (dwDesiredAccess != 0))
hFile = CreateFile((LPCTSTR)filename, dwDesiredAccess, dwShareMode, NULL, dwCreationDisposition, dwFlagsAndAttributes, NULL);
#endif
return win32_build_iowin(hFile);
}
voidpf ZCALLBACK win32_open64_file_funcA (voidpf opaque,const void* filename,int mode)
{
const char* mode_fopen = NULL;
DWORD dwDesiredAccess,dwCreationDisposition,dwShareMode,dwFlagsAndAttributes ;
HANDLE hFile = NULL;
win32_translate_open_mode(mode,&dwDesiredAccess,&dwCreationDisposition,&dwShareMode,&dwFlagsAndAttributes);
#ifdef IOWIN32_USING_WINRT_API
if ((filename!=NULL) && (dwDesiredAccess != 0))
{
WCHAR filenameW[FILENAME_MAX + 0x200 + 1];
MultiByteToWideChar(CP_ACP,0,(const char*)filename,-1,filenameW,FILENAME_MAX + 0x200);
hFile = CreateFile2(filenameW, dwDesiredAccess, dwShareMode, dwCreationDisposition, NULL);
}
#else
if ((filename!=NULL) && (dwDesiredAccess != 0))
hFile = CreateFileA((LPCSTR)filename, dwDesiredAccess, dwShareMode, NULL, dwCreationDisposition, dwFlagsAndAttributes, NULL);
#endif
return win32_build_iowin(hFile);
}
voidpf ZCALLBACK win32_open64_file_funcW (voidpf opaque,const void* filename,int mode)
{
const char* mode_fopen = NULL;
DWORD dwDesiredAccess,dwCreationDisposition,dwShareMode,dwFlagsAndAttributes ;
HANDLE hFile = NULL;
win32_translate_open_mode(mode,&dwDesiredAccess,&dwCreationDisposition,&dwShareMode,&dwFlagsAndAttributes);
#ifdef IOWIN32_USING_WINRT_API
if ((filename!=NULL) && (dwDesiredAccess != 0))
hFile = CreateFile2((LPCWSTR)filename, dwDesiredAccess, dwShareMode, dwCreationDisposition,NULL);
#else
if ((filename!=NULL) && (dwDesiredAccess != 0))
hFile = CreateFileW((LPCWSTR)filename, dwDesiredAccess, dwShareMode, NULL, dwCreationDisposition, dwFlagsAndAttributes, NULL);
#endif
return win32_build_iowin(hFile);
}
voidpf ZCALLBACK win32_open_file_func (voidpf opaque,const char* filename,int mode)
{
const char* mode_fopen = NULL;
DWORD dwDesiredAccess,dwCreationDisposition,dwShareMode,dwFlagsAndAttributes ;
HANDLE hFile = NULL;
win32_translate_open_mode(mode,&dwDesiredAccess,&dwCreationDisposition,&dwShareMode,&dwFlagsAndAttributes);
#ifdef IOWIN32_USING_WINRT_API
#ifdef UNICODE
if ((filename!=NULL) && (dwDesiredAccess != 0))
hFile = CreateFile2((LPCTSTR)filename, dwDesiredAccess, dwShareMode, dwCreationDisposition, NULL);
#else
if ((filename!=NULL) && (dwDesiredAccess != 0))
{
WCHAR filenameW[FILENAME_MAX + 0x200 + 1];
MultiByteToWideChar(CP_ACP,0,(const char*)filename,-1,filenameW,FILENAME_MAX + 0x200);
hFile = CreateFile2(filenameW, dwDesiredAccess, dwShareMode, dwCreationDisposition, NULL);
}
#endif
#else
if ((filename!=NULL) && (dwDesiredAccess != 0))
hFile = CreateFile((LPCTSTR)filename, dwDesiredAccess, dwShareMode, NULL, dwCreationDisposition, dwFlagsAndAttributes, NULL);
#endif
return win32_build_iowin(hFile);
}
uLong ZCALLBACK win32_read_file_func (voidpf opaque, voidpf stream, void* buf,uLong size)
{
uLong ret=0;
HANDLE hFile = NULL;
if (stream!=NULL)
hFile = ((WIN32FILE_IOWIN*)stream) -> hf;
if (hFile != NULL)
{
if (!ReadFile(hFile, buf, size, &ret, NULL))
{
DWORD dwErr = GetLastError();
if (dwErr == ERROR_HANDLE_EOF)
dwErr = 0;
((WIN32FILE_IOWIN*)stream) -> error=(int)dwErr;
}
}
return ret;
}
uLong ZCALLBACK win32_write_file_func (voidpf opaque,voidpf stream,const void* buf,uLong size)
{
uLong ret=0;
HANDLE hFile = NULL;
if (stream!=NULL)
hFile = ((WIN32FILE_IOWIN*)stream) -> hf;
if (hFile != NULL)
{
if (!WriteFile(hFile, buf, size, &ret, NULL))
{
DWORD dwErr = GetLastError();
if (dwErr == ERROR_HANDLE_EOF)
dwErr = 0;
((WIN32FILE_IOWIN*)stream) -> error=(int)dwErr;
}
}
return ret;
}
static BOOL MySetFilePointerEx(HANDLE hFile, LARGE_INTEGER pos, LARGE_INTEGER *newPos, DWORD dwMoveMethod)
{
#ifdef IOWIN32_USING_WINRT_API
return SetFilePointerEx(hFile, pos, newPos, dwMoveMethod);
#else
LONG lHigh = pos.HighPart;
DWORD dwNewPos = SetFilePointer(hFile, pos.LowPart, &lHigh, dwMoveMethod);
BOOL fOk = TRUE;
if (dwNewPos == 0xFFFFFFFF)
if (GetLastError() != NO_ERROR)
fOk = FALSE;
if ((newPos != NULL) && (fOk))
{
newPos->LowPart = dwNewPos;
newPos->HighPart = lHigh;
}
return fOk;
#endif
}
long ZCALLBACK win32_tell_file_func (voidpf opaque,voidpf stream)
{
long ret=-1;
HANDLE hFile = NULL;
if (stream!=NULL)
hFile = ((WIN32FILE_IOWIN*)stream) -> hf;
if (hFile != NULL)
{
LARGE_INTEGER pos;
pos.QuadPart = 0;
if (!MySetFilePointerEx(hFile, pos, &pos, FILE_CURRENT))
{
DWORD dwErr = GetLastError();
((WIN32FILE_IOWIN*)stream) -> error=(int)dwErr;
ret = -1;
}
else
ret=(long)pos.LowPart;
}
return ret;
}
ZPOS64_T ZCALLBACK win32_tell64_file_func (voidpf opaque, voidpf stream)
{
ZPOS64_T ret= (ZPOS64_T)-1;
HANDLE hFile = NULL;
if (stream!=NULL)
hFile = ((WIN32FILE_IOWIN*)stream)->hf;
if (hFile)
{
LARGE_INTEGER pos;
pos.QuadPart = 0;
if (!MySetFilePointerEx(hFile, pos, &pos, FILE_CURRENT))
{
DWORD dwErr = GetLastError();
((WIN32FILE_IOWIN*)stream) -> error=(int)dwErr;
ret = (ZPOS64_T)-1;
}
else
ret=pos.QuadPart;
}
return ret;
}
long ZCALLBACK win32_seek_file_func (voidpf opaque,voidpf stream,uLong offset,int origin)
{
DWORD dwMoveMethod=0xFFFFFFFF;
HANDLE hFile = NULL;
long ret=-1;
if (stream!=NULL)
hFile = ((WIN32FILE_IOWIN*)stream) -> hf;
switch (origin)
{
case ZLIB_FILEFUNC_SEEK_CUR :
dwMoveMethod = FILE_CURRENT;
break;
case ZLIB_FILEFUNC_SEEK_END :
dwMoveMethod = FILE_END;
break;
case ZLIB_FILEFUNC_SEEK_SET :
dwMoveMethod = FILE_BEGIN;
break;
default: return -1;
}
if (hFile != NULL)
{
LARGE_INTEGER pos;
pos.QuadPart = offset;
if (!MySetFilePointerEx(hFile, pos, NULL, dwMoveMethod))
{
DWORD dwErr = GetLastError();
((WIN32FILE_IOWIN*)stream) -> error=(int)dwErr;
ret = -1;
}
else
ret=0;
}
return ret;
}
long ZCALLBACK win32_seek64_file_func (voidpf opaque, voidpf stream,ZPOS64_T offset,int origin)
{
DWORD dwMoveMethod=0xFFFFFFFF;
HANDLE hFile = NULL;
long ret=-1;
if (stream!=NULL)
hFile = ((WIN32FILE_IOWIN*)stream)->hf;
switch (origin)
{
case ZLIB_FILEFUNC_SEEK_CUR :
dwMoveMethod = FILE_CURRENT;
break;
case ZLIB_FILEFUNC_SEEK_END :
dwMoveMethod = FILE_END;
break;
case ZLIB_FILEFUNC_SEEK_SET :
dwMoveMethod = FILE_BEGIN;
break;
default: return -1;
}
if (hFile)
{
LARGE_INTEGER pos;
pos.QuadPart = offset;
if (!MySetFilePointerEx(hFile, pos, NULL, dwMoveMethod))
{
DWORD dwErr = GetLastError();
((WIN32FILE_IOWIN*)stream) -> error=(int)dwErr;
ret = -1;
}
else
ret=0;
}
return ret;
}
int ZCALLBACK win32_close_file_func (voidpf opaque, voidpf stream)
{
int ret=-1;
if (stream!=NULL)
{
HANDLE hFile;
hFile = ((WIN32FILE_IOWIN*)stream) -> hf;
if (hFile != NULL)
{
CloseHandle(hFile);
ret=0;
}
free(stream);
}
return ret;
}
int ZCALLBACK win32_error_file_func (voidpf opaque,voidpf stream)
{
int ret=-1;
if (stream!=NULL)
{
ret = ((WIN32FILE_IOWIN*)stream) -> error;
}
return ret;
}
void fill_win32_filefunc (zlib_filefunc_def* pzlib_filefunc_def)
{
pzlib_filefunc_def->zopen_file = win32_open_file_func;
pzlib_filefunc_def->zread_file = win32_read_file_func;
pzlib_filefunc_def->zwrite_file = win32_write_file_func;
pzlib_filefunc_def->ztell_file = win32_tell_file_func;
pzlib_filefunc_def->zseek_file = win32_seek_file_func;
pzlib_filefunc_def->zclose_file = win32_close_file_func;
pzlib_filefunc_def->zerror_file = win32_error_file_func;
pzlib_filefunc_def->opaque = NULL;
}
void fill_win32_filefunc64(zlib_filefunc64_def* pzlib_filefunc_def)
{
pzlib_filefunc_def->zopen64_file = win32_open64_file_func;
pzlib_filefunc_def->zread_file = win32_read_file_func;
pzlib_filefunc_def->zwrite_file = win32_write_file_func;
pzlib_filefunc_def->ztell64_file = win32_tell64_file_func;
pzlib_filefunc_def->zseek64_file = win32_seek64_file_func;
pzlib_filefunc_def->zclose_file = win32_close_file_func;
pzlib_filefunc_def->zerror_file = win32_error_file_func;
pzlib_filefunc_def->opaque = NULL;
}
void fill_win32_filefunc64A(zlib_filefunc64_def* pzlib_filefunc_def)
{
pzlib_filefunc_def->zopen64_file = win32_open64_file_funcA;
pzlib_filefunc_def->zread_file = win32_read_file_func;
pzlib_filefunc_def->zwrite_file = win32_write_file_func;
pzlib_filefunc_def->ztell64_file = win32_tell64_file_func;
pzlib_filefunc_def->zseek64_file = win32_seek64_file_func;
pzlib_filefunc_def->zclose_file = win32_close_file_func;
pzlib_filefunc_def->zerror_file = win32_error_file_func;
pzlib_filefunc_def->opaque = NULL;
}
void fill_win32_filefunc64W(zlib_filefunc64_def* pzlib_filefunc_def)
{
pzlib_filefunc_def->zopen64_file = win32_open64_file_funcW;
pzlib_filefunc_def->zread_file = win32_read_file_func;
pzlib_filefunc_def->zwrite_file = win32_write_file_func;
pzlib_filefunc_def->ztell64_file = win32_tell64_file_func;
pzlib_filefunc_def->zseek64_file = win32_seek64_file_func;
pzlib_filefunc_def->zclose_file = win32_close_file_func;
pzlib_filefunc_def->zerror_file = win32_error_file_func;
pzlib_filefunc_def->opaque = NULL;
}
```
|
```c
/* Test file for mpfr_factorial.
Contributed by the AriC and Caramba projects, INRIA.
This file is part of the GNU MPFR Library.
The GNU MPFR Library is free software; you can redistribute it and/or modify
option) any later version.
The GNU MPFR 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 Lesser General Public
along with the GNU MPFR Library; see the file COPYING.LESSER. If not, see
path_to_url or write to the Free Software Foundation, Inc.,
51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. */
#include <stdio.h>
#include <stdlib.h>
#include "mpfr-test.h"
#define TEST_FUNCTION mpfr_fac_ui
static void
special (void)
{
mpfr_t x, y;
int inex;
mpfr_init (x);
mpfr_init (y);
mpfr_set_prec (x, 21);
mpfr_set_prec (y, 21);
mpfr_fac_ui (x, 119, MPFR_RNDZ);
mpfr_set_str_binary (y, "0.101111101110100110110E654");
if (mpfr_cmp (x, y))
{
printf ("Error in mpfr_fac_ui (119)\n");
exit (1);
}
mpfr_set_prec (y, 206);
inex = mpfr_fac_ui (y, 767, MPFR_RNDN);
mpfr_set_prec (x, 206);
mpfr_set_str_binary (x, "0.your_sha256_hashyour_sha256_hashyour_sha256_hash101001111E6250");
if (mpfr_cmp (x, y))
{
printf ("Error in mpfr_fac_ui (767)\n");
exit (1);
}
if (inex <= 0)
{
printf ("Wrong flag for mpfr_fac_ui (767)\n");
exit (1);
}
mpfr_set_prec (y, 202);
mpfr_fac_ui (y, 69, MPFR_RNDU);
mpfr_clear (x);
mpfr_clear (y);
}
static void
test_int (void)
{
unsigned long n0 = 1, n1 = 80, n;
mpz_t f;
mpfr_t x, y;
mpfr_prec_t prec_f, p;
int r;
int inex1, inex2;
mpz_init (f);
mpfr_init (x);
mpfr_init (y);
mpz_fac_ui (f, n0 - 1);
for (n = n0; n <= n1; n++)
{
mpz_mul_ui (f, f, n); /* f = n! */
prec_f = mpz_sizeinbase (f, 2) - mpz_scan1 (f, 0);
for (p = MPFR_PREC_MIN; p <= prec_f; p++)
{
mpfr_set_prec (x, p);
mpfr_set_prec (y, p);
for (r = 0; r < MPFR_RND_MAX; r++)
{
inex1 = mpfr_fac_ui (x, n, (mpfr_rnd_t) r);
inex2 = mpfr_set_z (y, f, (mpfr_rnd_t) r);
if (mpfr_cmp (x, y))
{
printf ("Error for n=%lu prec=%lu rnd=%s\n",
n, (unsigned long) p, mpfr_print_rnd_mode ((mpfr_rnd_t) r));
exit (1);
}
if ((inex1 < 0 && inex2 >= 0) || (inex1 == 0 && inex2 != 0)
|| (inex1 > 0 && inex2 <= 0))
{
printf ("Wrong inexact flag for n=%lu prec=%lu rnd=%s\n",
n, (unsigned long) p, mpfr_print_rnd_mode ((mpfr_rnd_t) r));
exit (1);
}
}
}
}
mpz_clear (f);
mpfr_clear (x);
mpfr_clear (y);
}
static void
overflowed_fac0 (void)
{
mpfr_t x, y;
int inex, rnd, err = 0;
mpfr_exp_t old_emax;
old_emax = mpfr_get_emax ();
mpfr_init2 (x, 8);
mpfr_init2 (y, 8);
mpfr_set_ui (y, 1, MPFR_RNDN);
mpfr_nextbelow (y);
set_emax (0); /* 1 is not representable. */
RND_LOOP (rnd)
{
mpfr_clear_flags ();
inex = mpfr_fac_ui (x, 0, (mpfr_rnd_t) rnd);
if (! mpfr_overflow_p ())
{
printf ("Error in overflowed_fac0 (rnd = %s):\n"
" The overflow flag is not set.\n",
mpfr_print_rnd_mode ((mpfr_rnd_t) rnd));
err = 1;
}
if (rnd == MPFR_RNDZ || rnd == MPFR_RNDD)
{
if (inex >= 0)
{
printf ("Error in overflowed_fac0 (rnd = %s):\n"
" The inexact value must be negative.\n",
mpfr_print_rnd_mode ((mpfr_rnd_t) rnd));
err = 1;
}
if (! mpfr_equal_p (x, y))
{
printf ("Error in overflowed_fac0 (rnd = %s):\n"
" Got ", mpfr_print_rnd_mode ((mpfr_rnd_t) rnd));
mpfr_print_binary (x);
printf (" instead of 0.11111111E0.\n");
err = 1;
}
}
else
{
if (inex <= 0)
{
printf ("Error in overflowed_fac0 (rnd = %s):\n"
" The inexact value must be positive.\n",
mpfr_print_rnd_mode ((mpfr_rnd_t) rnd));
err = 1;
}
if (! (mpfr_inf_p (x) && MPFR_SIGN (x) > 0))
{
printf ("Error in overflowed_fac0 (rnd = %s):\n"
" Got ", mpfr_print_rnd_mode ((mpfr_rnd_t) rnd));
mpfr_print_binary (x);
printf (" instead of +Inf.\n");
err = 1;
}
}
}
set_emax (old_emax);
if (err)
exit (1);
mpfr_clear (x);
mpfr_clear (y);
}
int
main (int argc, char *argv[])
{
unsigned int prec, err, yprec, n, k, zeros;
int rnd;
mpfr_t x, y, z, t;
int inexact;
tests_start_mpfr ();
special ();
test_int ();
mpfr_init (x);
mpfr_init (y);
mpfr_init (z);
mpfr_init (t);
mpfr_fac_ui (y, 0, MPFR_RNDN);
if (mpfr_cmp_ui (y, 1))
{
printf ("mpfr_fac_ui(0) does not give 1\n");
exit (1);
}
for (prec = 2; prec <= 100; prec++)
{
mpfr_set_prec (x, prec);
mpfr_set_prec (z, prec);
mpfr_set_prec (t, prec);
yprec = prec + 10;
mpfr_set_prec (y, yprec);
for (n = 0; n < 50; n++)
for (rnd = 0; rnd < MPFR_RND_MAX; rnd++)
{
inexact = mpfr_fac_ui (y, n, (mpfr_rnd_t) rnd);
err = (rnd == MPFR_RNDN) ? yprec + 1 : yprec;
if (mpfr_can_round (y, err, (mpfr_rnd_t) rnd, (mpfr_rnd_t) rnd, prec))
{
mpfr_set (t, y, (mpfr_rnd_t) rnd);
inexact = mpfr_fac_ui (z, n, (mpfr_rnd_t) rnd);
/* fact(n) ends with floor(n/2)+floor(n/4)+... zeros */
for (k=n/2, zeros=0; k; k >>= 1)
zeros += k;
if (MPFR_EXP(y) <= (mpfr_exp_t) (prec + zeros))
/* result should be exact */
{
if (inexact)
{
printf ("Wrong inexact flag: expected exact\n");
exit (1);
}
}
else /* result is inexact */
{
if (!inexact)
{
printf ("Wrong inexact flag: expected inexact\n");
printf ("n=%u prec=%u\n", n, prec);
mpfr_print_binary(z); puts ("");
exit (1);
}
}
if (mpfr_cmp (t, z))
{
printf ("results differ for x=");
mpfr_out_str (stdout, 2, prec, x, MPFR_RNDN);
printf (" prec=%u rnd_mode=%s\n", prec,
mpfr_print_rnd_mode ((mpfr_rnd_t) rnd));
printf (" got ");
mpfr_out_str (stdout, 2, prec, z, MPFR_RNDN);
puts ("");
printf (" expected ");
mpfr_out_str (stdout, 2, prec, t, MPFR_RNDN);
puts ("");
printf (" approximation was ");
mpfr_print_binary (y);
puts ("");
exit (1);
}
}
}
}
mpfr_clear (x);
mpfr_clear (y);
mpfr_clear (z);
mpfr_clear (t);
overflowed_fac0 ();
tests_end_mpfr ();
return 0;
}
```
|
The was held on 22 January 1995 in Kannai Hall, Yokohama, Kanagawa, Japan.
Awards
Best Film: Tokarefu
Best Film Score: Shigeru Umebayashi – Tokarefu, Ghost Pub
Best Actor: Eiji Okuda – Like a Rolling Stone
Best Actress: Saki Takaoka – Crest of Betrayal
Best Supporting Actor: Kōichi Satō – Tokarefu
Best Supporting Actress: Shigeru Muroi – Ghost Pub
Best Director: Junji Sakamoto – Tokarefu
Best New Director: Takeshi Watanabe – Kyōjū Luger P08
Best Screenplay: Yōzō Tanaka – Ghost Pub, Natsu no Niwa: The Friends
Best Cinematography: Norimichi Kasamatsu – Yoru ga Mata Kuru, Angel Guts: Red Lightning, Angel Dust
Best New Talent:
Shunsuke Matsuoka – 800 Two Lap Runners
Hinako Saeki – It's a Summer Vacation Everyday
Yui Natsukawa – Yoru ga Mata Kuru
Special Prize: Azuma Morisaki – For his work.
Best 10
Tokarefu
Ghost Pub
Crest of Betrayal
800 Two Lap Runners
Like a Rolling Stone
119
Nūdo no Yoru
Natsu no Niwa: The Friends
A Dedicated Life
Yoru Ga Mata Kuru
runner-up. Kyōjū Luger P08
References
Yokohama Film Festival
1995 film festivals
1995 in Japanese cinema
Yoko
January 1995 events in Asia
|
```c++
// (See accompanying file LICENSE.md or copy at path_to_url
#ifndef BOOST_HANA_TEST_LAWS_GROUP_HPP
#define BOOST_HANA_TEST_LAWS_GROUP_HPP
#include <boost/hana/assert.hpp>
#include <boost/hana/bool.hpp>
#include <boost/hana/concept/comparable.hpp>
#include <boost/hana/core/when.hpp>
#include <boost/hana/concept/group.hpp>
#include <boost/hana/lazy.hpp>
#include <laws/base.hpp>
namespace boost { namespace hana { namespace test {
template <typename G, typename = when<true>>
struct TestGroup : TestGroup<G, laws> {
using TestGroup<G, laws>::TestGroup;
};
template <typename G>
struct TestGroup<G, laws> {
template <typename Xs>
TestGroup(Xs xs) {
hana::for_each(xs, [](auto x) {
static_assert(Group<decltype(x)>{}, "");
});
foreach2(xs, [](auto x, auto y) {
// left inverse
BOOST_HANA_CHECK(hana::equal(
hana::plus(x, hana::negate(x)),
zero<G>()
));
// right inverse
BOOST_HANA_CHECK(hana::equal(
hana::plus(hana::negate(x), x),
zero<G>()
));
// default definition of minus
BOOST_HANA_CHECK(hana::equal(
hana::minus(x, y),
hana::plus(x, hana::negate(y))
));
BOOST_HANA_CHECK(hana::equal(
hana::minus(y, x),
hana::plus(y, hana::negate(x))
));
// default definition of negate
BOOST_HANA_CHECK(hana::equal(
hana::negate(hana::negate(x)),
x
));
});
}
};
template <typename C>
struct TestGroup<C, when<Constant<C>::value>>
: TestGroup<C, laws>
{
template <typename Xs>
TestGroup(Xs xs) : TestGroup<C, laws>{xs} {
foreach2(xs, [](auto x, auto y) {
BOOST_HANA_CHECK(hana::equal(
hana::negate(hana::value(x)),
hana::value(hana::negate(x))
));
BOOST_HANA_CHECK(hana::equal(
hana::minus(hana::value(x), hana::value(y)),
hana::value(hana::minus(x, y))
));
});
}
};
}}} // end namespace boost::hana::test
#endif // !BOOST_HANA_TEST_LAWS_GROUP_HPP
```
|
José Andrés Rafael Zaldívar Larraín, (born March 18, 1936) popularly known as El Chico Zaldívar ("Short Zaldívar"), is a prominent Chilean Christian Democrat politician. Andrés Zaldívar is of Basque descent.
Early years
Zaldívar was born in Santiago, Chile. He attended primary and secondary school at the Instituto Alonso de Ercilla de Santiago, a member of the Congregación de los Hermanos Maristas. In 1959 Zaldívar graduated from the Universidad de Chile, having written the thesis Rental Laws, Commentaries and Jurisprudence.<ref>Ley de Arrendamientos: Comentarios y Jurisprudencia,</ref>
In 1952 Zaldívar began his political career by joining the Conservative Party. while attending university, he participated in the International Congress of Students in Chicago in 1956 representing Chile, as the Secretary of the Union of Federated Universities of Chile. In 1957 he joined the Christian Democrat Party, and served as Juvenile President for Santiago's Third District.
Zaldívar practiced law in the Municipality of Colina from 1959 to 1962, then became magistrate of the local police of La Cisterna.
Political career
In the government of Eduardo Frei, Zaldívar served as Undersecretary of Finance from 1964 to 1967. He became Minister of Finance in 1968 and Minister of both Finance and Economy, in 1970. From 1968 to 1970, Zaldívar served as governor of the Inter-American Development Bank and was representative to the Interamerican Committee of the Alliance for Progress in Washington from 1968 to 1969 and representative to the Economic and Social Committee in Caracas in 1970.
During the years of the Popular Unity coalition, Zaldívar served many different posts within the party: from 1970 to 1973 he was a national counselor of the Christian Democrats, in 1972 he became a member of the Political Committee, and from 1976 to 1982 he was the president of the Christian Democrats. As such, he became one of the main leaders of the opposition to the Pinochet military regime at that time.
Military regime
In 1973, Zaldívar for the first time became a member of the National Congress of Chile, upon election to the Senate of Chile for the Second Provincial District of Atacama and Coquimbo, joining the Economic Committee of Congress. However, after the Chilean coup of 1973, Congress was dissolved on September 21 and Zaldívar went into exile with his family in Spain. Returning to Chile the following year, Zaldívar became president of the Christian Democrat Party, from 1975 to 1982.
In exile, Zaldívar was made President of the International Christian Democrats, an international organization of political parties, from 1981 to 1986, when he became a member of its advisory council. In 1981, furthermore, Zaldívar was a founding member of Center for Research for Ibero-America and Spain (CIPIE) in Spain, holding the position of president. In 1988, he joined the successful "No" campaign for the national plebiscite of that year. Also in 1988, Zaldívar again became the president of his party for another two years.
Administrations of the Concertación
In 1989, Zaldívar was elected Senator for the VII District of West Santiago, in one of the most hard-fought elections in history. Zaldívar received 31.27% of the vote while his partner on the list, future president Ricardo Lagos, received 30.62%. Due to Chile's binomial voting system (where parties or coalitions of parties select lists of one or more candidates, and the top candidate from each of the top two lists is elected when the top list gets less than twice the second-place list) and since no concessions could get double the votes of the Democracy and Progress, Andrés Zaldívar and the Independent Democrat Union's Jaime Guzmán, who only received 17.91% of the vote were elected.
At this time, Zaldívar joined the Senate Public Works Committee and presided over the Finance Committee. In December of the same year, he was re-elected Senator with 27.77% of the vote. His partner on the list, Camilo Escalona, received 15.98% principally due to the migration of votes from the left to the candidate of the Communist Party of Chile, Gladys Marín Millie, who received 15.69% of the vote. This allowed Zaldívar to be elected together with the conservative Jovino Novoa, with 20.56% of the vote.
During the second period since the rise of democracy, Zaldívar participated in the Constitution, Legislation, Justice, and Regulation Committees and presided over the Interior Administration Committee. In March 1998, Zaldívar was elected President of the Senate, a post that he held until August 15, 2004.
In 1999, Zaldívar was a candidate for President of Chile, representing the Christian Democrat Party for the primary election of the Chilean presidential election of that year. Meanwhile, the coalition PPD/PS (Party for Democracy and Socialist Party of Chile) elected Ricardo Lagos as its primary candidate. In that year, the Coalition of Parties for Democracy (the Concertación) held a primary to decide between the two. Lagos won the vote, with 71.3% of the vote to Zaldívar's 28.7%.
In 2005, Zaldívar ran for the third consecutive time for the Senate seat of West Santiago at the Chilean parliamentary election of December 11, facing the Deputy Guido Girardi (PPD) (his coalition partner on the list), the Senator Jovino Novoa (UDI), and the businessman Roberto Fantuzzi (Independent); the latter two members of the Alliance for Chile coalition. Despite a strong campaign, Zaldívar did not retain his seat in the senate, although he exceeded the top candidate of his opponents' list, since the Democratic Coalition's votes did not double that of the Alliance for Chile, fellow Democratic Coalition member Guido Girardi was elected and Alliance for Chile member, the founder and president of Independent Democrat Union, Jovino Novoa was reelected.
However, in later days, Zaldívar became a leader and chief strategist of Michelle Bachelet's presidential campaign. After the victory of the socialist candidate Bachelet, Zaldívar was appointed as her Minister of the Interior.
On 21 March 2017 he succeeded Ricardo Lagos Weber as President of the Senate.
Trivia
Zaldívar's nickname, "Chico" alias "Shorty", comes from his extremely short height.
In the Chilean telenovela Hippie'', set in the early 1970s, Zaldívar had a small cameo as himself since at that time he was a member of the Congress. He was shown being interviewed by a group of college students outside of the National Congress in Santiago.
Notes and references
Official website of Andrés Zaldívar
Government Biography
1936 births
Living people
Members of the Senate of Chile
Chilean Ministers of the Interior
Chilean Ministers of Economy
Chilean Ministers of Finance
Chilean democracy activists
Chilean people of Basque descent
Politicians from Santiago
Christian Democratic Party (Chile) politicians
Presidents of the Senate of Chile
Candidates for President of Chile
Zaldivar
|
The Halifax Resolves was a name later given to the resolution adopted by the North Carolina Provincial Congress on April 12, 1776. The adoption of the resolution was the first official action in the American Colonies calling for independence from Great Britain during the American Revolution. The Halifax Resolves helped pave the way for the presentation to Congress of the United States Declaration of Independence less than three months later.
Background
The creation and ratification of the resolves was the result of a strong movement in the colonies advocating separation from Great Britain. These separatists, or "American Whigs" (later, "Patriots"), sought to mobilize public support for a much discussed and all encompassing declaration of independence. The primary impediment to an outright declaration of independence from Great Britain was that none of the delegates to the Second Continental Congress were authorized by their home governments to take any action that would lead to such a declaration. Advocates of independence therefore sought to revise the instructions to each congressional delegation and remove any restrictions regarding a declaration of independence.
History
The resolution of April 12, 1776, became known as the Halifax Resolves because the Fourth Provincial Congress of North Carolina adopted them while meeting in the town of Halifax, North Carolina. The 83 delegates present unanimously adopted the resolves, which encouraged delegates to the Continental Congress from all the colonies to finally push for independence. The adoption of the Halifax Resolves was the first official action in the colonies calling for independence from Great Britain.
Drive to independence
The Halifax Resolves only empowered North Carolina's three delegates to the Second Continental Congress (Joseph Hewes, William Hooper, and John Penn) to join with those from other colonies to declare independence from Great Britain's rule.
With the passage of the resolves, North Carolina became the first colony to explicitly permit their delegates to vote in favor of independence. The Halifax Resolves, however, stopped short of instructing North Carolina's delegates to introduce a resolution of independence to Congress, a step which was taken by Virginia in June with the adoption of the Lee Resolution The Second Continental Congress issued the United States Declaration of Independence the following month, in July.
Legacy
Every year, on April 12, the Halifax Historic District, a historic site operated by the North Carolina Department of Cultural Resources, celebrates Halifax Day. Interpreters in period costumes provide guided tours of historic buildings, demonstrate historic crafts and teach about colonial activities. Occasionally, reenactors portray revolutionary-era soldiers and demonstrate the use of historic weapons during the Halifax Day events.
References
External links
Historic Halifax
Journal of the Provincial Congress at Halifax
1776 in the United States
Documents of the American Revolution
Halifax County, North Carolina
North Carolina in the American Revolution
United States documents
|
Rudolf Bergander (22 May 1909, Meißen — 10 April 1970, Dresden) was a German painter and principal of the Dresden Academy of Fine Arts from 1952 to 1958 and 1964–65. He was a member of the Association of Revolutionary Visual Artists.
Life
Bergander trained as a porcelain painter, graduating in 1923, and worked in the Meissen state porcelain manufactury. From 1928 to 1932 he studied at the Dresden Academy of Fine Arts with Richard Müller and Otto Dix. In 1928 he joined the KPD, and in 1929 became a member of the Association of Revolutionary Visual Artists. From 1933 to 1940 he lived as a freelance artist in Meissen. In 1940 he joined the Nazi Party. By 1945, he was a cartographer in the Wehrmacht.
After the war, in 1946 Bergander joined the Socialist Unity Party of Germany. In 1947 he became a member of the Dresden artist group "Das Ufer" ("The Shore"). He freelanced until he became a lecturer on painting at the Academy of Fine Arts DDR in 1949. In 1951 he was appointed a professor. In the same year he undertook a study trip to Bulgaria. From 1955 to 1956 he toured and studied in Italy. In 1956 he was awarded the National Prize of the German Democratic Republic for his realistic oeuvre. In 1957 he had a visiting exhibition at the German Academy of Arts in Berlin.
From 1952 to 1958 and 1964 to 1965, he was rector of the Dresden Academy of Fine Arts. Since 1961 he was a member and Permanent Secretary of Fine Arts of the German Academy of Arts. In 1962 he was awarded the Patriotic Order of Merit for outstanding achievements in the cultural field, receiving Bronze then Silver in 1969. In 1964 he was awarded the Banner of Labor.
Bergander is buried in the Heide cemetery in Dresden.
Further reading
Waltraut Schumann (ed.): Rudolf Bergander. Handzeichnungen. Aquarelle. Druckgrafik. Akademie der Künste der Deutschen Demokratischen Republik, Berlin 1978.
Artur Dänhardt: Rudolf Bergander. Maler und Werk.. Verlag der Kunst, Dresden 1978.
McCloskey, Barbara (2009). "Dialectic at a Standstill: East German Socialist Realism in the Stalin Era." Art of Two Germanys: Cold War Cultures. Ed. Stephanie Baron & Sabine Eckmann. Abrams.
See also
List of German painters
References
External links
Entry in the Union List of Artist Names
1909 births
1970 deaths
Socialist Unity Party of Germany members
East German artists
20th-century German painters
20th-century German male artists
German male painters
Social realist artists
|
Pekka Hjelt (born 22 September 1949) is a Finnish wrestler. He competed in the men's Greco-Roman 62 kg at the 1976 Summer Olympics.
References
1949 births
Living people
Finnish male sport wrestlers
Olympic wrestlers for Finland
Wrestlers at the 1976 Summer Olympics
Sportspeople from Helsinki
|
```javascript
export * from './Article';
export * from './LoadingArticle';
export * from './PodcastArticle';
```
|
Crimea in the five years after the Russian Revolution had a large number of governments culminating in being a stronghold of anti-Communist forces and the place on Russian soil where they made their last stand.
Following the Russian Revolution of 1917, the military and political situation in Crimea was chaotic like that in much of Russia. During the ensuing Russian Civil War, Crimea changed hands numerous times and was for a time a stronghold of the anti-Bolshevik White Army. It was in Crimea that the White Russians led by General Wrangel made their last stand against Nestor Makhno and the Red Army in 1920. When resistance was crushed, many of the anti-Bolshevik fighters and civilians escaped by ship to Istanbul.
Approximately 50,000 White prisoners of war and civilians were summarily executed by shooting or hanging after the defeat of General Wrangel at the end of 1920. This is considered one of the largest massacres in the Civil War.
Between 56,000 and 150,000 of the Whites were murdered as part of the Red Terror, organized by Béla Kun.
Crimea changed hands several times over the course of the conflict and several political entities were set up on the peninsula. These included:
References
|
Edward Cawston (16 January 1911 – 5 September 1998) was an English cricketer. A right-handed batsman and right-arm medium-fast bowler, he played first-class cricket for Sussex County Cricket Club and Cambridge University between 1928 and 1933 and also represented the Egypt national cricket team in 1936.
Personal life
Born in Wantage in 1911, Cawston was educated at Lancing College and Cambridge University. After his cricket career, he became headmaster of Orwell Park School. He died in Maidstone in 1998.
Cricket career
Cawston made his first-class debut for Sussex in a County Championship match against Derbyshire in the 1928 English cricket season whilst he was still at school. He played three more County Championship matches over the next two seasons before playing first-class matches for Sussex against Cambridge University in 1930 and 1931, his last two matches for Sussex.
In the 1932 season, his first first-class match for Cambridge University was, perhaps ironically, against Sussex. He played six more first-class matches for the university that season, gaining his blue when he played against Oxford University at Lord's in July. He played twelve first-class matches for the university the following season, including a match against the West Indies, but didn't gain another blue.
His first-class career ended that season with a match for the university against HDG Leveson-Gower's XI, but he continued to play cricket at lower levels. In April 1934 he went on a tour of Egypt with HM Martineau's XI, scoring a century in the first innings of the second match before becoming one of six victims for Eric Cole.
In 1936 he played twice for Egypt against Martineau's team, taking 6/67 in the second innings of the second match. He began playing Minor counties cricket for Berkshire in 1937 and played for them until 1946. He played for the Marylebone Cricket Club (MCC) against Ireland in Dublin in July 1938 and for the RAF against Nottinghamshire in August 1940. He switched counties in 1947, moving to Suffolk, where he finished out his career in 1950.
Statistics
In his 25 first-class matches Cawston scored 668 runs at an average of 16.70 and took 39 wickets at an average of 33.46. His top score of 93 and his best innings bowling performance of 7/53 were both made in the same match – for Cambridge University against HDG Leveson-Gower's XI in 1932.
References
External links
1911 births
1998 deaths
People educated at Lancing College
Alumni of Pembroke College, Cambridge
People from Wantage
Egyptian cricketers
English cricketers
Sussex cricketers
Cambridge University cricketers
Berkshire cricketers
Suffolk cricketers
|
Albert Hobart Nelson (March 12, 1812 – June 27, 1858) was an American jurist and politician who served as chief justice of the Suffolk County Superior Court from 1855 to 1858.
Early life
Nelson was born on March 12, 1812, in Milford or Carlisle, Massachusetts. His parents were Dr. John Nelson, a physician, and Lucinda (Parkhurst) Nelson. He attended the Concord Academy and graduated from Harvard College in 1832. After a year of teaching in Maryland, Nelson returned to Cambridge, Massachusetts to attended Harvard Law School. After graduating, he studied in the office of John Keyes in Concord, Massachusetts. After he passed the bar in 1836, Nelson joined Keyes as a partner. After a year, Keyes dissolved the firm and Nelson began a solo practice.
Politics
Nelson first became involved in politics in Concord, which was home to a number of Whig politicians, including Samuel and Ebenezer R. Hoar. Nelson wrote and delivered speeches for William Henry Harrison during the 1840 United States presidential election and served on Concord's school committee. In September 1840 he married Elizabeth Phinney, sister of Mary Phinney von Olnhausen. In 1842, Nelson moved to Woburn, Massachusetts and opened an office in Boston.
Nelson was district attorney of Northern District (which consisted of Essex and Middlesex Counties) from 1845 to 1848, a member of the Massachusetts Senate from 1848 to 1849, and a member of the Massachusetts Governor's Council in 1855. Following the collapse of the Whig Party, Nelson joined the Know Nothings.
In 1855, Nelson was appointed chief justice Suffolk County Superior Court by Governor Henry Gardner in 1855. In 1858, Nelson suffered a stroke which resulted in paralysis and metal impairment that necessitated his commitment to an insane asylum. He died on June 27, 1858, at the McLean Asylum in Somerville, Massachusetts.
References
1812 births
1858 deaths
District attorneys in Essex County, Massachusetts
District attorneys in Middlesex County, Massachusetts
Harvard College alumni
Harvard Law School alumni
Massachusetts Know Nothings
Massachusetts state senators
Massachusetts Superior Court justices
Massachusetts Whigs
Members of the Massachusetts Governor's Council
McLean Hospital patients
People from Concord, Massachusetts
People from Woburn, Massachusetts
|
```lua
--
require "lv_kit"
local scrW, scrH= System:screenSize()
pageView = PagerView{
PageCount = 3,
Pages = {
Init = function(page, pos)
page.button = Button()
end,
Layout = function(page, pos)
page.button:title(""..pos)
page.button:frame(0, 0, scrW, 200)
page.button:backgroundColor(0x777777);
page.button:callback( function()
print("",pos,"");
pageView:currentPage(pos+1);
print(pageView:currentPage() );
end)
end
},
Callback = {
Scrolling = function( pageIndex, percent , offset )
print("Scrolling", pageIndex, percent, offset)
end,
ScrollEnd = function( pageIndex )
print("ScrollEnd", pageIndex )
end
}
};
pageView:frame(0, 0, scrW, scrH-64 )
indicator = PagerIndicator();
indicator:pageColor(0xff00FF);
pageView:indicator( indicator );
indicator:frame(0,10,scrW,100);
pageView:autoScroll(1, false)
```
|
On the initiative of Croatian ban Károly Khuen-Héderváry, in mid-October 1895 Austro-Hungarian Emperor Franz Joseph visited Zagreb, at the time the capital of the Kingdom of Croatia-Slavonia, in order to attend the opening of the Croatian National Theatre. A group of Croatian students used the visit to protest the rule of the Hungarian Khuen-Héderváry as Croatian ban. They were led by Stjepan Radić, who would later form the influential Croatian People's Peasant Party.
Events
The emperor arrived in Zagreb by train on October 14, 1895. Upon his arrival a group of students chanted "Slava Jelačiću" ("Glory to Jelačić"), in reference to the former Croatian ban Josip Jelačić who had risen up against the Hungarians in the Revolutions of 1848. That day the emperor attended the unveiling ceremonial completion of the Croatian National Theatre. Music by Ivan Zajc was subsequently performed inside the theatre.
The following day, the emperor attended an honorary dance at the Kolo building. On this day a group of students led by Stjepan Radić, then a 24-year-old student of the Faculty of Law, planned a burning of the Hungarian tricolour.
On October 16, the final day of the imperial visit, the students marched to Ban Jelačić Square where they chanted "Živio hrvatski kralj Franjo Josip I" ("Long live Croatian king Franz Joseph I"), "Slava Jelačiću" and "Abzug Magjari" ("Away with Hungarians"). They doused the Hungarian tricolour in brandy and set it on fire. They then marched towards the University of Zagreb. The city police soon informed ban Khuen-Héderváry of the act, and he ordered that the students be arrested. By the end of the following day, 24 were arrested, Radić among them.
Aftermath
The students were subsequently charged for the incident. Stjepan Radić was sentenced to six months in jail, Gjuro Balaško to five, and Milan Dorwald, Osman Hadžić, Vladimir Vidrić, Josip Šikutrić, Vladimir Frank and to four months, while the rest were mostly sentenced to two months. The students were all barred from the University of Zagreb while Stjepan Radić was barred from all universities in the empire. This led him to continue his studies abroad in Paris. The other students went to the Charles University in Prague and the University of Vienna.
These students would form the basis of the Croatian Moderna, a cultural and political movement active at the turn of the century, characterized by anti-traditionalism, cosmopolitanism, and focus on artistic freedom. In 1897, the Prague group of students began publishing Hrvatska misao, while in 1898 the Vienna students began publishing Mladost.
The flag burning also resulted in a schism within the Croatian Party of Rights. Its leader Fran Folnegović distanced himself from the incident, and the dissenters, headed by Ante Starčević and Josip Frank, formed a splinter party, Croatian Pure Party of Rights.
See also
Unveiling of the Gundulić monument
Notes
References
History of Zagreb
Visit Of Emperor Franz Joseph To Zagreb, 1895
Diplomatic visits by heads of state
October 1895 events
|
Tarbert Power Station is an oil fired power station situated on the Shannon Estuary in Tarbert, County Kerry, Ireland. Construction commenced in October 1966 and the first block was commissioned in 1969. The station comprises two (Unit I and II) and two oil fired steam turbines. It was the largest station of ESB during the 1980s. The plant was sold to Endesa in 2009, and subsequently to SSE in 2012. Until early 2022 it was scheduled for closure by the end of 2023. However, due to the 2021–2023 global energy crisis, Tarbert station will maintain operation for an indefinite amount of time, until enough low-carbon generating capacity will be available as a replacement.
In 2003 Tarbert was the site of an explosion that killed two workers and seriously injured another. In September 2022 one boiler was damaged by a fire, which led to loss of half of block 3's generating capacity, . The generator is expected to return to full capacity in February 2023.
In 2023 plans emerged to replace the fuel-oil fired units by a new Open cycle gas turbine Next Generation Power Station with one Hydrotreated Vegetable Oil (HVO)-fired unit. With planned construction begin in 2024, the new unit is scheduled for operation in 2026.
Units:
References
External links
SSE Thermal: Tarbert Power Plant
Oil-fired power stations in the Republic of Ireland
|
```c++
/*
All rights reserved. Use is subject to license terms.
This program is free software; you can redistribute it and/or modify
This program 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 this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifndef SHM_BUFFER_HPP
#define SHM_BUFFER_HPP
#include <ndb_global.h>
#include <NdbSleep.h>
/**
* These classes implement a circular buffer
*
* One reader and one writer
*/
/**
* SHM_Reader
*
* Use as follows:
* getReadPtr(ptr, sz);
* for(int i = 0; i<sz; i++)
* printf("%c\n", ptr[i]);
* updateReadPtr(sz);
*/
class SHM_Reader {
public:
SHM_Reader(char * const _startOfBuffer,
Uint32 _sizeOfBuffer,
Uint32 _slack,
Uint32 * _readIndex,
Uint32 * _writeIndex) :
m_startOfBuffer(_startOfBuffer),
m_totalBufferSize(_sizeOfBuffer),
m_bufferSize(_sizeOfBuffer - _slack),
m_sharedReadIndex(_readIndex),
m_sharedWriteIndex(_writeIndex)
{
}
void clear() {
m_readIndex = 0;
}
/**
*
*/
inline bool empty() const;
/**
* Get read pointer
*
* returns ptr - where to start reading
* sz - how much can I read
*/
inline void getReadPtr(Uint32 * & ptr, Uint32 * & eod);
/**
* Update read ptr
*/
inline void updateReadPtr(Uint32 *ptr);
private:
char * const m_startOfBuffer;
Uint32 m_totalBufferSize;
Uint32 m_bufferSize;
Uint32 m_readIndex;
Uint32 * m_sharedReadIndex;
Uint32 * m_sharedWriteIndex;
};
inline
bool
SHM_Reader::empty() const{
bool ret = (m_readIndex == * m_sharedWriteIndex);
return ret;
}
/**
* Get read pointer
*
* returns ptr - where to start reading
* sz - how much can I read
*/
inline
void
SHM_Reader::getReadPtr(Uint32 * & ptr, Uint32 * & eod)
{
Uint32 tReadIndex = m_readIndex;
Uint32 tWriteIndex = * m_sharedWriteIndex;
ptr = (Uint32*)&m_startOfBuffer[tReadIndex];
if(tReadIndex <= tWriteIndex){
eod = (Uint32*)&m_startOfBuffer[tWriteIndex];
} else {
eod = (Uint32*)&m_startOfBuffer[m_bufferSize];
}
}
/**
* Update read ptr
*/
inline
void
SHM_Reader::updateReadPtr(Uint32 *ptr)
{
Uint32 tReadIndex = ((char*)ptr) - m_startOfBuffer;
assert(tReadIndex < m_totalBufferSize);
if(tReadIndex >= m_bufferSize){
tReadIndex = 0;
}
m_readIndex = tReadIndex;
* m_sharedReadIndex = tReadIndex;
}
#define WRITER_SLACK 4
class SHM_Writer {
public:
SHM_Writer(char * const _startOfBuffer,
Uint32 _sizeOfBuffer,
Uint32 _slack,
Uint32 * _readIndex,
Uint32 * _writeIndex) :
m_startOfBuffer(_startOfBuffer),
m_totalBufferSize(_sizeOfBuffer),
m_bufferSize(_sizeOfBuffer - _slack),
m_sharedReadIndex(_readIndex),
m_sharedWriteIndex(_writeIndex)
{
}
void clear() {
m_writeIndex = 0;
}
inline char * getWritePtr(Uint32 sz);
inline void updateWritePtr(Uint32 sz);
inline Uint32 getWriteIndex() const { return m_writeIndex;}
inline Uint32 getBufferSize() const { return m_bufferSize;}
inline Uint32 get_free_buffer() const;
inline void copyIndexes(SHM_Writer * standbyWriter);
/* Write struct iovec into buffer. */
inline Uint32 writev(const struct iovec *vec, int count);
private:
char * const m_startOfBuffer;
Uint32 m_totalBufferSize;
Uint32 m_bufferSize;
Uint32 m_writeIndex;
Uint32 * m_sharedReadIndex;
Uint32 * m_sharedWriteIndex;
};
inline
char *
SHM_Writer::getWritePtr(Uint32 sz){
Uint32 tReadIndex = * m_sharedReadIndex;
Uint32 tWriteIndex = m_writeIndex;
char * ptr = &m_startOfBuffer[tWriteIndex];
Uint32 free;
if(tReadIndex <= tWriteIndex){
free = m_bufferSize + tReadIndex - tWriteIndex;
} else {
free = tReadIndex - tWriteIndex;
}
sz += 4;
if(sz < free){
return ptr;
}
return 0;
}
inline
void
SHM_Writer::updateWritePtr(Uint32 sz){
assert(m_writeIndex == * m_sharedWriteIndex);
Uint32 tWriteIndex = m_writeIndex;
tWriteIndex += sz;
assert(tWriteIndex < m_totalBufferSize);
if(tWriteIndex >= m_bufferSize){
tWriteIndex = 0;
}
m_writeIndex = tWriteIndex;
* m_sharedWriteIndex = tWriteIndex;
}
inline
Uint32
SHM_Writer::get_free_buffer() const
{
Uint32 tReadIndex = * m_sharedReadIndex;
Uint32 tWriteIndex = m_writeIndex;
Uint32 free;
if(tReadIndex <= tWriteIndex){
free = m_bufferSize + tReadIndex - tWriteIndex;
} else {
free = tReadIndex - tWriteIndex;
}
return free;
}
inline
Uint32
SHM_Writer::writev(const struct iovec *vec, int count)
{
Uint32 tReadIndex = * m_sharedReadIndex;
Uint32 tWriteIndex = m_writeIndex;
/**
* Loop over iovec entries, copying into the shared memory buffer.
*
* The free buffer space may be split with one part after currently used data
* and one part before. Dealing with this is complicated by the way that the
* SHM transporter is designed, it assumes signals are never split. So
* buffer wrap-over is defined at the end of the first signal to cross
* m_bufferSize (there is extra slack in the buffer to make this possible).
*
* This means that we need to scan the signal data to find the correct place
* to wrap over in the buffer.
*/
Uint32 total = 0;
for (int i = 0; i < count; i++)
{
unsigned char *ptr = (unsigned char *)vec[i].iov_base;
Uint32 remain = vec[i].iov_len;
Uint32 segment;
Uint32 maxBytes;
if (tReadIndex <= tWriteIndex)
{
/* Free buffer is split in two. */
if (tWriteIndex + remain > m_bufferSize)
maxBytes = (m_bufferSize - tWriteIndex)/4;
else
maxBytes = remain/4;
segment = 4*TransporterRegistry::unpack_length_words((Uint32 *)ptr,
maxBytes/4);
if (segment > 0)
memcpy(m_startOfBuffer + tWriteIndex, ptr, segment);
remain -= segment;
total += segment;
ptr += segment;
tWriteIndex = 0;
if (remain > 0)
{
if (remain > tReadIndex)
maxBytes = tReadIndex;
else
maxBytes = remain;
segment = 4*TransporterRegistry::unpack_length_words((Uint32 *)ptr,
maxBytes/4);
if (segment > 0)
memcpy(m_startOfBuffer, ptr, segment);
total += segment;
tWriteIndex = segment;
if (remain > segment)
break; // No more room
}
}
else
{
if (tWriteIndex + remain > tReadIndex)
maxBytes = tReadIndex - tWriteIndex;
else
maxBytes = remain;
segment = 4*TransporterRegistry::unpack_length_words((Uint32 *)ptr,
maxBytes/4);
if (segment > 0)
memcpy(m_startOfBuffer + tWriteIndex, ptr, segment);
total += segment;
tWriteIndex += segment;
if (remain > segment)
break; // No more room
}
}
m_writeIndex = tWriteIndex;
*m_sharedWriteIndex = tWriteIndex;
return total;
}
#endif
```
|
This is a list of delegates of the 1st World Congress of the Communist International. The founding congress that established the Communist International was held in Moscow from 2 March 1919 to 6 March 1919.
Full delegates
Russian Communist Party (Bolsheviks)
Six delegates shared five votes:
Vladimir Lenin
Leon Trotsky
Grigory Zinoviev
Joseph Stalin
Nikolai Bukharin
Georgy Chicherin
Communist Party of Germany
One delegate held five votes:
Hugo Eberlein
Socialist Labor Party of America
One delegate held five votes:
Boris Reinstein
Communist Party of German Austria
Two delegates shared three votes:
Karl Steinhardt
K. Petin
Balkan Revolutionary Social Democratic Federation
One delegate held three votes:
Christian Rakovsky
Communist Party of Finland
Five delegates shared three votes:
Yrjö Sirola
Kullervo Manner
Otto Kuusinen
Jukka Rahja
Eino Rahja
Communist Party of Hungary
One delegate held three votes:
Endre Rudnyánszky
Norwegian Labour Party
One delegate held three votes:
Emil Stang
Communist Party of Poland
One delegate held three votes:
Józef Unszlicht
Social Democratic Left Party of Sweden
One delegate held three votes:
Otto Grimlund
Swiss Social Democratic Party (Opposition)
One delegate held three votes:
Fritz Platten
Communist Party of Ukraine
Two delegate shared three votes:
N. A. Skrypnik
S. I. Gopner
Communist Party of Armenia
One delegate held a single vote:
Gurgen Haikun
United Group of the Eastern Peoples of Russia
Five delegates shared a single vote:
Mahomet Altimirov
Hussein Bekentayev
Kasim Kasimov
Burhan Mansurov
Gaziz Yalymov
Communist Party of Estonia
One delegate held a single vote:
Hans Pöögelmann
Zimmerwald Left of France
One delegate held a single vote:
Henri Guilbeaux
Communist Party of the German Colonists in Russia
One delegate held a single vote:
Gustav Klinger
Communist Party of Latvia
One delegate held a single vote:
Kārlis Gailis
Communist Party of Lithuania and Belorussia
One delegate held a single vote:
Consultative delegates
Russian Communist Party (Bolsheviks)
V. V. Obolensky
V. V. Vorovsky
Bulgarian Communist Group
Stojan Dyorov
Central Bureau of Eastern Peoples
Mir Jafar Baghirov (Azerbaijani Section)
Tengiz Zhgenti (Georgian Section)
Mirza Davud Bagir-Uglu Gusseinov (Persian Section)
Gaziz Yalymov (Turkestan Section)
Mustafa Suphi (Turkish Section)
Chinese Socialist Workers Party
Liu Shao-zhou
Zhang Yong-kui
Czech Communist Group
Jaroslav Handlíř
French Communist Group
Jacques Sadoul
British Communist Group
Joseph Fineberg
Korean Workers League in Moscow
Kang Sang-ju
Dutch Social Democratic Group
Sebald Rutgers
Swiss Communist Group
Leonie Kascher
Socialist Propaganda League of America
Sebald Rutgers
Yugoslav Communist Group
Ilija Milkić
Zimmerwald Committee
Angelica Balabanova
References
See also
List of delegates of the 2nd Comintern congress
Comintern
1st Comintern congress
|
Hibbertia incurvata is a species of flowering plant in the family Dilleniaceae and is endemic to the Northern Territory. It is a spreading, woody shrub with scaly foliage, elliptic to lance-shaped leaves, and yellow flowers arranged in leaf axils with 28 to 35 stamens arranged in bundles around the two carpels.
Description
Hibbertia incurvata is a spreading shrub that typically grows to a height of up to and has stiff, woody branches. The leaves are elliptic to lance-shaped with the narrower end towards the base, long and wide and sessile or on a petiole up to long. The flowers are arranged singly near the ends of shoots on a stiff peduncle long, with lance-shaped bracts long. The five sepals are joined at the base, the two outer sepal lobes lance-shaped long and the inner lobes egg-shaped and slightly wider. The five petals are egg-shaped with the narrower end towards the base, yellow, long and there are 28 to 35 stamens arranged in groups around the two carpels, each carpel with two ovules.
Taxonomy
Hibbertia incurvata was first formally described in 2010 by Hellmut R. Toelken in the Journal of the Adelaide Botanic Gardens from specimens collected near Maningrida in 2000. The specific epithet (incurvata) refers to the shape of the leaves.
Distribution and habitat
This hibbertia grows on or near sandstone outcrops and in open woodland in northern Arnhem Land.
Conservation status
Hibbertia incurvata is classified as "data deficient" under the Territory Parks and Wildlife Conservation Act 1976.
See also
List of Hibbertia species
References
incurvata
Flora of the Northern Territory
Plants described in 2010
Taxa named by Hellmut R. Toelken
|
```java
package com.egzosn.pay.ali.bean;
/**
*
* @author Egan
* <pre>
* email egzosn@gmail.com
* date 2020/10/8
* </pre>
*/
public final class AliPayConst {
private AliPayConst() {
}
/**
*
*/
public static final String HTTPS_REQ_URL = "path_to_url";
/**
*
*/
public static final String DEV_REQ_URL = "path_to_url";
public static final String SIGN = "sign";
public static final String SUCCESS_CODE = "10000";
public static final String CODE = "code";
/**
*
*/
public static final String PASSBACK_PARAMS = "passback_params";
/**
*
*/
public static final String PRODUCT_CODE = "product_code";
/**
*
*/
public static final String RETURN_URL = "return_url";
/**
*
*/
public static final String NOTIFY_URL = "notify_url";
/**
*
*/
public static final String BIZ_CONTENT = "biz_content";
/**
*
*/
public static final String APP_AUTH_TOKEN = "app_auth_token";
/**
*
*/
public static final String PAYEE_INFO = "payee_info";
/**
*
*/
public static final String ALIPAY_CERT_SN_FIELD = "alipay_cert_sn";
/**
*
*/
public static final String EXTEND_PARAMS = "extend_params";
public static final String BIZ_TYPE = "biz_type";
public static final String REFUND_REASON = "refund_reason";
public static final String QUERY_OPTIONS = "query_options";
public static final String OUT_REQUEST_NO = "out_request_no";
/**
*
*/
public static final String QUIT_URL = "quit_url";
/**
* ALIAPP
*/
public static final String REQUEST_FROM_URL = "request_from_url";
public static final String DBACK_AMOUNT = "dback_amount";
}
```
|
```yaml
### YamlMime: ContextObject
brand: windows
breadcrumb_path: ../breadcrumb/toc.yml
toc_rel: ../toc.yml
```
|
```java
/*
* 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, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package org.apache.beam.runners.dataflow.worker.windmill.work.processing;
import static org.apache.beam.runners.dataflow.DataflowRunner.hasExperiment;
import com.google.api.services.dataflow.model.MapTask;
import java.util.function.Function;
import org.apache.beam.runners.dataflow.internal.CustomSources;
import org.apache.beam.runners.dataflow.options.DataflowWorkerHarnessOptions;
import org.apache.beam.runners.dataflow.util.CloudObject;
import org.apache.beam.runners.dataflow.util.CloudObjects;
import org.apache.beam.runners.dataflow.worker.DataflowExecutionContext;
import org.apache.beam.runners.dataflow.worker.DataflowExecutionStateSampler;
import org.apache.beam.runners.dataflow.worker.DataflowMapTaskExecutor;
import org.apache.beam.runners.dataflow.worker.DataflowMapTaskExecutorFactory;
import org.apache.beam.runners.dataflow.worker.IntrinsicMapTaskExecutorFactory;
import org.apache.beam.runners.dataflow.worker.ReaderCache;
import org.apache.beam.runners.dataflow.worker.ReaderRegistry;
import org.apache.beam.runners.dataflow.worker.SinkRegistry;
import org.apache.beam.runners.dataflow.worker.StreamingDataflowWorker;
import org.apache.beam.runners.dataflow.worker.StreamingModeExecutionContext;
import org.apache.beam.runners.dataflow.worker.WindmillKeyedWorkItem;
import org.apache.beam.runners.dataflow.worker.counters.CounterSet;
import org.apache.beam.runners.dataflow.worker.counters.NameContext;
import org.apache.beam.runners.dataflow.worker.graph.Edges.Edge;
import org.apache.beam.runners.dataflow.worker.graph.MapTaskToNetworkFunction;
import org.apache.beam.runners.dataflow.worker.graph.Networks;
import org.apache.beam.runners.dataflow.worker.graph.Nodes;
import org.apache.beam.runners.dataflow.worker.graph.Nodes.Node;
import org.apache.beam.runners.dataflow.worker.profiler.ScopedProfiler;
import org.apache.beam.runners.dataflow.worker.streaming.ComputationState;
import org.apache.beam.runners.dataflow.worker.streaming.ComputationWorkExecutor;
import org.apache.beam.runners.dataflow.worker.streaming.StageInfo;
import org.apache.beam.runners.dataflow.worker.util.common.worker.MapTaskExecutor;
import org.apache.beam.runners.dataflow.worker.util.common.worker.OutputObjectAndByteCounter;
import org.apache.beam.runners.dataflow.worker.util.common.worker.ReadOperation;
import org.apache.beam.runners.dataflow.worker.windmill.state.WindmillStateCache;
import org.apache.beam.sdk.coders.Coder;
import org.apache.beam.sdk.coders.KvCoder;
import org.apache.beam.sdk.fn.IdGenerator;
import org.apache.beam.sdk.util.WindowedValue;
import org.apache.beam.vendor.guava.v32_1_2_jre.com.google.common.base.Preconditions;
import org.apache.beam.vendor.guava.v32_1_2_jre.com.google.common.collect.Iterables;
import org.apache.beam.vendor.guava.v32_1_2_jre.com.google.common.graph.MutableNetwork;
import org.checkerframework.checker.nullness.qual.Nullable;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
/** Factory class for generating {@link ComputationWorkExecutor} instances. */
final class ComputationWorkExecutorFactory {
private static final Logger LOG = LoggerFactory.getLogger(ComputationWorkExecutorFactory.class);
private static final String DISABLE_SINK_BYTE_LIMIT_EXPERIMENT =
"disable_limiting_bundle_sink_bytes";
private final DataflowWorkerHarnessOptions options;
private final DataflowMapTaskExecutorFactory mapTaskExecutorFactory;
private final ReaderCache readerCache;
private final Function<String, WindmillStateCache.ForComputation> stateCacheFactory;
private final ReaderRegistry readerRegistry;
private final SinkRegistry sinkRegistry;
private final DataflowExecutionStateSampler sampler;
private final CounterSet pendingDeltaCounters;
/**
* Function which converts map tasks to their network representation for execution.
*
* <ul>
* <li>Translate the map task to a network representation.
* <li>Remove flatten instructions by rewiring edges.
* </ul>
*/
private final Function<MapTask, MutableNetwork<Node, Edge>> mapTaskToNetwork;
private final long maxSinkBytes;
private final IdGenerator idGenerator;
ComputationWorkExecutorFactory(
DataflowWorkerHarnessOptions options,
DataflowMapTaskExecutorFactory mapTaskExecutorFactory,
ReaderCache readerCache,
Function<String, WindmillStateCache.ForComputation> stateCacheFactory,
DataflowExecutionStateSampler sampler,
CounterSet pendingDeltaCounters,
IdGenerator idGenerator) {
this.options = options;
this.mapTaskExecutorFactory = mapTaskExecutorFactory;
this.readerCache = readerCache;
this.stateCacheFactory = stateCacheFactory;
this.idGenerator = idGenerator;
this.readerRegistry = ReaderRegistry.defaultRegistry();
this.sinkRegistry = SinkRegistry.defaultRegistry();
this.sampler = sampler;
this.pendingDeltaCounters = pendingDeltaCounters;
this.mapTaskToNetwork = new MapTaskToNetworkFunction(idGenerator);
this.maxSinkBytes =
hasExperiment(options, DISABLE_SINK_BYTE_LIMIT_EXPERIMENT)
? Long.MAX_VALUE
: StreamingDataflowWorker.MAX_SINK_BYTES;
}
private static Nodes.ParallelInstructionNode extractReadNode(
MutableNetwork<Node, Edge> mapTaskNetwork) {
return (Nodes.ParallelInstructionNode)
Iterables.find(
mapTaskNetwork.nodes(),
node ->
node instanceof Nodes.ParallelInstructionNode
&& ((Nodes.ParallelInstructionNode) node).getParallelInstruction().getRead()
!= null);
}
private static boolean isCustomSource(Nodes.ParallelInstructionNode readNode) {
return CustomSources.class
.getName()
.equals(readNode.getParallelInstruction().getRead().getSource().getSpec().get("@type"));
}
private static void trackAutoscalingBytesRead(
MapTask mapTask,
Nodes.ParallelInstructionNode readNode,
Coder<?> readCoder,
ReadOperation readOperation,
MapTaskExecutor mapTaskExecutor,
String counterName) {
NameContext nameContext =
NameContext.create(
mapTask.getStageName(),
readNode.getParallelInstruction().getOriginalName(),
readNode.getParallelInstruction().getSystemName(),
readNode.getParallelInstruction().getName());
readOperation.receivers[0].addOutputCounter(
counterName,
new OutputObjectAndByteCounter(
new IntrinsicMapTaskExecutorFactory.ElementByteSizeObservableCoder<>(readCoder),
mapTaskExecutor.getOutputCounters(),
nameContext)
.setSamplingPeriod(100)
.countBytes(counterName));
}
private static ReadOperation getValidatedReadOperation(MapTaskExecutor mapTaskExecutor) {
ReadOperation readOperation = mapTaskExecutor.getReadOperation();
// Disable progress updates since its results are unused for streaming
// and involves starting a thread.
readOperation.setProgressUpdatePeriodMs(ReadOperation.DONT_UPDATE_PERIODICALLY);
Preconditions.checkState(
mapTaskExecutor.supportsRestart(),
"Streaming runner requires all operations support restart.");
return readOperation;
}
ComputationWorkExecutor createComputationWorkExecutor(
StageInfo stageInfo, ComputationState computationState, String workLatencyTrackingId) {
MapTask mapTask = computationState.getMapTask();
MutableNetwork<Node, Edge> mapTaskNetwork = mapTaskToNetwork.apply(mapTask);
if (LOG.isDebugEnabled()) {
LOG.debug("Network as Graphviz .dot: {}", Networks.toDot(mapTaskNetwork));
}
Nodes.ParallelInstructionNode readNode = extractReadNode(mapTaskNetwork);
Nodes.InstructionOutputNode readOutputNode =
(Nodes.InstructionOutputNode) Iterables.getOnlyElement(mapTaskNetwork.successors(readNode));
DataflowExecutionContext.DataflowExecutionStateTracker executionStateTracker =
createExecutionStateTracker(stageInfo, mapTask, workLatencyTrackingId);
StreamingModeExecutionContext context =
createExecutionContext(computationState, stageInfo, executionStateTracker);
DataflowMapTaskExecutor mapTaskExecutor =
createMapTaskExecutor(context, mapTask, mapTaskNetwork);
ReadOperation readOperation = getValidatedReadOperation(mapTaskExecutor);
Coder<?> readCoder =
CloudObjects.coderFromCloudObject(
CloudObject.fromSpec(readOutputNode.getInstructionOutput().getCodec()));
Coder<?> keyCoder = extractKeyCoder(readCoder);
// If using a custom source, count bytes read for autoscaling.
if (isCustomSource(readNode)) {
trackAutoscalingBytesRead(
mapTask,
readNode,
readCoder,
readOperation,
mapTaskExecutor,
computationState.sourceBytesProcessCounterName());
}
ComputationWorkExecutor.Builder executionStateBuilder =
ComputationWorkExecutor.builder()
.setWorkExecutor(mapTaskExecutor)
.setContext(context)
.setExecutionStateTracker(executionStateTracker);
if (keyCoder != null) {
executionStateBuilder.setKeyCoder(keyCoder);
}
return executionStateBuilder.build();
}
/**
* Extracts the userland key coder, if any, from the coder used in the initial read step of a
* stage. This encodes many assumptions about how the streaming execution context works.
*/
private @Nullable Coder<?> extractKeyCoder(Coder<?> readCoder) {
if (!(readCoder instanceof WindowedValue.WindowedValueCoder)) {
throw new RuntimeException(
String.format(
"Expected coder for streaming read to be %s, but received %s",
WindowedValue.WindowedValueCoder.class.getSimpleName(), readCoder));
}
// Note that TimerOrElementCoder is a backwards-compatibility class
// that is really a FakeKeyedWorkItemCoder
Coder<?> valueCoder = ((WindowedValue.WindowedValueCoder<?>) readCoder).getValueCoder();
if (valueCoder instanceof KvCoder<?, ?>) {
return ((KvCoder<?, ?>) valueCoder).getKeyCoder();
}
if (!(valueCoder instanceof WindmillKeyedWorkItem.FakeKeyedWorkItemCoder<?, ?>)) {
return null;
}
return ((WindmillKeyedWorkItem.FakeKeyedWorkItemCoder<?, ?>) valueCoder).getKeyCoder();
}
private StreamingModeExecutionContext createExecutionContext(
ComputationState computationState,
StageInfo stageInfo,
DataflowExecutionContext.DataflowExecutionStateTracker executionStateTracker) {
String computationId = computationState.getComputationId();
return new StreamingModeExecutionContext(
pendingDeltaCounters,
computationId,
readerCache,
computationState.getTransformUserNameToStateFamily(),
stateCacheFactory.apply(computationId),
stageInfo.metricsContainerRegistry(),
executionStateTracker,
stageInfo.executionStateRegistry(),
maxSinkBytes);
}
private DataflowMapTaskExecutor createMapTaskExecutor(
StreamingModeExecutionContext context,
MapTask mapTask,
MutableNetwork<Node, Edge> mapTaskNetwork) {
return mapTaskExecutorFactory.create(
mapTaskNetwork,
options,
mapTask.getStageName(),
readerRegistry,
sinkRegistry,
context,
pendingDeltaCounters,
idGenerator);
}
private DataflowExecutionContext.DataflowExecutionStateTracker createExecutionStateTracker(
StageInfo stageInfo, MapTask mapTask, String workLatencyTrackingId) {
return new DataflowExecutionContext.DataflowExecutionStateTracker(
sampler,
stageInfo
.executionStateRegistry()
.getState(
NameContext.forStage(mapTask.getStageName()),
"other",
null,
ScopedProfiler.INSTANCE.emptyScope()),
stageInfo.deltaCounters(),
options,
workLatencyTrackingId);
}
}
```
|
Evacetrapib was a drug under development by Eli Lilly & Company (investigational name LY2484595) that inhibits cholesterylester transfer protein (CETP inhibitor). CETP collects triglycerides from very low-density lipoproteins (VLDL) or low-density lipoproteins (LDL) and exchanges them for cholesteryl esters from high-density lipoproteins (HDL), and vice versa, but primarily increasing high-density lipoprotein and lowering low-density lipoprotein. It is thought that modifying lipoprotein levels modifies the risk of cardiovascular disease. The first CETP inhibitor, torcetrapib, was unsuccessful because it increased levels of the hormone aldosterone and increased blood pressure, which led to excess cardiac events when it was studied. Evacetrapib does not have the same effect. When studied in a small clinical trial in people with elevated LDL and low HDL, significant improvements were noted in their lipid profile.
Evacetrapib evaluation for treatment of high-risk vascular disease was discontinued due to lack of efficacy, as had already happened in the past with two other CETP inhibitors (torcetrapib and dalcetrapib) due to increased deaths and little identifiable cardiovascular benefit (despite substantial increases in HDL). Some hypothesize that CETP inhibitors may still be useful in the treatment of dyslipidemia, though significant caution is warranted. Anacetrapib is the fourth CETP inhibitor being tried for cardiovascular benefit
Trials
ACCELERATE
In a 2014 study in 165 Japanese patients Evacetrapib decreased CETP activity alone or in combination with atorvastatin.
Phase III trial was terminated due to futility. ACCELERATE studied evacetrapib in participants with high-risk vascular disease (previous myocardial infarction, stroke or peripheral vascular disease, or several cardiovascular risk factors). An interim analysis performed in October 7 led the Data Monitoring Committee to support a recommendation to stop the study as the totality of evidence suggested that evacetrapib was unlikely to be superior to placebo. ACCENTUATE is studying patients with hyperlipidemia or diabetes.
On April 3, 2016 at the American College of Cardiology cardiologists first saw the data for Eli Lilly's ACCELERATE trial of Evacetrapib involving 12,000 patients. They were "stunned" by the result which showed there was no benefit from taking evacetrapib—434 participants who took Evacetrapib died from "cardiovascular disease, such as a heart attack or a stroke" and 444 participants who took a placebo died. The ACCELERATE trial led by Dr. Stephen J. Nicholls who observed,
References
Hypolipidemic agents
Tetrazoles
Trifluoromethyl compounds
Carboxylic acids
Abandoned drugs
|
```ruby
# frozen_string_literal: true
module Decidim
module Proposals
module Admin
# A form object to be used when admin users want to import a collection of proposals
# from another component.
class ProposalsImportForm < Decidim::Form
mimic :proposals_import
attribute :origin_component_id, Integer
attribute :import_proposals, Boolean
attribute :keep_answers, Boolean
attribute :keep_authors, Boolean
attribute :states, Array
attribute :scope_ids, Array
validates :origin_component_id, :origin_component, :states, :current_component, presence: true
validates :import_proposals, allow_nil: false, acceptance: true
validate :valid_states
VALID_STATES = %w(accepted not_answered evaluating rejected).freeze
def states_collection
VALID_STATES.map do |state|
OpenStruct.new(
name: I18n.t(state, scope: "decidim.proposals.answers"),
value: state
)
end
end
def states
super.compact_blank
end
def scopes
Decidim::Scope.where(organization: current_organization, id: scope_ids)
end
def origin_component
@origin_component ||= origin_components.find_by(id: origin_component_id)
end
def origin_components
@origin_components ||= current_participatory_space.components.where.not(id: current_component.id).where(manifest_name: :proposals)
end
def origin_components_collection
origin_components.map do |component|
[component.name[I18n.locale.to_s], component.id]
end
end
private
def valid_states
return if states.all? do |state|
VALID_STATES.include?(state)
end
errors.add(:states, :invalid)
end
end
end
end
end
```
|
```kotlin
/*
*
*
* 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 com.vanniktech.emoji.androidxemoji2.category
import com.vanniktech.emoji.EmojiCategory
import com.vanniktech.emoji.androidxemoji2.AndroidxEmoji2
internal class SymbolsCategory : EmojiCategory {
override val categoryNames: Map<String, String>
get() = mapOf(
"en" to "Symbols",
"de" to "Symbole",
)
override val emojis = ALL_EMOJIS
private companion object {
val ALL_EMOJIS: List<AndroidxEmoji2> = SymbolsCategoryChunk0.EMOJIS + SymbolsCategoryChunk1.EMOJIS + SymbolsCategoryChunk2.EMOJIS
}
}
```
|
```html
<html lang="en">
<head>
<title>MicroBlaze - Debugging with GDB</title>
<meta http-equiv="Content-Type" content="text/html">
<meta name="description" content="Debugging with GDB">
<meta name="generator" content="makeinfo 4.11">
<link title="Top" rel="start" href="index.html#Top">
<link rel="up" href="Embedded-Processors.html#Embedded-Processors" title="Embedded Processors">
<link rel="prev" href="M68K.html#M68K" title="M68K">
<link rel="next" href="MIPS-Embedded.html#MIPS-Embedded" title="MIPS Embedded">
<link href="path_to_url" rel="generator-home" title="Texinfo Homepage">
<!--
Permission is granted to copy, distribute and/or modify this document
any later version published by the Free Software Foundation; with the
Invariant Sections being ``Free Software'' and ``Free Software Needs
Free Documentation'', with the Front-Cover Texts being ``A GNU Manual,''
and with the Back-Cover Texts as in (a) below.
(a) The FSF's Back-Cover Text is: ``You are free to copy and modify
this GNU Manual. Buying copies from GNU Press supports the FSF in
developing GNU and promoting software freedom.''
-->
<meta http-equiv="Content-Style-Type" content="text/css">
<style type="text/css"><!--
pre.display { font-family:inherit }
pre.format { font-family:inherit }
pre.smalldisplay { font-family:inherit; font-size:smaller }
pre.smallformat { font-family:inherit; font-size:smaller }
pre.smallexample { font-size:smaller }
pre.smalllisp { font-size:smaller }
span.sc { font-variant:small-caps }
span.roman { font-family:serif; font-weight:normal; }
span.sansserif { font-family:sans-serif; font-weight:normal; }
--></style>
</head>
<body>
<div class="node">
<p>
<a name="MicroBlaze"></a>
Next: <a rel="next" accesskey="n" href="MIPS-Embedded.html#MIPS-Embedded">MIPS Embedded</a>,
Previous: <a rel="previous" accesskey="p" href="M68K.html#M68K">M68K</a>,
Up: <a rel="up" accesskey="u" href="Embedded-Processors.html#Embedded-Processors">Embedded Processors</a>
<hr>
</div>
<h4 class="subsection">21.3.4 MicroBlaze</h4>
<p><a name="index-Xilinx-MicroBlaze-1517"></a><a name="index-XMD_002c-Xilinx-Microprocessor-Debugger-1518"></a>
The MicroBlaze is a soft-core processor supported on various Xilinx
FPGAs, such as Spartan or Virtex series. Boards with these processors
usually have JTAG ports which connect to a host system running the Xilinx
Embedded Development Kit (EDK) or Software Development Kit (SDK).
This host system is used to download the configuration bitstream to
the target FPGA. The Xilinx Microprocessor Debugger (XMD) program
communicates with the target board using the JTAG interface and
presents a <code>gdbserver</code> interface to the board. By default
<code>xmd</code> uses port <code>1234</code>. (While it is possible to change
this default port, it requires the use of undocumented <code>xmd</code>
commands. Contact Xilinx support if you need to do this.)
<p>Use these GDB commands to connect to the MicroBlaze target processor.
<dl>
<dt><code>target remote :1234</code><dd>Use this command to connect to the target if you are running <span class="sc">gdb</span>
on the same system as <code>xmd</code>.
<br><dt><code>target remote </code><var>xmd-host</var><code>:1234</code><dd>Use this command to connect to the target if it is connected to <code>xmd</code>
running on a different system named <var>xmd-host</var>.
<br><dt><code>load</code><dd>Use this command to download a program to the MicroBlaze target.
<br><dt><code>set debug microblaze </code><var>n</var><dd>Enable MicroBlaze-specific debugging messages if non-zero.
<br><dt><code>show debug microblaze </code><var>n</var><dd>Show MicroBlaze-specific debugging level.
</dl>
</body></html>
```
|
```shell
#!/bin/sh
echo >&2 You need to edit this to run your test case
exit 1
git clean -dxf
# If you get './makedepend: 1: Syntax error: Unterminated quoted
# string' when bisecting versions of perl older than 5.9.5 this hack
# will work around the bug in makedepend.SH which was fixed in
# version 96a8704c. Make sure to uncomment 'git checkout makedepend.SH'
# below too.
#git show blead:makedepend.SH > makedepend.SH
# If you can use ccache, add -Dcc=ccache\ gcc -Dld=gcc to the Configure line
# if Encode is not needed for the test, you can speed up the bisect by
# excluding it from the runs with -Dnoextensions=Encode
# ie
#./Configure -Dusedevel -Doptimize=-g -Dcc=ccache\ gcc -Dld=gcc -Dnoextensions=Encode -des
./Configure -Dusedevel -Doptimize=-g -des
test -f config.sh || exit 125
# Correct makefile for newer GNU gcc
perl -ni -we 'print unless /<(?:built-in|command)/' makefile x2p/makefile
# if you just need miniperl, replace test_prep with miniperl
make test_prep
[ -x ./perl ] || exit 125
# This runs the actual testcase. You could use -e instead:
./perl -Ilib ~/testcase.pl
ret=$?
[ $ret -gt 127 ] && ret=127
git checkout makedepend.SH
git clean -dxf
exit $ret
#if you need to invert the exit code, replace the above exit with this:
#[ $ret -eq 0 ] && exit 1
#exit 0
```
|
```php
<?php
namespace Doctrine\DBAL\Schema;
/**
* An abstraction class for an asset identifier.
*
* Wraps identifier names like column names in indexes / foreign keys
* in an abstract class for proper quotation capabilities.
*/
class Identifier extends AbstractAsset
{
/**
* @param string $identifier Identifier name to wrap.
* @param bool $quote Whether to force quoting the given identifier.
*/
public function __construct($identifier, $quote = false)
{
$this->_setName($identifier);
if (! $quote || $this->_quoted) {
return;
}
$this->_setName('"' . $this->getName() . '"');
}
}
```
|
```java
/*
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
*
* 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 org.apache.shardingsphere.sql.parser.statement.core.segment.dml.table;
import lombok.Getter;
import lombok.RequiredArgsConstructor;
import org.apache.shardingsphere.sql.parser.statement.core.segment.SQLSegment;
import org.apache.shardingsphere.sql.parser.statement.core.statement.dml.InsertStatement;
import java.util.Collection;
/**
* Multi table conditional into else segment.
*/
@RequiredArgsConstructor
@Getter
public final class MultiTableConditionalIntoElseSegment implements SQLSegment {
private final int startIndex;
private final int stopIndex;
private final Collection<InsertStatement> insertStatements;
}
```
|
```dart
import 'package:flutter/material.dart';
import 'package:http/http.dart' as http;
void main() async {
final uri = Uri.parse("path_to_url");
final resp = await http.read(uri);
print(resp);
runApp(MyApp());
}
class MyApp extends StatelessWidget {
@override
Widget build(BuildContext context) {
return MaterialApp(
title: 'Flutter Demo',
theme: ThemeData(primarySwatch: Colors.blue),
home: MyHomePage(),
);
}
}
class MyHomePage extends StatelessWidget {
MyHomePage({Key? key}) : super(key: key);
@override
Widget build(BuildContext context) {
return Text(
'Hello, world!',
textDirection: TextDirection.ltr,
);
}
}
```
|
Eulima lodderae is a species of sea snail, a marine gastropod mollusk in the family Eulimidae. The species is one of a number within the genus Eulima.
References
External links
To World Register of Marine Species
lodderae
Gastropods described in 1900
|
```makefile
PKG_NAME="libogg"
PKG_VERSION="1.3.5"
PKG_SHA256=your_sha256_hash
PKG_LICENSE="BSD"
PKG_SITE="path_to_url"
PKG_URL="path_to_url{PKG_VERSION}.tar.xz"
PKG_DEPENDS_TARGET="toolchain"
PKG_LONGDESC="Libogg contains necessary functionality to create, decode, and work with Ogg bitstreams."
PKG_BUILD_FLAGS="+pic"
PKG_CMAKE_OPTS_TARGET="-DINSTALL_DOCS=OFF"
```
|
The 2014 Georgia Tech Yellow Jackets football team represented the Georgia Institute of Technology in the 2014 NCAA Division I FBS football season. The Yellow Jackets were led by seventh-year head coach Paul Johnson and played their home games at Bobby Dodd Stadium. They were a member of the Coastal Division of the Atlantic Coast Conference.
After going 7–6 in 2013, the Yellow Jackets entered 2014 unranked. Georgia Tech won its first five games of the season, which included comeback victories over Georgia Southern and Virginia Tech, and end a five-game losing streak to Miami (FL). After losing back-to-back games to Duke and North Carolina, the Yellow Jackets won out the rest of its regular season, which was capped off with a 30–24 overtime victory over Georgia. The Yellow Jackets represented the Coastal Division in the ACC Championship Game, where they were defeated by Atlantic Division champions Florida State 37-35, however the Yellow Jackets were invited to the Orange Bowl, where they defeated Mississippi State 49–34. Georgia Tech ended the season with an 11–3 record and a #8 ranking in the final AP Poll.
Before the season
Previous season
The Yellow Jackets were members of the Coastal Division of the Atlantic Coast Conference, finishing the season 7–5 (5–3 in ACC play). They were invited to the Music City Bowl where they were defeated by Ole Miss. Three players from the 2013 team were taken in the 2014 NFL Draft.
Preseason
Head coach Paul Johnson returned for his seventh year at the helm of the program. Vad Lee, who was Georgia Tech's starter in 2013, was replaced by Justin Thomas after Lee transferred to James Madison. The Yellow Jackets were picked to finish fifth in the Coastal Division in the ACC preseason media poll.
Recruiting class
Spring game
Georgia Tech's spring game was held on April 14 at Bobby Dodd Stadium. In a rain-soaked game, the White team, led by quarterback Tim Byerly, defeated the Gold team 20–12.
Coaching staff
Schedule
Schedule source:
Game summaries
Wofford
Near the end of the first half, Wofford took a 9–7 lead on a 92-yard touchdown run from Ray Smith. However, the Yellow Jackets were able to take a 10–9 lead into halftime with a 30-yard field goal from Harrison Butker. The Yellow Jackets expanded their lead in the third quarter 24–12 thanks to two touchdowns to wide receiver DeAndre Smelter. The Terriers closed gap 24–19 in the middle of the fourth quarter thanks to a 4-yard touchdown run from Octavius Harden, but the Yellow Jackets were able to score two more touchdowns towards the end of the game to win the matchup 38–19. In his first start as Georgia Tech's quarterback, Justin Thomas had 353 total yards of offense, including 282 passing yards.
Tulane
In the first game at Yulman Stadium, Georgia Tech defeated Tulane, 38–21. Tulane took a 14–7 lead going into the second quarter. Georgia Tech tied the game, 14–14, on a 10-yard interception return from linebacker Quayshawn Nealy. Tulane took a 21–14 lead with 9:38 left in the half on a 61-yard touchdown pass from Tanner Lee to Xavier Rush. An interception of Tanner Lee helped set up a 19-yard touchdown run from Tony Zenon to tie the game, 21–21. A 46-yard field goal from Harrison Butker gave Georgia Tech a 24–21 lead at halftime. Tulane was shut out in the second half, as Georgia Tech scored two more touchdowns to give the Yellow Jackets a 38–21 victory.
Georgia Southern
Georgia Tech dominated the first half, going into half with a 35–10 lead. However, Georgia Southern scored 28 unanswered points to give the Eagles a 38–35 lead in the middle of the fourth quarter. Recovering a Georgia Southern fumble with 4:12 remaining in the game, Georgia Tech were able to take a 42–38 lead with 23 seconds remaining on a 13-yard touchdown pass from Justin Thomas to Deon Hill to avoid a huge upset.
Virginia Tech
Virginia Tech led 13–3 in the middle of the second quarter. However, Georgia Tech was able to make it a 13–10 game on a 2-yard touchdown run from Justin Thomas. Georgia Tech took a 17–16 lead in the fourth quarter on a 41-yard interception return by Paul Davis. The Hokies then took a 24–17 when quarterback Michael Brewer recovered a fumble and ran 21 yards for a touchdown. Georgia Tech tied the game 24–24 on a nine-play, 67-yard drive that included a 4th-and-15 conversion and a 31-yard touchdown pass to DeAndre Smelter. Michael Brewer was intercepted on the ensuing Hokies drive. Taking advantage of the interception, Georgia Tech won the game 27–24 on a 24-yard field goal from Harrison Butker as time expired. The game not only marked Georgia Tech's first victory over Virginia Tech since 2009, but also at Blacksburg since 2006.
Miami
The Hurricanes scored first on a 21-yard touchdown pass from Brad Kaaya to Braxton Berrios. Georgia Tech tied the game 7–7 on a 1-yard touchdown run from Justin Thomas. At the end of the first quarter, Miami took a 14–7 lead on a 24-yard touchdown run from Duke Johnson. The Yellow Jackets would control the rest of the game, as Georgia Tech outscored Miami 21–3 to give the Yellow Jackets a 28–17 victory. The game marked Georgia Tech's first victory over Miami since 2008.
Duke
Georgia Tech entered the game ranked in the AP Poll for the first time since week 13 of the 2011 season. Duke took a 31–12 lead in the middle of the fourth quarter on a 1-yard touchdown run from Thomas Sirk. Georgia Tech was able to close the gap 31–25 thanks to two Tim Byerly rushing touchdowns. However, Georgia Tech was unable to recover their onside kick with 1:27 remaining in the game, giving the Blue Devils the victory. Georgia Tech turned the ball over three times and quarterback Justin Thomas was benched in favor of Tim Byerly the fourth quarter after Thomas threw his second interception. The game not only marked Georgia Tech's first loss to Duke since 2003, but also at home since 1994.
North Carolina
Georgia Tech trailed 42–31 in the fourth quarter after a 36-yard touchdown pass from Marquise Williams to Mack Hollins. The Yellow Jackets then scored two unanswered touchdowns, the latter being a 75-yard touchdown run off a reverse from wide receiver DeAndre Smelter, to give Georgia Tech a 43–42 lead with 3:07 remaining in the game. However, North Carolina scored on a 2-yard touchdown run from T. J. Logan with 11 seconds remaining to give the Tar Heels a 48–43 victory. The game marked Georgia Tech's first loss to UNC since 2008.
Pittsburgh
Taking advantage of four Pittsburgh turnovers, Georgia Tech took a 28–0 lead early in the game. Pittsburgh closed the gap 28–14 in the second quarter with two rushing touchdown from James Conner. After trading touchdowns the third quarter, Georgia Tech pulled away from the Panthers with three more rushing touchdowns to give Georgia Tech a 56–28 victory.
Virginia
At Georgia Tech's Homecoming game, the Yellow Jackets defeated the Cavaliers 35–10. Quarterback Justin Thomas threw three touchdowns and running back Synjyn Days ran for 147 yards while the Georgia Tech defense held Virginia to only 22 rushing yards.
North Carolina State
Georgia Tech trailed 13–7 near the end of the first quarter, but the Yellow Jackets outscored the Wolfpack 49–10 the rest of the game to win 56–23. Georgia Tech's offense rushed for 479 yards while the defense scored two defensive touchdowns.
Clemson
Georgia Tech took a 6–3 lead in the first quarter on an 85-yard interception return from Jamal Golden. In the third quarter, Chris Milton returned an interception 62 yards for a touchdown to give Georgia Tech a 25–6 lead. Georgia Tech won the game 28–6. Georgia Tech's defense limited Clemson's offense to only 190 yards.
In the following bye week, Georgia Tech clinched the ACC Coastal Division title when North Carolina defeated Duke 45–20.
Georgia
Georgia took a 7–0 lead early in the first quarter on a 1-yard touchdown run from Nick Chubb. Towards the end of the first quarter, Georgia drove deep into Georgia Tech's territory, hoping to expand their lead. However, Nick Chubb lost a fumble at Georgia Tech's 1-yard line.
Taking advantage of Chubb's fumble, Georgia Tech drove to Georgia's 20-yard line. However, Georgia Tech came up empty when Harrison Butker's kick was blocked. On the ensuing Georgia drive, UGA drove once again drove deep Georgia Tech territory. However, Georgia once again lost a fumble at Georgia Tech's 1-yard line, this time a fumble by Sony Michel. Taking advantage of the fumble, Georgia Tech was able to tie the game 7–7 near the end of the second quarter on a 7-yard touchdown pass from Justin Thomas to Darren Waller. In the third quarter, Georgia took a 14–7 lead after UGA's Damian Swann returned a Justin Thomas fumble 99-yards for a touchdown. After blocking a Georgia field goal, Georgia Tech tied the game 14–14 on a 4-yard touchdown run from Zach Laskey.
Early in the fourth quarter, Georgia took a 17–14 lead on a 19-yard field goal from Marshall Morgan. Georgia Tech responded with an 8-yard touchdown run from Zach Laskey to give the Yellow Jackets a 21–17 lead. Georgia Tech was then able to recover their own kickoff at Georgia's 27-yard line. However, Justin Thomas fumbled with 2:41 remaining in the game. Taking advantage of the fumble, UGA took a 24–21 lead with 18 seconds remaining on a 3-yard passing touchdown from Hutson Mason to Malcolm Mitchell. A squib kickoff gave Georgia Tech good field possession. After Justin Thomas scrambled 21 yards, Harrison Butker kicked a 53-yard field goal to tie the game 24–24 and send the game into overtime.
Georgia Tech received the ball first in overtime and took a 30–24 lead on a 2-yard touchdown run from Zach Laskey. However, the extra point was blocked and the game remained 30–24. On the ensuing UGA possession, Georgia was able to drive to Georgia Tech's 9-yard line, needing a touchdown and extra point to win. However, on a 2nd and goal play, Georgia Tech cornerback D.J. White intercepted a Hutson Mason pass intended for Malcolm Mitchell, sealing a victory for Georgia Tech. The game was Georgia Tech's first win over Georgia since 2008.
Florida State (ACC Championship Game)
In the ACC Championship Game, Georgia Tech took on Florida State, the defending national champions. Georgia Tech's offense scored on their first three possessions to give Georgia Tech a 21–14 lead in the middle of the second quarter. However, FSU scored two unanswered touchdowns to give FSU a 28–21 lead into halftime.
Georgia Tech was able to tie the game 28–28 on the opening drive in the third quarter. However, Florida State scored three field goals from Roberto Aguayo as the Seminoles were able to limit Georgia Tech's offense and pull ahead 37–28. Georgia Tech was able to cut Florida States' lead to two on a 25-yard touchdown pass from Justin Thomas to Darren Waller to make it a 37–35 game with 1:47 remaining. However, Georgia Tech was unable to recover their onside kick and Florida State was able to run out the clock, giving FSU the ACC Championship.
Mississippi State (Orange Bowl)
Appearing in their seventh Orange Bowl, Georgia Tech defeated Mississippi State 49–34. The Yellow Jackets went up 14–0 before Mississippi State scored 13 straight points to make it a 14–13 game. Georgia Tech was able to extend their lead 21–13 on a 13-yard touchdown run from Justin Thomas. On the final play of the first half, Mississippi State's Dak Prescott completed a 42-yard Hail Mary pass to make it a 21–20 lead going into halftime. On the second play of the second half, Georgia Tech went up 28–20 on a 69-yard touchdown run from Synjyn Days. Two more rushing touchdowns from Justin Thomas helped expand Georgia Tech's lead 42–20. In the first play of the fourth quarter, Mississippi State cut into Georgia Tech's lead on a 7-yard touchdown pass from Dak Prescott to De'Runnya Wilson to make it a 42–27 game. Georgia Tech was able to respond with a 4-yard touchdown run from Synjyn Days to give Georgia Tech a 49–27 lead. The Bulldogs were able to cut into Georgia Tech's lead with a 12-yard touchdown pass from Dak Prescott to De'Runnya Wilson with 2:20 remaining in the game to make it a 49–34 game. However, the Bulldogs were unable to recover their onside kick, and Georgia Tech was able to seal the win after running out the clock.
Georgia Tech rushed for 452 yards and Justin Thomas, the game's MVP, accounted for four total touchdowns. The game also marked Georgia Tech's first Orange Bowl victory in 63 years.
Rankings
Awards
Conference awards
ACC Coach of the Year
Paul Johnson
Honors
All-ACC
Eight players were honored as All-ACC selections by coaches
Second team
:DeAndre Smelter
:Shaq Mason
Justin Thomas
Adam Gotsis
Zach Laskey
Third team
Quayshawn Nealy
Jamal Golden
Honorable mention
Synjyn Days
NFL draft
The following Georgia Tech players were selected in the 2015 NFL Draft:
References
Georgia Tech
Georgia Tech Yellow Jackets football seasons
Orange Bowl champion seasons
Georgia Tech Yellow Jackets football
|
The Banque d'Anvers () was a based Belgian bank that acted as the affiliate of the Société Générale de Belgique in Antwerp. It started activity as a branch in 1823, became a fully-fledged bank in 1827, and was eventually merged into the Générale de Banque in 1965. In the 1920s, it was described as one of the most powerful banks in Belgium.
Name
Even though the bank was primarily active in the Dutch-speaking part of Belgium, for most of its existence it was generally referred to by its French name including in Dutch-speaking or English-speaking contexts.
History
One year after its establishment in 1822, the Société Générale de Belgique (at that time known as the ) opened a branch in Antwerp. A few years later, it decided to convert it into a legally separate bank (subsidiary), which became effective on . At the time, the was a note-issuing bank, and issued special banknotes that could only be redeemed at the Banque d'Anvers. During its first decades of activity, the bank had no capital of its own, until it was reorganized and capitalized in 1870, when the Société Générale de Belgique took up half of the shareholders' equity.
In 1919, the Banque d'Anvers absorbed the (est. 1910) and the (est. 1900), and in 1924, the . In 1934-1935, the Société Générale de Belgique consolidated all its other local affiliates into the newly formed Générale de Banque, but the family shareholders of the Banque d'Anvers rejected that option and the bank thus remained as the SGB's only autonomous local affiliate bank in Belgium.
Following World War II, the Banque d'Anvers absorbed other local banks, the in 1957, and the venerable Banque J. J. Le Grelle (est. 1792) in 1962. Even so, the Banque d'Anvers lacked critical mass in the context of 1960s Belgium. On , it was merged into the Générale de Banque, simultaneously as the Société Belge de Banque. As a consequence, it returned to the status it had in its origin years as a mere local branch of the . In subsequent years, its head office building on Antwerp's Meir thoroughfare featured a sign that read "Generale Bankmaatschappij v/h Bank van Antwerpen", .
Leadership
, chairman 1827-1866?
Charles Gréban de Saint-Germain, chairman 1870-?
, chairman ca. 1890
Philippe Dulait, chairmen 1964?-1965
Hector Carlier, founder of Petrofina, started his career at the Banque d'Anvers, in which his father held a significant equity stake.
See also
Banque Italo-Belge
Banque Liégeoise
Notes
Defunct banks of Belgium
|
This page lists the municipal flags of Shikoku, Japan. It is a part of the List of Japanese municipal flags, which is split into regions due to its size.
Complete lists of Japanese municipal flags pages
List of municipal flags of Hokkaidō
List of municipal flags of Tōhoku region
List of municipal flags of Kantō region
List of municipal flags of Chūbu region
List of municipal flags of Kansai region
List of municipal flags of Chūgoku region
List of municipal flags of Shikoku
List of municipal flags of Kyūshū
Tokushima Prefecture
Cities
Towns and villages
Historical
Kagawa Prefecture
Cities
Towns and villages
Ehime Prefecture
Cities
Towns and villages
Kōchi Prefecture
Cities
Towns and villages
Municipal
|
The Men's Artistic Team All-Around at the 2013 Summer Universiade was both the qualification round and the team final for the competition. It served as the basis by which the team ranks were decided and the basis upon which gymnasts qualified for all-around and event finals. The first subdivision took place at 10:00 MSK, the second at 11:40 MSK, the third at 15:00 MSK, the fourth at 16:40 MSK, and the fifth at 18:20 MSK. The award ceremony for the team title was at 20:00 MSK.
Subdivisions
Gymnasts from nations taking part in the team all-around event were grouped together while the other gymnasts were grouped together into one of five mixed groups.
Subdivision 1: Mixed
Subdivision 2
Subdivision 3
Subdivision 4
Subdivision 5
Qualification and Team Final Results
References
Men's artistic team all-around
|
```python
# THIS FILE IS AUTOMATICALLY GENERATED FROM INFORMATION STORED IN
# THIRD-PARTY METADATA SERVICE. YOUR MANUAL CHANGES TO THIS FILE WILL
# BE PRESERVED AND WILL SERVE AS THE SOURCE OF TRUTH FOR METADATA OF
# THIS PACKAGE.
# TPMS-GENERATED: b3448f8fd2a893772f944f37627e63917b77dede
METADATA = {
"name": "rules",
"owner": "pytorch_dev_infra",
}
```
|
```c++
/*
*
* 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 Google Inc. 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.
*/
#include "config.h"
#include "core/frame/PageScaleConstraints.h"
#include <algorithm>
namespace blink {
PageScaleConstraints::PageScaleConstraints()
: initialScale(-1), minimumScale(-1), maximumScale(-1) { }
PageScaleConstraints::PageScaleConstraints(float initial, float minimum, float maximum)
: initialScale(initial), minimumScale(minimum), maximumScale(maximum) { }
void PageScaleConstraints::overrideWith(const PageScaleConstraints& other)
{
if (other.initialScale != -1) {
initialScale = other.initialScale;
if (minimumScale != -1)
minimumScale = std::min(minimumScale, other.initialScale);
}
if (other.minimumScale != -1)
minimumScale = other.minimumScale;
if (other.maximumScale != -1)
maximumScale = other.maximumScale;
if (!other.layoutSize.isZero())
layoutSize = other.layoutSize;
clampAll();
}
float PageScaleConstraints::clampToConstraints(float pageScaleFactor) const
{
if (pageScaleFactor == -1)
return pageScaleFactor;
if (minimumScale != -1)
pageScaleFactor = std::max(pageScaleFactor, minimumScale);
if (maximumScale != -1)
pageScaleFactor = std::min(pageScaleFactor, maximumScale);
return pageScaleFactor;
}
void PageScaleConstraints::clampAll()
{
if (minimumScale != -1 && maximumScale != -1)
maximumScale = std::max(minimumScale, maximumScale);
initialScale = clampToConstraints(initialScale);
}
void PageScaleConstraints::fitToContentsWidth(float contentsWidth, int viewWidthNotIncludingScrollbars)
{
if (!contentsWidth || !viewWidthNotIncludingScrollbars)
return;
// Clamp the minimum scale so that the viewport can't exceed the document
// width.
minimumScale = std::max(minimumScale, viewWidthNotIncludingScrollbars / contentsWidth);
clampAll();
}
void PageScaleConstraints::resolveAutoInitialScale()
{
// If the initial scale wasn't defined, set it to minimum scale now that we
// know the real value.
if (initialScale == -1)
initialScale = minimumScale;
clampAll();
}
bool PageScaleConstraints::operator==(const PageScaleConstraints& other) const
{
return layoutSize == other.layoutSize
&& initialScale == other.initialScale
&& minimumScale == other.minimumScale
&& maximumScale == other.maximumScale;
}
} // namespace blink
```
|
```ruby
class DropDurationInSecondsFromPodcastEpisodes < ActiveRecord::Migration[6.1]
def change
safety_assured do
remove_column :podcast_episodes, :duration_in_seconds, :integer
end
end
end
```
|
```javascript
/* globals customElements */
import { LitElement, html, css } from '../vendor/lit-element/lit-element'
import { repeat } from '../vendor/lit-element/lit-html/directives/repeat'
import { shorten } from '../../lib/strings'
import * as bg from './bg-process-rpc'
import commonCSS from './common.css'
import inputsCSS from './inputs.css'
import buttonsCSS from './buttons.css'
import spinnerCSS from './spinner.css'
const STATES = {
READY: 0,
DOWNLOADING: 1,
CLONING: 2
}
class ForkDriveModal extends LitElement {
static get properties () {
return {
state: {type: Number},
label: {type: String},
title: {type: String},
description: {type: String},
tags: {type: String},
isTemplate: {type: Boolean},
isDetached: {type: Boolean}
}
}
static get styles () {
return [commonCSS, inputsCSS, buttonsCSS, spinnerCSS, css`
.wrapper {
padding: 0;
}
form {
padding: 14px 20px;
margin: 0;
}
.loading {
padding: 20px 22px 20px;
font-size: 15px;
font-style: normal;
border-bottom: 1px solid #ccd;
color: rgba(0, 0, 0, 0.6);
}
h1 {
margin-top: 0;
}
.tabbed-nav {
display: flex;
align-items: center;
font-size: 17px;
letter-spacing: 0.5px;
margin: -4px -16px 14px;
}
.tabbed-nav span {
min-width: 5px;
border: 1px solid transparent;
border-bottom: 1px solid #bbb;
height: 28px;
}
.tabbed-nav span.spacer {
flex: 1;
}
.tabbed-nav a {
color: inherit;
border: 1px solid transparent;
border-bottom: 1px solid #bbb;
cursor: pointer;
border-top-left-radius: 2px;
border-top-right-radius: 2px;
padding: 4px 18px;
}
.tabbed-nav a.active {
border: 1px solid #bbb;
border-bottom: 1px solid transparent;
}
.columns {
display: grid;
grid-template-columns: auto 1fr;
grid-gap: 12px;
}
input {
font-size: 14px;
height: 34px;
padding: 0 10px;
border-color: #bbb;
}
select {
-webkit-appearance: none;
display: inline-block;
font-size: 13px;
font-weight: 500;
padding: 8px 30px 8px 10px;
max-width: 100%;
border: 1px solid #bbc;
border-radius: 4px;
outline: 0;
background-color: #fff;
background-image: url(data:image/png;base64,your_sha256_hashyour_sha256_hashyour_sha256_hashX4+8lwAAAIxJREFUSInt0TcCwjAQRNFvE5dkwKD7H5WGINsKszWa+r9qoO1ftjqc1B0N2DyDYwNcPX0Ia0Yf2HFx9Y+your_sha256_hash+Jcr9UtT6uaj3U6H0sdD6n1D7j9B76M7jbevo29rgBddTP/7iwZL3AAAAAElFTkSuQmCC);
background-repeat: no-repeat;
background-position: right .7em top 50%, 0 0;
background-size: .65em auto, 100%;
}
.help {
opacity: 0.6;
}
.help.with-icon {
padding-left: 16px;
position: relative;
}
.help.with-icon .fas {
position: absolute;
left: -2px;
top: 1px;
font-size: 11px;
}
input + .help {
margin-top: -8px;
}
.help a {
cursor: pointer;
color: blue;
text-decoration: underline;
}
hr {
border: 0;
border-top: 1px solid #ddd;
margin: 10px 0;
}
.form-actions {
display: flex;
align-items: center;
justify-content: space-between;
}
.fork-dat-progress {
font-size: 14px;
}
`]
}
constructor () {
super()
// internal state
this.driveInfo = null
this.state = STATES.READY
// params
this.cbs = null
this.forks = []
this.base = undefined
this.label = ''
this.title = ''
this.description = ''
this.tags = ''
this.isDetached = false
}
async init (params, cbs) {
// store params
this.cbs = cbs
this.forks = params.forks
this.base = this.forks.find(fork => fork.url === params.url) || this.forks[0]
this.isDetached = params.detached || false
this.isTemplate = params.isTemplate || false
this.label = params.label || ''
await this.requestUpdate()
// fetch drive info
this.driveInfo = await bg.hyperdrive.getInfo(this.base.url)
this.title = typeof params.title === 'string' ? params.title : (this.driveInfo.title || '')
this.description = typeof params.description === 'string' ? params.description : (this.driveInfo.description || '')
this.tags = params.tags ? (Array.isArray(params.tags) ? params.tags.join(' ') : params.tags) : this.driveInfo.tags?.join(' ') || ''
await this.requestUpdate()
this.adjustHeight()
}
updated () {
this.adjustHeight()
}
adjustHeight () {
var height = this.shadowRoot.querySelector('div').clientHeight|0
bg.modals.resizeSelf({height})
}
// rendering
// =
render () {
if (!this.driveInfo) {
return this.renderLoading()
}
var progressEl
var actionBtn
switch (this.state) {
case STATES.READY:
progressEl = html`<div class="fork-dat-progress">Ready to ${this.isDetached ? 'make a copy' : 'fork'}.</div>`
actionBtn = html`<button type="submit" class="btn primary" tabindex="5">${this.isDetached ? 'Copy drive' : 'Create fork'}</button>`
break
case STATES.DOWNLOADING:
progressEl = html`<div class="fork-dat-progress">Downloading remaining files...</div>`
actionBtn = html`<button type="submit" class="btn" disabled tabindex="5"><span class="spinner"></span></button>`
break
case STATES.CLONING:
progressEl = html`<div class="fork-dat-progress">Downloading and copying...</div>`
actionBtn = html`<button type="submit" class="btn" disabled tabindex="5"><span class="spinner"></span></button>`
break
}
const navItem = (v, label) => html`
<a class=${this.isDetached === v ? 'active' : ''} @click=${e => this.onSetDetached(v)}>${label}</a>
`
const baseOpt = (fork) => {
return html`
<option value=${fork.url} ?selected=${this.base === fork}>
${fork.forkOf && fork.forkOf.label ? fork.forkOf.label : 'Original'}
</option>
`
}
return html`
<link rel="stylesheet" href="beaker://assets/font-awesome.css">
<div class="wrapper">
<form @submit=${this.onSubmit}>
${this.isTemplate ? html`
<h1>Create a new drive</h1>
` : html`
<div class="tabbed-nav">
<span></span>
${navItem(false, 'Fork')}
${navItem(true, 'Copy')}
<span class="spacer"></span>
</div>
`}
${this.isDetached ? html`
<p class="help with-icon">
<span class="fas fa-fw fa-info"></span>
${this.isTemplate
? html`
Using
<a @click=${this.onClickTemplate}>${shorten(this.driveInfo.title, 20)}</a>
as a template.
`
: 'Make an independent copy of the drive.'}
</p>
<label for="title">Title</label>
<input autofocus name="title" tabindex="1" value=${this.title || ''} @change=${this.onChangeTitle} required placeholder="Title" />
<label for="desc">Description</label>
<input name="desc" tabindex="2" @change=${this.onChangeDescription} value=${this.description || ''} placeholder="Description (optional)">
<label for="tags">Tags</label>
<input name="tags" tabindex="3" @change=${this.onChangeTags} value=${this.tags || ''} placeholder="Tags (optional, separated by spaces)">
` : html`
<p class="help with-icon"><span class="fas fa-fw fa-info"></span> A fork is a linked copy of the drive which is used for making changes and then merging into the original.</p>
<div class="columns">
<div>
<label for="base">Base</label>
<div style="margin: 5px 0 8px">
<select name="base" tabindex="1" @change=${this.onChangeBase}>
${baseOpt(this.forks[0])}
<optgroup label="Forks">
${repeat(this.forks.slice(1), fork => baseOpt(fork))}
</optgroup>
</select>
</div>
</div>
<div>
<label for="label">Label</label>
<input
name="label"
tabindex="2"
value="${this.label}"
@change=${this.onChangeLabel}
placeholder="e.g. 'dev' or 'my-new-feature'"
autofocus
required
/>
<p class="help">The label will help you identify the fork.</p>
<label for="tags">Tags</label>
<input name="tags" tabindex="3" @change=${this.onChangeTags} value=${this.tags || ''} placeholder="Tags (optional, separated by spaces)">
</div>
</div>
`}
<hr>
<div class="form-actions">
${progressEl}
<div>
<button type="button" class="btn cancel" @click=${this.onClickCancel} tabindex="4">Cancel</button>
${actionBtn}
</div>
</div>
</form>
</div>
`
}
renderLoading () {
return html`
<div class="wrapper">
<div class="loading">Loading...</div>
<form>
<div class="form-actions">
<div></div>
<div>
<button type="button" class="btn cancel" @click=${this.onClickCancel} tabindex="4">Cancel</button>
<button type="submit" class="btn" tabindex="5" disabled>Create</button>
</div>
</div>
</form>
</div>
`
}
// event handlers
// =
onClickTemplate (e) {
bg.beakerBrowser.openUrl(this.driveInfo.url, {setActive: true})
}
onSetDetached (v) {
this.isDetached = v
}
async onChangeBase (e) {
this.base = this.forks.find(fork => fork.url === e.currentTarget.value)
this.driveInfo = await bg.hyperdrive.getInfo(this.base.url)
this.requestUpdate()
}
onChangeLabel (e) {
this.label = e.target.value
}
onChangeTitle (e) {
this.title = e.target.value
}
onChangeDescription (e) {
this.description = e.target.value
}
onChangeTags (e) {
this.tags = e.target.value
}
onClickCancel (e) {
e.preventDefault()
this.cbs.reject(new Error('Canceled'))
}
async onSubmit (e) {
e.preventDefault()
if (this.isDetached) {
if (!this.title.trim()) return
} else {
if (!this.label.trim()) return
}
// this.state = STATES.DOWNLOADING
// await bg.hyperdrive.download(this.base.url)
this.state = STATES.CLONING
try {
var url = await bg.hyperdrive.forkDrive(this.base.url, {
detached: this.isDetached,
title: this.isDetached ? this.title : this.driveInfo.title,
description: this.isDetached ? this.description : this.driveInfo.description,
tags: this.tags.split(' '),
label: this.label,
prompt: false
})
this.cbs.resolve({url})
} catch (e) {
this.cbs.reject(e.message || e.toString())
}
}
}
customElements.define('fork-drive-modal', ForkDriveModal)
```
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.