array_utils.js 1.7 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
  1. /**
  2. * Licensed to the Apache Software Foundation (ASF) under one
  3. * or more contributor license agreements. See the NOTICE file
  4. * distributed with this work for additional information
  5. * regarding copyright ownership. The ASF licenses this file
  6. * to you under the Apache License, Version 2.0 (the
  7. * "License"); you may not use this file except in compliance
  8. * with the License. You may obtain a copy of the License at
  9. *
  10. * http://www.apache.org/licenses/LICENSE-2.0
  11. *
  12. * Unless required by applicable law or agreed to in writing, software
  13. * distributed under the License is distributed on an "AS IS" BASIS,
  14. * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  15. * See the License for the specific language governing permissions and
  16. * limitations under the License.
  17. */
  18. module.exports = {
  19. /**
  20. *
  21. * @param arr {Array}
  22. * @param id
  23. * @return result {Array}
  24. */
  25. uniqObjectsbyId: function (arr, id) {
  26. var result = [];
  27. arr.forEach(function (item) {
  28. var isIdPresent = result.someProperty('id', item.id);
  29. if (!isIdPresent) {
  30. result.pushObject(item);
  31. }
  32. });
  33. return result;
  34. },
  35. /**
  36. * intersect two arrays and return the common values
  37. *
  38. * @param {Array} arr1 - first array
  39. * @param {Array} arr2 - second array
  40. * @return {Array} intersection - the intersection of arr1 and arr2
  41. */
  42. intersect: function (arr1, arr2) {
  43. var intersection = [];
  44. var shortest = arr1.length >= arr2.length ? arr2 : arr1;
  45. var longest = arr1.length >= arr2.length ? arr1 : arr2;
  46. shortest.forEach(function (entry) {
  47. longest.indexOf(entry) > -1 ? intersection.push(entry) : null;
  48. });
  49. return intersection;
  50. }
  51. };