Skip to main content

Loading data form external api automatically and using some event such as on a button click in reactjs

beginner level- just creating a simple example how to load data from a external api using typescript and reactjs.

running code: link https://stackblitz.com/edit/react-ts-ek3vme

code:-

//calling data from external api
//calling data on event

import React, { Component } from 'react';
import { render } from 'react-dom';
import './style.css';

interface AppProps {

}
//user data interface
interface userData
{
key:string;
body:string;
title:string;
userId:number;
id:number;
}//urldata interface
interface urlData
{
origin:string;
url:string;
}
//app state interface
interface AppState {
name: string;
data:urlData
userdata:Array<userData>;
}
//app code
class App extends Component< AppProps,AppState> {
listName:string="click on button to load list"
load:Function=null;
constructor(props) {
super(props);
this.state = {
name: "loading.....",
data:{
origin:null,
url:null,
},
userdata:new Array<userData>()

};
}
//componentDidMount called immediately after component rendered first time
componentDidMount() {

fetch("https://httpbin.org/get")
.then(res => res.json())
.then(
(result) => {
var data:urlData={
origin:null,
url:null
};
data.origin=result.origin;
data.url=result.url;
this.setState({
name: "auto load data from rest api",
data:data
});
},
(error) => {
console.log(error);
}
)
}
//load data from external url
loadData(url:string)
{
fetch(url)
.then(res => res.json())
.then(
(result) => {
result.map((object, i)=>{
var mydata:userData=
{
key:object.id,
body:object.body,
title:object.title,
userId:object.userId,
id:object.id
}
this.state.userdata.push(mydata);
}
)

this.setState({
name: "load data on button click",
userdata:this.state.userdata
});
},

(error) => {
}
)

}
render() {
return (
<div>
<p>{this.state.name}</p>
<p>{this.state.data.url}</p>
<p>{this.state.data.origin}</p>
<button onClick={this.load=()=>{
//pass api url
this.loadData("https://jsonplaceholder.typicode.com/posts");
}}>Load data from external sources</button>
<p>{this.listName}</p>
<ul>
{this.state.userdata.map(data => (
<li key={data.key}>
<b>Heading:=> {data.title}</b><br></br>
<b>all Data:=></b>{data.body}
</li>
))}
</ul>
</div>
);
}
}

render(<App />, document.getElementById('root'));

Comments

Popular posts from this blog

Creating a word Scramble game where you can drag and drop the word and create a complete word. (drag and drop word Scramble game).

Creating a word game using  phaser game engine which is a javascript based gaming engine  where u can drag and drop world like Word Scramble Game and complete a given word. your index.html file look like below < html > < head > < script src = "src/phaser.min.js" ></ script > < script src = "src/wordGame.js" ></ script > < script src = "src/main.js" ></ script > </ head > < body > </ body > </ html > 1.    <script src="src/phaser.min.js"></script> required to run the  phaser game engine. 2. rest of the two files deals with game logics      <script src="src/wordGame.js"></script>       <script src="src/main.js"></script> you can download whole project from https://github.com/manishchauhan/wordgame/tree/master just copy and paste the project in your local server and run ...

starting with three.js and react with a very simple example

 1. three.js is undoubtedly the best library to create interactive content for the web in 3d. link https://threejs.org/ a working sample of three with react can be found below https://stackblitz.com/edit/react-7n5qf9?file=src%2FApp.js why choose threejs 1. lightweight  2.fast 3.big community  https://discourse.threejs.org/ 4. even you can use unity or unreal to publish html5 content but i don't think that would be acceptable in many cases. 5. open-source project. i created a running sample with React  https://stackblitz.com/edit/react-7n5qf9?file=src%2FApp.js

A simple binary search tree with generic approach tree can store any type of data. (DFS and BFS)

 1. a binary search tree in c++ using a generic approach with both BFS and DFS approach    working tree    https://www.onlinegdb.com/edit/HkuQLdA-w code=> some properties of binary search tree-> 1. binary search tree is not always a balanced tree.  2. Inorder, traversing gives you sorted data.  3.  best is o(log n) and worst is O(n).  4. left node data is always less than root data and right node data always be greater than root data.  5. red-black tree STL map is a balanced binary search tree. *******************************************************************************/ #include <stdio.h> #include<iostream> #include<queue> using namespace std; template < typename T > class Node {   //can store any type of data private:   //genric data or store any type of data   T data;   //reference of left pointer   Node *left = nullptr;   //reference of right pointer   Node *rig...