network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 5 months |
| seen | Jan 10 '12 at 13:54 | |
| stats | profile views | 8 |
|
Dec 9 |
awarded | Popular Question |
|
Jan 10 |
comment |
How to find Sub-trees in non-binary tree BlackJack , i would have to travel "down" and "up" right (for every not visited node)? |
|
Jan 10 |
revised |
How to find Sub-trees in non-binary tree added 405 characters in body |
|
Jan 10 |
comment |
How to find Sub-trees in non-binary tree not exact, group is not defined bu number of the children!!!the group defined if there is a kind of "closure" between nodes where root it self is not part of the closure. as you can see from the graph you can't travel from pink to other nodes (you CAN NOT use root). from brown node you can travel to it's child so the form another group, and you can travel from any cyan node to other cyan nodes so the form another group :) |
|
Jan 10 |
awarded | Commentator |
|
Jan 10 |
comment |
How to find Sub-trees in non-binary tree Martijn Verburg, the root is the circle it has 4 direct connected nodes. the pink child node is single (doesn't have any children) so it's goes to first group. The brown child has another child, both of them connected so they go second group. Now there are 2 cyan children, but they are linked together (they are connected by a child) so they all go into same group. |
|
Jan 10 |
comment |
How to find Sub-trees in non-binary tree yes,child trees of the root |
|
Jan 10 |
asked | How to find Sub-trees in non-binary tree |
|
Dec 23 |
comment |
Right multi object dependance design what drawing tool in StackExchange ? I am not familiar with it |
|
Dec 23 |
comment |
Right multi object dependance design yes for buffer I use java.util.concurrent. I read the data from source string by string and push(currentString). So getting data and pushing must work in parallel and not like you offered. In the scenario without sorting the push method executes in loop: String str =getNextString(); pushtobuffer(str); So I can't split |
|
Dec 23 |
comment |
Right multi object dependance design sorting is string-based sort, I need to sort all input from source and only after every thing is sorted I can push() data to buffer for consumer to read, actually as I start merge sorting the files I can start pushing the results to buffer |
|
Dec 23 |
asked | Right multi object dependance design |
|
Dec 18 |
asked | Sharing buffer between multiple threads part 2 |
|
Dec 12 |
awarded | Student |
|
Dec 4 |
comment |
Sharing buffer between multiple threads I am reading from 200mb file of data, I read portion of into the buffer, consumers will pull it from buffer and process it and so on until the file is finished. |
|
Dec 4 |
comment |
Sharing buffer between multiple threads yes, multiple number of consumers (number of consumers is determined on runtime), read same data from the producer. (each consumer will do a different job on this input data). The producers is not aware of how many consumers it has, it can only signal that it's done writing data to buffer. |
|
Dec 4 |
comment |
Sharing buffer between multiple threads I still can't understand how do I know it the item inside the buffer was been read by all consumers and it can be removed? |
|
Dec 4 |
comment |
Sharing buffer between multiple threads but again it doesn't solve the main problem: the buffer must have a limit, let's say size of N items. if i have circular buffer with 2 pointers and one consumer it's not a problem to "simulate" FIFO. but when there are X consumers how do I know when I should "popout" item that was already read by all consumers? |
|
Dec 4 |
comment |
Sharing buffer between multiple threads @Patrick, thanks but I asked for solution without any "wrappers" (this includes 3rd party libs) |
|
Dec 4 |
revised |
Sharing buffer between multiple threads added 61 characters in body |
