登录
首页 » Java » ZookeeperClient

ZookeeperClient

于 2020-06-20 发布
0 352
下载积分: 1 下载次数: 1

代码说明:

说明:  zookper节点搭建、持久节点、临时节点创建以及动态上下线(Construction of Zookper Node and Dynamic Up and Down)

文件列表:

ZookeeperClient.java, 7580 , 2019-04-06

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • lstm
    说明:  lstm比较火热,matlab2018B已经有相应的工具箱。(LSTM is relatively hot, matlab2018B already has the corresponding toolbox.)
    2021-01-05 10:38:54下载
    积分:1
  • balancerenyesent
    用MATLAB实现模拟立方体的重构,是计算机视觉中三维重构的重要的应用实验()
    2018-05-13 14:09:32下载
    积分:1
  • jsp留言板项目带后台
    jsp留言墙,用了boot框架jq库,运用了mysql数据库,美化了登录页,自带项目介绍,可以删除,h5效果挺多的,希望大家的喜欢,本资料是在学校时做的项目,虽然不怎么完美,适合初学者使用
    2022-02-11 20:24:39下载
    积分:1
  • Versant
    面向对象数据库实验,建立点线面模型,可以用来学习面向对象数据库(Object-oriented database experiments, point, line and plane model)
    2014-01-03 08:47:07下载
    积分:1
  • jptimized
    超长整形数据计算程序,达到128位,同时计算速度进行了优化(The calculation program of super-long shaping data reaches 128 bits, and the calculation speed is optimized at the same time.)
    2018-08-04 16:51:49下载
    积分:1
  • 基于java的图书管理系统源码Java源码.zip
    基于java的图书管理系统源码Java源码.zip
    2020-02-02下载
    积分:1
  • 贵州学研究生库实验报告
    说明:  每组不超过4人,每人从TPC-H中选择至少三个查询进行执行,并进行性能调整。同组人员所选择的查询不能相同。各查询均必须包含:两个以上的表连接操作,其包含至少一个聚集函数。 每位同学的该作业均放在一个命名如“姓名-学号-专业-作业1”的目录中 用尽能想到的所有技术方法,使得选定的查询的某些性能指标尽可能的差 用尽能想到的所有技术方法,使得选定的查询的某些性能指标尽可能的好(Each group has no more than 4 people. Each person selects at least three queries from TPC-H to perform and performs performance adjustment. The queries selected by the same group can not be the same. Each query must contain more than two table join operations, which contain at least one aggregation function. Each student's homework is placed in a directory named "name student number professional operation 1". Using all the technical methods that can be thought of, make certain performance indicators of selected queries as poor as possible. Use all the technical methods that you can think of, and make certain performance indicators of selected queries as good as possible.)
    2018-07-07 22:23:26下载
    积分:1
  • 1
    说明:  The famous Collatz sequence is generated by a method decribed as follows. Given a positive integer N, if it is odd, then replace it with 3*N+1. For even number N, use N/2 instead. You can get a sequence of number by this method. It is conjectured that the algorithm above will terminate at 1 for any integral input value. Despite the simplicity of the algorithm, it is unknown whether this conjecture is true. It has been verified, however, for all integers n such that 0 < n < 1,000,000 (and, in fact, for many more numbers than this.) (Input The first line contains a single integer T tells that there are T cases in the problem. Then for each case, there is an integers N. Output For each number N, output the sequence generated in a line, using coma as its separator. )
    2012-12-08 20:33:43下载
    积分:1
  • uity605
    pku acm 1001,share it and enjoy it acm pku edu cn if you have any
    2018-11-18 11:27:53下载
    积分:1
  • and_jnd
    北京大学acm,关于交通路灯,以及交通运行车辆路线(Peking University acm, on traffic lights and traffic routes)
    2018-11-19 07:07:03下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载