@@ -39,7 +39,7 @@ function putLast (queue, value) {
39
39
return cell ;
40
40
}
41
41
42
- function takeTail ( queue ) {
42
+ function takeLast ( queue ) {
43
43
var cell ;
44
44
switch ( queue . size ) {
45
45
case 0 :
@@ -94,8 +94,8 @@ function deleteCell (cell) {
94
94
if ( cell . queue === null ) {
95
95
return ;
96
96
}
97
- if ( cell . queue . tail === cell ) {
98
- takeTail ( cell . queue ) ;
97
+ if ( cell . queue . last === cell ) {
98
+ takeLast ( cell . queue ) ;
99
99
return ;
100
100
}
101
101
if ( cell . queue . head === cell ) {
@@ -191,7 +191,7 @@ exports._readVar = function (left, right, avar, cb) {
191
191
exports . _tryPutVar = function ( left , right , avar , value ) {
192
192
return function ( ) {
193
193
if ( avar . value === EMPTY && avar . error === null ) {
194
- putLast ( avar . puts , { value : value , cb : null } ) ;
194
+ avar . value = value ;
195
195
drainVar ( left , right , avar ) ;
196
196
return true ;
197
197
} else {
@@ -234,10 +234,9 @@ function drainVar (left, right, avar) {
234
234
return ;
235
235
}
236
236
237
- var ps = avar . puts ;
238
- var ts = avar . takes ;
239
- var rs = avar . reads ;
240
- var tcs = null ;
237
+ var ps = avar . puts ;
238
+ var ts = avar . takes ;
239
+ var rs = avar . reads ;
241
240
var p , r , t , value , rsize ;
242
241
243
242
avar . draining = true ;
@@ -253,7 +252,7 @@ function drainVar (left, right, avar) {
253
252
if ( avar . error !== null ) {
254
253
value = left ( avar . error ) ;
255
254
// Error callback ordering is somewhat undefined, but we try to at least
256
- // be somewhat fair by interleaving puts and takes.
255
+ // be fair by interleaving puts and takes.
257
256
while ( 1 ) {
258
257
if ( ps . size === 0 && ts . size === 0 && rs . size === 0 ) {
259
258
break ;
@@ -295,7 +294,7 @@ function drainVar (left, right, avar) {
295
294
}
296
295
}
297
296
298
- if ( p !== null && p . cb !== null ) {
297
+ if ( p !== null ) {
299
298
runEff ( p . cb ( right ( void 0 ) ) ) ;
300
299
}
301
300
0 commit comments