c# - Unity DI: Resolving from per-request to global singleton to per-request -


i have controller calling global singleton calling per-request-instance in context of asp.net webapi. basically

per-request => singleton => per-request

is below setup correct? i'm particularly worried second per-request instance, since user-based claims.

or anti-pattern , singleton should receive (per-request) dependencies controller?

    // unityconfig.cs, resolver uses createchildcontainer()     public static void registertypes(iunitycontainer unity)     {         // global singleton         unity.registertype<messagecontext>(new containercontrolledlifetimemanager());         // instance per request         unity.registertype<claimscontext>(new hierarchicallifetimemanager());     }      // api controller     public class mycontroller : apicontroller     {         private readonly messagecontext _message;          public formcontroller(messagecontext message)         {             _message = message;         }          public task<ihttpactionresult> myaction()         {             _message.fireandforget();             return ok();         }     }      // global singleton keep connection pool     public class messagecontext     {         private readonly iunitycontainer _unity;          public messagecontext(iunitycontainer unity)         {             _unity = unity;         }          public task fireandforget()         {             // resolve per request             var claim = _unity.resolve<claimscontext>().myclaim);             // ...         }     }

as pointed out in comments, above sample code needs restructured. fix, split messagecontext long-lived , short-lived part. short-lived part receives short-lived claimscontext, while long-lived part holds onto long-lived connections.


Comments

Post a Comment

Popular posts from this blog

Sort a complex associative array in PHP -

this question has answer here: php sort array subarray value 5 answers i have associative array in php like: $newarray1 = array ( [producta] => array ( [link] => http://sanjosespartan.com/blog/products/agile-java-development/ [visitcount] => 4 ) [productd] => array ( [link] => http://sanjosespartan.com/blog/products/intro-to-go/ [visitcount] => 1 ) [productg] => array ( [link] => http://sanjosespartan.com/blog/products/node-js-for-developers/ [visitcount] => 1 ) [productb] => array ( [link] => http://sanjosespartan.com/blog/products/beginning-mysql/ [visitcount] => 1 ) [productc] => array ( [link] => http://sanjosespartan.com/blog/products/computer-networks/ [visitcount] => 1 ) ...
Read more

vb.net - How to ignore if a cell is empty nothing -

how use roscolor() ignore value (like empty cell) ? color row if value upper 5 when there nothing in cell, want ignore roscolor() apply, how? public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val integer val = quotedatagridview1.rows(i).cells(3).value if val = vbempty quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white elseif val < 5 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.red elseif val > 5 , val < 10 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.lightyellow end if next end sub you can check empty value following public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val = quotedatagridview1.rows(i).cells(3).value if isdbnull(val) or val nothing quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white ...
Read more

recursion - Can every recursive algorithm be improved with dynamic programming? -

i first year undergraduate csc student looking competitive programming. recursion involves defining , solving sub problems. understand, top down dynamic programming (dp) involves memoizing solutions sub problems reduce time complexity of algorithm. can top down dp used improve efficiency of every recursive algorithm overlapping sub problems? dp fail work , how can identify this? the short answer is: yes. however, there constraints. obvious 1 recursive calls must overlap. i.e. during execution of algorithm, recursive function must called multiple times same parameters. lets truncate recursion tree memoization. can use memoization reduce number of calls. however, reduction of calls comes price. need store results somewhere. next obvious constraint need have enough memory. comes not-so obvious constraint. memory access requires time. first need find result stored , maybe copy location. in cases, might faster let recursion calculate result instead of loading somewher...
Read more