- LIB_3 . . . . 67 matches
LIB_TCB *Temp;
Temp = pFreeTCB[free_tcb_ptr];
return Temp;
int temp_count = ready_tcb_ptr;
LIB_TCB *Temp_TCB;
if ( pReady_heap[temp_count]->priority > pReady_heap[tree_parent(temp_count)]->priority ){
Temp_TCB = pReady_heap[temp_count];
pReady_heap[temp_count] = pReady_heap[tree_parent(temp_count)];
pReady_heap[tree_parent(temp_count)] = Temp_TCB;
temp_count = tree_parent(temp_count);
int temp;
temp = ready_tcb_ptr;
LIB_TCB *temp_tcb;
if ( pReady_heap[temp]->priority > pReady_heap[tree_parent(temp)]->priority ) {
temp_tcb = pReady_heap[tree_parent(temp)];
pReady_heap[tree_parent(temp)] = pReady_heap[temp];
pReady_heap[temp] = temp_tcb;
temp = tree_parent(temp);
int temp;
temp = i;
- LinkedList/영동 . . . . 62 matches
Node * currentNode;//Create temporary node which indicates the last node of linked list
Node * tempNode; //Temporary node to tour linked list
tempNode=argNode;
cout<<tempNode<<"\t"<<tempNode->data<<"\t"<<tempNode->nextNode<<"\n";
if(tempNode->nextNode=='\0')//Exit from do-while loop if value of next node is null
tempNode=tempNode->nextNode;
Node * currentNode;//Create temporary node which indicates the last node of linked list
Node * tempNode; //Temporary node to tour linked list
tempNode=argNode;
if(tempNode==NULL)
cout<<tempNode<<"\t"<<tempNode->data<<"\t"<<tempNode->nextNode<<"\n";
if(tempNode->nextNode==NULL)//Exit from do-while loop if value of next node is null
tempNode=tempNode->nextNode;
Node * firstTempNode;
Node * secondTempNode=NULL;
Node * thirdTempNode=argNode;
while(thirdTempNode!=NULL)
firstTempNode=secondTempNode;
secondTempNode=thirdTempNode;
thirdTempNode=thirdTempNode->nextNode;//Go one step to next node
- PrettyPrintXslt . . . . 62 matches
<xsl:template match="/">
<xsl:apply-templates select="." mode="xmlverb" />
</xsl:template>
<xsl:template match="/" mode="xmlverb">
<xsl:apply-templates mode="xmlverb">
</xsl:apply-templates>
</xsl:template>
<xsl:template match="verb:wrapper">
<xsl:apply-templates mode="xmlverb" />
</xsl:template>
<xsl:template match="verb:wrapper" mode="xmlverb">
<xsl:apply-templates mode="xmlverb" />
</xsl:template>
<xsl:template match="*" mode="xmlverb">
<xsl:call-template name="xmlverb-ns" />
<xsl:call-template name="xmlverb-attrs" />
<xsl:apply-templates mode="xmlverb" />
</xsl:template>
<xsl:template name="xmlverb-attrs">
<xsl:call-template name="html-replace-entities">
- OurMajorLangIsCAndCPlusPlus/XML/김상섭허준수 . . . . 60 matches
list_pointer findNull(list_pointer temp)
while(temp->ptr != NULL)
temp = temp->ptr;
return temp; // else return temp 를 해야하나~~ -..ㅡ;;
list_pointer temp;
temp = findNull(ptr->link);
temp->ptr = link_node;
// list_pointer temp = list;
char tag_temp[100];
list_pointer return_list = NULL, temp1, temp2, temp3;
for(temp1 = list->child->link; temp1; temp1 = temp1->ptr)
strcpy(tag_temp,temp1->child->tag);
if(strcmp(tag_temp,tag) == 0 ||
(tag_temp[strlen(tag_temp)-1] == '/' && (strlen(tag_temp) -1) == strlen(tag) && strncmp(tag_temp,tag,strlen(tag)) == 0))
temp2 = (list_pointer)malloc(sizeof(listNode));
temp2->child = temp1->child;
temp2->ptr = NULL;
return_list = temp2;
temp3->ptr = temp2;
temp3 = temp2;
- PowerOfCryptography/조현태 . . . . 57 matches
unsigned __int64 temp_target=(min_answer+max_answer)/2;
unsigned __int64 temp_result=1;
temp_result*=temp_target;
if (temp_result>mokpyo)
max_answer=temp_target;
else if (temp_result<mokpyo)
min_answer=temp_target;
return temp_target;
save_number *temp_number=target;
while(NULL!=temp_number->get_prv())
temp_number=temp_number->get_prv();
while (NULL!=temp_number)
cout << temp_number->call_number(0);
temp_number=temp_number->get_next();
save_number *min_answer, *max_answer, *temp;
temp=new save_number(min_answer,NULL);temp->plus_number(1);
result_compare=temp->compare_number(max_answer);
delete temp;
save_number *temp_target, *temp_result;
temp_target=new save_number(min_answer,NULL);
- CompleteTreeLabeling/조현태 . . . . 53 matches
int temp=1;
temp*=degree;
return (temp-1)/(degree-1);
int temp=*number_a;
*number_b=temp;
block* temp_block=(block*)malloc(sizeof(block));
line[input_number]=temp_block;
temp_block->number=input_number+1;
temp_block->deep=input_deep;
temp_block->head=input_head;
temp_block->maximum=get_number_nodes(input_degree, input_all_deep)-input_degree*(get_number_nodes(input_degree, input_all_deep-input_deep));
temp_block->next=(block**)malloc(sizeof(block*)*input_degree);
temp_block->next[i]=create_block(i+get_number_nodes(input_degree, input_deep)+input_degree*(input_number-get_number_nodes(input_degree, input_deep-1)),input_deep+1,input_all_deep,input_degree, line, temp_block);
return temp_block;
block* temp_block=line[block_number];
if (block_number==max_nodes-1&&!((temp_block->head!=NULL&&temp_block->head->number>temp_block->number)||temp_block->number>temp_block->maximum))
change(&temp_block->number,&line[i]->number);
if (!((temp_block->head!=NULL&&temp_block->head->number>temp_block->number)||temp_block->number>temp_block->maximum))
change(&temp_block->number,&line[i]->number);
int temp=1;
- C++스터디_2005여름/도서관리프로그램/조현태 . . . . 52 matches
void print_line(char* temp_name, char* temp_writer, char* temp_isbn)
cout << "책의 이름 : " << temp_name << "\n";
cout << "책의 저자 : " << temp_writer << "\n";
cout << "책의 ISBN : " << temp_isbn << "\n";
char temp_name[256];
char temp_writer[256];
char temp_isbn[256];
cin.getline(temp_name,256);
cin.getline(temp_writer,256);
cin.getline(temp_isbn,256);
print_line(temp_name,temp_writer,temp_isbn);
datas->input_data(temp_name,temp_writer,temp_isbn);
char temp_char[256], temp_name[256], temp_writer[256], temp_isbn[256];
cin.getline(temp_char,256);
where=datas->such(temp_char,selected);
datas->return_line(where, temp_name, temp_writer, temp_isbn);
print_line(temp_name,temp_writer,temp_isbn);
char **temp_datas[MAX_HANGMOK];
temp_datas[i]=new char*[number_data+1];
temp_datas[i][j]=datas[i][j];
- 그래픽스세미나/3주차 . . . . 50 matches
template <class T>
template<class T>
template<class T>
template<class T>
template<class T>
CGX_Vector<T> temp;
temp.e[count]=e[count] + in.e[count];
return temp;
template<class T>
CGX_Vector<T> temp;
temp.e[count]=e[count] + in[count];
return temp;
template<class T>
CGX_Vector<T> temp;
temp.e[count]=e[count] - in.e[count];
return temp;
template<class T>
CGX_Vector<T> temp;
temp.e[count]=e[count] - in[count];
return temp;
- 윤종하/지뢰찾기 . . . . 48 matches
int iNumOfMine,iCurrentFindedMine=0,iNumOfLeftCell,iIsAlive=TRUE,tempX,tempY,iFindedRealMine=0,i,j;
scanf("%d %d",&tempX,&tempY);
size.X=tempX;
size.Y=tempY;
COORD temp_pos=pos;
temp_pos=pos;
temp_pos.X=pos.X+coordX; temp_pos.Y=pos.Y+coordY;
if((temp_pos.X>size.X-1 || temp_pos.X<0) || (temp_pos.Y>size.Y-1 || temp_pos.Y<0)) continue;//범위를 초과했을 경우
else if(map[temp_pos.Y][temp_pos.X].iIsRevealed==TRUE) continue;//이미 깐 것일 경우
else if(map[temp_pos.Y][temp_pos.X].iIsMine==TRUE) iNumOfMine++;
temp_pos=pos;
temp_pos.X+=coordX; temp_pos.Y+=coordY;
if((temp_pos.X>size.X-1 || temp_pos.X<0) || (temp_pos.Y>size.Y-1 || temp_pos.Y<0)) continue;//범위를 초과했을 경우
if(map[temp_pos.Y][temp_pos.X].iIsRevealed==TRUE) continue;//열려있을 경우는 검사할 필요가 없잖아
find_mine(map,size,temp_pos,&(*iNumOfLeftCell));
COORD temp;
int tempX,tempY;
scanf("%d %d",&tempX,&tempY);
temp.X=(short)tempX;
temp.Y=(short)tempY;
- ErdosNumbers/조현태 . . . . 45 matches
char temp[256];
cin.getline(temp,256);
datas->swallow(temp);
cin.getline(temp,256);
int score=datas->get_score(temp);
cout << temp << " " << score << "\n";
cout << temp << " infinity\n";
int* temp_numbers=new int[number_line+1];
temp_numbers[i]=line_numbers[i];
temp_numbers[number_line]=input_line_number;
line_numbers=temp_numbers;
line_data** temp_books=new line_data*[number_books+1];
temp_books[i]=books[i];
temp_books[number_books]=NULL;
books=temp_books;
human_data** temp_mans=new human_data*[number_mans+1];
temp_mans[i]=mans[i];
temp_mans[number_mans]=new human_data(input_name);
mans=temp_mans;
human_data* temp_human;
- EightQueenProblem/용쟁호투SQL . . . . 44 matches
IF EXISTS(SELECT name FROM sysobjects WHERE name = N'temp_queen_attack' AND type = 'U') DROP TABLE temp_queen_attack
CREATE TABLE temp_queen_attack(
IF EXISTS (SELECT name FROM sysobjects WHERE name = N'p_temp_reset' AND type = 'P') DROP PROCEDURE p_temp_reset
CREATE PROCEDURE p_temp_reset
TRUNCATE TABLE temp_queen_attack
INSERT INTO temp_queen_attack VALUES(1,0,0,0,0,0,0,0,0,0,0)
INSERT INTO temp_queen_attack VALUES(2,0,0,0,0,0,0,0,0,0,0)
INSERT INTO temp_queen_attack VALUES(3,0,0,0,0,0,0,0,0,0,0)
INSERT INTO temp_queen_attack VALUES(4,0,0,0,0,0,0,0,0,0,0)
INSERT INTO temp_queen_attack VALUES(5,0,0,0,0,0,0,0,0,0,0)
INSERT INTO temp_queen_attack VALUES(6,0,0,0,0,0,0,0,0,0,0)
INSERT INTO temp_queen_attack VALUES(7,0,0,0,0,0,0,0,0,0,0)
INSERT INTO temp_queen_attack VALUES(8,0,0,0,0,0,0,0,0,0,0)
FROM temp_queen_attack
IF @x = 1 UPDATE temp_queen_attack SET x1 = 1
IF @x = 2 UPDATE temp_queen_attack SET x2 = 1
IF @x = 3 UPDATE temp_queen_attack SET x3 = 1
IF @x = 4 UPDATE temp_queen_attack SET x4 = 1
IF @x = 5 UPDATE temp_queen_attack SET x5 = 1
IF @x = 6 UPDATE temp_queen_attack SET x6 = 1
- 오목/민수민 . . . . 39 matches
int temp_x,temp_y;
temp_x=x/20;
temp_y=y/20;
if (temp_x*20 <= x)
x=temp_x+1;
else if (temp_x*20 > x)
x=temp_x;
if (temp_y*20 <= y)
y=temp_y+1;
else if (temp_y*20 > y)
y=temp_y;
int temp_x=x%20;
int temp_y=y%20;
if (temp_x>10 )
x=x+20-temp_x;
else if (temp_x<10)
x=x-temp_x;
if (temp_y>10)
y=y+20-temp_y;
else if (temp_y<10)
- ContestScoreBoard/조현태 . . . . 38 matches
int input_team_number, input_temp, input_time; char input_e;
scanf("%d %d %d %c",&input_team_number, &input_temp, &input_time, &input_e);
datas* temp_point;
temp_point=such_and_malloc_point(input_team_number);
++temp_point->score;
temp_point->used_time+=input_time;
temp_point=such_and_malloc_point(input_team_number);
temp_point->used_time+=WRONG_TIME;
datas* temp_point=start_point;
while (temp_point!=NULL)
if (target_team_number==temp_point->team_number)
return temp_point;
temp_point=temp_point->next;
temp_point=(datas*)malloc(sizeof(datas));
temp_point->prv=end_point;
start_point=temp_point;
end_point->next=temp_point;
end_point=temp_point;
temp_point->team_number=target_team_number;
temp_point->score=0;
- IndexedTree/권영기 . . . . 38 matches
node *temp = (node *)malloc(sizeof(node));
temp->level = current->level + 1;
current->left = temp;
temp = (node *)malloc(sizeof(node));
temp->level = current->level + 1;
current->right = temp;
int temp, sum1 = 0, sum2 = 0;
temp = ep;
while(temp > 0){
sum1 += tree[temp];
temp -= (temp & -temp);
temp = sp-1;
while(temp > 0){
sum2 += tree[temp];
temp -= (temp & - temp);
int temp = tree[address] - item;
tree[address] += temp;
int temp, sum1, sum2;
temp = ep;
while(temp > 0){
- 데블스캠프2005/게임만들기/제작과정예제 . . . . 37 matches
int temp_x=x+where;
int temp_y=y-(where+1)%2;
int temp_block[4][4]={0,};
if (temp_x+i<0 || temp_x+i>9 )
else if (temp_y+j<0 || temp_y+j>19 )
else if (0!=block[temp_x+i][temp_y+j])
block[temp_x+i][temp_y+j]=block_type[now_block][shape][i][j];
x=temp_x;y=temp_y;
int temp_x=x;
int temp_y=y;
int temp_shape=(shape+1)%4;
int temp_block[4][4]={0,};
temp_block[i][j]=0;
if (0!=block_type[now_block][shape][i][j]&& 0<=i+x-temp_x && 3>=i+x-temp_x )
temp_block[i+x-temp_x][j]=1;
if (0!=block_type[now_block][temp_shape][i][j])
if (temp_x+i<0)
temp_x+=1;crash=2;
else if (temp_x+i>9 )
temp_x-=1;crash=2;
- ReadySet 번역처음화면 . . . . 34 matches
Software development projects require a lot of "paperwork" in the form of requirements documents, design documents, test plans, schedules, checklists, release notes, etc. It seems that everyone creates the documents from a blank page, from the documents used on their last project, or from one of a handful of high-priced proprietary software engineering template libraries. For those of us who start from a blank page, it can be a lot of work and it is easy to forget important parts. That is not a very reliable basis for professional engineering projects.
ReadySET is an open source project to produce and maintain a library of reusable software engineering document templates. These templates provide a ready starting point for the documents used in software development projects. Using good templates can help developers work more quickly, but they also help to prompt discussion and avoid oversights.
* Templates for many common software engineering documents. Including:
* Project proposal template
* Project plan template
* Use case template
* QA plan template
* Several design templates
* System test case template
* Release checklist template
This is an open source project that you are welcome to use for free and help make better. Existing packages of software engineering templates are highly costly and biased by the authorship of only a few people, by vendor-client relationships, or by the set of tools offered by a particular vendor.
These templates are in pure XHTML with CSS, not a proprietary file format. That makes them easier to edit and to track changes using freely available tools and version control systems. The templates are designed to always be used on the web; they use hyperlinks to avoid duplicating information.
The templates are not burdened with information about individual authorship or document change history. It is assumed that professional software developers will keep all project documents in version control systems that provide those capabilities.
These templates are not one-size-fits-all and they do not attempt to provide prescriptive guidance on the overall development process. We are developing a broad library of template modules for many purposes and processes. The templates may be filled out in a suggested sequence or in any sequence that fits your existing process. They may be easily customized with any text or HTML editor.
We will build templates for common software engineering documents inspired by our own exprience.
I assume that the user takes ultimate responsibility for the content of all their actual project documents. The templates are merely starting points and low-level guidance.
This project does not attempt to provide powerful tools for reorganizing the templates, mapping them to a given software development process, or generating templates from a underlying process model. This project does not include any application code for any tools, users simply use text editors to fill in or customize the templates.
These templates are based on templates originally used to teach software engineering in a university project course. They are now being enhanced, expanded, and used more widely by professionals in industry.
The template set is fairly complete and ready for use in real projects. You can [http://readyset.tigris.org/servlets/ProjectDocumentList download] recent releases. We welcome your feedback.
*1. Briefly browse all templates
- VendingMachine/세연/1002 . . . . 34 matches
money = temp_money = 0;
int temp_money;
money = temp_money = 0;
cin >> temp_money;
if(temp_money == 10 || temp_money == 50 || temp_money == 100 || temp_money == 500 || temp_money == 1000)
money = money + temp_money;
return (temp_money == 10 || temp_money == 50 || temp_money == 100 || temp_money == 500 || temp_money == 1000);
cin >> temp_money;
if (isValidMoney (temp_money)) {
money = money + temp_money;
cin >> temp_money;
if (isValidMoney (temp_money)) {
money = money + temp_money;
=== temp_money - 4번 ===
temp_money 가 하는 일을 보면 한가지 일만 합니다.
cin >> temp_money;
if (isValidMoney (temp_money)) {
money = money + temp_money;
int temp_money = 0;
cin >> temp_money;
- MoreEffectiveC++/Efficiency . . . . 32 matches
template<class T>
template<class NumericalType>
여기 findCubicleNumber를 적용시키는 한 방법이 있다.;그것은 지역(local)캐쉬로 STL의(Standard Template Library-Item 35 참고) map 객체를 사용한다.
template<class T> // 동적 배열 T에 관한 클래스 템플릿
templace<class T>
template<class T>
== Item 19:Understand the orgin of temporary objects. ==
프로그래머가 임시 객체에 관해서 이야기 할때 그것은 보통 간단히 temporaries(임시인자, 이하 temporaries)로 불린다. 예를 들어서 swap 루틴을 보자
template<class T>
T temp = object;
object2 = temp;
자 여기서 temp를 보통 "temporary" 라고 부른다. 그렇지만 C++에 관점에서는 temp는 반드시 temporary라고 규정지을수 없다. 그것은 함수내에 존재하는 단순한 지역 객체일 뿐이다.
C++ 내에서의 진짜 temporary객체는 보이지 않는다.-이게 무슨 소리인고 하니, 소스내에서는 보이지 않는다는 소리다. temporary객체들은 non-heap 객체로 만들어 지지만 이름이 붙지를 않는다. (DeleteMe 시간나면 PL책의 내용 보충) 단지 이름 지어지지 않은(unnamed)객체는 보통 두가지 경우중에 하나로 볼수 있는데:묵시적(implicit) 형변환으로 함수호출에서 적용되고, 성공시에 반환되는 객체들. 왜, 그리고 어떻게 이러한 임시 객체(temporary objects)가 생성되고, 파괴되어 지는지 이해하는 것은 이러한 생성과 파괴 과정에서 발생하는 비용이 당신의 프로그램의 성능에 얼마나 성능을 끼칠수 있는가 알아야 하기때문에 중요한 것이다.
임시 객체(temporary objects)가 함수 호출이 성공된후 만들어지는 경우를 첫번째로 생각해 보자. 이것은 함수에 인자를 전달할때 서로간에 인자들의 형(type)가 맞지 않게 묶여(bind)진 경우에 일어 난다. 예를 들자면, 다음과 같은 문자열에서 어느 한글자가 출현하는 객수를 세는 함수를 생각해 보자
countChar을 호출하는 곳을 보라. 처음에 구문에서 char 배열이 함수로 전달된다. 하지만 함수의 인자는 const string& 이다. 이런 호출은 오직 형(type)이 알맞지 않은것이 제거되거나 당신의 컴파일러는 훌륭히도 string 형의 임시 객체(temporary object)를 만들어서 그러한 맞지 않는 형문제를 제가하면 성공할수 있다. 그러한 임시 객체는 string 생성자가 buffer인자를 바탕으로 초기화 된다. 그러면 constChar의 str인자는 임시(temporary) string 객체를 받아들인다.(bind-bound) countChar이 반환될때 임시(temporary)객체는 자동 소멸된다.
어떠한 임시인자(temporary)도 만들어 지지 않았다. 왜 만들어 지지 않은 걸까?
임시인자(temporary)가 만들어 졌다고 가정해 보자. 임시인자는 uppercasify로 전달되고 해당 함수내에서 대문자 변환 과정을 거친다. 하지만 활성화된, 필요한 자료가 들어있는 부분-subtleBookPlug-에는 정작 영향을 끼치지 못한다.;오직 subtleBookPulg에서 만들어진 임시 객체인 string 객체만이 바뀌었던 것이다. 물론 이것은 프로그래머가 의도했던 봐도 아니다. 프로그래머의 의도는 subtleBookPlug가 uppercasify에 영향을 받기를 원하고, 프로그래머는 subtleBookPlug가 수정되기를 바랬던 것이다. 상수 객체의 참조가 아닌 것(reference-to-non-const)에 대한 암시적(implicit) 형변환은 프로그래머가 임시가 아닌 객체들에 대한 변화를 예측할때 임시 객체만을 변경 시킨다. 그것이 언어상에서 non-const reference 인자들을 위하여 임시물들(temporaries)의 생성을 막는 이유이다. Reference-to-const 인자는 그런 문제에 대한 걱정이 없다. 왜냐하면 그런 인자들은 const의 원리에 따라 변화되지 않기 때문이다.
해당 함수의 반환 인자(const Number)는 임시물(temporary)이다. 왜냐하면 그것은 아무런 이름도 가지기 않기 때문이다.:단지 함수의 반환되는 값일 뿐이다. 당신은 반드시 operator+가 호출될때 해당 객체의 생성, 삭제에 관한 비용을 지불해야만 한다. (반환 값이 const인것에 관한 이유를 알고 싶다면 Item 6을 참고하라)
임시 객체의 밑바탕의 생각은 비용이 발생하다. 이다. 그래서 당신은 가능한한 그것을 없애기를 원할 것이다. 하지만 이보다 더 중요한 것은, 이러한 임시 객체의 발생에 부분에 대한 통찰력을 기르는 것이다. reference-to-const(상수참조)를 사용한때는 임시 객체가 인자로 전달될수 있는 가능성이 존재 하는 것이다. 그리고 객체로 함수 값을 반환 할때는 임시 인자(temporary)는 아마도 만들어질것이다.(그리고 파괴되어 진다.) 그러한 생성에 대해 예측하고, 당신이 "behind the scences"(보이지 않는 부분) 에서의 컴파일러가 지불하는 비용에 대한 눈을 배워야 한다.
만약 당신이 모든 전역 공간안에 있는 stand-alone operator들에 관하여 마음을 놓치 못한다면, 다음과 같은 template을 사용해서 stand-alone 함수들의 사용을 제거할수 있다.:
- MoreEffectiveC++/Techniques2of3 . . . . 32 matches
template<class T>
template<class T>
template<class T>
template<class T>
template<class T>
template<class T>
template<class T>
template<class T>
template<class T> // T를 가리키는 스마트 포인터
template<class T>
template<class T>
template<class T>
template<class T>
template<class T>
template<class T>
template<class T>
template<class T>
template<class T>
template<class T>
template<class T>
- 만년달력/방선희,장창재 . . . . 32 matches
int def_max_month(int temp_year, int temp_month);
int temp_sum = 0;
temp_sum = temp_sum + array[k][te];
temp_sum = temp_sum + array[year][b]; // 여기까지(1)
int start = temp_sum % 7;
int def_max_month(int temp_year, int temp_month) // 년도를 전달 받아서 그 년도 각각 달의 일수 결정
switch (temp_month)
case 1 : temp_month = 31;
case 2 : if (temp_year % 4 == 0)
if (temp_year % 100 == 0)
if (temp_year % 400 == 0)
if (temp_year % 4000 == 0)
temp_month = 28;
temp_month = 29;
temp_month = 28;
temp_month = 29;
else temp_month=28;
temp_month = 31;
temp_month = 30;
temp_month = 31;
- MoreEffectiveC++/Appendix . . . . 31 matches
These books contain not just a description of what's in the language, they also explain the rationale behind the design decisions — something you won't find in the official standard documents. The Annotated C++ Reference Manual is now incomplete (several language features have been added since it was published — see Item 35) and is in some cases out of date, but it is still the best reference for the core parts of the language, including templates and exceptions. The Design and Evolution of C++ covers most of what's missing in The Annotated C++ Reference Manual; the only thing it lacks is a discussion of the Standard Template Library (again, see Item 35). These books are not tutorials, they're references, but you can't truly understand C++ unless you understand the material in these books
Murray's book is especially strong on the fundamentals of template design, a topic to which he devotes two chapters. He also includes a chapter on the important topic of migrating from C development to C++ development. Much of my discussion on reference counting (see Item 29) is based on the ideas in C++ Strategies and Tactics.
If you are contemplating the use of exceptions, read this article before you proceed. ¤ MEC++ Rec Reading, P24
Carroll and Ellis discuss many practical aspects of library design and implementation that are simply ignored by everybody else. Good libraries are small, fast, extensible, easily upgraded, graceful during template instantiation, powerful, and robust. It is not possible to optimize for each of these attributes, so one must make trade-offs that improve some aspects of a library at the expense of others. Designing and Coding Reusable C++ examines these trade-offs and offers down-to-earth advice on how to go about making them. ¤ MEC++ Rec Reading, P30
The first part of the book explains C++ for FORTRAN programmers (now there's an unenviable task), but the latter parts cover techniques that are relevant in virtually any domain. The extensive material on templates is close to revolutionary; it's probably the most advanced that's currently available, and I suspect that when you've seen the miracles these authors perform with templates, you'll never again think of them as little more than souped-up macros. ¤ MEC++ Rec Reading, P33
Items 9, 10, 26, 31 and 32 attest to the remarkable utility of the auto_ptr template. Unfortunately, few compilers currently ship with a "correct" implementation.1 Items 9 and 28 sketch how you might write one yourself, but it's nice to have more than a sketch when embarking on real-world projects. ¤ MEC++ auto_ptr, P2
template<class T>
template<class U> // copy constructor member
auto_ptr(auto_ptr<U>& rhs); // template (see Item 28):
template<class U> // assignment operator
auto_ptr<T>& // member template (see
template<class U> // make all auto_ptr classes
template<class T>
template<class T>
template<class T>
template<class T>
template<class U>
template<class T>
template<class T>
template<class T>
- AcceleratedC++/Chapter11 . . . . 30 matches
여기서는 '''template class'''를 이용한다.
template <class T> class Vec {
template <class T> class Vec {
template <class T> class Vec {
template <class T> class Vec {
template <class T> class Vec {
template <class T> class Vec {
template <class T> class Vec {
template <class T> class Vec {
template <class T> class Vec {
template<class T> Vec<T>& Vec<T>::operator=(const Vec& rhs) {
template <class T> class Vec {
template<class T> class Vec {
template<class T> class allocator {
template<class In, class For> For uninitialized_copy(In, In, For);
tempalte<class for, class T> void uninitialized_fill(For, For, const T&);
template <class T> class Vec {
template <class T> void Vec<T>::create()
template <class T> void Vec<T>::create(size_type n, const T& val)
template <class T>
- BusSimulation/조현태 . . . . 30 matches
man *temp_man=humans[0];
return temp_man;
int temp_where=where;
temp_where=in_road->car_move(&in_station, speed, where);
if (-1==temp_where)
where=temp_where;
man *temp_man=humans[0];
return temp_man;
int temp_where=where;
temp_where=in_road->car_move(&in_station, speed, where);
if (-1==temp_where)
where=temp_where;
station** temp=new station*[number_station+1];
temp[i]=buildings[i];
buildings=temp;
bus** temp=new bus*[number_bus+1];
temp[i]=cars[i];
cars=temp;
int temp_where=where+speed;
if (where<buildings[i]->where_am_i() && temp_where>=buildings[i]->where_am_i())
- LoveCalculator/조현태 . . . . 30 matches
char temp_save_name[MAX_SIZE_NAME]={0,};
scanf ("%s",temp_save_name);
if (64<temp_save_name[j] && temp_save_name[j]<91) // 대문자 입력
name_score[i]+=temp_save_name[j]-64;
else if (96<temp_save_name[j] && temp_save_name[j]<123) // 소문자 입력
name_score[i]+=temp_save_name[j]-96;
else if (NULL==temp_save_name[j])
int temp_number=0;
temp_number+=number%10;
return calculator(temp_number);
char temp_save_name[MAX_SIZE_NAME]={0,};
calculate(temp_save_name, input_and_return_cursur(temp_save_name, i), name_score, i);
int input_and_return_cursur(char *temp_save_name, int i)
char temp_char;
temp_char=getche();
if (BACK_SPACE==temp_char)
else if(ENTER==temp_char)
temp_save_name[cursur]=temp_char;
void calculate(char *temp_save_name, int cursur, int *name_score, int i )
tolower(temp_save_name[j]);
- 몸짱프로젝트/CrossReference . . . . 30 matches
Line * temp = ptr->line;
while (temp->next != NULL)
temp = temp->next;
temp->next = lp;
Line * temp = aRoot->line;
while (temp->next != NULL)
temp = aRoot->line->next;
aRoot->line = temp;
char * temp;
temp = new char[5];
temp[0] = aNum / 1000 + 48;
temp[1] = aNum % 1000 / 100 + 48;
temp[2] = aNum % 100 / 10 + 48;
temp[3] = aNum % 10 + 48;
temp[4] = '\0';
temp = new char[4];
temp[0] = aNum / 100 + 48;
temp[1] = aNum % 100 / 10 + 48;
temp[2] = aNum % 10 + 48;
temp[3] = '\0';
- Pairsumonious_Numbers/권영기 . . . . 29 matches
int ans[N], n, flag = 0, checkans[M], temp[M], cnt = 0;
if(checkans[i] != temp[i])return 0;
list <int>::iterator it1, it2, temp, tempit;
int tempsum;
temp = it1;
temp++;
for(it2 = temp; it2 != sum.end() && !flag; it2++){
tempsum = (ans[s-1] + ans[s-2] + *it1 + *it2)/2;
ans[s] = tempsum - ans[s-1] - ans[s-2];
tempit = find(it2, sum.end(), ans[s-1] + ans[s]);
back(s+1, tempit);
int m, i, tempsum, start = 1;
memset(temp, 0, sizeof(int) * M);
scanf("%d", &temp[i]);
sort(temp, temp + m);
sum.push_back(temp[i]);
list<int>::iterator iter, tempit;
tempsum = (temp[0] + temp[1] + *iter)/2;
ans[1] = tempsum - *iter;
ans[2] = tempsum - temp[1];
- whiteblue/LinkedListAddressMemo . . . . 29 matches
data * temp = new data;
temp->next = firstData;
firstData = temp;
data * temp = new data;
data * temp_co;
temp_co = NULL;
if (temp_co == NULL)
temp_co = new data;
strcpy(temp_co->name, firstData->name);
strcpy(temp_co->address, firstData->address);
strcpy(temp_co->addressNumber, firstData->addressNumber);
temp_co->next = NULL;
temp = new data;
temp->next = temp_co;
temp_co = temp;
strcpy(temp_co->name, firstData->name);
strcpy(temp_co->address, firstData->address);
strcpy(temp_co->addressNumber, firstData->addressNumber);
firstData = temp_co;
data * temp;
- InvestMulti - 09.22 . . . . 28 matches
temp = ID + nation.keys()[i] + items.keys()[j]
user[temp] = 0
Temp = user[NATION]
temp = ID + nation.keys()[i] + items.keys()[j]
print items.keys()[j] , ' in ' , nation.keys()[i] , ' : ', user[temp]
temp = ID + 'CHINAINT'
user[temp] = 0
temp = ID + 'CHINADOUBLE'
user[temp] = 0
temp = ID + 'JAPANINT'
user[temp] = 0
temp = ID + 'JAPANDOUBLE'
user[temp] = 0
temp = ID + 'INDIAINT'
user[temp] = 0
temp = ID + 'INDIADOUBLE'
user[temp] = 0
Temp = user[NATION]
temp = ID + 'CHINAINT'
print 'INT in CHINA : ', user[temp]
- 압축알고리즘/정욱&자겸 . . . . 27 matches
char temp;
temp = zip[0];
if (temp == zip[i]) count++;
cout << count << temp;
temp = zip[i];
cout << count << temp << endl;
char temp;
temp = zip[0];
if (int(temp) >= 48 && int(temp) <= 57) dig[j++] = temp;
cout << temp;
temp = zip[i];
int temp;
temp = int(zip[0]);
ch = char(temp - (int(zip[i]) - 48));
else ch = char(temp + (int(zip[i]) - 48));
int temp;
temp = int(zip[0]);
dig = int(zip[i]) - temp;
int temp;
temp = int(zip[0]);
- 큰수찾아저장하기/허아영 . . . . 27 matches
물론 이런 생각도 해 보았다. matrix를 temp1,2 matrix를 만들어서 행과 열을 따로 계산한다..
int temp_matrix[4][4], a, b;
temp_matrix[i][j] = matrix[i][j];
if(temp_matrix[i][j] > temp_matrix[i][j+1]){
change(&temp_matrix[i][j], &temp_matrix[i][j+1]);
matrix[i][MATRIX_SIZE-1] = temp_matrix[i][MATRIX_SIZE-2];
temp_matrix[i][j] = matrix[i][j];
if(temp_matrix[j][i] > temp_matrix[j+1][i]){
change(&temp_matrix[j][i], &temp_matrix[j+1][i]);
matrix[MATRIX_SIZE-1][i] = temp_matrix[MATRIX_SIZE-2][i];
if(temp_matrix[MATRIX_SIZE-1][i] > temp_matrix[MATRIX_SIZE-1][i+1]){
change(&temp_matrix[MATRIX_SIZE-1][i], &temp_matrix[MATRIX_SIZE-1][i+1]);
if(temp_matrix[i][MATRIX_SIZE-1] > temp_matrix[i+1][MATRIX_SIZE-1]){
change(&temp_matrix[i][MATRIX_SIZE-1], &temp_matrix[i+1][MATRIX_SIZE-1]);
a = temp_matrix[MATRIX_SIZE-1][MATRIX_SIZE-2];
b = temp_matrix[MATRIX_SIZE-2][MATRIX_SIZE-1];
int temp;
temp = *a;
*b = temp;
- whiteblue/자료구조다항식구하기 . . . . 25 matches
int tempCoef;
int tempExpon;
poly_pointer temp;
temp = result;
cin >> tempCoef;
cin >> tempExpon;
if ( tempCoef == 0 && tempExpon == 0 )
if (tempExpon >= 0 && tempExpon < preExpon)
result->coef = tempCoef;
result->expon = tempExpon;
preExpon = tempExpon;
return temp;
poly_pointer ptemp = b;
poly_node temp;
temp.coef = a->coef * b->coef;
temp.expon = a->expon + b->expon;
v.push_back(temp);
b = ptemp;
temp = v[j+1];
v[j] = temp;
- ErdosNumbers/문보창 . . . . 23 matches
pNode temp;
temp = new Node[sizeof(Node)];
temp->next = NULL;
head[i] = temp;
temp = new Node[sizeof(Node)];
temp->next = NULL;
head[0]->next = temp;
pNode temp = head[ernum-1]->next;
while (temp != NULL)
if (strcmp(name[i], temp->name) == 0)
temp = temp->next;
pNode temp = head[ernum];
while (temp->next != NULL)
temp = temp->next;
temp->next = ptr;
pNode temp;
temp = head[i]->next;
while (temp != NULL)
if (strcmp(temp->name, name) == 0)
temp = temp->next;
- 경시대회준비반/BigInteger . . . . 23 matches
BigInteger::BigInteger(BigInteger const& Temp)
End = Temp.Digits() - 1;
TheNumber = new DATATYPE [Temp.Digits()];
datacopy(Temp,Temp.Digits());
isNegative = Temp.isNegative;
long temp = Digits() - with.Digits();
if(temp!=0) return temp<0?-1:1;
temp = 0;
temp = TheNumber[i+Start] - with.TheNumber[i+with.Start];
if(temp!=0)
cmp = temp<0?-1:1;
long temp,x,y;
temp = (long)U.TheNumber[U.End-j-n]*(long)BASE + (long)U.TheNumber[U.End-j-n+1];
x = temp / (long)V.TheNumber[V.Start];
y = temp % (long)V.TheNumber[V.Start];
temp = 0;
if(V.End>=i) temp = (long)qhat*(long)V.TheNumber[V.End-i] + temp;
y = (long)U.TheNumber[U.End-j-i] - temp%BASE - x;
temp /= BASE;
DATATYPE *temp = new DATATYPE[Digits()+i];
- 새싹교실/2012/AClass/2회차 . . . . 23 matches
int i,j,temp;
temp=a[i];
a[j]=temp;
int temp1, temp2, temp3;
temp1=num/1000;
temp2=num%1000;
sum=temp1;
temp1=temp2/100;
temp3=temp2%100;
sum+=temp1;
temp1=temp3/10;
temp2=temp3%10;
sum+=temp1;
sum+=temp2;
int temp;
temp=arr[i];
arr[j]=temp;
- CppStudy_2002_1/과제1/Yggdrasil . . . . 22 matches
char temp1[20];
double temp2;
int temp3;
cin>>temp1;
cin>>temp2;
cin>>temp3;
candy=input(candy, temp1, temp2, temp3);
template<class T>
template<class T>
template<class T>
template<class T>
template<class T>
T temp=arr[0];
if(temp<arr[i])
temp=arr[i];
return temp;
char * temp=arr[0];
if(strlen(temp)<strlen(arr[i]))
temp=arr[i];
return temp;
- EuclidProblem/조현태 . . . . 22 matches
int *temp_large, *temp_small, temp_plus=1;
temp_large=x;
temp_small=y;
temp_large=y;
temp_small=x;
if (temp_plus>0 && number_a*(*x)+number_b*(*y)>gcm)
*temp_large=0;
temp_plus=-1;
else if (temp_plus<0 && number_a*(*x)+number_b*(*y)<gcm)
*temp_large=0;
temp_plus=1;
if (*temp_small>0)
*temp_small*=-1;
*temp_small=*temp_small*(-1)+1;
*temp_large+=temp_plus;
int temp;
while (temp=number_a%number_b)
number_b=temp;
- MoreEffectiveC++/Techniques1of3 . . . . 21 matches
이제까지 거쳐왔던 코드들은 어느 정도의 형태가 잡혀 있다. 이것을 라이브러리로 만들어 놓고, 일정한 규칙으로 만들수는 없을까? (참고로 이와 비슷한 기술이 Item 29 reference-counting에 등장한다. 참고 해보자.) template가 이를 가능하게 해준다.
다음과 같은 template를 이용해서
template<class BeingCounted>
template<class BeingCounted>
template<class BeingCounted>
template<class BeingCounted>
이제 위의 template를 바탕으로 글 초반에 누누히 설명한 object-counting에 기반한 Printer클래스를 만들어 본다.
template<class BeingCounted>
스마트 포인터는 built-in 포인터와 같이 강한 형 안정성을 가져야 하기 떄문에 template로 구현된다. 대다수 스마트 포인터의 모습은 다음과 같이 보여진다.:
template<class T> // 스마트 포인터를 위한 템플릿
template<class T> // 분산 DB상에 객체를 가리키는 스마트 포인터
template<class T>
template<class T>
template<class T>
template<class T>
template<class T>
template<class T>
template<class T>
template<class T>
template<class T>
- AcceleratedC++/Chapter14 . . . . 20 matches
template <class T> class Handle {
template<class T> Handle<T>& Handle<T>::operator=(const Handle& rhs) {
template<class T> T& Handle<T>::operator*() const {
template<class T> T* Handle<T>::operator->() const {
template <class T> class Ref_handle {
template <class T>
template <class T> Ref_handle<T>::~Ref_handle()
template <class T> class Ptr {
template <class T> T* clone(const T* tp)
template<class T>
template<class T>
template<class T>
template<class T> Ptr<T>::~Ptr()
template<>
template <class In> Str(In i, In j): data(new Vec<char>) {
template<class T> void Ptr<T>::make_unique() {
template<class T> void Ptr<T>::make_unique() {
template<> Vec<char*> clone(const Vec<char>* vp) {
'''템플릿의 구체화(template specialization)'''
template<>를 사용하면 특정 인자 타입에 대한 특정 템플릿 함수의 버전을 정의한다.
- C++스터디_2005여름/도서관리프로그램/문보창 . . . . 20 matches
Book * temp = book_list;
while (temp->next != NULL)
temp = temp->next;
temp->next = &b;
Book * temp = book_list;
while (temp != NULL)
if (strcmp((*temp).get_ISBN(), b.get_ISBN()) == 0 &&
strcmp((*temp).get_name(), b.get_name()) == 0)
if ((*temp).get_state() == kind_order)
(*temp).set_state(!kind_order);
temp = temp->next;
Book * temp = book_list;
while (temp != NULL)
cout << (*temp).get_name();
cout << (*temp).get_writer();
cout << (*temp).get_ISBN() << endl;
temp = temp->next;
- OurMajorLangIsCAndCPlusPlus/print/김상섭 . . . . 20 matches
void print_d(int temp, int sort)
itoa(temp,buffer,10);
void print_d_a(int * temp, int num)
print_d(*(temp+i), 0);
void print_s(const char * temp, int sort)
if(strlen(temp) < sort)
for(int i = 0; i < sort - strlen(temp); i++)
fputs(temp, stdout);
void print_s_a(const char ** temp, int num)
print_s(*(temp+i), 0);
void print_f(double temp, int sort)
buffer = _fcvt( temp, 7, &decimal, &sign );
void print_f_a(double * temp, int num)
print_f(*(temp+i), 0);
int * temp = va_arg(args, int *);
print_d_a(temp, num);
const char ** temp = va_arg(args, const char **);
print_s_a(temp, num);
double * temp = va_arg(args, double *);
print_f_a(temp, num);
- 데블스캠프2011/셋째날/String만들기/김준석 . . . . 20 matches
String * temp = new String(compare);
if(this->equals(*temp)) return 0;
int tempCount = this->count + str.count -2 + 1;
char * temp = new char[tempCount];
strcpy(temp,this->value);
strcat(temp,str.value);
this->value = temp;
this->count = tempCount;
char * temp = new char[count+1];
*(temp + i) = *(offvalue+i);
temp[count] = '\0';
return new String(temp);
char * temp = this->value + this->offset;
char * temp2 = str.value + str.offset;
for(;*temp != '\0'; temp++,temp2++){
if(*temp != *temp2) return false;
- 3N+1Problem/곽세환 . . . . 19 matches
int temp_i = i;
int temp_j = j;
if (temp_i > temp_j)
int temp;
temp = temp_i;
temp_i = temp_j;
temp_j = temp;
great_length = cycle(temp_i);
while (temp_i < temp_j)
temp_i++;
int temp;
if ((temp = cycle(temp_i)) > great_length)
great_length = temp;
- MineSweeper/김상섭 . . . . 19 matches
int col, row, i, j,temp_row, temp_col, map[101][101];
char temp_char[101];
point temp_point;
temp_row = test[i].row + director_row[j];
temp_col = test[i].col + director_col[j];
if(temp_row > 0 && temp_row <= row && temp_col > 0 && temp_col <= col && map[temp_row][temp_col] != -1)
map[temp_row][temp_col]++;
cin >> temp_char;
if(temp_char[j-1] == '*')
temp_point.row = i;
temp_point.col = j;
test.push_back(temp_point);
- TheGrandDinner/김상섭 . . . . 19 matches
team temp1;
table temp2;
temp1.Num = i + 1;
cin >> temp1.maxNum;
test_team.push_back(temp1);
temp2.Num = i + 1;
cin >> temp2.maxNum;
test_table.push_back(temp2);
team temp1;
table temp2;
int temp1;
temp1 = maxtable;
for(j = 0; j < temp1; j++)
temp1.Num = i + 1;
cin >> temp1.maxNum;
test_team.push_back(temp1);
temp2.Num = i + 1;
cin >> temp2.maxNum;
test_table.push_back(temp2);
- 서민관 . . . . 19 matches
KeyValuePair *temp = *head;
while ( temp->next != NULL ) {
if ( strcmp(temp->key, keyValuePair->key) == 0 ) {
temp = temp->next;
temp->next = keyValuePair;
KeyValuePair *temp = *head;
while ( temp != NULL ) {
if ( strcmp(temp->key, key) == 0 ) {
temp = temp->next;
KeyValuePair *temp = (*head)->next;
while ( temp != NULL ) {
successor = temp;
temp = temp->next;
KeyValuePair *temp = getPair(&head, key);
if ( temp != NULL ) {
return temp->value;
- PokerHands/Celfin . . . . 18 matches
char temp[255];
temp[28]=NULL;
cin.getline(temp, 255);
if(temp[28]==NULL)
if(temp[3*i]=='T')
else if(temp[3*i]=='J')
else if(temp[3*i]=='Q')
else if(temp[3*i]=='K')
else if(temp[3*i]=='A')
black[i].number = temp[3*i]-48;
black[i].color = temp[3*i+1];
if(temp[3*i]=='T')
else if(temp[3*i]=='J')
else if(temp[3*i]=='Q')
else if(temp[3*i]=='K')
else if(temp[3*i]=='A')
white[i-5].number = temp[3*i]-48;
white[i-5].color = temp[3*i+1];
- StringOfCPlusPlus/세연 . . . . 18 matches
node * temphead;
temphead = head;
temphead = Search(word, temphead);
if(temphead == NULL)
temphead = head;
InsertWord(word, temphead);
temphead = head;
temphead = Search(word, temphead);
if(temphead == NULL)
temphead = head;
InsertWord(word, temphead);
node * temp = new node;
strcpy(temp->data_word, word);
temp->left_child = temp->right_child = NULL;
root = temp;
- UglyNumbers/곽세환 . . . . 18 matches
unsigned int temp;
temp = numbers.front();
numbers.push_back(temp * 2);
numbers.push_back(temp * 3);
numbers.push_back(temp * 5);
cout << "The 1500'th ugly number is " << temp << "." << endl;
int num = 1, temp;
temp = num;
while (temp % 2 == 0)
temp = temp / 2;
while (temp % 3 == 0)
temp = temp / 3;
while (temp % 5 == 0)
temp = temp / 5;
if (temp == 1)
- 최대공약수/조현태 . . . . 18 matches
int temp;
while (temp=*big_number%*small_number)
*small_number=temp;
int temp;
while (temp=big_number%small_number)
small_number=temp;
int temp;
while (temp=number_a%number_b)
number_b=temp;
small_number=temp; 를 볼 때 , 보나마나 temp 값이 출력될 듯. 하는데.
while (temp=big_number%small_number)
small_number=temp;
temp=big_number%small_number;
while (0!=temp)
small_number=temp;
temp=big_number%small_number;
temp = big_number%small_number;을 while()속에 넣으면 저런 영향을 끼치는지 이제 알았다네~
- Doublets/문보창 . . . . 17 matches
Node * temp = new Node;
temp->data = new char[len + 1];
strcpy(temp->data, word);
temp->next = NULL;
node.front = temp;
node.next->next = temp;
Node * temp = new Node;
temp->data = new char[strlen(first) + 1];
strcpy(temp->data, first);
temp->next = NULL;
doublet->front = temp;
Node * temp = new Node;
temp->data = new char[strlen(first) + 1];
strcpy(temp->data, dic.next->data);
temp->next = NULL;
doublet->next->next = temp;
delete temp, doublet;
- TheJavaMan/숫자야구 . . . . 17 matches
* To change the template for this generated file go to
* To change the template for this generated type comment go to
int temp[] = new int[3];
while ( temp[0] == temp [1] | temp[1] == temp [2] | temp[2] == temp [0])
temp[i] = rmd.nextInt(9);
correct_answer += temp[i];
* To change the template for this generated file go to
* To change the template for this generated type comment go to
* To change the template for this generated file go to
* To change the template for this generated type comment go to
* To change the template for this generated file go to
* To change the template for this generated type comment go to
- 수학의정석/집합의연산/조현태 . . . . 17 matches
int *temp_gaesu=&gaesu;
int *temp_where=(int*)malloc(sizeof(int)*gaesu);
for (register int temp_gaesu=1; temp_gaesu<=gaesu; ++temp_gaesu)
for (register int i=0; i<temp_gaesu; ++i)
if (i<temp_gaesu)
temp_where[i]=1;
temp_where[i]=0;
if(1==temp_where[j])
if (1==temp_where[find_last])
if (0==temp_where[j])
temp_where[j]=0;
temp_where[k]=1;
temp_where[find_last]=0;
temp_where[find_last+1]=1;
free(temp_where);
- 호너의법칙/조현태 . . . . 17 matches
char write_temp[SIZE_OF_LINE][8+INPUT_MAX*SIZE_OF_BLOCK];
write_temp[0][i]=write_temp[2][i]=write_temp[4][i]='=';
strcpy(write_temp[1]," |index|");
strcpy(write_temp[3]," | data|");
write_temp[1][i*SIZE_OF_BLOCK+8]=write_temp[1][i*SIZE_OF_BLOCK+10]=write_temp[3][i*SIZE_OF_BLOCK+8]=write_temp[3][i*4+10]=' ';
write_temp[1][i*SIZE_OF_BLOCK+8]=i/10+NUMBER_TO_CHAR;
write_temp[1][i*SIZE_OF_BLOCK+9]=i%10+NUMBER_TO_CHAR;
write_temp[3][i*SIZE_OF_BLOCK+8]=input[i]/10+NUMBER_TO_CHAR;
write_temp[3][i*SIZE_OF_BLOCK+9]=input[i]%10+NUMBER_TO_CHAR;
write_temp[1][i*SIZE_OF_BLOCK+11]=write_temp[3][i*SIZE_OF_BLOCK+11]='|';
outputFile << write_temp[i][j];
- Bridge/권영기 . . . . 16 matches
int t, n, tempn, p, ans = 0;
tempn = n;
while(tempn > 0){
if(tempn >= 4){
tempn -= 2;
if(tempn == 3){
tempn = 0;
else if(tempn == 2){
tempn = 0;
else if(tempn == 1){
tempn = 0;
pair <int, int> temp;
temp = ans2.front();
printf("%d", temp.first);
if(temp.second != -1)printf(" %d", temp.second);
- CuttingSticks/김상섭 . . . . 16 matches
vector<int> temp;
temp.push_back(0);
temp.push_back(token);
temp.push_back(length);
Data.push_back(temp);
temp.clear();
temp = *k;
tokennum = temp.size() - 1;
store[j][j+2] = temp[j+2] - temp[j];
int temp1,min = INT_MAX;
temp1 = store[i][l] + store[l][i+m];
if(min > temp1)
min = temp1;
store[i][i+m] = min + temp[i+m] - temp[i];
- RandomWalk2/Leonardong . . . . 16 matches
int tempx=x, tempy=y;//벽을 통과할때를 대비한 백업
case '1' : tempx = x++;
case '2' : tempx = x++, tempy = y++;
case '3' : tempy = y++;
case '4' : tempx = x--, tempy = y++;
case '5' : tempx = x--;
case '6' : tempx = x--, tempy = y--;
case '7' : tempy = y--;
case '8' : tempx = x++, tempy = y--;
x=tempx, y=tempy;
- Slurpys/곽세환 . . . . 16 matches
int temp = -1;
temp = str.find_first_not_of('F', 2);
if (temp == -1)
if (temp == length - 1 && str[temp] == 'G')
return isSlump(str.substr(temp, length - temp));
int i, j, temp = -1; // temp는 Slimp의 마지막 문자 위치
temp = str.find_last_of('C');
if (temp == -1)
temp = str.find_last_of('H');
if (temp != -1 && isSlimp(str.substr(0, temp + 1)) && isSlump(str.substr(temp + 1, length - temp - 1)))
- 손동일 . . . . 16 matches
int temp;
int temp1[10] = {-1,-1,-1,-1,-1,-1,-1,-1,-1,-1};
temp1[0] = ver1[j].going;
temp = ver1[j].going;
if(temp == -1)
using_v(temp);
if(temp1[m] != -1)
if(temp1[m]==10)
cout.put(temp1[m]+80);
cout.put(temp1[m]+65);
temp1[soo2] = ver1[k].going;
temp = ver1[k].going;
if(temp == 1 || temp == 4 || temp == 7 )
temp = -1;
- 인터프리터/권정욱 . . . . 16 matches
int temp1 = 0;
int temp2 = 0;
cin >> temp1;
cout << "출력 : " << temp1;
temp2 = num[array].substr(1,2).c_str());
temp1 += temp2;
temp2 = num[array].substr(1,2).c_str());
temp1 -= temp2;
temp2 = num[array].substr(1,2).c_str());
temp1 += temp2;
temp2 = num[array].substr(1,2).c_str());
temp1 += temp2;
- CodeRace/20060105/아영보창 . . . . 15 matches
string temp;
temp = container[i]->data;
for(int j = 0; j < temp.size(); j++)
if (('A' <= temp[j] && temp[j] <= 'Z') || ('a' <= temp[j] && temp[j] <= 'z'))
newStr += temp[j];
string temp;
temp = container[i]->data;
for (int j = 0; j < temp.size(); j++)
container[i]->asciiSum += int(temp[j]);
Word *temp;
temp = container[i];
delete temp;
- EffectiveC++ . . . . 15 matches
// template으로
template class<T>
try { // attempt
template<class T>
template<class T>
template<class T>
const String temp("Hello"); // 임시 객체를 만든다.
x = temp; // 임시 객체를 operator=에 전달한다.
int temp;
temp = 2 * a; // 이런 연산. - friend함수를 사용하여 연산자를 정의 해줘야지만 작동한다.
template<class T> operator T*() const // 모든 NULL 포인터를 대체한다.
template<class C, class T) operator T C::*() const // 클래스의 모든 멤버를 대체한다.
template<class T> class Set: public list<T> { ... };
template<class T> class Set
template<class T> void Set<T>::insert(const T& 항목);
- PragmaticVersionControlWithCVS/CommonCVSCommands . . . . 15 matches
cvs checkout: Updating sesame2/sesame2/templates
U sesame2/sesame2/templates/test.test
root@eunviho:~/tmpdir/sesame# cvs update -d template
cvs update: Updating template
U template/file1.java
cvs update: Updating template
cvs -q -d /home/CVSHOME checkout -d temp
root@eunviho:~/tmpdir/sesame# cvs add template2
Directory /home/CVSHOME/sesame/template2 added to the repository
root@eunviho:~/tmpdir/sesame# cd template2/
root@eunviho:~/tmpdir/sesame/template2# cvs add test.txt
root@eunviho:~/tmpdir/sesame/template2# cvs commit -m "new file added"
/home/CVSHOME/sesame/template2/test.txt,v <-- test.txt
work> mv DataFormat.doc Temp.doc
work> mv Temp.doc DataFormat.doc
cvs commit: Examining template
cvs commit: Examining template2
- 문자반대출력/허아영 . . . . 15 matches
*(pCh+lenstr-i-1) = temp[i]; 이 부분에서 자꾸
*(pCh+lenstr-i) = temp[i]; 이렇게 코딩해서, 컴파일은 되는데, 결과물이 안나와서 답답했었다.
char temp[50];
temp[i] = *(pCh+i);
*(pCh+lenstr-i-1) = temp[i];
char temp[50];
*(temp+i) = *(pCh+i);
*(pCh+lenstr-i-1) = *(temp+i);
*(temp+i) = *(pCh+i);
*(pCh+lenstr-i-2) = *(temp + i);
*(pCh+lenstr-i-1) = *(temp+i+1);
str_temp[str_len-i-1] = ch[i];
while(str_temp[i] > 0)
cout<<str_temp[i];
char str_temp[50];
- 새싹교실/2012/주먹밥 . . . . 15 matches
int temp;
temp = a;
b = temp;
int temp;
temp = *a;
*b = *temp;
* C++이라면 이미지를 그리는 객체를 Templete로 만들어서 paint()함수에 그래픽 *를 넘겨서 자기가 알아서 그리게하는것이 좋다. list에 넣고 for문만 돌리면 끝나니까
int temp;
temp = rand()%10+1;
if(a[i] == temp){
temp = rand()%10+1;
a[count++] = temp;
temp = a[j];
a[j+1] = temp;
temp = a[i];
a[j] = temp;
- DataStructure/List . . . . 14 matches
Node pTemp=new Node(0);
pTemp=pHead;
pTemp=pTemp.pNext;
pNew.pNext=pTemp.pNext;
pTemp.pNext=pNew;
Node pTemp=new Node(0);
Node pTemp2=new Node(0);
pTemp=pHead;
pTemp=pTemp.pNext;
pTemp2=pTemp.pNext;
pTemp.pNext=pTemp2.pNext;
Node pTemp=new Node(0);
pTemp=pHead;
pTemp=pTemp.pNext;
data=pTemp.getData();
Node tempNode[] = new Node[m_Node.length+1]; //m_Node에 하나의 자료를 더 넣기 위해서 이보다
for(int i=0;i<tempNode.length-1 && i<coordi;i++) //tempNode에 m_Node를 우선 coordi번째(0부터 시작해서) 전의 자리
tempNode[i] = m_Node[i]; //까지 복사 한다.
tempNode[coordi] = tem;
tempNode[coordi-1].next = tempNode[coordi]; //낀 곳의 바로 앞에 있는 자료가 첨가한 자료를 참조하게 한다.
- JavaScript/2011년스터디/URLHunter . . . . 14 matches
var temp=Math.floor(Math.random()*40)+1
if(mop[temp]!=0 && hunter!=temp){
mop[temp]=1;
var temp=Math.floor(Math.random()*10)+1;
if(temp<9){
timer.templus();
this.temp = 0;
this.templus = function(){
this.temp++;
if(this.temp%10 == 0)
var temp;
temp=Math.floor(Math.random()*3)-1;
arr[i]='-'; arr[temp+i]='a';
- Where's_Waldorf/곽병학_미완.. . . . . 14 matches
int temp_r;
int temp_c;
temp_r = row;
temp_c = col;
temp_r += y[i]; //방향이동
temp_c += x[i];
System.out.println("111 "+ temp_r + " " + temp_c);
if(temp_r >= 0 && temp_r < m && temp_c >=0 && temp_c <n) {
if(grid[temp_r][temp_c] == str.charAt(idx)) {
- WheresWaldorf/Celfin . . . . 14 matches
char temp[255];
bool check(int ax, int ay, char *temp)
int length = strlen(temp);
if(list[x][y]!=temp[n])
if(list[x][y]!=temp[n])
if(list[x][y]!=temp[n])
if(list[x][y]!=temp[n])
if(list[x][y]!=temp[n])
if(list[x][y]!=temp[n])
if(list[x][y]!=temp[n])
if(list[x][y]!=temp[n])
cin.getline(temp, 255);
cin.getline(temp, 255);
cin.getline(temp, 255);
- 가위바위보/영록 . . . . 14 matches
int temp1,temp2;
temp1=a;
temp2=a;
if(temp1>temp2)
if(temp1 == '2' && temp2 == '0')
else if (temp1==temp2)
else if (temp1 < temp2)
if(temp1== '0' && temp2 == '2' )
- 새싹교실/2012/startLine . . . . 14 matches
Node *temp = linkedList->headNode;
for(;temp->nextNode != NULL;){
temp = temp->nextNode;
temp->nextNode = node;
Node *temp = linkedList->headNode;
for( ; temp->nextNode != NULL ; length++ ){
temp = temp->nextNode;
Node *temp = linkedList->headNode;
for( ; temp->nextNode != NULL ; ){
printf("%d\t", temp->data);
temp = temp->nextNode;
- ContestScoreBoard/허아영 . . . . 13 matches
int temp_team_num, q_num, q_index[MAX_OF_TEAM_NUM]; // 문제 푼 index
int temp_time;
cin >> temp_team_num;
if(temp_team_num == 0) // case 끝은 0으로
cin >> temp_time;
team_data[temp_team_num][0] += temp_time;
team_data[temp_team_num][q_index[temp_team_num]] = q_num; // 문제번호 넣기
q_index[temp_team_num]++;
team_data[temp_team_num][0] += 20;
team_data[temp_team_num][q_index[temp_team_num]] = q_num;
- IsBiggerSmarter?/문보창 . . . . 13 matches
vector<int> v_temp;
v_temp.reserve(MAX_ELEPHANT);
Elephant temp;
temp.weight = e[k].weight;
temp.IQ = e[k].IQ;
v_temp.push_back(e[k].index);
if (temp.weight >= e[i].weight || temp.IQ <= e[i].IQ)
temp.weight = e[i].weight;
temp.IQ = e[i].IQ;
v_temp.push_back(e[i].index);
result = v_temp;
v_temp.clear();
- Omok/유상욱 . . . . 13 matches
int i,check_x=0,check_y=0,check_cl=0,check_cr=0,che=0,temp=omok_array[x][y];
if ( omok_array[x-i][y] == temp)
if ( omok_array[x-(i+1)][y] != temp )
return temp;
if ( omok_array[x][y-i] == temp)
if ( omok_array[x][y-(i+1)] != temp )
return temp;
if ( omok_array[x-i][y-i] == temp)
if ( omok_array[x-(i+1)][y-(i+1)] != temp )
return temp;
if ( omok_array[x-i][y+i] == temp)
if ( omok_array[x-(i+1)][y+(i+1)] != temp )
return temp;
- RandomWalk/창재 . . . . 13 matches
int def_temp;
int temp_h, temp_y;
temp_h = start_h;
temp_y = start_y;
while (def_temp != 0 )
while (place_h == temp_h -1 || place_h == temp_h +1)
while (place_y == temp_h -1 || place_y == temp_y +1)
temp_h = place_h;
temp_y = place_y;
def_temp = def_empty();
- TheTrip/김상섭 . . . . 13 matches
int num, i, temp1;
double temp_max,temp_min;
temp_max = double((num + 10)/10)/100;
temp_min = double((num)/10)/100;
temp_max = temp_min;
if(test[i] > temp_max)
max += test[i] - temp_max;
else if( test[i] < temp_min)
min += temp_min - test[i];
cin >> temp_max;
test.push_back(temp_max);
- [Lovely]boy^_^/USACO/GreedyGiftGivers . . . . 13 matches
string tempname;
int tempmoney;
fin >> tempname;
fin >> tempmoney;
List[tempname] -= tempmoney;
string tempname2;
dist = tempmoney / numto;
fin >> tempname2;
List[tempname2] += dist;
if(tempmoney - dist * numto)
List[tempname] += (tempmoney - dist * numto);
- biblio.xsl . . . . 13 matches
<xsl:template match="bibliography">
<xsl:apply-templates select="topic">
</xsl:apply-templates>
</xsl:template>
<xsl:template match="topic">
<xsl:apply-templates select="../book[not(@type='ref') and @topic=$topic]">
</xsl:apply-templates>
</xsl:template>
<xsl:template match="book">
<xsl:apply-templates select="comment"/>
</xsl:template>
<xsl:template match="comment">
</xsl:template>
- 데블스캠프2013/셋째날/머신러닝 . . . . 13 matches
string[] temp1 = new string[SIZEBIG];
temp1 = line.Split(sep);
sampleNews[count].words[i] = Convert.ToInt32(temp1[i]);
temp1 = new string[SIZESMALL];
temp1 = line.Split(sep);
if (temp1[i] == "1") sampleNews[count].category = i;
temp1 = new string[SIZEBIG];
temp1 = line.Split(sep);
testNews[count].words[i] = Convert.ToInt32(temp1[i]);
int diffTemp = 0;
diffTemp = testNews[i].words[k] - sampleNews[j].words[k];
if (diffTemp < 0) diffTemp = diffTemp * (-1);
diff += diffTemp;
char temp;
int cat,i,j,k,itemp;
itemp=rank[cat][i];
rank[cat][j]=itemp;
- 새싹교실/2011/무전취식/레벨4 . . . . 13 matches
int temp; //임시 계산할 변수
temp = ( ( rand() % KICK +1)); //1~KICK까지의 데미지를 입힌다.
printf("소라를 발로찹니다. 데미지 : %d 를 입혔다!\n",temp);
Sora = Sora - temp; break;
temp = ( ( rand() % PUNCH +1));
printf("소라를 때립니다. 데미지 : %d 를 입혔다!\n",temp);
Sora = Sora - temp; break;
temp = ( ( rand() % SORAKICK +1));
printf("소라가 발로찹니다. 데미지 : %d 를 입었다!\n",temp);
My = My - temp; break;
temp = ( ( rand() % SORAPUNCH + 1));
printf("소라가 때립니다. 데미지 : %d 를 입었다!\n",temp);
My = My - temp; break;
- 새싹교실/2012/새싹교실강사교육/2주차 . . . . 13 matches
int temp; //임시 계산할 변수
temp = ( ( rand() % KICK +1)); //1~KICK까지의 데미지를 입힌다.
printf("소라를 발로찹니다. 데미지 : %d 를 입혔다!\n",temp);
Sora = Sora - temp; break;
temp = ( ( rand() % PUNCH +1));
printf("소라를 때립니다. 데미지 : %d 를 입혔다!\n",temp);
Sora = Sora - temp; break;
temp = ( ( rand() % SORAKICK +1));
printf("소라가 발로찹니다. 데미지 : %d 를 입었다!\n",temp);
My = My - temp; break;
temp = ( ( rand() % SORAPUNCH + 1));
printf("소라가 때립니다. 데미지 : %d 를 입었다!\n",temp);
My = My - temp; break;
- AseParserByJhs . . . . 12 matches
char temp[128];
temp [c_index++] = (char) fgetc (s);
if (temp [c_index-1] == '"') {
temp [c_index-1] = '\0';
memcpy (pM->Name, temp, strlen(temp));
char temp[128];
temp [c_index++] = (char) fgetc (s);
if (temp [c_index-1] == '"') {
temp [c_index-1] = '\0';
memcpy (pM->ParentName, temp, strlen(temp));
- EightQueenProblem/김형용 . . . . 12 matches
for tempy in range(8):
oldQueen = map[self.x][tempy]
for tempx in range(8):
oldQueen = map[tempx][self.y]
for tempx,tempy in makeRightDigTuple(self.getPosition()):
oldQueen = map[tempx][tempy]
for tempx,tempy in makeLeftDigTuple(self.getPosition()):
oldQueen = map[tempx][tempy]
- EuclidProblem/곽세환 . . . . 12 matches
int temp = u % v;
v = temp;
int temp1, temp2;
temp1 = (a2 - 1) / b2;
y += temp1;
//x *= temp1;
a2 = a2 - temp1 * b2;
temp2 = (b2 - 1) / a2;
x += temp2;
y *= temp2;
b2 = b2 - temp2 * a2;
- LC-Display/상협재동 . . . . 12 matches
char temp = n[t][k];
if(pattern[atoi(&temp)][patNum] != 0)
char temp = n[t][k];
if(pattern[atoi(&temp)][patNum1] != 0)
temp = n[t][k];
if(pattern[atoi(&temp)][patNum2] != 0)
for(int temp_s = 0; temp_s < s[t]; temp_s++ )
for(temp_s = 0; temp_s < s[t]; temp_s++ )
- OurMajorLangIsCAndCPlusPlus/2006.2.06/김상섭 . . . . 12 matches
char * temp = new char[strlen(ch)+strlen(a.ch)+1];
strcpy(temp,ch);
strcpy(temp+strlen(ch),a.ch);
ch = temp;
newstring *temp = new newstring(strlen(a.ch)+strlen(b.ch)+1);
strcpy(temp->ch,a.ch);
strcpy(temp->ch+strlen(a.ch),b.ch);
return *temp;
char temp[100];
is >> temp;
ns.ch = new char[strlen(temp)+1];
strcpy(ns.ch,temp);
- Refactoring/ComposingMethods . . . . 12 matches
== Inline Temp p119 ==
* You have a temp that is assigned to once twith a simple expression, and the temp is getting in the way of other refactorings. [[BR]] ''Replace all references to that temp with the expression.''
== Replace Temp with Query p120 ==
["ReplaceTempWithQuery"]
* You have a complicated expression. [[BR]] ''Put the result of the expression, or parts of the expression,in a temporary variagle with a name that explains the purpose.''
== Split Temprorary Variable p128 ==
* You have a temporary variagle assigned to more than once, bur is not a loop variagle nor a collecting temporary variagle. [[BR]] ''Make a separate temporary variagle for each assignment.''
double temp = 2 * (_height + _width);
System.out.println (temp);
temp = _height * _width;
System.out.println(temp);
* The code assigns to a parameter. ''Use a temporary variagle instead.''
- SmithNumbers/문보창 . . . . 12 matches
int temp = n;
sumDigitNumber += temp % 10;
temp /= 10;
} while (temp != 0);
int temp = n;
while (temp % 2 == 0)
temp /= 2;
while (i <= sqrt(temp) + 1)
if (temp % i == 0)
temp /= i;
if (temp > 1)
sumDigitPrimeFactor += sum_digit_number(temp);
- [Lovely]boy^_^/USACO/BrokenNecklace . . . . 12 matches
string temp;
temp = CutAndPasteBack(BeadsList, i+1);
cur = temp[0];
if(temp[j] != 'w')
cur = temp[j];
if(cur == temp[j] || temp[j] == 'w')
cur = temp[len-1];
if(temp[len-1-j] != 'w')
cur = temp[len-1-j];
if(cur == temp[len-1-j] || temp[len-1-j] == 'w')
- 새싹교실/2012/AClass/5회차 . . . . 12 matches
int temp;
temp=*a;
*b=temp;
int temp;
temp= *a;
*b = temp;
int temp;
temp=*x;
*y=temp;
int temp;
temp=*a;
*b=temp;
- 새싹교실/2012/주먹밥/이소라때리기게임 . . . . 12 matches
int temp;
temp = ( ( rand() % who->skill.heal));
who->skill.health += temp;
printf("%s가 %s를 힐해줍니다. 피가 : %d 만큼 채워졌습니다!\n",who->name,who->name,temp);
int temp;
temp = ( ( rand() % who->skill.kick));
target->skill.health -= temp;
printf("%s가 %s를 발로찹니다. 데미지 : %d 만큼 입혔습니다!\n",who->name,target->name,temp);
int temp;
temp = ( ( rand() % who->skill.punch));
target->skill.health -= temp;
printf("%s가 %s를 때립니다. 데미지 : %d 만큼 입혔습니다!\n",who->name,target->name,temp);
- 수학의정석/집합의연산/이영호 . . . . 12 matches
char temp[3000];
temp[count++] = 99;
temp[count++] = buf[j+t];
temp[count++] = 99;
temp[count++] = buf[j+t];
temp[count++] = next;
temp[count++] = 99;
temp[count++] = next;
temp[count] = '\0';
memcpy(buf, temp, strlen(temp));
buf[strlen(temp)] = '\0';
- 압축알고리즘/희경&능규 . . . . 12 matches
char temp = NULL;
if(pass[i] != temp)
fout << number << temp;
temp = pass[i];
fout << number << temp;
char temp = NULL;
temp = pass[i];
pass[i] = (temp-pass[i])+48;
char temp = NULL;
temp = pass[i];
pass[i] = temp+(pass[i]-48);
pass[i] = temp-(pass[i]-48);
- AcceleratedC++/Chapter8 . . . . 11 matches
'''template'''
template <class T> // type 매개변수의 지정, 이 함수의 scope안에서는 데이터 형을 대신한다.
* 독자적 방식의 template 모델 Compiler : 최근의 방식. 인스턴스화를 위해서 STL 정의부에 대한 접근이 필요.
template <class T>
{{{~cpp template <class In, class X> In find(In begin, In end, const X& x) {
template <class In, class X> In find(In begin, In end, const X& x) {
template <class In, class Out> Out copy(In begin, In end, Out dest) {
template <class For, class X> void replace(For begin, For end, const X& x, const X& y) {
template <class Bi> void reverse(Bi begin, Bi end) {
template <class Ran, class X> bool binary_search(Ran begin, Ran end, const X& x) {
template <class Out> // changed
- CheckTheCheck/문보창 . . . . 11 matches
bool temp[2] = {0,};
if (col - count >= 0 && !temp[0])
else temp[0] = 1;
if (col + count < 8 && !temp[1])
else temp[1] = 1;
temp[0] = temp[1] = 0;
if (col - count >= 0 && !temp[0])
else temp[0] = 1;
if (col + count < 8 && !temp[1])
else temp[1] = 1;
- DataStructure/Stack . . . . 11 matches
int temp=top;
while(temp!=-1)
cout<<data[temp--];
Node* temp=new Node;
temp->m_nData=x;
temp->m_pPrev=top;
top=temp;
Node* temp=top->m_pPrev;
top=temp;
Node* temp=top;
top=temp;
- TheTrip/곽세환 . . . . 11 matches
int temp;
temp = 0.0;
temp += student[i] - aver;
for (i = 0; temp >= 1 && i < n; i++)
temp -= 1;
int temp;
temp = student[i];
student[j] = temp;
int temp;
temp = studentExchanged[i];
studentExchanged[j] = temp;
- 김희성/리눅스계정멀티채팅2차 . . . . 11 matches
char temp_buff[BUFF_SIZE+1];
sprintf(temp_buff,"./help\n");
if(!stcmp(temp_buff,buff_rcv))
sprintf(temp_buff,"./list\n");
if(!stcmp(temp_buff,buff_rcv))
sprintf(temp_buff,"./message ");
if(temp_buff[i]!=buff_rcv[i])
sprintf(temp_buff,"send to %s : %s", id[i], &buff_rcv[j+11] );
send_m(client_socket_array[t_num-1],temp_buff);
sprintf(temp_buff,"message from %s : %s",
send_m(client_socket_array[k],temp_buff);
- 진법바꾸기/허아영 . . . . 11 matches
int temp[50] = {0, };
int temp_jinsu, turn = 0, i = 0;
temp_jinsu = ten_jinsu;
temp[i] = temp_jinsu % any_jinbeob;
temp_jinsu = temp_jinsu/any_jinbeob;
}while(temp_jinsu >= any_jinbeob);
temp[turn] = temp_jinsu;
printf("%c", match_Num[temp[i]]);
- 3 N+1 Problem/조동영 . . . . 10 matches
int temp;
temp = low;
while(temp<high){
while(temp !=1){
if(temp % 2 == 1)
temp = 3 * temp + 1;
temp = temp / 2;
temp = ++low;
- AntOnAChessboard/하기웅 . . . . 10 matches
int step, i, j, temp, counting;
temp = st-pow(i,2);
temp--;
if(temp==0)
temp--;
if(temp==0)
temp--;
if(temp==0)
temp--;
if(temp==0)
- C++스터디_2005여름/학점계산프로그램/허아영 . . . . 10 matches
char temp[20];
fin.getline(temp, 20, ':');
char temp[20];
fin.getline(temp, 20, 'n');
char temp[10];
double temp_grade;
temp_grade = credit_average[i];
credit_average[j] = temp_grade;
strcpy(temp, name[j]);
strcpy(name[i], temp);
- JavaStudy2002/상욱-2주차 . . . . 10 matches
int tempX = 0, tempY = 0;
tempX = xRoach + roach.moveSide();
tempY = yRoach + roach.moveUpandDown();
if ( board.boardState(tempX, tempY) == true ) {
observer.checkStay(tempX-1, tempY-1);
xRoach = tempX;
yRoach = tempY;
- ReverseAndAdd/Celfin . . . . 10 matches
int input[10], temp[10], carry[10];
int tempNum;
temp[i] = (input[i]+input[number-i+9]+carry[i])%10;
temp[i] = input[i]+input[number-i+9]+carry[i];
temp[i]=1;
input[i] = temp[i];
cin >> tempNum;
input[number] = tempNum%10;
if((int)(tempNum/pow(10, i))!=0)
input[number]=(int)(tempNum/pow(10, i))%10;
- 데블스캠프2009/목요일/연습문제/MFC/정종록 . . . . 10 matches
double temp;
temp = m_number;
temp = m_number;
m_number = m_number + temp;
m_number = m_number - temp;
m_number = m_number * temp;
m_number = temp/m_number;
temp = 0;
temp = m_number;
temp = m_number;
- 데블스캠프2012/넷째날/묻지마Csharp/Mission3/서영주 . . . . 10 matches
int temp;
temp = int.Parse(label4.Text);
temp++;
label4.Text = temp.ToString();
String tempString = label5.Text;
tempString = tempString.Substring(1, tempString.Length - 1) + tempString.Substring(0, 1);
label5.Text = tempString;
- 데블스캠프2012/넷째날/묻지마Csharp/Mission4/서영주 . . . . 10 matches
int temp;
temp = int.Parse(label4.Text);
temp++;
label4.Text = temp.ToString();
String tempString = label5.Text;
tempString = tempString.Substring(1, tempString.Length - 1) + tempString.Substring(0, 1);
label5.Text = tempString;
- 문자반대출력/조현태 . . . . 10 matches
char temp;
while (inputFile.get(temp))
file_data.get_in(temp);
while (file_data.get_out(&temp))
if (0>temp)
char temp_next;
file_data.get_out(&temp_next);
outputFile << temp_next << temp;
outputFile << temp;
- 토이/메일주소셀렉터/김정현 . . . . 10 matches
String tempString= inputName.replace('.', '-');
String[] splitedStrings= tempString.split("-");
String temp= input;
temp= temp.replace(string, "");
char[] chars= temp.toCharArray();
temp= "";
temp= temp + c + " ";
return temp;
- 희경/엘레베이터 . . . . 10 matches
int temp = 1;
if(temp < floor)
while(temp+1 != floor)
temp++;
cout << "지금 현재 " << temp << "층을 지나고 있습니다" << endl
temp++;
else if(temp > floor)
while(temp-1 != floor)
temp--;
cout << "지금 현재 " << temp << "층을 지나고 있습니다" << endl
- A_Multiplication_Game/권영기 . . . . 9 matches
long long int temp;
temp = start/9;
if(temp * 9 < start)temp++;
return temp;
temp = start/2;
if(temp * 2 < start)temp++;
return temp;
- CppStudy_2002_1/과제1/상협 . . . . 9 matches
int tempcount=count;
while(tempcount>0)
tempcount--;
template <class Any>
template <class Any>
template <class Any>
template <> char* max(char* in[], int i);
template <class Any>
template <class Any>
- Graphical Editor/Celfin . . . . 9 matches
char color, temp;
int tempInt;
tempInt = x_1;
x_2 = tempInt;
tempInt = y_1;
y_2 = tempInt;
if (bitmap[x][y]!=temp)
if(bitmap[x + PLUS_X[j]][y + PLUS_Y[j]]==temp && bitmap1[x + PLUS_X[j]][y + PLUS_Y[j]])
temp = bitmap[x1][y1];
- HardcoreCppStudy/첫숙제/ValueVsReference/변준원 . . . . 9 matches
int temp;
temp = x;
y = temp;
int temp;
temp = *x;
*y = temp;
int temp;
temp = x;
y = temp;
- JollyJumpers/iruril . . . . 9 matches
int tempDiffer;
tempDiffer = Math.abs( jumpersArray[i] - jumpersArray[i+1] );
// System.out.println(tempDiffer);
if( tempDiffer < length)
differenceArray[tempDiffer] = true;
public boolean [] setFalse( boolean [] temp )
for(int i = 0; i < temp.length; i++)
temp[i] = false;
return temp;
- LinkedList/학생관리프로그램 . . . . 9 matches
Student* temp;
temp = aHead;
free(temp);
Student* temp;
temp = aHead;
while(temp){//링크를 쭉~따라가면서 출력
printf("%s\n",temp->name);
temp = temp->nextStudent;
- MultiplyingByRotation/문보창 . . . . 9 matches
int temp;
temp = lsd;
carryIn = (temp * factor) / base;
temp = (temp * factor) % base;
carryOut = (temp * factor + carryIn) / base;
temp = (temp * factor + carryIn) % base;
if (carryOut == 0 && temp == lsd)
- PPProject/Colume2Exercises . . . . 9 matches
char temp;
temp = str[tag];
str[base] = temp;
char temp;
temp = str[front];
str[rear] = temp;
char temp;
temp = str[start1];
str[start2] = temp;
- PowerOfCryptography/허아영 . . . . 9 matches
int temp;
temp = k;
k *= temp;
double temp;
temp = k;
k *= temp;
음.. 잘짯네.^^ 근데 temp라는 전역변수 없어도 되는거 아니냐?ㅎ 아웅 복잡해~>ㅁ<;; 그리궁..재귀호출인듯..ㅎ 꼭 재귀호출 안써도 될것 같은데 말야.^^ 잘못하면 스택오버플로우의 압박이..;;ㅁ;; 아닌가?ㅎ~~>ㅃ<;;;; ㅎㅎ 그럼 조은하루~!^^* - [조현태]
temp도 나중에 넣은거야. temp 넣지 않고 k 값을 바로 받아버리면 값이 달라져서 그렇게 했어 ^^
- StringOfCPlusPlus/영동 . . . . 9 matches
Anystring::Anystring(const char* tempstr)
strncpy(str, tempstr, 30);
Anystring temp_string;
strncpy(temp_string.str, str, 30);
temp_string.str[count+i]=string1.str[i];
return temp_string;
Anystring temp_string;
temp_string=string0+string1;
cout<<temp_string;
- VendingMachine/세연 . . . . 9 matches
int _temp_money;
_money = _temp_money = 0;
cin >> _temp_money;
if(_temp_money == 10 || _temp_money == 50 || _temp_money == 100 || _temp_money == 500 || _temp_money == 1000)
_money = _money + _temp_money;
- subsequence/권영기 . . . . 9 matches
int n, k, i, ans, temp = 0;
temp = 0;
if(k - 1 <= 0)temp += laundry[i] - mid;
else temp += (laundry[i] - mid + (k - 2)) / (k-1);
if(temp <= mid){
int n, c, temp, count;
for(i = 1, temp = 0; i<n; i++){
if(barn[i] - barn[temp] >= mid){
temp = i;
- 데블스캠프2003/넷째날/Linux실습 . . . . 9 matches
* 예)cd temp_file
* 예)rm temp_file
*예)cd temp_file
* cp 파일1 temp_file => 파일1을 temp_file로 카피한다.
* cp 파일1 ../temp_file => 파일1을 현재의 상위 디렉토리의 하위 디렉토리인 temp_file로 카피한다.
* mv aaa.txt ./temp_file => aaa.txt를 temp_file이란 하위 디렉토리로 옮긴다.
- 비밀키/강희경 . . . . 9 matches
char temp;
while(fin.get(temp))
temp += 3; //비밀키 +3
fout << temp;
cout << temp;
while(fin1.get(temp))
temp -= 3; //비밀키 -3
fout1 << temp;
cout << temp;
- 삼총사CppStudy/숙제2/곽세환 . . . . 9 matches
CVector temp(cx + v.GetX(), cy + v.GetY(), cz + v.GetZ());
return temp;
CVector temp;
temp.SetVector(cx - v.GetX(), cy - v.GetY(), cz - v.GetZ());
return temp;
CVector temp(cx * s, cy * s, cz * s);
return temp;
CVector temp(cy * v.GetZ() - cz * v.GetY(), cz * v.GetX() - cx * v.GetZ(), cx * v.GetY() - cy * v.GetX());
return temp;
- 알고리즘8주숙제/문보창 . . . . 9 matches
Node * temp = root;
while (temp)
parent = temp;
if (temp->data < newNode->data)
temp = temp->right;
else if (temp->data > newNode->data)
temp = temp->left;
- 3N+1Problem/김회영 . . . . 8 matches
int temp = n2;
if(check(temp)>max)
max = check(temp);
temp--;
int temp = n%2;
if(temp==0)//temp값이 짝수라면..
else //temp값이 홀수라면..
- 5인용C++스터디/소켓프로그래밍 . . . . 8 matches
char temp[1000];
m_pChild->Receive(temp, sizeof(temp));
strText = "[" + strText + "]" + temp;
char temp[100];
m_pClient->Receive(temp, sizeof(temp));
strText = "[" + strText + "]" + temp;
- AcceleratedC++/Chapter12 . . . . 8 matches
template<class In> Str(In b, In e) {
template <class In> Str(In i, In j) {
Str temp1("Hello, ");
Str temp2 = temp1 + name;
Str temp3("!");
Str greeting = temp2 + temp3;
- AnEasyProblem/강성현 . . . . 8 matches
int temp = i;
while (temp>0) { c+=temp%2; temp>>=1;}
int temp = ++i, cc = 0;
while (temp>0) { cc+=temp%2; temp>>=1;}
- AproximateBinaryTree/김상섭 . . . . 8 matches
double min_total_weight_sum, temp;
temp = left_sum*sqrt(i-1) + right_sum*sqrt(dp->nodes.size() - i - 1);
if(temp < min_total_weight_sum)
min_total_weight_sum = temp;
data temp;
temp.name = name;
temp.value = value;
root->nodes.push_back(temp);
- BeeMaja/김상섭 . . . . 8 matches
int count = 0, temp = 6, x, y, i;
num -= temp;
temp += 6;
temp = -1*num;
temp = count;
x += de_x[i]*temp;
y += de_y[i]*temp;
num += temp;
- BirthdayCake/허준수 . . . . 8 matches
Cherry temp;
temp.x = x;
temp.y = y;
temp.gradient= (double)y/x;
Gradient.push_back(temp);
Cherry temp;
temp.gradient = Gradient[j].gradient;
Gradient[k].gradient = temp.gradient;
- EightQueenProblem/조현태 . . . . 8 matches
time_t temp;
time_t sub_temp;
srand(time(&temp));
time(&sub_temp);
if (temp!=sub_temp){
temp=sub_temp;
- IsThisIntegration?/김상섭 . . . . 8 matches
double temp;
while(cin >> temp)
temp = temp*temp;
cout << temp*a << " " << temp*b << " " << temp*c << endl;
- JollyJumpers/문보창 . . . . 8 matches
int ftemp, ltemp; // 앞숫자, 뒷숫자
cin >> ftemp;
cin >> ltemp;
gap = abs(ftemp-ltemp);
ftemp = ltemp;
- PolynomialCoefficients/문보창 . . . . 8 matches
int n, k, i, j, temp1, temp2, coeffi;
temp1 = temp2 = 1;
temp2 *= j;
temp1 *= i;
cout << temp1/temp2 << endl;
- Steps/김상섭 . . . . 8 matches
unsigned int temp = 0;
while(max[temp] < i)
temp++;
return temp;
unsigned int i, length1, length2, testnum, temp = 1;
temp = temp << 31;
for(count = 1; max[count-1] < temp; count++)
- TheTrip/이승한 . . . . 8 matches
int i, tempIntAver;;
double tempInput;
i=tempInput=0; //임시변수 초기화
cin>>tempInput;
stu[i] = tempInput; //각학생의 경비정보를 저장한다.
sum += tempInput; //합을 누적합계한다.
tempIntAver = (sum * 100) / stuN; //센트단위까지만 계산하기 위한 조치.
aver = tempIntAver/100;
- UpgradeC++/과제1 . . . . 8 matches
int temp =9;
for(int col4=temp ;col4>0;col4--)
temp = temp-2;
int temp =9;
for(int icol3=temp ;icol3>0;icol3--)
temp=temp-2;
- 권영기/채팅프로그램 . . . . 8 matches
int temp;
int temp;
int temp = (int *)data;
if(recv(client_socket[temp], buff_rcv, SIZE, 0) <= 0)continue;
close(client_socket[temp]);
client_socket[temp] = check[temp] = 0;
int temp;
- 데블스캠프2009/금요일/연습문제/ACM2453/송지원 . . . . 8 matches
int input, i=2, b=1, count=0, temp = 0;
temp = input;
temp >>= 1;
if(temp %2 == 1) break;
printf("temp : %d\n", temp);
for(;1;count++, temp >>= 1)
if(temp %2 == 0) break;
- 데블스캠프2011/셋째날/String만들기/서지혜 . . . . 8 matches
String temp(newValues);
temp.length = newLength;
return temp;
String temp(str2.toUpper());
if(temp.equals("DDDDCCC"))
String temp2(temp.toLower());
if(temp2.equals("ddddccc"));
- 2002년도ACM문제샘플풀이/문제E . . . . 7 matches
InputData temp;
temp = inputData[i];
sort(&temp.weight[0],&temp.weight[inputData[i].n]);
if(temp.weight[j]!=inputData[i].weight[j])
totalWeight+=temp.weight[j];
totalWeight+=temp.weight[j];
- 3N 1/김상섭 . . . . 7 matches
Data temp;
temp.num = num /=2;
temp.pre_count = count++;
data.push_back(temp);
temp.num = num = num*3 + 1;
temp.pre_count = count++;
data.push_back(temp);
- 3N+1/김상섭 . . . . 7 matches
Data temp;
temp.num = num /=2;
temp.pre_count = count++;
data.push_back(temp);
temp.num = num = num*3 + 1;
temp.pre_count = count++;
data.push_back(temp);
- 3N+1Problem/문보창 . . . . 7 matches
long temp; // 과정 값은 32비트를 넘길 수도 있다.
temp = i;
if (temp % 2 == 0)
temp /= 2;
if (temp == 1)
temp = (3 * temp + 1) / 2;
- BirthdatCake/하기웅 . . . . 7 matches
Point temp;
temp.x = i;
temp.y = j;
return temp;
temp.x = i;
temp.y = j;
return temp;
- CPPStudy_2005_1/STL성적처리_4 . . . . 7 matches
Student_info temp;
temp.name = name;
temp.score.push_back(score);
students.push_back(temp);
temp.score.erase(temp.score.begin(),temp.score.end());
- DataStructure/Foundation . . . . 7 matches
double temp=1.0;
temp = lalala2(x, n/2);
return temp*temp*x;
temp = lalala2(x, n/2);
return temp*temp;
- EcologicalBinPacking/김회영 . . . . 7 matches
int temp=0;//각각의 조합에 대한 현재값을 저장한다.
temp+=array[i];
temp+=array[j];
temp+=array[12-(i+j)];
if(temp > max)
max=temp;
temp=0;
- HowManyZerosAndDigits/김회영 . . . . 7 matches
info_number temp;
test(result_number,radix,&temp);
cout<<temp.zero_count<<","<<temp.total_count;
void test(int n,int radix,info_number* temp)
(*temp).total_count=total_count;
(*temp).zero_count=zero_count;
- JTDStudy/첫번째과제/영준 . . . . 7 matches
int[] temp = new int[3];
temp[0] = answer/100;
temp[1] = answer/10%10;
temp[2] = answer%10;
if (num[i] == temp[j] && i == j)
else if(num[i] == temp[j] && j != i && num[j] != temp[j])
- JollyJumpers/오승균 . . . . 7 matches
int temp;
temp = ar[j] - ar[j + 1] ;
if (temp < 0)
temp = -temp;
if (temp == i)
if (temp != i)
- LinkedList/세연 . . . . 7 matches
node * temp = new node;
head_pointer = temp;
temp->node_pointer = head_pointer;
head_pointer = temp;
node * temp = new node;
temp = head_pointer;
delete temp;
- MoreEffectiveC++/Basic . . . . 7 matches
C++에서 class templete를 만드는 중 생성자를 빼먹으면 compiler에서 기본적인 생성자를 만들어 생성해 준다. 역시, 당연히 초기화의 문제가 발생할 것이다. 여기에서는 약간 자세한 부분을 언급한다.
* '''두번째 문제는 많은 template class(특히 STL에서) 들에게 아픔을 안겨준다. '''
아래와 같은 template class 를 선언했다고 가정하면,
template<class T>
template<class T>
첫번째에서 제기된 문제가 이번에는 template class 내부에서 일어 나고 있는 셈이다. 거참 암담한 결과를 초례한다. 문제는 이러한 template class 가 이제는 아예 STL같은 library로 구축되었단 사실. 알아서 잘 기본 생성자 만들어 적용하시라. 다른 방도 없다.
- ReverseAndAdd/문보창 . . . . 7 matches
unsigned int temp, t;
temp = originN;
while (temp / 10 != 0)
temp /= 10;
temp = originN;
t = temp / pow(10, len-1-i);
temp -= t * pow(10, len-1-i);
- TugOfWar/문보창 . . . . 7 matches
int tempSwap;
tempSwap = left[j];
right[k] = tempSwap;
tempSwap = left[j];
right[k] = tempSwap;
tempSwap = sumleft;
sumright = tempSwap;
- WeightsAndMeasures/김상섭 . . . . 7 matches
turtle temp;
temp.strength = temp.weight = 0;
test.push_back(temp);
while(cin >> temp.weight >> temp.strength)
test.push_back(temp);
- 새싹교실/2012/우리반 . . . . 7 matches
1.int a=10,b=12,temp;가 있는데 a에 있는 값을 b에 넣고, b에 있는 값을 a에 넣는 프로그램을 짜 보세요.
int a=10,b=12,temp;
* 오늘 6p에서 세번째 수업을 했다. if와 else if, temp, scanf, printf 에 대해서 많이 배웠다. scanf는 개념이 어려워서 많이 헷갈렸지만 &만 확실히 외우기로 결정했다. if를 배우면서 혼자 코딩을 해봤다. 괄호 맞추기가 너무 어렵다. 처음이라 보기좋게 못쓰겠다... 다음부턴 보기좋게 줄맞춰서 쓰기로 마음먹었다ㅎㅎㅎㅎㅎ -[장윤화]
* 오늘은 태진이형이 내주신 과제를 같이 해보면서 printf와 scanf 자료형 temp if else if를 섞어가며 각각의 함수를 알아보았다. 헷갈리는건 아직 마찬가지지만, 훈련하면 나아질거라고 생각한다. c언어는 정말 규칙이 많은것 같다. 집에서 코딩연습이 필요하다고 생각했고, 여러 규칙지키면서 해야하겠다 ㅋㅋ -[권도현]
int temp;
temp=*a;
*b=temp;
- 조영준/CodeRace/130506 . . . . 7 matches
pair temp;
temp.word = s[i];
temp.count = 1;
p.Add(temp);
temp.word = p[j].word;
temp.count = p[j].count + 1;
p[j] = temp;
- 05학번만의C++Study/숙제제출1/윤정훈 . . . . 6 matches
float Ftemp = 0;
float Ctemp = 0;
cin >> Ctemp;
Ftemp = Ctemp * 1.8 + 32.0;
cout << " 변환된 화씨온도는 " << Ftemp << "입니다." << endl;
- C++스터디_2005여름/도서관리프로그램/남도연 . . . . 6 matches
char name_temp[30];
char ISBN_temp[10];
cin >> name_temp;
if(strcmp(lent->book_name,name_temp)==0){
cin >> ISBN_temp;
if(strcmp(lent->book_ISBN,ISBN_temp)==0){
- DataStructure/Queue . . . . 6 matches
Node* temp=new Node;
temp->nData=x;
temp->pPrev=m_pRear;
m_pRear=temp;
Node* temp=m_pRear->pPrev;
m_pRear=temp;
- Gof/FactoryMethod . . . . 6 matches
4. Using templates to avoid subclassing. As we've mentioned, another potential problem with factory methods is that they might force you to subclass just to create the appropriate Product objects. Another way to get around this in C++ is to provide a template subclass of Creator that's parameterized by the Product
template
template
With this template, the client supplies just the product class?no subclassing of Creator is required.
Factory methods are usually called within Template Methods (325). In the document example above, NewDocument is a template method.
- HowManyPiecesOfLand?/문보창 . . . . 6 matches
char temp[MAXDIGITS];
cin >> temp;
lastdigit = strlen(temp) - 1;
if (temp[0] == '-')
else if (temp[0] == '+')
digit[j++] = temp[i] - '0';
- ImmediateDecodability/김회영 . . . . 6 matches
char temp;
cin.get(temp);
while(temp != '\n')
if(temp!=' ')
code[code_number][code_byte]=temp;
cin.get(temp);
- Interpreter/Celfin . . . . 6 matches
char temp[4];
cin.getline(temp, 4);
cin.getline(temp, 4);
for(number=0; cin.getline(temp, 4) && *temp; number++)
sscanf(temp, "%d", &ram[number]);
- Marbles/문보창 . . . . 6 matches
int temp = n - (n1 * count);
firstModulo = temp % n2;
if (temp % n2 == 0)
marble.box2 = temp / n2;
temp += n1;
if (firstModulo == temp % n2)
- MedusaCppStudy/희경 . . . . 6 matches
int temp;
temp = lenth[l];
lenth[m] = temp;
int temp;
temp = pocket[j];
pocket[k] = temp;
- MoreEffectiveC++/Miscellany . . . . 6 matches
* '''템플릿(template)의 확장''' :멤버 템플릿이 허용. 이것은 탬플릿의 명시적 표현을 위한 표준 문법,함수 템플릿에서 non-type 인자들 허용 하는것, 클래스 템플릿이 그들 자신의 템플릿을 인자로 받을수 있는것 이 있다.
* '''일반적인 목적의 컨테이너와 알고리즘에 대한 지원'''. 표준 C++ 라이브러리에 포함되어 있는 클래스, 함수 템플릿은 Standard Template Library(STL)로 알려져 있다. STL은 표준 C++ 라이브러리의 가장 혁명적인 부분이다. 나는 밑에 이것의 특징을 요약한다.
'''첫번째''' 라이브러리 안의 거의 모든것이 template이다. 이 책 내에서 나는 아마도 표준 string 클래스를 참고 했다. 그러나 사실 그런 클래스가 아니다. 대신에 문자들의 순서를 표현하는 basic_string 으로 불리는 클래스 템플릿이고, 이 템플릿은 문자형으로 순서를 만든다. 이것은 문자열을 char, wide char, Unide char, 무엇이든 허용한다.
template<class charT,
string 형의 사용을 위하여 위의 사항을 완전히 이해할 필요는 없다. 왜냐하면 단지 string은 Template Instantiation from Hell을 위한 typedef 이지만, 그것은 템플릿이 아닌 클래스와 같이 동작한다. 단지, 만약 당신이 문자열을 이루는 문자 형의 custmize가 필요하다면.. 혹은 당신이 문자열을 위한 메모리 할당에 대한 세부적인 조정을 원한다면... basic_string 템플릿은 이들을 할게 해줄것이라는 생각을 마음속에 새겨두어라.
=== The Standard Template Library : 표준 템플릿 라이브러리 ===
표준 C++ 라이브러리에서 가장 큰 뉴스는 Standard Template Library(표준 템플릿 라이브러리)인 STL이다. (C++ 라이브러리에서 거의 모든것이 템플릿이 된이후 그 이름 STL은 이제 특별한것이 아니다. 그럼에도, 이것은 라이브러리의 알고리즘과 컨테이너의 부분의 이름이다. 그래서 쓰기에 좋은 이름이기도, 나쁜 이름이기도 한다.)
해당 함수는 배열의 적용이 int에 한정되어 있어서 상속성이 없다. 그래서 그것을 템플릿(template)으로 만들어 본다.
template<class T>
template<class Iterator, class T>
축하한다! 당신은 Standard Template Library의 한 부분을 작성한 것이다. STL은 container와 iterator를 이용하는 알고리즘 묶음을 포함하고 있다. 그리고 find는 그들중에 하나이다.
- Ones/문보창 . . . . 6 matches
int n, temp, reminder, i, j;
temp = 1;
temp *= 10;
if (temp >= n)
temp %= n;
reminder += temp;
- OurMajorLangIsCAndCPlusPlus/print/허준수 . . . . 6 matches
char temp[100];
int itemp = va_arg(l, int);
itoa(itemp, temp, 10);
int len = strlen(temp);
fputs(temp, stdout);
- SpiralArray/영동 . . . . 6 matches
void setEmptyBoard(int aBoard[][MAX_X]);//배열 초기화
setEmptyBoard(board);//배열 초기화
void setEmptyBoard(int aBoard[][MAX_X])
int tempX;
cin>>tempX;
return tempX;
int tempY;
cin>>tempY;
return tempY;
- TheJavaMan/테트리스 . . . . 6 matches
int []tempX= new int[4];
int []tempY= new int[4];
tempX[i]=blockX[i];
tempY[i]=blockY[i];
blockX[i]=tempX[i];
blockY[i]=tempY[i];
- WorldCupNoise/권순의 . . . . 6 matches
int temp = 0;
temp = result_1 + result_2;
result_2 = temp;
int temp = 0;
temp = result_1 + result_2;
result_2 = temp;
- Yggdrasil/파스칼의삼각형 . . . . 6 matches
temp[j+1]=sum[j+1];이 필요한지 아직도 잘 모르겠습니다...
temp[j]=sum[j];면 될 거 같았는데...
int temp[10]={1,};
sum[j]=temp[j-1]+temp[j];
temp[j+1]=sum[j+1];
- whiteblue/MyTermProjectForClass . . . . 6 matches
int tempData;
int tempNumber;
tempData = stData[i];
tempNumber = arrayNumber[i];
stData[j] = tempData;
arrayNumber[j] = tempNumber;
- 기본데이터베이스/조현태 . . . . 6 matches
char temp_input[20];
scanf("%s",temp_input);
if (0==strcmp(temp_input,menu[i]))
char temp_data[MAX_BLOCK_SIZE];
scanf("%s",temp_data);
if (0==strcmp(temp_data,datas[i][select_number]))
- 미로찾기/곽세환 . . . . 6 matches
int temp[Max_y][Max_x];
temp[j][k] = array[j][k];
array[j][k] = temp[j][k];
int temp[Max_y][Max_x];
temp[j][k] = array[j][k];
array[j][k] = temp[j][k];
- 비밀키/김태훈 . . . . 6 matches
int temp;
temp = (int) ch;
fout << char(temp-x);
int temp;
temp = (int) ch;
fout << char(temp+y);
- 새싹C스터디2005/pointer . . . . 6 matches
int temp;
temp = *aX;
*aY = temp;
int temp;
temp = aX;
aY = temp;
- 새싹교실/2011/무전취식/레벨7 . . . . 6 matches
int temp;
temp = *x;
*y = temp;
int temp;
temp = x;
y = temp;
- 새싹교실/2012/AClass/3회차 . . . . 6 matches
int temp;
temp=*a;
*b=temp;
int temp;
temp = *pval1;
*pval2= temp;
- 성우용 . . . . 6 matches
char arraytemp;
arraytemp=pop();
printf("%c",arraytemp);
char temp;
temp=array[top];
return temp;
- 진법바꾸기/김영록 . . . . 6 matches
int temp;
temp = num1 % get_jegob(num2,num3-1);
num1 = num1 - temp; //나머지를 없앰으로서 소숫점을 남기지 않는다.
int temp=0;
temp = get_count(num1,num2,i);
printf("%d ",temp);
- 최대공약수/허아영 . . . . 6 matches
int temp;
temp = x1;
x1 = temp;
int temp;
temp = x2;
x2 = temp;
- 3N+1Problem/강희경 . . . . 5 matches
tempI = i
while(IsInRange(aMin, aMax, 2*tempI)):
aBinaryMap[tempI-aMin] = False
tempI = 2*tempI
- AntOnAChessboard/김상섭 . . . . 5 matches
int level, temp, x, y;
temp = num - (level-1)*(level-1);
if(temp > level)
y = 2*level - temp;
x = temp;
- CPPStudy_2005_1/STL성적처리_1 . . . . 5 matches
string name, temp;
int scoreTemp;
while(fin>>temp && subject.size()!=SUBJECT_SIZE)
subject.push_back(temp);
student.name = temp;
it!=subject.end() && fin>>scoreTemp;++it)
student.subjects.push_back(scoreTemp);
}while(fin>>temp);
- CPPStudy_2005_1/STL성적처리_1_class . . . . 5 matches
string name, temp;
int scoreTemp;
while(m_fin>>temp && subject.size()!=SUBJECT_SIZE)
subject.push_back(temp);
student->setName(temp);
it!=subject.end() && m_fin>>scoreTemp;++it)
student->addSubjectScore(scoreTemp);
}while(m_fin>>temp);
- CompleteTreeLabeling/하기웅 . . . . 5 matches
int depth, level, nodeNum, temp, templevel, tempdepth, select, i;
tempdepth=1;
tempdepth++;
- DermubaTriangle/김상섭 . . . . 5 matches
double num1_x, num1_y, num2_x, num2_y, height = sqrt(3)/2, temp;
temp = i;
num1_y = height*(temp-1.0/3.0);
temp = i;
num2_y = height*(temp-1.0/3.0);
- EcologicalBinPacking/강희경 . . . . 5 matches
char temp;
cin.get(temp);
if(temp != '\n')
int *temp = new int;
return temp;
- JavaScript/2011년스터디/CanvasPaint . . . . 5 matches
var temp,i=0,j=0;
function selectColor(temp)
color=temp;
function drawMethod(temp)
drawmethod=temp;
- JollyJumpers/황재선 . . . . 5 matches
* TODO To change the template for this generated file go to
* Window - Preferences - Java - Code Style - Code Templates
int temp = aNum[i];
aNum[j] = temp;
* TODO To change the template for this generated file go to
* Window - Preferences - Java - Code Style - Code Templates
* TODO To change the template for this generated file go to
* Window - Preferences - Java - Code Style - Code Templates
- MFC/Socket . . . . 5 matches
CData temp;
*m_dataSocket >> temp; //클라이언트로부터 메시지를 받았다.
AfxMessageBox(temp.m_strData); //테스트 확인용으로 받은 메시지를 띄워준다.
temp.m_strData = "TEST2";
*m_dataSocket << temp; // 클라이언트에게 메시지를 보낸다.
- Marbles/이동현 . . . . 5 matches
int tempk;
tempk = k-1;
tempk = k;
if((N[i]-n2[i]*tempk)%n1[i] == 0)
r = n2[i]*tempk;
- Monocycle/김상섭 . . . . 5 matches
string temp;
cin >> temp;
if(temp[j] == '.')
if(temp[j] == 'S')
if(temp[j] == 'T')
- OurMajorLangIsCAndCPlusPlus/Function . . . . 5 matches
template<typename T>
template<typename T>
template<class T> void print(T a)
template<> void print<const char *>(const char *a)
template<> void print<int>(int a)
- PascalTriangle . . . . 5 matches
int i, j, temp;
temp = *(*(buffer + row - 1) + col - 1);
return temp;
unsigned long temp=row[current][m-1];
return temp; // 보관해둔 n행 m열의 값을 리턴
- ProgrammingLanguageClass/2006/Report3 . . . . 5 matches
begin real temp; temp := 0;
temp := temp + term;
sum := temp
- SmithNumbers/이도현 . . . . 5 matches
int i, j, temp;
temp = num;
if (temp == 1)
if (temp % i == 0)
temp /= i;
- StringOfCPlusPlus/상협 . . . . 5 matches
char *temp=new char[k+2];
strncpy(temp,st,k+2);
st[i]=temp[k-i-1];
st[k-i-1]=temp[i];
delete [] temp;//이부분에서 고생 했쓰...
- [Lovely]boy^_^/USACO/PrimePalinDromes . . . . 5 matches
int temp;
temp = 9997;
temp = 999997;
temp = 99999997;
i = temp;
- 개인키,공개키/김태훈,황재선 . . . . 5 matches
int temp;
temp = (int) ch;
fout << char(temp+KEY);
array[count] = char(temp+KEY);
int temp;
- 개인키,공개키/임영동,김홍선 . . . . 5 matches
int key=30, count=0, i=0,temp;
int temp = int (arr[i]) + key;
arr[i]=char (temp);
temp = (int (arr[i]) - key +256)%256;
arr[i]=char (temp);
- 금고/김상섭 . . . . 5 matches
unsigned int temp_table[2][501];
int value = temp_table[level%2][time];
temp_table[1%2][i]= i;
temp_table[i%2][i] = height;
temp_table[i%2][time] = height;
- 데블스캠프2006/CPPFileInput . . . . 5 matches
string temp;
while(fin >> temp)
// cout << temp;
num = atof(temp.c_str());
// if(AP==temp)
- 데블스캠프2009/목요일/연습문제/MFC/서민관 . . . . 5 matches
double temp, res, sign;
temp = m_number;
temp = m_number;
m_number = temp + m_number;
m_number = temp - m_number;
- 문자열검색/허아영 . . . . 5 matches
int found = 0; int temp = 0;
word_num = 1; search_str_num = 0; found = 0; temp = 0;
temp = exist_str[word_num];
if(x[temp] == search_str[search_str_num]){
++temp;
- 새싹-날다람쥐 6월 10일 . . . . 5 matches
int temp;
scanf("d의 배열 크기를 입력해주세요.\n%d", temp);
d = (char*)malloc(sizeof(char) * temp);
C에서는 변수 선언을 맨 위에 해야 하므로 int d［temp］와 같은 형태로 선언할 수 없다.(아무데서나 선언을 할 수 있는 C++에서도 이런 형태는 불가능하다.)
free(d); 를 이용해서 지금 실행중인 프로그램에 종속되어있는 sizeof(char) * temp만큼의 메모리를 OS에 다시 반환시킨다.
- 숫자야구/Leonardong . . . . 5 matches
int strike,ball,temp;
cin >> temp;
answer[0]=temp/100;
answer[1]=(temp%100)/10;
answer[2]=temp%10;
- 작은자바이야기 . . . . 5 matches
* strategy 패턴, command 패턴, template method 패턴
* strategy 패턴 - template method 패턴
반면에 template method 패턴은 부모 클래스에서 전체적인 틀을 만들어 두고 행동에 해당하는 메소드를 상속 + 오버라이드 해서 확장한다.
* template method 패턴이 사용됐다. protected로 선언된 service method가 template method에 해당되는데 abstract가 아닌 이유는 기본 구현을 주고 원하는 호출에 대해 오버라이드를 해서 사용하기 위함이다.
- 파일 입출력_1 . . . . 5 matches
string temp;
while(fin >> temp)
// cout << temp;
num = atof(temp.c_str());
// if(AP==temp)
- 피보나치/김영록 . . . . 5 matches
static int a=1,b=1,c=0,round_temp;
round_temp=round;
round_temp--;
if(round_temp !=0)
pi(round_temp);
- 3N+1Problem/황재선 . . . . 4 matches
int temp;
temp = findMaxCycle(interNum, count);
if (maxCycle < temp)
maxCycle = temp;
- 3n 1/이도현 . . . . 4 matches
int temp = 0;
temp = cycle_length(i); // cycle legnth 찾기
if (temp > max_count)
max_count = temp; // 큰 수를 max_count로
- 5인용C++스터디/템플릿 . . . . 4 matches
template<typename T>
template<typename T>
template<typename T>
template<typename T>
- AustralianVoting/곽세환 . . . . 4 matches
char temp[60];
while (cin.getline(temp, 60) && strcmp(temp, ""))
votes[numberOfVoters][0] = atoi(strtok(temp, " "));
- BasicJAVA2005/실습1/송수생 . . . . 4 matches
int[] temp = new int[3];
temp[i]=scannumber.nextInt();
if(arry[i]==temp[i])
if(arry[i]==temp[j])
- BigBang . . . . 4 matches
==== Template ====
* template과 friend
* template와 friend 사이에 여러 매핑이 존재한다. many to many, one to many, many to one, one to one : [http://publib.boulder.ibm.com/infocenter/comphelp/v7v91/index.jsp?topic=%2Fcom.ibm.vacpp7a.doc%2Flanguage%2Fref%2Fclrc16friends_and_templates.htm 참고]
* C, OOP, Template, STL
* Macro Function이 필요한 경우 - inline template function으로 대체 하면 해결
- C++스터디_2005여름/학점계산프로그램/정수민 . . . . 4 matches
double temp=4.5;
if (compare-students[i].average < temp &&
temp=compare-students[i].average;
if (compare-students[i].average == temp) {
- CodeRace/20060105/민경선호재선 . . . . 4 matches
String temp = list.get(i).getName();
for(int j = 0; j < temp.length(); ++j) {
count = count + temp.toCharArray()[j];
System.out.printf("%-15s\t%d\t%d\n", temp, list.get(i).getCount(), count);
- CubicSpline/1002/NaCurves.py . . . . 4 matches
tempY = TriDiagonal.getMatrixX(u, matrixY)
tempY.insert(0, [0.0])
tempY.append([0.0])
return tempY
- ErdosNumbers/차영권 . . . . 4 matches
char temp[MAX_LENGTH], *c;
cin.getline(temp, MAX_LENGTH);
c = temp;
temp[0] = '\0';
- Gof/Command . . . . 4 matches
undo 할 필요가 없고, 인자를 요구하지 않는 단순한 명령어에 대해서 우리는 command의 receiver를 parameterize하기 위해 class template를 사용할 수 있다. 우리는 그러한 명령들을 위해 template subclass인 SimpleCommand를 정의할 것이다. SimpleCommand는 Receiver type에 의해 parameterize 되고
template <class Receiver>
template <class Receiver>
- HASH구하기/강희경,김홍선 . . . . 4 matches
int temp=0;
temp = temp + int (arr[i]);
return temp;
- HASH구하기/오후근,조재화 . . . . 4 matches
char temp;
temp = fin.get();
if(temp == -1) //파일끝일경우
arr[i][j]=temp;
- HowManyFibs?/문보창 . . . . 4 matches
char temp[105];
cin >> temp;
len = strlen(temp);
digit[i] = temp[len-i-1] - 48;
- HowManyFibs?/하기웅 . . . . 4 matches
BigInteger temp;
temp = temp + (*(number++)-48)*decimalNum.Power(charLen-i-1);
return temp;
- HowManyZerosAndDigits/문보창 . . . . 4 matches
double temp;
double backTemp;
backTemp = 1;
temp = backTemp * i;
temp = int(temp/B);
backTemp = int(i);
- JavaStudy2004/클래스 . . . . 4 matches
public HelloWorld(String temp)
sentence = temp;
public void setSentence(String temp)
sentence = temp;
- KnightTour/재니 . . . . 4 matches
int tempHorizontal[] = {2, 1, -1, -2, -2, -1, 1, 2};
int tempVertical[] = {-1, -2, -2, -1, 1, 2, 2, 1};
m_Horizontal[row] = tempHorizontal[row];
m_Vertical[row] = tempVertical[row];
- Map연습문제/노수민 . . . . 4 matches
char ch,temp;
temp=ch;
temp = (i*)[temp];
- Map연습문제/임민수 . . . . 4 matches
char temp = input[i];
temp = (*j)[temp];
cout << temp;
- Marbles/조현태 . . . . 4 matches
int temp=answer_2*y_2*(-1)+breeds;
if (0!=temp%x_2 && temp/x_2>=0)
return temp/x_2;
- MatrixAndQuaternionsFaq . . . . 4 matches
MATRIX3 mtemp;
m4_submat( ma, mtemp, i, j );
mr[i+j*4] = ( m3_det( mtemp ) * sign ) / mdet;
susceptible to "Gimbal lock" where attempts to rotate an
- MicrosoftFoundationClasses . . . . 4 matches
=== Document Template ===
도큐먼트 템플릿 객체는 단순히 document 만을 관리하는 것이 아니다. 그들 각각과 관계되어 있는 윈도우와 뷰들도 함께 관리한다. 프로그램에서 각기 다른 종류의 도큐먼트에 대해서 하나씩의 document template이 존재한다. 만약 동일한 형태의 document가 2개이상 존재한다면 그것들을 관리하는데에는 하나의 document template만 있으면 된다.
하나의 document와 frame window는 한개의 document template에 의해서 생성되며 view는 frame window객체가 생성되면서 자동으로 생성되게 된다.
{{{~cpp DocumentTemplateClass : CSingleDocTemplate, CMultiDocTemplate}}}
* {{{~cpp WinMain() 에서 InitInstance() 수행, document template, main frame window, document, view 를 생성한다.}}}
- MineSweeper/문보창 . . . . 4 matches
char temp;
cin >> temp;
if (temp == '*')
else if (temp == '.')
- MoniWikiPo . . . . 4 matches
msgid " or alternativly, use one of these templates:\n"
msgid "To create your own templates, add a page with a 'Template' suffix.\n"
msgstr "탬플리트를 만드시려면 Template라고 이름이 끝나는 페이지를 만드세요.\n"
msgid "Use one of the following templates as an initial release :\n"
msgid "To create your own templates, add a page with a 'Template' suffix."
msgstr "탬플리트를 만드시려면 Template라고 이름이 끝나는 페이지를 만드세요."
- PowerOfCryptography/문보창 . . . . 4 matches
double temp = 0;
temp *= 10;
temp += (p[i] - '0');
lnP += log10(double(temp) / pow(10, i-1));
- PrimaryArithmetic/문보창 . . . . 4 matches
int i, j, temp, count, carry, sumCarry;
temp = num1[i] + num2[i] + carry;
if (temp > 9)
carry = temp / 10;
- Random Walk2/곽세환 . . . . 4 matches
char temp;
while ((temp = fin.get()) && temp != '\n') //방향있는 한 줄 입력받음
dir_arr[dirsu++] = temp;
- RandomWalk2/Insu . . . . 4 matches
Roach* temp;
temp = new Roach(currow, curcol, course);
temp = new SuperRoach(currow, curcol, course);
roaches[roachcount] = temp;
- ReverseAndAdd/허아영 . . . . 4 matches
unsigned int *temp = new unsigned int [length];
temp[i] = num[length-i-1];
reverseNum += temp[i] * pow(10, length-i-1); // 모아서 더하기
// delete[] temp;
- Robbery/조현태 . . . . 4 matches
POINT tempPoint = nowPoint;
nowPoint = tempPoint;
nowPoint = tempPoint;
nowPoint = tempPoint;
- StacksOfFlapjacks/문보창 . . . . 4 matches
int temp;
SWAP(s[i], s[size-i], temp);
int min, temp;
SWAP(s[i], s[min], temp);
- StacksOfFlapjacks/조현태 . . . . 4 matches
char temp[SIZE_BUFFER];
strcpy(temp,cakes_size);
cakes_size[j-maximum+i]=temp[j];
cakes_size[i-j]=temp[j];
- SuperMarket/세연/재동 . . . . 4 matches
int tempMoney;
cin >> tempMoney;
if(tempMoney > 0)
_money += tempMoney;
- ThePriestMathematician/김상섭 . . . . 4 matches
unsigned min, temp;
temp = 2*hanoi[k] +pow(2,i-k) -1;
if(temp <= min)
min = temp;
- VendingMachine/세연/재동 . . . . 4 matches
int tempInsertMoney = 0;
cin >> tempInsertMoney;
if(isMoney(tempInsertMoney))
_money += tempInsertMoney;
- VisualBasicClass/2006/Exam1 . . . . 4 matches
Dim temp As String
temp = ""
temp = ( ③ ) <- 2점
Picture1.Print temp
- c++스터디_2005여름/실습코드 . . . . 4 matches
str_temp[str_len-i-1] = ch[i];
while(str_temp[i] > 0)
cout<<str_temp[i];
char str_temp[50];
- django . . . . 4 matches
* html 이 있는 template 에 많은 것을 바라지 말자. 가능하면 view에서 데이터를 거의다 처리해서 template에 넘기는것이 좋다. template에서 받아온 데어터로 리스트와 맵 변수의 첨자(subscriber)로 사용하려고 했는데 안된다. 이러한 경우에는 view에서 데이터를 아예 가공해서 넘기는 것이 좋다.
* [http://www2.jeffcroft.com/2006/feb/25/django-templates-the-power-of-inheritance/] : Template HTML 파일 사용법
* [http://www.b-list.org/weblog/2006/06/13/how-django-processes-request] : Template 에서의 변수 참조에 대한 설명. 필수!!, 리스트나, 맵, 함수등에 접근하는 방법
- 김희성/MTFREADER . . . . 4 matches
unsigned __int64 point,i,j,k,temp;
__int64 offset=0,temp;
temp=offset; //*오프셋값은 이전 값들과 합계로 계산됨.
offset+=temp;
- 미로찾기/영동 . . . . 4 matches
Element temp=pop(&top, stack);
y=temp.y;
x=temp.x;
dir=temp.dir;
- 벡터/김홍선,노수민 . . . . 4 matches
student temp;
fin >> temp.name >> temp.score;
vec.push_back(temp);
- 비밀키/김홍선 . . . . 4 matches
int temp = int (arr[i]) + key;
arr[i]=char (temp);
int temp = int (arr[i]) - key;
arr[i]=char (temp);
- 새싹교실/2011/씨언어발전/2회차 . . . . 4 matches
int temp;
temp=a;
b=temp;
printf("%d %d %d",a,b,temp);
- 새싹교실/2012/개차반 . . . . 4 matches
int temp1 ;
temp1 = num & 1 ;
if (temp1 == 1) {
else if (temp1 == 0) {
- 숫자를한글로바꾸기/정수민 . . . . 4 matches
temp_big_ja_ri
temp_big_ja_ri = (ja_ris_soo-1)/4;
printf("%s ",big_ja_ri[temp_big_ja_ri]);
temp_big_ja_ri--;
- 숫자를한글로바꾸기/조현태 . . . . 4 matches
char temp;
while (print_number.get_out(&temp))
if (temp!=0)
cout << NUMBER_TO_HAN[temp] << NUMBER_TO_JARI [jari];
- 잔디밭/권순의 . . . . 4 matches
int temp = 0;
temp = lawn[i][j] + lawn[i][j + 1] + lawn[i][j + 2] +
if(temp > greatestNum)
greatestNum = temp;
- 진법바꾸기/문보창 . . . . 4 matches
int temp = num;
parse_num[length++] = temp % base;
temp /= base;
}while (temp != 0);
- 피보나치/조현태 . . . . 4 matches
unsigned int temp=sub_answer;
prv_answer=temp+sub_answer;
temp=sub_answer
prv_answer=sub_answer+temp
- 2002년도ACM문제샘플풀이/문제A . . . . 3 matches
int temp;
temp = a[i];
a[i+1] = temp;
- 8queen/곽세환 . . . . 3 matches
int temp[Max][Max];
temp[j][k] = ar[j][k];
ar[j][k] = temp[j][k];
- AnEasyProblem/강소현 . . . . 3 matches
int [] temp = new int [21];
temp[num++] = i%2;
return temp;
- C 스터디_2005여름/학점계산프로그램/김태훈김상섭 . . . . 3 matches
Score temp;
temp = Score(name,scoretmp);
ban.push_back(temp);
- C++스터디_2005여름/학점계산프로그램/문보창 . . . . 3 matches
Student temp;
temp = student[i];
student[p] = temp;
- ChocolateChipCookies/조현태 . . . . 3 matches
vector<SMyPoint> temp;
temp.push_back(g_points[i]);
g_hitPoints.push_back(temp);
- CivaProject . . . . 3 matches
template<typename ElementType> class Array;
//template<typename ElementType> typedef shared_ptr< Array<ElementType> > Array_Handle;
template<typename ElementType>
- ClassifyByAnagram/재동 . . . . 3 matches
tempString = ''
tempString += self.wordList[i]
return tempString
- ContestScoreBoard/문보창 . . . . 3 matches
int temp;
SWAP(rankTeam[top], rankTeam[j], temp);
SWAP(rankTeam[top], rankTeam[j], temp);
- Counting/김상섭 . . . . 3 matches
int temp = num;
if(temp%10 == 4)
temp /= 10;
- CppStudy_2002_1/과제1/CherryBoy . . . . 3 matches
char* temp=new char[strlen(string)];
temp=string;
beany.str=temp;
- FortuneCookies . . . . 3 matches
* You attempt things that you do not even plan because of your extreme stupidity.
* You plan things that you do not even attempt because of your extreme caution.
* Your temporary financial embarassment will be relieved in a surprising manner.
- Gnutella-MoreFree . . . . 3 matches
POSITION pos = m_lstResults.GetFirstSelectedItemPosition();
memcpy(&TempX, &Packet[NextPos], 4);
Item.FileIndex = makeD( flipX(TempX));
memcpy(&TempX, &Packet[NextPos + 4], 4);
Item.Size = makeD( flipX(TempX));
UINT AttemptPort = pPrefs->m_ForcedPort ? pPrefs->m_ForcedPort : pPrefs->m_LocalPort;
AttemptPort += rand() % 99 + 0;
Firewall에 있을 경우 이런 방법으로 포트를 열지 못하면 랜덤한 포트를 부여 ForcedPort로 접속 Attempts < 3 만큼 시도를 한다.
- JollyJumpers/강희경 . . . . 3 matches
char temp;
cin.get(temp);
if(temp != '\n')
- JollyJumpers/김태진 . . . . 3 matches
int i,j,temp;
temp=C[j];
C[j+1]=temp;
- JollyJumpers/허아영 . . . . 3 matches
int num, i, j, value, temp;//, maxNum;
temp = compare[j];
compare[i] = temp;
- LoadBalancingProblem/임인택 . . . . 3 matches
* To change this generated comment edit the template variable "typecomment":
* Window>Preferences>Java>Templates.
* To change this generated comment edit the template variable "typecomment":
* Window>Preferences>Java>Templates.
* To change this generated comment edit the template variable "typecomment":
* Window>Preferences>Java>Templates.
- Lotto/강소현 . . . . 3 matches
int [] temp = new int[13];
temp[num++] = i%2;
return temp;
- Map연습문제/조재화 . . . . 3 matches
string temp = "wjgydlrtyffworxjbdzyrsybfwlrobffylryjbkyjrtbdcyyrvmbjlsrkugjglrmdcgdarjbjyftr" ;
for(int i=0; i<temp.size(); i++)
cout<<rule3[rule2[rule1[temp[i]]]];
- MineSweeper/김회영 . . . . 3 matches
char* temp=new char[width];
cin>>temp;
if(temp[j]=='*')
- MineSweeper/이승한 . . . . 3 matches
temp = new Array();
temp = map[i];
showMap=temp.join(" ");
- MoreEffectiveC++/Exception . . . . 3 matches
여기에서 재미있는 기법을 이야기 해본다. 차차 소개될 smart pointer와 더불어 Standard C++ 라이브러리에 포함되어 있는 auto_ptr template 클래스를 이용한 해결책인데 auto_prt은 이렇게 생겼다.
template<class T>
template<class T>
- MoreEffectiveC++/Operator . . . . 3 matches
template<class T>
template<class T>
template<class T>
- NumberBaseballGame/jeppy . . . . 3 matches
int i, temp_i, num, j;
temp_i=i;
for (j=0; j<temp_i; j++)
- OptimizeCompile . . . . 3 matches
temp = x + y;
a = temp;
b = temp;
- OurMajorLangIsCAndCPlusPlus/print/조현태 . . . . 3 matches
for (int tempNumber = number; tempNumber > 0; ++numberSize)
tempNumber /= 10;
- PPProject/20041001FM . . . . 3 matches
char temp;
temp = str[tag];
str[i-1] = temp;
- ProjectEazy/Source . . . . 3 matches
temp = aSentence.split(' ')
temp.remove(NP)
return string.join( temp, ' ')
- R'sSource . . . . 3 matches
f = open('temp.html', 'w')
for temp in lines:
f.write(temp)
- RandomWalk/임민수 . . . . 3 matches
int num,x,y,cnt=0,total=0,end=1,temp;
temp = rand()%8;
switch (temp)
- Scheduled Walk/소영&재화 . . . . 3 matches
string temp = "2222244451";
for (int k=0;k<temp.size();k++)
switch(temp[k])
- SummationOfFourPrimes/김회영 . . . . 3 matches
int temp=0;
temp++;
if(temp==0)
- SuperMarket/세연 . . . . 3 matches
int temp;
cin >> temp;
money = money + temp;
- ThePriestMathematician/문보창 . . . . 3 matches
int k, temp;
temp = n - 0.5 * k * (k + 1);
result = kpow2 * (k - 1) + 1 + temp * kpow2;
- TugOfWar/김회영 . . . . 3 matches
int nTempGap;
nTempGap= right[i] - left[j] ;
if(nTempGap*2 <= gap && nTempGap>= 0 && nTempGap>nMaxGap)
nMaxGap=nTempGap;
int temp;
temp=rightPart[i];
leftPart[j]=temp;
- WikiSlide . . . . 3 matches
* click on one of the listed templates to base your page on the content of the selected template.
Below the list of templates you will also find a list of existing pages with a similar name. You should always check this list because someone else might have already started a page about the same subject but named it slightly differently.
* Templates
- Yggdrasil/020515세미나 . . . . 3 matches
int temp;
temp=array[i];
array[i+1]=temp;}
- Yggdrasil/020523세미나 . . . . 3 matches
int temp;
temp=sum[0];
sum[1]=sum[1]+temp;
- Zeropage/Staff/회의_2006_03_04 . . . . 3 matches
http://zerowiki.dnip.net/~namsangboy/temp/dx_map_tool.avi
http://zerowiki.dnip.net/~namsangboy/temp/MemeHarvesterDemo.avi
http://zerowiki.dnip.net/~namsangboy/temp/AIOmok.avi
- [Lovely]boy^_^/3DLibrary . . . . 3 matches
float temp = 0;
temp += _mat[i][j] * v.GetMem()[j];
ret.SetMem(i, temp);
- whiteblue/MyTermProject . . . . 3 matches
student temp, copy_data[20];
temp = copy_data[j];
copy_data[j-1] = temp;
- 고한종/swap() . . . . 3 matches
int temp;
temp = *a;
*b = temp;
- 김동준/Project/Data_Structure_Overview/Chapter1 . . . . 3 matches
float tempsum = 0;
for(i = 0; i < n; i++) { tempsum += list[i]; }
return tempsum;
- 단어순서/방선희 . . . . 3 matches
int temp;
temp = input[i] - 'a';
content += temp * pow(strlen(input), strlen(input)-1-i);
- 데블스캠프2006/화요일/pointer/문제1/김준석 . . . . 3 matches
int temp;
temp = *a;
*b = temp;
- 데블스캠프2009/목요일/연습문제/다빈치코드/서민관 . . . . 3 matches
block temp;
temp = hand[j+1];
hand[j] = temp;
- 데블스캠프2012/다섯째날/C로배우는C++원리 . . . . 3 matches
Student *temp = (Student*)malloc(sizeof(Student));
createStudent(temp, "ChungAng", 100,"20121111");
p=(Person*)temp;
- 몸짱프로젝트/BinarySearchTree . . . . 3 matches
Node * temp = ptr;
temp->key = ptr->key;
temp->right = NULL;
- 문자반대출력/최경현 . . . . 3 matches
char temp;
temp = *p;
*q = temp;
- 삼총사CppStudy/20030806 . . . . 3 matches
CVector temp;
temp.SetValue(x + a.GetX(), y + a.GetY());
return temp;
- 새싹교실/2011/Noname . . . . 3 matches
int hanoi(int n,char from,char to, char temp)
hanoi(n-1,from,temp,to);
hanoi(n-1,temp,to,from);
- 새싹교실/2011/무전취식/레벨9 . . . . 3 matches
int i,j,temp;
temp=A[i];
A[j]=temp;
- 새싹교실/2012/AClass . . . . 3 matches
int temp;
temp=*a;
*b=temp;
- 새싹교실/2012/아우토반/앞반/5.10 . . . . 3 matches
int temp;
temp=*a;
*b=temp;
- 새싹교실/2012/열반/120521 . . . . 3 matches
int temp;
temp=*a;
*b=temp;
- 수학의정석/행렬/조현태 . . . . 3 matches
int temp=0;
temp+=(*(baeyol[0]+i*size_x[0]+k))*(*(baeyol[1]+k*size_x[1]+j));
printf("%d ",temp);
- 알고리즘8주숙제/test . . . . 3 matches
int alph, priority, temp;
temp = alph % 26;
c = 'a' + temp;
- 압축알고리즘/슬이,진영 . . . . 3 matches
int temp =0;
temp = (int)firch + x;
cout << (char)temp;
- 이차함수그리기/조현태 . . . . 3 matches
float temp_sosu=number-(int)number;
if (temp_sosu<=-0.5 || temp_sosu>=0.5)
- 정렬/Leonardong . . . . 3 matches
int temp;
temp = sorted[k];
sorted[j] = temp;
- 정렬/aekae . . . . 3 matches
int i,j,k,temp;
temp = number[j];
number[k] = temp;
- 정렬/강희경 . . . . 3 matches
int temp;
temp = array[j];
array[k] = temp;
- 정렬/곽세환 . . . . 3 matches
int i, j, temp;
temp = data[i];
data[j] = temp;
- 정렬/문원명 . . . . 3 matches
int temp;
temp=arr[m];
arr[n]=temp;
- 정렬/방선희 . . . . 3 matches
int temp;
temp = arr[j];
arr[k] = temp;
- 정렬/장창재 . . . . 3 matches
int temp;
temp = array[j];
array[k] = temp;
- 정렬/조재화 . . . . 3 matches
int temp;
temp=sort[k];
sort[j]=temp;
- 조영준/다대다채팅 . . . . 3 matches
ChatClient tempClient = new ChatClient(serverSocket.AcceptTcpClient());
ClientList.Add(tempClient);
tempClient.start();
- 중위수구하기/허아영 . . . . 3 matches
int temp;
temp = *x;
*y = temp;
- 창섭/배치파일 . . . . 3 matches
if exist d:\work\temp.$$$ del d:\work\temp.$$$
경로 D:\Work 에 temp.$$$ 라는 파일이 존재하면 그 파일을 삭제합니다.
- 파일 입출력 . . . . 3 matches
string temp;
while(fin >> temp)
cout << temp;
- 포인터 swap . . . . 3 matches
int temp;
temp = *a;
*b = temp;
- 피보나치/SSS . . . . 3 matches
int num_temp=0;
num_temp =num_prev + num_next;
num_next = num_temp;
- 피보나치/김민경 . . . . 3 matches
void process(int check1, int check2, int temp)
if (temp==n) printf ("%d\n",check1);
process(check2,check1+check2,temp+1);
- 피보나치/김진목 . . . . 3 matches
int pres=1, prev=0, temp, i, n ;
temp=pres;
prev=temp;
- 하노이탑/한유선김민경 . . . . 3 matches
void movehanoi(char from, char temp, char to, int n)
movehanoi(from, to, temp, n-1);
movehanoi(temp, from, to, n-1);
- AirSpeedTemplateLibrary . . . . 2 matches
특별한 녀석은 아니나, 다음의 용도를 위해 만들어진 TemplateLibrary
'''Why another templating engine?'''
A number of excellent templating mechanisms already exist for Python, including Cheetah, which has a syntax similar to Airspeed.
- C++/SmartPointer . . . . 2 matches
template<class _Ty>
template<class _OTy>
- ClassifyByAnagram/김재우 . . . . 2 matches
* To change template for new class use
* Code Style | Class Templates options (Tools | IDE Options).
* To change template for new class use
* Code Style | Class Templates options (Tools | IDE Options).
e.printStackTrace(); //To change body of catch statement use Options | File Templates.
- CodeRace/20060105/도현승한 . . . . 2 matches
string temp;
return temp;
- DebuggingSeminar_2005/AutoExp.dat . . . . 2 matches
; AutoExp.Dat - templates for automaticially expanding data
; type Name of the type (may be followed by <*> for template
;ANSI C++ Standard Template library
- EightQueenProblem/용쟁호투 . . . . 2 matches
String ls_temp[8]
is_solution = ls_temp
- HanoiProblem/영동 . . . . 2 matches
mov ax, by ;by와 to의 위치를 바꿔줌.(ax를 temp로 사용)
mov ax, from ;from과 by를 바꿈(ax를 temp로 하여)
- HelloWorld . . . . 2 matches
=== PHP Web - Template version ===
include_once "class.CHTemplate.inc";
$tpl = CHTemplate();
$tpl->load_file("template_hello.tpl");
template_hello.tpl
- HelpOnXmlPages . . . . 2 matches
<xsl:template match="/">
</xsl:template>
- JavaStudy2004/클래스상속 . . . . 2 matches
public void Say(int temp) {
String str = Integer.toString(temp);
- JollyJumpers/Celfin . . . . 2 matches
char temp[50000];
cin.getline(temp, 50000);
- Kongulo . . . . 2 matches
temp = last_ua
if last_ua == temp:
- Linux/필수명령어/용법 . . . . 2 matches
- $ cp -i blade.Z temp.Z
- $ rm report.txt tempfile object.mainroutine hello.java
- LinuxProgramming/SignalHandling . . . . 2 matches
SIGTTIN - background process attempting to read ("in")
SIGTTOU - background process attempting to write ("out")
- MFC/MessageMap . . . . 2 matches
* document template object
* document template object (linked with document activated)
- MineSweeper/김민경 . . . . 2 matches
temp=raw_input()
data.append(temp)
- MineSweeper/황재선 . . . . 2 matches
* TODO To change the template for this generated file go to
* Window - Preferences - Java - Code Style - Code Templates
* TODO To change the template for this generated file go to
* Window - Preferences - Java - Code Style - Code Templates
- OurMajorLangIsCAndCPlusPlus/2006.2.06/허준수 . . . . 2 matches
int temp = strlen(ch);
return temp;
- Slurpys/이상규 . . . . 2 matches
int end, temp;
if(checkSlump(str, end, &temp))
- Spring/탐험스터디/2011 . . . . 2 matches
* 과제: SpringSource Tool Suite에서 Spring MVC Template 프로젝트 생성
1.3 Resttemplate : spring에서 RESTful에 접근하기 위한 template. spring에서 데이터를 받아오는 방법.
1. Spring MVC Template Project 생성하여 실행해보려다 실패.
- Star/조현태 . . . . 2 matches
SavePoint temp = one;
another = temp;
- TemplateLibrary . . . . 2 matches
* template - 말 그대로, 틀이 되는 text 코드.
* template 에 모델을 연결해주는 코드
- TheKnightsOfTheRoundTable/김상섭 . . . . 2 matches
double temp = 2.0*sqrt(s*(s-a)*(s-b)*(s-c))/(a+b+c);
cout << "The radius of the round table is: " << temp << endl;
- UML/CaseTool . . . . 2 matches
''[[Code generation]]'' in this context means, that the user creates UML diagrams, which have some connoted model data, from which the UML tool derives (through a conversion process) parts or all of the [[source code]] for the software system that is to be developed. Often, the user can provide some skeleton of the program source code, in the form of a source code [[template]] where predefined tokens are then replaced with program source code parts, emitted by the UML tool during the code generation process.
Reverse engineering encloses the problematic, that diagram data is normally not contained with the program source, such that the UML tool, at least in the initial step, has to create some ''random layout'' of the graphical symbols of the UML notation or use some automatic ''layout algorithm'' to place the symbols in a way that the user can understand the diagram. For example, the symbols should be placed at such locations on the drawing pane that they don't overlap. Usually, the user of such a functionality of an UML tool has to manually edit those automatically generated diagrams to attain some meaningfulness. It also often doesn't make sense to draw diagrams of the whole program source, as that represents just too much detail to be of interest at the level of the UML diagrams. There are also language features of some [[programming language]]s, like ''class-'' or ''function templates'' of the programming language [[C plus plus|C++]], which are notoriously hard to convert automatically to UML diagrams in their full complexity.
- UpgradeC++/과제2 . . . . 2 matches
int temp = array[i];
array[j] = temp;
- WOWAddOn/2011년프로젝트/초성퀴즈 . . . . 2 matches
String temp = "바";
char a = temp.charAt(0);
- XMLStudy_2002/XSL . . . . 2 matches
<xsl:template match="/">
</xsl:template>
- XsltVersion . . . . 2 matches
<xsl:template match="/">
</xsl:template>
- [Lovely]boy^_^/EnglishGrammer/PresentAndPast . . . . 2 matches
The action is not finished. sometimes, Use the Present continuous for temporary situations.
ex) When temporary situations : I'm living with some friends until I find an apartment.
- 데블스캠프2005/java . . . . 2 matches
According to the available accounts, Bill Joy had ideas of a new language combining the best of Mesa and C. He proposed, in a paper called Further, to Sun that its engineers should produce an object-oriented environment based on C++. James Gosling's frustrations with C++ began while working on Imagination, an SGML editor. Initially, James attempted to modify and extend C++, which he referred to as C++ ++ -- (which is a play on the name of C++ meaning 'C++ plus some good things, and minus some bad things'), but soon abandoned that in favor of creating an entirely new language, called Oak named after the oak tree that stood just outside his office.
Like many stealth projects working on new technology, the team worked long hours and by the summer of 1992, they were able to demo portions of the new platform including the Green OS, Oak the language, the libraries, and the hardware. Their first attempt focused on building a PDA-like device having a highly graphical interface and a smart agent called Duke to assist the user.
- 데블스캠프2009/월요일/연습문제/HTML-CSS/강성현 . . . . 2 matches
<img src="http://tunakheh.compuz.com/zboard/data/temp/aa.png" width="600" height="400" onclick="window.open('http://tunakheh.compuz.com/zboard/data/temp/aa.png','photo_popup','width=600,height=400,scrollbars=yes,resizable=yes');">
- 데블스캠프2011/다섯째날/HowToWriteCodeWell/김준석,서영주 . . . . 2 matches
int temp = el.getFloor();
assertEquals(temp, el.getFloor());
- 레밍즈프로젝트/박진하 . . . . 2 matches
{{{template'<'class TYPE, class ARG_TYPE'>'
{{{template'<'class TYPE, class ARG_TYPE'>'
- 몸짱프로젝트/BinarySearch . . . . 2 matches
int temp = aVal1;
aVal2 = temp;
- 몸짱프로젝트/BubbleSort . . . . 2 matches
int temp = aVal1;
aVal2 = temp;
- 몸짱프로젝트/DisplayPumutation . . . . 2 matches
char temp = aVal1;
aVal2 = temp;
- 영호의바이러스공부페이지 . . . . 2 matches
the virus will attempt to infect the first .COM file in the
an infected program is executed another .COM file will attempt to
- 영호의해킹공부페이지 . . . . 2 matches
This article is an attempt to quickly and simply explain everyone's favourite
TMSI (temporary Mobile Subscriber Identity)
- 장용운/템플릿 . . . . 2 matches
template <typename T>
template <typename U>
- 중위수구하기/조현태 . . . . 2 matches
int temp=*number1;
*number2=temp;
- 토이/숫자뒤집기/김정현 . . . . 2 matches
char temp= numChars[i];
numChars[range-i-1]= temp;
- 0PlayerProject . . . . 1 match
[http://psyche.cau.ac.kr/temp/junjihyun(xvid).avi] (size : 320 x 240, 용량 : 15.7M)
- 3DGraphicsFoundation/INSU/SolarSystem . . . . 1 match
//상민이형 temp 페이지에 써있던걸--; format python도 된다. 자바는 안되더라
- 3D프로그래밍시작하기 . . . . 1 match
* STL 은 standard template library 입니다.
- 5인용C++스터디/템플릿스택 . . . . 1 match
|| 조재화 || Upload:Mr.CHO_StackByTemplat.cpp || 오버플로우 및 언더플로우 처리가 있으면 좋겠음. ||
|| 조재화(동적할당으로) || Upload:Mr.CHO_StackByTemplat2.cpp || 동적 할당으로 처리한 것은 잘 했고.. 언더플로우 처리가 있으면 더 좋겠음. ||
|| 문원명 || Upload:StackTemplateMwm.cpp || 잘 했으나.. pop 함수에서 꺼낸 값을 리턴시도록 만들라고 한것 같은데... ||
|| 나휘동(사용자가 배열 크기 정하게 하다 다 못함.) || Upload:stack_templete_Leonardong.cpp || 원하는 결과는 아니었지만.. 그런대로 잘 했음. ||
|| 황재선 || Upload:TemplateStack_JS.cpp || exit 함수로 종료한것만 빼고는 잘했음..ㅋㅋ ||
- AVG-GCC . . . . 1 match
-save-temps Do not delete intermediate files[[BR]]
- AcceleratedC++/Chapter10 . . . . 1 match
template<class In, class Pred>
- AcceleratedC++/Chapter13 . . . . 1 match
Core* record; // temporary must be a pointer as well
- ActiveTemplateLibrary . . . . 1 match
{{|The Active Template Library (ATL) is a set of template-based C++ classes that simplify the programming of Component Object Model (COM) objects. The COM support in Visual C++ allows developers to easily create a variety of COM objects, Automation servers, and ActiveX controls.
- Applet포함HTML/진영 . . . . 1 match
http://nihs.com.ne.kr/temp/NotHelloWorldApplet.html
- Bioinformatics . . . . 1 match
왓슨과 크릭은 DNA의 구조, 특히 쌍을 이룬 nucleotide의 상보성이 유전물질의 정확한 복제기작의 핵심임을 알았다. 그들은 "우리가 가정한 염기쌍 형성원리가 유전 물질의 복기작을 제시하고 있음을 느낄 수 이었다."라고 말하였다. 그들은 이중 나선의 두 가닥이 분리되고 그 각각의 가닥을 주형 (template)으로 하여 새로운 상보적 사슬이 형성된다는 단순한 복제모델을 만들었다.
- Boost/SmartPointer . . . . 1 match
// Ray Gallimore pointed out that foo_set was missing a Compare template
- BoostLibrary/SmartPointer . . . . 1 match
// Ray Gallimore pointed out that foo_set was missing a Compare template
- C++ . . . . 1 match
Bell Labs' Bjarne Stroustrup developed C++ (originally named "C with Classes") during the 1980s as an enhancement to the C programming language. Enhancements started with the addition of classes, followed by, among many features, virtual functions, operator overloading, multiple inheritance, templates, and exception handling. The C++ programming language standard was ratified in 1998 as ISO/IEC 14882:1998, the current version of which is the 2003 version, ISO/IEC 14882:2003. New version of the standard (known informally as C++0x) is being developed.
- Code/RPGMaker . . . . 1 match
# use temporary namespace(module) to solve ambiguous class name
- ConvertAppIntoApplet/진영 . . . . 1 match
http://nihs.com.ne.kr/temp/NotHelloWorldApplet.html
- D3D . . . . 1 match
template <class type>
- DPSCChapter1 . . . . 1 match
A '''design pattern''' is a reusable implementation model or architecture that can be applied to solve a particular recurring class of problem. The pattern sometimes describes how methods in a single class or subhierarchy of classes work together; more often, it shows how multiple classes and their instances collaborate. It turns out that particular architectures reappear in different applications and systems to the extent that a generic pattern template emerges, one that experts reapply and customize to new application - and domain-specific problems. Hence, experts know how to apply design patterns to new problems to implement elegant and extensible solutions.
- DPSCChapter2 . . . . 1 match
3. Provider/Plan Match. An automated process attempts to mach the plan (the contract unser which the claim is being paid) and the health care provider (e.g., the doctor) identified on the claim with the providers with which the overall claim processing organization has a contract. If there is no exact match, the program identifies the most likely matches based on soundex technology (an algorithm for finding similar-sounding words). The system displays prospective matches to knowledge workers in order of the likeinhood of the match, who then identify the correct provider.
- EffectiveSTL/Container . . . . 1 match
template<typename T>
- EnglishSpeaking/TheSimpsons/S01E02 . . . . 1 match
Marge : And a short temper.
- Garbage collector for C and C++ . . . . 1 match
# -DHANDLE_FORK attempts to make GC_malloc() work in a child process fork()ed
- Gof/Singleton . . . . 1 match
#include <afxtempl.h>
- Gof/Strategy . . . . 1 match
* The Booch components - template arguments. - memory allocation strategies.
- Gof/Visitor . . . . 1 match
template <class Item>
- IntelliJ . . . . 1 match
|| ctrl + J || live template ||
- JCreator . . . . 1 match
* Ctrl + N - Code template.
- JTDStudy/첫번째과제/원희 . . . . 1 match
//String temp = JOptionPane.showInputDialog(null,"숫자를 입력하시오 (한칸씩 띄어서)");
- JavaScript/2011년스터디/김수경 . . . . 1 match
// The method only need to be bound temporarily, so we
- JavaStudy2003/네번째수업 . . . . 1 match
|| [http://165.194.17.15/pub/upload/tempDrawEditor.zip]||
- LUA_6 . . . . 1 match
stdin:1: attempt to index local 'self' (a number value)
- MemeHarvester . . . . 1 match
[검색에이전시_temp]
- MoinMoinBugs . . . . 1 match
A temporary, pop-up window created by the application, where the user can
- MoinMoinFaq . . . . 1 match
convention that will help with consistency is the use of "Template"
The wiki has a feature called "Templates" which show up when you
homepage, you should use the HomepageTemplate page, which is available when
=== How do I create a new Template page? ===
Templates are pages that show up automatically as options when you
create a blank page. Any page that ends in the word Template will
etc.), you just define a page that ends in Template, and when creating
pages of this type, select that template and edit it. The wiki
fills in the starting content for you. Templates are editable wiki
To create a Template page, just create a new page called <something>Template
- MoinMoinNotBugs . . . . 1 match
A temporary, pop-up window created by the application, where the user can
- MoreEffectiveC++ . . . . 1 match
* Item 19: Understand the orgin of temporary objects.- 임시 객체들의 기본을 이해하자.
- NSIS . . . . 1 match
* http://www.nullsoft.com/free/nsis/makensitemplate.phtml - .nsi code generator
- NSIS/Reference . . . . 1 match
|| GetTempFileName || . || . ||
* $TEMP - 시스템 임시 디렉토리 (보통 C:\windows\temp) 실행시 탐색됨.
- NamedPipe . . . . 1 match
NULL); // no template file
- NeoCoin/Server . . . . 1 match
text/html; w3m -dump %s; nametemplate=%s.html; copiousoutput
- OurMajorLangIsCAndCPlusPlus/2006.1.12 . . . . 1 match
유사한것, 속도 향상 template - 조현태
- OurMajorLangIsCAndCPlusPlus/2006.1.5 . . . . 1 match
조현태 - 유사한것, 속도 향상 template
- OurMajorLangIsCAndCPlusPlus/stdio.h . . . . 1 match
|| char * tempnam(const char *, const char *) || 주어진 두번째의 인자를 바탕으로 임시로 사용할 파일의 경로를 리턴한다. ||
- RandomWalk2/Vector로2차원동적배열만들기 . . . . 1 match
* [http://www.parashift.com/c++-faq-lite/containers-and-templates.html#faq-33.1 Why Arrays are Evil]
* [http://www.cuj.com/articles/2000/0012/0012c/0012c.htm?topic=articles A Class Template for N-Dimensional Generic Resizable Arrays]
- ReleasePlanning . . . . 1 match
When the final release plan is created and is displeasing to management it is tempting to just change the estimates for the user stories. You must not do this. The estimates are valid and will be required as-is during the iteration planning meetings. Underestimating now will cause problems later. Instead negotiate an acceptable release plan. Negotiate until the developers, customers, and managers can all agree to the release plan.
- ScheduledWalk/권정욱 . . . . 1 match
int temp;
- SmallTalk/강좌FromHitel/강의3 . . . . 1 match
* How many attempts did it take you to download this software?:
- TheTrip/황재선 . . . . 1 match
* TODO To change the template for this generated file go to
* Window - Preferences - Java - Code Style - Code Templates
- ToyProblems . . . . 1 match
* JuNe님 소스 공개 해주셔요. _temp에 있던 코드들이 눈 앞에 아른거려요. :) --[강규영]
- UML . . . . 1 match
At the same time, UML is often considered to have become too bloated, and fine-grained in many aspects. Details which are best captured in source code are attempted to be captured using UML notation. The [[80-20 rule]] can be safely applied to UML: a small part of UML is adequate for most of the modeling needs, while many aspects of UML cater to some specialized or esoteric usages.
- Velocity . . . . 1 match
Java 의 TemplateLibrary. FreeMarker 와 함께 현업에서 자바 웹 프로그래밍시에 많이 이용.
import org.apache.velocity.Template;
Template tmpl = Velocity.getTemplate("./tmpl/simple.vm");
simple.vm 화일 - template.
- WikiProjectHistory . . . . 1 match
|| [검색에이전시_temp] || 남상협, 유용안 || 이벤트 기반 검색 에이전시 || 종료 ||
- WikiTextFormattingTestPage . . . . 1 match
Some''''''PartOfThisIsValidInTheOriginalWiki -- Attempted to invalidate putting 6 single quotes between the first pair of words.
- Yggdrasil . . . . 1 match
["Yggdrasil/temp"]
- YongAn처음화면 . . . . 1 match
[검색에이전시_temp]
- [Lovely]boy^_^/Temp . . . . 1 match
template <typename T>
- eclipse단축키 . . . . 1 match
* Content Assist : show template proposals 사용가능한 메소드 이름 보여준다
- tempOCU . . . . 1 match
= tempOCU =
- usa_selfish/김태진 . . . . 1 match
cow arr[50000],temp;
- 겨울방학프로젝트/2005 . . . . 1 match
|| [검색에이전시_temp] || 파이선으로 맞춤형 검색 || 용안 상협 준수 ||
- 기술적인의미에서의ZeroPage . . . . 1 match
In early computers, including the PDP-8, the zero page had a special fast addressing mode, which facilitated its use for temporary storage of data and compensated for the relative shortage of CPU registers. The PDP-8 had only one register, so zero page addressing was essential.
- 논문번역/2012년스터디/이민석 . . . . 1 match
강도 분포의 평균값의 변화 뿐 아니라 하단 contour와 상단 contour의 방향을 고려하기 위해 추가적으로 세 가지 방향성 특징을 계산한다. 말인 즉 우리는 네 lower countour 점, upper contour 점, sliding window 내 평균값을 통해 줄들을 재고 선 방향들을 (8), (9), (10) 특성으로 각각 사용한다. (뭔 소리) 더 넓은 temporal context를 고려하여 우리는 특징 벡터의 각 성분마다 근사적인 수평 미분을 추가로 계산하고 결과로 20 차원 특징 벡터를 얻는다. (윈도우당 특징 10개, 도함수 10개)
- 데블스캠프2002/진행상황 . . . . 1 match
* 네트워크 세미나 + TCP/IP 동영상 보기. (http://edu.hackerslab.com/home/html/temp/movie.htm)
- 데블스캠프2004/세미나주제 . . . . 1 match
* [NeoCoin/Temp] CrcCard
- 아! 그리고 template에 대한 내용도.. :-) - [임인택]
- 데블스캠프2010/일반리스트 . . . . 1 match
== qsort by template ==
- 레밍즈프로젝트/프로토타입/SetBit . . . . 1 match
[http://zeropage.org/~beonit/temp/runshow11011.gif]
- 새싹교실/2011/Pixar/5월 . . . . 1 match
* 오늘 하노이탑을 하고 재귀함수를 이용한 숙제를 했습니당. 아오 하노이탑 어려웠습니다. from temp to 유후 아직 조금 어려워요 ㅠㅠ. 프링글스는 맛있었습니다. 오늘 ARRAY가 너무너무 배우고싶었는데 망할 오상준과 이승열 이자식들이 안와서 못배웠습니다 ㅠㅠ. 숙제 집에가서 다시한번해볼려구요 더 많이ㅣㅣㅣㅣ 배우고싶어요 누나 ㅋㅋㅋㅋㅋ
- 새싹교실/2013 . . . . 1 match
* 새로 글 쓸 때,6. junetemplete를 쓰면 매우 편리하다는 것을 발견했다!. 다만 새싹교실/2012로 연결되니 주의. -[고한종](13/03/19)
- 영어학습방법론 . . . . 1 match
* The Longman Dictionary of Contemporary English (Addison Wesley Longman, 3rd Edition이상)
- 토비의스프링3/밑줄긋기 . . . . 1 match
* hamcrest.CoreMatchers에 대해서 : CoreMatcher로 테스트 코드를 만들 때 null 값은 비교나 not을 사용하는 것이 불가능합니다(ex. assertThat(tempObject, is(null)); -> 에러). 이건 null이 값이 아니기 때문인데, CoreMatcher에서 null 값을 쓸 때는 org.hamcrest.CoreMatchers의 notNullValue()와 nullValue()를 사용하시면 되겠습니다. http://jmock.org/javadoc/2.5.1/org/hamcrest/CoreMatchers.html
- 포항공대전산대학원ReadigList . . . . 1 match
“Contemporary Logic Design”, Randy H. Katz, Benjamin/Cummings 1994.
- 황재선 . . . . 1 match
* [황재선/temp]
Found 453 matching pages out of 7540 total pages (5000 pages are searched)
You can also click here to search title.
