add after ary assign assignIn assignInWith assignWith at before bind bindAll bindKey camelCase capitalize castArray ceil chain chunk clamp clone cloneDeep cloneDeepWith cloneWith compact concat conformsTo countBy create curry curryRight debounce deburr defaults defaultsDeep defer delay difference divide drop dropRight each eachRight endsWith entries entriesIn eq escape every extend extendWith fill filter find findIndex findKey findLast findLastIndex findLastKey first flatMap flatMapDeep flatMapDepth flatten flattenDeep flattenDepth flip floor forEach forEachRight forIn forInRight forOwn forOwnRight fromPairs functions functionsIn get groupBy gt gte has hasIn head inRange includes indexOf initial intersection invert invertBy invoke invokeMap isArguments isArray isArrayBuffer isArrayLike isArrayLikeObject isBoolean isBuffer isDate isElement isEmpty isEqual isEqualWith isError isFinite isFunction isInteger isLength isMap isMatch isMatchWith isNaN isNative isNil isNull isNumber isObject isObjectLike isPlainObject isRegExp isSafeInteger isSet isString isSymbol isTypedArray isUndefined isWeakMap isWeakSet join kebabCase keyBy keys keysIn last lastIndexOf lowerCase lowerFirst lt lte map mapKeys mapValues max maxBy mean meanBy memoize merge mergeWith min minBy multiply negate nth omit omitBy once orderBy overArgs pad padEnd padStart parseInt partial partialRight partition pick pickBy pull pullAll pullAllBy pullAllWith pullAt random rearg reduce reduceRight reject remove repeat replace rest result reverse round sample sampleSize set setWith shuffle size slice snakeCase some sortBy sortedIndex sortedIndexOf sortedLastIndex sortedLastIndexOf sortedUniq split spread startCase startsWith subtract sum sumBy tail take takeRight tap template throttle thru toArray toFinite toInteger toLength toLower toNumber toPairs toPairsIn toPlainObject toSafeInteger toString toUpper transform trim trimEnd trimStart truncate unary unescape union uniq uniqBy uniqWith unset unzip unzipWith update updateWith upperCase upperFirst values valuesIn without words wrap wrapperAt wrapperChain wrapperCommit wrapperFlatMap wrapperLodash wrapperNext wrapperPlant wrapperReverse wrapperToIterator wrapperValue xor zip zipObject zipObjectDeep zipWith

Lodash _.partition



The lodash _.partition method is a useful utility function that helps to partition an array into two groups based on a predicate function. It returns an array of two sub-arrays where the first sub-array contains elements that pass the predicate function and the second sub-array contains elements that fail the predicate function.


_.partition(array, predicate)


  • array: The array to partition.
  • predicate: The function that is invoked per iteration. It returns true for elements that are to be included in the first sub-array, else false.


An array of two sub-arrays, where the first sub-array contains elements that pass the predicate function and the second sub-array contains elements that fail the predicate function.

Example usage:

const arr = [1, 2, 3, 4, 5, 6];

const [evenNumbers, oddNumbers] = _.partition(arr, (num) => num % 2 === 0);

console.log(evenNumbers); // [2, 4, 6]
console.log(oddNumbers); // [1, 3, 5]

In the example above, the _.partition method is used to partition an array of numbers into two sub-arrays, one containing even numbers and the other containing odd numbers.

Search engine optimization:

When using the lodash _.partition method, it is important to include the method name and relevant keywords in the content for search engine optimization. This helps to increase the visibility of the content on search engine results pages (SERPs) and make it easier for users to find. Additionally, using relevant examples and providing a clear and concise explanation of how the method works can also improve the SEO of the page.