kafka 问题 如何解决啊，求助_百度知道
kafka 问题 如何解决啊，求助
\char ch1;&#92: &quot,nIwhile ((();nIif ( .length = 0;= L; 1 )||( i &printf ( &-- L;} while ( ch1 == &printf ( &;#define elemtype inttypedef struct{ elemtype *initlist_sq ( L );, \c&quot, &L;} while ( ch2 == &quot: 0; ))&&( i &scanf ( &quot, elemtype e ){ if ( i &/scanf (&quot.; &#92.length ) return i! newbase ) exit ( 1 );listdelete_sq ( L; --p )*( p+1 )=* p.listize )){ printf (&nC)!= &int i=0, ins ).length.Exit 1.elem + L;}q = &( L: %d &listinsert_sq ( L, &ch2 ).length && ;nI);\ ).Find &scanf ( &quot, elemtype e: { do{ printf ( &mInput the address where to delete, elemtype )){ i = 1, j=0;char m, &loc);n& \c&L; );scanf ( &scanf ( &}\int listsize: { do{ printf ( &while ( i &lt, dell.length )) return 2;;nDo you want to input your datas(yes-anykey|no-n), ch2!L;for ( p = &( L!= &quot!= &quot.length.elem[i-1] ); ||= q!= &);q = L: %d &if ( ;mInput the dascanf ( &= L;c&nInput the dat&#92, loc );\);\?&scanf ( &\initlist_sqstatus listinsert_sq ( sqlist &L ;switch ( n ){ case 1 ;for ( ++p;L;locateelem_sq ( L;\scanf (&N&t %c&;nFind again(yes-angkey|no-n);N&quot.Insret 2:}if ( m : %d &.elem =( elemtype* ) malloc ( list_init_size * sizeof ( elemtype ));if ( L; || m.elem, &ch1 );\;status initlist_sq ( sqlist &L ){ L;elseL;return 0;p = &( L.listsize=list_init_size?&}void main(){ sqlist L.Delete 3.h& || ch2 == &nInput.length - 1] ), &n ); L?&}case 2 .length + 1 ){ newbase = ( elemtype * ) realloc ( L, &insl);nDelete again(yes-angkey|no-n): %d &nPle}case 3 ;do{ printf ( &t %d &} while ( ch2 == &++L!( *compare )( *p++ , del.elem[i] );return 0,\scanf ( & &#92:&quot.length - 1; || ch1 == &quot, del ).elem = newbase, ch3;n&quot:&mInput the add, &dell);e = *p:&n&); );}status listdelete_sq ( sqlist &L ; p &nInsert again(yes-angkey|no-n).elem[i-1] ); )L, e )) ++1;printf ( &quot,printf (&quot, elemtype &e ){ if (( i &} /n&#define list_init_sise 6#define listincrement 1/ 1 || i &L;nIif ( i &&#92.length &gt, &m );scanf ( &.listisize + listincrement ) * sizeof ( elemtype ));*#define listsize 6 */&#92.elem[L;&#92,= q: %d &quot: { do{ printf ( & L;&#92:& );}case 0 ; p & ), &ch2 ); ++p )=+ p, int i .length =j++;n&else return 0.elem ) exit ( 1 ), &ins );printf ( &}int locateelem_sq ( sqlist L.listsize +=); );= L,status ( *compare )( elmetype : &N&quot,( L; || ch2 == &N&quot: L ) return 2;p = L;N&&#92#include&lt
其他类似问题
为您推荐：
等待您来回答
下载知道APP
随时随地咨询
出门在外也不愁kafka问题求助_百度知道
kafka问题求助
我有更好的答案
1;K是钼或铝;外套为储气部分(直径约45mm)...氦氖激光器的结构 氦氖(He-Ne)激光器的结构一般由放电管和光学谐振腔所组成,称作放电管(直径为1mm左右),作为阳极。激光管的中心是一根毛细玻璃管;A是钨棒答
其他类似问题
为您推荐：
等待您来回答
下载知道APP
随时随地咨询
出门在外也不愁在OpenSOC环境部署过程中，向storm提交拓扑时，报zookeeper错误信息，求助 - 开源中国社区
当前访客身份：游客 [
当前位置：
运行 OpenSOC的示例程序 ，向storm中提交拓扑
出现如下错误log日志信息，程序不能正常运行
29246 [Thread-24-KafkaSpout] ERROR backtype.storm.util - Async loop died!
java.lang.NoSuchMethodError: org.apache.zookeeper.ZooKeeper.&init&(Ljava/lang/SILorg/apache/zookeeper/WZ)V
at org.apache.curator.utils.DefaultZookeeperFactory.newZooKeeper(DefaultZookeeperFactory.java:29) ~[OpenSOC-Topologies-0.6BETA.jar:na]
at org.apache.curator.framework.imps.CuratorFrameworkImpl$2.newZooKeeper(CuratorFrameworkImpl.java:169) ~[OpenSOC-Topologies-0.6BETA.jar:na]
at org.apache.curator.HandleHolder$1.getZooKeeper(HandleHolder.java:94) ~[OpenSOC-Topologies-0.6BETA.jar:na]
at org.apache.curator.HandleHolder.getZooKeeper(HandleHolder.java:55) ~[OpenSOC-Topologies-0.6BETA.jar:na]
at org.apache.curator.ConnectionState.reset(ConnectionState.java:219) ~[OpenSOC-Topologies-0.6BETA.jar:na]
at org.apache.curator.ConnectionState.start(ConnectionState.java:103) ~[OpenSOC-Topologies-0.6BETA.jar:na]
at org.apache.curator.CuratorZookeeperClient.start(CuratorZookeeperClient.java:188) ~[OpenSOC-Topologies-0.6BETA.jar:na]
at org.apache.curator.framework.imps.CuratorFrameworkImpl.start(CuratorFrameworkImpl.java:234) ~[OpenSOC-Topologies-0.6BETA.jar:na]
at storm.kafka.ZkState.&init&(ZkState.java:62) ~[OpenSOC-Topologies-0.6BETA.jar:na]
at storm.kafka.KafkaSpout.open(KafkaSpout.java:85) ~[OpenSOC-Topologies-0.6BETA.jar:na]
at backtype.storm.daemon.executor$eval5100$fn__5101$fn__5116.invoke(executor.clj:519) ~[na:na]
at backtype.storm.util$async_loop$fn__390.invoke(util.clj:431) ~[na:na]
at clojure.lang.AFn.run(AFn.java:24) [clojure-1.4.0.jar:na]
at java.lang.Thread.run(Thread.java:745) [na:1.7.0_79]
参考其他网络帮助，说是 zookeeper版本不正确， 但是好像我第一次提交拓扑的时候就没有出现这种问题，
程序运行正常，之后再次提交的时候，环境也没有变化，就是重启了下集群环境，确认storm &kafka zookeeper工作正常，而且也确认了pom.xml中的依赖中没有zk的版本消息，想各位请教下
共有2个答案
<span class="a_vote_num" id="a_vote_num_
同样的问题，解决了吗？
<span class="a_vote_num" id="a_vote_num_
很抱歉现在才看到，我之前报这种错误考虑是版本的问题，最后重新换了 Zookeeper3.3.6的版本才解决的，貌似
更多开发者职位上
有什么技术问题吗？
Kkidou...的其它问题
类似的话题kafka 问题 如何解决啊，求助_百度知道
kafka 问题 如何解决啊，求助
提问者采纳
&#92.elem[i-1] );nFind again(yes-angkey|no-n);;&#92;nI.length &nChoice: &= L;, ch2, elemtype e!( *compare )( *p++ : { do{ printf ( &quot.length )&#92?&);listdelete_sq ( L; &#92;N&int length, j=0;if ( ;scanf (&switch ( n ){ case 1 ;initlist_sq ( L )!= &;e = *p;return 0;;char m.length = j.Exit 1.length + 1 ){ newbase = ( elemtype * ) realloc ( L;scanf ( &quot, dell, &m );&#92;&#92;printf ( &quot!L, del: %d &do{ printf ( &scanf ( &return 0,scanf ( &p = L;&#92, loc ), elemtype &e ){ if (( i &lt.length - 1;=&#92;L;}int i=0, &ch1 ),status ( *compare )(nInput the data you want to insert: 0;printf ( &while ( i &if ( L;char ch1, &insl);nPlease input your datas.elem + L;locateelem_sq ( L; &#92;&#92;c&printf (&quot!= &-- L.Find &quot.h& L;= L;initlist_sqstatus listinsert_sq ( sqlist &L , &loc);: { do{ printf ( &quot.elem.elem[i-1] ), &L;nInsert again(yes-angkey|no-n);: %d &quot: %d &quot.length = 0.elem = newbase, ins );t %d &quot:&N&);n&L; 1 )||( i &gt.listsize=list_init_= L;),q = L;}status listdelete_sq ( sqlist &L ;&#92.length )) return 2;scanf ( &quot, elemtype )){ i = 1;++L;} while ( ch2 == & )L;n&printf ( & &#92:}if (&#92; ): { do{ printf ( &quot.elem[L;);)!= &quot!= &#define list_init_sise 6#define listincrement 1/j++:&quot.Delete 3;&#92:&quot: &quot.elem ) exit ( 1 );while (((elseL; p &nDelete again(yes-angkey|no-n); ), e )) ++1;scanf ( &).mInput the da*#define listsize 6 */n&else return 0;} while ( ch1 == &}void main(){ sqlist L, del ):&listinsert_sq ( L;N&scanf ( &L;} while ( ch2 == &scanf (&}q = &( L; );N&quot.listize )){ printf (&quot: %d &#define elemtype inttypedef struct{ elemtype *nIN&quot: %d &quot,p = &( L.length - 1] );if ( i &lt.length.listisize + listincrement ) * sizeof ( elemtype )).elem[i] );nInput,&#47, &ch2 )! newbase ) exit ( 1 );c&; || ch1 == &n&; || ).length && ;status initlist_sq ( sqlist &L ){ L;&#92;} / --p )*( p+1 )=* 1 || i &gt, &dell);}int locateelem_sq ( sqlist L;t %c&quot?&quot.elem =( elemtype* ) malloc ( list_init_size * sizeof ( elemtype )), &ch2 ); || ch2 == &int insl,( L; L ) return 2;;&#92;for ( p = &( L;nDo you want to input your datas(yes-anykey|no-n);}case 2 ; ++p )=+scanf ( &nInput, int i ,mInput the add&#92;for ( ++p;=&#92, &ins );mInput the address where to delete, &n ); L; ||c&quot.Insret 2.listsize +=nI p &scanf ( &quot.&#92;}case 3 #include& );&#92;printf ( &quot, elemtype e ){ if ( i &lt: break, ch3;if ( ?&}case 0 ; ););n& || ch2 == & ))&&( i &lt
来自团队：
其他类似问题
为您推荐：
等待您来回答
下载知道APP
随时随地咨询
出门在外也不愁kafka 问题 如何解决啊，求助_百度知道
kafka 问题 如何解决啊，求助
#include&stdio.h& #define list_init_sise 6 #define listincrement 1 /*#define listsize 6 */ #define elemtype int typedef struct { elemtype * }
status initlist_sq ( sqlist &L ) { L.elem =( elemtype* ) malloc ( list_init_size * sizeof ( elemtype )); if ( !L.elem ) exit ( 1 ); int i=0, j=0; printf (& &#92;nDo you want to input your datas(yes-anykey|no-n): &); scanf (& &#92;t %c&, &m ); L.listsize=list_init_ while ((( m != &n& || m != &N& ))&&( i & L.listize )) { printf (& &#92;nPlease input your datas: &); scanf (& &#92;t %d &, &L.elem[i] ); j++: } if ( m != &n& || m!= &N& ) L.length = 0; else L.length = return 0; } //initlist_sq
status listinsert_sq ( sqlist &L , int i , elemtype e ) { if ( i & 1 || i & L ) return 2; if ( L.length &= L.length + 1 ) { newbase = ( elemtype * ) realloc ( L.elme , ( L.listisize + listincrement ) * sizeof ( elemtype )); if ( ! newbase ) exit ( 1 ); L.elem = L.listsize += } q = &( L.elem[i-1] ); for ( p = &( L.elem[L.length - 1] ); p &= --p ) *( p+1 )=* ++L. return 0; }
status listdelete_sq ( sqlist &L , int i , elemtype &e ) { if (( i & 1 )||( i & L.length )) return 2; p = &( L.elem[i-1] ); e = *p; q = L.elem + L.length - 1; for ( ++p; p &= ++p ) =+ -- L. }
int locateelem_sq ( sqlist L, elemtype e, status ( *compare )( elmetype , elemtype )) { i = 1; p = L. while ( i &= L.length && !( *compare )( *p++ , e )) ++1; if ( i &= L.length ) else return 0; }
void main() { sqlist L; int ins, del, int insl, dell, char ch1, ch2, ch3; initlist_sq ( L ); do { printf ( &&#92;nChoice: 0.Exit 1.Insret 2.Delete 3.Find &); scanf ( &&#92;nInput: %d &, &n ); switch ( n ) { case 1 : { do { printf ( &&#92;nInput the data you want to insert:&); scanf ( &&#92;nInput: %d &, &ins ); printf ( &&#92;mInput the address where to insert:&); scanf ( &&#92;nInput: %d &, &insl); listinsert_sq ( L, insl, ins ); printf ( &&#92;nInsert again(yes-angkey|no-n)?& ); scanf ( &&#92;c&, &ch1 ); } while ( ch1 == &N& || ch1 == &n& ); }
case 2 : { do { printf ( &&#92;mInput the address where to delete:&); scanf ( &&#92;nInput: %d &, &dell); listdelete_sq ( L, dell, del ); printf ( &&#92;nDelete again(yes-angkey|no-n)?& ); scanf ( &&#92;c&, &ch2 ); } while ( ch珐础粹飞诔读达嫂惮讥2 == &N& || ch2 == &n& ); }
case 3 : { do { printf ( &&#92;mInput the datas you want to find:&); scanf ( &&#92;nInput: %d &, &loc); locateelem_sq ( L, loc ); printf ( &&#92;nFind again(yes-angkey|no-n)?& ); scanf ( &&#92;c&, &ch2 ); } while ( ch2 == &N& || ch2 == &n& ); } case 0 : }
知道智能回答机器人
我是知道站内的人工智能，可高效智能地为您解答问题。很高兴为您服务。
其他类似问题
为您推荐：
等待您来回答
下载知道APP
随时随地咨询
出门在外也不愁