PipeSndQueue (Neta Core 1.0.1 API)

跳过导航链接

所有类

概要:
嵌套 |
字段 |
构造器 |
方法

详细资料:
字段 |
构造器 |
方法

所有已知实现类:

PipeQueue
```
public interface PipeSndQueue<T>
```
The network protocol layer outputs the data queue of the endpoint

版本:

: 2023-10-17

作者:

赵永春 (zyc@hasor.net)

另请参阅:

PipeRcvQueue

方法概要

所有方法实例方法抽象方法默认方法
限定符和类型	方法和说明
`int`	`getCapacity()` Returns the number of capacity.
`default boolean`	`hasSlot()` can be writer
`int`	`offerMessage(List<T> offerList)` offer message to queue, return accept count.
`int`	`offerMessage(PipeRcvQueue<T> offerList)` offer message to queue, return accept count.
`default boolean`	`offerMessage(T offerMessage)` offer message to queue, return accept status.
`int`	`offerMessage(T[] offerList)` offer message to queue, return accept count.
`int`	`slotSize()` The number of writable slots, default is Integer.MAX.
`PipeSndQueue<T>`	`sndReset()` delete the one you just `offerMessage(List)` data.
`PipeSndQueue<T>`	`sndSubmit()` marks slots locke them in this Queue, `sndReset()` will not affect them.

- 方法详细资料
  - getCapacity
```
int getCapacity()
```
    Returns the number of capacity.
  - slotSize
```
int slotSize()
```
    The number of writable slots, default is Integer.MAX.
  - hasSlot
```
default boolean hasSlot()
```
    can be writer
  - sndSubmit
```
PipeSndQueue<T> sndSubmit()
```
    marks slots locke them in this Queue, sndReset() will not affect them.
  - sndReset
```
PipeSndQueue<T> sndReset()
```
    delete the one you just offerMessage(List) data.
  - offerMessage
```
int offerMessage(T[] offerList)
```
    offer message to queue, return accept count.
  - offerMessage
```
int offerMessage(List<T> offerList)
```
    offer message to queue, return accept count.
  - offerMessage
```
int offerMessage(PipeRcvQueue<T> offerList)
```
    offer message to queue, return accept count.
  - offerMessage
```
default boolean offerMessage(T offerMessage)
```
    offer message to queue, return accept status.

跳过导航链接

所有类

概要:
嵌套 |
字段 |
构造器 |
方法

详细资料:
字段 |
构造器 |
方法

Copyright © 2022–2024. All rights reserved.