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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 1, 20262026-06-01T09:54:45+00:00 2026-06-01T09:54:45+00:00

I have been using this excellent decorator for memoization, which I found on the

  • 0

I have been using this excellent decorator for memoization, which I found on the web (shown here with the Fibonacci sequence as an example):

def memoize(f):
    cache= {}
    def memf(*x):
        if x not in cache:
            cache[x] = f(*x)
        return cache[x]
    return memf

@memoize
def fib(n):
    if n==1 or n==0:
        return 1
    return fib(n-2) + fib(n-1)

print fib(969)

Now I’d like to understand the inner workings a bit better, I have not found answers by reading up on decorators or parameter handling in Python.

Why is the cache dictionary not reinitialized every time the decorated function is called?

How is *x recognized to be the parameters sent to the decorated function, i.e., 969 in the function call fib(969)?

  • 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-06-01T09:54:46+00:00Added an answer on June 1, 2026 at 9:54 am

    The decorator is called only once, immediately after the decorated function is first defined. Thus, these two techniques(using @wrap and bar = wrap(bar)) are the same:

    >>> def wrap(f):
    ...     print 'making arr'
    ...     arr = []
    ...     def inner():
    ...         arr.append(2)
    ...         print arr
    ...         f()
    ...     return inner
    ...     
    >>> @wrap
    ... def foo():
    ...     print 'foo was called'
    ...     
    making arr
    >>> foo()
    [2]
    foo was called
    >>> foo()
    [2, 2]
    foo was called
    >>> def bar():
    ...     print 'bar was called'
    ...     
    >>> bar = wrap(bar)
    making arr
    >>> bar()
    [2]
    bar was called
    

    In both cases it is clear that arr is created only when wrap(f) is called, and wrap is called only when foo and bar are first declared.

    As for the case of passing arguments to a decorated function, remember that a decorator takes a function as a parameter and returns a modified version of that function. So a decorator typically takes one parameter, which is the function that it is modifying. It returns a new function, and the decorator can define the function that it returns as taking any number of arguments(for example, *args). The decorator can even return a function that takes too many parameters for the method that it decorates.

    >>> def wrap_with_arg(f):
    ...     def wrap(*args):
    ...         print 'called with %d arguments' % len(args)
    ...         f(args)
    ...     return wrap
    ...     
    >>> @wrap_with_arg
    ... def baz(arg):
    ...     print 'called with argument %r' % arg
    ...     
    >>> baz(3)
    called with 1 arguments
    called with argument 3
    >>> baz(3, 4)
    called with 2 arguments
    Traceback (most recent call last):
      File "<input>", line 1, in <module>
      File "<input>", line 4, in wrap
      File "<input>", line 3, in baz
    TypeError: not all arguments converted during string formatting
    

    While eventually baz throws an error, notice how the number of arguments is correctly printed before the error is thrown.

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

Sidebar

Related Questions

I have been using this code with great success to pull out the first
I have been using this copy method for quite a while, in lots of
I have been using this as a reference, but not able to accomplish exactly
I have been using this so far system 'strings binary-file.dmp | grep search_string' Is
I have been using code similar to this MessageDlg('', mtWarning, [mbOK], 0); throughout my
I have been using win32api.MessageBox to do alerts, and this works for apps running
I have been using Perl for some time, but today I came across this
[i meant to ask this question on StackOverflow...] I have been using VisualSVN Server
I have been trying to parse the bottom table on this site using different
I have been trying to implement hash-tables using uthash.h, following the (excellent) documentation I

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.