Windows 8 App Design Reference Template: ECommerce Jewellery

  •        27

E-Commerce Jewellery template is an emulation of a Shopping app with placeholders for Category, Group Category, and Detail Data.

http://win8template27.codeplex.com/

Tags
Implementation
License
Platform

   




Related Projects

Weights---Measures-Tables


Weights Measures Tables AVOIRDUPOIS OR COMMERCIAL WEIGHT1 gross or long ton (l. tn.)=2240 pounds1 net or short ton (sh. tn.)=2000 pounds1 long hundred weight (l. cwt.)=112 pounds1 short hundred weight (sh. cwt.)=100 pounds1 pound (lb.) = 16 ounces (oz.)=7000 grains (gr.)1 ounce (oz.) = 16 drams (dr.)=437.5 grainsAPOTHECARIES' WEIGHT1 pound (lb. ap.)=12 ounces=5760 grains1 ounce (oz. ap.)=8 drams=480 grains1 dram (dr. ap.)=3 scruples=60 grains1 scruple (s. ap.)=20 grains METRIC EQUIVALENTS AVOIR

VHDL


library IEEE; use IEEE.std_logic_1164.all; use IEEE.numeric_std.all; use IEEE.std_logic_unsigned.all; --use IEEE.std_logic_arith.all; entity Nexys2 is generic(inpnums: integer := 32; addrwdth: integer := 5); port(led: out std_logic_vector(7 downto 0); seg: out std_logic_vector(6 downto 0); dp: out std_logic; an: out std_logic_vector(3 downto 0); clk: in std_logic; sw: in std_logic_vector(7 downto 0); btn: in std_logic_vector(3 downto 0)); end Nexys2; architecture behavorial o

-----Watch-Florida-Atlantic-Owls-vs-1-Alabama-Crimson-Tide-Live-NCAA-Football-TV-Schedule-Live-Strea


Dear NCAA Football fans, Wellcome to Watch Florida Atlantic Owls vs 1 Alabama Crimson Tide Live Streaming online PC TV Soapcast and Video Highlights, Get the free live Instant streaming Internet TV Links Here.So don’t be hesitated just follow our instruction and recommended streaming link assure that you are 100% satisfied in our service.Enjoy to watch live stream online college Football League. Stream coverage NCAA online tv, Live NFL games watch on skysports tv, CBS, NBC, bet with sky bet, b

bolao


O Bolão permite que vários usuários interajam entre si com apostas em jogos de futebol. Regras : As regras são simples e se baseiam numa somatória de pontos, onde o maior pontuador é o vencedor e o vencendor recebe o prêmio em dinheiro. Será recolhido um valor fixo de R$20,00 dos participantes e os participantes apostam nos jogos cadastrados. A cada jogo os participantes vão somando pontos de acordo com os critérios previamente definidos. Os critérios são : 1 - Resultado acertado : 3 pontos Ex

Quine-of-Life - Conway's Game of Life in Quine format.


```ruby"Quine of Life by Andrew Vos (andrewvos.com)";game=[" "," "," "," "," "," "," X X X "," X X "," X



cirru-shell - Simple demo of Cirru Shell


```bash➤➤ npm install -g cirru-shell➤➤ cirru-shell```Tab completion is supported, try it.Notice that values and mathods are not store in the same table.A demo of running Cirru Shell:```cirru> number 1=> 1cirru> string 2=> 2cirru> array 1=> [ 1 ]cirru> array (array (array (map )=> [ [ [ {} ] ] ]cirru> array (array (array (map (a $ number 4)))=> [ [ [ [Object] ] ] ]cirru> set a 1=> 1cirru> get a=> 1cirru> set a $ map (b 4) (c 5)=> { b: 4, c: 5 }cirru> display=> [ 'a' ]cirru> level=> 0cirru

lumina - Lumina Graphics Library


One important class is the `VertexSeq` which represents a list of vertices with a given order. It's implemented with one vertex buffer and one index buffer internally. The design goal of this class was to provide type-safe functionality that isn't too complex and does exactly how the user thinks about a sequence of vertices. To create a quad (4 vertices) where each vertex has a position and a UV-coordinate you could write: // each vertex contains a vector of 3 floats (pos) and a vector of 2 f

node-pick - A simple library for picking random elements of arrays


$ node > var pick = require("pick"); > pick.pick([1, 2, 3]); 1 > pick.pick([1, 2, 3]); 2 > pick.pick([1, 2, 3]); 1 > pick.pick([1, 2, 3]); 2 > pick.pick([1, 2, 3]); 3 > pick.pick([1, 2, 3]); 2 > pick.pick([1, 2, 3]); 2 > pick.pick([1, 2, 3]); 2 > pick.pick([1, 2, 3]); 3 ...

Node-CheatSheet - A quick reference cheat sheet for topics in Node


1. [The JavaScript Problem](http://www.haskell.org/haskellwiki/The_JavaScript_Problem) [HN Post](https://news.ycombinator.com/item?id=7653013)Books--- 1. [Speaking Javascript](http://speakingjs.com) 1. [Understanding ECMAScript 6](https://github.com/nzakas/understandinges6)Asynchronous Programming Style--- 1. EventEmitter (build-in) [apis](http://nodejs.org/api/events.html) 1. Promise A+ * [Google should just add promises to V8](https://medium.com/code-adventures/4efc0e2ab5d6) * [Promises h

Altis-Life-Hive - C++ Hive for Altis-Life


**0** Init the hive **100** Get Player information 1. SteamId (int 64Bit) **101** Update Player Civilian 1. SteamId (int 64Bit) 2. Cash (int) 3. Bank (int) 4. Gear (const char *) 5. Licenses (const char *) 6. Arrested (bool) 7. PlayerName (const char *) **102** Update Player Resistance 1. SteamId (int 64Bit) 2. Cash (int) 3. Bank (int) 4. Gear (const char *) 5. Licenses (const char *) 6. Arrested (bool) 7. PlayerName (const char *) **103** Update Player Cop 1. SteamId (int 64Bit) 2. Ca

e - Computes the Euler's Number (2.718281827...) using infinite series 1 + 1/1! + 1/2! + 1/3! + ...


Computes the Euler's Number (2.718281827...) using infinite series 1 + 1/1! + 1/2! + 1/3! + ...

markov-guess


tarting with the uniform distribution ?(0) = (1/6, 1/6, 1/6, 1/6, 1/6, 1/6) as an initial "guess", multiply ?(0) by P to obtain a new "guess" ?(1). Repeat this proces, obtaining ?(n) from ?(n-1) via ?(n) = ?(n-1) P

SparseLSH


y = [ 0, 3, 10] X_sim = csr_matrix( [ [ 1, 1, 1, 1, 1, 1, 0]]) lsh = LSH( 4, X.shape[1], num_hashtables=1, storage_config={"dict":None}) for ix in xrange(X.shape[0]): x = X.getrow(ix) c = y[ix] lsh.index( x, extra_data=c)

wp-drp-coupon - Mirror of WordPress Plugin - DRP Coupon


This is a mirror of DRP Coupon's WordPress Plugin which was removed recently for unknown reasons and was available at [http://wordpress.org/plugins/drp-coupon/](http://wordpress.org/plugins/drp-coupon/)**Note:** I'm in no way, shape or form affiliated with the plugin or the developers of this plugin. Refer the plugin's license for more information about the permissions/rights or contact the plugin's developer on their official site - directresponsepublishing.com---**Contributors:** Direct Respon

plock - 'p { 1 + 1 }` prints "(1 + 1) #=> 2". That's all.


'p { 1 + 1 }` prints "(1 + 1) #=> 2". That's all.

tamil-live-tv


<html> <head> <title>Tamil TV Live</title> <style> @import url("style.css"); </style> <link rel="shortcut icon" href="favicon.ico" /> <style type="text/css"> <!-- .style1 {color: #F7682B} --> </style> </head> <body bgcolor="#D8D8D8"> <div align="center"> <table cellspacing="0" cellpadding="0" width="779" border="0"> <tr> <td> <div id="head1"> <table cellspacing="0" cellpadding="0" width="779" height="24" border="0" background="images/row1a.jpg"> <tr> <td width="779"> </td> </tr> </table> </d

gamelisp


(+ [1 2] 3) -> [1 2 3](+ [1 2] [3 4]) -> [1 2 3 4]````Core Functions (so far)--------------````clojure(def symbol value) ; Define a new variable(type x) ; Get type of variable(str x) ; Get string representation of variable(print x) ; Print value of x(map f xs) ; Apply function to items in list xs(filter f xs) ; Filter items xs with function f(get dict key) ; Get dictionary entry(get list index) ; Get list entry (negative indices like in Python)(put dict key value) ; Add or set dictionary entry(p

present - Make presentations for data types.


``` haskell> import Data.Maybe> import Data.Data> import Data.Typeable> import Data.ID> :set -XDeriveDataTypeable> data Bar = Bar () Bool deriving (Typeable,Data)> data Foo = Foo Bar [Bar] Char Int deriving (Typeable,Data)```The data type can be queried like this:``` haskell> let x = Foo (Bar () True) [(Bar () True),(Bar () False)] 'a' 5> present (fromJust (fromList [0])) xJust (Alg "Foo" "Foo" [("Bar","@0?0"),("[Bar]","@0?1"),("Char","@0?2"),("Int","@0?3")])> present (fromJust (fromList [0,1]))

jsconfeu-2013 - Spotify Coding challenge for jsconfeu-2013


1. Work locally in a custom branch `git checkout -b my-solutions`2. When you are ready with the code, you have several options: * Option 1: Send us the code via e-mail * First generate a patch: `git diff --no-prefix master > solution.patch` * Send the generated patch to [jsconfeu-2013@spotify.com](mailto:jsconfeu-2013@spotify.com) * Use the subject **[Challenge]** * **Alternative**: just send us the link to a secret gist ([gists.github.com](https://gist.github.com/)) * We