Search Options

Results per page
Sort
Preferred Languages
Advance

Results 171 - 180 of 276 for buf1 (0.03 sec)

  1. src/main/java/jcifs/util/Encdec.java

        }
    
    
        public static String dec_ucs2le ( byte[] src, int si, int slim, char[] buf ) {
            int bi;
    
            for ( bi = 0; ( si + 1 ) < slim; bi++, si += 2 ) {
                buf[ bi ] = (char) dec_uint16le(src, si);
                if ( buf[ bi ] == '\0' ) {
                    break;
                }
            }
    
            return new String(buf, 0, bi);
        }
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Sun Jul 01 13:12:10 UTC 2018
    - 11K bytes
    - Viewed (0)
  2. src/test/java/jcifs/tests/NamingTest.java

            ByteBuffer buf = ByteBuffer.allocate(128);
            Arrays.sort(excludes);
            for ( int i = 128; i < 255; i++ ) {
                int idx = Arrays.binarySearch(excludes, i);
                if ( idx < 0 || excludes[ idx ] == i ) {
                    continue;
                }
    
                if ( i == 240 ) {
                    continue;
                }
                buf.put((byte) i);
            }
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Sat Jun 06 10:48:05 UTC 2020
    - 7K bytes
    - Viewed (0)
  3. cmd/erasure-encode.go

    func (e *Erasure) Encode(ctx context.Context, src io.Reader, writers []io.Writer, buf []byte, quorum int) (total int64, err error) {
    	writer := &multiWriter{
    		writers:     writers,
    		writeQuorum: quorum,
    		errs:        make([]error, len(writers)),
    	}
    
    	for {
    		var blocks [][]byte
    		n, err := io.ReadFull(src, buf)
    		if err != nil {
    			if !IsErrIgnored(err, []error{
    				io.EOF,
    				io.ErrUnexpectedEOF,
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed May 15 00:11:04 UTC 2024
    - 2.9K bytes
    - Viewed (0)
  4. src/main/java/org/codelibs/fess/helper/SystemHelper.java

            final StringBuilder buf = new StringBuilder();
            updateConfigListenerMap.entrySet().stream().forEach(e -> {
                buf.append(e.getKey()).append(": ");
                try {
                    buf.append(e.getValue().get());
                } catch (final Exception ex) {
                    logger.warn("Failed to process {} task.", e.getKey(), ex);
                    buf.append(ex.getMessage());
                }
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Thu Oct 17 12:10:08 UTC 2024
    - 27.2K bytes
    - Viewed (0)
  5. src/main/java/org/codelibs/fess/crawler/transformer/FessXpathTransformer.java

                    parseTextContent(node, buf);
                }
            } catch (final Exception e) {
                logger.warn("Could not parse a value of {}", xpath);
            }
            if (buf == null) {
                return null;
            }
            return buf.toString().trim();
        }
    
        protected void parseTextContent(final Node node, final StringBuilder buf) {
            if (node.hasChildNodes()) {
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Thu Oct 24 13:01:38 UTC 2024
    - 42.9K bytes
    - Viewed (0)
  6. src/main/java/org/codelibs/fess/app/web/admin/maintenance/AdminMaintenanceAction.java

                    if (buf.length() > 0) {
                        buf.append(" : ");
                    }
                    buf.append(ip);
                }
            } catch (final Exception e) {
                // ignore
            }
            return buf.toString();
        }
    
        protected boolean isLogFilename(final String name) {
            return name.endsWith(".log") || name.endsWith(".log.gz");
        }
    
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Fri Oct 11 21:20:39 UTC 2024
    - 14K bytes
    - Viewed (0)
  7. internal/bpool/bpool.go

    		w:    width,
    		wcap: capwidth,
    	}
    }
    
    // Populate - populates and pre-warms the byte pool, this function is non-blocking.
    func (bp *BytePoolCap) Populate() {
    	for _, buf := range reedsolomon.AllocAligned(cap(bp.c), bp.wcap) {
    		bp.Put(buf[:bp.w])
    	}
    }
    
    // Get gets a []byte from the BytePool, or creates a new one if none are
    // available in the pool.
    func (bp *BytePoolCap) Get() (b []byte) {
    	if bp == nil {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Aug 29 01:40:52 UTC 2024
    - 3K bytes
    - Viewed (0)
  8. src/main/java/org/codelibs/fess/exec/Crawler.java

                final StringBuilder buf = new StringBuilder(500);
                for (final Map.Entry<String, String> entry : infoMap.entrySet()) {
                    if (buf.length() != 0) {
                        buf.append(',');
                    }
                    buf.append(entry.getKey()).append('=').append(entry.getValue());
                }
    Registered: Thu Oct 31 13:40:30 UTC 2024
    - Last Modified: Fri Oct 11 21:20:39 UTC 2024
    - 24K bytes
    - Viewed (0)
  9. src/main/java/jcifs/smb1/util/MimeMap.java

        }
        public String getMimeType( String extension, String def ) throws IOException {
            int state, t, x, i, off;
            byte ch;
            byte[] type = new byte[128];
            byte[] buf = new byte[16];
            byte[] ext = extension.toLowerCase().getBytes( "ASCII" );
    
            state = ST_START;
            t = x = i = 0;
            for( off = 0; off < inLen; off++ ) {
                ch = in[off];
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Fri Mar 22 20:39:42 UTC 2019
    - 4.2K bytes
    - Viewed (0)
  10. src/main/java/jcifs/BufferCache.java

        /**
         * 
         * @return a buffer from the cache, or a new one
         */
        byte[] getBuffer ();
    
    
        /**
         * Return a buffer to the cache
         * 
         * @param buf
         */
        void releaseBuffer ( byte[] buf );
    
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Sun Jul 01 13:12:10 UTC 2018
    - 1.1K bytes
    - Viewed (0)
Back to top