java - How to serialize/deserialize partial JSON object using GSON? -


i have complex json many nested fields coming backend, example,

{    "a": ...    "b": ...    "not-required-1":{        "not-required-2":[            ...        ]        ..    },    "not-required-3":{        "not-required-4":[            ...        ]        ...    } }

i interested in "a" , "b" , can map corresponding types values. object has many fields don't need should serialize when make changes in "a" , "b".

if create type "a" , "b", when serialize object, "not-required" fields gone. option map every field in not-required corresponding java class, fall in number of 100s.

clarification,

backend sends json, processed in code , need send json backend.. though don't need process fields, doesn't mean backend doesn't need them.

i want convert incoming json pojo , use through out app, , serialize json using gson.

c#'s json.net library has support hybird object serialization using json.linq.

c# example.

 class dataobject{        [jsonproperty("a")]       dataa {get;set;}        [jsonproperty("b")]       datab b {get;set;}        [jsonproperty("not-required-a")]       json.linq.jsonelement notrequireda {get;set;}        [jsonproperty("not-required-b")]       json.linq.jsonelement notrequiredb; {get;set;}   }

in c# way don't need map fields of notrequireda , notrequiredb, serialize correctly when needed.

you can use jsonelement. example:

 class dataobject{          @expose @serialize("a")         dataa a;           @expose @serialize("b")         datab b;          @expose @serialize("not-required-a")         jsonelement notrequired;          ...   }

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