- Sort Score
- Result 10 results
- Languages All
Results 1 - 4 of 4 for Student (0.09 sec)
-
src/main/java/jcifs/netbios/NodeStatusResponse.java
private int numberOfNames; private final byte[] macAddress; private byte[] stats; NbtAddress[] addressArray; /* * It is a little awkward but prudent to pass the quering address * so that it may be included in the list of results. IOW we do * not want to create a new NbtAddress object for this particular
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 07:14:38 UTC 2025 - 5.8K bytes - Viewed (0) -
src/main/java/jcifs/smb1/netbios/NodeStatusResponse.java
private final NbtAddress queryAddress; private int numberOfNames; private final byte[] macAddress; private byte[] stats; NbtAddress[] addressArray; /* It is a little awkward but prudent to pass the quering address * so that it may be included in the list of results. IOW we do * not want to create a new NbtAddress object for this particular
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 07:14:38 UTC 2025 - 5.8K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/FuturesGetChecked.java
checkExceptionClassValidity(exceptionClass); /* * It's very unlikely that any loaded Futures class will see getChecked called with more * than a handful of exceptions. But it seems prudent to set a cap on how many we'll cache. * This avoids out-of-control memory consumption, and it keeps the cache from growing so * large that doing the lookup is noticeably slower than redoing the work would be.
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 10.2K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/FuturesGetChecked.java
checkExceptionClassValidity(exceptionClass); /* * It's very unlikely that any loaded Futures class will see getChecked called with more * than a handful of exceptions. But it seems prudent to set a cap on how many we'll cache. * This avoids out-of-control memory consumption, and it keeps the cache from growing so * large that doing the lookup is noticeably slower than redoing the work would be.
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 11.8K bytes - Viewed (0)