Home
last modified time | relevance | path

Searched refs:literalNode (Results 1 – 25 of 153) sorted by relevance

1234567

/dports/lang/gcc12-devel/gcc-12-20211205/libgo/go/compress/flate/
H A Dhuffman_code.go20 freqcache []literalNode
26 type literalNode struct { struct
57 func maxNode() literalNode { return literalNode{math.MaxUint16, math.MaxInt32} }
279 h.freqcache = make([]literalNode, maxNumLit+1)
287 list[count] = literalNode{uint16(i), f}
290 list[count] = literalNode{}
294 list[len(freq)] = literalNode{}
314 type byLiteral []literalNode
316 func (s *byLiteral) sort(a []literalNode) { argument
329 type byFreq []literalNode
[all …]
/dports/lang/gcc8/gcc-8.5.0/libgo/go/compress/flate/
H A Dhuffman_code.go20 freqcache []literalNode
26 type literalNode struct { struct
57 func maxNode() literalNode { return literalNode{math.MaxUint16, math.MaxInt32} }
279 h.freqcache = make([]literalNode, maxNumLit+1)
287 list[count] = literalNode{uint16(i), f}
290 list[count] = literalNode{}
294 list[len(freq)] = literalNode{}
314 type byLiteral []literalNode
316 func (s *byLiteral) sort(a []literalNode) { argument
329 type byFreq []literalNode
[all …]
/dports/net/google-cloud-sdk-app-engine-go/platform/google_appengine/goroot-1.9/src/compress/flate/
H A Dhuffman_code.go20 freqcache []literalNode
26 type literalNode struct { struct
57 func maxNode() literalNode { return literalNode{math.MaxUint16, math.MaxInt32} }
279 h.freqcache = make([]literalNode, maxNumLit+1)
287 list[count] = literalNode{uint16(i), f}
290 list[count] = literalNode{}
294 list[len(freq)] = literalNode{}
314 type byLiteral []literalNode
316 func (s *byLiteral) sort(a []literalNode) { argument
329 type byFreq []literalNode
[all …]
/dports/lang/gcc10/gcc-10.3.0/libgo/go/compress/flate/
H A Dhuffman_code.go20 freqcache []literalNode
26 type literalNode struct { struct
57 func maxNode() literalNode { return literalNode{math.MaxUint16, math.MaxInt32} }
279 h.freqcache = make([]literalNode, maxNumLit+1)
287 list[count] = literalNode{uint16(i), f}
290 list[count] = literalNode{}
294 list[len(freq)] = literalNode{}
314 type byLiteral []literalNode
316 func (s *byLiteral) sort(a []literalNode) { argument
329 type byFreq []literalNode
[all …]
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/libgo/go/compress/flate/
H A Dhuffman_code.go20 freqcache []literalNode
26 type literalNode struct { struct
57 func maxNode() literalNode { return literalNode{math.MaxUint16, math.MaxInt32} }
279 h.freqcache = make([]literalNode, maxNumLit+1)
287 list[count] = literalNode{uint16(i), f}
290 list[count] = literalNode{}
294 list[len(freq)] = literalNode{}
314 type byLiteral []literalNode
316 func (s *byLiteral) sort(a []literalNode) { argument
329 type byFreq []literalNode
[all …]
/dports/lang/go-devel/go-becaeea1199b875bc24800fa88f2f4fea119bf78/src/compress/flate/
H A Dhuffman_code.go20 freqcache []literalNode
26 type literalNode struct { struct
57 func maxNode() literalNode { return literalNode{math.MaxUint16, math.MaxInt32} }
279 h.freqcache = make([]literalNode, maxNumLit+1)
287 list[count] = literalNode{uint16(i), f}
290 list[count] = literalNode{}
294 list[len(freq)] = literalNode{}
314 type byLiteral []literalNode
316 func (s *byLiteral) sort(a []literalNode) { argument
329 type byFreq []literalNode
[all …]
/dports/lang/go-devel/go-dragonfly-amd64-bootstrap/src/compress/flate/
H A Dhuffman_code.go20 freqcache []literalNode
26 type literalNode struct { struct
57 func maxNode() literalNode { return literalNode{math.MaxUint16, math.MaxInt32} }
279 h.freqcache = make([]literalNode, maxNumLit+1)
287 list[count] = literalNode{uint16(i), f}
290 list[count] = literalNode{}
294 list[len(freq)] = literalNode{}
314 type byLiteral []literalNode
316 func (s *byLiteral) sort(a []literalNode) { argument
329 type byFreq []literalNode
[all …]
/dports/lang/gcc11-devel/gcc-11-20211009/libgo/go/compress/flate/
H A Dhuffman_code.go20 freqcache []literalNode
26 type literalNode struct { struct
57 func maxNode() literalNode { return literalNode{math.MaxUint16, math.MaxInt32} }
279 h.freqcache = make([]literalNode, maxNumLit+1)
287 list[count] = literalNode{uint16(i), f}
290 list[count] = literalNode{}
294 list[len(freq)] = literalNode{}
314 type byLiteral []literalNode
316 func (s *byLiteral) sort(a []literalNode) { argument
329 type byFreq []literalNode
[all …]
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/libgo/go/compress/flate/
H A Dhuffman_code.go20 freqcache []literalNode
26 type literalNode struct { struct
57 func maxNode() literalNode { return literalNode{math.MaxUint16, math.MaxInt32} }
279 h.freqcache = make([]literalNode, maxNumLit+1)
287 list[count] = literalNode{uint16(i), f}
290 list[count] = literalNode{}
294 list[len(freq)] = literalNode{}
314 type byLiteral []literalNode
316 func (s *byLiteral) sort(a []literalNode) { argument
329 type byFreq []literalNode
[all …]
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/libgo/go/compress/flate/
H A Dhuffman_code.go20 freqcache []literalNode
26 type literalNode struct { struct
57 func maxNode() literalNode { return literalNode{math.MaxUint16, math.MaxInt32} }
279 h.freqcache = make([]literalNode, maxNumLit+1)
287 list[count] = literalNode{uint16(i), f}
290 list[count] = literalNode{}
294 list[len(freq)] = literalNode{}
314 type byLiteral []literalNode
316 func (s *byLiteral) sort(a []literalNode) { argument
329 type byFreq []literalNode
[all …]
/dports/lang/gcc9-devel/gcc-9-20211007/libgo/go/compress/flate/
H A Dhuffman_code.go20 freqcache []literalNode
26 type literalNode struct { struct
57 func maxNode() literalNode { return literalNode{math.MaxUint16, math.MaxInt32} }
279 h.freqcache = make([]literalNode, maxNumLit+1)
287 list[count] = literalNode{uint16(i), f}
290 list[count] = literalNode{}
294 list[len(freq)] = literalNode{}
314 type byLiteral []literalNode
316 func (s *byLiteral) sort(a []literalNode) { argument
329 type byFreq []literalNode
[all …]
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/libgo/go/compress/flate/
H A Dhuffman_code.go20 freqcache []literalNode
26 type literalNode struct { struct
57 func maxNode() literalNode { return literalNode{math.MaxUint16, math.MaxInt32} }
279 h.freqcache = make([]literalNode, maxNumLit+1)
287 list[count] = literalNode{uint16(i), f}
290 list[count] = literalNode{}
294 list[len(freq)] = literalNode{}
314 type byLiteral []literalNode
316 func (s *byLiteral) sort(a []literalNode) { argument
329 type byFreq []literalNode
[all …]
/dports/www/filtron/filtron-93f8b22/vendor/github.com/klauspost/compress/flate/
H A Dhuffman_code.go20 freqcache []literalNode
26 type literalNode struct { struct
57 func maxNode() literalNode { return literalNode{math.MaxUint16, math.MaxInt32} }
281 h.freqcache = make([]literalNode, maxNumLit+1)
289 list[count] = literalNode{uint16(i), f}
292 list[count] = literalNode{}
296 list[len(freq)] = literalNode{}
316 type byLiteral []literalNode
318 func (s *byLiteral) sort(a []literalNode) { argument
331 type byFreq []literalNode
[all …]
/dports/devel/riscv64-gcc/gcc-8.3.0/libgo/go/compress/flate/
H A Dhuffman_code.go20 freqcache []literalNode
26 type literalNode struct { struct
57 func maxNode() literalNode { return literalNode{math.MaxUint16, math.MaxInt32} }
279 h.freqcache = make([]literalNode, maxNumLit+1)
287 list[count] = literalNode{uint16(i), f}
290 list[count] = literalNode{}
294 list[len(freq)] = literalNode{}
314 type byLiteral []literalNode
316 func (s *byLiteral) sort(a []literalNode) { argument
329 type byFreq []literalNode
[all …]
/dports/devel/avr-gcc/gcc-10.2.0/libgo/go/compress/flate/
H A Dhuffman_code.go20 freqcache []literalNode
26 type literalNode struct { struct
57 func maxNode() literalNode { return literalNode{math.MaxUint16, math.MaxInt32} }
279 h.freqcache = make([]literalNode, maxNumLit+1)
287 list[count] = literalNode{uint16(i), f}
290 list[count] = literalNode{}
294 list[len(freq)] = literalNode{}
314 type byLiteral []literalNode
316 func (s *byLiteral) sort(a []literalNode) { argument
329 type byFreq []literalNode
[all …]
/dports/lang/gcc11/gcc-11.2.0/libgo/go/compress/flate/
H A Dhuffman_code.go20 freqcache []literalNode
26 type literalNode struct { struct
57 func maxNode() literalNode { return literalNode{math.MaxUint16, math.MaxInt32} }
279 h.freqcache = make([]literalNode, maxNumLit+1)
287 list[count] = literalNode{uint16(i), f}
290 list[count] = literalNode{}
294 list[len(freq)] = literalNode{}
314 type byLiteral []literalNode
316 func (s *byLiteral) sort(a []literalNode) { argument
329 type byFreq []literalNode
[all …]
/dports/lang/gcc10-devel/gcc-10-20211008/libgo/go/compress/flate/
H A Dhuffman_code.go20 freqcache []literalNode
26 type literalNode struct { struct
57 func maxNode() literalNode { return literalNode{math.MaxUint16, math.MaxInt32} }
279 h.freqcache = make([]literalNode, maxNumLit+1)
287 list[count] = literalNode{uint16(i), f}
290 list[count] = literalNode{}
294 list[len(freq)] = literalNode{}
314 type byLiteral []literalNode
316 func (s *byLiteral) sort(a []literalNode) { argument
329 type byFreq []literalNode
[all …]
/dports/lang/gcc9/gcc-9.4.0/libgo/go/compress/flate/
H A Dhuffman_code.go20 freqcache []literalNode
26 type literalNode struct { struct
57 func maxNode() literalNode { return literalNode{math.MaxUint16, math.MaxInt32} }
279 h.freqcache = make([]literalNode, maxNumLit+1)
287 list[count] = literalNode{uint16(i), f}
290 list[count] = literalNode{}
294 list[len(freq)] = literalNode{}
314 type byLiteral []literalNode
316 func (s *byLiteral) sort(a []literalNode) { argument
329 type byFreq []literalNode
[all …]
/dports/misc/cxx_atomics_pic/gcc-11.2.0/libgo/go/compress/flate/
H A Dhuffman_code.go20 freqcache []literalNode
26 type literalNode struct { struct
57 func maxNode() literalNode { return literalNode{math.MaxUint16, math.MaxInt32} }
279 h.freqcache = make([]literalNode, maxNumLit+1)
287 list[count] = literalNode{uint16(i), f}
290 list[count] = literalNode{}
294 list[len(freq)] = literalNode{}
314 type byLiteral []literalNode
316 func (s *byLiteral) sort(a []literalNode) { argument
329 type byFreq []literalNode
[all …]
/dports/benchmarks/bombardier/bombardier-1.2.5/vendor/github.com/klauspost/compress/flate/
H A Dhuffman_code.go19 freqcache []literalNode
25 type literalNode struct { struct
56 func maxNode() literalNode { return literalNode{math.MaxUint16, math.MaxInt32} }
278 h.freqcache = make([]literalNode, maxNumLit+1)
286 list[count] = literalNode{uint16(i), f}
289 list[count] = literalNode{}
293 list[len(freq)] = literalNode{}
313 type byLiteral []literalNode
315 func (s *byLiteral) sort(a []literalNode) { argument
328 type byFreq []literalNode
[all …]
/dports/sysutils/jest/jest-f76bc46/vendor/github.com/klauspost/compress/flate/
H A Dhuffman_code.go20 freqcache []literalNode
26 type literalNode struct { struct
57 func maxNode() literalNode { return literalNode{math.MaxUint16, math.MaxInt32} }
281 h.freqcache = make([]literalNode, maxNumLit+1)
289 list[count] = literalNode{uint16(i), f}
292 list[count] = literalNode{}
296 list[len(freq)] = literalNode{}
316 type byLiteral []literalNode
318 func (s *byLiteral) sort(a []literalNode) { argument
331 type byFreq []literalNode
[all …]
/dports/lang/gcc9-aux/gcc-9.1.0/libgo/go/compress/flate/
H A Dhuffman_code.go20 freqcache []literalNode
26 type literalNode struct { struct
57 func maxNode() literalNode { return literalNode{math.MaxUint16, math.MaxInt32} }
279 h.freqcache = make([]literalNode, maxNumLit+1)
287 list[count] = literalNode{uint16(i), f}
290 list[count] = literalNode{}
294 list[len(freq)] = literalNode{}
314 type byLiteral []literalNode
316 func (s *byLiteral) sort(a []literalNode) { argument
329 type byFreq []literalNode
[all …]
/dports/devel/bit/bit-1.1.2/vendor/github.com/klauspost/compress/flate/
H A Dhuffman_code.go19 freqcache []literalNode
25 type literalNode struct { struct
56 func maxNode() literalNode { return literalNode{math.MaxUint16, math.MaxInt32} }
278 h.freqcache = make([]literalNode, maxNumLit+1)
286 list[count] = literalNode{uint16(i), f}
289 list[count] = literalNode{}
293 list[len(freq)] = literalNode{}
313 type byLiteral []literalNode
315 func (s *byLiteral) sort(a []literalNode) { argument
328 type byFreq []literalNode
[all …]
/dports/www/morty/morty-0.2.0-12-gfe94d9a/vendor/github.com/klauspost/compress/flate/
H A Dhuffman_code.go20 freqcache []literalNode
26 type literalNode struct { struct
57 func maxNode() literalNode { return literalNode{math.MaxUint16, math.MaxInt32} }
281 h.freqcache = make([]literalNode, maxNumLit+1)
289 list[count] = literalNode{uint16(i), f}
292 list[count] = literalNode{}
296 list[len(freq)] = literalNode{}
316 type byLiteral []literalNode
318 func (s *byLiteral) sort(a []literalNode) { argument
331 type byFreq []literalNode
[all …]
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/codegen/
H A DFoldConstants.java82 if (literalNode != null) { in leaveUnaryNode()
83 log.info("Unary constant folded ", unaryNode, " to ", literalNode); in leaveUnaryNode()
84 return literalNode; in leaveUnaryNode()
92 if (literalNode != null) { in leaveBinaryNode()
93 log.info("Binary constant folded ", binaryNode, " to ", literalNode); in leaveBinaryNode()
94 return literalNode; in leaveBinaryNode()
231 LiteralNode<?> literalNode; in eval() local
238 literalNode = LiteralNode.newInstance(token, finish, rhs.getLong()); in eval()
253 literalNode = LiteralNode.newInstance(token, finish, !rhs.getBoolean()); in eval()
256 literalNode = LiteralNode.newInstance(token, finish, ~rhs.getInt32()); in eval()
[all …]

1234567