search for: invervals

When I was studying the function cut I found this example: > x <- rep(0:8, tx0) > x [1] 0 0 0 0 0 0 0 0 0 1 1 1 1 2 2 2 2 2 2 3 3 3 3 3 4 4 4 5 5 5 5 5 5 5 5 5 5 6 [39] 6 6 6 6 7 7 7 8 8 8 8 8 > cut(x, b = 8) [1] (-0.008,0.994] (-0.008,0.994] (-0.008,0.994] (-0.008,0.994] (-0.008,0.994] [6] (-0.008,0.994] (-0.008,0.994] (-0.008,0.994] (-0.008,0.994] (0.994,2] [11] (0.994,2]

...you get something that looks right, let me know and I'll apply it :) > On a related note, I'm a bit surprised that 2-nd order partition consists of > basic blocks. I'd more expect that it consisted of Interval's. As it stands, > it's not easy to tell which 1-st order invervals are contained in a given > 2-nd order interval. That does seem strange. If you would like to change/refactor this code, feel free. -Chris -- http://nondot.org/sabre/ http://llvm.cs.uiuc.edu/

...' is after the change. I must admit the change does not look 100% right to me yet. On a related note, I'm a bit surprised that 2-nd order partition consists of basic blocks. I'd more expect that it consisted of Interval's. As it stands, it's not easy to tell which 1-st order invervals are contained in a given 2-nd order interval. - Volodya -------------- next part -------------- A non-text attachment was scrubbed... Name: IntervalPartition.diff Type: text/x-diff Size: 1456 bytes Desc: not available URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20050429/396466...

...looks right, let me know and I'll apply > it :) > > > On a related note, I'm a bit surprised that 2-nd order partition consists > > of basic blocks. I'd more expect that it consisted of Interval's. As it > > stands, it's not easy to tell which 1-st order invervals are contained in > > a given 2-nd order interval. > > That does seem strange. If you would like to change/refactor this code, > feel free. Okay. I've done first round of refactoring and currently writing some code of mine that uses IntervalPartition which should uncover any re...