Simple Horizontal Divider Item Decoration for RecyclerView
mRecyclerView.addItemDecoration(new SimpleDividerItemDecoration(
getApplicationContext()
));
NOTE: Add item decoration prior to setting the adapter
| /** Consider the interface | |
| interface Mappable<A> { | |
| map: (A → B) → Mappable<B> | |
| } | |
| */ | |
| function Identity(value) { |
| { | |
| "cmd": ["java", "-jar", "C:\/TOTVS\/command_line_tools\/tdscli.jar", "-help"], | |
| "encoding": "cp1252", | |
| "variants": [ | |
| { | |
| "cmd": ["java", "-jar", "C:\/TOTVS\/command_line_tools\/tdscli.jar", "compile", | |
| "program=$file", "includes=C:\/ambientes_protheus\/M118_SQA_VALID2\/include", | |
| "server=localhost", "port=25006", "environment=M118_SQA_VALID2", "serverType=Advpl", | |
| "user=admin", "psw=", |
| import android.support.v7.widget.LinearLayoutManager; | |
| import android.support.v7.widget.RecyclerView; | |
| public abstract class EndlessRecyclerOnScrollListener extends RecyclerView.OnScrollListener { | |
| public static String TAG = EndlessRecyclerOnScrollListener.class.getSimpleName(); | |
| private int previousTotal = 0; // The total number of items in the dataset after the last load | |
| private boolean loading = true; // True if we are still waiting for the last set of data to load. | |
| private int visibleThreshold = 5; // The minimum amount of items to have below your current scroll position before loading more. | |
| int firstVisibleItem, visibleItemCount, totalItemCount; |
You can use this class to realize a simple sectioned RecyclerView.Adapter without changing your code.
The RecyclerView should use a LinearLayoutManager.
You can use this code also with the TwoWayView with the ListLayoutManager (https://github.com/lucasr/twoway-view)
This is a porting of the class SimpleSectionedListAdapter provided by Google
Example:
| Index: Zend/zend.h | |
| =================================================================== | |
| --- Zend/zend.h (revision 323850) | |
| +++ Zend/zend.h (working copy) | |
| @@ -486,6 +486,10 @@ | |
| union _zend_function *__call; | |
| union _zend_function *__callstatic; | |
| union _zend_function *__tostring; | |
| + union _zend_function *__toint; | |
| + union _zend_function *__tofloat; |
| {- | |
| Zachary Weaver <zaw6@pitt.edu> | |
| JSONParser.hs | |
| Version 0.1.1 | |
| A simple example of parsing JSON with Parsec in haskell. Note that | |
| since the primary point of this excersize is demonstration, | |
| Text.Parsec.Token was avoided to expose more of the grammar. Also, | |
| complicated optimizations and shorcuts were avoided (mostly). |
| import { __, reject, contains, either } from 'ramda' | |
| const words = [ | |
| 'oi', 'como', 'vai', 'você', 'seu', 'idiota' | |
| ] | |
| const blacklist = [ | |
| 'idiota', 'babaca', 'fdp' | |
| ] |
| (*** Turing Machines in Coq *) | |
| (** Some preliminary types we'll use *) | |
| CoInductive CoList (A: Type) := CONS (a:A) (t:CoList A) | NIL. | |
| Arguments CONS [A] _ _. | |
| Arguments NIL [A]. | |
| CoInductive Delay A := HERE (a:A) | LATER (_:Delay A). | |