Files
archy/core/target/debug/deps/libsmallvec-445f50e307365817.rmeta
T

200 lines
111 KiB
Plaintext
Raw Normal View History

2026-01-24 22:59:20 +00:00
rust
#rustc 1.93.0 (254b59607 2026-01-19)Á³VOÐêùÿ²?ÑL¼§Ì±-a7a40eb546f9e2b0Áá\ƒ¦è3$|]åŒ[IÚ tæ-14b12edc9f8cd90bÁë&Gf·Ã ¬ëñq:¤»b-bb76018b1173caf6Á"à$é!<ï!writeÁ<ù!Œï!Ìè!testsÁ,¨"à$"MallocShallowSizeOfÁœÄ&<&malloc_size_ofÁ„œ&Ô’& MallocSizeOfÁdÙ&8¤(&(MallocSizeOfOpsÁ|ç&_¤OMO DeserializeÁ\ª'<€'serdeÁ<Š'Œ€' DeserializerÁd·'/¦(&( SeqAccessÁLÅ'P¦IGIVisitorÁ<Ð'o¦hfh SerializeÁLä'¦ SerializeSeqÁdï'´¦­«­
SerializerÁTý'Ö¦ÏÍÏ PhantomDataÁ\º(<”(¦<ž(Œ”(ioÁë(<Î(Ð<Ø(ŒÎ( ManuallyDropÁd£)<ö(drain_keep_restÁŒ€)Üö( DrainFilterÁ\Ùm<õk drain_filterÁtÿkÄõk SmallVecDataÁd± <— C<¡ Œ— SmallVecVisitorÁ|¡<†¦<Œ†SpecFromÁD£Œ<€Œý„ŠŒÔ€Œýt<ïŒý„ùŒÔïŒ arbitraryÁLÃ嬧
impl_arrayÁT“å<èä„òäÔèääçä
BorrowDecoderÁl¸ð<…ð impl_bincodeÁtðÄ…ðDecodeÁ4Çð4á%"$<ÏðMá>;=ReaderÁ4Þðlá]Z\EncodeÁ4ñðá|y{<ùð¤áWriterÁ4‰ñÃá´±³ DecodeErrorÁ\žñçáØÕ× EncodeErrorÁ\«ñ áýúü BorrowDecodeÁd½ñ1á#!$³á 
  
 !smallvecÁsmallvec_inlineÁdebug_unreachableÁExtendFromSliceÁ((extend_from_sliceÁ++
.Í0ï
infallibleÁ2 layout_arrayÁ44 
deallocateÁ7DrainÁ9'aÁ99
tail_startÁ9tail_lenÁ9£ 9œ@¬@@ÍD¬DG¬GJ¬JJ½J¥ N J size_hintÁQ¬QQ next_backÁT V¬VV¾  Z¬Z
]¬]]²»aaInlineÁc
cìaHeapÁf÷ f¾  iiÍi i
from_constÁm  oÌoþo
inline_mutÁo from_inlineÁo into_inlineÁoheapÁoheap_mutÁo from_heapÁ
xÌzÌSmallVecÁ|Ì|capacityÁ|dataÁÌ 
with_capacityÁfrom_vecÁfrom_bufÁfrom_buf_and_lenÁfrom_buf_and_len_uncheckedÁset_lenÁinline_capacityÁ inline_sizeÁ¾ is_emptyÁÍtripleÁ
triple_mutÁspilledÁdrainÁpushÁpopÁappendÁgrowÁtry_growÁreserveÁreserve_one_uncheckedÁ try_reserveÁ
reserve_exactÁtry_reserve_exactÁ
shrink_to_fitÁtruncateÁas_sliceÁ as_mut_sliceÁ swap_removeÁ£ clearÁremoveÁinsertÁ insert_manyÁ¨¨ DropOnPanicÁªªŒªíª¾ ¨¯¯²into_vecÁinto_boxed_sliceÁ
into_innerÁretainÁµ
retain_mutÁ·ûdedupÁ¹ dedup_byÁ»û dedup_by_keyÁ½û½½  resize_withÁÁûfrom_raw_partsÁ
as_mut_ptrÁÆÌÆ
from_sliceÁÆinsert_from_sliceÁÆ
ËÌËresizeÁË from_elemÁÏÌÏšÏÓÌÓÖÌÖÙÌÙas_mutÁÜÌÜborrowÁßÌß
borrow_mutÁâ¬âÌâïæÌæïéÌéïìÌìâìØìöñÌñâñ÷õÌõ
øÌøòúâüÌüextendÁþâ ÌÍ!ƒÌƒ>"̲#ÌÈË$̳Õ%Ì&̤ 'ÌÐ(Ì¢)ÌIntoIterÁŸÌŸÜŸcurrentÁŸÏ*¤Ì¤Í+§Ì§È,ªÌª²-­Ì­½­¥ ­Ë.²Ì²í/µÌ0·Ì1¹Ì¹ê¹ú2½Ì½â½½½Š 3¬ÂÌÂ⽊ 4ȬÈÌÈâȽȊ ArrayÁνÎè SetLenOnDropÁѬѾ Ñ local_lenÁ5Õ¬Õ ÕgetÁÕ
increment_lenÁ6Ú¬Ú²7ÝÝÍÝ Ý Ýâ Ýfrom_const_with_len_uncheckedÁä 8ææÍæ æ½æè
ToSmallVecÁìÌì to_smallvecÁ9ïÌïï$ ConstNonNullÁò
òòì:öö ö;úúÈ<ýCollectionAllocErrÁÿCapacityOverflowÁ
ÿAllocErrÁlayoutÁ=Í*
*
-
-
/
/
/
C
C
C
N
P
T
Y
`
q
r
u
v
ˆ
Š

Œ

Ž







˜

š

œ

ž
Ÿ
 
¡
¢
£
¥
¦
§
¨
±
µ
µ
·
·
¹
»
»
»
½
½
Á
Ä
Å
È
É
É
Ê
Ê
Í
Ò
Õ
Ø
Û
Þ
á
ð
ô
÷
÷
þ



ˆ

Œ
Œ




˜
˜


¦
¦
¦
©
¬
°
±
´
»
¼
Ø
Ù
Ü
î
ñ
ü



ì(ßAßA­âAbufÁ«<ãA¾ «<µ[<™é•E•EEGlobalÁ Ï€ûkW¬ s¼,à`ÿ“&°&ƒÀ&h¹OZ[tå`÷,ú÷,¦Í¦Í§Í LayoutErrorÁ r«=Ù|³Óà`99 <¼=Í>£ ?œwúýCu¬ÿ-¨âÿ-ÞKÿ-òJÿ-©Kÿ-ÖNÿ- ÿ-¨âacdÔeìfìg÷ h¾ ñÚÒ"¯K½iÌ¡/ ªªë¬Œ­í®¾ ´š,ö”¼,ì||·~ÍÜj4^çì/ùÏ0ñÏ0
ì/ÏôÏ0™1¦Ï0™1©Ï0™1ú||·~ÍÜj4^çÌ ¬
…2ÏúÏ0ßAßA­âA“+«<ãA¾ «<µ[<™éš1Â,úÏ0ì/¦˜Ï0âÏ0þ2(Ï0š1ªJÏ0š1·JÏ0š1à`Ï0ÄÏ0 Ï0ÞÏ0žÏ0||·~ÍÜj4^ç³£Ï0ÉÏ0Ï0ÃÏ0»bÏ0¨âÏ0à`ŸŸâ¡Ü¢£Ï¥˜heÒ»Òì/Þß4 ß4ÞKß4òJß4©Kß4ÖNß4®JÏ0®J ¬Ò1®J ¬Ò1 ÑÑØ"Ó¾ Ôü"ƒêšÜƒ'1¬Î¼,Íì™1ì/Þòòó•%õì Yˆ„µý×¼,þô6+ßAõ|„ÿ@9€Ÿ.ÿ0ÿâ|D9zaG9xa|J9­ŸQŸVŸZŸ]ªŸÚÑÏ|‰Ÿúò|‘|“|–|™
È
æï ýò(Àà` å`ú¨â
ÞKòJ ©K ÖN   ì ùñô¦©¦˜ªJ·JÄÞž£Éûb®JÎìþ4ð± äÛ±
a×6 ö±ý±mü˜±eacdÔeìfìg÷ h¾ ñÚÒ"¯K½i×6$̱ÒÒ MaybeUninitÁÒuninitÁüÒ˜ügÇ@ÇeÉR×64¬±À<þÑü´Ù/¬ÍÙ
œÍÙ
×6-;
BÄ´Ù
m¼,ÍWi âÙüþØp
|×6 ŸÙ íÙôÙáüÓØ¡||·~ÍÜj4^ç×6$ïØë;À< ]ü«Ý1¼ÄÝ,ÕÝ 
$„ÄÝ
×65G ÚÝ^
eÄ«Ý>o ÛÝüõÜr
|×6 –ÝÜ>Í æÝíÝü¼Ü±â‹?$æÜ×6,ÔÜë;À<þ×6üitemsÁ(ZÜ>Í¥â ü¼â1¼Õâ,æâ 
$„Õâ¤@/A ëâX
_ļâ>i| ìâü„ât
|×6 ÷â þâü¥áÙä‹?$õá×6,×áÜ>æáÜ>ë;À<×6ÿ@7¾ :v4í¬
aì/d'¡/2ÒÒÌ;Òá;üÒ˜ügÇ@ÇeÉRì/v}´õì
ò¼,ó)ô64Îà óîÁ üæ«é¼,ho(2479a|ŸÎÑìòóÿ³á,×!Å4Ø"”Í LayoutErrÁLà"²BoxÁþ"œ#«< œ ­™#ßA
g4²#¦ hLº#©
ÐÐ#Íß#Á]¦$õ#»b¦Ábª4û#Ãbunreachable_uncheckedÁ¬”$ ¸ repeatÁ4¼$ ôHŸdÄ$ªJ£lÒ$ÖN²dá$®JmemÁú$ÕÌ;\Ž%ÒÞ $«%Áæ,±%Θç\¸%§!÷ $Ö%ê Î<Ü%!î$ø%ªc#Tþ%§h$¸ D¢3%Ç |Ç@&ü­©‹ü­b_ Small vectors in various sizes. These store a certain number of elements inline, and fall backÁü^[ to the heap for larger allocations. This can be a useful optimization for improving cacheÁüï\Y locality and reducing allocator traffic for workloads that fit within the inline buffer.ÁÌ˼Р## `no_std` supportÁèËüìKH By default, `smallvec` does not depend on `std`. However, the optionalÁü¸NK `write` feature implements the `std::io::Write` trait for vectors of `u8`.Áü‡>; When this feature is enabled, `smallvec` depends on `std`.ÁÆËÄÊ ## Optional featuresÁãË ### `serde`Á÷Ëüû^[ When this optional dependency is enabled, `SmallVec` implements the `serde::Serialize` andÁüÚ  `serde::Deserialize` traits.ÁûË|ÿ ### `write`ÁËü“\Y When this feature is enabled, `SmallVec<[u8; _]>` implements the `std::io::Write` trait.Áüð>; This feature is not compatible with `#![no_std]` programs.Á¯ Ë ### `union`Áà ËüÇ (% **This feature requires Rust 1.49.**Áð Ëüô [X When the `union` feature is enabled `smallvec` will track its state (inline or spilled)ÁüÐ
\Y without the use of an enum tag, reducing the size of the `smallvec` by one machine word.Áü­ MJ This means that there is potentially no space overhead compared to `Vec`.Áüû _\ Note that `smallvec` can still be larger than `Vec` if the inline buffer is larger than twoÁ”Û  machine words.Áî Ëüò [X To use this feature add `features = ["union"]` in the `smallvec` section of Cargo.toml.ÁüÎ
.+ Note that this feature requires Rust 1.49.Áý
ËüZW Tracking issue: [rust-lang/rust#55149](https://github.com/rust-lang/rust/issues/55149)ÁÜËÄà ### `const_generics`ÁùËüý(% **This feature requires Rust 1.51.**Á¦Ëüª`] When this feature is enabled, `SmallVec` works with any arrays of any size, not just a fixedÁ”‹ list of sizes.ÁžËœ¢ ### `const_new`ÁËüº(‡ZãËüç³ This feature exposes the functions [`SmallVec::new_const`], [`SmallVec::from_const`], and [`smallvec_inline`] which enables the `SmallVec` to be initialized from a const context.ÁÄž For details, see theÁü·ZW [Rust Reference](https://doc.rust-lang.org/reference/const_eval.html#const-functions).ÁË´– ### `drain_filter`Á­Ëü±fc **This feature is unstable.** It may change to match the unstable `drain_filter` method in libstd.Á˜Ëüœ\Y Enables the `drain_filter` method, which produces an iterator that calls a user-providedÁüù\Y closure to determine which elements of the vector to remove and yield from the iterator.ÁÖËÌÚ ### `drain_keep_rest`ÁôËüøif **This feature is unstable.** It may change to match the unstable `drain_keep_rest` method in libstd.ÁâËüæ0- Enables the `DrainFilter::keep_rest` method.ÁËÄ› ### `specialization`Á´Ëü¸TQ **This feature is unstable and requires a nightly build of the Rust toolchain.**ÁËü‘]Z When this feature is enabled, `SmallVec::from(slice)` has improved performance for slicesÁüï^[ of `Copy` types. (Without this feature, you can use `SmallVec::from_slice` to get optimalÁüÎ" performance for `Copy` types.)ÁñËüõZW Tracking issue: [rust-lang/rust#31844](https://github.com/rust-lang/rust/issues/31844)ÁÐË¤Ô ### `may_dangle`ÁéËüíTícÂËüÆ_\ This feature makes the Rust compiler less strict about use of vectors that contain borrowedÁü¦$! references. For details, see theÁüËYV [Rustonomicon](https://doc.rust-lang.org/1.42.0/nomicon/dropck.html#an-escape-hatch).Á¥Ëü©ZW Tracking issue: [rust-lang/rust#34761](https://github.com/rust-lang/rust/issues/34761)Á(2479a|ŸÎÑìòóÿ³[á\Å[”ÍÑFQ²íFMœL«< œ^ ­LßA
gK¦ hJ©
ÐIÍHÁ]¦G»b¦YÁbªGÃb¼H1 ¸ äH* ôHŸ)ªJ£(ÖN²'®J¶I#ÕÌ;"ÒÞ !Áæ Θç§!÷ ê Î!îªc#§h$¸ %Ç &|´Æ!yüÉ"!qtZ]Œð"N´‡#BED”#(ü£#!!LÊ# LÙ#ýÔè#ñôÒÕüˆ$!µü¯$?¤§šŠ}Lô$q´ƒ%eüŸ%%Y¥%MP?BÔÊ%6Ð%*-üê%",ð%¬•3ü²)41 Creates a [`SmallVec`] containing the arguments.Áç)Ëüë)[X `smallvec!` allows `SmallVec`s to be defined with the same syntax as array expressions.ÁüÇ*&# There are two forms of this macro:Áî*Ëüò*@= - Create a [`SmallVec`] containing a given list of elements:Á³+Ë<·+ ```Áü¿+)& # use smallvec::{smallvec, SmallVec};ÁŒé+ # fn main() {Áüû+30 let v: SmallVec<[_; 128]> = smallvec![1, 2, 3];Áį, assert_eq!(v[0], 1);ÁÄÈ, assert_eq!(v[1], 2);ÁÄá, assert_eq!(v[2], 3);Á<ú, # }Á<-¸sŠ-ËüŽ-:7 - Create a [`SmallVec`] from a given element and size:ÁÉ-Ë<Í-¸süÕ-)ÈsŒÿ-ùsü‘.30 let v: SmallVec<[_; 0x8000]> = smallvec![1; 3];ÁüÅ.1. assert_eq!(v, SmallVec::from_buf([1, 1, 1]));Á<÷.®u<ÿ.¸s‡/Ëü‹/HE Note that unlike array expressions this syntax supports all elementsÁüÔ/KH which implement [`Clone`] and the number of elements doesn't have to beÁ| 0 a constant.Á°0Ëü´0NK This will use `clone` to duplicate an expression, so one should be carefulÁüƒ1JG using this with types having a nonstandard `Clone` implementation. ForÁüÎ1OL example, `smallvec![Rc::new(1); 5]` will create a vector of five referencesÁüž2RO to the same boxed integer value, not five references pointing to independentlyÁœñ2 boxed integers.Á&|…3¯ «3 Ô7 æ3 ó3 ç38oneÁè3, ì38 í3& î38ï$ï3*õ3 ø3 ÿ37í4ù3% €4 †4 ‡4*‰4 Œ4 ²4, 48,—4'œ48·Dž4'¦48 ¨4 «4 ¬4% ³4 ¹4 Í4 , º48elemÁ$»4& ¿48ï$À4% Ä4, Æ48 Ç4& È48ï$É4*Ï4 Ò4 ‰5 Ó4 ˆ5, Ý48,Þ4'ã48·Då4'í48Lï4 ø4 5, ù48—~$ú4$ þ4, €58Æ~ 5% Š5 5 ¢5, 5 5 š5, “58Ñ| ”5& •58ï$5$ 5 œ5, 5 ž5  5$ Ÿ5- ¡5*¤5 §5 Ñ7 ¨5 Ð78²58Ã,¶5 ¼57ì4¾5, Å5 Æ5 ã5 Ç5, É58,Ê5'Ï58¸ DÑ5 Ù5 Ú5 â5 Û58¼|Ü5, à58Ñ| á5 ä5% å58ï58ó58œ÷5 û5, ý58,þ5'ƒ68·D…6'68 6 6 “6% ”68ž68Ã,¡6§68œª6 ­68\®6 ¹6 º6 ¼6 ô6, Ê6 Ë6 Ù68œÌ6 Ï68Ž$Ð6 Ô6 ×6, Õ68Ñ| Ö6% Ø6
Ú68œè68$ö6 û6 Ê7, ‰78,Š7'78·D7'™78D7 £7 À7, ¤78,¥7'ª78á,¬7'±78œ³7 ¶7 ·7 ¿7, ¸7 ¹7 ½7, º78Ñ| »7$ ¼7 ¾7% Ò7äº@ü×7nk Creates an inline [`SmallVec`] containing the arguments. This macro is enabled by the feature `const_new`.ÁÆ8ËüÊ8vs `smallvec_inline!` allows `SmallVec`s to be defined with the same syntax as array expressions in `const` contexts.ÁüÁ9ZW The inline storage `A` will always be an array of the size specified by the arguments.Áüœ:&«rÃ:ËüÇ:@årˆ;Ë<Œ;¸sü”;0- # use smallvec::{smallvec_inline, SmallVec};ÁŒÅ;ùsü×;<9 const V: SmallVec<[i32; 3]> = smallvec_inline![1, 2, 3];ÁÄ”< assert_eq!(V[0], 1);ÁÄ­< assert_eq!(V[1], 2);ÁÄÆ< assert_eq!(V[2], 3);Á<ß<®u<ç<¸sï<Ëüó<:Ôu®=
Ì.( ¦K(
*ù Ì.$«Kî ,±Kü×K,,,©â¼, ÜKÞ¼,,ßK€,-*- üŠL,ŒLˆ ˆ€, 
¼,+ ŸL+
-¼,$¤Lî ,ªLü½O(÷,/æ`/üìO8ïOŠŒ Š÷, Á`Á`œÃ`è Á]Ä`“+Á]Ê­\É:•Œê³í³î³Òï³ìð³ñ³ò³ìäs{©¶ѼѼÒ¼ štÀ.. óO.
/$ôOþ úOü÷P+÷,1ü1ì©Q$¬QÅ-÷,00
1 ±QüÿQ<TRê³í³î³Òï³ìð³ñ³ò³ìäs{©¶¼,÷,¼,33˜£ R
2¼,Û
4Rü©UBd¬UÜ>ê³í³î³Òï³ìð³ñ³ò³ìäs{©¶”Í”ÍÅ•Íè–ÍܑʂÿÙ€’÷,55˜£ ¹U
4¼,Æ~ ¼U·W4<closure_kind>Á6<closure_signature>Á6<upvars>Á6646¼,Å-÷,üäW9TîWÄFÜ>88˜£ ùW
7¼,÷ üWÍDXü‹[#üÛYRO An iterator that removes the items from a `SmallVec` and yields them by value.Á®ZËü²Z)& Returned from [`SmallVec::drain`][1].ÁÜZËüàZ*' [1]: struct.SmallVec.html#method.drainÁ,[¬:;:;…¡  [Ì.¬£[ÎÌ.,¨[Ì.Ϭ§^ÿ-wúýCu<=>?`œ[Y[:Œµ[Tµ[99Ü>|Ì[DÌ[99Ü>ôá[$á[99ÙiÙiIterÁÜi÷ ®iÝi
end_or_lenÁ®iÞi_markerÁ®it¸%ýN(¬†¯Ì…\…\99Îà óîÁ üæ«é||·~ÍÜj4^çÌ.ü£\R¬ABAB…¡ ¬\箯\õ®,´\à`†¯Tê\ÿ-Cá`C¨\68Aüü\8ÿ\Ž ÿ- ŽÁ`Á`œÃ`è Á]Ä`“+Á]Ê­\É:•Ú¥@ ƒ]@
C¬Ì.$„]þ Š]ü…^6¬EFEF…¡ •^Ì.$˜^õ®,Ÿ^ÿ-^$&ü¿^6¬HIIH…¡ Ï^¨âÌ.$Ò^õ®,Ù^ÿ-Ë^%'üú^1¬KLKL…¡ ƒ_箆_õ®,‹_ÿ-MNPßKàKäKPNÿ^57KL²_$·_JJ†¯üÚ_%$Ý_ ÿ-ø°ú°û°Ðü°ý°þ°ìHˈXêE>†¯J â_J
N¬Ì.$ç_\¹`N†ªOžªO»ªOONOÌ. †¯†¯üÿ`-L‚a ÿ-Ü>ø°ú°û°Ðü°ý°þ°ìHˈXêE>Ü>J ŒaJ
P¬Ì.$aüÖa<¬RSRS…¡ ßaç®âaõ®,çaÿ-TóJTÛa&(Rü§b*Lªb ÿ-„·Q ´bQ
T¬Ì.$¹b\cT†ªUžªU»ªUUTUÌ.ŸüÆc5¬WXXW…¡ Ïcõ®,Òcÿ-YªKYËc ´d“d ÿ-Ü>V —dV
Y¬Ì.$˜düÊd1¬[\[\…¡ Ódõ®,Ödÿ-Ïdü€e-¬^__^…¡ ‰e箌eõ®,‘eÿ-` `…e&(^”´e$·e ÿ-] ¼e]
`¬Ì.$ÁeÜˬ»®¬ ±¬ Ȭ8Æ ²¬ µ¬ Ǭ8<¶¬ ¾¬7C<À¬ô¬¬dЬÌbb©âì/ ݬÎì/,ଡ/ñÚÒ"¯K½icdfde·E¡/ghAC""aa
dì/""·E¡/aa²Átô¬aa·E$Ô­aa¡/¬®¯®¯aaÎà óîÁ üæ«éš1TͯͯaaÜ>üž°,»å¯ è¯ ›°8àé¯ ì¯ š°8Æ í¯ ð¯ ‚°8<ñ¯ ù¯7C<û¯$ ƒ°8<…° °7ÓŽ\°üã¯:jÍkkj˜£ £°ÍÜ>t¦°ë;m ¬°Ü>ü˜±8T¡±À<ë;ii>þô ²»ƒ² †² ²8Æ ‡² в œ²8<‹² “²7C<•²ô²ÌppÃÀ ¥²ÔÀ,¨²¡/qrstuvw!üÓ²04ݲ ¡/òòó•%õì Yˆ„µýך1o ä²o
qì/$å²üÅ´3TÏ´ ¡/¶Âo Ú´o
rì/$ß´ü·¶9\º¶·E¡/oo
sì/þ4ƶü°·-\º·¡/·Eoo
tì/$Æ·üè¸7$ò¸ ¡/•ÇÜ>o ÷¸o
uì/$ø¸ü˺?DÕº˜ ˜¡/¶Â ˜Ü>o Þºo
vì/$ãºü§¼BLª¼¶ÂÜ>¡/oo
wì/÷ ´¼¾ ˼ü½5ÌyyÃÀ ©½ÔÀ,¬½¨âì/$´½¡/"$üÖ½5Ì{{ÃÀ â½ÔÀ,å½ì/$í½¡/!#ìÊÆü¾LI A `Vec`-like container that can store a small number of elements inline.ÁݾËüá¾[X `SmallVec` acts like a vector, but can store a limited amount of data inline within theÁü½¿`] `SmallVec` struct rather than in a separate allocation. If the data exceeds this limit, theÁüžÀWT `SmallVec` will "spill" its data onto the heap, allocating a new buffer to hold it.ÁöÀËüúÀc` The
elements.ÁÁÏËüÉÏQN Will create a heap allocation only if `n` is larger than the inline capacity.ÁŸÐË<§Ð¸sì³Ð # use smallvec::SmallVec;ÁÕÐËüÝÐ<9 let v: SmallVec<[u8; 3]> = SmallVec::with_capacity(100);ÁžÑËÔ¦Ñ assert!(v.is_empty());ÁüÅÑ! assert!(v.capacity() >= 100);Á<ëѸslŒÒÜ>Ï0
ƒì/Æ~ šÒüªÖ5ü„Ó52 Construct a new `SmallVec` from a `Vec<A::Item>`.Á¾ÓËüÆÓ`] Elements will be copied to the inline buffer if `vec.capacity() <= Self::inline_capacity()`.Á«ÔË\³Ô¦›ÜÃÔ™ÒãÔËüëÔ" let vec = vec![1, 2, 3, 4, 5];Áü’Õ>; let small_vec: SmallVec<[_; 3]> = SmallVec::from_vec(vec);ÁÕÕËüÝÕ.+ assert_eq!(&*small_vec, &[1, 2, 3, 4, 5]);Á<Ö¸sD±Ö§2Ï0
ì/œ¾ÖüÊá&üõÞ@= Constructs a new `SmallVec` on the stack from an `A` withoutÁ¬ºß copying elements.ÁÔßË\Üߦ›ÜìߙҌàËô”à let buf = [1, 2, 3, 4, 5];Áü·à96 let small_vec: SmallVec<_> = SmallVec::from_buf(buf);ÁõàËüýà.Ðà<°á¸sDÑáì/Ï0