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 834485
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 15, 20262026-05-15T04:40:43+00:00 2026-05-15T04:40:43+00:00

I have a dictionary: D = { foo : bar, baz : bip }

  • 0

I have a dictionary:

D = { "foo" : "bar", "baz" : "bip" }

and I want to create new dictionary that has a copy of one of it’s elements k. So if k = "baz":

R = { "baz" : "bip" }

what I’ve got now is:

R = { k : D[k] }

But in my case k is a complex expression and I’ve got a whole stack of these. Caching k in a temporary looks about as ugly as the original option.

What I’m looking for is a better (cleaner) way to do this.

  • 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-15T04:40:43+00:00Added an answer on May 15, 2026 at 4:40 am
    def take(dictionary, key):
        return {key: dictionary[key]}
    
    R = take(D, k)
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have: dictionary = {foo:12, bar:2, jim:4, bob: 17} I want to iterate over
If I have a dictionary with the following key/value foo/bar and declared [dictionary setObject:@baz
I have an object Dictionary<int, Dictionary<int, Foo> > on one side, and a function
I have dictionary, like Dictionary<string, bool> accValues = new Dictionary<string, bool>() And I want
I have a dictionary that has keys associated with lists. mydict = {'fruits': ['banana',
I have two dictionaries with the same structure: Dictionary<string, int> foo = new Dictionary<string,
Let's say I have a Dictionary<string,object> like so: var foo = new Dictionary<string, object>();
I have some code that looks something like this: d = {'foo': True, 'bar':
Say you have, foo = 'bar' d = {'a-key':'a-value'} And you want d =
I have a model that contains a dictionary property. (this has been distilled from

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.