- HowManyPiecesOfLand?/문보창 . . . . 36 matches
int lastdigit;
lastdigit = 0;
digit[lastdigit++] = n % 10;
digit[lastdigit] = n % 10;
for (i = lastdigit + 1; i < MAXDIGITS; i++)
lastdigit = 0;
for (int i = lastdigit; i >= 0; i--)
lastdigit = strlen(temp) - 1;
lastdigit--;
lastdigit--;
for (i = lastdigit + startI; i >= startI; i--)
while (n.lastdigit > 0 && n.digit[n.lastdigit] == 0)
n.lastdigit--;
if (n.lastdigit == 0 && n.digit[0] == 0)
if (b.lastdigit > a.lastdigit) return (PLUS * a.signbit);
if (a.lastdigit > b.lastdigit) return (MINUS * a.signbit);
for (i = a.lastdigit; i >= 0; i--)
if (n.lastdigit == 0 && n.digit[0] == 0) return;
for (i = n.lastdigit; i >= 0; i--)
n.lastdigit = n.lastdigit + d;
- Kongulo . . . . 16 matches
last_ua = ''
temp = last_ua
last_ua = line.lower()
if last_ua == temp:
last_ua = '' # reset on blank line
if doc.code == 304: # not modified since last time
# Store last modified in the crawlitem
# Prefer Last-Modified header, then Date header (to get same
last_modified = None
if 'last_modified' in doc.headers:
last_modified = fdoc.headers['last_modified']
last_modified = doc.headers['date']
last_modified = email.Utils.formatdate(time.time(), usegmt=True)
crawlitem[2] = { 'If-Modified-Since' : last_modified }
# TODO Use the last-modified HTTP header instead of current time
#event.AddProperty('last_modified_time',
- LinkedList/영동 . . . . 14 matches
Node * currentNode;//Create temporary node which indicates the last node of linked list
void eraseLastNode(Node * argNode, Node ** argFreeNode, int * argNumberOfList, int * argNumberOfFreeSpace);//Function which deletes the last node of the list
Node * currentNode;//Create temporary node which indicates the last node of linked list
eraseLastNode(firstAddress, &freeSpaceList, &elementsOfLinkedList, &elementsOfFreeSpaceList);
eraseLastNode(firstAddress, &freeSpaceList, &elementsOfLinkedList, &elementsOfFreeSpaceList);
eraseLastNode(firstAddress, &freeSpaceList, &elementsOfLinkedList, &elementsOfFreeSpaceList);
eraseLastNode(firstAddress, &freeSpaceList, &elementsOfLinkedList, &elementsOfFreeSpaceList);
argNode=secondTempNode;//Set address of the last node at first address
void eraseLastNode(Node * argNode, Node ** argFreeNode, int * argNumberOfList, int * argNumberOfFreeSpace)
{//Go to the last node of the linked list
}//Save the last node and the second node at back
{//At the last node,
}//Link the last node of the linked list to free space list
}/*Link the Free space list to the last node of linked list and
link the last node of the linked list to free space list*/
{//Go to the last node of linked list
{//Link the first node of free space list to the last node of linked list
{//Go to the last node of the linked list
}//Save the last node and the second node at back
- 만년달력/강희경,Leonardong . . . . 13 matches
int lastdays(int, int);
return (lastdays(year,month) + deter_date(year, month-1)) % 7;//핵심 코드
int lastdays(int year, int month)//지난 달 날수를 계산
int last;
last = 29;
last = 29;//윤달
last = 28;//평달
last = 28;//평달
last = 28;
last = 30;
last = 31;
last = 31;
return last;
- RefactoringDiscussion . . . . 11 matches
double result = Math.min(lastUsage(),100) * 0.03;
if (lastUsage() > 100) {
result += (Math.min (lastUsage(),200) - 100) * 0.05;
if (lastUsage() > 200) {
result += (lastUsage() - 200) * 0.07;
if (lastUsage() > start) return Math.min(lastUsage(),end) - start;
(1) 의 코드를 살펴보면 '''로직이 달라짐'''을 알 수 있다. 처음의 코드는 더 작은 값을 원할 뿐인데, 아래의 코드에서는 0 보다 작은 값은 가질 수 없게 되어있다. (예를 들어 lastUsage() 음수값을 지니면 결과가 달라진다)
'''"MatrinFowler의 추종자들은 lastUsage()가 0 이상인 값에 대해 동작하는것일테니 (코드를 보고 추정하면 그렇다) 당연한거 아니냐?"''' 라고 이의를 제기할지는 모르지만, 이건 Refactoring 에서 한결같이 추구했던 "의도를 명확하게"라는 부분을 Refactoring이라는 도구에 끼워맞추다보니 의도를 불명확하게 한 결과를 낳은것 같다. (["망치의오류"])
하지만 이것도 임시 방편일뿐, '''위험은 존재한다'''. lastUsage()의 값이 Integer.MIN_VALUE 이거나, Integer.MAX_VALUE 라면? (이런일이 결코 일어날 수 없다고 장담할 수 있는가?)
> lastUsage()의 값이 Integer.MIN_VALUE 이거나, Integer.MAX_VALUE 라면?
- CompleteTreeLabeling/조현태 . . . . 10 matches
int last_number=0;
if (last_number<line[j]->number && line[j]->number<now_number)
last_number=now_number;
int find_last=end;
for (; find_last>=0; --find_last)
if (1==line[find_last])
if (find_last==end)
line[find_last]=0;
line[find_last+1]=1;
- 손동일 . . . . 9 matches
int last = 0;
cin >> last;
cout << "최단거리 : " << between[last] << "\n";
if(ver1[j].length == between[last] && ver1[j].goal == last)
if(last==10)
cout.put(last+80);
cout.put(last+65);
if(j == last)
- JavaScript/2011년스터디/CanvasPaint . . . . 8 matches
var lastImage0,lastImage1,lastImage2,imageN;
if(lastImage1!=element.toDataURL()){
lastImage2=lastImage1;
lastImage1=element.toDataURL();
img.src = lastImage2;
- 수학의정석/집합의연산/조현태 . . . . 7 matches
int find_last=end;
for (; find_last>=0; --find_last)
if (1==temp_where[find_last])
if (find_last==end)
temp_where[find_last]=0;
temp_where[find_last+1]=1;
- HanoiTowerTroublesAgain!/조현태 . . . . 5 matches
vector<int> lastBallNumbers;
lastBallNumbers.resize(stickNumber);
if (IsCanPut(lastBallNumbers[i], ballCount + 1) || 0 == lastBallNumbers[i])
lastBallNumbers[i] = ballCount + 1;
- MoinMoinBugs . . . . 5 matches
* The intent is to not clutter RecentChanges with functions not normally used. I do not see a reason you want the lastest diff when you have the much better diff to your last visit.
* It'd be really nice if the diff was between now and the most recent version saved before your timestamp (or, failing that, the oldest version available). That way, diff is "show me what happened since I was last here", not just "show me what the last edit was."
* Oh, okay. Is this MoinMoin CVS enabled? Reason being: I did a few updates of a page, and was only being shown the last one. I'll try that some more and get back to you.
- HanoiProblem/임인택 . . . . 4 matches
Object lastObj = discsAtPillar.lastElement();
Integer iObj = (Integer)lastObj;
Integer topDisc = (Integer)(discsAtPillar.lastElement());
- IpscLoadBalancing . . . . 4 matches
last=0;leftSum=0;rightSum=totalSum
last=min(leftSum-avg*i,rightSum-avg*(listLen-i-1),last)
return -last
- JSP/FileUpload . . . . 4 matches
saveFile = saveFile.substring(saveFile.lastIndexOf("\") + 1,saveFile.indexOf("""));
int lastIndex = contentType.lastIndexOf("=");
String boundary = contentType.substring(lastIndex + 1,contentType.length());
- RSSAndAtomCompared . . . . 4 matches
Atom 1.0 requires that both feeds and entries include a title (which may be empty), a unique identifier, and a last-updated timestamp.
<lastBuildDate>Sat, 13 Dec 2003 18:30:02 GMT</lastBuildDate>
||lastBuildDate (in channel)||updated||RSS has no item-level equivalent||
- Refactoring/MakingMethodCallsSimpler . . . . 4 matches
Object lastReading () {
return readings.lastElement ();
Reading lastReading () {
return (Reading) readings.lastElement ();
- SpiralArray/Leonardong . . . . 4 matches
self.eraseLastMovement()
def eraseLastMovement(self):
self.eraseLastMovement()
self.eraseLastMovement()
def eraseLastMovement(self):
def lastHistory( self ):
self.assertEquals( (1,0), self.mover.lastHistory().coordinate )
self.assertEquals( (1,0), self.mover.lastHistory().coordinate )
self.assertEquals( (1,1), self.mover.lastHistory().coordinate )
- 시간맞추기/김태훈zyint . . . . 4 matches
int last;
last = time(0);
// 지난 시간 == (time(0) - last)
if((time(0) - last)==8)
- CxxTest . . . . 3 matches
lastestPeriod = eachFile.rfind(".")
fileName = eachFile[:lastestPeriod]
extension = eachFile[lastestPeriod+1:]
- MedusaCppStudy/재동 . . . . 3 matches
char lastChar = x[x.size() - 1];
if(lastChar == '.' || lastChar == ',')
- TowerOfCubes/조현태 . . . . 3 matches
void SuchNextBox(vector<SMyBox*>& myBoxs, int boxNumber, int lastColor, vector<SBoxBlock>& myBoxStack, vector<SBoxBlock>& bestHeight)
if (0 == lastColor)
if (lastColor == myBoxs[boxNumber]->color[i])
- usa_selfish/곽병학 . . . . 3 matches
int last = p[n-1].b;
int[] ans = new int[last+1];
System.out.println(ans[last]);
- 영호의해킹공부페이지 . . . . 3 matches
other, and the last object placed on the stack will be the first one to be
removed. This is called LIFO - or last in first out. An element can be added
at last. Entertainment at the expense of the hacker community. Who says we
- 이영호/미니프로젝트#1 . . . . 3 matches
int last;
pid = waitpid(-1, &last, WNOHANG);
fprintf(stderr, "Child Process Closed!: pid = %d, WEXITSTATUS = %Xn", pid, WEXITSTATUS(last));
- DebuggingSeminar_2005/AutoExp.dat . . . . 2 matches
std::vector<*>= first=<_First> last=<_Last>
std::priority_queue<*>= first=<c._First> last=<c._Last>
- FocusOnFundamentals . . . . 2 matches
taught concepts of more lasting value that, even today, help me to understand and use new
of educators to remember that today's students' careers could last four decades. We must identify
- FortuneCookies . . . . 2 matches
* He who has a shady past knows that nice guys finish last.
* Generosity and perfection are your everlasting goals.
- ProjectEazy/Source . . . . 2 matches
lastToken = aSentence.split()[-1]
self.removeMark(lastToken) )
- RandomWalk/임인택 . . . . 2 matches
// if this is not the last point relay to the last point
- Slurpys/곽세환 . . . . 2 matches
temp = str.find_last_of('C');
temp = str.find_last_of('H');
- UglyNumbers/JuNe . . . . 2 matches
tris=[bisect(ugs,lastug/p)
for lastug,p in zip([ugs[-1]]*len(prim),prim)]
- WOWAddOn/2011년프로젝트/초성퀴즈 . . . . 2 matches
final static char[] last = {
System.out.println(""+ (char)first[cho] + (char)middle[joong] + (char)last[jong]);
Last = { "\0","ㄱ","ㄲ","ㄳ","ㄴ","ㄵ","ㄶ","ㄷ","ㄹ","ㄺ","ㄻ","ㄽ","ㄾ","ㄿ","ㅀ","ㅁ","ㅂ","ㅄ","ㅅ","ㅆ","o","ㅈ","ㅊ","ㅋ","ㅌ","ㅍ","ㅎ"};
<OnLoad>self.TimeSinceLastUpdate = 0 </OnLoad>
self.TimeSinceLastUpdate = self.TimeSinceLastUpdate + elapsed;
if (self.TimeSinceLastUpdate > MyAddon_UpdateInterval) then
self.TimeSinceLastUpdate = 0;
- WeightsAndMeasures/황재선 . . . . 2 matches
lastCapacity = self.stack[len(self.stack)-1][2]
weight <= lastCapacity and capacity >= maxCapacity:
- WikiTextFormattingTestPage . . . . 2 matches
[ISBN: 0-13-748310-X] -- ISBN, with colon, entire string surrounded by square brackets, followed by 10 digits with optional hyphens, last digit an X ''"X" is the "digit" ten (the roman numeral, actually), which is a possible value for the checksum (last) digit.''
- [Lovely]boy^_^/EnglishGrammer/PresentAndPast . . . . 2 matches
ex) A : ''Did'' you ''go'' out last night?
ex) I walked home after the party last night. ( = all the way, completely)
- [Lovely]boy^_^/EnglishGrammer/PresentPerfectAndPast . . . . 2 matches
ex) It snowed last night.(not has snowed)
Here are more examples of speakers talking about a period that continues until now(recently/ in the last few days/ so far/ since breakfast, etc.)
- [Lovely]boy^_^/영작교정 . . . . 2 matches
* [[HTML(<STRIKE>)]] It is impossible to ascertain that who was here until last.[[HTML(</STRIKE>)]]
* It is impossible to ascertain who was here last.
- bitblt로 투명배경 구현하기 . . . . 2 matches
Upload:last_1.jpg
Upload:last.jpg
- whiteblue/만년달력 . . . . 2 matches
int lastDayOfMonth[12] = {31,29,31,30,31,30,31,31,30,31,30,31};
dateNumber > lastDayOfMonth[monthInput-1] ||
- 김수경/JavaScript/InfiniteDataStructure . . . . 2 matches
* {{{.reduce(f(a, b)) := f(seq[:last-1].reduce(f), seq[last])}}}
- 데블스캠프2011/셋째날/String만들기 . . . . 2 matches
|| lastIndexOf || str2.lastIndexOf("b") == 3 ||
- 데블스캠프2011/셋째날/String만들기/김준석 . . . . 2 matches
int lastIndexOf(String& str){
//cout << s->lastIndexOf(*s2) << endl;
- 오목/인수 . . . . 2 matches
private void checkBoard(int turnSet[][][], int lastTurn, int x, int y,
board.putStone(lastTurn, x, y);
- 토이/메일주소셀렉터/김남훈 . . . . 2 matches
last_domain com|net|co\.kr
mail_address {mailname}@({domain_name}\.)+{last_domain}
- 2학기파이선스터디/모듈 . . . . 1 match
Traceback (most recent call last):
- 2학기파이선스터디/문자열 . . . . 1 match
Traceback (most recent call last):
- AcceleratedC++/Chapter11 . . . . 1 match
iterator avail; // (one past) the last element in the `Vec'
- Android/WallpaperChanger . . . . 1 match
문자열을 처리할 때, String.indexOf(), String.lastIndexOf() 와 그 밖의 특별한 메소드를 사용하는 것을 주저하지 마십시오. 이 메소드들은 대체적으로, 자바 루프로 된 것 보다 대략 10-100배 빠른 C/C++ 코드로 구현이 되어있습니다.
- BabyStepsSafely . . . . 1 match
The code that is to be refactored has existed in the system for awhile. It has undergone a couple of transformations. Initially it returned an array of int variables that are the prime numbers. When the new collection library was introduced in Java2 the interface was changed to return a List of Integer objects. Going forward the method that returns a List is the preferred method, so the method that returns an array has been marked as being deprecated for the last couple of releases. During this release the array member function will be removed. Listing1, "Class GeneratePrimes," contains the source code for both methods.
- DPSCChapter1 . . . . 1 match
This is by no means an exhaustive list, and even novices understand and use much of the knowledge. But some items, especially the last -- recurring patterns of software design, or design patterns -- are the province of design expert.
- EnglishSpeaking/2011년스터디 . . . . 1 match
* There are four members in my family: my father, mother, and a younger brother. Well, actually there are five including our dog. My father was a military officer for twenty years. He recently retired from service and now works in a weaponry company. My mother is a typical housewife. She takes care of me and my brother and keeps our house running well. My brother is attending a university in the U.S.A. He just entered the university as a freshman and is adjusting to the environment. I miss the memory of fighting over things with him. The last member of my family is my dog named Joy. She is a Maltese terrier and my mother named her Joy to bring joy into our family. That's about it for the introduction of my family members.
- GIMP . . . . 1 match
* [http://plasticbugs.com/?page_id=294 GIMPShop] : script-fu.exe 에러 해결. 백그라운드 윈도우 제공. 포토샵 단축키 제공.
- Google/GoogleTalk . . . . 1 match
print "last_word :".$1."\n" if $debug;
- HowToStudyDesignPatterns . . . . 1 match
''...but I always teach Composite Pattern, Strategy Pattern, Template Method Pattern, and Factory Method Pattern before I teach Singleton Pattern. They are much more common, and most people are probably already using the last two. ... ''
- Java/스레드재사용 . . . . 1 match
reThread = (ReThread)threads.lastElement();
- JollyJumpers/임인택3 . . . . 1 match
case (length(Ori)-1 =:= length(Res) andalso lists:sum(Res) =:= trunc((hd(Res)+lists:last(Res))*length(Res)/2)) of
- KDPProject . . . . 1 match
* http://www.plasticsoftware.com/ - 국산 Java case tool pLASTIC
- LawOfDemeter . . . . 1 match
The last, of course, is why Eiffel requires only side-effect free methods to be called from within an
- LongestNap/문보창 . . . . 1 match
cout << " and will last for ";
- MoinMoinTodo . . . . 1 match
* Now that we can identify certain authors (those who have set a user profile), we can avoid to create a backup copy if one author makes several changes; we have to remember who made the last save of a page, though.
- MoniWikiPo . . . . 1 match
"Last-Translator: Won-kyu Park <wkpark@kldp.org>\n"
msgid "last modified %s %s"
- NeoCoin/Server . . . . 1 match
/alias WNC {window new hide swap last double on split on channel $0}
- OurMajorLangIsCAndCPlusPlus/string.h . . . . 1 match
|| char * strrchr(const char *string, int c) || Scan a string for the last occurrence of a character. ||
- PragmaticVersionControlWithCVS/CommonCVSCommands . . . . 1 match
|| Relative || 1 day ago [[HTML(<BR/>)]] 27 minutes ago [[HTML(<BR/>)]] last monday [[HTML(<BR/>)]] yesterday [[HTML(<BR/>)]] third week ago ||
- ReadySet 번역처음화면 . . . . 1 match
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.
- STLPort . . . . 1 match
* 최종 업데이트 날짜 : 이 페이지 아래에 있는 "last modified"에 나와 있음
- StructuredText . . . . 1 match
sub-paragraph of another paragraph if the other paragraph is the last
- TdddArticle . . . . 1 match
류군 이야기로는 Oracle 의 경우 설치하고 딱 실행하는데만 기본 메모리 200메가 잡아먹는다고 한다. -_-; 로컬 테스트를 위해 HypersonicSql를 쓸만도 하군.; (In-memory DB 식으로 지원가능. 인스톨 할것도 없이 그냥 콘솔에서 배치화일 하나 실행만 하면 됨. 근데, JDBC 를 완벽히 지원하진 않는 것도 같아서, 약간 애매. (ResultSet 의 first(), last(), isLast() 등의 메소드들이 실행이 안됨)
- ToastOS . . . . 1 match
The war was brief, but harsh. Rising from the south the mighty RISC OS users banded together in a show of defiance against the dominance of Toast OS. They came upon the Toast OS users who had grown fat and content in their squalid surroundings of Toast OS Town. But it was not to last long. Battling with SWIs and the mighty XScale sword, the Toast OS masses were soon quietened and on the 3rd November 2002, RISC OS was victorious. Scroll to the bottom for further information.
- ZIM . . . . 1 match
* CASE 도구 : Together 5.5, Rational Rose, Plastic
- html5/communicationAPI . . . . 1 match
* 메세지 이벤트 : 자바스크립트 객체 ( data, origin, lastEventid, source, ports)
- 레밍즈프로젝트 . . . . 1 match
[(zeropage)UML] : [AgoraPlastic]
- 미로찾기/영동 . . . . 1 match
//Push the last movement to stack
- 비행기게임/BasisSource . . . . 1 match
#clear/erase the last drawn sprites
- 새싹교실/2012/주먹밥 . . . . 1 match
* 함수포인터 질문 : int *compare(int a, int b), function call에 의한 stack(FILO : first in last out)의 내부 변화. int형 포인터는 int형으로 반환해야지?
- 영어단어끝말잇기 . . . . 1 match
* a plastic or stone figure of a gnome, used as a garden ornament
- 영호의바이러스공부페이지 . . . . 1 match
On the last Friday of the month the virus will display a full color, full
- 주민등록번호확인하기/조현태 . . . . 1 match
checkNumSub(List) -> 11 - (mulAndSum(List, [2, 3, 4, 5, 6, 7, 8, 9, 2, 3, 4, 5, 0]) rem 11) == lists:last(List).
- 프로그램내에서의주석 . . . . 1 match
// addChild(newnode, /*MODE_ADDBEFORE*/); //newnode가 last child로 삽입된다.
- 황현/Objective-P . . . . 1 match
$myClass->doSomeTaskWithSomething(42, true); // Compiler automatically adds last argument!
Found 80 matching pages out of 7555 total pages (5000 pages are searched)
You can also click here to search title.
