主頁 > 後端開發 > 收縮時重新分配堆損壞

收縮時重新分配堆損壞

2021-11-21 02:58:33 後端開發

我應該構建一個資料庫，通過將元素移動到陣列的末尾來從動態分配的陣列中“洗掉”一個元素。當這種元素的塊變得足夠大時，應該重新分配記憶體以縮小陣列并永久洗掉那些無用的元素。
錯誤： Realloc
正在拋出：
realloc()：下一個大小無效
中止

重現錯誤的步驟（簡化）：從界面中選擇洗掉選項。

代碼（簡化）：
在 main() 中：

 printf("\nEnter id to delete:");
                    scanf("%d",&idtoDelete);
                    delete(&log,idtoDelete);

在functions.c中：

int delete(petCatalog *log, int idtoDelete) {
    //search to find which log has the id to delete.
    pet temp;
    int distance = 0;//between size and the pet to be deleted (temp) dld idtoDelete.
    int calibration = 0;
    int i = 0, j = 0;//virginslots from size-1 to thee first that awaits to be deleted dld virgin slots
    for (i = 0; i < log->size; i  ) {
        if (log->array[i].id == idtoDelete) {            
            //move toDelete to my temp
            deepcopy_pet(&temp, &log->array[i], YES);
            log->virginSlots = log->size - i;
            //crerate a gap and fill the gap by overwriting
            distance = log->size - idtoDelete;
            calibration = distance   idtoDelete;
            for (j = i   1; j < calibration; j  ) {
                deepcopy_pet(&log->array[j - 1], &log->array[j], NO);                
            }
            log->size--;
            //temp to cap 
            deepcopy_pet(&log->array[log->cap], &temp, YES);        
            log->awaitDelete  ; //all good till here
            log->virginSlots = log->cap - log->awaitDelete - log->size;
            if (log->virginSlots <= DOWNLIM) {
                log->cap = log->cap - log->awaitDelete;//meaning dump everything after: size virginslots
                log->array = realloc(log->array, log->cap * sizeof(pet));
                if (log->array == NULL) {
                    printf("deletion failed to realloc");
                    exit(EXIT_FAILURE);
                }
            } else if (log->virginSlots >= UPLIM) {
                log->array = realloc(log->array, sizeof(pet) * (log->size)   DEFAULTVIRGIN);
                if (log->array == NULL) {
                    printf("\nfailed to realloc cause of UPLIM");
                    exit(EXIT_FAILURE);
                }
                log->cap = log->size   DEFAULTVIRGIN;
            }
        }
        //sort the array by breed again
    }
    return 0;
}

int deepcopy_pet(pet *dest, pet *source, int mallocDest) {          
    if (mallocDest == YES) {
        dest->sex = (char*)malloc(sizeof(char) * STRLIM);
        if (dest->sex == NULL) {
            printf("failed to malloc dest->breed");
            exit(EXIT_FAILURE);
        }     
       
        dest->breed = (char*)malloc(sizeof(char) * STRLIM);
        if (dest->breed == NULL) {
            printf("failed to malloc dest->breed");
            exit(EXIT_FAILURE);
        }
        
        dest->pet_age = (age*)malloc(sizeof(age));
        if (dest->pet_age == NULL) {
            printf("failed to malloc dest->breed");
            exit(EXIT_FAILURE);
        }
    }
    dest->id = source->id;
    strcpy(dest->sex, source->sex);
    strcpy(dest->breed, source->breed);
    dest->pet_age->years = source->pet_age->years;
    dest->pet_age->months = source->pet_age->months;
    return 0;
}

以及 head.h 中結構的描述：

typedef struct age { 
    int years, months;
} age;

typedef struct pet {
    int id;
    char *sex;
    char *breed;
    age *pet_age;
} pet;

typedef struct petCatalog {
    pet *array;
    int size;//how many of them i got
    int cap;//how big is the array 
    //cap-count = empty_cells;
    int awaitDelete;
    int virginSlots;
} petCatalog;

Valgrind 輸出（簡化）：

==1260== Invalid write of size 8
==1260==    at 0x109621: deepcopy_pet (in /mnt/c/Users/georg/Desktop/projects/strays/a.out)
==1260==    by 0x1094A9: delete (in /mnt/c/Users/georg/Desktop/projects/strays/a.out)
==1260==    by 0x10A507: main (in /mnt/c/Users/georg/Desktop/projects/strays/a.out)
==1260==  Address 0x4a47108 is 8 bytes after a block of size 192 alloc'd
==1260==    at 0x483B7F3: malloc (in /usr/lib/x86_64-linux-gnu/valgrind/vgpreload_memcheck-amd64-linux.so)
==1260==    by 0x10A3D2: main (in /mnt/c/Users/georg/Desktop/projects/strays/a.out)
==1260== 
==1260== Invalid read of size 8
==1260==    at 0x109629: deepcopy_pet (in /mnt/c/Users/georg/Desktop/projects/strays/a.out)
==1260==    by 0x1094A9: delete (in /mnt/c/Users/georg/Desktop/projects/strays/a.out)
==1260==    by 0x10A507: main (in /mnt/c/Users/georg/Desktop/projects/strays/a.out)
==1260==  Address 0x4a47108 is 8 bytes after a block of size 192 alloc'd
==1260==    at 0x483B7F3: malloc (in /usr/lib/x86_64-linux-gnu/valgrind/vgpreload_memcheck-amd64-linux.so)
==1260==    by 0x10A3D2: main (in /mnt/c/Users/georg/Desktop/projects/strays/a.out)
==1260== 
==1260== Invalid write of size 8
==1260==    at 0x10965E: deepcopy_pet (in /mnt/c/Users/georg/Desktop/projects/strays/a.out)
==1260==    by 0x1094A9: delete (in /mnt/c/Users/georg/Desktop/projects/strays/a.out)
==1260==    by 0x10A507: main (in /mnt/c/Users/georg/Desktop/projects/strays/a.out)
==1260==  Address 0x4a47110 is 16 bytes after a block of size 192 alloc'd
==1260==    at 0x483B7F3: malloc (in /usr/lib/x86_64-linux-gnu/valgrind/vgpreload_memcheck-amd64-linux.so)
==1260==    by 0x10A3D2: main (in /mnt/c/Users/georg/Desktop/projects/strays/a.out)
==1260== 
==1260== Invalid read of size 8
==1260==    at 0x109666: deepcopy_pet (in /mnt/c/Users/georg/Desktop/projects/strays/a.out)
==1260==    by 0x1094A9: delete (in /mnt/c/Users/georg/Desktop/projects/strays/a.out)
==1260==    by 0x10A507: main (in /mnt/c/Users/georg/Desktop/projects/strays/a.out)
==1260==  Address 0x4a47110 is 16 bytes after a block of size 192 alloc'd
==1260==    at 0x483B7F3: malloc (in /usr/lib/x86_64-linux-gnu/valgrind/vgpreload_memcheck-amd64-linux.so)
==1260==    by 0x10A3D2: main (in /mnt/c/Users/georg/Desktop/projects/strays/a.out)
==1260== 
==1260== Invalid write of size 8
==1260==    at 0x10969B: deepcopy_pet (in /mnt/c/Users/georg/Desktop/projects/strays/a.out)
==1260==    by 0x1094A9: delete (in /mnt/c/Users/georg/Desktop/projects/strays/a.out)
==1260==    by 0x10A507: main (in /mnt/c/Users/georg/Desktop/projects/strays/a.out)
==1260==  Address 0x4a47118 is 24 bytes after a block of size 192 in arena "client"
==1260== 

valgrind: m_mallocfree.c:305 (get_bszB_as_is): Assertion 'bszB_lo == bszB_hi' failed.

I don't really get it, why am I supposed to be writing illegally 8 bytes in every malloc of the deepcopy_pet() function, and reading 8 bytes upon every assignment to one of those variables I have just malloced?

My question is formed that way, considering the quote: "Heap errors have their origins at previous memory allocations but often occur after a bunch of those...".

Any suggestions?Thank you.

Full source code is available on GitHub 收縮時重新分配堆損壞

uj5u.com熱心網友回復：

最小可重現示例：

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<errno.h>
#include<string.h>
#include <unistd.h>
#define N 6
#define STRLIM 20
#define YES 1
#define NO 0
#define DOWNLIM 4 //if there are less virgin slots than these, you should realloc.POTE 0 !!
#define UPLIM 10//If virgin>=uplim , then realloc to sorten the array by log.awaitDelete.
#define DEFAULTVIRGIN 2 //dld in case of realloc coz of deletions,how much should be the virgins, dld size 2
#define EXTRA 5

//ifndef

typedef struct age{ 
    int years,months;
}age;

typedef struct pet{
    int id;
    char* sex;
    char* breed;
    age* pet_age;
}pet;

typedef struct petCatalog{
pet* array;
int size;//how many of them i got
int cap;//how big is the array 
//cap-count = empty_cells;
int awaitDelete;
int virginSlots;
}petCatalog;


int delete(petCatalog* log,int idtoDelete){
    //search to find which log has the id to delete.
    pet temp;
    int distance=0;//between size and the pet to be deleted (temp) dld idtoDelete.
    int calibration=0;
    int i=0,j=0;//virginslots from size-1 to thee first that awaits to be deleted dld virgin slots
    for(i=0;i<log->size;i  ){
        if(log->array[i].id==idtoDelete){            
            //move toDelete to my temp
            deepcopy_pet(&temp,&log->array[i],YES);
            log->virginSlots=log->size-i;
            //crerate a gap and fill the gap by overwriting
            distance=log->size-idtoDelete;
            calibration=distance idtoDelete;
            for(j=i 1;j<calibration;j  ){
                deepcopy_pet(&log->array[j-1],&log->array[j],NO);                
            }
            log->size--;
            //temp to cap 
        deepcopy_pet(&log->array[log->cap],&temp,YES);        
        log->awaitDelete  ; //all good till here
        log->virginSlots=log->cap-log->awaitDelete-log->size;
            if(log->virginSlots<=DOWNLIM){
                log->cap=log->cap-log->awaitDelete;//meaning dump everything after: size virginslots
                log->array=realloc(log->array,log->cap*sizeof(pet));
                    if(log->array==NULL){
                        printf("deletion failed to realloc");
                        exit(EXIT_FAILURE);
                    }
          }else if(log->virginSlots>=UPLIM){
              log->array=realloc(log->array,sizeof(pet)*(log->size) DEFAULTVIRGIN);
                    if(log->array==NULL){
                        printf("\nfailed to realloc cause of UPLIM");
                        exit(EXIT_FAILURE);
                    }
            log->cap=log->size DEFAULTVIRGIN;
          }
        }
        //sort the array by breed again
    }
    return 0;

    
    int deepcopy_pet(pet* dest,pet* source,int mallocDest){ //prosoxi tha diagreafontai an den paro metra.tha elegxo an exei idi desmeythei mnimi
         
         if( mallocDest==YES){
         dest->sex=(char*)malloc(sizeof(char)*STRLIM);
          if(dest->sex==NULL){
                printf("failed to malloc dest->breed");
                exit(EXIT_FAILURE);
            }      
       
         dest->breed=(char*)malloc(sizeof(char)*STRLIM);
         if(dest->breed==NULL){
             printf("failed to malloc dest->breed");
             exit(EXIT_FAILURE);
         }
        
         dest->pet_age=(age*)malloc(sizeof(age));
         if(dest->pet_age==NULL){
                printf("failed to malloc dest->breed");
                exit(EXIT_FAILURE);
            }
         }
        dest->id=source->id;
        strcpy(dest->sex,source->sex);
        strcpy(dest->breed,source->breed);
        dest->pet_age->years=source->pet_age->years;
        dest->pet_age->months=source->pet_age->months;
        return 0;
    }

    
int new_stray(petCatalog* log){ //sigoura pernane sto log giati exo kai tin epalithesi, pros to paron den xrisimopoio tin strcompare
    
    log->array[log->size].sex=(char*)malloc(sizeof(char)*STRLIM);
     if(log->array[log->size].sex==NULL){
            printf("new stray malloc sex failed\n");
            exit(EXIT_FAILURE);
        }
        
    log->array[log->size].breed=(char*)malloc(sizeof(char)*STRLIM);
    if(log->array[log->size].sex==NULL){
            printf("new stray malloc breed failed\n");
            exit(EXIT_FAILURE);
        }
    log->array[log->size].pet_age=(age*)malloc(sizeof(age));
    if(log->array[log->size].pet_age==NULL){
            printf("new stray malloc breed failed\n");
            exit(EXIT_FAILURE);
        }
    printf("enter the sex of the animal:");
    scanf("%s", log->array[log->size].sex);
    printf("\nthe sex of the pet is : %s",log->array[log->size].sex);

    printf("\nenter the breed of the dog:");
    scanf("%s", log->array[log->size].breed);

    printf("\nenter the years of the dog:");
    scanf("%d", &log->array[log->size].pet_age->years);

    printf("\nenter the months of the dog:");
    scanf("%d", &log->array[log->size].pet_age->months);
printf("\nend of new_stray");
    log->size  ;
    return 0;
}



int main(int argc, char const *argv[])
{
    int choice;
    //int idcount=0;
    //int bytesize=0,onelogsize=0,
    int idtoDelete=-1;
    petCatalog log;
    
    
    log.array=(pet*)malloc(sizeof(pet)*N);
    log.cap=N;
    log.size=0;
    log.virginSlots=N;
    log.awaitDelete=0;

        while(1){
        menu();
            printf("Enter your choice:");
            scanf("%d", &choice);
                if(choice==1){
                    if(log.virginSlots<=DOWNLIM){
                        log.array=(pet*)realloc(log.array,sizeof(pet)*(log.size EXTRA));
                            if(log.array==NULL){
                                printf("failed to realloc!");
                                exit(EXIT_FAILURE);
                            }
                        log.cap=log.cap EXTRA;
                    }
                    log.array[log.size].id=log.size;
                    new_stray(&log);                
                    printf("\nlog.size is :%d",log.size);
                }else if(choice==2){
                    printf("\nEnter id to delete:");
                    scanf("%d",&idtoDelete);
                    delete(&log,idtoDelete);
                }
            log.virginSlots=log.cap-log.size-log.awaitDelete;
        }//end of while
    return 0;
}//end of main

uj5u.com熱心網友回復：

你的代碼太復雜了：你為什么要把pet結構放在陣列的末尾？只需釋放分配的欄位，將元素復制到位，如果低于某個閾值，則可能重新分配陣列。在這里，深度復制是矯枉過正的。為 使用分配的結構age似乎也沒有必要，并且STRLIM為字串分配位元組似乎既浪費又不安全，因為您沒有檢查原始字串長度是否至多為STRLIM-1。你應該strdup()改用。

這是一個簡化版本：

int delete(petCatalog *log, int idtoDelete) {
    //search to find which log has the id to delete.
    for (int i = 0; i < log->size; i  ) {
        if (log->array[i].id == idtoDelete) {
            // free the element data
            free(log->array[i].sex);
            free(log->array[i].breed);
            free(log->array[i].pet_age);
            // copy the remaining elements over the deleted entry
            memmove(&log->array[i], &log->array[i   1], (log->size - i - 1) * sizeof(log->array[i]));
            log->size--;
            if (log->cap - log->size >= DOWNLIM) {
                // shrink the array, cannot fail.
                int new_cap = log->size   2; // what ever you shrink it to.
                pet *new_array = realloc(log->array, new_cap * sizeof(log->array[0]));
                if (new_array != NULL) {
                    log->array = new_array;
                    log->cap = new_cap;
                }
            }
            // no need to sort after deleting an element
            return 1;  // element was deleted
        }
    }
    return 0;  // element was not found
}

轉載請註明出處，本文鏈接：https://www.uj5u.com/houduan/361320.html

標籤：c malloc heap-memory valgrind realloc

上一篇：C中結構陣列中的指標問題

下一篇：如何使用c編程將一些字串從檔案復制到另一個檔案

標籤雲
其他(157675) Python(38076) JavaScript(25376) Java(17977) C(15215) 區塊鏈(8255) C＃(7972) AI(7469) 爪哇(7425) MySQL(7132) html(6777) 基礎類(6313) sql(6102) 熊猫(6058) PHP(5869) 数组(5741) R(5409) Linux(5327) 反应(5209) 腳本語言(PerlPython)(5129) 非技術區(4971) Android(4554) 数据框(4311) css(4259) 节点.js(4032) C語言(3288) json(3245) 列表(3129) 扑(3119) C++語言(3117) 安卓(2998) 打字稿(2995) VBA(2789) Java相關(2746) 疑難問題(2699) 细绳(2522) 單片機工控(2479) iOS(2429) ASP.NET(2402) MongoDB(2323) 麻木的(2285) 正则表达式(2254) 字典(2211) 循环(2198) 迅速(2185) 擅长(2169) 镖(2155) 功能(1967) .NET技术(1958) Web開發(1951) python-3.x(1918) HtmlCss(1915) 弹簧靴(1913) C++(1909) xml(1889) PostgreSQL(1872) .NETCore(1853) 谷歌表格(1846) Unity3D(1843) for循环(1842)

熱門瀏覽
  • 【C++】Microsoft C++、C 和匯編程式檔案

    ......

    uj5u.com 2020-09-10 00:57:23 more
  • 例外宣告

    相比于斷言適用于排除邏輯上不可能存在的狀態，例外通常是用于邏輯上可能發生的錯誤。 例外宣告 Item 1：當函式不可能拋出例外或不能接受拋出例外時，使用noexcept 理由 如果不打算拋出例外的話，程式就會認為無法處理這種錯誤，并且應當盡早終止，如此可以有效地阻止例外的傳播與擴散。 示例 //不可 ......

    uj5u.com 2020-09-10 00:57:27 more
  • Codeforces 1400E Clear the Multiset(貪心 + 分治)

    鏈接：https://codeforces.com/problemset/problem/1400/E 來源：Codeforces 思路：給你一個陣列，現在你可以進行兩種操作，操作1：將一段沒有 0 的區間進行減一的操作，操作2：將 i 位置上的元素歸零。最終問：將這個陣列的全部元素歸零后操作的最少 ......

    uj5u.com 2020-09-10 00:57:30 more
  • UVA11610 【Reverse Prime】

    本人看到此題沒有翻譯，就附帶了一個自己的翻譯版本 思考 這一題，它的第一個要求是找出所有 $7$ 位反向質數及其質因數的個數。 我們應該需要質數篩篩選1~$10^{7}$的所有數，這里就不慢慢介紹了。但是，重讀題，我們突然發現反向質數都是 $7$ 位，而將它反過來后的數字卻是 $6$ 位數，這就說明 ......

    uj5u.com 2020-09-10 00:57:36 more
  • 統計區間素數數量

    1 #pragma GCC optimize(2) 2 #include <bits/stdc++.h> 3 using namespace std; 4 bool isprime[1000000010]; 5 vector<int> prime; 6 inline int getlist(int ......

    uj5u.com 2020-09-10 00:57:47 more
  • C/C++編程筆記：C++中的 const 變數詳解，教你正確認識const用法

    1、C中的const 1、區域const變數存放在堆疊區中，會分配記憶體（也就是說可以通過地址間接修改變數的值）。測驗代碼如下： 運行結果： 2、全域const變數存放在只讀資料段（不能通過地址修改，會發生寫入錯誤）， 默認為外部聯編，可以給其他源檔案使用（需要用extern關鍵字修飾） 運行結果： ......

    uj5u.com 2020-09-10 00:58:04 more
  • 【C++犯錯記錄】VS2019 MFC添加資源不懂如何修改資源宏ID

    1. 首先在資源視圖中，添加資源 2. 點擊新添加的資源，復制自動生成的ID 3. 在解決方案資源管理器中找到Resource.h檔案，編輯，使用整個專案搜索和替換的方式快速替換 宏宣告 4. Ctrl+Shift+F 全域搜索，點擊查找全部，然后逐個替換 5. 為什么使用搜索替換而不使用屬性視窗直 ......

    uj5u.com 2020-09-10 00:59:11 more
  • 【C++犯錯記錄】VS2019 MFC不懂的批量添加資源

    1. 打開資源頭檔案Resource.h，在其中預先定義好宏 ID（不清楚其實ID值應該設定多少，可以先新建一個相同的資源項，再在這個資源的ID值的基礎上遞增即可） 2. 在資源視圖中選中專案資源，按F7編輯資源檔案，按 ID 型別 相對路徑的形式添加 資源。（別忘了先把檔案拷貝到專案中的res檔案 ......

    uj5u.com 2020-09-10 01:00:19 more
  • C/C++編程筆記：關于C++的參考型別，專供新手入門使用

    今天要講的是C++中我最喜歡的一個用法——參考，也叫別名。 參考就是給一個變數名取一個變數名，方便我們間接地使用這個變數。我們可以給一個變數創建N個參考，這N + 1個變數共享了同一塊記憶體區域。(參考型別的變數會占用記憶體空間，占用的記憶體空間的大小和指標型別的大小是相同的。雖然參考是一個物件的別名，但 ......

    uj5u.com 2020-09-10 01:00:22 more
  • 【C/C++編程筆記】從頭開始學習C ++：初學者完整指南

    眾所周知，C ++的學習曲線陡峭，但是花時間學習這種語言將為您的職業帶來奇跡，并使您與其他開發人員區分開。您會更輕松地學習新語言，形成真正的解決問題的技能，并在編程的基礎上打下堅實的基礎。 C ++將幫助您養成良好的編程習慣（即清晰一致的編碼風格，在撰寫代碼時注釋代碼，并限制類內部的可見性），并且由 ......

    uj5u.com 2020-09-10 01:00:41 more
最新发布
  • Rust中的智能指標:Box<T> Rc<T> Arc<T> Cell<T> RefCell<T> Weak

    Rust中的智能指標是什么 智能指標（smart pointers）是一類資料結構，是擁有資料所有權和額外功能的指標。是指標的進一步發展 指標（pointer）是一個包含記憶體地址的變數的通用概念。這個地址參考，或 ” 指向”（points at）一些其 他資料 。參考以 & 符號為標志并借用了他們所 ......

    uj5u.com 2023-04-20 07:24:10 more
  • Java的值傳遞和參考傳遞

    值傳遞不會改變本身，參考傳遞（如果傳遞的值需要實體化到堆里）如果發生修改了會改變本身。 1.基本資料型別都是值傳遞 package com.example.basic; public class Test { public static void main(String[] args) { int ......

    uj5u.com 2023-04-20 07:24:04 more
  • [2]SpinalHDL教程——Scala簡單入門

    第一個 Scala 程式 shell里面輸入 $ scala scala> 1 + 1 res0: Int = 2 scala> println("Hello World!") Hello World! 檔案形式 object HelloWorld { /* 這是我的第一個 Scala 程式 * 以 ......

    uj5u.com 2023-04-20 07:23:58 more
  • 理解函式指標和回呼函式

    理解 函式指標 指向函式的指標。比如： 理解函式指標的偽代碼 void (*p)(int type, char *data); // 定義一個函式指標p void func(int type, char *data); // 宣告一個函式func p = func; // 將指標p指向函式func ......

    uj5u.com 2023-04-20 07:23:52 more
  • Django筆記二十五之資料庫函式之日期函式

    本文首發于公眾號：Hunter后端 原文鏈接：Django筆記二十五之資料庫函式之日期函式 日期函式主要介紹兩個大類，Extract() 和 Trunc() Extract() 函式作用是提取日期，比如我們可以提取一個日期欄位的年份，月份，日等資料 Trunc() 的作用則是截取，比如 2022-0 ......

    uj5u.com 2023-04-20 07:23:45 more
  • 一天吃透JVM面試八股文

    什么是JVM？ JVM，全稱Java Virtual Machine（Java虛擬機），是通過在實際的計算機上仿真模擬各種計算機功能來實作的。由一套位元組碼指令集、一組暫存器、一個堆疊、一個垃圾回收堆和一個存盤方法域等組成。JVM屏蔽了與作業系統平臺相關的資訊，使得Java程式只需要生成在Java虛擬機 ......

    uj5u.com 2023-04-20 07:23:31 more
  • 使用Java接入小程式訂閱訊息！

    更新完微信服務號的模板訊息之后，我又趕緊把微信小程式的訂閱訊息給實作了！之前我一直以為微信小程式也是要企業才能申請，沒想到小程式個人就能申請。 訊息推送平臺🔥推送下發【郵件】【短信】【微信服務號】【微信小程式】【企業微信】【釘釘】等訊息型別。 https://gitee.com/zhongfuch ......

    uj5u.com 2023-04-20 07:22:59 more
  • java -- 緩沖流、轉換流、序列化流

    緩沖流 緩沖流, 也叫高效流, 按照資料型別分類： 位元組緩沖流：BufferedInputStream，BufferedOutputStream 字符緩沖流：BufferedReader，BufferedWriter 緩沖流的基本原理，是在創建流物件時，會創建一個內置的默認大小的緩沖區陣列，通過緩沖 ......

    uj5u.com 2023-04-20 07:22:49 more
  • Java-SpringBoot-Range請求頭設定實作視頻分段傳輸

    老實說，人太懶了，現在基本都不喜歡寫筆記了，但是網上有關Range請求頭的文章都太水了 下面是抄的一段StackOverflow的代碼...自己大修改過的，寫的注釋挺全的，應該直接看得懂，就不解釋了 寫的不好...只是希望能給視頻網站開發的新手一點點幫助吧. 業務場景：視頻分段傳輸、視頻多段傳輸（理 ......

    uj5u.com 2023-04-20 07:22:42 more
  • Windows 10開發教程_編程入門自學教程_菜鳥教程-免費教程分享

    教程簡介 Windows 10開發入門教程 - 從簡單的步驟了解Windows 10開發，從基本到高級概念，包括簡介，UWP，第一個應用程式，商店，XAML控制元件，資料系結，XAML性能，自適應設計，自適應UI，自適應代碼，檔案管理，SQLite資料庫，應用程式到應用程式通信，應用程式本地化，應用程式 ......

    uj5u.com 2023-04-20 07:22:35 more

Copyright © 2010-2020 有解無憂