Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 229 for splice (0.04 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. src/main/webapp/js/jquery-3.7.1.min.js

    G(){}function Y(e,t){var n,r,i,o,a,s,u,l=c[e+" "];if(l)return t?0:l.slice(0);a=e,s=[],u=b.preFilter;while(a){for(o in n&&!(r=y.exec(a))||(r&&(a=a.slice(r[0].length)||a),s.push(i=[])),n=!1,(r=m.exec(a))&&(n=r.shift(),i.push({value:n,type:r[0].replace(ve," ")}),a=a.slice(n.length)),b.filter)!(r=D[o].exec(a))||u[o]&&!(r=u[o](r))||(n=r.shift(),i.push({value:n,type:o,matches:r}),a=a.slice(n.length));if(!n)break}return t?a.length:a?I.error(e):c(e,s).slice(0)}function Q(e){for(var t=0,n=e.length,r="";t<n;t++)r+=e[t].value;return...
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Oct 26 01:07:52 GMT 2024
    - 85.5K bytes
    - Click Count (0)
  2. src/main/webapp/js/admin/jquery-3.7.1.min.js

    G(){}function Y(e,t){var n,r,i,o,a,s,u,l=c[e+" "];if(l)return t?0:l.slice(0);a=e,s=[],u=b.preFilter;while(a){for(o in n&&!(r=y.exec(a))||(r&&(a=a.slice(r[0].length)||a),s.push(i=[])),n=!1,(r=m.exec(a))&&(n=r.shift(),i.push({value:n,type:r[0].replace(ve," ")}),a=a.slice(n.length)),b.filter)!(r=D[o].exec(a))||u[o]&&!(r=u[o](r))||(n=r.shift(),i.push({value:n,type:o,matches:r}),a=a.slice(n.length));if(!n)break}return t?a.length:a?I.error(e):c(e,s).slice(0)}function Q(e){for(var t=0,n=e.length,r="";t<n;t++)r+=e[t].value;return...
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Oct 26 01:07:52 GMT 2024
    - 85.5K bytes
    - Click Count (1)
  3. src/main/webapp/js/chat.js

                if (mimetype.indexOf('image') !== -1) return 'fa-file-image-o';
                if (mimetype.indexOf('text') !== -1) return 'fa-file-text-o';
            }
    
            if (url) {
                var ext = url.split('.').pop().toLowerCase().split('?')[0];
                switch (ext) {
                    case 'pdf': return 'fa-file-pdf-o';
                    case 'doc': case 'docx': return 'fa-file-word-o';
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Thu Mar 19 01:36:02 GMT 2026
    - 30.6K bytes
    - Click Count (0)
  4. src/main/webapp/js/purify.min.js

    n(e){for(var t=arguments.length,n=new Array(t>1?t-1:0),o=1;o<t;o++)n[o-1]=arguments[o];return new e(...n)});const u=D(Array.prototype.forEach),m=D(Array.prototype.lastIndexOf),p=D(Array.prototype.pop),f=D(Array.prototype.push),d=D(Array.prototype.splice),h=D(String.prototype.toLowerCase),g=D(String.prototype.toString),T=D(String.prototype.match),y=D(String.prototype.replace),E=D(String.prototype.indexOf),A=D(String.prototype.trim),_=D(Object.prototype.hasOwnProperty),b=D(RegExp.prototype.test),S...
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sun Mar 15 06:21:57 GMT 2026
    - 22.7K bytes
    - Click Count (0)
  5. src/main/webapp/js/jquery-3.7.1.min.map

    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Oct 26 01:07:52 GMT 2024
    - 131.6K bytes
    - Click Count (0)
  6. tests/upsert_test.go

    }
    
    func TestUpsertSlice(t *testing.T) {
    	langs := []Language{
    		{Code: "upsert-slice1", Name: "Upsert-slice1"},
    		{Code: "upsert-slice2", Name: "Upsert-slice2"},
    		{Code: "upsert-slice3", Name: "Upsert-slice3"},
    	}
    	DB.Clauses(clause.OnConflict{DoNothing: true}).Create(&langs)
    
    	var langs2 []Language
    	if err := DB.Find(&langs2, "code LIKE ?", "upsert-slice%").Error; err != nil {
    Created: Sun Apr 05 09:35:12 GMT 2026
    - Last Modified: Tue Jul 29 11:06:13 GMT 2025
    - 13.1K bytes
    - Click Count (0)
  7. src/bytes/bytes.go

    // It splits the slice s around each instance of one or more consecutive white space
    // characters, as defined by [unicode.IsSpace], returning a slice of subslices of s or an
    // empty slice if s contains only white space. Every element of the returned slice is
    // non-empty. Unlike [Split], leading and trailing runs of white space characters
    // are discarded.
    func Fields(s []byte) [][]byte {
    	// First count the fields.
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Mar 12 17:56:55 GMT 2026
    - 36.3K bytes
    - Click Count (0)
  8. tests/helper_test.go

    		if len(user.Pets) != len(expect.Pets) {
    			t.Fatalf("pets should equal, expect: %v, got %v", len(expect.Pets), len(user.Pets))
    		}
    
    		sort.Slice(user.Pets, func(i, j int) bool {
    			return user.Pets[i].ID > user.Pets[j].ID
    		})
    
    		sort.Slice(expect.Pets, func(i, j int) bool {
    			return expect.Pets[i].ID > expect.Pets[j].ID
    		})
    
    		for idx, pet := range user.Pets {
    Created: Sun Apr 05 09:35:12 GMT 2026
    - Last Modified: Sat Mar 21 11:27:38 GMT 2026
    - 8.6K bytes
    - Click Count (0)
  9. guava-tests/test/com/google/common/io/ByteSourceTester.java

      public void testSlice_constrainedRange() throws IOException {
        long size = source.read().length;
        if (size >= 2) {
          ByteSource sliced = source.slice(1, size - 2);
          assertEquals(size - 2, sliced.read().length);
          ByteSource resliced = sliced.slice(0, size - 1);
          assertTrue(sliced.contentEquals(resliced));
        }
      }
    
      private void assertExpectedBytes(byte[] readBytes) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 19 18:53:45 GMT 2026
    - 8.6K bytes
    - Click Count (0)
  10. src/bytes/bytes_test.go

    		if string(s) != tt.s {
    			t.Errorf(`Join(Split(%q, %q, %d), %q) = %q`, tt.s, tt.sep, tt.n, tt.sep, s)
    		}
    		if tt.n < 0 {
    			b := sliceOfString(Split([]byte(tt.s), []byte(tt.sep)))
    			if !slices.Equal(result, b) {
    				t.Errorf("Split disagrees with SplitN(%q, %q, %d) = %v; want %v", tt.s, tt.sep, tt.n, b, a)
    			}
    		}
    		if len(a) > 0 {
    			in, out := a[0], s
    			if cap(in) == cap(out) && &in[:1][0] == &out[:1][0] {
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Wed Mar 11 03:07:05 GMT 2026
    - 62.9K bytes
    - Click Count (0)
Back to Top