- PNGFileFormat/FormatUnitTestInPythonLanguage . . . . 21 matches
idx = self.png.getIdx(0,i)-1
idx = self.getIdx(0, ypos)-1
method = ord(stream[idx])
idx = self.getIdx(i, ypos)
filteredR = ord(stream[idx])
filteredG = ord(stream[idx+1])
filteredB = ord(stream[idx+2])
idx = self.getIdx(i, ypos)
filteredR = ord(stream[idx])
filteredG = ord(stream[idx+1])
filteredB = ord(stream[idx+2])
idx = self.getIdx(i, ypos)
filteredR = ord(stream[idx])
filteredG = ord(stream[idx+1])
filteredB = ord(stream[idx+2])
idx = self.getIdx(i, ypos)
filteredR = ord(stream[idx])
filteredG = ord(stream[idx+1])
filteredB = ord(stream[idx+2])
def getIdx(self, x,y):
- 데블스캠프2011/둘째날/Machine-Learning/SVM/namsangboy . . . . 13 matches
for idx,word in enumerate(wordlist):
wordindexdic[word]=(idx+1)
for idx,eachclass in enumerate(classlist):
print idx
wordidx = wordindexdic[word]
if not docwordfreq.has_key(wordidx):
docwordfreq[wordidx]=0
docwordfreq[wordidx]+=1
outlist = [str(idx+1)]
for wordidx in docwordlist:
outlist.append(str(wordidx)+":"+str(1))
# outlist.append(str(wordidx)+":"+str(docwordfreq[wordidx]))
- 데블스캠프2013/셋째날/머신러닝 . . . . 11 matches
int idx = 0;
idx = 0;
idx = j;
testNews[i].category = sampleNews[idx].category;
int idx = 0;
cout << "index : " << idx++ << endl;
int idx = getClosestIndex(new_sum[i], avr);
fprintf(result, "%d\n", idx+1);
int idx = 0;
idx = i;
return idx;
- IndexedTree/권영기 . . . . 8 matches
int idx, i;
idx = i;
while(idx <= *n){
tree[idx] += f[i];
idx += (idx & -idx);
int idx;
- PrimaryArithmetic/1002 . . . . 8 matches
for idx in range(9,-1,-1):
if hasCarry(oneList[idx],twoList[idx]):
oneList[idx-1] += 1
for idx in range(LIMIT_NUMBER-1,-1,-1):
if hasCarry(oneList[idx],twoList[idx]):
oneList[idx-1] += 1
- 새싹교실/2012/AClass/3회차 . . . . 7 matches
int idx;
idx=Lsearch(arr,sizeof(arr)/sizeof(int),4);
if(idx== -1)
printf("%d\n",idx);
idx = Lsearch(arr,sizeof(arr)/sizeof(int),7);
if(idx ==-1)
printf("%d\n",idx);
- Where's_Waldorf/곽병학_미완.. . . . . 6 matches
int idx = 1;
idx =1;
System.out.println("idx = " + idx);
if(grid[temp_r][temp_c] == str.charAt(idx)) {
idx++;
- Self-describingSequence/shon . . . . 5 matches
function idx = selfd(N)
idx = 4;
seq(idx) = x;
idx = idx + 1;
- SpiralArray/임인택 . . . . 5 matches
self.idx = 3
if self.idx == 3:
self.idx = 0
self.idx += 1
return self.sequence[self.idx]
- UglyNumbers/1002 . . . . 5 matches
idx = 2
if isDivideOnly235(idx):
print idx,currentCount
return idx
idx+=1
- EcologicalBinPacking/임인택 . . . . 4 matches
idx=0
idx=i
print chars[idx],results[idx]
- ErdosNumbers/임인택 . . . . 4 matches
idx = 0
sNum = int(lines[idx])
idx += 1
sInfo = lines[idx].split()
- Score/1002 . . . . 4 matches
for idx in range(1,len(aList)):
aList[idx]=aList[idx]*(aList[idx-1]+1)
- JTDStudy/첫번째과제/상욱 . . . . 3 matches
for idx,i in enumerate(question):
if question[idx] == answer[idx]:strike += 1
- ScheduledWalk/임인택 . . . . 3 matches
int idx = (int)(c - '0');
curX += dirX[idx];
curY += dirY[idx];
- 데블스캠프2006/월요일/연습문제/웹서버작성/변형진 . . . . 3 matches
foreach($index_file as $idxf)
if(is_readable($file.$idxf))
$file .= $idxf;
- GuiTestingWithWxPython . . . . 2 matches
for idx in range(self.listBox.Number()):
retList.append(self.listBox.GetString(idx))
- JTDStudy/두번째과제/상욱 . . . . 1 match
gc.gridx = 0;
- ProgrammingPartyAfterwords . . . . 1 match
* NoSmok:StructureAndInterpretationOfComputerPrograms 에 나온 Event-Driven Simulation 방식의 회로 시뮬레이션 [http://mitpress.mit.edu/sicp/full-text/book/book-Z-H-22.html#%_idx_3328 온라인텍스트]
Found 19 matching pages out of 7555 total pages (5000 pages are searched)
You can also click here to search title.
