c# - TimeZoneInfo in Portable Class Library -

-

i have requirement timezone info of "mountain standard time" portable class library.in wpf application got same below code.

timezoneinfo.findsystemtimezonebyid("mountain standard time");

but in pcl, cant see functionality.could 1 please tell me how can achieve same in pcl?

thanks in advance. roshil


Comments

Post a Comment

Popular posts from this blog

c# - Derived UserControl layout resets after build -

-
i have basic "base" usercontrol added properties. when inherit base usercontrol , add buttons in designer seems fine. when build project of buttons disappear , layout restores original base usercontrol. doing wrong here? public partial class baseusercontrol : usercontrol { public baseusercontrol() { initializecomponents(); } public bool canclose { get; set; } } public partial class inheritedusercontrol : baseusercontrol { public inheritedusercontrol() { initializecomponents(); } }
Read more

sql - Postgresql error: "failed to find conversion function from unknown to text" -

-
i have following postgresql query: ( select '201405mase04' testid, count(*) totq, count(distinct case when se1 = '' null else se1 end) totse, case when count(*)=0 7 else count(distinct rc) end totrc eivtestitems ti, eivtests t ti.test_id = t.test_id , t.test_type_id = 1 , t.test_id= '201405mase04' , ti.omit <> 1 ), b ( select '201405mase04' testid, count(*) totq eivtestitems ti, eivtests t ti.test_id = t.test_id , t.test_type_id = 1 , t.test_id= '201405mase04' , ti.omit = 1 ), c ( select '201405mase04' testid, count(*) totq eivtestitems ti, eivtests t ti.test_id = t.test_id , t.test_type_id = 1 , t.test_id= '201405mase04' , ti....
Read more

haskell - Using Monad/ST for non-concurrent message passing in a mutable graph -

-
i trying work out data structure following situation. graph structure i plan have graph of nodes un-weighted, directed edges: graph = [node] each node has: some tbd internal (persistent) state a queue of incoming messages a type of message can send determined function accepts current node state (with possibility of failure) a list of edges node { nodestate :: nodestate, inbox :: queue nodemessage, nodemessage :: (nodestate -> maybe nodemessage), connections::[nodeedge] } each edge intermediary step capturing pending messages target node nodeedge { pendingmessage:: maybe nodemessage, targetnode :: node } message passing the message passing happens in phases , not-conccurent (though queues may processed in parallel reduce computation time). phase 1: check inbox of every node, processing messages , updating nodestate if relevant. phase 2: have every node run nodemessage , if results in just nodemessage , send nodemessage every connection ( [nodeedge] ) ...
Read more