non_blocking_mutex 3.1.3

NonBlockingMutex is currently the fastest way to do expensive calculations under lock, or do cheap calculations under lock when concurrency/load/contention is very high
Documentation
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
use crate::mutex_guard::MutexGuard;
use crate::non_blocking_mutex_task::NonBlockingMutexTask;
use crossbeam_utils::CachePadded;
use sharded_queue::ShardedQueue;
use std::cell::UnsafeCell;
use std::marker::PhantomData;
use std::sync::atomic::{AtomicUsize, Ordering};

pub struct NonBlockingMutex<
    'captured_variables,
    State,
    TNonBlockingMutexTask: NonBlockingMutexTask<State> + 'captured_variables,
> {
    pub(crate) task_count: CachePadded<AtomicUsize>,
    pub(crate) task_queue: ShardedQueue<TNonBlockingMutexTask>,
    pub(crate) unsafe_state: UnsafeCell<State>,

    _phantom_task_queue:
        PhantomData<ShardedQueue<Box<dyn NonBlockingMutexTask<State> + 'captured_variables>>>,
}

/// # [NonBlockingMutex]
///
/// ## Why you should use [NonBlockingMutex]
///
/// [NonBlockingMutex] is currently the fastest way to do
/// expensive calculations under lock, or do cheap calculations
/// under lock when concurrency/load/contention is very high -
/// see benchmarks in directory `benches` and run them with
/// ```bash
/// cargo bench
/// ```
///
/// ## Examples
/// ### Optimized for 1 type of [NonBlockingMutexTask]
/// ```rust
/// use non_blocking_mutex::mutex_guard::MutexGuard;
/// use non_blocking_mutex::non_blocking_mutex::NonBlockingMutex;
/// use std::thread::{available_parallelism};
///
/// /// How many threads can physically access [NonBlockingMutex]
/// /// simultaneously, needed for computing `shard_count` of [ShardedQueue],
/// /// used to store queue of tasks
/// let max_concurrent_thread_count = available_parallelism().unwrap().get();
///
/// let non_blocking_mutex = NonBlockingMutex::new(max_concurrent_thread_count, 0);
/// /// Will infer exact type and size(0) of this [FnOnce] and
/// /// make sized [NonBlockingMutex] which takes only this exact [FnOnce]
/// /// without ever requiring [Box]-ing or dynamic dispatch
/// non_blocking_mutex.run_if_first_or_schedule_on_first(|mut state: MutexGuard<usize>| {
///     *state += 1;
/// });
/// ```
///
/// ### Easy to use with any [FnOnce], but may [Box] tasks and use dynamic dispatch when can't acquire lock on first try
/// ```rust
/// use non_blocking_mutex::dynamic_non_blocking_mutex::DynamicNonBlockingMutex;
/// use std::thread::{available_parallelism, scope};
///
/// let mut state_snapshot_before_increment = 0;
/// let mut state_snapshot_after_increment = 0;
///
/// let mut state_snapshot_before_decrement = 0;
/// let mut state_snapshot_after_decrement = 0;
///
/// {
///     /// How many threads can physically access [NonBlockingMutex]
///     /// simultaneously, needed for computing `shard_count` of [ShardedQueue],
///     /// used to store queue of tasks
///     let max_concurrent_thread_count = available_parallelism().unwrap().get();
///
///     /// Will work with any [FnOnce] and is easy to use,
///     /// but will [Box] tasks and use dynamic dispatch
///     /// when can't acquire lock on first try
///     let non_blocking_mutex = DynamicNonBlockingMutex::new(max_concurrent_thread_count, 0);
///
///     scope(|scope| {
///         scope.spawn(|| {
///             non_blocking_mutex.run_fn_once_if_first_or_schedule_on_first(|mut state| {
///                 *(&mut state_snapshot_before_increment) = *state;
///                 *state += 1;
///                 *(&mut state_snapshot_after_increment) = *state;
///             });
///             non_blocking_mutex.run_fn_once_if_first_or_schedule_on_first(|mut state| {
///                 *(&mut state_snapshot_before_decrement) = *state;
///                 *state -= 1;
///                 *(&mut state_snapshot_after_decrement) = *state;
///             });
///         });
///     });
/// }
///
/// assert_eq!(state_snapshot_before_increment, 0);
/// assert_eq!(state_snapshot_after_increment, 1);
///
/// assert_eq!(state_snapshot_before_decrement, 1);
/// assert_eq!(state_snapshot_after_decrement, 0);
/// ```
///
/// ### Optimized for multiple known types of [NonBlockingMutexTask] which capture variables
/// ```rust
/// use non_blocking_mutex::mutex_guard::MutexGuard;
/// use non_blocking_mutex::non_blocking_mutex::NonBlockingMutex;
/// use non_blocking_mutex::non_blocking_mutex_task::NonBlockingMutexTask;
/// use std::thread::{available_parallelism, scope};
///
/// let mut state_snapshot_before_increment = 0;
/// let mut state_snapshot_after_increment = 0;
///
/// let mut state_snapshot_before_decrement = 0;
/// let mut state_snapshot_after_decrement = 0;
///
/// {
///     /// How many threads can physically access [NonBlockingMutex]
///     /// simultaneously, needed for computing `shard_count` of [ShardedQueue],
///     /// used to store queue of tasks
///     let max_concurrent_thread_count = available_parallelism().unwrap().get();
///
///     /// Will infer exact type and size of struct [Task] and
///     /// make sized [NonBlockingMutex] which takes only [Task]
///     /// without ever requiring [Box]-ing or dynamic dispatch
///     let non_blocking_mutex = NonBlockingMutex::new(max_concurrent_thread_count, 0);
///
///     scope(|scope| {
///         scope.spawn(|| {
///             non_blocking_mutex.run_if_first_or_schedule_on_first(
///                 Task::new_increment_and_store_snapshots(
///                     &mut state_snapshot_before_increment,
///                     &mut state_snapshot_after_increment,
///                 ),
///             );
///             non_blocking_mutex.run_if_first_or_schedule_on_first(
///                 Task::new_decrement_and_store_snapshots(
///                     &mut state_snapshot_before_decrement,
///                     &mut state_snapshot_after_decrement,
///                 ),
///             );
///         });
///     });
/// }
///
/// assert_eq!(state_snapshot_before_increment, 0);
/// assert_eq!(state_snapshot_after_increment, 1);
///
/// assert_eq!(state_snapshot_before_decrement, 1);
/// assert_eq!(state_snapshot_after_decrement, 0);
///
/// struct SnapshotsBeforeAndAfterChangeRefs<
///     'snapshot_before_change_ref,
///     'snapshot_after_change_ref,
/// > {
///     /// Where to write snapshot of `State` before applying function to `State`
///     snapshot_before_change_ref: &'snapshot_before_change_ref mut usize,
///     /// Where to write snapshot of `State` after applying function to `State
///     snapshot_after_change_ref: &'snapshot_after_change_ref mut usize,
/// }
///
/// enum TaskType<'snapshot_before_change_ref, 'snapshot_after_change_ref> {
///     IncrementAndStoreSnapshots(
///         SnapshotsBeforeAndAfterChangeRefs<
///             'snapshot_before_change_ref,
///             'snapshot_after_change_ref,
///         >,
///     ),
///     DecrementAndStoreSnapshots(
///         SnapshotsBeforeAndAfterChangeRefs<
///             'snapshot_before_change_ref,
///             'snapshot_after_change_ref,
///         >,
///     ),
/// }
///
/// struct Task<'snapshot_before_change_ref, 'snapshot_after_change_ref> {
///     task_type: TaskType<'snapshot_before_change_ref, 'snapshot_after_change_ref>,
/// }
///
/// impl<'snapshot_before_change_ref, 'snapshot_after_change_ref>
///     Task<'snapshot_before_change_ref, 'snapshot_after_change_ref>
/// {
///     fn new_increment_and_store_snapshots(
///         // Where to write snapshot of `State` before applying function to `State`
///         snapshot_before_change_ref: &'snapshot_before_change_ref mut usize,
///         // Where to write snapshot of `State` after applying function to `State
///         snapshot_after_change_ref: &'snapshot_after_change_ref mut usize,
///     ) -> Self {
///         Self {
///             task_type: TaskType::IncrementAndStoreSnapshots(
///                 SnapshotsBeforeAndAfterChangeRefs {
///                     /// Where to write snapshot of `State` before applying function to `State`
///                     snapshot_before_change_ref,
///                     /// Where to write snapshot of `State` after applying function to `State
///                     snapshot_after_change_ref,
///                 },
///             ),
///         }
///     }
///
///     fn new_decrement_and_store_snapshots(
///         // Where to write snapshot of `State` before applying function to `State`
///         snapshot_before_change_ref: &'snapshot_before_change_ref mut usize,
///         // Where to write snapshot of `State` after applying function to `State
///         snapshot_after_change_ref: &'snapshot_after_change_ref mut usize,
///     ) -> Self {
///         Self {
///             task_type: TaskType::DecrementAndStoreSnapshots(
///                 SnapshotsBeforeAndAfterChangeRefs {
///                     /// Where to write snapshot of `State` before applying function to `State`
///                     snapshot_before_change_ref,
///                     /// Where to write snapshot of `State` after applying function to `State
///                     snapshot_after_change_ref,
///                 },
///             ),
///         }
///     }
/// }
///
/// impl<'snapshot_before_change_ref, 'snapshot_after_change_ref> NonBlockingMutexTask<usize>
///     for Task<'snapshot_before_change_ref, 'snapshot_after_change_ref>
/// {
///     fn run_with_state(self, mut state: MutexGuard<usize>) {
///         match self.task_type {
///             TaskType::IncrementAndStoreSnapshots(SnapshotsBeforeAndAfterChangeRefs {
///                 snapshot_before_change_ref,
///                 snapshot_after_change_ref,
///             }) => {
///                 *snapshot_before_change_ref = *state;
///                 *state += 1;
///                 *snapshot_after_change_ref = *state;
///             }
///             TaskType::DecrementAndStoreSnapshots(SnapshotsBeforeAndAfterChangeRefs {
///                 snapshot_before_change_ref,
///                 snapshot_after_change_ref,
///             }) => {
///                 *snapshot_before_change_ref = *state;
///                 *state -= 1;
///                 *snapshot_after_change_ref = *state;
///             }
///         }
///     }
/// }
/// ```
///
/// ## Why you may want to not use [NonBlockingMutex]
///
/// - [NonBlockingMutex] forces first thread to enter synchronized block to
/// do all tasks(including added while it is running,
/// potentially running forever if tasks are being added forever)
///
/// - It is more difficult to continue execution on same thread after
/// synchronized logic is run, you need to schedule continuation on some
/// scheduler when you want to continue after end of synchronized logic
/// in new thread or introduce other synchronization primitives,
/// like channels, or `WaitGroup`-s, or similar
///
/// - [NonBlockingMutex] performs worse than [std::sync::Mutex] when
/// concurrency/load/contention is low
///
/// - Similar to [std::sync::Mutex], [NonBlockingMutex] doesn't guarantee
/// order of execution, only atomicity of operations is guaranteed
///
/// ## Design explanation
///
/// First thread, which calls [NonBlockingMutex::run_if_first_or_schedule_on_first],
/// atomically increments `task_count`, and,
/// if thread was first to increment `task_count` from 0 to 1,
/// first thread immediately executes first task,
/// and then atomically decrements `task_count` and checks if `task_count`
/// changed from 1 to 0. If `task_count` changed from 1 to 0 -
/// there are no more tasks and first thread can finish execution loop,
/// otherwise first thread gets next task from `task_queue` and runs task,
/// then decrements tasks count after it was run and repeats check if
/// `task_count` changed from 1 to 0 and running tasks until there are no more tasks left.
///
/// Not first threads also atomically increment `task_count`,
/// do check if they are first, [Box] task and push task [Box] to `task_queue`
///
/// This design allows us to avoid lock contention, but adds ~constant time
/// of [Box]-ing task and putting task [Box] into concurrent `task_queue`, and
/// incrementing and decrementing `task_count`, so when lock contention is low,
/// [NonBlockingMutex] performs worse than [std::sync::Mutex],
/// but when contention is high
/// (because we have more CPU-s or because we want to do expensive
/// calculations under lock), [NonBlockingMutex] performs better
/// than [std::sync::Mutex]
impl<'captured_variables, State, TNonBlockingMutexTask: NonBlockingMutexTask<State>>
    NonBlockingMutex<'captured_variables, State, TNonBlockingMutexTask>
{
    /// # Arguments
    ///
    /// * `max_concurrent_thread_count` - how many threads can physically access
    /// [NonBlockingMutex] simultaneously, needed for computing `shard_count` of [ShardedQueue],
    /// used to store queue of tasks
    pub fn new(max_concurrent_thread_count: usize, state: State) -> Self {
        Self {
            task_count: CachePadded::new(AtomicUsize::new(0)),
            task_queue: ShardedQueue::new(max_concurrent_thread_count),
            unsafe_state: UnsafeCell::new(state),

            _phantom_task_queue: PhantomData,
        }
    }

    /// Please don't forget that order of execution is not guaranteed. Atomicity of operations is guaranteed,
    /// but order can be random
    pub fn run_if_first_or_schedule_on_first(&self, task: TNonBlockingMutexTask) {
        if self.task_count.fetch_add(1, Ordering::Acquire) != 0 {
            self.task_queue.push_back(task);
        } else {
            // If we acquired first lock, run should be executed immediately and run loop started
            task.run_with_state(unsafe { MutexGuard::new(&self.unsafe_state) });
            /// Note that if [`fetch_sub`] != 1
            /// => some thread entered first if block in method
            /// => [ShardedQueue::push_back] is guaranteed to be called
            /// => [ShardedQueue::pop_front_or_spin_wait_item] will not deadlock while spins until it gets item
            ///
            /// Notice that we run action first, and only then decrement count
            /// with releasing(pushing) memory changes, even if it looks otherwise
            while self.task_count.fetch_sub(1, Ordering::Release) != 1 {
                self.task_queue
                    .pop_front_or_spin_wait_item()
                    .run_with_state(unsafe { MutexGuard::new(&self.unsafe_state) });
            }
        }
    }
}

/// [Send] and [Sync] logic was taken from [std::sync::Mutex]
unsafe impl<'captured_variables, State: Send, TNonBlockingMutexTask: NonBlockingMutexTask<State>>
    Send for NonBlockingMutex<'captured_variables, State, TNonBlockingMutexTask>
{
}
unsafe impl<'captured_variables, State: Send, TNonBlockingMutexTask: NonBlockingMutexTask<State>>
    Sync for NonBlockingMutex<'captured_variables, State, TNonBlockingMutexTask>
{
}

/// [NonBlockingMutex] should implement [Send] and [Sync] in same
/// cases as [std::sync::Mutex]
///
/// ```rust
/// fn is_send<T: Send>(t: T) {}
/// fn is_sync<T: Sync>(t: T) {}
///
/// let send_sync = 0;
///
/// is_send(send_sync);
/// is_sync(send_sync);
/// ```
/// ```rust
/// use non_blocking_mutex::mutex_guard::MutexGuard;
/// use non_blocking_mutex::non_blocking_mutex::NonBlockingMutex;
/// fn is_send<T: Send>(t: T) {}
///
/// let send_sync = 0;
/// let non_blocking_mutex = NonBlockingMutex::new(1, send_sync);
/// non_blocking_mutex.run_if_first_or_schedule_on_first(|_: MutexGuard<_>| {});
///
/// is_send(non_blocking_mutex);
/// ```
/// ```rust
/// use std::sync::Mutex;
///
/// fn is_send<T: Send>(t: T) {}
///
/// let send_sync = 0;
/// let mutex = Mutex::new(send_sync);
///
/// is_send(mutex);
/// ```
/// ```rust
/// use non_blocking_mutex::mutex_guard::MutexGuard;
/// use non_blocking_mutex::non_blocking_mutex::NonBlockingMutex;
///
/// fn is_sync<T: Sync>(t: T) {}
///
/// let send_sync = 0;
/// let non_blocking_mutex = NonBlockingMutex::new(1, send_sync);
/// non_blocking_mutex.run_if_first_or_schedule_on_first(|_: MutexGuard<_>| {});
///
/// is_sync(non_blocking_mutex);
/// ```
/// ```rust
/// use std::sync::Mutex;
///
/// fn is_sync<T: Sync>(t: T) {}
///
/// let send_sync = 0;
/// let mutex = Mutex::new(send_sync);
///
/// is_sync(mutex);
/// ```
///
///
///
///
///
/// ```rust
/// use std::cell::Cell;
///
/// fn is_send<T: Send>(t: T) {}
///
/// let send_not_sync = Cell::new(0);
///
/// is_send(send_not_sync);
/// ```
/// ```compile_fail
/// use std::cell::Cell;
///
/// fn is_sync<T: Sync>(t: T) {}
///
/// let send_not_sync = Cell::new(0);
///
/// is_sync(send_not_sync);
/// ```
/// ```rust
/// use std::cell::Cell;
/// use non_blocking_mutex::mutex_guard::MutexGuard;
/// use non_blocking_mutex::non_blocking_mutex::NonBlockingMutex;
///
/// fn is_send<T: Send>(t: T) {}
///
/// let send_not_sync = Cell::new(0);
/// let non_blocking_mutex = NonBlockingMutex::new(1, send_not_sync);
/// non_blocking_mutex.run_if_first_or_schedule_on_first(|_: MutexGuard<_>| {});
///
/// is_send(non_blocking_mutex);
/// ```
/// ```rust
/// use std::cell::Cell;
/// use std::sync::Mutex;
///
/// fn is_send<T: Send>(t: T) {}
///
/// let send_not_sync = Cell::new(0);
/// let mutex = Mutex::new(send_not_sync);
///
/// is_send(mutex);
/// ```
/// ```rust
/// use std::cell::Cell;
/// use non_blocking_mutex::mutex_guard::MutexGuard;
/// use non_blocking_mutex::non_blocking_mutex::NonBlockingMutex;
///
/// fn is_sync<T: Sync>(t: T) {}
///
/// let send_not_sync = Cell::new(0);
/// let non_blocking_mutex = NonBlockingMutex::new(1, send_not_sync);
/// non_blocking_mutex.run_if_first_or_schedule_on_first(|_: MutexGuard<_>| {});
///
/// is_sync(non_blocking_mutex);
/// ```
/// ```rust
/// use std::cell::Cell;
/// use std::sync::Mutex;
///
/// fn is_sync<T: Sync>(t: T) {}
///
/// let send_not_sync = Cell::new(0);
/// let mutex = Mutex::new(send_not_sync);
///
/// is_sync(mutex);
/// ```
///
///
///
///
///
/// ```compile_fail
/// use std::marker::PhantomData;
///
/// fn is_send<T: Send>(t: T) {}
///
/// struct NotSendSync<'t, T> {
///     _phantom_unsend: PhantomData<std::sync::MutexGuard<'t, T>>
/// }
/// unsafe impl<'t, T> Sync for NotSendSync<'t, T> {}
///
/// let not_send_sync = NotSendSync::<usize> {
///     _phantom_unsend: PhantomData,
/// };
///
/// is_send(not_send_sync);
/// ```
/// ```rust
/// use std::marker::PhantomData;
///
/// fn is_sync<T: Sync>(t: T) {}
///
/// struct NotSendSync<'t, T> {
///     _phantom_unsend: PhantomData<std::sync::MutexGuard<'t, T>>
/// }
/// unsafe impl<'t, T> Sync for NotSendSync<'t, T> {}
///
/// let not_send_sync = NotSendSync::<usize> {
///     _phantom_unsend: PhantomData,
/// };
///
/// is_sync(not_send_sync);
/// ```
/// ```compile_fail
/// use std::marker::PhantomData;
/// use non_blocking_mutex::mutex_guard::MutexGuard;
/// use non_blocking_mutex::non_blocking_mutex::NonBlockingMutex;
///
/// fn is_send<T: Send>(t: T) {}
///
/// struct NotSendSync<'t, T> {
///     _phantom_unsend: PhantomData<std::sync::MutexGuard<'t, T>>
/// }
/// unsafe impl<'t, T> Sync for NotSendSync<'t, T> {}
///
/// let not_send_sync = NotSendSync::<usize> {
///     _phantom_unsend: PhantomData,
/// };
/// let non_blocking_mutex = NonBlockingMutex::new(1, not_send_sync);
/// non_blocking_mutex.run_if_first_or_schedule_on_first(|_: MutexGuard<_>| {});
///
/// is_send(non_blocking_mutex);
/// ```
/// ```compile_fail
/// use std::marker::PhantomData;
/// use std::sync::Mutex;
///
/// fn is_send<T: Send>(t: T) {}
///
/// struct NotSendSync<'t, T> {
///     _phantom_unsend: PhantomData<std::sync::MutexGuard<'t, T>>
/// }
/// unsafe impl<'t, T> Sync for NotSendSync<'t, T> {}
///
/// let not_send_sync = NotSendSync::<usize> {
///     _phantom_unsend: PhantomData,
/// };
/// let mutex = Mutex::new(not_send_sync);
///
/// is_send(mutex);
/// ```
/// ```compile_fail
/// use std::marker::PhantomData;
/// use non_blocking_mutex::mutex_guard::MutexGuard;
/// use non_blocking_mutex::non_blocking_mutex::NonBlockingMutex;
///
/// fn is_sync<T: Sync>(t: T) {}
///
/// struct NotSendSync<'t, T> {
///     _phantom_unsend: PhantomData<std::sync::MutexGuard<'t, T>>
/// }
/// unsafe impl<'t, T> Sync for NotSendSync<'t, T> {}
///
/// let not_send_sync = NotSendSync::<usize> {
///     _phantom_unsend: PhantomData,
/// };
/// let non_blocking_mutex = NonBlockingMutex::new(1, not_send_sync);
/// non_blocking_mutex.run_if_first_or_schedule_on_first(|_: MutexGuard<_>| {});
///
/// is_sync(non_blocking_mutex);
/// ```
/// ```compile_fail
/// use std::marker::PhantomData;
/// use std::sync::Mutex;
///
/// fn is_sync<T: Sync>(t: T) {}
///
/// struct NotSendSync<'t, T> {
///     _phantom_unsend: PhantomData<std::sync::MutexGuard<'t, T>>
/// }
/// unsafe impl<'t, T> Sync for NotSendSync<'t, T> {}
///
/// let not_send_sync = NotSendSync::<usize> {
///     _phantom_unsend: PhantomData,
/// };
/// let mutex = Mutex::new(not_send_sync);
///
/// is_sync(mutex);
/// ```
///
///
///
///
///
/// ```compile_fail
/// fn is_send<T: Send>(t: T) {}
///
/// let t = 0;
/// let not_send_not_sync = &t as *const usize;
///
/// is_send(not_send_not_sync);
/// ```
/// ```compile_fail
/// fn is_sync<T: Sync>(t: T) {}
///
/// let t = 0;
/// let not_send_not_sync = &t as *const usize;
///
/// is_sync(not_send_not_sync);
/// ```
/// ```compile_fail
/// use non_blocking_mutex::mutex_guard::MutexGuard;
/// use non_blocking_mutex::non_blocking_mutex::NonBlockingMutex;
///
/// fn is_send<T: Send>(t: T) {}
///
/// let t = 0;
/// let not_send_not_sync = &t as *const usize;
/// let non_blocking_mutex = NonBlockingMutex::new(1, not_send_not_sync);
/// non_blocking_mutex.run_if_first_or_schedule_on_first(|_: MutexGuard<_>| {});
///
/// is_send(non_blocking_mutex);
/// ```
/// ```compile_fail
/// use std::sync::Mutex;
///
/// fn is_send<T: Send>(t: T) {}
///
/// let t = 0;
/// let not_send_not_sync = &t as *const usize;
/// let mutex = Mutex::new(not_send_not_sync);
///
/// is_send(mutex);
/// ```
/// ```compile_fail
/// use std::sync::Mutex;
///
/// fn is_sync<T: Sync>(t: T) {}
///
/// let t = 0;
/// let not_send_not_sync = &t as *const usize;
/// let mutex = Mutex::new(not_send_not_sync);
///
/// is_sync(mutex);
/// ```
/// ```compile_fail
/// use std::sync::Mutex;
/// use non_blocking_mutex::mutex_guard::MutexGuard;
/// use non_blocking_mutex::non_blocking_mutex::NonBlockingMutex;
///
/// fn is_sync<T: Sync>(t: T) {}
///
/// let t = 0;
/// let not_send_not_sync = &t as *const usize;
/// let non_blocking_mutex = NonBlockingMutex::new(1, not_send_not_sync);
/// non_blocking_mutex.run_if_first_or_schedule_on_first(|_: MutexGuard<_>| {});
///
/// is_sync(non_blocking_mutex);
/// ```
struct NonBlockingMutexSendSyncImplementationDocTests {}