Is Finished

Search BackLinks only
Display context of search results
Case-sensitive searching

• ScheduledWalk/석천 . . . . 34 matches
        while (!IsFinished()) {
       BOOL IsFinished() {
       BOOL IsFinished();
        while (!IsFinished()) {
       BOOL IsFinished() {
       해당 함수 모듈이 완료되었을 것이라 가정하고 코드를 작성해봅니다. 여기서는 IsFinished() 에 일단 주목. (가장 깊은 단계인 IsJourneyEnd 와 IsAllBoardChecked 를 실행해주는 부분이므로)
       BOOL IsFinished() {
       BOOL IsFinished() {
       BOOL IsFinished() {
        BOOL IsFinished(PSTR journey, int currentPosition, int* board, int maxRow, int maxCol);
        testIsFinished();
        while (!IsFinished(journey, currentJourneyPosition, board, maxRow, maxCol)) {
       3. while 루프 조건이 틀리다는 뜻은 IsFinished() 가 올바르지 않았다라는 뜻이다.
       4. IsFinished() 가 잘못되었다는 뜻은 IsJourneyEnd, IsAllBoardChecked 둘 중 하나 이상이 잘못되었다는 뜻이다.
        BOOL IsFinished(PSTR journey, int currentPosition, int* board, int maxRow, int maxCol);
        void testIsFinished();
        testIsFinished();
        while (!IsFinished(journey, currentJourneyPosition, board, maxRow, maxCol)) {
       void testIsFinished() {
        assert(IsFinished(journey, currentPosition, board, maxRow, maxCol) == false);
• ScheduledWalk/창섭&상규 . . . . 4 matches
        * 여정이 끝났는지 확인할 수 있다.(IsFinished)
        if(IsFinished())
        bool IsFinished()
        while(MyBoard->IsAllCellsPassed()==false || journey->IsFinished()==false)
• SpiralArray/Leonardong . . . . 2 matches
        def testIsFinished(self):
        def isFinished( self, board ):
        def testIsFinished(self):
        self.assertEquals( False, self.mover.isFinished( self.board ) )
        self.assertEquals( True, self.mover.isFinished( self.board ) )
        while ( not mover.isFinished( board ) ):

Found 3 matching pages out of 7540 total pages (5000 pages are searched)

You can also click here to search title.