#isempty

[jimsjoo]

배열이 비어 있는 가

배열이 비어 있는 가

상태를 알기 위한 코드를 작성하는 방법중 간단한 방법은 에러가 날 수 있는 코드를 만들고, 에러가 발생하는 지 체크하는 것이다. 배열이 공복이라면 UBound(anArray, 1)에서 에러가 날 것이고 , 발생한 에러코드는 Err.Number를 통해 확인한다. Function IsVarArrayEmpty(anArray As Variant) As Boolean '// 배열이 비어 있는 가 검사 Dim i As Integer On Error Resume Next i = UBound(anArray, 1) If Err.Number = 0 Then IsVarArrayEmpty = False Else IsVarArrayEmpty = True End If End Function

View On WordPress

[fmprogurus]

The FileMaker IsEmpty Function

The IsEmpty function is a developer favorite, as is its opposite, Not IsEmpty.  Quite often a developer will test a field for any content to ascertain the status of a record:  someone who has responded, or it active in an organization, for example.

IsEmpty IsEmpty( field) FMP Version: All Current Versions Of FileMaker

This function checks to see if a specified field is empty or not. If the field…

View On WordPress

[wilipat]

Methoden extrahieren

Ich bin oft an den Punkt gestossen wo ich es unschön fand eine Collection zuerst auf null und dann noch zu kontrollieren ob sie Inhalte enthält. Ich musst somit zwei Abfragen durchführen, was meinen Code nicht sehr lesbar machte. Ich denke nur daran, dass diese Schritte innerhalb einer Methode ev. mehrmals durchgeführt werden müssen.

CollectionUtils.isEmpty();

ArrayUtils.isEmpty();

Die beiden Abfragen der Hilfs-Bibliotheken führen mir diese Schritte durch.

Allgemein ist es sinnvoll abkappselbare Teile in Methoden zu extrahieren. Beispiel von kurz und knackigen Methodennamen:

isZip();

isValid();

[ictjobs-blog]

New Post has been published on Learning Hub

New Post has been published on http://ictjobs.info/program-illustrate-stack-operations-macros/

C Program to Illustrate Stack Operations using MACROS

#include <stdio.h> #include <stdlib.h> #define MAX 5 #define EMPTY "Stack is Empty" #define OVERFLOW "Stack Overflow" #define ISOVERFLOW top >= MAX - 1 /*Macro to find whether the stack is full*/ #define ISEMPTY top == -1    /*Macro to find whether the stack is empty*/ void push(int); void pop(); void display(); void stacksize(); void destroy(); void stackfull(); int top = -1; int stack[MAX]; void main() int choice, value; while (1) printf("Enter Your choice:\n"); printf("1.PUSH\n2.POP\n3.DISPLAY\n4.STACKSIZE\n5.DESTROY\n6.SATCKFULL CHECK\n7.EXIT"); scanf("%d", &choice); switch (choice) case 1: printf("enter the value to be pushed on to the stack"); scanf("%d", &value); push(value); continue; case 2: pop(); continue; case 3: display(); continue; case 4: stacksize(); continue; case 5: destroy(); continue; case 6: stackfull(); continue; case 7: exit(0); default: printf("YOU HAVE ENTERD A WRONG CHOICE"); /*Function to add an element into the stack*/ void push(int value) if (ISOVERFLOW) printf(OVERFLOW); return; top++; stack[top] = value; /*Function to delete an element from the stack*/ void pop() if (ISEMPTY) printf(EMPTY); return; printf("the popped element is %d", stack[top]); top--; /*Function to display all the elements in the stack*/ void display() int temp = top; if (ISEMPTY) printf(EMPTY); return; while (temp + 1) printf("%d\n", stack[temp]); temp--; /* Function to check whether the stack is full using macro */ void stackfull() int temp = top, count = 0; if (ISEMPTY) printf(EMPTY); return; while (temp + 1) printf("%d\n", stack[temp]); temp--; count++; if (count >= MAX) printf("Stack is full"); else printf("there are %d more spaces in the stack", (MAX-count)); /* Function to return the size of the stack */ void stacksize() int temp = top, count = 0; if (ISEMPTY) printf(EMPTY); return; while (temp + 1) temp--; count++; printf("the size of the stack is %d\n", count); /* Function to delete all the elements in the stack */ void destroy() if (ISEMPTY) printf("nothing is there to destroy"); while (top != -1) pop();

Output

Enter Your choice: 1.PUSH 2.POP 3.DISPLAY 4.STACKSIZE 5.DESTROY 6.SATCKFULL CHECK 7.EXIT3 Stack is EmptyEnter Your choice: 1.PUSH 2.POP 3.DISPLAY 4.STACKSIZE 5.DESTROY 6.SATCKFULL CHECK 7.EXIT2 Stack is EmptyEnter Your choice: 1.PUSH 2.POP 3.DISPLAY 4.STACKSIZE 5.DESTROY 6.SATCKFULL CHECK 7.EXIT1 enter the value to be pushed on to the stack1 Enter Your choice: 1.PUSH 2.POP 3.DISPLAY 4.STACKSIZE 5.DESTROY 6.SATCKFULL CHECK 7.EXIT1 enter the value to be pushed on to the stack2 Enter Your choice: 1.PUSH 2.POP 3.DISPLAY 4.STACKSIZE 5.DESTROY 6.SATCKFULL CHECK 7.EXIT1 enter the value to be pushed on to the stack3 Enter Your choice: 1.PUSH 2.POP 3.DISPLAY 4.STACKSIZE 5.DESTROY 6.SATCKFULL CHECK 7.EXIT1 enter the value to be pushed on to the stack4 Enter Your choice: 1.PUSH 2.POP 3.DISPLAY 4.STACKSIZE 5.DESTROY 6.SATCKFULL CHECK 7.EXIT1 enter the value to be pushed on to the stack5 Enter Your choice: 1.PUSH 2.POP 3.DISPLAY 4.STACKSIZE 5.DESTROY 6.SATCKFULL CHECK 7.EXIT3 5 4 3 2 1 Enter Your choice: 1.PUSH 2.POP 3.DISPLAY 4.STACKSIZE 5.DESTROY 6.SATCKFULL CHECK 7.EXIT4 the size of the stack is 5 Enter Your choice: 1.PUSH 2.POP 3.DISPLAY 4.STACKSIZE 5.DESTROY 6.SATCKFULL CHECK 7.EXIT6 5 4 3 2 1 Stack is fullEnter Your choice: 1.PUSH 2.POP 3.DISPLAY 4.STACKSIZE 5.DESTROY 6.SATCKFULL CHECK 7.EXIT2 the popped element is 5Enter Your choice: 1.PUSH 2.POP 3.DISPLAY 4.STACKSIZE 5.DESTROY 6.SATCKFULL CHECK 7.EXIT2 the popped element is 4Enter Your choice: 1.PUSH 2.POP 3.DISPLAY 4.STACKSIZE 5.DESTROY 6.SATCKFULL CHECK 7.EXIT2 the popped element is 3Enter Your choice: 1.PUSH 2.POP 3.DISPLAY 4.STACKSIZE 5.DESTROY 6.SATCKFULL CHECK 7.EXIT3 2 1 Enter Your choice: 1.PUSH 2.POP 3.DISPLAY 4.STACKSIZE 5.DESTROY 6.SATCKFULL CHECK 7.EXIT5 the popped element is 2the popped element is 1Enter Your choice: 1.PUSH 2.POP 3.DISPLAY 4.STACKSIZE 5.DESTROY 6.SATCKFULL CHECK 7.EXIT1 enter the value to be pushed on to the stack12 Enter Your choice: 1.PUSH 2.POP 3.DISPLAY 4.STACKSIZE 5.DESTROY 6.SATCKFULL CHECK 7.EXIT3 12 Enter Your choice: 1.PUSH 2.POP 3.DISPLAY 4.STACKSIZE 5.DESTROY 6.SATCKFULL CHECK 7.EXIT

[nowherenearp3rf3ct]

You are so annoying

Holy flaming balls. You always say how much you want everyone to be comfortable and have fun but when we try you don't let us. Stop claiming to be so fun and spontaneous when you're not. Stop telling me you want more fun in your life when clearly you don't. Twenty years from now when you think back to what you've done in life your story isn't going to be that long.