Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 3276102
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 17, 20262026-05-17T19:13:13+00:00 2026-05-17T19:13:13+00:00

I have two data structures with a mix of hashes and arrays. How can

  • 0

I have two data structures with a mix of hashes and arrays. How can I compare the two data structures and return their differences, something like perl’s Test::Harness module, but I don’t want to actually run a unit test. …or is there a way to tun Test::Harness without actually running a unit test?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-17T19:13:13+00:00Added an answer on May 17, 2026 at 7:13 pm

    Perl Monks says that Test::Deep, Data::Compare, and Data::Match are your friends. Those packages don’t seem to be geared towards producing detailed diffs but you might be able to hack in a callback to keep track of the precise differences.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have these two data structures that I continually find myself choosing between when
I have two tables with the following (simplified) structures: table "Factors" which holds data
Suppose I have the following two data structures: std::vector<int> all_items; std::set<int> bad_items; The all_items
I have two files, one with webservice description (wsdl), second with data structures used
I have two tables with identical structures handling distinct data. I want to merge
I have these two data structures: public TreeMap<String, Integer> tableFrequency; public SortedSet<Map.Entry<String, Integer>> sortedTable;
I have two sources: an xml-file containing definitions of several hundred data structures, basically
Need help with following situation: Users can generate their own data structures which are
I have two table structures like these: episodes ( episode_id MEDIUMINT(8) UNSIGNED NOT NULL
I have two data structures in Java: One is called DebateAssignment and has 5

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.