You can try something like this if(is_a($images, ‘Illuminate\Database\Eloquent\Collection’)) { ….do whatever for a collection…. } else { ….do whatever for not a collection…. } Or if ($images instanceof \Illuminate\Database\Eloquent\Collection) { ….do whatever for a collection…. }
What do you mean by better way: more readable: List<String> list = new ArrayList<String>(Arrays.asList(array)); less memory consumption, and maybe faster (but definitely not thread safe): public static List<String> toList(String[] array) { if (array==null) { return new ArrayList(0); } else { int size = array.length; List<String> list = new ArrayList(size); for(int i = 0; i < … Read more
ListA.Where(a => ListX.Any(x => x.b == a.b))
All that defaultdict requires is a callable object that will return what should be used as a default value when called with no parameters. If you were to call the int constructor, it would return 0 and if you were to call lambda: 0, it would return 0. Same with the lists. The only difference … Read more
If you just return an actual List<T> as an IReadOnlyList<T>, then the caller can always just cast it back, and then modify the list as they please. Conversely, calling AsReadOnly() creates a read-only wrapper of the list, which consumers can’t update. Note that the read-only wrapper will reflect changes made to the underlying list, so … Read more
If you look at the docs of the HashMap#keySet() method, you’ll get your answer(emphasis mine). Returns a Set view of the keys contained in this map. The set is backed by the map, so changes to the map are reflected in the set, and vice-versa. If the map is modified while an iteration over the … Read more
I would read the source of ConcurrentHashMap as it is rather complicated in the detail. In short it has Multiple partitions which can be locked independently. (16 by default) Using concurrent Locks operations for thread safety instead of synchronized. Has thread safe Iterators. synchronizedCollection’s iterators are not thread safe. Does not expose the internal locks. … Read more
here is my “1liner”: Collections.sort(agentDtoList, new Comparator<AgentSummaryDTO>(){ public int compare(AgentSummaryDTO o1, AgentSummaryDTO o2){ return o1.getCustomerCount() – o2.getCustomerCount(); } }); UPDATE for Java 8: For int datatype Collections.sort(agentDtoList, (o1, o2) -> o1.getCustomerCount() – o2.getCustomerCount()); or even: Collections.sort(agentDtoList, Comparator.comparing(AgentSummaryDTO::getCustomerCount)); For String datatype (as in comment) Collections.sort(list, (o1, o2) -> (o1.getAgentName().compareTo(o2.getAgentName()))); ..it expects getter AgentSummaryDTO.getCustomerCount()
Since Groovy 2.4.0 there is a withIndex() method which gets added to java.lang.Iterable. So, in a functional fashion (no side effect, immutable), it looks like def myList = [ [position: 0, name: ‘Bob’], [position: 0, name: ‘John’], [position: 0, name: ‘Alex’], ] def result = myList.withIndex().collect { element, index -> [position: index, name: element[“name”]] }
If you mean the collection, then just as: var asEnumerable = i as IEnumerable<int>; if(asEnumerable != null) { … } However, I’m assuming (from the example) that you have a Type: The object will never be “of” type IEnumerable<int> – but it might implement it; I would expect that: if(typeof(IEnumerable<int>).IsAssignableFrom(type)) {…} would do. If you … Read more