This is the recommended read size since most event occurrence data will be less than 4K.
这是推荐的读取大小，因为大多数事件发生数据都少于4K。
The sample program checks for the error format in the event occurrence data if the select() call returned an error.
示例程序在事件发生数据中检查错误格式，判断select()调用是否返回了错误。
In this case, the keyword EVENT_OVERFLOW will be written to the buffer, with as much event occurrence data as can fit inside the buffer.
在这种情况下，会把关键字event_overflow写入缓冲区，并写入缓冲区能够容纳的尽可能多的事件发生数据。
It compares the expected value to the actual value read from the event occurrence data to determine if duplicate events were consolidated.
它会比较预期的值和从事件发生数据读取的实际值，从而判断是否整合了重复事件。
If the consumer is using a very small buffer, there is a possibility that the event data from one event occurrence may be larger than the buffer.
如果消费者使用非常小的缓冲区，一个事件发生的事件数据可能会超过缓冲区。
The probability of event occurrence in a movable teeth drive is described by fuzzy number. The fuzzy fault tree analysis of a swing movab…
用模糊数表示活齿传动中各事件发生的概率，对摆动活齿传动系统进行了模糊故障树分析。
Now, when an event of type t1 occurs on that widget, first Filter 1 is informed of the event occurrence, followed by Listener 1, then Listener 2.
现在，当这个控件上产生一个t1类型的事件时，第一个接收到发生该事件的通知的是Filter1，然后是Listener 1，最后是Listener2。
Once the monitoring application attempts another select or blocking read , those calls will return immediately since there is unread event occurrence data waiting in the buffer.
当监视应用程序试图执行另一次select或阻塞的read调用时，这些调用会立即返回，因为缓冲区中有未读的事件发生数据。
The probability of event occurrence in a movable teeth drive is described by fuzzy number. The fuzzy fault tree analysis of a swing movable teeth transmission system is conducted.
用模糊数表示活齿传动中各事件发生的概率，对摆动活齿传动系统进行了模糊故障树分析。
This is followed by notification of event occurrence to all listeners of the widget registered for that same event type and in the order in which the listeners were registered on widget.
然后发生该事件的通知会发送给控件中为该事件类型注册的所有监听器，发送顺序是这些监听器在控件上的注册顺序。
Then this thesis presents a new approach to solve top event occurrence rate and a new generation algorithm of minimal cut sequence of dynamic fault tree that deviate from Markov model completely.
提出了一种完全脱离马尔可夫模型的求解动态故障树顶事件发生概率的方法和一种最小顺序割集的生成方法。
Then this thesis presents a new approach to solve top event occurrence rate and a new generation algorithm of minimal cut sequence of dynamic fault tree that deviate from Markov model completely.
提出了一种完全脱离马尔可夫模型的求解动态故障树顶事件发生概率的方法和一种最小顺序割集的生成方法。
应用推荐