tag:blogger.com,1999:blog-1789878216745543897.post7429651443439042295..comments2022-10-26T21:02:35.092-07:00Comments on Paraschiv Andrei Technical Blog: Radix tree implementation in C#Paraschiv Andreihttp://www.blogger.com/profile/18109912331169645081noreply@blogger.comBlogger5125tag:blogger.com,1999:blog-1789878216745543897.post-53438543297351665852013-03-19T05:28:39.588-07:002013-03-19T05:28:39.588-07:00DoneDoneParaschiv Andreihttps://www.blogger.com/profile/18109912331169645081noreply@blogger.comtag:blogger.com,1999:blog-1789878216745543897.post-9494138951243942702013-03-19T04:03:27.272-07:002013-03-19T04:03:27.272-07:00Grab the code from here: https://github.com/parate...Grab the code from here: https://github.com/paratechnical/RadixTree I will try to update the code don't know why nothing is visible anymoreParaschiv Andreihttps://www.blogger.com/profile/18109912331169645081noreply@blogger.comtag:blogger.com,1999:blog-1789878216745543897.post-64233153374689762992013-03-19T03:56:54.378-07:002013-03-19T03:56:54.378-07:00Hi this is somashekhar i want to ask in the intern...Hi this is somashekhar i want to ask in the internal node of particia tree what it contains plz reply me???somshekharhttps://www.blogger.com/profile/00572958523012352772noreply@blogger.comtag:blogger.com,1999:blog-1789878216745543897.post-6696047324528730032012-04-18T14:14:17.112-07:002012-04-18T14:14:17.112-07:00Hi,
Sorry about that. It's the syntax highligh...Hi,<br />Sorry about that. It's the syntax highlighter messing up the code.<br />Anyway this is the proper code for line 74:<br />if ((matches == 0) || (curNode == _root) ||<br /> ((matches > 0) && (matches < wordPart.Length) && (matches >= curNode.Label.Length)))<br />and this one for 101:<br /> //go throught the two streams<br /> for (int i = 0; i < minLength; i++)<br /> {<br /> //if two characters at the same position have the same value we have one more match<br /> if(word[i] == curNode.Label[i])<br /> matches++;<br /> else<br /> //if at any position the two strings have different characters break the cycle<br /> break;<br /> }<br /> //and return the current number of matches<br /> return matches;<br /> }<br /><br />If anyone can suggest a better syntax highlighter please do so. This one has lots of bugs.<br /><br />I promise I'll upload all these codes to github or something like that as soon as I find the time.Paraschiv Andreihttps://www.blogger.com/profile/18109912331169645081noreply@blogger.comtag:blogger.com,1999:blog-1789878216745543897.post-68675743026208043422012-03-10T15:23:42.748-08:002012-03-10T15:23:42.748-08:00Hello Andrei,
Thanks for sharing your solutions.
...Hello Andrei,<br /><br />Thanks for sharing your solutions.<br /><br />Sorry to ask this but, what do you intend to do on line 055?<br /><br /> 054 if ((matches == 0) || (curNode == _root) ||<br /> 055 ((matches > 0) && (matches <>= curNode.Label.Length))) <br /><br />Using the operator <>=<br /><br />Also on line 074<br /><br /> 074 else if(matches < commonroot =" wordPart.Substring(0," branchpreviouslabel =" curNode.Label.Substring(matches," branchnewlabel =" wordPart.Substring(matches," label =" commonRoot;" newnodepreviouslabel =" new" newnodenewlabel =" new" matches ="="> curNode.Label.Length)<br /><br /> Did I miss the definition of commoroot?<br /><br />Also on line 101<br /><br /> 101 for (int i = 0; i <><br /><br />Have you finished the cycle, or you left it for us to finish it by ourselves?<br /><br />Thanks!!!Anonymousnoreply@blogger.com