deno.land / x / deno@v1.28.2 / core / async_cell.rs

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
// Copyright 2018-2022 the Deno authors. All rights reserved. MIT license.
use std::any::type_name;use std::any::Any;use std::borrow::Borrow;use std::cell::Cell;use std::cell::UnsafeCell;use std::collections::VecDeque;use std::fmt;use std::fmt::Debug;use std::fmt::Formatter;use std::ops::Deref;use std::rc::Rc;
use self::internal as i;
pub type AsyncRef<T> = i::AsyncBorrowImpl<T, i::Shared>;pub type AsyncMut<T> = i::AsyncBorrowImpl<T, i::Exclusive>;
pub type AsyncRefFuture<T> = i::AsyncBorrowFutureImpl<T, i::Shared>;pub type AsyncMutFuture<T> = i::AsyncBorrowFutureImpl<T, i::Exclusive>;
pub struct AsyncRefCell<T> { value: UnsafeCell<T>, borrow_count: Cell<i::BorrowCount>, waiters: Cell<VecDeque<Option<i::Waiter>>>, turn: Cell<usize>,}
impl<T: 'static> AsyncRefCell<T> { /// Create a new `AsyncRefCell` that encapsulates the specified value. /// Note that in order to borrow the inner value, the `AsyncRefCell` /// needs to be wrapped in an `Rc` or an `RcRef`. These can be created /// either manually, or by using the convenience method /// `AsyncRefCell::new_rc()`. pub fn new(value: T) -> Self { Self { value: UnsafeCell::new(value), borrow_count: Default::default(), waiters: Default::default(), turn: Default::default(), } }
pub fn new_rc(value: T) -> Rc<Self> { Rc::new(Self::new(value)) }
pub fn as_ptr(&self) -> *mut T { self.value.get() }
pub fn into_inner(self) -> T { assert!(self.borrow_count.get().is_empty()); self.value.into_inner() }}
impl<T> Debug for AsyncRefCell<T> { fn fmt(&self, f: &mut Formatter) -> fmt::Result { write!(f, "AsyncRefCell<{}>", type_name::<T>()) }}
impl<T: Default + 'static> Default for AsyncRefCell<T> { fn default() -> Self { Self::new(Default::default()) }}
impl<T: Default + 'static> AsyncRefCell<T> { pub fn default_rc() -> Rc<Self> { Rc::new(Default::default()) }}
impl<T: 'static> From<T> for AsyncRefCell<T> { fn from(value: T) -> Self { Self::new(value) }}
impl<T> AsyncRefCell<T> { pub fn borrow(self: &Rc<Self>) -> AsyncRefFuture<T> { AsyncRefFuture::new(self) }
pub fn borrow_mut(self: &Rc<Self>) -> AsyncMutFuture<T> { AsyncMutFuture::new(self) }
pub fn try_borrow(self: &Rc<Self>) -> Option<AsyncRef<T>> { Self::borrow_sync(self) }
pub fn try_borrow_mut(self: &Rc<Self>) -> Option<AsyncMut<T>> { Self::borrow_sync(self) }}
impl<T> RcRef<AsyncRefCell<T>> { pub fn borrow(&self) -> AsyncRefFuture<T> { AsyncRefFuture::new(self) }
pub fn borrow_mut(&self) -> AsyncMutFuture<T> { AsyncMutFuture::new(self) }
pub fn try_borrow(&self) -> Option<AsyncRef<T>> { AsyncRefCell::<T>::borrow_sync(self) }
pub fn try_borrow_mut(&self) -> Option<AsyncMut<T>> { AsyncRefCell::<T>::borrow_sync(self) }}
/// An `RcRef` encapsulates a reference counted pointer, just like a regular/// `std::rc::Rc`. However, unlike a regular `Rc`, it can be remapped so that/// it dereferences to any value that's reachable through the reference-counted/// pointer. This is achieved through the associated method, `RcRef::map()`,/// similar to how `std::cell::Ref::map()` works. Example:////// ```rust/// # use std::rc::Rc;/// # use deno_core::RcRef;////// struct Stuff {/// foo: u32,/// bar: String,/// }////// let stuff_rc = Rc::new(Stuff {/// foo: 42,/// bar: "hello".to_owned(),/// });////// // `foo_rc` and `bar_rc` dereference to different types, however/// // they share a reference count./// let foo_rc: RcRef<u32> = RcRef::map(stuff_rc.clone(), |v| &v.foo);/// let bar_rc: RcRef<String> = RcRef::map(stuff_rc, |v| &v.bar);/// ```#[derive(Debug)]pub struct RcRef<T> { rc: Rc<dyn Any>, value: *const T,}
impl<T: 'static> RcRef<T> { pub fn new(value: T) -> Self { Self::from(Rc::new(value)) }
pub fn map<S: 'static, R: RcLike<S>, F: FnOnce(&S) -> &T>( source: R, map_fn: F, ) -> RcRef<T> { let RcRef::<S> { rc, value } = source.into(); // TODO(piscisaureus): safety comment #[allow(clippy::undocumented_unsafe_blocks)] let value = map_fn(unsafe { &*value }); RcRef { rc, value } }
pub(crate) fn split(rc_ref: &Self) -> (&T, &Rc<dyn Any>) { let &Self { ref rc, value } = rc_ref; // TODO(piscisaureus): safety comment #[allow(clippy::undocumented_unsafe_blocks)] (unsafe { &*value }, rc) }}
impl<T: Default + 'static> Default for RcRef<T> { fn default() -> Self { Self::new(Default::default()) }}
impl<T> Clone for RcRef<T> { fn clone(&self) -> Self { Self { rc: self.rc.clone(), value: self.value, } }}
impl<T: 'static> From<&RcRef<T>> for RcRef<T> { fn from(rc_ref: &RcRef<T>) -> Self { rc_ref.clone() }}
impl<T: 'static> From<Rc<T>> for RcRef<T> { fn from(rc: Rc<T>) -> Self { Self { value: &*rc, rc: rc as Rc<_>, } }}
impl<T: 'static> From<&Rc<T>> for RcRef<T> { fn from(rc: &Rc<T>) -> Self { rc.clone().into() }}
impl<T> Deref for RcRef<T> { type Target = T; fn deref(&self) -> &Self::Target { // TODO(piscisaureus): safety comment #[allow(clippy::undocumented_unsafe_blocks)] unsafe { &*self.value } }}
impl<T> Borrow<T> for RcRef<T> { fn borrow(&self) -> &T { self }}
impl<T> AsRef<T> for RcRef<T> { fn as_ref(&self) -> &T { self }}
/// The `RcLike` trait provides an abstraction over `std::rc::Rc` and `RcRef`,/// so that applicable methods can operate on either type.pub trait RcLike<T>: AsRef<T> + Into<RcRef<T>> {}
impl<T: 'static> RcLike<T> for Rc<T> {}impl<T: 'static> RcLike<T> for RcRef<T> {}impl<T: 'static> RcLike<T> for &Rc<T> {}impl<T: 'static> RcLike<T> for &RcRef<T> {}
mod internal { use super::AsyncRefCell; use super::RcLike; use super::RcRef; use futures::future::Future; use futures::ready; use futures::task::Context; use futures::task::Poll; use futures::task::Waker; use std::borrow::Borrow; use std::borrow::BorrowMut; use std::fmt::Debug; use std::marker::PhantomData; use std::ops::Deref; use std::ops::DerefMut; use std::pin::Pin;
impl<T> AsyncRefCell<T> { /// Borrow the cell's contents synchronouslym without creating an /// intermediate future. If the cell has already been borrowed and either /// the existing or the requested borrow is exclusive, this function returns /// `None`. pub fn borrow_sync<M: BorrowModeTrait, R: RcLike<AsyncRefCell<T>>>( cell: R, ) -> Option<AsyncBorrowImpl<T, M>> { let cell_ref = cell.as_ref(); // Don't allow synchronous borrows to cut in line; if there are any // enqueued waiters, return `None`, even if the current borrow is a shared // one and the requested borrow is too. // TODO(piscisaureus): safety comment #[allow(clippy::undocumented_unsafe_blocks)] let waiters = unsafe { &mut *cell_ref.waiters.as_ptr() }; if waiters.is_empty() { // There are no enqueued waiters, but it is still possible that the cell // is currently borrowed. If there are no current borrows, or both the // existing and requested ones are shared, `try_add()` returns the // adjusted borrow count. let new_borrow_count = cell_ref.borrow_count.get().try_add(M::borrow_mode())?; cell_ref.borrow_count.set(new_borrow_count); Some(AsyncBorrowImpl::<T, M>::new(cell.into())) } else { None } }
fn drop_borrow<M: BorrowModeTrait>(&self) { let new_borrow_count = self.borrow_count.get().remove(M::borrow_mode()); self.borrow_count.set(new_borrow_count);
if new_borrow_count.is_empty() { self.wake_waiters() } }
fn create_waiter<M: BorrowModeTrait>(&self) -> usize { let waiter = Waiter::new(M::borrow_mode()); let turn = self.turn.get(); let index = { // TODO(piscisaureus): safety comment #[allow(clippy::undocumented_unsafe_blocks)] let waiters = unsafe { &mut *self.waiters.as_ptr() }; waiters.push_back(Some(waiter)); waiters.len() - 1 }; if index == 0 { // SAFETY: the `waiters` reference used above *must* be dropped here. self.wake_waiters() } // Return the new waiter's id. turn + index }
fn poll_waiter<M: BorrowModeTrait>( &self, id: usize, cx: &mut Context, ) -> Poll<()> { let borrow_count = self.borrow_count.get(); let turn = self.turn.get(); if id < turn { // This waiter made it to the front of the line; we reserved a borrow // for it, woke its Waker, and removed the waiter from the queue. // Assertion: BorrowCount::remove() will panic if `mode` is incorrect. let _ = borrow_count.remove(M::borrow_mode()); Poll::Ready(()) } else { // This waiter is still in line and has not yet been woken. // TODO(piscisaureus): safety comment #[allow(clippy::undocumented_unsafe_blocks)] let waiters = unsafe { &mut *self.waiters.as_ptr() }; // Sanity check: id cannot be higher than the last queue element. assert!(id < turn + waiters.len()); // Sanity check: since we always call wake_waiters() when the queue head // is updated, it should be impossible to add it to the current borrow. assert!(id > turn || borrow_count.try_add(M::borrow_mode()).is_none()); // Save or update the waiter's Waker. let waiter_mut = waiters[id - turn].as_mut().unwrap(); waiter_mut.set_waker(cx.waker()); Poll::Pending } }
fn wake_waiters(&self) { let mut borrow_count = self.borrow_count.get(); // TODO(piscisaureus): safety comment #[allow(clippy::undocumented_unsafe_blocks)] let waiters = unsafe { &mut *self.waiters.as_ptr() }; let mut turn = self.turn.get();
loop { let waiter_entry = match waiters.front().map(Option::as_ref) { None => break, // Queue empty. Some(w) => w, }; let borrow_mode = match waiter_entry { None => { // Queue contains a hole. This happens when a Waiter is dropped // before it makes it to the front of the queue. waiters.pop_front(); turn += 1; continue; } Some(waiter) => waiter.borrow_mode(), }; // See if the waiter at the front of the queue can borrow the cell's // value now. If it does, `try_add()` returns the new borrow count, // effectively "reserving" the borrow until the associated // AsyncBorrowFutureImpl future gets polled and produces the actual // borrow. borrow_count = match borrow_count.try_add(borrow_mode) { None => break, // Can't borrow yet. Some(b) => b, }; // Drop from queue. let mut waiter = waiters.pop_front().unwrap().unwrap(); turn += 1; // Wake this waiter, so the AsyncBorrowFutureImpl future gets polled. if let Some(waker) = waiter.take_waker() { waker.wake() } } // Save updated counters. self.borrow_count.set(borrow_count); self.turn.set(turn); }
fn drop_waiter<M: BorrowModeTrait>(&self, id: usize) { let turn = self.turn.get(); if id < turn { // We already made a borrow count reservation for this waiter but the // borrow will never be picked up and removesequently, never dropped. // Therefore, call the borrow drop handler here. self.drop_borrow::<M>(); } else { // This waiter is still in the queue, take it out and leave a "hole". // TODO(piscisaureus): safety comment #[allow(clippy::undocumented_unsafe_blocks)] let waiters = unsafe { &mut *self.waiters.as_ptr() }; waiters[id - turn].take().unwrap(); }
if id == turn { // Since the first entry in the waiter queue was touched we have to // reprocess the waiter queue. self.wake_waiters() } } }
pub struct AsyncBorrowFutureImpl<T: 'static, M: BorrowModeTrait> { cell: Option<RcRef<AsyncRefCell<T>>>, id: usize, _phantom: PhantomData<M>, }
impl<T, M: BorrowModeTrait> AsyncBorrowFutureImpl<T, M> { pub fn new<R: RcLike<AsyncRefCell<T>>>(cell: R) -> Self { Self { id: cell.as_ref().create_waiter::<M>(), cell: Some(cell.into()), _phantom: PhantomData, } } }
impl<T: 'static, M: BorrowModeTrait> Future for AsyncBorrowFutureImpl<T, M> { type Output = AsyncBorrowImpl<T, M>; fn poll(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Self::Output> { ready!(self.cell.as_ref().unwrap().poll_waiter::<M>(self.id, cx)); // TODO(piscisaureus): safety comment #[allow(clippy::undocumented_unsafe_blocks)] let self_mut = unsafe { Pin::get_unchecked_mut(self) }; let cell = self_mut.cell.take().unwrap(); Poll::Ready(AsyncBorrowImpl::<T, M>::new(cell)) } }
impl<T, M: BorrowModeTrait> Drop for AsyncBorrowFutureImpl<T, M> { fn drop(&mut self) { // The expected mode of operation is that this future gets polled until it // is ready and yields a value of type `AsyncBorrowImpl`, which has a drop // handler that adjusts the `AsyncRefCell` borrow counter. However if the // `cell` field still holds a value at this point, it means that the // future was never polled to completion and no `AsyncBorrowImpl` was ever // created, so we have to adjust the borrow count here. if let Some(cell) = self.cell.take() { cell.drop_waiter::<M>(self.id) } } }
pub struct AsyncBorrowImpl<T: 'static, M: BorrowModeTrait> { cell: RcRef<AsyncRefCell<T>>, _phantom: PhantomData<M>, }
impl<T, M: BorrowModeTrait> AsyncBorrowImpl<T, M> { fn new(cell: RcRef<AsyncRefCell<T>>) -> Self { Self { cell, _phantom: PhantomData, } } }
impl<T, M: BorrowModeTrait> Deref for AsyncBorrowImpl<T, M> { type Target = T; fn deref(&self) -> &Self::Target { // TODO(piscisaureus): safety comment #[allow(clippy::undocumented_unsafe_blocks)] unsafe { &*self.cell.as_ptr() } } }
impl<T, M: BorrowModeTrait> Borrow<T> for AsyncBorrowImpl<T, M> { fn borrow(&self) -> &T { self } }
impl<T, M: BorrowModeTrait> AsRef<T> for AsyncBorrowImpl<T, M> { fn as_ref(&self) -> &T { self } }
impl<T> DerefMut for AsyncBorrowImpl<T, Exclusive> { fn deref_mut(&mut self) -> &mut Self::Target { // TODO(piscisaureus): safety comment #[allow(clippy::undocumented_unsafe_blocks)] unsafe { &mut *self.cell.as_ptr() } } }
impl<T> BorrowMut<T> for AsyncBorrowImpl<T, Exclusive> { fn borrow_mut(&mut self) -> &mut T { self } }
impl<T> AsMut<T> for AsyncBorrowImpl<T, Exclusive> { fn as_mut(&mut self) -> &mut T { self } }
impl<T, M: BorrowModeTrait> Drop for AsyncBorrowImpl<T, M> { fn drop(&mut self) { self.cell.drop_borrow::<M>() } }
#[derive(Copy, Clone, Debug, Eq, PartialEq)] pub enum BorrowMode { Shared, Exclusive, }
pub trait BorrowModeTrait: Copy { fn borrow_mode() -> BorrowMode; }
#[derive(Copy, Clone, Debug)] pub struct Shared;
impl BorrowModeTrait for Shared { fn borrow_mode() -> BorrowMode { BorrowMode::Shared } }
#[derive(Copy, Clone, Debug)] pub struct Exclusive;
impl BorrowModeTrait for Exclusive { fn borrow_mode() -> BorrowMode { BorrowMode::Exclusive } }
#[derive(Copy, Clone, Debug, Eq, PartialEq)] pub enum BorrowCount { Shared(usize), Exclusive, }
impl Default for BorrowCount { fn default() -> Self { Self::Shared(0) } }
impl BorrowCount { pub fn is_empty(self) -> bool { matches!(self, BorrowCount::Shared(0)) }
pub fn try_add(self, mode: BorrowMode) -> Option<BorrowCount> { match (self, mode) { (BorrowCount::Shared(refs), BorrowMode::Shared) => { Some(BorrowCount::Shared(refs + 1)) } (BorrowCount::Shared(0), BorrowMode::Exclusive) => { Some(BorrowCount::Exclusive) } _ => None, } }
#[allow(dead_code)] pub fn add(self, mode: BorrowMode) -> BorrowCount { match self.try_add(mode) { Some(value) => value, None => panic!("Can't add {:?} to {:?}", mode, self), } }
pub fn try_remove(self, mode: BorrowMode) -> Option<BorrowCount> { match (self, mode) { (BorrowCount::Shared(refs), BorrowMode::Shared) if refs > 0 => { Some(BorrowCount::Shared(refs - 1)) } (BorrowCount::Exclusive, BorrowMode::Exclusive) => { Some(BorrowCount::Shared(0)) } _ => None, } }
pub fn remove(self, mode: BorrowMode) -> BorrowCount { match self.try_remove(mode) { Some(value) => value, None => panic!("Can't remove {:?} from {:?}", mode, self), } } }
/// The `waiters` queue that is associated with an individual `AsyncRefCell` /// contains elements of the `Waiter` type. pub struct Waiter { borrow_mode: BorrowMode, waker: Option<Waker>, }
impl Waiter { pub fn new(borrow_mode: BorrowMode) -> Self { Self { borrow_mode, waker: None, } }
pub fn borrow_mode(&self) -> BorrowMode { self.borrow_mode }
pub fn set_waker(&mut self, new_waker: &Waker) { if self .waker .as_ref() .filter(|waker| waker.will_wake(new_waker)) .is_none() { self.waker.replace(new_waker.clone()); } }
pub fn take_waker(&mut self) -> Option<Waker> { self.waker.take() } }}
#[cfg(test)]mod tests { use super::*;
#[derive(Default)] struct Thing { touch_count: usize, _private: (), }
impl Thing { pub fn look(&self) -> usize { self.touch_count }
pub fn touch(&mut self) -> usize { self.touch_count += 1; self.touch_count } }
#[tokio::test] async fn async_ref_cell_borrow() { let cell = AsyncRefCell::<Thing>::default_rc();
let fut1 = cell.borrow(); let fut2 = cell.borrow_mut(); let fut3 = cell.borrow(); let fut4 = cell.borrow(); let fut5 = cell.borrow(); let fut6 = cell.borrow(); let fut7 = cell.borrow_mut(); let fut8 = cell.borrow();
// The `try_borrow` and `try_borrow_mut` methods should always return `None` // if there's a queue of async borrowers. assert!(cell.try_borrow().is_none()); assert!(cell.try_borrow_mut().is_none());
assert_eq!(fut1.await.look(), 0);
assert_eq!(fut2.await.touch(), 1);
{ let ref5 = fut5.await; let ref4 = fut4.await; let ref3 = fut3.await; let ref6 = fut6.await; assert_eq!(ref3.look(), 1); assert_eq!(ref4.look(), 1); assert_eq!(ref5.look(), 1); assert_eq!(ref6.look(), 1); }
{ let mut ref7 = fut7.await; assert_eq!(ref7.look(), 1); assert_eq!(ref7.touch(), 2); }
{ let ref8 = fut8.await; assert_eq!(ref8.look(), 2); } }
#[test] fn async_ref_cell_try_borrow() { let cell = AsyncRefCell::<Thing>::default_rc();
{ let ref1 = cell.try_borrow().unwrap(); assert_eq!(ref1.look(), 0); assert!(cell.try_borrow_mut().is_none()); }
{ let mut ref2 = cell.try_borrow_mut().unwrap(); assert_eq!(ref2.touch(), 1); assert!(cell.try_borrow().is_none()); assert!(cell.try_borrow_mut().is_none()); }
{ let ref3 = cell.try_borrow().unwrap(); let ref4 = cell.try_borrow().unwrap(); let ref5 = cell.try_borrow().unwrap(); let ref6 = cell.try_borrow().unwrap(); assert_eq!(ref3.look(), 1); assert_eq!(ref4.look(), 1); assert_eq!(ref5.look(), 1); assert_eq!(ref6.look(), 1); assert!(cell.try_borrow_mut().is_none()); }
{ let mut ref7 = cell.try_borrow_mut().unwrap(); assert_eq!(ref7.look(), 1); assert_eq!(ref7.touch(), 2); assert!(cell.try_borrow().is_none()); assert!(cell.try_borrow_mut().is_none()); }
{ let ref8 = cell.try_borrow().unwrap(); assert_eq!(ref8.look(), 2); assert!(cell.try_borrow_mut().is_none()); assert!(cell.try_borrow().is_some()); } }
#[derive(Default)] struct ThreeThings { pub thing1: AsyncRefCell<Thing>, pub thing2: AsyncRefCell<Thing>, pub thing3: AsyncRefCell<Thing>, }
#[tokio::test] async fn rc_ref_map() { let three_cells = Rc::new(ThreeThings::default());
let rc1 = RcRef::map(three_cells.clone(), |things| &things.thing1); let rc2 = RcRef::map(three_cells.clone(), |things| &things.thing2); let rc3 = RcRef::map(three_cells, |things| &things.thing3);
let mut ref1 = rc1.borrow_mut().await; let ref2 = rc2.borrow().await; let mut ref3 = rc3.borrow_mut().await;
assert_eq!(ref1.look(), 0); assert_eq!(ref3.touch(), 1); assert_eq!(ref1.touch(), 1); assert_eq!(ref2.look(), 0); assert_eq!(ref3.touch(), 2); assert_eq!(ref1.look(), 1); assert_eq!(ref1.touch(), 2); assert_eq!(ref3.touch(), 3); assert_eq!(ref1.touch(), 3); }}
deno

Version Info

Tagged at
a year ago