ranjanprj ranjanprj

Just a small gist to show how you can easily create a Rust shared lib, wrap it with C and call it from PostgreSQL SQL Command.

Prereq : Tested on Ubuntu 18, GCC, postgresql-server-11, postgresql-dev-11, rustlang
Create new project Cargo embed and cd embed
Rename the file src/main.rs to lib.rs
Add following code

#[no_mangle]
pub extern fn double_input(input: i32) -> i32 {
    input * 2


	## Alternatives: postgres:15-alpine
	ARG BASE_IMAGE=postgis/postgis:15-3.4-alpine

	## Custom Alpine Postgres docker file with custom extensions
	FROM ${BASE_IMAGE} as builder

	# Install required dependencies
	RUN apk --no-cache add \
	python3 \

	sudo apt-get update
	sudo apt install postgresql-server-dev-12

	C File
	=========
	#include "postgres.h"
	#include <string.h>
	#include "fmgr.h"

	sap.ui.controller("Main", {

	/**
	* Called when a controller is instantiated and its View controls (if available) are already created.
	* Can be used to modify the View before it is displayed, to bind event handlers and do other one-time initialization.
	* @memberOf testcockpit.Main
	*/
	onInit: function() {
	// $.ajaxSetup({
	// beforeSend: function(oXhr) {

	;Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:
	;1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
	;By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.
	;*** PROBLEM WITH EULER CONDITION THEY SAY 4 MILLION BUT ACTUALLY MEAN 40 MILLION

	(defn fibr-sum-even[upto]
	(loop [a 0N b 1N sum 0N]
	(println (str b " - " sum))

	(if (> b upto) sum

	(ns euler.core)

	;; If we list all the natural numbers below 10 that are multiples of 3 or 5,
	;; we get 3, 5, 6 and 9. The sum of these multiples is 23.
	;; Find the sum of all the multiples of 3 or 5 below 1000.


	(defn p1
	[n]
	(if (or(= 0 (mod n 3)) (= 0 (mod n 5)) )

	/*



	A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.

	Find the largest palindrome made from the product of two 3-digit numbers.


	*/

	/*

	The prime factors of 13195 are 5, 7, 13 and 29.

	What is the largest prime factor of the number 600851475143 ?

	Answer:


	*/

	/*

	If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.

	Find the sum of all the multiples of 3 or 5 below 1000.

	*/

	function sum_of_mul(num){
	var sum = 0;