• 设为首页
  • 点击收藏
  • 手机版
    手机扫一扫访问
    迪恩网络手机版
  • 关注官方公众号
    微信扫一扫关注
    公众号

TypeScript ref.newRef函数代码示例

原作者: [db:作者] 来自: [db:来源] 收藏 邀请

本文整理汇总了TypeScript中@jonggrang/ref.newRef函数的典型用法代码示例。如果您正苦于以下问题:TypeScript newRef函数的具体用法?TypeScript newRef怎么用?TypeScript newRef使用的例子?那么恭喜您, 这里精选的函数代码示例或许可以为您提供帮助。



在下文中一共展示了newRef函数的9个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于我们的系统推荐出更棒的TypeScript代码示例。

示例1: addItem

 .chain(stateRef =>
   R.newRef<T.Fiber<void> | undefined>(void 0).map(tidRef =>
     ({ add: addItem(settings, stateRef, tidRef)
     , read: readState(stateRef, settings.empty)
     , stop: stopReaper(stateRef, settings.empty)
     , kill: killReaper(tidRef)
     })
   )
开发者ID:syaiful6,项目名称:jonggrang,代码行数:8,代码来源:reaper.ts


示例2: runSubs

 function runSubs(int: Loop<E.Either<M, Q>>, subs: Q[]) {
   return newRef(int).chain(ref => {
     return T.forInPar(subs, q => {
       return readRef(ref)
         .chain(k => k.loop(E.right(q)))
         .chain(nq => writeRef(ref, nq));
     }).then(readRef(ref));
   });
 }
开发者ID:syaiful6,项目名称:jonggrang,代码行数:9,代码来源:genjer.ts


示例3: withFdCache

 T.supervise(T.co(function* () {
   let fdRef: R.Ref<number> = yield R.newRef(-1);
   yield withFdCache(3000, getFd =>
     getFd(0)(path.join(__dirname, '..', 'package.json')).chain(fd =>
       R.writeRef(fdRef, (fd[0] as any).value))
   );
   let fd: number = yield R.readRef(fdRef);
   return T.attempt(T.node(null, fd, fs.readFile)).chain(mcont => {
     assert.ok(isLeft(mcont));
     return T.pure(void 0);
   });
 }))
开发者ID:syaiful6,项目名称:jonggrang,代码行数:12,代码来源:fd-cache.test.ts


示例4: push

export function fix<I>(
  proc: EvQueue<I, I>
): T.Task<EvInstance<I>> {
  return R.newRef<I[]>([])
    .chain(queue => {
      return R.newRef<Loop<I> | undefined>(void 0)
        .chain(machine => {
          function push(i: I): T.Task<void> {
            return R.modifyRef(queue, ys => {
              let xs = ys.slice();
              xs.push(i);
              return xs;
            });
          }
          const run: T.Task<void> =
            R.modifyRef_(machine, x => [void 0, x]).chain(i => traverse_(loop, i));
          function loop(mc: Loop<I>): T.Task<void> {
            return R.readRef(queue)
              .chain(q => {
                if (q.length > 0) {
                  let head = q[0],
                    tail = q.slice(1);
                  return R.writeRef(queue, tail)
                    .chain(() => mc.loop(head).chain(loop));
                }
                return mc.tick()
                  .chain(st => {
                    return R.readRef(queue)
                      .chain(q2 => {
                        if (q2.length === 0) {
                          return R.writeRef(machine, st)
                            .then(R.writeRef(queue, []));
                        }
                        return loop(st);
                      });
                  });
              });
          }
          const inst: EvInstance<I> = { run, push };
          return proc(inst)
            .chain(step => {
              return R.writeRef(machine, step).then(T.pure(inst));
            });
        });
    });
}
开发者ID:syaiful6,项目名称:jonggrang,代码行数:46,代码来源:event-queue.ts


示例5: mkAutoUpdate

 return T.toPromise(T.co(function* () {
   const ref: R.Ref<number> = yield R.newRef(0);
   const update: T.Task<number> = R.modifyRef_(ref, i => [i + 1, i + 1]);
   const next: T.Task<number> = yield mkAutoUpdate({ delay: 100, task: update });
   yield T.forIn_(range(1, 11), i => {
     return next.chain(j => {
       assert.equal(i === j && i !== 1, false);
       return T.pure(void 0);
     });
   });
   yield T.delay(300);
   const last1: number = yield R.readRef(ref);
   yield T.delay(200);
   const last2: number = yield R.readRef(ref);
   assert.equal(last1, last2);
   return T.pure(void 0);
 }));
开发者ID:syaiful6,项目名称:jonggrang,代码行数:17,代码来源:auto-update.ts


示例6: handleChange

export function make<M, Q, S, I>(
  interpreter: EvQueue<E.Either<M, Q>, I>,
  app: App<M, Q, S, I>,
  el: Element
): T.Task<AppInstance<S, I>> {
  return newRef<SubscriptionState<S, I>>({ fresh: 0, cbs: {} })
    .chain(subsRef =>
      newRef<S>(app.init.model).chain(stateRef => {
        function handleChange(ac: AppChange<S, I>): T.Task<void> {
          return writeRef(stateRef, ac.model)
            .then(readRef(subsRef))
            .chain(sbs => T.forInPar(S.recordValues(sbs.cbs), cb => cb(ac)))
            .then(T.pure(void 0));
        }
        function subscribe_(cb: (_: AppChange<S, I>) => T.Task<void>): T.Task<T.Task<void>> {
          return readRef(subsRef)
            .chain(sbs => {
              let nkey = sbs.fresh.toString();
              return writeRef(subsRef, S.assign({}, sbs, {
                fresh: sbs.fresh + 1,
                sbs: S.assign({}, sbs.cbs, {
                  [nkey]: cb
                })
              })).map(v => remove(nkey));
            });
        }
        function remove(key: string): T.Task<void> {
          return modifyRef(subsRef, sbs => {
            let nbs = S.assign({}, sbs);
            delete nbs.cbs[key];
            return nbs;
          });
        }
        return fix(makeAppQueue(handleChange, interpreter, app, el))
          .map(queue =>
            ({ push: (i: I) => queue.push({ tag: AppActionType.ACTION, payload: i }),
              snapshot: readRef(stateRef),
              restore: (s: S) => queue.push({ tag: AppActionType.RESTORE, payload: s }),
              subscribe: subscribe_,
              run: queue.run
            })
          );
      })
    );
}
开发者ID:syaiful6,项目名称:jonggrang,代码行数:45,代码来源:genjer.ts


示例7: co

  return co(function* () {
    let needsRunning: AVar<null> = yield newEmptyAVar;
    let responseVar0: AVar<A> = yield newEmptyAVar;
    let currRef: Ref<Either<AVar<A>, A>> = yield newRef(left(responseVar0));
    function loop(responseVar: AVar<A>, ma: Maybe<A>): Task<void> {
      return co(function* () {
        yield takeAVar(needsRunning);
        const a: A = yield maybe(set.task, identity, applyMaybe(modify, ma)) as Task<A>;
        yield writeRef(currRef, right(a));
        yield putAVar(responseVar, a);
        yield delay(set.delay);
        const responseVar_: AVar<A> = yield newEmptyAVar;
        yield writeRef(currRef, left(responseVar_));
        return loop(responseVar_, just(a));
      });
    }
    yield forkTask(loop(responseVar0, nothing));

    return pure(readRef(currRef).chain(mv => {
      return isLeft(mv)  ? putAVar(needsRunning, null).chain(() => readAVar(mv.value))
        /* otherwise */  : pure(mv.value);
    }));
  });
开发者ID:syaiful6,项目名称:jonggrang,代码行数:23,代码来源:auto-update.ts


示例8: MockStorage

export const emptyMockStorage: T.Task<MockStorage> = T.co(function* () {
  const sess: RV.Ref<Record<string, SS.Session>> = yield RV.newRef({});
  const op: RV.Ref<L.List<MockOperation>> = yield RV.newRef(L.nil);

  return T.pure(new MockStorage(sess, op));
});
开发者ID:syaiful6,项目名称:jonggrang,代码行数:6,代码来源:utils.ts


示例9: action

    ? action(P.constant(getFdNothing))
    : T.bracket(initialize(duration), terminate, mfc => action(getFd(mfc)));
}

const enum Status {
  ACTIVE,
  INACTIVE
}

type MutableStatus = RV.Ref<Status>;

function status(ms: MutableStatus): T.Task<Status> {
  return RV.readRef(ms);
}

const newActiveStatus: T.Task<MutableStatus> = RV.newRef(Status.ACTIVE);

function refresh(ms: MutableStatus): T.Task<void> {
  return RV.writeRef(ms, Status.ACTIVE);
}

function inactive(ms: MutableStatus): T.Task<void> {
  return RV.writeRef(ms, Status.INACTIVE);
}

interface FdEntry {
  readonly path: string;
  readonly fd: number;
  readonly status: MutableStatus;
}
开发者ID:syaiful6,项目名称:jonggrang,代码行数:30,代码来源:fd-cache.ts



注:本文中的@jonggrang/ref.newRef函数示例由纯净天空整理自Github/MSDocs等源码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。


鲜花

握手

雷人

路过

鸡蛋
该文章已有0人参与评论

请发表评论

全部评论

专题导读
上一篇:
TypeScript ref.readRef函数代码示例发布时间:2022-05-28
下一篇:
TypeScript ref.modifyRef_函数代码示例发布时间:2022-05-28
热门推荐
热门话题
阅读排行榜

扫描微信二维码

查看手机版网站

随时了解更新最新资讯

139-2527-9053

在线客服(服务时间 9:00~18:00)

在线QQ客服
地址:深圳市南山区西丽大学城创智工业园
电邮:jeky_zhao#qq.com
移动电话:139-2527-9053

Powered by 互联科技 X3.4© 2001-2213 极客世界.|Sitemap