Skip to content

Instantly share code, notes, and snippets.

<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<l7:Item xmlns:l7="http://ns.l7tech.com/2010/04/gateway-management">
<l7:Name>Bundle mappings</l7:Name>
<l7:Type>BUNDLE MAPPINGS</l7:Type>
<l7:TimeStamp>2021-07-06T09:57:10.458-03:00</l7:TimeStamp>
<l7:Link rel="self" uri="https://c360mapigw02.datacenter.prodeb:8443/restman/1.0/bundle?test=true&amp;activate=true"/>
<l7:Resource>
<l7:Mappings>
<l7:Mapping action="NewOrExisting" actionTaken="UsedExisting" srcId="0000000000000000ffffffffffffec76" srcUri="https://c360dmapigw.datacenter.prodeb:8443/restman/1.0/folders/0000000000000000ffffffffffffec76" targetId="0ea33d3c925a99a8dfdf84fa000eb24f" targetUri="https://c360mapigw02.datacenter.prodeb:8443/restman/1.0/folders/0ea33d3c925a99a8dfdf84fa000eb24f" type="FOLDER">
<l7:Properties>
@lMooka
lMooka / QuickSort.c
Created April 5, 2013 19:54
Algoritmo comentado!
void swap(int *a, int i, int j)
{
int t = a[i];
a[i] = a[j];
a[j] = t;
}
int partition(int *a, int left, int right, int pivot)
{
// Pos é uma variável que auxilia as trocas durante o processo de ordenação,
@lMooka
lMooka / QuickSort.c
Created April 5, 2013 14:03
QuickSort feito em Sala de aula por Apolinário.
void QuickSort(int* v, int i, int f)
{
int pivo,aux;
if(i>=f)
return;
if((f-i) ==1)
{
if(v[f] < v[i])
{
aux=v[f];
unsigned char* copyGrayImage(unsigned char* img, int w, int h) {
unsigned char* imgCpy = (unsigned char*) malloc ( sizeof(unsigned char) * w * h);
int i,j;
if (imgCpy != NULL)
for (j = 0 ; j < h ; j++)
for (i = 0 ; i < w ; i++)
imgCpy[j*w+i] = ( 0.3*img[j*w*3+i*3+RED] +