atomic-queue-devel-0-0.1.20211022git7013a8b.el8 > 6 6_6 3!y덏%!E/֡as !E/֡P7FAcOx褆c=]:+M؛__}s8҄q #hj>-uEuIR0Qa]+<`2HTBomrQpw_!lKՈG5`Wd_[ պ (H lԚBɮ!b PrdFU Ly엶`'A=bvDX洫a AcE>$)ySrOU@#m݅ XӦg uђMw,auC֨ !]ﯓKAFOi+_hh'B k#UEBu0c^)M/{0#ALn:F~fR6Yw\U).U鉾hvԒVu"CatO-Gz~ NH iS= >:懻N#eTCB+@#)2sx:[}Gԇ- ^}&t7fc334ca1fbf2ea7f67d4937c4bbd40654aef88866c8ef5d571ead36e9e5496977d2fd1e33cc5ac7b38632afa98684d032b6dd9fH3!y덏%!E/֡as !E/֡+DPH؁Њ"ջۍRe,dӼQn*\D7m9ӦXh}bIWVQn{B3vA|Fa~_ˡLtoIlSUFK$JB KnFPE P Z !@ZSv+&0q}F~.|Jc8xN2Z)m˷Ҳ`.sş>p:L?<d 2 U           $ ,  T   h   |    n  x   8 `(38<9@:G H I XY\h ] ^bdeflt uH vp8Catomic-queue-devel00.1.20211022git7013a8b.el8Development files for atomic-queueC++14 multiple-producer-multiple-consumer lockless queues based on circular buffer with std::atomic. The main design principle these queues follow is minimalism: the bare minimum of atomic operations, fixed size buffer, value semantics. These qualities are also limitations: • The maximum queue size must be set at compile time or construction time. The circular buffer side-steps the memory reclamation problem inherent in linked-list based queues for the price of fixed buffer size. See Effective memory reclamation for lock-free data structures in C++ for more details. Fixed buffer size may not be that much of a limitation, since once the queue gets larger than the maximum expected size that indicates a problem that elements aren’t processed fast enough, and if the queue keeps growing it may eventually consume all available memory which may affect the entire system, rather than the problematic process only. The only apparent inconvenience is that one has to do an upfront back-of-the-envelope calculation on what would be the largest expected/acceptable queue size. • There are no OS-blocking push/pop functions. This queue is designed for ultra-low-latency scenarios and using an OS blocking primitive would be sacrificing push-to-pop latency. For lowest possible latency one cannot afford blocking in the OS kernel because the wake-up latency of a blocked thread is about 1-3 microseconds, whereas this queue’s round-trip time can be as low as 150 nanoseconds. Ultra-low-latency applications need just that and nothing more. The minimalism pays off, see the throughput and latency benchmarks. Available containers are: • AtomicQueue - a fixed size ring-buffer for atomic elements. • OptimistAtomicQueue - a faster fixed size ring-buffer for atomic elements which busy-waits when empty or full. • AtomicQueue2 - a fixed size ring-buffer for non-atomic elements. • OptimistAtomicQueue2 - a faster fixed size ring-buffer for non-atomic elements which busy-waits when empty or full. These containers have corresponding AtomicQueueB, OptimistAtomicQueueB, AtomicQueueB2, OptimistAtomicQueueB2 versions where the buffer size is specified as an argument to the constructor. Totally ordered mode is supported. In this mode consumers receive messages in the same FIFO order the messages were posted. This mode is supported for push and pop functions, but for not the try_ versions. On Intel x86 the totally ordered mode has 0 cost, as of 2019. Single-producer-single-consumer mode is supported. In this mode, no read-modify-write instructions are necessary, only the atomic loads and stores. That improves queue throughput significantly. The atomic-queue-devel package contains libraries and header files for developing applications that use atomic-queue.as buildvm-x86-28.iad2.fedoraproject.orgГFedora ProjectFedora ProjectMITFedora ProjectUnspecifiedhttps://github.com/max0x7ba/atomic_queuelinuxx86_64_- ) 61A큤A큤A큤ararararararas aras ar4e17f3f3f936ab61ab061f9e723221796a17e353590699d48f46b2d413e4866a7e7de2fdec4106ac66f8825daff6bdf841f567990c9007952faff42ab6355b5a112fdf338e9da19f510eb8ec1fa656d31a78f4677087f4ce8d0ea40f868acc34b9edde59c8ed92cc41ad26e906c3a3698b0fb69c809300aab5b02b73c4bca08cb59cdcfa39502f5277a7664a503d7202e61549ebbad9db474d0269de2fdffe1957dd38a2b7ce18b68b3349f295925899b33319e9b752d49c963e3f5edc665cb722e4fce4f072000d810546875f26ad1e8b23fcb942fe0a00c85602eb3626c1bbrootrootrootrootrootrootrootrootrootrootrootrootrootrootrootrootrootrootrootrootatomic-queue-0-0.1.20211022git7013a8b.el8.src.rpmatomic-queue-develatomic-queue-devel(x86-64)atomic-queue-static    rpmlib(CompressedFileNames)rpmlib(FileDigests)rpmlib(PayloadFilesHavePrefix)rpmlib(PayloadIsXz)3.0.4-14.6.0-14.0-15.2-14.14.3aBenjamin A. Beasley - 0-0.1.20210816gitaa08199- Initial package for EPEL8 0-0.1.20211022git7013a8b.el80-0.1.20211022git7013a8b.el80-0.1.20211022git7013a8b.el8atomic_queueatomic_queue.hatomic_queue_mutex.hbarrier.hdefs.hspinlock.hatomic-queue-develREADME.mdatomic-queue-develLICENSE/usr/include//usr/include/atomic_queue//usr/share/doc//usr/share/doc/atomic-queue-devel//usr/share/licenses//usr/share/licenses/atomic-queue-devel/-O2 -g -pipe -Wall -Werror=format-security -Wp,-D_FORTIFY_SOURCE=2 -Wp,-D_GLIBCXX_ASSERTIONS -fexceptions -fstack-protector-strong -grecord-gcc-switches -specs=/usr/lib/rpm/redhat/redhat-hardened-cc1 -specs=/usr/lib/rpm/redhat/redhat-annobin-cc1 -m64 -mtune=generic -fasynchronous-unwind-tables -fstack-clash-protection -fcf-protectioncpioxz2x86_64-redhat-linux-gnudirectoryC++ source, ASCII textASCII text, with very long linesASCII texthttps://bugz.fedoraproject.org/atomic-queueutf-846434584a990a81f02068198f2b71a8f1894abe95acc39add93e029baacc62f4?`7zXZ !#,/6] b2u jӫ`(y-#&Bdٚ3ÖiJtQ@Ko?eᶦqS]w/^%Kj_3D %ľ-Se(|y-G. @6&w)&b?pŅ#yT3 j`K P3l:Hʅ,M!T$z:I"ruB^*>X %A ib}R FA L`[+s.#|*'%MoMOr5< LwjJ*r,1oz)AHyIԐǝ] Ņ[f G9陹3&>YK OZ ::[jG+0 pt{מYD$qFlŠ yo$ $MEQπm7xr ׬D R(w 4;E}J%:=&5wB N%*9k0[%Dqs \]̅u3ѣdxaAT/sFH^< i0G7%R-'A}!{Ȫ'*tBlNDoQ!d;RiRhƛ^\rk͎nN^99~g&yfQ97jN<BBΘ]ՃG\YwwJ<+#>,/K {-roiY4ۊ3WYRɏH9شbHG&֏b1P^ZK9?,Pf\QmG ꞪI]6ll@*-/XNu-%u r"(1'R7 g[2&AM.OP^_gNs 0&* E7 5`Ɯ2TNO^yr$̻x+USn`m8fԽC!Sg\[$$\Qk :$kJQw=|h")'^НbwAYHr8(c۝#l[]a<(. !YDt !ȩg\h,V?b̻&-Ҝ|WQ-Y G\*_\"+~Oʓ۩* ;!Rc-h\ N55LˊT΁`&?JRP,~rA]a#ĢM<iFt Xߕ/osAل"CTk !{5A{끐HY|9G 0:qU.A!lBFwG\Ѷ,se}h6+wp.D}_}Օg&٢'_V2g#QѫR:i&3+~tdlA9zKSq6yE^m?"EL:3! ُBjd1:ЍBKܚ~s3!OG{ =,^&aV6LdW{s^ӂ?IGf67m $ރF(6Uy1[h!r1؍r24x Sm[?S/c32q<-%ֿB&8Om,c#"n  , m R%0E!End JmNE0d-B~rC9F$b:9޲5C_idȝ2aʵ%@sԑ /צb5RR%ދzؠ*<#;n1%7[4}KY4}/#Ce5}.z󖶽Gi)Hۻ!`U~8ǵ`߬k^_屒)렙#3(g)=~ε]2/=7i&n׋H 6)t._$?G%7m6Pg5*.{u =ZՖS*Xnem{l;Xd8}e[ja:vZ%騋4c6(ꔡvM3q#4& ,~^zeBxkA)S:bu-cC/一~c:)`Zn՛E.m=q bXPwJ(әz:?حYy!wzV6(X, 7Wj ĎH ?)nk^tE S&5ρDBg!E_Teꖘt;ۢp.hcqfYLnx͞r#V,F!d@E!cs-h>z--J\<arEDz4l{?Hz[n1qbV]i݀ ^ܾDńv7=4X%ʟ6-j-uvM Oەg0Hyu?}Ur b@ˡm0);2@F;ߧ#.3&xZ)5 ]KaUݹxAH'Sh?dEG)VbyZhAOʪT|l㽼~xc^FL2 &KHhrG[_/Bf+ iÿp~;ۢ&px0QgҬ\eN4 )NfsuWz=Sg2qK>Z")k=Xw3 oru8LUHB9zδ}"lFtWU"oM_ux1@)ΘP[PWUHMOZjqc~C%4G8p:6(OQ~`h}Pmw1*o q@ߋz?;̳OsQ;xB__ "D1\`Xa?5n9aP ˥y,a `PO{2x _~ 2xLloI0*:SpLmM"]xg5 jP M@\HEsU}Fw{] ϲpNg煩#MD"ָoᷘ| -L2ٙ0åɩynM S.W%'K 6\IEʐ6ʋ·13H%%E~C\P䖵KKQr^s6A #yV]To[)YO=Ƞ:Iϻ2f2_@[Ti7 94 %y?6nw4jp'RZ3}2p(eMMJWMPDC6Kui ֲf Lh`3cy<xB`Q I{ !]vg R6- co={/Rm.2y#&1DNConmG9ca tWFQOAHO].yZ\zU 8ss<+N~;*~dq|mC$ε`&a9rB6' ġ?@(UӅpf]1+|3`H:]Lȅ}Ɓ8L\~8uS Nˌ dWeG G#_&$34 t.'"j./JvV8,Sɲ6XN PXq:Z8yzrz2(btrq@_(JW];73݇ Ӿ|W-#iOZ7 'דnE[imVQ%U\s )f 917xeog2,+? M 0d: E,gMw,'iM`LWF h&J,MxL%R) &$]-dȐĢ nS莺$ 0r<݅3{z)FnizWHܧԠz98+ -;.eE]4c1iBN=cVgv"ƭP c;B evy<ɳG>h)-x0EiZ΁hʖ b';C>$QPy"fq[m>vƦw2h-W\%I+LÝs 3"M;οtGl|qG>VC#hdZ]pY-lɜqP3Wo*ݽjމtObf5mjk϶Qv@~7ߪkͧ(iw2T9=镡5^_QBbԬ6>%QO2Ã'"t{{q&+-[!CpOzﰒ-2.~.y%EPH-U7,*h0U#_̮fb0ȷW+q$ޗ|aj0m 6`܏U&j&,A͜yq n G7AJ0x(}@hc Jk"ᄛ%~0u7ck)r^V9W+E$F"}/;͝N HE-?LfԻD 15..oG Ў~it4a#{4~Qa{"?hǸ0K%p}\WJq@Oal>PQad٘+TDFJ>_SUXOLԨ)lVSLeAACD$K Ӏf;wٯGEyNk;'oKWS?S+y2o9/o;h<@.?BfVQRk̡Q3u٥,И.+f 6o*' h7q]j4'TLѓαhJX`:i9kRvks|/y+pb?o*>aj:'As`uκM0 w ͤw2jcR1~@nj) +wۓUuB0Ⱦ{G&8p eftbgO'}v\g~D.^6I"ğGʕ3)_ͽzFC1q*``xP>zH/bw0vytƩx{"꽌?_oĠf󧴼 L)5sMڭ0xi 6&HėnlsMDw(s+`">gIXM LݙgaBJrAwĜB(̙;h0wƟ SwA9 . u$7 4,)td:Y>{FQiGc@m*9 ; }dgR,&ϔ>C{I,JhMԷQ`Ğ(Ӻ*t#eѿ$<>Qpi<+GǮ-d2 ؁Cլ5J47~ 'Gk|{ &|/F 2:MLy}E۰# WJ[k9]됏[]z~8޺.Q^W,G30E(o> =__)B$¡kzE[R z{4f6K_;" gM-@n"kmT 4EA4 ?Hch\{ +X}i!hc~7`7 6TÄeD8&N~QmS8:- N޺_/(HA\(K@xv|W;4m66[pXgcwF]ɠMCScE4:_C@ B_v ?PIc'ÍbNJJ"`B󜞳ԱyϠЍ$R*9[>88Igl)"mD$hw u]WZ[{/+u *.rB\zՀ,WX^x Z1nn!p.Āo ^8Ֆo W.ۢva* E4Nza[zlȺ8ϖM2h>W¨jyj8hjB*NuQL AgdrlR8:=c7}U I+m%^>KSg-![&ڟh4}--`<e) ^Kǩ)TRȿnW1|(oK2bX0TI l]qŜK^m2> MwO<}q  ':aEF^oxyfҖLOw'Ql!*q\jZ>kqCԓi@x_^VYi YZ