Searched refs:complexity (Results 1 – 9 of 9) sorted by relevance
107 int complexity = sUserToComplexityMap.getOrDefault(userId, in getRequestedPasswordComplexity() local110 complexity = Math.max(complexity, sUserToProfileComplexityMap.getOrDefault(userId, in getRequestedPasswordComplexity()113 return complexity; in getRequestedPasswordComplexity()116 public static void setRequiredPasswordComplexity(int userHandle, int complexity) { in setRequiredPasswordComplexity() argument117 sUserToComplexityMap.put(userHandle, complexity); in setRequiredPasswordComplexity()120 public static void setRequiredPasswordComplexity(int complexity) { in setRequiredPasswordComplexity() argument121 sUserToComplexityMap.put(UserHandle.myUserId(), complexity); in setRequiredPasswordComplexity() local124 public static void setRequiredProfilePasswordComplexity(int complexity) { in setRequiredProfilePasswordComplexity() argument125 sUserToProfileComplexityMap.put(UserHandle.myUserId(), complexity); in setRequiredProfilePasswordComplexity() local
117 public Builder setAppRequestedMinComplexity(int complexity) { in setAppRequestedMinComplexity() argument118 mAppRequestedMinComplexity = complexity; in setAppRequestedMinComplexity()273 int complexity = Math.max(mAppRequestedMinComplexity, in getAggregatedPasswordComplexity() local277 complexity = Math.max(complexity, in getAggregatedPasswordComplexity()280 return complexity; in getAggregatedPasswordComplexity()
464 * `bool RemoveMember(const Ch* name)`: Remove a member by search its name (linear time complexity).466 …erIterator RemoveMember(MemberIterator)`: Remove a member by iterator (_constant_ time complexity).467 …(MemberIterator)`: similar to the above but it preserves order of members (linear time complexity).468 … first, MemberIterator last)`: remove a range of members, preserves order (linear time complexity).470 …ber(MemberIterator)` uses a "move-last" trick to achieve constant time complexity. Basically the m…504 Swapping two DOM trees is fast (constant time), despite the complexity of the trees.
115 `kParseIterativeFlag` | Iterative(constant complexity in terms of function call stack size)…
177 …gth of string needs to be computed via `strlen()`, with linear runtime complexity. This incurs an …
11 complexity.
1dictionary=main:en_gb,locale=en_GB,description=English (UK),date ...
1dictionary=main:en,locale=en,description=English,date=1414726273, ...