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
|
// Copyright (c) Microsoft Open Technologies, Inc. All rights reserved. See License.txt in the project root for license information.
#if !NO_PERF
using System;
using System.Reactive.Concurrency;
using System.Reactive.Disposables;
namespace System.Reactive.Linq.Observαble
{
class Range : Producer<int>
{
private readonly int _start;
private readonly int _count;
private readonly IScheduler _scheduler;
public Range(int start, int count, IScheduler scheduler)
{
_start = start;
_count = count;
_scheduler = scheduler;
}
protected override IDisposable Run(IObserver<int> observer, IDisposable cancel, Action<IDisposable> setSink)
{
var sink = new _(this, observer, cancel);
setSink(sink);
return sink.Run();
}
class _ : Sink<int>
{
private readonly Range _parent;
public _(Range parent, IObserver<int> observer, IDisposable cancel)
: base(observer, cancel)
{
_parent = parent;
}
public IDisposable Run()
{
var longRunning = _parent._scheduler.AsLongRunning();
if (longRunning != null)
{
return longRunning.ScheduleLongRunning(0, Loop);
}
else
{
return _parent._scheduler.Schedule(0, LoopRec);
}
}
private void Loop(int i, ICancelable cancel)
{
while (!cancel.IsDisposed && i < _parent._count)
{
base._observer.OnNext(_parent._start + i);
i++;
}
if (!cancel.IsDisposed)
base._observer.OnCompleted();
base.Dispose();
}
private void LoopRec(int i, Action<int> recurse)
{
if (i < _parent._count)
{
base._observer.OnNext(_parent._start + i);
recurse(i + 1);
}
else
{
base._observer.OnCompleted();
base.Dispose();
}
}
}
}
}
#endif
|
