Searched refs:front (Results 1 - 25 of 226) sorted by relevance

12345678910

/macosx-10.9.5/ICU-511.35/icuSources/layoutex/
H A DLXUtilities.cpp77 le_int32 front, back; local
79 for (front = 0, back = length - 1; front < back; front += 1, back -= 1) {
80 le_int32 swap = array[front];
82 array[front] = array[back];
89 le_int32 front, back; local
91 for (front = 0, back = length - 1; front < back; front
[all...]
/macosx-10.9.5/text_cmds-87/look/
H A Dlook.c100 unsigned char *back, *front; local
152 if ((front = mmap(NULL, (size_t)sb.st_size, PROT_READ, MAP_SHARED, fd, (off_t)0)) == MAP_FAILED)
154 back = front + sb.st_size;
155 match *= (look(key, front, back));
194 look(wchar_t *string, unsigned char *front, unsigned char *back) argument
197 front = binary_search(string, front, back);
198 front = linear_search(string, front, back);
200 if (front)
248 binary_search(wchar_t *string, unsigned char *front, unsigned char *back) argument
282 linear_search(wchar_t *string, unsigned char *front, unsigned char *back) argument
302 print_from(wchar_t *string, unsigned char *front, unsigned char *back) argument
[all...]
/macosx-10.9.5/ntp-88/ntpd/
H A Dntp_data_structures.c29 my_queue->front = NULL;
44 while (my_queue->front != NULL) {
45 temp = my_queue->front;
46 my_queue->front = my_queue->front->node_next;
95 return (!my_queue || !my_queue->front);
104 if (NULL == q || NULL == q->front)
107 return q->front + 1;
119 node *j = my_queue->front;
127 new_node->node_next = my_queue->front;
[all...]
/macosx-10.9.5/Security-55471.14.18/include/security_utilities/
H A Dbufferfifo.cpp41 delete mBuffers.front();
49 delete mBuffers.front();
88 Buffer *top = mBuffers.front();
H A Dbufferfifo.h53 Buffer *top() const { assert(!mBuffers.empty()); return mBuffers.front(); }
59 size_t topLength() const { assert(!isEmpty()); return mBuffers.front()->length(); }
/macosx-10.9.5/Security-55471.14.18/libsecurity_utilities/lib/
H A Dbufferfifo.cpp41 delete mBuffers.front();
49 delete mBuffers.front();
88 Buffer *top = mBuffers.front();
H A Dbufferfifo.h53 Buffer *top() const { assert(!mBuffers.empty()); return mBuffers.front(); }
59 size_t topLength() const { assert(!isEmpty()); return mBuffers.front()->length(); }
/macosx-10.9.5/ruby-104/ruby/sample/drb/
H A Dextserv_test.rb48 front = Foo.new(cmd)
49 server = DRb::DRbServer.new(nil, front)
70 t1 = s.service('itest1').front
72 t2 = s.service('itest2').front
/macosx-10.9.5/ruby-104/ruby/test/drb/
H A Dignore_test_drb.rb8 @there = @ext.front
H A Dtest_drbunix.rb25 @there = @ext.front
43 @there = @ext.front
H A Dtest_drb.rb10 @there = @ext.front
185 @there = @ext.front
199 assert_equal(6, @there.sample(@server[0].front, @server[1].front, @server[2].front))
207 @there = @ext.front
215 @there = @ext.front
263 @there = @ext.front
307 @there = @ext.front
H A Dtest_drbssl.rb41 @there = @ext.front
59 @there = @ext.front
/macosx-10.9.5/CPANInternal-140/Net-DNS/lib/Net/DNS/RR/
H A DAAAA.pm33 my ($front, $a, $b, $c, $d) = ($1, $2, $3, $4, $5);
34 $string = $front . sprintf(":%x:%x",
40 my ($front, $back) = ($1, $2);
41 my @front = split(/:/, $front);
43 my $fill = 8 - (@front ? $#front + 1 : 0)
46 @addr = (@front, @middle, @back);
/macosx-10.9.5/llvmCore-3425.0.33/unittests/ADT/
H A DilistTest.cpp35 EXPECT_EQ(2, List.front().getNextNode()->Value);
40 EXPECT_EQ(2, ConstList.front().getNextNode()->Value);
/macosx-10.9.5/ruby-104/ruby/lib/drb/
H A Dextserv.rb25 def front method in class:DRb.ExtServ
67 front = Foo.new(cmd)
68 manager = DRb::DRbServer.new(nil, front)
H A Dgw.rb76 return ref ? DRb.to_obj(ref) : DRb.front
99 front = DRb::GW.new
101 s1 = DRb::DRbServer.new('drbunix:/tmp/gw_b_a', front)
102 s2 = DRb::DRbServer.new('drbunix:/tmp/gw_b_c', front)
/macosx-10.9.5/llvmCore-3425.0.33/unittests/Transforms/Utils/
H A DIntegerDivision.cpp41 EXPECT_TRUE(BB->front().getOpcode() == Instruction::SDiv);
46 EXPECT_TRUE(BB->front().getOpcode() == Instruction::AShr);
71 EXPECT_TRUE(BB->front().getOpcode() == Instruction::UDiv);
76 EXPECT_TRUE(BB->front().getOpcode() == Instruction::ICmp);
101 EXPECT_TRUE(BB->front().getOpcode() == Instruction::SRem);
106 EXPECT_TRUE(BB->front().getOpcode() == Instruction::AShr);
131 EXPECT_TRUE(BB->front().getOpcode() == Instruction::URem);
136 EXPECT_TRUE(BB->front().getOpcode() == Instruction::ICmp);
H A DLocal.cpp43 EXPECT_EQ(&bb0->front(), br0);
44 EXPECT_EQ(&bb1->front(), br1);
/macosx-10.9.5/swig-10/Lib/lua/
H A Dstd_vector.i41 T front()const; // only read front & back
H A D_std_common.i22 note: I allow front(), back() & pop_back() to throw execptions
37 T front()const throw (std::out_of_range){ // only read front & back
39 throw std::out_of_range("in "#CLASS"::front()");
40 return self->front();
50 /* push/pop for front/back
51 also note: front & back are read only methods, not used for writing
/macosx-10.9.5/swig-10/Lib/ruby/
H A Drubystdautodoc.swg30 AUTODOC(front, "Return the first element in $class");
/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/
H A DBasicBlock.h196 inline const Instruction &front() const { return InstList.front(); } function in class:llvm::BasicBlock
197 inline Instruction &front() { return InstList.front(); } function in class:llvm::BasicBlock
H A DFunction.h343 const BasicBlock &getEntryBlock() const { return front(); }
344 BasicBlock &getEntryBlock() { return front(); }
365 const BasicBlock &front() const { return BasicBlocks.front(); } function in class:llvm::Function
366 BasicBlock &front() { return BasicBlocks.front(); } function in class:llvm::Function
/macosx-10.9.5/ntp-88/include/
H A Dntp_data_structures.h31 node *front; member in struct:Queue
/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/CodeGen/
H A DMachineFunction.h309 const MachineBasicBlock &front() const { return BasicBlocks.front(); }
310 MachineBasicBlock &front() { return BasicBlocks.front(); }
442 return &F->front();
454 return &F->front();
479 return &G.Graph->front();
485 return &G.Graph->front();

Completed in 173 milliseconds

12345678910