What is the reason of extra '=0'












0















I know the reason is the incompatibility of the packages, but I tried all the possibilities and I couldn't reach to the point of removing '=0' without changing the algorithm style I want.
.





documentclass{IEEEtran}




%usepackage{algorithm}



%usepackage{algorithmicx}



%usepackage{algcompatible}



usepackage[linesnumbered,ruled]{algorithm2e}



usepackage[noend]{algpseudocode}% http://ctan.org/pkg/algorithmicx



usepackage{float}



begin{document}



begin{algorithm}



SetKwInOut{Input}{Input}



SetKwInOut{Output}{Output}



Input{The .}



Output{M $T$.}



Procedure {Update}{$Index, CurrentNode$}



eIf {$index$ not in $CurrentNode.MapTable$}{



begin{algorithmic}[1]



State Create a new entry in $CurrentNode.MapTable$;



State Insert $index$ in the new entry;



State Create a new node $E$;



State Create a new entry in the $CurrentNode.children$, correspond to
previously created entry;



State Make the new entry point to E;



State $E.parent$ $leftarrow$ $CurrentNode$;



State $CurrentNode$ $leftarrow$ $E$;



State Initialize $CurrentNode$ materialization and entries;



end{algorithmic}



}{



begin{algorithmic}[1]



State $CurrentNode$ $leftarrow$ Child pointed by
$CurrentNode.children$ entry corresponding to the $index$ entry in the
$CurrentNode.MapTable$;



State Update $CurrentNode$ materialization and entries;



end{algorithmic}



}



EndProcedure



For{$ileftarrow 1$ KwTo $N$}{



For{$lleftarrow 1$ KwTo $h$}{



    State  $index [l]$  $leftarrow$ generate index of data object $O_i$ 


for level $l$ using $W_l$;



}



eIf{$T.root$ is Null }{



  State Create a $root$ node ;


}{



  State $CurrentNode$ = $root$ ;

CALL textsc{Update}{$(Index, CurrentNode)$};


}



For{$lleftarrow 2$ KwTo $h-1$}{

CALL textsc{Update}{$(Index, CurrentNode)$};

}


}



caption{Build}



end{algorithm}



end{document}










share









New contributor




AboAli Almusawi is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
















  • 2





    Welcome to TeX.SX. Remove all > in the input, mark the code and press the curly braces in the input editor. That way the code gets proper highlighting.

    – Johannes_B
    6 mins ago
















0















I know the reason is the incompatibility of the packages, but I tried all the possibilities and I couldn't reach to the point of removing '=0' without changing the algorithm style I want.
.





documentclass{IEEEtran}




%usepackage{algorithm}



%usepackage{algorithmicx}



%usepackage{algcompatible}



usepackage[linesnumbered,ruled]{algorithm2e}



usepackage[noend]{algpseudocode}% http://ctan.org/pkg/algorithmicx



usepackage{float}



begin{document}



begin{algorithm}



SetKwInOut{Input}{Input}



SetKwInOut{Output}{Output}



Input{The .}



Output{M $T$.}



Procedure {Update}{$Index, CurrentNode$}



eIf {$index$ not in $CurrentNode.MapTable$}{



begin{algorithmic}[1]



State Create a new entry in $CurrentNode.MapTable$;



State Insert $index$ in the new entry;



State Create a new node $E$;



State Create a new entry in the $CurrentNode.children$, correspond to
previously created entry;



State Make the new entry point to E;



State $E.parent$ $leftarrow$ $CurrentNode$;



State $CurrentNode$ $leftarrow$ $E$;



State Initialize $CurrentNode$ materialization and entries;



end{algorithmic}



}{



begin{algorithmic}[1]



State $CurrentNode$ $leftarrow$ Child pointed by
$CurrentNode.children$ entry corresponding to the $index$ entry in the
$CurrentNode.MapTable$;



State Update $CurrentNode$ materialization and entries;



end{algorithmic}



}



EndProcedure



For{$ileftarrow 1$ KwTo $N$}{



For{$lleftarrow 1$ KwTo $h$}{



    State  $index [l]$  $leftarrow$ generate index of data object $O_i$ 


for level $l$ using $W_l$;



}



eIf{$T.root$ is Null }{



  State Create a $root$ node ;


}{



  State $CurrentNode$ = $root$ ;

CALL textsc{Update}{$(Index, CurrentNode)$};


}



For{$lleftarrow 2$ KwTo $h-1$}{

CALL textsc{Update}{$(Index, CurrentNode)$};

}


}



caption{Build}



end{algorithm}



end{document}










share









New contributor




AboAli Almusawi is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
















  • 2





    Welcome to TeX.SX. Remove all > in the input, mark the code and press the curly braces in the input editor. That way the code gets proper highlighting.

    – Johannes_B
    6 mins ago














0












0








0








I know the reason is the incompatibility of the packages, but I tried all the possibilities and I couldn't reach to the point of removing '=0' without changing the algorithm style I want.
.





documentclass{IEEEtran}




%usepackage{algorithm}



%usepackage{algorithmicx}



%usepackage{algcompatible}



usepackage[linesnumbered,ruled]{algorithm2e}



usepackage[noend]{algpseudocode}% http://ctan.org/pkg/algorithmicx



usepackage{float}



begin{document}



begin{algorithm}



SetKwInOut{Input}{Input}



SetKwInOut{Output}{Output}



Input{The .}



Output{M $T$.}



Procedure {Update}{$Index, CurrentNode$}



eIf {$index$ not in $CurrentNode.MapTable$}{



begin{algorithmic}[1]



State Create a new entry in $CurrentNode.MapTable$;



State Insert $index$ in the new entry;



State Create a new node $E$;



State Create a new entry in the $CurrentNode.children$, correspond to
previously created entry;



State Make the new entry point to E;



State $E.parent$ $leftarrow$ $CurrentNode$;



State $CurrentNode$ $leftarrow$ $E$;



State Initialize $CurrentNode$ materialization and entries;



end{algorithmic}



}{



begin{algorithmic}[1]



State $CurrentNode$ $leftarrow$ Child pointed by
$CurrentNode.children$ entry corresponding to the $index$ entry in the
$CurrentNode.MapTable$;



State Update $CurrentNode$ materialization and entries;



end{algorithmic}



}



EndProcedure



For{$ileftarrow 1$ KwTo $N$}{



For{$lleftarrow 1$ KwTo $h$}{



    State  $index [l]$  $leftarrow$ generate index of data object $O_i$ 


for level $l$ using $W_l$;



}



eIf{$T.root$ is Null }{



  State Create a $root$ node ;


}{



  State $CurrentNode$ = $root$ ;

CALL textsc{Update}{$(Index, CurrentNode)$};


}



For{$lleftarrow 2$ KwTo $h-1$}{

CALL textsc{Update}{$(Index, CurrentNode)$};

}


}



caption{Build}



end{algorithm}



end{document}










share









New contributor




AboAli Almusawi is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.












I know the reason is the incompatibility of the packages, but I tried all the possibilities and I couldn't reach to the point of removing '=0' without changing the algorithm style I want.
.





documentclass{IEEEtran}




%usepackage{algorithm}



%usepackage{algorithmicx}



%usepackage{algcompatible}



usepackage[linesnumbered,ruled]{algorithm2e}



usepackage[noend]{algpseudocode}% http://ctan.org/pkg/algorithmicx



usepackage{float}



begin{document}



begin{algorithm}



SetKwInOut{Input}{Input}



SetKwInOut{Output}{Output}



Input{The .}



Output{M $T$.}



Procedure {Update}{$Index, CurrentNode$}



eIf {$index$ not in $CurrentNode.MapTable$}{



begin{algorithmic}[1]



State Create a new entry in $CurrentNode.MapTable$;



State Insert $index$ in the new entry;



State Create a new node $E$;



State Create a new entry in the $CurrentNode.children$, correspond to
previously created entry;



State Make the new entry point to E;



State $E.parent$ $leftarrow$ $CurrentNode$;



State $CurrentNode$ $leftarrow$ $E$;



State Initialize $CurrentNode$ materialization and entries;



end{algorithmic}



}{



begin{algorithmic}[1]



State $CurrentNode$ $leftarrow$ Child pointed by
$CurrentNode.children$ entry corresponding to the $index$ entry in the
$CurrentNode.MapTable$;



State Update $CurrentNode$ materialization and entries;



end{algorithmic}



}



EndProcedure



For{$ileftarrow 1$ KwTo $N$}{



For{$lleftarrow 1$ KwTo $h$}{



    State  $index [l]$  $leftarrow$ generate index of data object $O_i$ 


for level $l$ using $W_l$;



}



eIf{$T.root$ is Null }{



  State Create a $root$ node ;


}{



  State $CurrentNode$ = $root$ ;

CALL textsc{Update}{$(Index, CurrentNode)$};


}



For{$lleftarrow 2$ KwTo $h-1$}{

CALL textsc{Update}{$(Index, CurrentNode)$};

}


}



caption{Build}



end{algorithm}



end{document}








algorithms





share









New contributor




AboAli Almusawi is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.










share









New contributor




AboAli Almusawi is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.








share



share








edited 4 mins ago









moewe

94k10115354




94k10115354






New contributor




AboAli Almusawi is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked 8 mins ago









AboAli AlmusawiAboAli Almusawi

11




11




New contributor




AboAli Almusawi is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





AboAli Almusawi is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






AboAli Almusawi is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.








  • 2





    Welcome to TeX.SX. Remove all > in the input, mark the code and press the curly braces in the input editor. That way the code gets proper highlighting.

    – Johannes_B
    6 mins ago














  • 2





    Welcome to TeX.SX. Remove all > in the input, mark the code and press the curly braces in the input editor. That way the code gets proper highlighting.

    – Johannes_B
    6 mins ago








2




2





Welcome to TeX.SX. Remove all > in the input, mark the code and press the curly braces in the input editor. That way the code gets proper highlighting.

– Johannes_B
6 mins ago





Welcome to TeX.SX. Remove all > in the input, mark the code and press the curly braces in the input editor. That way the code gets proper highlighting.

– Johannes_B
6 mins ago










0






active

oldest

votes











Your Answer








StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "85"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});






AboAli Almusawi is a new contributor. Be nice, and check out our Code of Conduct.










draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2ftex.stackexchange.com%2fquestions%2f480208%2fwhat-is-the-reason-of-extra-0%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes








AboAli Almusawi is a new contributor. Be nice, and check out our Code of Conduct.










draft saved

draft discarded


















AboAli Almusawi is a new contributor. Be nice, and check out our Code of Conduct.













AboAli Almusawi is a new contributor. Be nice, and check out our Code of Conduct.












AboAli Almusawi is a new contributor. Be nice, and check out our Code of Conduct.
















Thanks for contributing an answer to TeX - LaTeX Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2ftex.stackexchange.com%2fquestions%2f480208%2fwhat-is-the-reason-of-extra-0%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

A CLEAN and SIMPLE way to add appendices to Table of Contents and bookmarks

Calculate evaluation metrics using cross_val_predict sklearn

Insert data from modal to MySQL (multiple modal on website)