Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for NewPointerSlice (0.24 sec)

  1. src/go/doc/testdata/issue22856.1.golden

    	// 
    	func New() T
    
    	// 
    	func NewArray() [1]T
    
    	// 
    	func NewPointer() *T
    
    	// 
    	func NewPointerArray() [1]*T
    
    	// 
    	func NewPointerOfPointer() **T
    
    	// 
    	func NewPointerSlice() []*T
    
    	// 
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Jun 12 16:37:37 UTC 2018
    - 654 bytes
    - Viewed (0)
  2. src/go/doc/testdata/issue22856.0.golden

    	// 
    	func New() T
    
    	// 
    	func NewArray() [1]T
    
    	// 
    	func NewPointer() *T
    
    	// 
    	func NewPointerArray() [1]*T
    
    	// 
    	func NewPointerOfPointer() **T
    
    	// 
    	func NewPointerSlice() []*T
    
    	// 
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Jun 12 16:37:37 UTC 2018
    - 654 bytes
    - Viewed (0)
  3. src/go/doc/testdata/issue22856.2.golden

    	// 
    	func New() T
    
    	// 
    	func NewArray() [1]T
    
    	// 
    	func NewPointer() *T
    
    	// 
    	func NewPointerArray() [1]*T
    
    	// 
    	func NewPointerOfPointer() **T
    
    	// 
    	func NewPointerSlice() []*T
    
    	// 
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Jun 12 16:37:37 UTC 2018
    - 654 bytes
    - Viewed (0)
  4. src/go/doc/testdata/issue22856.go

    // license that can be found in the LICENSE file.
    
    package issue22856
    
    type T struct{}
    
    func New() T                   { return T{} }
    func NewPointer() *T           { return &T{} }
    func NewPointerSlice() []*T    { return []*T{&T{}} }
    func NewSlice() []T            { return []T{T{}} }
    func NewPointerOfPointer() **T { x := &T{}; return &x }
    func NewArray() [1]T           { return [1]T{T{}} }
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Jun 12 16:37:37 UTC 2018
    - 1.1K bytes
    - Viewed (0)
Back to top