Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 27 for Elem (0.01 sec)

  1. src/test/java/org/codelibs/fess/it/admin/CrawlerLogTests.java

            for (Map<String, Object> elem : jobLogList) {
                deleteMethod("/api/admin/joblog/log/" + elem.get("id"));
            }
    
            final List<Map<String, Object>> crawlingInfoList = readCrawlingInfo(webConfigId);
            for (Map<String, Object> elem : crawlingInfoList) {
                deleteMethod("/api/admin/crawlinginfo/log/" + elem.get("id"));
            }
    
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Mar 15 06:53:53 UTC 2025
    - 9.1K bytes
    - Viewed (0)
  2. schema/utils.go

    	case reflect.Slice, reflect.Array:
    		for i := 0; i < reflectValue.Len(); i++ {
    			elem := reflectValue.Index(i)
    			elemKey := elem.Interface()
    			if elem.Kind() != reflect.Ptr && elem.CanAddr() {
    				elemKey = elem.Addr().Interface()
    			}
    
    			if _, ok := loaded[elemKey]; ok {
    				continue
    			}
    			loaded[elemKey] = true
    
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Thu Feb 13 06:16:26 UTC 2025
    - 5.5K bytes
    - Viewed (0)
  3. cmd/last-minute.go

    }
    
    // Merge all recorded latencies of last minute into one
    func (l *lastMinuteLatency) getTotal() AccElem {
    	var res AccElem
    	sec := time.Now().Unix()
    	l.forwardTo(sec)
    	for _, elem := range l.Totals[:] {
    		res.merge(elem)
    	}
    	return res
    }
    
    // forwardTo time t, clearing any entries in between.
    func (l *lastMinuteLatency) forwardTo(t int64) {
    	if l.LastSec >= t {
    		return
    	}
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Wed Jul 05 17:40:45 UTC 2023
    - 4.8K bytes
    - Viewed (0)
  4. utils/utils_test.go

    		name  string
    		elems []string
    		elem  string
    		out   bool
    	}{
    		{"exists", []string{"1", "2", "3"}, "1", true},
    		{"not exists", []string{"1", "2", "3"}, "4", false},
    	}
    	for _, test := range containsTests {
    		t.Run(test.name, func(t *testing.T) {
    			if out := Contains(test.elems, test.elem); test.out != out {
    				t.Errorf("Contains(%v, %s) want: %t, got: %t", test.elems, test.elem, test.out, out)
    			}
    		})
    	}
    }
    
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Thu Aug 22 11:03:42 UTC 2024
    - 4.9K bytes
    - Viewed (0)
  5. docs/sts/client_grants/sts_element.py

                    )
                )
    
        def findall(self, name):
            """Similar to ElementTree.Element.findall()
    
            """
            return [
                STSElement(self.root_name, elem)
                for elem in self.element.findall('sts:{}'.format(name), _STS_NS)
            ]
    
        def find(self, name):
            """Similar to ElementTree.Element.find()
    
            """
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Apr 23 18:58:53 UTC 2021
    - 2.5K bytes
    - Viewed (0)
  6. schema/serializer.go

    			if err != nil {
    				return err
    			}
    		}
    
    		if len(bytes) > 0 {
    			err = json.Unmarshal(bytes, fieldValue.Interface())
    		}
    	}
    
    	field.ReflectValueOf(ctx, dst).Set(fieldValue.Elem())
    	return
    }
    
    // Value implements serializer interface
    func (JSONSerializer) Value(ctx context.Context, field *Field, dst reflect.Value, fieldValue interface{}) (interface{}, error) {
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Thu Jun 20 08:45:38 UTC 2024
    - 4.6K bytes
    - Viewed (0)
  7. utils/utils.go

    			if vv.IsValid() && !vv.IsZero() {
    				results[idx] = fmt.Sprint(reflect.Indirect(vv).Interface())
    			}
    		}
    	}
    
    	return strings.Join(results, "_")
    }
    
    func Contains(elems []string, elem string) bool {
    	for _, e := range elems {
    		if elem == e {
    			return true
    		}
    	}
    	return false
    }
    
    func AssertEqual(x, y interface{}) bool {
    	if reflect.DeepEqual(x, y) {
    		return true
    	}
    	if x == nil || y == nil {
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Thu Aug 22 11:03:42 UTC 2024
    - 4.1K bytes
    - Viewed (0)
  8. android/guava-testlib/src/com/google/common/collect/testing/google/MapGenerators.java

          // assumes that each set is a singleton or less (as is done for the samples)
          for (Object elem : elements) {
            @SuppressWarnings("unchecked") // safe by generator contract
            Entry<String, Collection<Integer>> entry = (Entry<String, Collection<Integer>>) elem;
            Integer value = getOnlyElement(entry.getValue());
            builder.put(entry.getKey(), value);
          }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Aug 10 19:54:19 UTC 2025
    - 8.6K bytes
    - Viewed (0)
  9. guava-testlib/src/com/google/common/collect/testing/google/MapGenerators.java

          // assumes that each set is a singleton or less (as is done for the samples)
          for (Object elem : elements) {
            @SuppressWarnings("unchecked") // safe by generator contract
            Entry<String, Collection<Integer>> entry = (Entry<String, Collection<Integer>>) elem;
            Integer value = getOnlyElement(entry.getValue());
            builder.put(entry.getKey(), value);
          }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Aug 10 19:54:19 UTC 2025
    - 8.6K bytes
    - Viewed (0)
  10. callbacks/update.go

    			db.Statement.ReflectValue = reflect.ValueOf(db.Statement.Model)
    			for db.Statement.ReflectValue.Kind() == reflect.Ptr {
    				db.Statement.ReflectValue = db.Statement.ReflectValue.Elem()
    			}
    
    			if dest, ok := db.Statement.Dest.(map[string]interface{}); ok {
    				for _, rel := range db.Statement.Schema.Relationships.BelongsTo {
    					if _, ok := dest[rel.Name]; ok {
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Sun May 25 07:40:40 UTC 2025
    - 9.6K bytes
    - Viewed (0)
Back to top