/external/lzma/CS/7zip/Compress/LZMA/ |
LzmaDecoder.cs | 13 BitDecoder m_Choice = new BitDecoder();
14 BitDecoder m_Choice2 = new BitDecoder();
15 BitTreeDecoder[] m_LowCoder = new BitTreeDecoder[Base.kNumPosStatesMax];
16 BitTreeDecoder[] m_MidCoder = new BitTreeDecoder[Base.kNumPosStatesMax];
17 BitTreeDecoder m_HighCoder = new BitTreeDecoder(Base.kNumHighLenBits);
24 m_LowCoder[posState] = new BitTreeDecoder(Base.kNumLowLenBits);
25 m_MidCoder[posState] = new BitTreeDecoder(Base.kNumMidLenBits);
66 public void Create() { m_Decoders = new BitDecoder[0x300]; }
113 m_Coders = new Decoder2[numStates];
135 LZ.OutWindow m_OutWindow = new LZ.OutWindow(); [all...] |
/external/lzma/CS/7zip/Compress/LzmaAlone/ |
LzmaAlone.cs | 48 throw (new Exception("can't Write"));
52 throw (new Exception("can't Seek"));
56 throw (new Exception("can't SetLength"));
115 throw (new Exception("Command line error"));
129 SwitchForm[] kSwitchForms = new SwitchForm[13];
131 kSwitchForms[sw++] = new SwitchForm("?", SwitchType.Simple, false);
132 kSwitchForms[sw++] = new SwitchForm("H", SwitchType.Simple, false);
133 kSwitchForms[sw++] = new SwitchForm("A", SwitchType.UnLimitedPostString, false, 1);
134 kSwitchForms[sw++] = new SwitchForm("D", SwitchType.UnLimitedPostString, false, 1);
135 kSwitchForms[sw++] = new SwitchForm("FB", SwitchType.UnLimitedPostString, false, 1); [all...] |
/external/v8/test/mjsunit/ |
date.js | 29 var date0 = new Date(1111); 30 var date1 = new Date(date0); 33 var date2 = new Date(date0.toString()); 47 var dMax = new Date(8.64e15); 53 var dOverflow = new Date(8.64e15+1); 56 var dMin = new Date(-8.64e15); 62 var dUnderflow = new Date(-8.64e15-1); 69 var a = new Date(); 74 var b = new Date(); 80 var c = new Date() [all...] |
array-store-and-grow.js | 69 x = new Object(); 116 a = new Array(1,2,3); 118 a = new Array(1,2,3); 127 a = new Array(1,2,3); 129 a = new Array(1,2,3); 138 a = new Array(1,2,3); 140 a = new Array(1,2,3); 150 var a = new Array(0.5, 1.5); 152 a = new Array(0.5, 1.5); 155 a = new Array(0.5, 1.5) [all...] |
apply.js | 39 assertSame(this, f0.apply(this, new Array(1)), "2b"); 40 assertSame(this, f0.apply(this, new Array(2)), "2c"); 41 assertSame(this, f0.apply(this, new Array(4242)), "2d"); 44 assertSame(this, f0.apply(null, new Array(1)), "3b"); 45 assertSame(this, f0.apply(null, new Array(2)), "3c"); 46 assertSame(this, f0.apply(this, new Array(4242)), "3d"); 49 assertSame(this, f0.apply(void 0, new Array(1)), "4b"); 50 assertSame(this, f0.apply(void 0, new Array(2)), "4c"); 55 assertEquals(void 0, f1.apply(this, new Array(1)), "5b"); 56 assertEquals(void 0, f1.apply(this, new Array(2)), "5c") [all...] |
/external/valgrind/main/massif/tests/ |
deep-B.stderr.exp | 4 Massif: operator new(unsigned) 5 Massif: operator new(unsigned long) 7 Massif: operator new[](unsigned) 8 Massif: operator new[](unsigned long) 14 Massif: operator new(unsigned, std::nothrow_t const&) 15 Massif: operator new[](unsigned, std::nothrow_t const&) 16 Massif: operator new(unsigned long, std::nothrow_t const&) 17 Massif: operator new[](unsigned long, std::nothrow_t const&)
|
realloc.stderr.exp | 4 Massif: operator new(unsigned) 5 Massif: operator new(unsigned long) 7 Massif: operator new[](unsigned) 8 Massif: operator new[](unsigned long) 14 Massif: operator new(unsigned, std::nothrow_t const&) 15 Massif: operator new[](unsigned, std::nothrow_t const&) 16 Massif: operator new(unsigned long, std::nothrow_t const&) 17 Massif: operator new[](unsigned long, std::nothrow_t const&)
|
new-cpp.post.exp | 2 Command: ./new-cpp 44 99.73% (12,000B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. 45 ->33.24% (4,000B) 0x........: main (new-cpp.cpp:19) 47 ->33.24% (4,000B) 0x........: main (new-cpp.cpp:20) 49 ->16.62% (2,000B) 0x........: main (new-cpp.cpp:21) 51 ->16.62% (2,000B) 0x........: main (new-cpp.cpp:22)
|
overloaded-new.post.exp | 2 Command: ./overloaded-new 44 99.73% (12,000B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. 45 ->33.24% (4,000B) 0x........: main (overloaded-new.cpp:49) 47 ->33.24% (4,000B) 0x........: main (overloaded-new.cpp:50) 49 ->16.62% (2,000B) 0x........: main (overloaded-new.cpp:51) 51 ->16.62% (2,000B) 0x........: main (overloaded-new.cpp:52)
|
/hardware/samsung_slsi/exynos5/mobicore/daemon/Daemon/Server/ |
Android.mk | 12 # Add new folders with header files here 15 # Add new source files here
|
/external/chromium_org/third_party/icu/source/test/perf/perldriver/ |
Dataset.pm | 13 # Create a new Dataset with the given data. 14 sub new { subroutine 26 my $stats = Statistics::Descriptive::Full->new(); 69 # Divide two Datasets and return a new one, maintaining the 70 # mean+/-error. The new Dataset has no data points. 80 my $result = Dataset->new(); 87 # subtracts two Datasets and return a new one, maintaining the 88 # mean+/-error. The new Dataset has no data points. 93 my $result = Dataset->new(); 100 # adds two Datasets and return a new one, maintaining th [all...] |
/external/icu4c/test/perf/perldriver/ |
Dataset.pm | 13 # Create a new Dataset with the given data. 14 sub new { subroutine 26 my $stats = Statistics::Descriptive::Full->new(); 69 # Divide two Datasets and return a new one, maintaining the 70 # mean+/-error. The new Dataset has no data points. 80 my $result = Dataset->new(); 87 # subtracts two Datasets and return a new one, maintaining the 88 # mean+/-error. The new Dataset has no data points. 93 my $result = Dataset->new(); 100 # adds two Datasets and return a new one, maintaining th [all...] |
/external/skia/bench/ |
bench_compare.py | 15 print '-n <file> the new bench output file.' 29 print ' n: new time' 39 def __init__(self, old, new): 41 self.new = new 42 self.diff = old.time - new.time 50 str(self.new), 65 new = None 78 new = value 93 if old is None or new is None [all...] |
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
hashlib.py | 9 new(name, string='') - returns a new hash object implementing the 14 than using new(): 57 # This tuple and __get_builtin_constructor() must be modified if a new 63 __all__ = __always_supported + ('new', 'algorithms') 70 return _sha.new 73 return _md5.new 107 """new(name, string='') - Return a new hashing object using the named algorithm; 114 """new(name, string='') - Return a new hashing object using the named algorithm 132 new = __py_new variable [all...] |
quopri.py | 127 new = '' 142 new = new + ' '; i = i+1 144 new = new + c; i = i+1 148 new = new + ESCAPE; i = i+2 150 new = new + chr(unhex(line[i+1:i+3])); i = i+3 152 new = new + c; i = i+ [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
hashlib.py | 9 new(name, string='') - returns a new hash object implementing the 14 than using new(): 57 # This tuple and __get_builtin_constructor() must be modified if a new 63 __all__ = __always_supported + ('new', 'algorithms') 70 return _sha.new 73 return _md5.new 107 """new(name, string='') - Return a new hashing object using the named algorithm; 114 """new(name, string='') - Return a new hashing object using the named algorithm 132 new = __py_new variable [all...] |
quopri.py | 127 new = '' 142 new = new + ' '; i = i+1 144 new = new + c; i = i+1 148 new = new + ESCAPE; i = i+2 150 new = new + chr(unhex(line[i+1:i+3])); i = i+3 152 new = new + c; i = i+ [all...] |
/external/chromium_org/v8/test/mjsunit/ |
apply.js | 39 assertSame(this, f0.apply(this, new Array(1)), "2b"); 40 assertSame(this, f0.apply(this, new Array(2)), "2c"); 41 assertSame(this, f0.apply(this, new Array(4242)), "2d"); 44 assertSame(this, f0.apply(null, new Array(1)), "3b"); 45 assertSame(this, f0.apply(null, new Array(2)), "3c"); 46 assertSame(this, f0.apply(this, new Array(4242)), "3d"); 49 assertSame(this, f0.apply(void 0, new Array(1)), "4b"); 50 assertSame(this, f0.apply(void 0, new Array(2)), "4c"); 55 assertEquals(void 0, f1.apply(this, new Array(1)), "5b"); 56 assertEquals(void 0, f1.apply(this, new Array(2)), "5c") [all...] |
array-store-and-grow.js | 71 x = new Object(); 121 a = new Array(1,2,3); 123 a = new Array(1,2,3); 132 a = new Array(1,2,3); 134 a = new Array(1,2,3); 143 a = new Array(1,2,3); 145 a = new Array(1,2,3); 155 var a = new Array(0.5, 1.5); 157 a = new Array(0.5, 1.5); 160 a = new Array(0.5, 1.5) [all...] |
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitruby/PrettyPatch/ |
diff.rb | 3 Match = Struct.new(:start_in_old, :start_in_new, :size) 14 Operation = Struct.new(:action, :start_in_old, :end_in_old, :start_in_new, :end_in_new) 30 @word_indices = Hash.new { |h, word| h[word] = [] } 41 matches << Match.new(@old_words.length, @new_words.length, 0) 62 Operation.new(action_upto_match_positions, 68 match_operation = Operation.new(:equal, 108 match_length_at = Hash.new { |h, index| h[index] = 0 } 112 new_match_length_at = Hash.new { |h, index| h[index] = 0 } 135 return (best_match_size != 0 ? Match.new(best_match_in_old, best_match_in_new, best_match_size) : nil)
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/BuildOptions/ |
DebugGrammarParser.cs | 25 internal static readonly string[] tokenNames = new string[] { 48 new string[] 59 : this( input, DebugEventSocketProxy.DefaultDebuggerPort, new RecognizerSharedState() ) 67 TreeAdaptor = new CommonTreeAdaptor(); 68 DebugEventSocketProxy proxy = new DebugEventSocketProxy( this, port, adaptor ); 70 TokenStream = new DebugTokenStream( input, proxy ); 79 ITreeAdaptor adap = new CommonTreeAdaptor(); 88 TreeAdaptor = new CommonTreeAdaptor(); 90 ITreeAdaptor adap = new CommonTreeAdaptor(); 112 this.adaptor = new DebugTreeAdaptor(dbg,adaptor) [all...] |
ProfileGrammarParser.cs | 25 internal static readonly string[] tokenNames = new string[] { 48 new string[] 59 : this( input, new Profiler(null), new RecognizerSharedState() ) 69 TreeAdaptor = new CommonTreeAdaptor(); 70 ITreeAdaptor adap = new CommonTreeAdaptor(); 81 TreeAdaptor = new CommonTreeAdaptor(); 83 ITreeAdaptor adap = new CommonTreeAdaptor(); 116 this.adaptor = new DebugTreeAdaptor(dbg,adaptor); 137 ProfileGrammarParser.prog_return retval = new ProfileGrammarParser.prog_return() [all...] |
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/idlelib/ |
ReplaceDialog.py | 70 new = m.expand(repl) 73 new = None 75 new = repl 76 return new 106 new = self._replace_expand(m, repl) 107 if new is None: 112 if new == orig: 118 if new: 119 text.insert(first, new) 120 col = i + len(new) [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/idlelib/ |
ReplaceDialog.py | 70 new = m.expand(repl) 73 new = None 75 new = repl 76 return new 106 new = self._replace_expand(m, repl) 107 if new is None: 112 if new == orig: 118 if new: 119 text.insert(first, new) 120 col = i + len(new) [all...] |
/external/chromium_org/chrome/test/ext_auto/auto_provider/ |
server.js | 16 var buffer = new ArrayBuffer(utf8string.length); 17 var view = new Uint8Array(buffer); 32 var outputBuffer = new ArrayBuffer(header.byteLength); 33 var view = new Uint8Array(outputBuffer); 46 var outputBuffer = new ArrayBuffer(buffer.byteLength); 47 var view = new Uint8Array(outputBuffer); 71 AutomationServer.instance_ = new AutomationServer(new ConnectionHandler()); 80 this.handler_.readRequest_(new Stream(this.handler_,
|