| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | |||
| 2 | /*************************************** | ||
| 3 | Auteur : Pierre Aubert | ||
| 4 | Mail : pierre.aubert@lapp.in2p3.fr | ||
| 5 | Licence : CeCILL-C | ||
| 6 | ****************************************/ | ||
| 7 | |||
| 8 | #include "PNTreeLightNode.h" | ||
| 9 | |||
| 10 | ///Says is the neighbours search is finised | ||
| 11 | /** @param tabIsNeighbourChecked : tab of the neighbours search status (true if checked, false if not) | ||
| 12 | * @param nbNeighbour : number of neighbours in the table | ||
| 13 | * @return true if all the tabIsNeighbourChecked is true, false otherwise | ||
| 14 | */ | ||
| 15 | 2 | bool isNeighbourSearchFinised(const bool * tabIsNeighbourChecked, unsigned int nbNeighbour){ | |
| 16 | 2 | bool b(true); | |
| 17 |
2/2✓ Branch 0 (4→3) taken 2 times.
✓ Branch 1 (4→5) taken 2 times.
|
4 | for(unsigned int i(0u); i < nbNeighbour; ++i){ |
| 18 | 2 | b &= tabIsNeighbourChecked[i]; | |
| 19 | } | ||
| 20 | 2 | return b; | |
| 21 | } | ||
| 22 | |||
| 23 | |||
| 24 |